1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2015 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_regex.h"
29 #include "expression.h"
30 #include "parser-defs.h"
37 #include "breakpoint.h"
40 #include "gdb_obstack.h"
42 #include "completer.h"
47 #include "dictionary.h"
55 #include "typeprint.h"
56 #include "namespace.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 void ada_add_all_symbols (struct obstack
*, const struct block
*,
113 const char *, domain_enum
, int, int *);
115 static int is_nonfunction (struct block_symbol
*, int);
117 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
118 const struct block
*);
120 static int num_defns_collected (struct obstack
*);
122 static struct block_symbol
*defns_collected (struct obstack
*, int);
124 static struct value
*resolve_subexp (struct expression
**, int *, int,
127 static void replace_operator_with_call (struct expression
**, int, int, int,
128 struct symbol
*, const struct block
*);
130 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
132 static char *ada_op_name (enum exp_opcode
);
134 static const char *ada_decoded_op_name (enum exp_opcode
);
136 static int numeric_type_p (struct type
*);
138 static int integer_type_p (struct type
*);
140 static int scalar_type_p (struct type
*);
142 static int discrete_type_p (struct type
*);
144 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
149 static struct symbol
*find_old_style_renaming_symbol (const char *,
150 const struct block
*);
152 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
155 static struct value
*evaluate_subexp_type (struct expression
*, int *);
157 static struct type
*ada_find_parallel_type_with_name (struct type
*,
160 static int is_dynamic_field (struct type
*, int);
162 static struct type
*to_fixed_variant_branch_type (struct type
*,
164 CORE_ADDR
, struct value
*);
166 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
168 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
170 static struct type
*to_static_fixed_type (struct type
*);
171 static struct type
*static_unwrap_type (struct type
*type
);
173 static struct value
*unwrap_value (struct value
*);
175 static struct type
*constrained_packed_array_type (struct type
*, long *);
177 static struct type
*decode_constrained_packed_array_type (struct type
*);
179 static long decode_packed_array_bitsize (struct type
*);
181 static struct value
*decode_constrained_packed_array (struct value
*);
183 static int ada_is_packed_array_type (struct type
*);
185 static int ada_is_unconstrained_packed_array_type (struct type
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int advance_wild_match (const char **, const char *, int);
205 static int wild_match (const char *, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (const char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static int ada_resolve_function (struct block_symbol
*, int,
231 struct value
**, int, const char *,
234 static int ada_is_direct_array_type (struct type
*);
236 static void ada_language_arch_info (struct gdbarch
*,
237 struct language_arch_info
*);
239 static struct value
*ada_index_struct_field (int, struct value
*, int,
242 static struct value
*assign_aggregate (struct value
*, struct value
*,
246 static void aggregate_assign_from_choices (struct value
*, struct value
*,
248 int *, LONGEST
*, int *,
249 int, LONGEST
, LONGEST
);
251 static void aggregate_assign_positional (struct value
*, struct value
*,
253 int *, LONGEST
*, int *, int,
257 static void aggregate_assign_others (struct value
*, struct value
*,
259 int *, LONGEST
*, int, LONGEST
, LONGEST
);
262 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
265 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
268 static void ada_forward_operator_length (struct expression
*, int, int *,
271 static struct type
*ada_find_any_type (const char *name
);
274 /* The result of a symbol lookup to be stored in our symbol cache. */
278 /* The name used to perform the lookup. */
280 /* The namespace used during the lookup. */
282 /* The symbol returned by the lookup, or NULL if no matching symbol
285 /* The block where the symbol was found, or NULL if no matching
287 const struct block
*block
;
288 /* A pointer to the next entry with the same hash. */
289 struct cache_entry
*next
;
292 /* The Ada symbol cache, used to store the result of Ada-mode symbol
293 lookups in the course of executing the user's commands.
295 The cache is implemented using a simple, fixed-sized hash.
296 The size is fixed on the grounds that there are not likely to be
297 all that many symbols looked up during any given session, regardless
298 of the size of the symbol table. If we decide to go to a resizable
299 table, let's just use the stuff from libiberty instead. */
301 #define HASH_SIZE 1009
303 struct ada_symbol_cache
305 /* An obstack used to store the entries in our cache. */
306 struct obstack cache_space
;
308 /* The root of the hash table used to implement our symbol cache. */
309 struct cache_entry
*root
[HASH_SIZE
];
312 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
314 /* Maximum-sized dynamic type. */
315 static unsigned int varsize_limit
;
317 /* FIXME: brobecker/2003-09-17: No longer a const because it is
318 returned by a function that does not return a const char *. */
319 static char *ada_completer_word_break_characters
=
321 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
323 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
326 /* The name of the symbol to use to get the name of the main subprogram. */
327 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
328 = "__gnat_ada_main_program_name";
330 /* Limit on the number of warnings to raise per expression evaluation. */
331 static int warning_limit
= 2;
333 /* Number of warning messages issued; reset to 0 by cleanups after
334 expression evaluation. */
335 static int warnings_issued
= 0;
337 static const char *known_runtime_file_name_patterns
[] = {
338 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
341 static const char *known_auxiliary_function_name_patterns
[] = {
342 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
345 /* Space for allocating results of ada_lookup_symbol_list. */
346 static struct obstack symbol_list_obstack
;
348 /* Maintenance-related settings for this module. */
350 static struct cmd_list_element
*maint_set_ada_cmdlist
;
351 static struct cmd_list_element
*maint_show_ada_cmdlist
;
353 /* Implement the "maintenance set ada" (prefix) command. */
356 maint_set_ada_cmd (char *args
, int from_tty
)
358 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
362 /* Implement the "maintenance show ada" (prefix) command. */
365 maint_show_ada_cmd (char *args
, int from_tty
)
367 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
370 /* The "maintenance ada set/show ignore-descriptive-type" value. */
372 static int ada_ignore_descriptive_types_p
= 0;
374 /* Inferior-specific data. */
376 /* Per-inferior data for this module. */
378 struct ada_inferior_data
380 /* The ada__tags__type_specific_data type, which is used when decoding
381 tagged types. With older versions of GNAT, this type was directly
382 accessible through a component ("tsd") in the object tag. But this
383 is no longer the case, so we cache it for each inferior. */
384 struct type
*tsd_type
;
386 /* The exception_support_info data. This data is used to determine
387 how to implement support for Ada exception catchpoints in a given
389 const struct exception_support_info
*exception_info
;
392 /* Our key to this module's inferior data. */
393 static const struct inferior_data
*ada_inferior_data
;
395 /* A cleanup routine for our inferior data. */
397 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
399 struct ada_inferior_data
*data
;
401 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
406 /* Return our inferior data for the given inferior (INF).
408 This function always returns a valid pointer to an allocated
409 ada_inferior_data structure. If INF's inferior data has not
410 been previously set, this functions creates a new one with all
411 fields set to zero, sets INF's inferior to it, and then returns
412 a pointer to that newly allocated ada_inferior_data. */
414 static struct ada_inferior_data
*
415 get_ada_inferior_data (struct inferior
*inf
)
417 struct ada_inferior_data
*data
;
419 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
422 data
= XCNEW (struct ada_inferior_data
);
423 set_inferior_data (inf
, ada_inferior_data
, data
);
429 /* Perform all necessary cleanups regarding our module's inferior data
430 that is required after the inferior INF just exited. */
433 ada_inferior_exit (struct inferior
*inf
)
435 ada_inferior_data_cleanup (inf
, NULL
);
436 set_inferior_data (inf
, ada_inferior_data
, NULL
);
440 /* program-space-specific data. */
442 /* This module's per-program-space data. */
443 struct ada_pspace_data
445 /* The Ada symbol cache. */
446 struct ada_symbol_cache
*sym_cache
;
449 /* Key to our per-program-space data. */
450 static const struct program_space_data
*ada_pspace_data_handle
;
452 /* Return this module's data for the given program space (PSPACE).
453 If not is found, add a zero'ed one now.
455 This function always returns a valid object. */
457 static struct ada_pspace_data
*
458 get_ada_pspace_data (struct program_space
*pspace
)
460 struct ada_pspace_data
*data
;
462 data
= ((struct ada_pspace_data
*)
463 program_space_data (pspace
, ada_pspace_data_handle
));
466 data
= XCNEW (struct ada_pspace_data
);
467 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
473 /* The cleanup callback for this module's per-program-space data. */
476 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
478 struct ada_pspace_data
*pspace_data
= (struct ada_pspace_data
*) data
;
480 if (pspace_data
->sym_cache
!= NULL
)
481 ada_free_symbol_cache (pspace_data
->sym_cache
);
487 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
488 all typedef layers have been peeled. Otherwise, return TYPE.
490 Normally, we really expect a typedef type to only have 1 typedef layer.
491 In other words, we really expect the target type of a typedef type to be
492 a non-typedef type. This is particularly true for Ada units, because
493 the language does not have a typedef vs not-typedef distinction.
494 In that respect, the Ada compiler has been trying to eliminate as many
495 typedef definitions in the debugging information, since they generally
496 do not bring any extra information (we still use typedef under certain
497 circumstances related mostly to the GNAT encoding).
499 Unfortunately, we have seen situations where the debugging information
500 generated by the compiler leads to such multiple typedef layers. For
501 instance, consider the following example with stabs:
503 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
504 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
506 This is an error in the debugging information which causes type
507 pck__float_array___XUP to be defined twice, and the second time,
508 it is defined as a typedef of a typedef.
510 This is on the fringe of legality as far as debugging information is
511 concerned, and certainly unexpected. But it is easy to handle these
512 situations correctly, so we can afford to be lenient in this case. */
515 ada_typedef_target_type (struct type
*type
)
517 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
518 type
= TYPE_TARGET_TYPE (type
);
522 /* Given DECODED_NAME a string holding a symbol name in its
523 decoded form (ie using the Ada dotted notation), returns
524 its unqualified name. */
527 ada_unqualified_name (const char *decoded_name
)
531 /* If the decoded name starts with '<', it means that the encoded
532 name does not follow standard naming conventions, and thus that
533 it is not your typical Ada symbol name. Trying to unqualify it
534 is therefore pointless and possibly erroneous. */
535 if (decoded_name
[0] == '<')
538 result
= strrchr (decoded_name
, '.');
540 result
++; /* Skip the dot... */
542 result
= decoded_name
;
547 /* Return a string starting with '<', followed by STR, and '>'.
548 The result is good until the next call. */
551 add_angle_brackets (const char *str
)
553 static char *result
= NULL
;
556 result
= xstrprintf ("<%s>", str
);
561 ada_get_gdb_completer_word_break_characters (void)
563 return ada_completer_word_break_characters
;
566 /* Print an array element index using the Ada syntax. */
569 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
570 const struct value_print_options
*options
)
572 LA_VALUE_PRINT (index_value
, stream
, options
);
573 fprintf_filtered (stream
, " => ");
576 /* Assuming VECT points to an array of *SIZE objects of size
577 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
578 updating *SIZE as necessary and returning the (new) array. */
581 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
583 if (*size
< min_size
)
586 if (*size
< min_size
)
588 vect
= xrealloc (vect
, *size
* element_size
);
593 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
594 suffix of FIELD_NAME beginning "___". */
597 field_name_match (const char *field_name
, const char *target
)
599 int len
= strlen (target
);
602 (strncmp (field_name
, target
, len
) == 0
603 && (field_name
[len
] == '\0'
604 || (startswith (field_name
+ len
, "___")
605 && strcmp (field_name
+ strlen (field_name
) - 6,
610 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
611 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
612 and return its index. This function also handles fields whose name
613 have ___ suffixes because the compiler sometimes alters their name
614 by adding such a suffix to represent fields with certain constraints.
615 If the field could not be found, return a negative number if
616 MAYBE_MISSING is set. Otherwise raise an error. */
619 ada_get_field_index (const struct type
*type
, const char *field_name
,
623 struct type
*struct_type
= check_typedef ((struct type
*) type
);
625 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
626 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
630 error (_("Unable to find field %s in struct %s. Aborting"),
631 field_name
, TYPE_NAME (struct_type
));
636 /* The length of the prefix of NAME prior to any "___" suffix. */
639 ada_name_prefix_len (const char *name
)
645 const char *p
= strstr (name
, "___");
648 return strlen (name
);
654 /* Return non-zero if SUFFIX is a suffix of STR.
655 Return zero if STR is null. */
658 is_suffix (const char *str
, const char *suffix
)
665 len2
= strlen (suffix
);
666 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
669 /* The contents of value VAL, treated as a value of type TYPE. The
670 result is an lval in memory if VAL is. */
672 static struct value
*
673 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
675 type
= ada_check_typedef (type
);
676 if (value_type (val
) == type
)
680 struct value
*result
;
682 /* Make sure that the object size is not unreasonable before
683 trying to allocate some memory for it. */
684 ada_ensure_varsize_limit (type
);
687 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
688 result
= allocate_value_lazy (type
);
691 result
= allocate_value (type
);
692 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
694 set_value_component_location (result
, val
);
695 set_value_bitsize (result
, value_bitsize (val
));
696 set_value_bitpos (result
, value_bitpos (val
));
697 set_value_address (result
, value_address (val
));
702 static const gdb_byte
*
703 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
708 return valaddr
+ offset
;
712 cond_offset_target (CORE_ADDR address
, long offset
)
717 return address
+ offset
;
720 /* Issue a warning (as for the definition of warning in utils.c, but
721 with exactly one argument rather than ...), unless the limit on the
722 number of warnings has passed during the evaluation of the current
725 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
726 provided by "complaint". */
727 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
730 lim_warning (const char *format
, ...)
734 va_start (args
, format
);
735 warnings_issued
+= 1;
736 if (warnings_issued
<= warning_limit
)
737 vwarning (format
, args
);
742 /* Issue an error if the size of an object of type T is unreasonable,
743 i.e. if it would be a bad idea to allocate a value of this type in
747 ada_ensure_varsize_limit (const struct type
*type
)
749 if (TYPE_LENGTH (type
) > varsize_limit
)
750 error (_("object size is larger than varsize-limit"));
753 /* Maximum value of a SIZE-byte signed integer type. */
755 max_of_size (int size
)
757 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
759 return top_bit
| (top_bit
- 1);
762 /* Minimum value of a SIZE-byte signed integer type. */
764 min_of_size (int size
)
766 return -max_of_size (size
) - 1;
769 /* Maximum value of a SIZE-byte unsigned integer type. */
771 umax_of_size (int size
)
773 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
775 return top_bit
| (top_bit
- 1);
778 /* Maximum value of integral type T, as a signed quantity. */
780 max_of_type (struct type
*t
)
782 if (TYPE_UNSIGNED (t
))
783 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
785 return max_of_size (TYPE_LENGTH (t
));
788 /* Minimum value of integral type T, as a signed quantity. */
790 min_of_type (struct type
*t
)
792 if (TYPE_UNSIGNED (t
))
795 return min_of_size (TYPE_LENGTH (t
));
798 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
800 ada_discrete_type_high_bound (struct type
*type
)
802 type
= resolve_dynamic_type (type
, NULL
, 0);
803 switch (TYPE_CODE (type
))
805 case TYPE_CODE_RANGE
:
806 return TYPE_HIGH_BOUND (type
);
808 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
813 return max_of_type (type
);
815 error (_("Unexpected type in ada_discrete_type_high_bound."));
819 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
821 ada_discrete_type_low_bound (struct type
*type
)
823 type
= resolve_dynamic_type (type
, NULL
, 0);
824 switch (TYPE_CODE (type
))
826 case TYPE_CODE_RANGE
:
827 return TYPE_LOW_BOUND (type
);
829 return TYPE_FIELD_ENUMVAL (type
, 0);
834 return min_of_type (type
);
836 error (_("Unexpected type in ada_discrete_type_low_bound."));
840 /* The identity on non-range types. For range types, the underlying
841 non-range scalar type. */
844 get_base_type (struct type
*type
)
846 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
848 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
850 type
= TYPE_TARGET_TYPE (type
);
855 /* Return a decoded version of the given VALUE. This means returning
856 a value whose type is obtained by applying all the GNAT-specific
857 encondings, making the resulting type a static but standard description
858 of the initial type. */
861 ada_get_decoded_value (struct value
*value
)
863 struct type
*type
= ada_check_typedef (value_type (value
));
865 if (ada_is_array_descriptor_type (type
)
866 || (ada_is_constrained_packed_array_type (type
)
867 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
869 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
870 value
= ada_coerce_to_simple_array_ptr (value
);
872 value
= ada_coerce_to_simple_array (value
);
875 value
= ada_to_fixed_value (value
);
880 /* Same as ada_get_decoded_value, but with the given TYPE.
881 Because there is no associated actual value for this type,
882 the resulting type might be a best-effort approximation in
883 the case of dynamic types. */
886 ada_get_decoded_type (struct type
*type
)
888 type
= to_static_fixed_type (type
);
889 if (ada_is_constrained_packed_array_type (type
))
890 type
= ada_coerce_to_simple_array_type (type
);
896 /* Language Selection */
898 /* If the main program is in Ada, return language_ada, otherwise return LANG
899 (the main program is in Ada iif the adainit symbol is found). */
902 ada_update_initial_language (enum language lang
)
904 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
905 (struct objfile
*) NULL
).minsym
!= NULL
)
911 /* If the main procedure is written in Ada, then return its name.
912 The result is good until the next call. Return NULL if the main
913 procedure doesn't appear to be in Ada. */
918 struct bound_minimal_symbol msym
;
919 static char *main_program_name
= NULL
;
921 /* For Ada, the name of the main procedure is stored in a specific
922 string constant, generated by the binder. Look for that symbol,
923 extract its address, and then read that string. If we didn't find
924 that string, then most probably the main procedure is not written
926 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
928 if (msym
.minsym
!= NULL
)
930 CORE_ADDR main_program_name_addr
;
933 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
934 if (main_program_name_addr
== 0)
935 error (_("Invalid address for Ada main program name."));
937 xfree (main_program_name
);
938 target_read_string (main_program_name_addr
, &main_program_name
,
943 return main_program_name
;
946 /* The main procedure doesn't seem to be in Ada. */
952 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
955 const struct ada_opname_map ada_opname_table
[] = {
956 {"Oadd", "\"+\"", BINOP_ADD
},
957 {"Osubtract", "\"-\"", BINOP_SUB
},
958 {"Omultiply", "\"*\"", BINOP_MUL
},
959 {"Odivide", "\"/\"", BINOP_DIV
},
960 {"Omod", "\"mod\"", BINOP_MOD
},
961 {"Orem", "\"rem\"", BINOP_REM
},
962 {"Oexpon", "\"**\"", BINOP_EXP
},
963 {"Olt", "\"<\"", BINOP_LESS
},
964 {"Ole", "\"<=\"", BINOP_LEQ
},
965 {"Ogt", "\">\"", BINOP_GTR
},
966 {"Oge", "\">=\"", BINOP_GEQ
},
967 {"Oeq", "\"=\"", BINOP_EQUAL
},
968 {"One", "\"/=\"", BINOP_NOTEQUAL
},
969 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
970 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
971 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
972 {"Oconcat", "\"&\"", BINOP_CONCAT
},
973 {"Oabs", "\"abs\"", UNOP_ABS
},
974 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
975 {"Oadd", "\"+\"", UNOP_PLUS
},
976 {"Osubtract", "\"-\"", UNOP_NEG
},
980 /* The "encoded" form of DECODED, according to GNAT conventions.
981 The result is valid until the next call to ada_encode. */
984 ada_encode (const char *decoded
)
986 static char *encoding_buffer
= NULL
;
987 static size_t encoding_buffer_size
= 0;
994 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
995 2 * strlen (decoded
) + 10);
998 for (p
= decoded
; *p
!= '\0'; p
+= 1)
1002 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
1007 const struct ada_opname_map
*mapping
;
1009 for (mapping
= ada_opname_table
;
1010 mapping
->encoded
!= NULL
1011 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
1013 if (mapping
->encoded
== NULL
)
1014 error (_("invalid Ada operator name: %s"), p
);
1015 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1016 k
+= strlen (mapping
->encoded
);
1021 encoding_buffer
[k
] = *p
;
1026 encoding_buffer
[k
] = '\0';
1027 return encoding_buffer
;
1030 /* Return NAME folded to lower case, or, if surrounded by single
1031 quotes, unfolded, but with the quotes stripped away. Result good
1035 ada_fold_name (const char *name
)
1037 static char *fold_buffer
= NULL
;
1038 static size_t fold_buffer_size
= 0;
1040 int len
= strlen (name
);
1041 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1043 if (name
[0] == '\'')
1045 strncpy (fold_buffer
, name
+ 1, len
- 2);
1046 fold_buffer
[len
- 2] = '\000';
1052 for (i
= 0; i
<= len
; i
+= 1)
1053 fold_buffer
[i
] = tolower (name
[i
]);
1059 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1062 is_lower_alphanum (const char c
)
1064 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1067 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1068 This function saves in LEN the length of that same symbol name but
1069 without either of these suffixes:
1075 These are suffixes introduced by the compiler for entities such as
1076 nested subprogram for instance, in order to avoid name clashes.
1077 They do not serve any purpose for the debugger. */
1080 ada_remove_trailing_digits (const char *encoded
, int *len
)
1082 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1086 while (i
> 0 && isdigit (encoded
[i
]))
1088 if (i
>= 0 && encoded
[i
] == '.')
1090 else if (i
>= 0 && encoded
[i
] == '$')
1092 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1094 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1099 /* Remove the suffix introduced by the compiler for protected object
1103 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1105 /* Remove trailing N. */
1107 /* Protected entry subprograms are broken into two
1108 separate subprograms: The first one is unprotected, and has
1109 a 'N' suffix; the second is the protected version, and has
1110 the 'P' suffix. The second calls the first one after handling
1111 the protection. Since the P subprograms are internally generated,
1112 we leave these names undecoded, giving the user a clue that this
1113 entity is internal. */
1116 && encoded
[*len
- 1] == 'N'
1117 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1121 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1124 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1128 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1131 if (encoded
[i
] != 'X')
1137 if (isalnum (encoded
[i
-1]))
1141 /* If ENCODED follows the GNAT entity encoding conventions, then return
1142 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1143 replaced by ENCODED.
1145 The resulting string is valid until the next call of ada_decode.
1146 If the string is unchanged by decoding, the original string pointer
1150 ada_decode (const char *encoded
)
1157 static char *decoding_buffer
= NULL
;
1158 static size_t decoding_buffer_size
= 0;
1160 /* The name of the Ada main procedure starts with "_ada_".
1161 This prefix is not part of the decoded name, so skip this part
1162 if we see this prefix. */
1163 if (startswith (encoded
, "_ada_"))
1166 /* If the name starts with '_', then it is not a properly encoded
1167 name, so do not attempt to decode it. Similarly, if the name
1168 starts with '<', the name should not be decoded. */
1169 if (encoded
[0] == '_' || encoded
[0] == '<')
1172 len0
= strlen (encoded
);
1174 ada_remove_trailing_digits (encoded
, &len0
);
1175 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1177 /* Remove the ___X.* suffix if present. Do not forget to verify that
1178 the suffix is located before the current "end" of ENCODED. We want
1179 to avoid re-matching parts of ENCODED that have previously been
1180 marked as discarded (by decrementing LEN0). */
1181 p
= strstr (encoded
, "___");
1182 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1190 /* Remove any trailing TKB suffix. It tells us that this symbol
1191 is for the body of a task, but that information does not actually
1192 appear in the decoded name. */
1194 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1197 /* Remove any trailing TB suffix. The TB suffix is slightly different
1198 from the TKB suffix because it is used for non-anonymous task
1201 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1204 /* Remove trailing "B" suffixes. */
1205 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1207 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1210 /* Make decoded big enough for possible expansion by operator name. */
1212 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1213 decoded
= decoding_buffer
;
1215 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1217 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1220 while ((i
>= 0 && isdigit (encoded
[i
]))
1221 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1223 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1225 else if (encoded
[i
] == '$')
1229 /* The first few characters that are not alphabetic are not part
1230 of any encoding we use, so we can copy them over verbatim. */
1232 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1233 decoded
[j
] = encoded
[i
];
1238 /* Is this a symbol function? */
1239 if (at_start_name
&& encoded
[i
] == 'O')
1243 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1245 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1246 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1248 && !isalnum (encoded
[i
+ op_len
]))
1250 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1253 j
+= strlen (ada_opname_table
[k
].decoded
);
1257 if (ada_opname_table
[k
].encoded
!= NULL
)
1262 /* Replace "TK__" with "__", which will eventually be translated
1263 into "." (just below). */
1265 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1268 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1269 be translated into "." (just below). These are internal names
1270 generated for anonymous blocks inside which our symbol is nested. */
1272 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1273 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1274 && isdigit (encoded
[i
+4]))
1278 while (k
< len0
&& isdigit (encoded
[k
]))
1279 k
++; /* Skip any extra digit. */
1281 /* Double-check that the "__B_{DIGITS}+" sequence we found
1282 is indeed followed by "__". */
1283 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1287 /* Remove _E{DIGITS}+[sb] */
1289 /* Just as for protected object subprograms, there are 2 categories
1290 of subprograms created by the compiler for each entry. The first
1291 one implements the actual entry code, and has a suffix following
1292 the convention above; the second one implements the barrier and
1293 uses the same convention as above, except that the 'E' is replaced
1296 Just as above, we do not decode the name of barrier functions
1297 to give the user a clue that the code he is debugging has been
1298 internally generated. */
1300 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1301 && isdigit (encoded
[i
+2]))
1305 while (k
< len0
&& isdigit (encoded
[k
]))
1309 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1312 /* Just as an extra precaution, make sure that if this
1313 suffix is followed by anything else, it is a '_'.
1314 Otherwise, we matched this sequence by accident. */
1316 || (k
< len0
&& encoded
[k
] == '_'))
1321 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1322 the GNAT front-end in protected object subprograms. */
1325 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1327 /* Backtrack a bit up until we reach either the begining of
1328 the encoded name, or "__". Make sure that we only find
1329 digits or lowercase characters. */
1330 const char *ptr
= encoded
+ i
- 1;
1332 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1335 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1339 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1341 /* This is a X[bn]* sequence not separated from the previous
1342 part of the name with a non-alpha-numeric character (in other
1343 words, immediately following an alpha-numeric character), then
1344 verify that it is placed at the end of the encoded name. If
1345 not, then the encoding is not valid and we should abort the
1346 decoding. Otherwise, just skip it, it is used in body-nested
1350 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1354 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1356 /* Replace '__' by '.'. */
1364 /* It's a character part of the decoded name, so just copy it
1366 decoded
[j
] = encoded
[i
];
1371 decoded
[j
] = '\000';
1373 /* Decoded names should never contain any uppercase character.
1374 Double-check this, and abort the decoding if we find one. */
1376 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1377 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1380 if (strcmp (decoded
, encoded
) == 0)
1386 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1387 decoded
= decoding_buffer
;
1388 if (encoded
[0] == '<')
1389 strcpy (decoded
, encoded
);
1391 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1396 /* Table for keeping permanent unique copies of decoded names. Once
1397 allocated, names in this table are never released. While this is a
1398 storage leak, it should not be significant unless there are massive
1399 changes in the set of decoded names in successive versions of a
1400 symbol table loaded during a single session. */
1401 static struct htab
*decoded_names_store
;
1403 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1404 in the language-specific part of GSYMBOL, if it has not been
1405 previously computed. Tries to save the decoded name in the same
1406 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1407 in any case, the decoded symbol has a lifetime at least that of
1409 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1410 const, but nevertheless modified to a semantically equivalent form
1411 when a decoded name is cached in it. */
1414 ada_decode_symbol (const struct general_symbol_info
*arg
)
1416 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1417 const char **resultp
=
1418 &gsymbol
->language_specific
.demangled_name
;
1420 if (!gsymbol
->ada_mangled
)
1422 const char *decoded
= ada_decode (gsymbol
->name
);
1423 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1425 gsymbol
->ada_mangled
= 1;
1427 if (obstack
!= NULL
)
1429 = (const char *) obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1432 /* Sometimes, we can't find a corresponding objfile, in
1433 which case, we put the result on the heap. Since we only
1434 decode when needed, we hope this usually does not cause a
1435 significant memory leak (FIXME). */
1437 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1441 *slot
= xstrdup (decoded
);
1450 ada_la_decode (const char *encoded
, int options
)
1452 return xstrdup (ada_decode (encoded
));
1455 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1456 suffixes that encode debugging information or leading _ada_ on
1457 SYM_NAME (see is_name_suffix commentary for the debugging
1458 information that is ignored). If WILD, then NAME need only match a
1459 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1460 either argument is NULL. */
1463 match_name (const char *sym_name
, const char *name
, int wild
)
1465 if (sym_name
== NULL
|| name
== NULL
)
1468 return wild_match (sym_name
, name
) == 0;
1471 int len_name
= strlen (name
);
1473 return (strncmp (sym_name
, name
, len_name
) == 0
1474 && is_name_suffix (sym_name
+ len_name
))
1475 || (startswith (sym_name
, "_ada_")
1476 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1477 && is_name_suffix (sym_name
+ len_name
+ 5));
1484 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1485 generated by the GNAT compiler to describe the index type used
1486 for each dimension of an array, check whether it follows the latest
1487 known encoding. If not, fix it up to conform to the latest encoding.
1488 Otherwise, do nothing. This function also does nothing if
1489 INDEX_DESC_TYPE is NULL.
1491 The GNAT encoding used to describle the array index type evolved a bit.
1492 Initially, the information would be provided through the name of each
1493 field of the structure type only, while the type of these fields was
1494 described as unspecified and irrelevant. The debugger was then expected
1495 to perform a global type lookup using the name of that field in order
1496 to get access to the full index type description. Because these global
1497 lookups can be very expensive, the encoding was later enhanced to make
1498 the global lookup unnecessary by defining the field type as being
1499 the full index type description.
1501 The purpose of this routine is to allow us to support older versions
1502 of the compiler by detecting the use of the older encoding, and by
1503 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1504 we essentially replace each field's meaningless type by the associated
1508 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1512 if (index_desc_type
== NULL
)
1514 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1516 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1517 to check one field only, no need to check them all). If not, return
1520 If our INDEX_DESC_TYPE was generated using the older encoding,
1521 the field type should be a meaningless integer type whose name
1522 is not equal to the field name. */
1523 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1524 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1525 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1528 /* Fixup each field of INDEX_DESC_TYPE. */
1529 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1531 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1532 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1535 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1539 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1541 static char *bound_name
[] = {
1542 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1543 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1546 /* Maximum number of array dimensions we are prepared to handle. */
1548 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1551 /* The desc_* routines return primitive portions of array descriptors
1554 /* The descriptor or array type, if any, indicated by TYPE; removes
1555 level of indirection, if needed. */
1557 static struct type
*
1558 desc_base_type (struct type
*type
)
1562 type
= ada_check_typedef (type
);
1563 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1564 type
= ada_typedef_target_type (type
);
1567 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1568 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1569 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1574 /* True iff TYPE indicates a "thin" array pointer type. */
1577 is_thin_pntr (struct type
*type
)
1580 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1581 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1584 /* The descriptor type for thin pointer type TYPE. */
1586 static struct type
*
1587 thin_descriptor_type (struct type
*type
)
1589 struct type
*base_type
= desc_base_type (type
);
1591 if (base_type
== NULL
)
1593 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1597 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1599 if (alt_type
== NULL
)
1606 /* A pointer to the array data for thin-pointer value VAL. */
1608 static struct value
*
1609 thin_data_pntr (struct value
*val
)
1611 struct type
*type
= ada_check_typedef (value_type (val
));
1612 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1614 data_type
= lookup_pointer_type (data_type
);
1616 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1617 return value_cast (data_type
, value_copy (val
));
1619 return value_from_longest (data_type
, value_address (val
));
1622 /* True iff TYPE indicates a "thick" array pointer type. */
1625 is_thick_pntr (struct type
*type
)
1627 type
= desc_base_type (type
);
1628 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1629 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1632 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1633 pointer to one, the type of its bounds data; otherwise, NULL. */
1635 static struct type
*
1636 desc_bounds_type (struct type
*type
)
1640 type
= desc_base_type (type
);
1644 else if (is_thin_pntr (type
))
1646 type
= thin_descriptor_type (type
);
1649 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1651 return ada_check_typedef (r
);
1653 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1655 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1657 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1662 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1663 one, a pointer to its bounds data. Otherwise NULL. */
1665 static struct value
*
1666 desc_bounds (struct value
*arr
)
1668 struct type
*type
= ada_check_typedef (value_type (arr
));
1670 if (is_thin_pntr (type
))
1672 struct type
*bounds_type
=
1673 desc_bounds_type (thin_descriptor_type (type
));
1676 if (bounds_type
== NULL
)
1677 error (_("Bad GNAT array descriptor"));
1679 /* NOTE: The following calculation is not really kosher, but
1680 since desc_type is an XVE-encoded type (and shouldn't be),
1681 the correct calculation is a real pain. FIXME (and fix GCC). */
1682 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1683 addr
= value_as_long (arr
);
1685 addr
= value_address (arr
);
1688 value_from_longest (lookup_pointer_type (bounds_type
),
1689 addr
- TYPE_LENGTH (bounds_type
));
1692 else if (is_thick_pntr (type
))
1694 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1695 _("Bad GNAT array descriptor"));
1696 struct type
*p_bounds_type
= value_type (p_bounds
);
1699 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1701 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1703 if (TYPE_STUB (target_type
))
1704 p_bounds
= value_cast (lookup_pointer_type
1705 (ada_check_typedef (target_type
)),
1709 error (_("Bad GNAT array descriptor"));
1717 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1718 position of the field containing the address of the bounds data. */
1721 fat_pntr_bounds_bitpos (struct type
*type
)
1723 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1726 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1727 size of the field containing the address of the bounds data. */
1730 fat_pntr_bounds_bitsize (struct type
*type
)
1732 type
= desc_base_type (type
);
1734 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1735 return TYPE_FIELD_BITSIZE (type
, 1);
1737 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1740 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1741 pointer to one, the type of its array data (a array-with-no-bounds type);
1742 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1745 static struct type
*
1746 desc_data_target_type (struct type
*type
)
1748 type
= desc_base_type (type
);
1750 /* NOTE: The following is bogus; see comment in desc_bounds. */
1751 if (is_thin_pntr (type
))
1752 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1753 else if (is_thick_pntr (type
))
1755 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1758 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1759 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1765 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1768 static struct value
*
1769 desc_data (struct value
*arr
)
1771 struct type
*type
= value_type (arr
);
1773 if (is_thin_pntr (type
))
1774 return thin_data_pntr (arr
);
1775 else if (is_thick_pntr (type
))
1776 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1777 _("Bad GNAT array descriptor"));
1783 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1784 position of the field containing the address of the data. */
1787 fat_pntr_data_bitpos (struct type
*type
)
1789 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1792 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1793 size of the field containing the address of the data. */
1796 fat_pntr_data_bitsize (struct type
*type
)
1798 type
= desc_base_type (type
);
1800 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1801 return TYPE_FIELD_BITSIZE (type
, 0);
1803 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1806 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1807 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1808 bound, if WHICH is 1. The first bound is I=1. */
1810 static struct value
*
1811 desc_one_bound (struct value
*bounds
, int i
, int which
)
1813 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1814 _("Bad GNAT array descriptor bounds"));
1817 /* If BOUNDS is an array-bounds structure type, return the bit position
1818 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1819 bound, if WHICH is 1. The first bound is I=1. */
1822 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1824 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1827 /* If BOUNDS is an array-bounds structure type, return the bit field size
1828 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1829 bound, if WHICH is 1. The first bound is I=1. */
1832 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1834 type
= desc_base_type (type
);
1836 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1837 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1839 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1842 /* If TYPE is the type of an array-bounds structure, the type of its
1843 Ith bound (numbering from 1). Otherwise, NULL. */
1845 static struct type
*
1846 desc_index_type (struct type
*type
, int i
)
1848 type
= desc_base_type (type
);
1850 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1851 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1856 /* The number of index positions in the array-bounds type TYPE.
1857 Return 0 if TYPE is NULL. */
1860 desc_arity (struct type
*type
)
1862 type
= desc_base_type (type
);
1865 return TYPE_NFIELDS (type
) / 2;
1869 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1870 an array descriptor type (representing an unconstrained array
1874 ada_is_direct_array_type (struct type
*type
)
1878 type
= ada_check_typedef (type
);
1879 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1880 || ada_is_array_descriptor_type (type
));
1883 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1887 ada_is_array_type (struct type
*type
)
1890 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1891 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1892 type
= TYPE_TARGET_TYPE (type
);
1893 return ada_is_direct_array_type (type
);
1896 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1899 ada_is_simple_array_type (struct type
*type
)
1903 type
= ada_check_typedef (type
);
1904 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1905 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1906 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1907 == TYPE_CODE_ARRAY
));
1910 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1913 ada_is_array_descriptor_type (struct type
*type
)
1915 struct type
*data_type
= desc_data_target_type (type
);
1919 type
= ada_check_typedef (type
);
1920 return (data_type
!= NULL
1921 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1922 && desc_arity (desc_bounds_type (type
)) > 0);
1925 /* Non-zero iff type is a partially mal-formed GNAT array
1926 descriptor. FIXME: This is to compensate for some problems with
1927 debugging output from GNAT. Re-examine periodically to see if it
1931 ada_is_bogus_array_descriptor (struct type
*type
)
1935 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1936 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1937 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1938 && !ada_is_array_descriptor_type (type
);
1942 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1943 (fat pointer) returns the type of the array data described---specifically,
1944 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1945 in from the descriptor; otherwise, they are left unspecified. If
1946 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1947 returns NULL. The result is simply the type of ARR if ARR is not
1950 ada_type_of_array (struct value
*arr
, int bounds
)
1952 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1953 return decode_constrained_packed_array_type (value_type (arr
));
1955 if (!ada_is_array_descriptor_type (value_type (arr
)))
1956 return value_type (arr
);
1960 struct type
*array_type
=
1961 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1963 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1964 TYPE_FIELD_BITSIZE (array_type
, 0) =
1965 decode_packed_array_bitsize (value_type (arr
));
1971 struct type
*elt_type
;
1973 struct value
*descriptor
;
1975 elt_type
= ada_array_element_type (value_type (arr
), -1);
1976 arity
= ada_array_arity (value_type (arr
));
1978 if (elt_type
== NULL
|| arity
== 0)
1979 return ada_check_typedef (value_type (arr
));
1981 descriptor
= desc_bounds (arr
);
1982 if (value_as_long (descriptor
) == 0)
1986 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1987 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1988 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1989 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1992 create_static_range_type (range_type
, value_type (low
),
1993 longest_to_int (value_as_long (low
)),
1994 longest_to_int (value_as_long (high
)));
1995 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1997 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1999 /* We need to store the element packed bitsize, as well as
2000 recompute the array size, because it was previously
2001 computed based on the unpacked element size. */
2002 LONGEST lo
= value_as_long (low
);
2003 LONGEST hi
= value_as_long (high
);
2005 TYPE_FIELD_BITSIZE (elt_type
, 0) =
2006 decode_packed_array_bitsize (value_type (arr
));
2007 /* If the array has no element, then the size is already
2008 zero, and does not need to be recomputed. */
2012 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2014 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2019 return lookup_pointer_type (elt_type
);
2023 /* If ARR does not represent an array, returns ARR unchanged.
2024 Otherwise, returns either a standard GDB array with bounds set
2025 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2026 GDB array. Returns NULL if ARR is a null fat pointer. */
2029 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2031 if (ada_is_array_descriptor_type (value_type (arr
)))
2033 struct type
*arrType
= ada_type_of_array (arr
, 1);
2035 if (arrType
== NULL
)
2037 return value_cast (arrType
, value_copy (desc_data (arr
)));
2039 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2040 return decode_constrained_packed_array (arr
);
2045 /* If ARR does not represent an array, returns ARR unchanged.
2046 Otherwise, returns a standard GDB array describing ARR (which may
2047 be ARR itself if it already is in the proper form). */
2050 ada_coerce_to_simple_array (struct value
*arr
)
2052 if (ada_is_array_descriptor_type (value_type (arr
)))
2054 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2057 error (_("Bounds unavailable for null array pointer."));
2058 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2059 return value_ind (arrVal
);
2061 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2062 return decode_constrained_packed_array (arr
);
2067 /* If TYPE represents a GNAT array type, return it translated to an
2068 ordinary GDB array type (possibly with BITSIZE fields indicating
2069 packing). For other types, is the identity. */
2072 ada_coerce_to_simple_array_type (struct type
*type
)
2074 if (ada_is_constrained_packed_array_type (type
))
2075 return decode_constrained_packed_array_type (type
);
2077 if (ada_is_array_descriptor_type (type
))
2078 return ada_check_typedef (desc_data_target_type (type
));
2083 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2086 ada_is_packed_array_type (struct type
*type
)
2090 type
= desc_base_type (type
);
2091 type
= ada_check_typedef (type
);
2093 ada_type_name (type
) != NULL
2094 && strstr (ada_type_name (type
), "___XP") != NULL
;
2097 /* Non-zero iff TYPE represents a standard GNAT constrained
2098 packed-array type. */
2101 ada_is_constrained_packed_array_type (struct type
*type
)
2103 return ada_is_packed_array_type (type
)
2104 && !ada_is_array_descriptor_type (type
);
2107 /* Non-zero iff TYPE represents an array descriptor for a
2108 unconstrained packed-array type. */
2111 ada_is_unconstrained_packed_array_type (struct type
*type
)
2113 return ada_is_packed_array_type (type
)
2114 && ada_is_array_descriptor_type (type
);
2117 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2118 return the size of its elements in bits. */
2121 decode_packed_array_bitsize (struct type
*type
)
2123 const char *raw_name
;
2127 /* Access to arrays implemented as fat pointers are encoded as a typedef
2128 of the fat pointer type. We need the name of the fat pointer type
2129 to do the decoding, so strip the typedef layer. */
2130 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2131 type
= ada_typedef_target_type (type
);
2133 raw_name
= ada_type_name (ada_check_typedef (type
));
2135 raw_name
= ada_type_name (desc_base_type (type
));
2140 tail
= strstr (raw_name
, "___XP");
2141 gdb_assert (tail
!= NULL
);
2143 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2146 (_("could not understand bit size information on packed array"));
2153 /* Given that TYPE is a standard GDB array type with all bounds filled
2154 in, and that the element size of its ultimate scalar constituents
2155 (that is, either its elements, or, if it is an array of arrays, its
2156 elements' elements, etc.) is *ELT_BITS, return an identical type,
2157 but with the bit sizes of its elements (and those of any
2158 constituent arrays) recorded in the BITSIZE components of its
2159 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2162 Note that, for arrays whose index type has an XA encoding where
2163 a bound references a record discriminant, getting that discriminant,
2164 and therefore the actual value of that bound, is not possible
2165 because none of the given parameters gives us access to the record.
2166 This function assumes that it is OK in the context where it is being
2167 used to return an array whose bounds are still dynamic and where
2168 the length is arbitrary. */
2170 static struct type
*
2171 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2173 struct type
*new_elt_type
;
2174 struct type
*new_type
;
2175 struct type
*index_type_desc
;
2176 struct type
*index_type
;
2177 LONGEST low_bound
, high_bound
;
2179 type
= ada_check_typedef (type
);
2180 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2183 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2184 if (index_type_desc
)
2185 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2188 index_type
= TYPE_INDEX_TYPE (type
);
2190 new_type
= alloc_type_copy (type
);
2192 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2194 create_array_type (new_type
, new_elt_type
, index_type
);
2195 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2196 TYPE_NAME (new_type
) = ada_type_name (type
);
2198 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2199 && is_dynamic_type (check_typedef (index_type
)))
2200 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2201 low_bound
= high_bound
= 0;
2202 if (high_bound
< low_bound
)
2203 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2206 *elt_bits
*= (high_bound
- low_bound
+ 1);
2207 TYPE_LENGTH (new_type
) =
2208 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2211 TYPE_FIXED_INSTANCE (new_type
) = 1;
2215 /* The array type encoded by TYPE, where
2216 ada_is_constrained_packed_array_type (TYPE). */
2218 static struct type
*
2219 decode_constrained_packed_array_type (struct type
*type
)
2221 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2224 struct type
*shadow_type
;
2228 raw_name
= ada_type_name (desc_base_type (type
));
2233 name
= (char *) alloca (strlen (raw_name
) + 1);
2234 tail
= strstr (raw_name
, "___XP");
2235 type
= desc_base_type (type
);
2237 memcpy (name
, raw_name
, tail
- raw_name
);
2238 name
[tail
- raw_name
] = '\000';
2240 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2242 if (shadow_type
== NULL
)
2244 lim_warning (_("could not find bounds information on packed array"));
2247 shadow_type
= check_typedef (shadow_type
);
2249 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2251 lim_warning (_("could not understand bounds "
2252 "information on packed array"));
2256 bits
= decode_packed_array_bitsize (type
);
2257 return constrained_packed_array_type (shadow_type
, &bits
);
2260 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2261 array, returns a simple array that denotes that array. Its type is a
2262 standard GDB array type except that the BITSIZEs of the array
2263 target types are set to the number of bits in each element, and the
2264 type length is set appropriately. */
2266 static struct value
*
2267 decode_constrained_packed_array (struct value
*arr
)
2271 /* If our value is a pointer, then dereference it. Likewise if
2272 the value is a reference. Make sure that this operation does not
2273 cause the target type to be fixed, as this would indirectly cause
2274 this array to be decoded. The rest of the routine assumes that
2275 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2276 and "value_ind" routines to perform the dereferencing, as opposed
2277 to using "ada_coerce_ref" or "ada_value_ind". */
2278 arr
= coerce_ref (arr
);
2279 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2280 arr
= value_ind (arr
);
2282 type
= decode_constrained_packed_array_type (value_type (arr
));
2285 error (_("can't unpack array"));
2289 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2290 && ada_is_modular_type (value_type (arr
)))
2292 /* This is a (right-justified) modular type representing a packed
2293 array with no wrapper. In order to interpret the value through
2294 the (left-justified) packed array type we just built, we must
2295 first left-justify it. */
2296 int bit_size
, bit_pos
;
2299 mod
= ada_modulus (value_type (arr
)) - 1;
2306 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2307 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2308 bit_pos
/ HOST_CHAR_BIT
,
2309 bit_pos
% HOST_CHAR_BIT
,
2314 return coerce_unspec_val_to_type (arr
, type
);
2318 /* The value of the element of packed array ARR at the ARITY indices
2319 given in IND. ARR must be a simple array. */
2321 static struct value
*
2322 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2325 int bits
, elt_off
, bit_off
;
2326 long elt_total_bit_offset
;
2327 struct type
*elt_type
;
2331 elt_total_bit_offset
= 0;
2332 elt_type
= ada_check_typedef (value_type (arr
));
2333 for (i
= 0; i
< arity
; i
+= 1)
2335 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2336 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2338 (_("attempt to do packed indexing of "
2339 "something other than a packed array"));
2342 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2343 LONGEST lowerbound
, upperbound
;
2346 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2348 lim_warning (_("don't know bounds of array"));
2349 lowerbound
= upperbound
= 0;
2352 idx
= pos_atr (ind
[i
]);
2353 if (idx
< lowerbound
|| idx
> upperbound
)
2354 lim_warning (_("packed array index %ld out of bounds"),
2356 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2357 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2358 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2361 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2362 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2364 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2369 /* Non-zero iff TYPE includes negative integer values. */
2372 has_negatives (struct type
*type
)
2374 switch (TYPE_CODE (type
))
2379 return !TYPE_UNSIGNED (type
);
2380 case TYPE_CODE_RANGE
:
2381 return TYPE_LOW_BOUND (type
) < 0;
2386 /* Create a new value of type TYPE from the contents of OBJ starting
2387 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2388 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2389 assigning through the result will set the field fetched from.
2390 VALADDR is ignored unless OBJ is NULL, in which case,
2391 VALADDR+OFFSET must address the start of storage containing the
2392 packed value. The value returned in this case is never an lval.
2393 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2396 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2397 long offset
, int bit_offset
, int bit_size
,
2402 gdb_byte
*src
; /* First byte containing data to unpack */
2403 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2404 int src_idx
; /* Index into the source area */
2405 int src_bytes_left
; /* Number of source bytes left to process. */
2406 int srcBitsLeft
; /* Number of source bits left to move */
2407 int unusedLS
; /* Number of bits in next significant
2408 byte of source that are unused */
2411 int unpacked_idx
; /* Index into the unpacked buffer */
2412 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2414 unsigned long accum
; /* Staging area for bits being transferred */
2415 int accumSize
; /* Number of meaningful bits in accum */
2418 /* Transmit bytes from least to most significant; delta is the direction
2419 the indices move. */
2420 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2422 type
= ada_check_typedef (type
);
2426 v
= allocate_value (type
);
2427 src
= (gdb_byte
*) valaddr
+ offset
;
2429 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2431 v
= value_at (type
, value_address (obj
) + offset
);
2432 type
= value_type (v
);
2433 if (TYPE_LENGTH (type
) * HOST_CHAR_BIT
< bit_size
)
2435 /* This can happen in the case of an array of dynamic objects,
2436 where the size of each element changes from element to element.
2437 In that case, we're initially given the array stride, but
2438 after resolving the element type, we find that its size is
2439 less than this stride. In that case, adjust bit_size to
2440 match TYPE's length, and recompute LEN accordingly. */
2441 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2442 src_len
= TYPE_LENGTH (type
) + (bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2444 src
= alloca (src_len
);
2445 read_memory (value_address (v
), src
, src_len
);
2449 v
= allocate_value (type
);
2450 src
= (gdb_byte
*) value_contents (obj
) + offset
;
2455 long new_offset
= offset
;
2457 set_value_component_location (v
, obj
);
2458 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2459 set_value_bitsize (v
, bit_size
);
2460 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2463 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2465 set_value_offset (v
, new_offset
);
2467 /* Also set the parent value. This is needed when trying to
2468 assign a new value (in inferior memory). */
2469 set_value_parent (v
, obj
);
2472 set_value_bitsize (v
, bit_size
);
2473 unpacked
= (gdb_byte
*) value_contents (v
);
2475 srcBitsLeft
= bit_size
;
2476 src_bytes_left
= src_len
;
2477 unpacked_bytes_left
= TYPE_LENGTH (type
);
2481 memset (unpacked
, 0, TYPE_LENGTH (type
));
2484 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2486 src_idx
= src_len
- 1;
2487 if (has_negatives (type
)
2488 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2492 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2495 switch (TYPE_CODE (type
))
2497 case TYPE_CODE_ARRAY
:
2498 case TYPE_CODE_UNION
:
2499 case TYPE_CODE_STRUCT
:
2500 /* Non-scalar values must be aligned at a byte boundary... */
2502 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2503 /* ... And are placed at the beginning (most-significant) bytes
2505 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2506 unpacked_bytes_left
= unpacked_idx
+ 1;
2510 unpacked_idx
= TYPE_LENGTH (type
) - 1;
2516 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2518 src_idx
= unpacked_idx
= 0;
2519 unusedLS
= bit_offset
;
2522 if (has_negatives (type
) && (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2527 while (src_bytes_left
> 0)
2529 /* Mask for removing bits of the next source byte that are not
2530 part of the value. */
2531 unsigned int unusedMSMask
=
2532 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2534 /* Sign-extend bits for this byte. */
2535 unsigned int signMask
= sign
& ~unusedMSMask
;
2538 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2539 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2540 if (accumSize
>= HOST_CHAR_BIT
)
2542 unpacked
[unpacked_idx
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2543 accumSize
-= HOST_CHAR_BIT
;
2544 accum
>>= HOST_CHAR_BIT
;
2545 unpacked_bytes_left
-= 1;
2546 unpacked_idx
+= delta
;
2548 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2550 src_bytes_left
-= 1;
2553 while (unpacked_bytes_left
> 0)
2555 accum
|= sign
<< accumSize
;
2556 unpacked
[unpacked_idx
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2557 accumSize
-= HOST_CHAR_BIT
;
2560 accum
>>= HOST_CHAR_BIT
;
2561 unpacked_bytes_left
-= 1;
2562 unpacked_idx
+= delta
;
2565 if (is_dynamic_type (value_type (v
)))
2566 v
= value_from_contents_and_address (value_type (v
), value_contents (v
),
2571 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2572 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2575 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2576 int src_offset
, int n
, int bits_big_endian_p
)
2578 unsigned int accum
, mask
;
2579 int accum_bits
, chunk_size
;
2581 target
+= targ_offset
/ HOST_CHAR_BIT
;
2582 targ_offset
%= HOST_CHAR_BIT
;
2583 source
+= src_offset
/ HOST_CHAR_BIT
;
2584 src_offset
%= HOST_CHAR_BIT
;
2585 if (bits_big_endian_p
)
2587 accum
= (unsigned char) *source
;
2589 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2595 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2596 accum_bits
+= HOST_CHAR_BIT
;
2598 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2601 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2602 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2605 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2607 accum_bits
-= chunk_size
;
2614 accum
= (unsigned char) *source
>> src_offset
;
2616 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2620 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2621 accum_bits
+= HOST_CHAR_BIT
;
2623 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2626 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2627 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2629 accum_bits
-= chunk_size
;
2630 accum
>>= chunk_size
;
2637 /* Store the contents of FROMVAL into the location of TOVAL.
2638 Return a new value with the location of TOVAL and contents of
2639 FROMVAL. Handles assignment into packed fields that have
2640 floating-point or non-scalar types. */
2642 static struct value
*
2643 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2645 struct type
*type
= value_type (toval
);
2646 int bits
= value_bitsize (toval
);
2648 toval
= ada_coerce_ref (toval
);
2649 fromval
= ada_coerce_ref (fromval
);
2651 if (ada_is_direct_array_type (value_type (toval
)))
2652 toval
= ada_coerce_to_simple_array (toval
);
2653 if (ada_is_direct_array_type (value_type (fromval
)))
2654 fromval
= ada_coerce_to_simple_array (fromval
);
2656 if (!deprecated_value_modifiable (toval
))
2657 error (_("Left operand of assignment is not a modifiable lvalue."));
2659 if (VALUE_LVAL (toval
) == lval_memory
2661 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2662 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2664 int len
= (value_bitpos (toval
)
2665 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2667 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2669 CORE_ADDR to_addr
= value_address (toval
);
2671 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2672 fromval
= value_cast (type
, fromval
);
2674 read_memory (to_addr
, buffer
, len
);
2675 from_size
= value_bitsize (fromval
);
2677 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2678 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2679 move_bits (buffer
, value_bitpos (toval
),
2680 value_contents (fromval
), from_size
- bits
, bits
, 1);
2682 move_bits (buffer
, value_bitpos (toval
),
2683 value_contents (fromval
), 0, bits
, 0);
2684 write_memory_with_notification (to_addr
, buffer
, len
);
2686 val
= value_copy (toval
);
2687 memcpy (value_contents_raw (val
), value_contents (fromval
),
2688 TYPE_LENGTH (type
));
2689 deprecated_set_value_type (val
, type
);
2694 return value_assign (toval
, fromval
);
2698 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2699 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2700 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2701 COMPONENT, and not the inferior's memory. The current contents
2702 of COMPONENT are ignored.
2704 Although not part of the initial design, this function also works
2705 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2706 had a null address, and COMPONENT had an address which is equal to
2707 its offset inside CONTAINER. */
2710 value_assign_to_component (struct value
*container
, struct value
*component
,
2713 LONGEST offset_in_container
=
2714 (LONGEST
) (value_address (component
) - value_address (container
));
2715 int bit_offset_in_container
=
2716 value_bitpos (component
) - value_bitpos (container
);
2719 val
= value_cast (value_type (component
), val
);
2721 if (value_bitsize (component
) == 0)
2722 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2724 bits
= value_bitsize (component
);
2726 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2727 move_bits (value_contents_writeable (container
) + offset_in_container
,
2728 value_bitpos (container
) + bit_offset_in_container
,
2729 value_contents (val
),
2730 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2733 move_bits (value_contents_writeable (container
) + offset_in_container
,
2734 value_bitpos (container
) + bit_offset_in_container
,
2735 value_contents (val
), 0, bits
, 0);
2738 /* The value of the element of array ARR at the ARITY indices given in IND.
2739 ARR may be either a simple array, GNAT array descriptor, or pointer
2743 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2747 struct type
*elt_type
;
2749 elt
= ada_coerce_to_simple_array (arr
);
2751 elt_type
= ada_check_typedef (value_type (elt
));
2752 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2753 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2754 return value_subscript_packed (elt
, arity
, ind
);
2756 for (k
= 0; k
< arity
; k
+= 1)
2758 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2759 error (_("too many subscripts (%d expected)"), k
);
2760 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2765 /* Assuming ARR is a pointer to a GDB array, the value of the element
2766 of *ARR at the ARITY indices given in IND.
2767 Does not read the entire array into memory.
2769 Note: Unlike what one would expect, this function is used instead of
2770 ada_value_subscript for basically all non-packed array types. The reason
2771 for this is that a side effect of doing our own pointer arithmetics instead
2772 of relying on value_subscript is that there is no implicit typedef peeling.
2773 This is important for arrays of array accesses, where it allows us to
2774 preserve the fact that the array's element is an array access, where the
2775 access part os encoded in a typedef layer. */
2777 static struct value
*
2778 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2781 struct value
*array_ind
= ada_value_ind (arr
);
2783 = check_typedef (value_enclosing_type (array_ind
));
2785 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2786 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2787 return value_subscript_packed (array_ind
, arity
, ind
);
2789 for (k
= 0; k
< arity
; k
+= 1)
2792 struct value
*lwb_value
;
2794 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2795 error (_("too many subscripts (%d expected)"), k
);
2796 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2798 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2799 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2800 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2801 type
= TYPE_TARGET_TYPE (type
);
2804 return value_ind (arr
);
2807 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2808 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2809 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2810 this array is LOW, as per Ada rules. */
2811 static struct value
*
2812 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2815 struct type
*type0
= ada_check_typedef (type
);
2816 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2817 struct type
*index_type
2818 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2819 struct type
*slice_type
=
2820 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2821 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2822 LONGEST base_low_pos
, low_pos
;
2825 if (!discrete_position (base_index_type
, low
, &low_pos
)
2826 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2828 warning (_("unable to get positions in slice, use bounds instead"));
2830 base_low_pos
= base_low
;
2833 base
= value_as_address (array_ptr
)
2834 + ((low_pos
- base_low_pos
)
2835 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2836 return value_at_lazy (slice_type
, base
);
2840 static struct value
*
2841 ada_value_slice (struct value
*array
, int low
, int high
)
2843 struct type
*type
= ada_check_typedef (value_type (array
));
2844 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2845 struct type
*index_type
2846 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2847 struct type
*slice_type
=
2848 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2849 LONGEST low_pos
, high_pos
;
2851 if (!discrete_position (base_index_type
, low
, &low_pos
)
2852 || !discrete_position (base_index_type
, high
, &high_pos
))
2854 warning (_("unable to get positions in slice, use bounds instead"));
2859 return value_cast (slice_type
,
2860 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2863 /* If type is a record type in the form of a standard GNAT array
2864 descriptor, returns the number of dimensions for type. If arr is a
2865 simple array, returns the number of "array of"s that prefix its
2866 type designation. Otherwise, returns 0. */
2869 ada_array_arity (struct type
*type
)
2876 type
= desc_base_type (type
);
2879 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2880 return desc_arity (desc_bounds_type (type
));
2882 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2885 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2891 /* If TYPE is a record type in the form of a standard GNAT array
2892 descriptor or a simple array type, returns the element type for
2893 TYPE after indexing by NINDICES indices, or by all indices if
2894 NINDICES is -1. Otherwise, returns NULL. */
2897 ada_array_element_type (struct type
*type
, int nindices
)
2899 type
= desc_base_type (type
);
2901 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2904 struct type
*p_array_type
;
2906 p_array_type
= desc_data_target_type (type
);
2908 k
= ada_array_arity (type
);
2912 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2913 if (nindices
>= 0 && k
> nindices
)
2915 while (k
> 0 && p_array_type
!= NULL
)
2917 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2920 return p_array_type
;
2922 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2924 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2926 type
= TYPE_TARGET_TYPE (type
);
2935 /* The type of nth index in arrays of given type (n numbering from 1).
2936 Does not examine memory. Throws an error if N is invalid or TYPE
2937 is not an array type. NAME is the name of the Ada attribute being
2938 evaluated ('range, 'first, 'last, or 'length); it is used in building
2939 the error message. */
2941 static struct type
*
2942 ada_index_type (struct type
*type
, int n
, const char *name
)
2944 struct type
*result_type
;
2946 type
= desc_base_type (type
);
2948 if (n
< 0 || n
> ada_array_arity (type
))
2949 error (_("invalid dimension number to '%s"), name
);
2951 if (ada_is_simple_array_type (type
))
2955 for (i
= 1; i
< n
; i
+= 1)
2956 type
= TYPE_TARGET_TYPE (type
);
2957 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2958 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2959 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2960 perhaps stabsread.c would make more sense. */
2961 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2966 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2967 if (result_type
== NULL
)
2968 error (_("attempt to take bound of something that is not an array"));
2974 /* Given that arr is an array type, returns the lower bound of the
2975 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2976 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2977 array-descriptor type. It works for other arrays with bounds supplied
2978 by run-time quantities other than discriminants. */
2981 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2983 struct type
*type
, *index_type_desc
, *index_type
;
2986 gdb_assert (which
== 0 || which
== 1);
2988 if (ada_is_constrained_packed_array_type (arr_type
))
2989 arr_type
= decode_constrained_packed_array_type (arr_type
);
2991 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2992 return (LONGEST
) - which
;
2994 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2995 type
= TYPE_TARGET_TYPE (arr_type
);
2999 if (TYPE_FIXED_INSTANCE (type
))
3001 /* The array has already been fixed, so we do not need to
3002 check the parallel ___XA type again. That encoding has
3003 already been applied, so ignore it now. */
3004 index_type_desc
= NULL
;
3008 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3009 ada_fixup_array_indexes_type (index_type_desc
);
3012 if (index_type_desc
!= NULL
)
3013 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3017 struct type
*elt_type
= check_typedef (type
);
3019 for (i
= 1; i
< n
; i
++)
3020 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3022 index_type
= TYPE_INDEX_TYPE (elt_type
);
3026 (LONGEST
) (which
== 0
3027 ? ada_discrete_type_low_bound (index_type
)
3028 : ada_discrete_type_high_bound (index_type
));
3031 /* Given that arr is an array value, returns the lower bound of the
3032 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3033 WHICH is 1. This routine will also work for arrays with bounds
3034 supplied by run-time quantities other than discriminants. */
3037 ada_array_bound (struct value
*arr
, int n
, int which
)
3039 struct type
*arr_type
;
3041 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3042 arr
= value_ind (arr
);
3043 arr_type
= value_enclosing_type (arr
);
3045 if (ada_is_constrained_packed_array_type (arr_type
))
3046 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3047 else if (ada_is_simple_array_type (arr_type
))
3048 return ada_array_bound_from_type (arr_type
, n
, which
);
3050 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3053 /* Given that arr is an array value, returns the length of the
3054 nth index. This routine will also work for arrays with bounds
3055 supplied by run-time quantities other than discriminants.
3056 Does not work for arrays indexed by enumeration types with representation
3057 clauses at the moment. */
3060 ada_array_length (struct value
*arr
, int n
)
3062 struct type
*arr_type
, *index_type
;
3065 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3066 arr
= value_ind (arr
);
3067 arr_type
= value_enclosing_type (arr
);
3069 if (ada_is_constrained_packed_array_type (arr_type
))
3070 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3072 if (ada_is_simple_array_type (arr_type
))
3074 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3075 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3079 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3080 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3083 arr_type
= check_typedef (arr_type
);
3084 index_type
= TYPE_INDEX_TYPE (arr_type
);
3085 if (index_type
!= NULL
)
3087 struct type
*base_type
;
3088 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3089 base_type
= TYPE_TARGET_TYPE (index_type
);
3091 base_type
= index_type
;
3093 low
= pos_atr (value_from_longest (base_type
, low
));
3094 high
= pos_atr (value_from_longest (base_type
, high
));
3096 return high
- low
+ 1;
3099 /* An empty array whose type is that of ARR_TYPE (an array type),
3100 with bounds LOW to LOW-1. */
3102 static struct value
*
3103 empty_array (struct type
*arr_type
, int low
)
3105 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3106 struct type
*index_type
3107 = create_static_range_type
3108 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3109 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3111 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3115 /* Name resolution */
3117 /* The "decoded" name for the user-definable Ada operator corresponding
3121 ada_decoded_op_name (enum exp_opcode op
)
3125 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3127 if (ada_opname_table
[i
].op
== op
)
3128 return ada_opname_table
[i
].decoded
;
3130 error (_("Could not find operator name for opcode"));
3134 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3135 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3136 undefined namespace) and converts operators that are
3137 user-defined into appropriate function calls. If CONTEXT_TYPE is
3138 non-null, it provides a preferred result type [at the moment, only
3139 type void has any effect---causing procedures to be preferred over
3140 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3141 return type is preferred. May change (expand) *EXP. */
3144 resolve (struct expression
**expp
, int void_context_p
)
3146 struct type
*context_type
= NULL
;
3150 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3152 resolve_subexp (expp
, &pc
, 1, context_type
);
3155 /* Resolve the operator of the subexpression beginning at
3156 position *POS of *EXPP. "Resolving" consists of replacing
3157 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3158 with their resolutions, replacing built-in operators with
3159 function calls to user-defined operators, where appropriate, and,
3160 when DEPROCEDURE_P is non-zero, converting function-valued variables
3161 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3162 are as in ada_resolve, above. */
3164 static struct value
*
3165 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3166 struct type
*context_type
)
3170 struct expression
*exp
; /* Convenience: == *expp. */
3171 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3172 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3173 int nargs
; /* Number of operands. */
3180 /* Pass one: resolve operands, saving their types and updating *pos,
3185 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3186 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3191 resolve_subexp (expp
, pos
, 0, NULL
);
3193 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3198 resolve_subexp (expp
, pos
, 0, NULL
);
3203 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3206 case OP_ATR_MODULUS
:
3216 case TERNOP_IN_RANGE
:
3217 case BINOP_IN_BOUNDS
:
3223 case OP_DISCRETE_RANGE
:
3225 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3234 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3236 resolve_subexp (expp
, pos
, 1, NULL
);
3238 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3255 case BINOP_LOGICAL_AND
:
3256 case BINOP_LOGICAL_OR
:
3257 case BINOP_BITWISE_AND
:
3258 case BINOP_BITWISE_IOR
:
3259 case BINOP_BITWISE_XOR
:
3262 case BINOP_NOTEQUAL
:
3269 case BINOP_SUBSCRIPT
:
3277 case UNOP_LOGICAL_NOT
:
3293 case OP_INTERNALVAR
:
3303 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3306 case STRUCTOP_STRUCT
:
3307 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3320 error (_("Unexpected operator during name resolution"));
3323 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3324 for (i
= 0; i
< nargs
; i
+= 1)
3325 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3329 /* Pass two: perform any resolution on principal operator. */
3336 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3338 struct block_symbol
*candidates
;
3342 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3343 (exp
->elts
[pc
+ 2].symbol
),
3344 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3347 if (n_candidates
> 1)
3349 /* Types tend to get re-introduced locally, so if there
3350 are any local symbols that are not types, first filter
3353 for (j
= 0; j
< n_candidates
; j
+= 1)
3354 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3359 case LOC_REGPARM_ADDR
:
3367 if (j
< n_candidates
)
3370 while (j
< n_candidates
)
3372 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3374 candidates
[j
] = candidates
[n_candidates
- 1];
3383 if (n_candidates
== 0)
3384 error (_("No definition found for %s"),
3385 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3386 else if (n_candidates
== 1)
3388 else if (deprocedure_p
3389 && !is_nonfunction (candidates
, n_candidates
))
3391 i
= ada_resolve_function
3392 (candidates
, n_candidates
, NULL
, 0,
3393 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3396 error (_("Could not find a match for %s"),
3397 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3401 printf_filtered (_("Multiple matches for %s\n"),
3402 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3403 user_select_syms (candidates
, n_candidates
, 1);
3407 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3408 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3409 if (innermost_block
== NULL
3410 || contained_in (candidates
[i
].block
, innermost_block
))
3411 innermost_block
= candidates
[i
].block
;
3415 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3418 replace_operator_with_call (expp
, pc
, 0, 0,
3419 exp
->elts
[pc
+ 2].symbol
,
3420 exp
->elts
[pc
+ 1].block
);
3427 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3428 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3430 struct block_symbol
*candidates
;
3434 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3435 (exp
->elts
[pc
+ 5].symbol
),
3436 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3438 if (n_candidates
== 1)
3442 i
= ada_resolve_function
3443 (candidates
, n_candidates
,
3445 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3448 error (_("Could not find a match for %s"),
3449 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3452 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3453 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3454 if (innermost_block
== NULL
3455 || contained_in (candidates
[i
].block
, innermost_block
))
3456 innermost_block
= candidates
[i
].block
;
3467 case BINOP_BITWISE_AND
:
3468 case BINOP_BITWISE_IOR
:
3469 case BINOP_BITWISE_XOR
:
3471 case BINOP_NOTEQUAL
:
3479 case UNOP_LOGICAL_NOT
:
3481 if (possible_user_operator_p (op
, argvec
))
3483 struct block_symbol
*candidates
;
3487 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3488 (struct block
*) NULL
, VAR_DOMAIN
,
3490 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3491 ada_decoded_op_name (op
), NULL
);
3495 replace_operator_with_call (expp
, pc
, nargs
, 1,
3496 candidates
[i
].symbol
,
3497 candidates
[i
].block
);
3508 return evaluate_subexp_type (exp
, pos
);
3511 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3512 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3514 /* The term "match" here is rather loose. The match is heuristic and
3518 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3520 ftype
= ada_check_typedef (ftype
);
3521 atype
= ada_check_typedef (atype
);
3523 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3524 ftype
= TYPE_TARGET_TYPE (ftype
);
3525 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3526 atype
= TYPE_TARGET_TYPE (atype
);
3528 switch (TYPE_CODE (ftype
))
3531 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3533 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3534 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3535 TYPE_TARGET_TYPE (atype
), 0);
3538 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3540 case TYPE_CODE_ENUM
:
3541 case TYPE_CODE_RANGE
:
3542 switch (TYPE_CODE (atype
))
3545 case TYPE_CODE_ENUM
:
3546 case TYPE_CODE_RANGE
:
3552 case TYPE_CODE_ARRAY
:
3553 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3554 || ada_is_array_descriptor_type (atype
));
3556 case TYPE_CODE_STRUCT
:
3557 if (ada_is_array_descriptor_type (ftype
))
3558 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3559 || ada_is_array_descriptor_type (atype
));
3561 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3562 && !ada_is_array_descriptor_type (atype
));
3564 case TYPE_CODE_UNION
:
3566 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3570 /* Return non-zero if the formals of FUNC "sufficiently match" the
3571 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3572 may also be an enumeral, in which case it is treated as a 0-
3573 argument function. */
3576 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3579 struct type
*func_type
= SYMBOL_TYPE (func
);
3581 if (SYMBOL_CLASS (func
) == LOC_CONST
3582 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3583 return (n_actuals
== 0);
3584 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3587 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3590 for (i
= 0; i
< n_actuals
; i
+= 1)
3592 if (actuals
[i
] == NULL
)
3596 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3598 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3600 if (!ada_type_match (ftype
, atype
, 1))
3607 /* False iff function type FUNC_TYPE definitely does not produce a value
3608 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3609 FUNC_TYPE is not a valid function type with a non-null return type
3610 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3613 return_match (struct type
*func_type
, struct type
*context_type
)
3615 struct type
*return_type
;
3617 if (func_type
== NULL
)
3620 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3621 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3623 return_type
= get_base_type (func_type
);
3624 if (return_type
== NULL
)
3627 context_type
= get_base_type (context_type
);
3629 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3630 return context_type
== NULL
|| return_type
== context_type
;
3631 else if (context_type
== NULL
)
3632 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3634 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3638 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3639 function (if any) that matches the types of the NARGS arguments in
3640 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3641 that returns that type, then eliminate matches that don't. If
3642 CONTEXT_TYPE is void and there is at least one match that does not
3643 return void, eliminate all matches that do.
3645 Asks the user if there is more than one match remaining. Returns -1
3646 if there is no such symbol or none is selected. NAME is used
3647 solely for messages. May re-arrange and modify SYMS in
3648 the process; the index returned is for the modified vector. */
3651 ada_resolve_function (struct block_symbol syms
[],
3652 int nsyms
, struct value
**args
, int nargs
,
3653 const char *name
, struct type
*context_type
)
3657 int m
; /* Number of hits */
3660 /* In the first pass of the loop, we only accept functions matching
3661 context_type. If none are found, we add a second pass of the loop
3662 where every function is accepted. */
3663 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3665 for (k
= 0; k
< nsyms
; k
+= 1)
3667 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3669 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3670 && (fallback
|| return_match (type
, context_type
)))
3678 /* If we got multiple matches, ask the user which one to use. Don't do this
3679 interactive thing during completion, though, as the purpose of the
3680 completion is providing a list of all possible matches. Prompting the
3681 user to filter it down would be completely unexpected in this case. */
3684 else if (m
> 1 && !parse_completion
)
3686 printf_filtered (_("Multiple matches for %s\n"), name
);
3687 user_select_syms (syms
, m
, 1);
3693 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3694 in a listing of choices during disambiguation (see sort_choices, below).
3695 The idea is that overloadings of a subprogram name from the
3696 same package should sort in their source order. We settle for ordering
3697 such symbols by their trailing number (__N or $N). */
3700 encoded_ordered_before (const char *N0
, const char *N1
)
3704 else if (N0
== NULL
)
3710 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3712 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3714 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3715 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3720 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3723 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3725 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3726 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3728 return (strcmp (N0
, N1
) < 0);
3732 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3736 sort_choices (struct block_symbol syms
[], int nsyms
)
3740 for (i
= 1; i
< nsyms
; i
+= 1)
3742 struct block_symbol sym
= syms
[i
];
3745 for (j
= i
- 1; j
>= 0; j
-= 1)
3747 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
3748 SYMBOL_LINKAGE_NAME (sym
.symbol
)))
3750 syms
[j
+ 1] = syms
[j
];
3756 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3757 by asking the user (if necessary), returning the number selected,
3758 and setting the first elements of SYMS items. Error if no symbols
3761 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3762 to be re-integrated one of these days. */
3765 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3768 int *chosen
= XALLOCAVEC (int , nsyms
);
3770 int first_choice
= (max_results
== 1) ? 1 : 2;
3771 const char *select_mode
= multiple_symbols_select_mode ();
3773 if (max_results
< 1)
3774 error (_("Request to select 0 symbols!"));
3778 if (select_mode
== multiple_symbols_cancel
)
3780 canceled because the command is ambiguous\n\
3781 See set/show multiple-symbol."));
3783 /* If select_mode is "all", then return all possible symbols.
3784 Only do that if more than one symbol can be selected, of course.
3785 Otherwise, display the menu as usual. */
3786 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3789 printf_unfiltered (_("[0] cancel\n"));
3790 if (max_results
> 1)
3791 printf_unfiltered (_("[1] all\n"));
3793 sort_choices (syms
, nsyms
);
3795 for (i
= 0; i
< nsyms
; i
+= 1)
3797 if (syms
[i
].symbol
== NULL
)
3800 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3802 struct symtab_and_line sal
=
3803 find_function_start_sal (syms
[i
].symbol
, 1);
3805 if (sal
.symtab
== NULL
)
3806 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3808 SYMBOL_PRINT_NAME (syms
[i
].symbol
),
3811 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3812 SYMBOL_PRINT_NAME (syms
[i
].symbol
),
3813 symtab_to_filename_for_display (sal
.symtab
),
3820 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3821 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3822 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3823 struct symtab
*symtab
= NULL
;
3825 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3826 symtab
= symbol_symtab (syms
[i
].symbol
);
3828 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3829 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3831 SYMBOL_PRINT_NAME (syms
[i
].symbol
),
3832 symtab_to_filename_for_display (symtab
),
3833 SYMBOL_LINE (syms
[i
].symbol
));
3834 else if (is_enumeral
3835 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3837 printf_unfiltered (("[%d] "), i
+ first_choice
);
3838 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3839 gdb_stdout
, -1, 0, &type_print_raw_options
);
3840 printf_unfiltered (_("'(%s) (enumeral)\n"),
3841 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
3843 else if (symtab
!= NULL
)
3844 printf_unfiltered (is_enumeral
3845 ? _("[%d] %s in %s (enumeral)\n")
3846 : _("[%d] %s at %s:?\n"),
3848 SYMBOL_PRINT_NAME (syms
[i
].symbol
),
3849 symtab_to_filename_for_display (symtab
));
3851 printf_unfiltered (is_enumeral
3852 ? _("[%d] %s (enumeral)\n")
3853 : _("[%d] %s at ?\n"),
3855 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
3859 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3862 for (i
= 0; i
< n_chosen
; i
+= 1)
3863 syms
[i
] = syms
[chosen
[i
]];
3868 /* Read and validate a set of numeric choices from the user in the
3869 range 0 .. N_CHOICES-1. Place the results in increasing
3870 order in CHOICES[0 .. N-1], and return N.
3872 The user types choices as a sequence of numbers on one line
3873 separated by blanks, encoding them as follows:
3875 + A choice of 0 means to cancel the selection, throwing an error.
3876 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3877 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3879 The user is not allowed to choose more than MAX_RESULTS values.
3881 ANNOTATION_SUFFIX, if present, is used to annotate the input
3882 prompts (for use with the -f switch). */
3885 get_selections (int *choices
, int n_choices
, int max_results
,
3886 int is_all_choice
, char *annotation_suffix
)
3891 int first_choice
= is_all_choice
? 2 : 1;
3893 prompt
= getenv ("PS2");
3897 args
= command_line_input (prompt
, 0, annotation_suffix
);
3900 error_no_arg (_("one or more choice numbers"));
3904 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3905 order, as given in args. Choices are validated. */
3911 args
= skip_spaces (args
);
3912 if (*args
== '\0' && n_chosen
== 0)
3913 error_no_arg (_("one or more choice numbers"));
3914 else if (*args
== '\0')
3917 choice
= strtol (args
, &args2
, 10);
3918 if (args
== args2
|| choice
< 0
3919 || choice
> n_choices
+ first_choice
- 1)
3920 error (_("Argument must be choice number"));
3924 error (_("cancelled"));
3926 if (choice
< first_choice
)
3928 n_chosen
= n_choices
;
3929 for (j
= 0; j
< n_choices
; j
+= 1)
3933 choice
-= first_choice
;
3935 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3939 if (j
< 0 || choice
!= choices
[j
])
3943 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3944 choices
[k
+ 1] = choices
[k
];
3945 choices
[j
+ 1] = choice
;
3950 if (n_chosen
> max_results
)
3951 error (_("Select no more than %d of the above"), max_results
);
3956 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3957 on the function identified by SYM and BLOCK, and taking NARGS
3958 arguments. Update *EXPP as needed to hold more space. */
3961 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3962 int oplen
, struct symbol
*sym
,
3963 const struct block
*block
)
3965 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3966 symbol, -oplen for operator being replaced). */
3967 struct expression
*newexp
= (struct expression
*)
3968 xzalloc (sizeof (struct expression
)
3969 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3970 struct expression
*exp
= *expp
;
3972 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3973 newexp
->language_defn
= exp
->language_defn
;
3974 newexp
->gdbarch
= exp
->gdbarch
;
3975 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3976 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3977 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3979 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3980 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3982 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3983 newexp
->elts
[pc
+ 4].block
= block
;
3984 newexp
->elts
[pc
+ 5].symbol
= sym
;
3990 /* Type-class predicates */
3992 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3996 numeric_type_p (struct type
*type
)
4002 switch (TYPE_CODE (type
))
4007 case TYPE_CODE_RANGE
:
4008 return (type
== TYPE_TARGET_TYPE (type
)
4009 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4016 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4019 integer_type_p (struct type
*type
)
4025 switch (TYPE_CODE (type
))
4029 case TYPE_CODE_RANGE
:
4030 return (type
== TYPE_TARGET_TYPE (type
)
4031 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4038 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4041 scalar_type_p (struct type
*type
)
4047 switch (TYPE_CODE (type
))
4050 case TYPE_CODE_RANGE
:
4051 case TYPE_CODE_ENUM
:
4060 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4063 discrete_type_p (struct type
*type
)
4069 switch (TYPE_CODE (type
))
4072 case TYPE_CODE_RANGE
:
4073 case TYPE_CODE_ENUM
:
4074 case TYPE_CODE_BOOL
:
4082 /* Returns non-zero if OP with operands in the vector ARGS could be
4083 a user-defined function. Errs on the side of pre-defined operators
4084 (i.e., result 0). */
4087 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4089 struct type
*type0
=
4090 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4091 struct type
*type1
=
4092 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4106 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4110 case BINOP_BITWISE_AND
:
4111 case BINOP_BITWISE_IOR
:
4112 case BINOP_BITWISE_XOR
:
4113 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4116 case BINOP_NOTEQUAL
:
4121 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4124 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4127 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4131 case UNOP_LOGICAL_NOT
:
4133 return (!numeric_type_p (type0
));
4142 1. In the following, we assume that a renaming type's name may
4143 have an ___XD suffix. It would be nice if this went away at some
4145 2. We handle both the (old) purely type-based representation of
4146 renamings and the (new) variable-based encoding. At some point,
4147 it is devoutly to be hoped that the former goes away
4148 (FIXME: hilfinger-2007-07-09).
4149 3. Subprogram renamings are not implemented, although the XRS
4150 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4152 /* If SYM encodes a renaming,
4154 <renaming> renames <renamed entity>,
4156 sets *LEN to the length of the renamed entity's name,
4157 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4158 the string describing the subcomponent selected from the renamed
4159 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4160 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4161 are undefined). Otherwise, returns a value indicating the category
4162 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4163 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4164 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4165 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4166 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4167 may be NULL, in which case they are not assigned.
4169 [Currently, however, GCC does not generate subprogram renamings.] */
4171 enum ada_renaming_category
4172 ada_parse_renaming (struct symbol
*sym
,
4173 const char **renamed_entity
, int *len
,
4174 const char **renaming_expr
)
4176 enum ada_renaming_category kind
;
4181 return ADA_NOT_RENAMING
;
4182 switch (SYMBOL_CLASS (sym
))
4185 return ADA_NOT_RENAMING
;
4187 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4188 renamed_entity
, len
, renaming_expr
);
4192 case LOC_OPTIMIZED_OUT
:
4193 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4195 return ADA_NOT_RENAMING
;
4199 kind
= ADA_OBJECT_RENAMING
;
4203 kind
= ADA_EXCEPTION_RENAMING
;
4207 kind
= ADA_PACKAGE_RENAMING
;
4211 kind
= ADA_SUBPROGRAM_RENAMING
;
4215 return ADA_NOT_RENAMING
;
4219 if (renamed_entity
!= NULL
)
4220 *renamed_entity
= info
;
4221 suffix
= strstr (info
, "___XE");
4222 if (suffix
== NULL
|| suffix
== info
)
4223 return ADA_NOT_RENAMING
;
4225 *len
= strlen (info
) - strlen (suffix
);
4227 if (renaming_expr
!= NULL
)
4228 *renaming_expr
= suffix
;
4232 /* Assuming TYPE encodes a renaming according to the old encoding in
4233 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4234 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4235 ADA_NOT_RENAMING otherwise. */
4236 static enum ada_renaming_category
4237 parse_old_style_renaming (struct type
*type
,
4238 const char **renamed_entity
, int *len
,
4239 const char **renaming_expr
)
4241 enum ada_renaming_category kind
;
4246 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4247 || TYPE_NFIELDS (type
) != 1)
4248 return ADA_NOT_RENAMING
;
4250 name
= type_name_no_tag (type
);
4252 return ADA_NOT_RENAMING
;
4254 name
= strstr (name
, "___XR");
4256 return ADA_NOT_RENAMING
;
4261 kind
= ADA_OBJECT_RENAMING
;
4264 kind
= ADA_EXCEPTION_RENAMING
;
4267 kind
= ADA_PACKAGE_RENAMING
;
4270 kind
= ADA_SUBPROGRAM_RENAMING
;
4273 return ADA_NOT_RENAMING
;
4276 info
= TYPE_FIELD_NAME (type
, 0);
4278 return ADA_NOT_RENAMING
;
4279 if (renamed_entity
!= NULL
)
4280 *renamed_entity
= info
;
4281 suffix
= strstr (info
, "___XE");
4282 if (renaming_expr
!= NULL
)
4283 *renaming_expr
= suffix
+ 5;
4284 if (suffix
== NULL
|| suffix
== info
)
4285 return ADA_NOT_RENAMING
;
4287 *len
= suffix
- info
;
4291 /* Compute the value of the given RENAMING_SYM, which is expected to
4292 be a symbol encoding a renaming expression. BLOCK is the block
4293 used to evaluate the renaming. */
4295 static struct value
*
4296 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4297 const struct block
*block
)
4299 const char *sym_name
;
4300 struct expression
*expr
;
4301 struct value
*value
;
4302 struct cleanup
*old_chain
= NULL
;
4304 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4305 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4306 old_chain
= make_cleanup (free_current_contents
, &expr
);
4307 value
= evaluate_expression (expr
);
4309 do_cleanups (old_chain
);
4314 /* Evaluation: Function Calls */
4316 /* Return an lvalue containing the value VAL. This is the identity on
4317 lvalues, and otherwise has the side-effect of allocating memory
4318 in the inferior where a copy of the value contents is copied. */
4320 static struct value
*
4321 ensure_lval (struct value
*val
)
4323 if (VALUE_LVAL (val
) == not_lval
4324 || VALUE_LVAL (val
) == lval_internalvar
)
4326 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4327 const CORE_ADDR addr
=
4328 value_as_long (value_allocate_space_in_inferior (len
));
4330 set_value_address (val
, addr
);
4331 VALUE_LVAL (val
) = lval_memory
;
4332 write_memory (addr
, value_contents (val
), len
);
4338 /* Return the value ACTUAL, converted to be an appropriate value for a
4339 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4340 allocating any necessary descriptors (fat pointers), or copies of
4341 values not residing in memory, updating it as needed. */
4344 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4346 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4347 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4348 struct type
*formal_target
=
4349 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4350 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4351 struct type
*actual_target
=
4352 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4353 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4355 if (ada_is_array_descriptor_type (formal_target
)
4356 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4357 return make_array_descriptor (formal_type
, actual
);
4358 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4359 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4361 struct value
*result
;
4363 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4364 && ada_is_array_descriptor_type (actual_target
))
4365 result
= desc_data (actual
);
4366 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4368 if (VALUE_LVAL (actual
) != lval_memory
)
4372 actual_type
= ada_check_typedef (value_type (actual
));
4373 val
= allocate_value (actual_type
);
4374 memcpy ((char *) value_contents_raw (val
),
4375 (char *) value_contents (actual
),
4376 TYPE_LENGTH (actual_type
));
4377 actual
= ensure_lval (val
);
4379 result
= value_addr (actual
);
4383 return value_cast_pointers (formal_type
, result
, 0);
4385 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4386 return ada_value_ind (actual
);
4387 else if (ada_is_aligner_type (formal_type
))
4389 /* We need to turn this parameter into an aligner type
4391 struct value
*aligner
= allocate_value (formal_type
);
4392 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4394 value_assign_to_component (aligner
, component
, actual
);
4401 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4402 type TYPE. This is usually an inefficient no-op except on some targets
4403 (such as AVR) where the representation of a pointer and an address
4407 value_pointer (struct value
*value
, struct type
*type
)
4409 struct gdbarch
*gdbarch
= get_type_arch (type
);
4410 unsigned len
= TYPE_LENGTH (type
);
4411 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4414 addr
= value_address (value
);
4415 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4416 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4421 /* Push a descriptor of type TYPE for array value ARR on the stack at
4422 *SP, updating *SP to reflect the new descriptor. Return either
4423 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4424 to-descriptor type rather than a descriptor type), a struct value *
4425 representing a pointer to this descriptor. */
4427 static struct value
*
4428 make_array_descriptor (struct type
*type
, struct value
*arr
)
4430 struct type
*bounds_type
= desc_bounds_type (type
);
4431 struct type
*desc_type
= desc_base_type (type
);
4432 struct value
*descriptor
= allocate_value (desc_type
);
4433 struct value
*bounds
= allocate_value (bounds_type
);
4436 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4439 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4440 ada_array_bound (arr
, i
, 0),
4441 desc_bound_bitpos (bounds_type
, i
, 0),
4442 desc_bound_bitsize (bounds_type
, i
, 0));
4443 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4444 ada_array_bound (arr
, i
, 1),
4445 desc_bound_bitpos (bounds_type
, i
, 1),
4446 desc_bound_bitsize (bounds_type
, i
, 1));
4449 bounds
= ensure_lval (bounds
);
4451 modify_field (value_type (descriptor
),
4452 value_contents_writeable (descriptor
),
4453 value_pointer (ensure_lval (arr
),
4454 TYPE_FIELD_TYPE (desc_type
, 0)),
4455 fat_pntr_data_bitpos (desc_type
),
4456 fat_pntr_data_bitsize (desc_type
));
4458 modify_field (value_type (descriptor
),
4459 value_contents_writeable (descriptor
),
4460 value_pointer (bounds
,
4461 TYPE_FIELD_TYPE (desc_type
, 1)),
4462 fat_pntr_bounds_bitpos (desc_type
),
4463 fat_pntr_bounds_bitsize (desc_type
));
4465 descriptor
= ensure_lval (descriptor
);
4467 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4468 return value_addr (descriptor
);
4473 /* Symbol Cache Module */
4475 /* Performance measurements made as of 2010-01-15 indicate that
4476 this cache does bring some noticeable improvements. Depending
4477 on the type of entity being printed, the cache can make it as much
4478 as an order of magnitude faster than without it.
4480 The descriptive type DWARF extension has significantly reduced
4481 the need for this cache, at least when DWARF is being used. However,
4482 even in this case, some expensive name-based symbol searches are still
4483 sometimes necessary - to find an XVZ variable, mostly. */
4485 /* Initialize the contents of SYM_CACHE. */
4488 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4490 obstack_init (&sym_cache
->cache_space
);
4491 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4494 /* Free the memory used by SYM_CACHE. */
4497 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4499 obstack_free (&sym_cache
->cache_space
, NULL
);
4503 /* Return the symbol cache associated to the given program space PSPACE.
4504 If not allocated for this PSPACE yet, allocate and initialize one. */
4506 static struct ada_symbol_cache
*
4507 ada_get_symbol_cache (struct program_space
*pspace
)
4509 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4511 if (pspace_data
->sym_cache
== NULL
)
4513 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4514 ada_init_symbol_cache (pspace_data
->sym_cache
);
4517 return pspace_data
->sym_cache
;
4520 /* Clear all entries from the symbol cache. */
4523 ada_clear_symbol_cache (void)
4525 struct ada_symbol_cache
*sym_cache
4526 = ada_get_symbol_cache (current_program_space
);
4528 obstack_free (&sym_cache
->cache_space
, NULL
);
4529 ada_init_symbol_cache (sym_cache
);
4532 /* Search our cache for an entry matching NAME and DOMAIN.
4533 Return it if found, or NULL otherwise. */
4535 static struct cache_entry
**
4536 find_entry (const char *name
, domain_enum domain
)
4538 struct ada_symbol_cache
*sym_cache
4539 = ada_get_symbol_cache (current_program_space
);
4540 int h
= msymbol_hash (name
) % HASH_SIZE
;
4541 struct cache_entry
**e
;
4543 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4545 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4551 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4552 Return 1 if found, 0 otherwise.
4554 If an entry was found and SYM is not NULL, set *SYM to the entry's
4555 SYM. Same principle for BLOCK if not NULL. */
4558 lookup_cached_symbol (const char *name
, domain_enum domain
,
4559 struct symbol
**sym
, const struct block
**block
)
4561 struct cache_entry
**e
= find_entry (name
, domain
);
4568 *block
= (*e
)->block
;
4572 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4573 in domain DOMAIN, save this result in our symbol cache. */
4576 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4577 const struct block
*block
)
4579 struct ada_symbol_cache
*sym_cache
4580 = ada_get_symbol_cache (current_program_space
);
4583 struct cache_entry
*e
;
4585 /* Symbols for builtin types don't have a block.
4586 For now don't cache such symbols. */
4587 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4590 /* If the symbol is a local symbol, then do not cache it, as a search
4591 for that symbol depends on the context. To determine whether
4592 the symbol is local or not, we check the block where we found it
4593 against the global and static blocks of its associated symtab. */
4595 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4596 GLOBAL_BLOCK
) != block
4597 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4598 STATIC_BLOCK
) != block
)
4601 h
= msymbol_hash (name
) % HASH_SIZE
;
4602 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4604 e
->next
= sym_cache
->root
[h
];
4605 sym_cache
->root
[h
] = e
;
4607 = (char *) obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4608 strcpy (copy
, name
);
4616 /* Return nonzero if wild matching should be used when searching for
4617 all symbols matching LOOKUP_NAME.
4619 LOOKUP_NAME is expected to be a symbol name after transformation
4620 for Ada lookups (see ada_name_for_lookup). */
4623 should_use_wild_match (const char *lookup_name
)
4625 return (strstr (lookup_name
, "__") == NULL
);
4628 /* Return the result of a standard (literal, C-like) lookup of NAME in
4629 given DOMAIN, visible from lexical block BLOCK. */
4631 static struct symbol
*
4632 standard_lookup (const char *name
, const struct block
*block
,
4635 /* Initialize it just to avoid a GCC false warning. */
4636 struct block_symbol sym
= {NULL
, NULL
};
4638 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4640 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4641 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4646 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4647 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4648 since they contend in overloading in the same way. */
4650 is_nonfunction (struct block_symbol syms
[], int n
)
4654 for (i
= 0; i
< n
; i
+= 1)
4655 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4656 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4657 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4663 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4664 struct types. Otherwise, they may not. */
4667 equiv_types (struct type
*type0
, struct type
*type1
)
4671 if (type0
== NULL
|| type1
== NULL
4672 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4674 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4675 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4676 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4677 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4683 /* True iff SYM0 represents the same entity as SYM1, or one that is
4684 no more defined than that of SYM1. */
4687 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4691 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4692 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4695 switch (SYMBOL_CLASS (sym0
))
4701 struct type
*type0
= SYMBOL_TYPE (sym0
);
4702 struct type
*type1
= SYMBOL_TYPE (sym1
);
4703 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4704 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4705 int len0
= strlen (name0
);
4708 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4709 && (equiv_types (type0
, type1
)
4710 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4711 && startswith (name1
+ len0
, "___XV")));
4714 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4715 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4721 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4722 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4725 add_defn_to_vec (struct obstack
*obstackp
,
4727 const struct block
*block
)
4730 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4732 /* Do not try to complete stub types, as the debugger is probably
4733 already scanning all symbols matching a certain name at the
4734 time when this function is called. Trying to replace the stub
4735 type by its associated full type will cause us to restart a scan
4736 which may lead to an infinite recursion. Instead, the client
4737 collecting the matching symbols will end up collecting several
4738 matches, with at least one of them complete. It can then filter
4739 out the stub ones if needed. */
4741 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4743 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4745 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4747 prevDefns
[i
].symbol
= sym
;
4748 prevDefns
[i
].block
= block
;
4754 struct block_symbol info
;
4758 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4762 /* Number of block_symbol structures currently collected in current vector in
4766 num_defns_collected (struct obstack
*obstackp
)
4768 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4771 /* Vector of block_symbol structures currently collected in current vector in
4772 OBSTACKP. If FINISH, close off the vector and return its final address. */
4774 static struct block_symbol
*
4775 defns_collected (struct obstack
*obstackp
, int finish
)
4778 return (struct block_symbol
*) obstack_finish (obstackp
);
4780 return (struct block_symbol
*) obstack_base (obstackp
);
4783 /* Return a bound minimal symbol matching NAME according to Ada
4784 decoding rules. Returns an invalid symbol if there is no such
4785 minimal symbol. Names prefixed with "standard__" are handled
4786 specially: "standard__" is first stripped off, and only static and
4787 global symbols are searched. */
4789 struct bound_minimal_symbol
4790 ada_lookup_simple_minsym (const char *name
)
4792 struct bound_minimal_symbol result
;
4793 struct objfile
*objfile
;
4794 struct minimal_symbol
*msymbol
;
4795 const int wild_match_p
= should_use_wild_match (name
);
4797 memset (&result
, 0, sizeof (result
));
4799 /* Special case: If the user specifies a symbol name inside package
4800 Standard, do a non-wild matching of the symbol name without
4801 the "standard__" prefix. This was primarily introduced in order
4802 to allow the user to specifically access the standard exceptions
4803 using, for instance, Standard.Constraint_Error when Constraint_Error
4804 is ambiguous (due to the user defining its own Constraint_Error
4805 entity inside its program). */
4806 if (startswith (name
, "standard__"))
4807 name
+= sizeof ("standard__") - 1;
4809 ALL_MSYMBOLS (objfile
, msymbol
)
4811 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4812 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4814 result
.minsym
= msymbol
;
4815 result
.objfile
= objfile
;
4823 /* For all subprograms that statically enclose the subprogram of the
4824 selected frame, add symbols matching identifier NAME in DOMAIN
4825 and their blocks to the list of data in OBSTACKP, as for
4826 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4827 with a wildcard prefix. */
4830 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4831 const char *name
, domain_enum domain
,
4836 /* True if TYPE is definitely an artificial type supplied to a symbol
4837 for which no debugging information was given in the symbol file. */
4840 is_nondebugging_type (struct type
*type
)
4842 const char *name
= ada_type_name (type
);
4844 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4847 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4848 that are deemed "identical" for practical purposes.
4850 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4851 types and that their number of enumerals is identical (in other
4852 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4855 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4859 /* The heuristic we use here is fairly conservative. We consider
4860 that 2 enumerate types are identical if they have the same
4861 number of enumerals and that all enumerals have the same
4862 underlying value and name. */
4864 /* All enums in the type should have an identical underlying value. */
4865 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4866 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4869 /* All enumerals should also have the same name (modulo any numerical
4871 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4873 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4874 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4875 int len_1
= strlen (name_1
);
4876 int len_2
= strlen (name_2
);
4878 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4879 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4881 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4882 TYPE_FIELD_NAME (type2
, i
),
4890 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4891 that are deemed "identical" for practical purposes. Sometimes,
4892 enumerals are not strictly identical, but their types are so similar
4893 that they can be considered identical.
4895 For instance, consider the following code:
4897 type Color is (Black, Red, Green, Blue, White);
4898 type RGB_Color is new Color range Red .. Blue;
4900 Type RGB_Color is a subrange of an implicit type which is a copy
4901 of type Color. If we call that implicit type RGB_ColorB ("B" is
4902 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4903 As a result, when an expression references any of the enumeral
4904 by name (Eg. "print green"), the expression is technically
4905 ambiguous and the user should be asked to disambiguate. But
4906 doing so would only hinder the user, since it wouldn't matter
4907 what choice he makes, the outcome would always be the same.
4908 So, for practical purposes, we consider them as the same. */
4911 symbols_are_identical_enums (struct block_symbol
*syms
, int nsyms
)
4915 /* Before performing a thorough comparison check of each type,
4916 we perform a series of inexpensive checks. We expect that these
4917 checks will quickly fail in the vast majority of cases, and thus
4918 help prevent the unnecessary use of a more expensive comparison.
4919 Said comparison also expects us to make some of these checks
4920 (see ada_identical_enum_types_p). */
4922 /* Quick check: All symbols should have an enum type. */
4923 for (i
= 0; i
< nsyms
; i
++)
4924 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
4927 /* Quick check: They should all have the same value. */
4928 for (i
= 1; i
< nsyms
; i
++)
4929 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
4932 /* Quick check: They should all have the same number of enumerals. */
4933 for (i
= 1; i
< nsyms
; i
++)
4934 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
4935 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
4938 /* All the sanity checks passed, so we might have a set of
4939 identical enumeration types. Perform a more complete
4940 comparison of the type of each symbol. */
4941 for (i
= 1; i
< nsyms
; i
++)
4942 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
4943 SYMBOL_TYPE (syms
[0].symbol
)))
4949 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4950 duplicate other symbols in the list (The only case I know of where
4951 this happens is when object files containing stabs-in-ecoff are
4952 linked with files containing ordinary ecoff debugging symbols (or no
4953 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4954 Returns the number of items in the modified list. */
4957 remove_extra_symbols (struct block_symbol
*syms
, int nsyms
)
4961 /* We should never be called with less than 2 symbols, as there
4962 cannot be any extra symbol in that case. But it's easy to
4963 handle, since we have nothing to do in that case. */
4972 /* If two symbols have the same name and one of them is a stub type,
4973 the get rid of the stub. */
4975 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].symbol
))
4976 && SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
)
4978 for (j
= 0; j
< nsyms
; j
++)
4981 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].symbol
))
4982 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
4983 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
4984 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0)
4989 /* Two symbols with the same name, same class and same address
4990 should be identical. */
4992 else if (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
4993 && SYMBOL_CLASS (syms
[i
].symbol
) == LOC_STATIC
4994 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].symbol
)))
4996 for (j
= 0; j
< nsyms
; j
+= 1)
4999 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5000 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5001 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0
5002 && SYMBOL_CLASS (syms
[i
].symbol
)
5003 == SYMBOL_CLASS (syms
[j
].symbol
)
5004 && SYMBOL_VALUE_ADDRESS (syms
[i
].symbol
)
5005 == SYMBOL_VALUE_ADDRESS (syms
[j
].symbol
))
5012 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5013 syms
[j
- 1] = syms
[j
];
5020 /* If all the remaining symbols are identical enumerals, then
5021 just keep the first one and discard the rest.
5023 Unlike what we did previously, we do not discard any entry
5024 unless they are ALL identical. This is because the symbol
5025 comparison is not a strict comparison, but rather a practical
5026 comparison. If all symbols are considered identical, then
5027 we can just go ahead and use the first one and discard the rest.
5028 But if we cannot reduce the list to a single element, we have
5029 to ask the user to disambiguate anyways. And if we have to
5030 present a multiple-choice menu, it's less confusing if the list
5031 isn't missing some choices that were identical and yet distinct. */
5032 if (symbols_are_identical_enums (syms
, nsyms
))
5038 /* Given a type that corresponds to a renaming entity, use the type name
5039 to extract the scope (package name or function name, fully qualified,
5040 and following the GNAT encoding convention) where this renaming has been
5041 defined. The string returned needs to be deallocated after use. */
5044 xget_renaming_scope (struct type
*renaming_type
)
5046 /* The renaming types adhere to the following convention:
5047 <scope>__<rename>___<XR extension>.
5048 So, to extract the scope, we search for the "___XR" extension,
5049 and then backtrack until we find the first "__". */
5051 const char *name
= type_name_no_tag (renaming_type
);
5052 const char *suffix
= strstr (name
, "___XR");
5057 /* Now, backtrack a bit until we find the first "__". Start looking
5058 at suffix - 3, as the <rename> part is at least one character long. */
5060 for (last
= suffix
- 3; last
> name
; last
--)
5061 if (last
[0] == '_' && last
[1] == '_')
5064 /* Make a copy of scope and return it. */
5066 scope_len
= last
- name
;
5067 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
5069 strncpy (scope
, name
, scope_len
);
5070 scope
[scope_len
] = '\0';
5075 /* Return nonzero if NAME corresponds to a package name. */
5078 is_package_name (const char *name
)
5080 /* Here, We take advantage of the fact that no symbols are generated
5081 for packages, while symbols are generated for each function.
5082 So the condition for NAME represent a package becomes equivalent
5083 to NAME not existing in our list of symbols. There is only one
5084 small complication with library-level functions (see below). */
5088 /* If it is a function that has not been defined at library level,
5089 then we should be able to look it up in the symbols. */
5090 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5093 /* Library-level function names start with "_ada_". See if function
5094 "_ada_" followed by NAME can be found. */
5096 /* Do a quick check that NAME does not contain "__", since library-level
5097 functions names cannot contain "__" in them. */
5098 if (strstr (name
, "__") != NULL
)
5101 fun_name
= xstrprintf ("_ada_%s", name
);
5103 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5106 /* Return nonzero if SYM corresponds to a renaming entity that is
5107 not visible from FUNCTION_NAME. */
5110 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5113 struct cleanup
*old_chain
;
5115 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5118 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5119 old_chain
= make_cleanup (xfree
, scope
);
5121 /* If the rename has been defined in a package, then it is visible. */
5122 if (is_package_name (scope
))
5124 do_cleanups (old_chain
);
5128 /* Check that the rename is in the current function scope by checking
5129 that its name starts with SCOPE. */
5131 /* If the function name starts with "_ada_", it means that it is
5132 a library-level function. Strip this prefix before doing the
5133 comparison, as the encoding for the renaming does not contain
5135 if (startswith (function_name
, "_ada_"))
5139 int is_invisible
= !startswith (function_name
, scope
);
5141 do_cleanups (old_chain
);
5142 return is_invisible
;
5146 /* Remove entries from SYMS that corresponds to a renaming entity that
5147 is not visible from the function associated with CURRENT_BLOCK or
5148 that is superfluous due to the presence of more specific renaming
5149 information. Places surviving symbols in the initial entries of
5150 SYMS and returns the number of surviving symbols.
5153 First, in cases where an object renaming is implemented as a
5154 reference variable, GNAT may produce both the actual reference
5155 variable and the renaming encoding. In this case, we discard the
5158 Second, GNAT emits a type following a specified encoding for each renaming
5159 entity. Unfortunately, STABS currently does not support the definition
5160 of types that are local to a given lexical block, so all renamings types
5161 are emitted at library level. As a consequence, if an application
5162 contains two renaming entities using the same name, and a user tries to
5163 print the value of one of these entities, the result of the ada symbol
5164 lookup will also contain the wrong renaming type.
5166 This function partially covers for this limitation by attempting to
5167 remove from the SYMS list renaming symbols that should be visible
5168 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5169 method with the current information available. The implementation
5170 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5172 - When the user tries to print a rename in a function while there
5173 is another rename entity defined in a package: Normally, the
5174 rename in the function has precedence over the rename in the
5175 package, so the latter should be removed from the list. This is
5176 currently not the case.
5178 - This function will incorrectly remove valid renames if
5179 the CURRENT_BLOCK corresponds to a function which symbol name
5180 has been changed by an "Export" pragma. As a consequence,
5181 the user will be unable to print such rename entities. */
5184 remove_irrelevant_renamings (struct block_symbol
*syms
,
5185 int nsyms
, const struct block
*current_block
)
5187 struct symbol
*current_function
;
5188 const char *current_function_name
;
5190 int is_new_style_renaming
;
5192 /* If there is both a renaming foo___XR... encoded as a variable and
5193 a simple variable foo in the same block, discard the latter.
5194 First, zero out such symbols, then compress. */
5195 is_new_style_renaming
= 0;
5196 for (i
= 0; i
< nsyms
; i
+= 1)
5198 struct symbol
*sym
= syms
[i
].symbol
;
5199 const struct block
*block
= syms
[i
].block
;
5203 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5205 name
= SYMBOL_LINKAGE_NAME (sym
);
5206 suffix
= strstr (name
, "___XR");
5210 int name_len
= suffix
- name
;
5213 is_new_style_renaming
= 1;
5214 for (j
= 0; j
< nsyms
; j
+= 1)
5215 if (i
!= j
&& syms
[j
].symbol
!= NULL
5216 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
5218 && block
== syms
[j
].block
)
5219 syms
[j
].symbol
= NULL
;
5222 if (is_new_style_renaming
)
5226 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5227 if (syms
[j
].symbol
!= NULL
)
5235 /* Extract the function name associated to CURRENT_BLOCK.
5236 Abort if unable to do so. */
5238 if (current_block
== NULL
)
5241 current_function
= block_linkage_function (current_block
);
5242 if (current_function
== NULL
)
5245 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5246 if (current_function_name
== NULL
)
5249 /* Check each of the symbols, and remove it from the list if it is
5250 a type corresponding to a renaming that is out of the scope of
5251 the current block. */
5256 if (ada_parse_renaming (syms
[i
].symbol
, NULL
, NULL
, NULL
)
5257 == ADA_OBJECT_RENAMING
5258 && old_renaming_is_invisible (syms
[i
].symbol
, current_function_name
))
5262 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5263 syms
[j
- 1] = syms
[j
];
5273 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5274 whose name and domain match NAME and DOMAIN respectively.
5275 If no match was found, then extend the search to "enclosing"
5276 routines (in other words, if we're inside a nested function,
5277 search the symbols defined inside the enclosing functions).
5278 If WILD_MATCH_P is nonzero, perform the naming matching in
5279 "wild" mode (see function "wild_match" for more info).
5281 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5284 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5285 const struct block
*block
, domain_enum domain
,
5288 int block_depth
= 0;
5290 while (block
!= NULL
)
5293 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5296 /* If we found a non-function match, assume that's the one. */
5297 if (is_nonfunction (defns_collected (obstackp
, 0),
5298 num_defns_collected (obstackp
)))
5301 block
= BLOCK_SUPERBLOCK (block
);
5304 /* If no luck so far, try to find NAME as a local symbol in some lexically
5305 enclosing subprogram. */
5306 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5307 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5310 /* An object of this type is used as the user_data argument when
5311 calling the map_matching_symbols method. */
5315 struct objfile
*objfile
;
5316 struct obstack
*obstackp
;
5317 struct symbol
*arg_sym
;
5321 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5322 to a list of symbols. DATA0 is a pointer to a struct match_data *
5323 containing the obstack that collects the symbol list, the file that SYM
5324 must come from, a flag indicating whether a non-argument symbol has
5325 been found in the current block, and the last argument symbol
5326 passed in SYM within the current block (if any). When SYM is null,
5327 marking the end of a block, the argument symbol is added if no
5328 other has been found. */
5331 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5333 struct match_data
*data
= (struct match_data
*) data0
;
5337 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5338 add_defn_to_vec (data
->obstackp
,
5339 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5341 data
->found_sym
= 0;
5342 data
->arg_sym
= NULL
;
5346 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5348 else if (SYMBOL_IS_ARGUMENT (sym
))
5349 data
->arg_sym
= sym
;
5352 data
->found_sym
= 1;
5353 add_defn_to_vec (data
->obstackp
,
5354 fixup_symbol_section (sym
, data
->objfile
),
5361 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are targetted
5362 by renamings matching NAME in BLOCK. Add these symbols to OBSTACKP. If
5363 WILD_MATCH_P is nonzero, perform the naming matching in "wild" mode (see
5364 function "wild_match" for more information). Return whether we found such
5368 ada_add_block_renamings (struct obstack
*obstackp
,
5369 const struct block
*block
,
5374 struct using_direct
*renaming
;
5375 int defns_mark
= num_defns_collected (obstackp
);
5377 for (renaming
= block_using (block
);
5379 renaming
= renaming
->next
)
5384 /* Avoid infinite recursions: skip this renaming if we are actually
5385 already traversing it.
5387 Currently, symbol lookup in Ada don't use the namespace machinery from
5388 C++/Fortran support: skip namespace imports that use them. */
5389 if (renaming
->searched
5390 || (renaming
->import_src
!= NULL
5391 && renaming
->import_src
[0] != '\0')
5392 || (renaming
->import_dest
!= NULL
5393 && renaming
->import_dest
[0] != '\0'))
5395 renaming
->searched
= 1;
5397 /* TODO: here, we perform another name-based symbol lookup, which can
5398 pull its own multiple overloads. In theory, we should be able to do
5399 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5400 not a simple name. But in order to do this, we would need to enhance
5401 the DWARF reader to associate a symbol to this renaming, instead of a
5402 name. So, for now, we do something simpler: re-use the C++/Fortran
5403 namespace machinery. */
5404 r_name
= (renaming
->alias
!= NULL
5406 : renaming
->declaration
);
5408 = wild_match_p
? wild_match (r_name
, name
) : strcmp (r_name
, name
);
5409 if (name_match
== 0)
5410 ada_add_all_symbols (obstackp
, block
, renaming
->declaration
, domain
,
5412 renaming
->searched
= 0;
5414 return num_defns_collected (obstackp
) != defns_mark
;
5417 /* Implements compare_names, but only applying the comparision using
5418 the given CASING. */
5421 compare_names_with_case (const char *string1
, const char *string2
,
5422 enum case_sensitivity casing
)
5424 while (*string1
!= '\0' && *string2
!= '\0')
5428 if (isspace (*string1
) || isspace (*string2
))
5429 return strcmp_iw_ordered (string1
, string2
);
5431 if (casing
== case_sensitive_off
)
5433 c1
= tolower (*string1
);
5434 c2
= tolower (*string2
);
5451 return strcmp_iw_ordered (string1
, string2
);
5453 if (*string2
== '\0')
5455 if (is_name_suffix (string1
))
5462 if (*string2
== '(')
5463 return strcmp_iw_ordered (string1
, string2
);
5466 if (casing
== case_sensitive_off
)
5467 return tolower (*string1
) - tolower (*string2
);
5469 return *string1
- *string2
;
5474 /* Compare STRING1 to STRING2, with results as for strcmp.
5475 Compatible with strcmp_iw_ordered in that...
5477 strcmp_iw_ordered (STRING1, STRING2) <= 0
5481 compare_names (STRING1, STRING2) <= 0
5483 (they may differ as to what symbols compare equal). */
5486 compare_names (const char *string1
, const char *string2
)
5490 /* Similar to what strcmp_iw_ordered does, we need to perform
5491 a case-insensitive comparison first, and only resort to
5492 a second, case-sensitive, comparison if the first one was
5493 not sufficient to differentiate the two strings. */
5495 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5497 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5502 /* Add to OBSTACKP all non-local symbols whose name and domain match
5503 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5504 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5507 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5508 domain_enum domain
, int global
,
5511 struct objfile
*objfile
;
5512 struct compunit_symtab
*cu
;
5513 struct match_data data
;
5515 memset (&data
, 0, sizeof data
);
5516 data
.obstackp
= obstackp
;
5518 ALL_OBJFILES (objfile
)
5520 data
.objfile
= objfile
;
5523 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5524 aux_add_nonlocal_symbols
, &data
,
5527 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5528 aux_add_nonlocal_symbols
, &data
,
5529 full_match
, compare_names
);
5531 ALL_OBJFILE_COMPUNITS (objfile
, cu
)
5533 const struct block
*global_block
5534 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5536 if (ada_add_block_renamings (obstackp
, global_block
, name
, domain
,
5542 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5544 ALL_OBJFILES (objfile
)
5546 char *name1
= (char *) alloca (strlen (name
) + sizeof ("_ada_"));
5547 strcpy (name1
, "_ada_");
5548 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5549 data
.objfile
= objfile
;
5550 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5552 aux_add_nonlocal_symbols
,
5554 full_match
, compare_names
);
5559 /* Find symbols in DOMAIN matching NAME, in BLOCK and, if FULL_SEARCH is
5560 non-zero, enclosing scope and in global scopes, returning the number of
5561 matches. Add these to OBSTACKP.
5563 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5564 symbol match within the nest of blocks whose innermost member is BLOCK,
5565 is the one match returned (no other matches in that or
5566 enclosing blocks is returned). If there are any matches in or
5567 surrounding BLOCK, then these alone are returned.
5569 Names prefixed with "standard__" are handled specially: "standard__"
5570 is first stripped off, and only static and global symbols are searched.
5572 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5573 to lookup global symbols. */
5576 ada_add_all_symbols (struct obstack
*obstackp
,
5577 const struct block
*block
,
5581 int *made_global_lookup_p
)
5584 const int wild_match_p
= should_use_wild_match (name
);
5586 if (made_global_lookup_p
)
5587 *made_global_lookup_p
= 0;
5589 /* Special case: If the user specifies a symbol name inside package
5590 Standard, do a non-wild matching of the symbol name without
5591 the "standard__" prefix. This was primarily introduced in order
5592 to allow the user to specifically access the standard exceptions
5593 using, for instance, Standard.Constraint_Error when Constraint_Error
5594 is ambiguous (due to the user defining its own Constraint_Error
5595 entity inside its program). */
5596 if (startswith (name
, "standard__"))
5599 name
= name
+ sizeof ("standard__") - 1;
5602 /* Check the non-global symbols. If we have ANY match, then we're done. */
5607 ada_add_local_symbols (obstackp
, name
, block
, domain
, wild_match_p
);
5610 /* In the !full_search case we're are being called by
5611 ada_iterate_over_symbols, and we don't want to search
5613 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5616 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5620 /* No non-global symbols found. Check our cache to see if we have
5621 already performed this search before. If we have, then return
5624 if (lookup_cached_symbol (name
, domain
, &sym
, &block
))
5627 add_defn_to_vec (obstackp
, sym
, block
);
5631 if (made_global_lookup_p
)
5632 *made_global_lookup_p
= 1;
5634 /* Search symbols from all global blocks. */
5636 add_nonlocal_symbols (obstackp
, name
, domain
, 1, wild_match_p
);
5638 /* Now add symbols from all per-file blocks if we've gotten no hits
5639 (not strictly correct, but perhaps better than an error). */
5641 if (num_defns_collected (obstackp
) == 0)
5642 add_nonlocal_symbols (obstackp
, name
, domain
, 0, wild_match_p
);
5645 /* Find symbols in DOMAIN matching NAME, in BLOCK and, if full_search is
5646 non-zero, enclosing scope and in global scopes, returning the number of
5648 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5649 indicating the symbols found and the blocks and symbol tables (if
5650 any) in which they were found. This vector is transient---good only to
5651 the next call of ada_lookup_symbol_list.
5653 When full_search is non-zero, any non-function/non-enumeral
5654 symbol match within the nest of blocks whose innermost member is BLOCK,
5655 is the one match returned (no other matches in that or
5656 enclosing blocks is returned). If there are any matches in or
5657 surrounding BLOCK, then these alone are returned.
5659 Names prefixed with "standard__" are handled specially: "standard__"
5660 is first stripped off, and only static and global symbols are searched. */
5663 ada_lookup_symbol_list_worker (const char *name
, const struct block
*block
,
5665 struct block_symbol
**results
,
5668 const int wild_match_p
= should_use_wild_match (name
);
5669 int syms_from_global_search
;
5672 obstack_free (&symbol_list_obstack
, NULL
);
5673 obstack_init (&symbol_list_obstack
);
5674 ada_add_all_symbols (&symbol_list_obstack
, block
, name
, domain
,
5675 full_search
, &syms_from_global_search
);
5677 ndefns
= num_defns_collected (&symbol_list_obstack
);
5678 *results
= defns_collected (&symbol_list_obstack
, 1);
5680 ndefns
= remove_extra_symbols (*results
, ndefns
);
5682 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5683 cache_symbol (name
, domain
, NULL
, NULL
);
5685 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5686 cache_symbol (name
, domain
, (*results
)[0].symbol
, (*results
)[0].block
);
5688 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block
);
5692 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5693 in global scopes, returning the number of matches, and setting *RESULTS
5694 to a vector of (SYM,BLOCK) tuples.
5695 See ada_lookup_symbol_list_worker for further details. */
5698 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5699 domain_enum domain
, struct block_symbol
**results
)
5701 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5704 /* Implementation of the la_iterate_over_symbols method. */
5707 ada_iterate_over_symbols (const struct block
*block
,
5708 const char *name
, domain_enum domain
,
5709 symbol_found_callback_ftype
*callback
,
5713 struct block_symbol
*results
;
5715 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5716 for (i
= 0; i
< ndefs
; ++i
)
5718 if (! (*callback
) (results
[i
].symbol
, data
))
5723 /* If NAME is the name of an entity, return a string that should
5724 be used to look that entity up in Ada units. This string should
5725 be deallocated after use using xfree.
5727 NAME can have any form that the "break" or "print" commands might
5728 recognize. In other words, it does not have to be the "natural"
5729 name, or the "encoded" name. */
5732 ada_name_for_lookup (const char *name
)
5735 int nlen
= strlen (name
);
5737 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5739 canon
= (char *) xmalloc (nlen
- 1);
5740 memcpy (canon
, name
+ 1, nlen
- 2);
5741 canon
[nlen
- 2] = '\0';
5744 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5748 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5749 to 1, but choosing the first symbol found if there are multiple
5752 The result is stored in *INFO, which must be non-NULL.
5753 If no match is found, INFO->SYM is set to NULL. */
5756 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5758 struct block_symbol
*info
)
5760 struct block_symbol
*candidates
;
5763 gdb_assert (info
!= NULL
);
5764 memset (info
, 0, sizeof (struct block_symbol
));
5766 n_candidates
= ada_lookup_symbol_list (name
, block
, domain
, &candidates
);
5767 if (n_candidates
== 0)
5770 *info
= candidates
[0];
5771 info
->symbol
= fixup_symbol_section (info
->symbol
, NULL
);
5774 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5775 scope and in global scopes, or NULL if none. NAME is folded and
5776 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5777 choosing the first symbol if there are multiple choices.
5778 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5781 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5782 domain_enum domain
, int *is_a_field_of_this
)
5784 struct block_symbol info
;
5786 if (is_a_field_of_this
!= NULL
)
5787 *is_a_field_of_this
= 0;
5789 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5790 block0
, domain
, &info
);
5794 static struct block_symbol
5795 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5797 const struct block
*block
,
5798 const domain_enum domain
)
5800 struct block_symbol sym
;
5802 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5803 if (sym
.symbol
!= NULL
)
5806 /* If we haven't found a match at this point, try the primitive
5807 types. In other languages, this search is performed before
5808 searching for global symbols in order to short-circuit that
5809 global-symbol search if it happens that the name corresponds
5810 to a primitive type. But we cannot do the same in Ada, because
5811 it is perfectly legitimate for a program to declare a type which
5812 has the same name as a standard type. If looking up a type in
5813 that situation, we have traditionally ignored the primitive type
5814 in favor of user-defined types. This is why, unlike most other
5815 languages, we search the primitive types this late and only after
5816 having searched the global symbols without success. */
5818 if (domain
== VAR_DOMAIN
)
5820 struct gdbarch
*gdbarch
;
5823 gdbarch
= target_gdbarch ();
5825 gdbarch
= block_gdbarch (block
);
5826 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5827 if (sym
.symbol
!= NULL
)
5831 return (struct block_symbol
) {NULL
, NULL
};
5835 /* True iff STR is a possible encoded suffix of a normal Ada name
5836 that is to be ignored for matching purposes. Suffixes of parallel
5837 names (e.g., XVE) are not included here. Currently, the possible suffixes
5838 are given by any of the regular expressions:
5840 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5841 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5842 TKB [subprogram suffix for task bodies]
5843 _E[0-9]+[bs]$ [protected object entry suffixes]
5844 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5846 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5847 match is performed. This sequence is used to differentiate homonyms,
5848 is an optional part of a valid name suffix. */
5851 is_name_suffix (const char *str
)
5854 const char *matching
;
5855 const int len
= strlen (str
);
5857 /* Skip optional leading __[0-9]+. */
5859 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5862 while (isdigit (str
[0]))
5868 if (str
[0] == '.' || str
[0] == '$')
5871 while (isdigit (matching
[0]))
5873 if (matching
[0] == '\0')
5879 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5882 while (isdigit (matching
[0]))
5884 if (matching
[0] == '\0')
5888 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5890 if (strcmp (str
, "TKB") == 0)
5894 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5895 with a N at the end. Unfortunately, the compiler uses the same
5896 convention for other internal types it creates. So treating
5897 all entity names that end with an "N" as a name suffix causes
5898 some regressions. For instance, consider the case of an enumerated
5899 type. To support the 'Image attribute, it creates an array whose
5901 Having a single character like this as a suffix carrying some
5902 information is a bit risky. Perhaps we should change the encoding
5903 to be something like "_N" instead. In the meantime, do not do
5904 the following check. */
5905 /* Protected Object Subprograms */
5906 if (len
== 1 && str
[0] == 'N')
5911 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5914 while (isdigit (matching
[0]))
5916 if ((matching
[0] == 'b' || matching
[0] == 's')
5917 && matching
[1] == '\0')
5921 /* ??? We should not modify STR directly, as we are doing below. This
5922 is fine in this case, but may become problematic later if we find
5923 that this alternative did not work, and want to try matching
5924 another one from the begining of STR. Since we modified it, we
5925 won't be able to find the begining of the string anymore! */
5929 while (str
[0] != '_' && str
[0] != '\0')
5931 if (str
[0] != 'n' && str
[0] != 'b')
5937 if (str
[0] == '\000')
5942 if (str
[1] != '_' || str
[2] == '\000')
5946 if (strcmp (str
+ 3, "JM") == 0)
5948 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5949 the LJM suffix in favor of the JM one. But we will
5950 still accept LJM as a valid suffix for a reasonable
5951 amount of time, just to allow ourselves to debug programs
5952 compiled using an older version of GNAT. */
5953 if (strcmp (str
+ 3, "LJM") == 0)
5957 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5958 || str
[4] == 'U' || str
[4] == 'P')
5960 if (str
[4] == 'R' && str
[5] != 'T')
5964 if (!isdigit (str
[2]))
5966 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5967 if (!isdigit (str
[k
]) && str
[k
] != '_')
5971 if (str
[0] == '$' && isdigit (str
[1]))
5973 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5974 if (!isdigit (str
[k
]) && str
[k
] != '_')
5981 /* Return non-zero if the string starting at NAME and ending before
5982 NAME_END contains no capital letters. */
5985 is_valid_name_for_wild_match (const char *name0
)
5987 const char *decoded_name
= ada_decode (name0
);
5990 /* If the decoded name starts with an angle bracket, it means that
5991 NAME0 does not follow the GNAT encoding format. It should then
5992 not be allowed as a possible wild match. */
5993 if (decoded_name
[0] == '<')
5996 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5997 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6003 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6004 that could start a simple name. Assumes that *NAMEP points into
6005 the string beginning at NAME0. */
6008 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6010 const char *name
= *namep
;
6020 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6023 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6028 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6029 || name
[2] == target0
))
6037 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6047 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
6048 informational suffixes of NAME (i.e., for which is_name_suffix is
6049 true). Assumes that PATN is a lower-cased Ada simple name. */
6052 wild_match (const char *name
, const char *patn
)
6055 const char *name0
= name
;
6059 const char *match
= name
;
6063 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6066 if (*p
== '\0' && is_name_suffix (name
))
6067 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
6069 if (name
[-1] == '_')
6072 if (!advance_wild_match (&name
, name0
, *patn
))
6077 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
6078 informational suffix. */
6081 full_match (const char *sym_name
, const char *search_name
)
6083 return !match_name (sym_name
, search_name
, 0);
6087 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
6088 vector *defn_symbols, updating the list of symbols in OBSTACKP
6089 (if necessary). If WILD, treat as NAME with a wildcard prefix.
6090 OBJFILE is the section containing BLOCK. */
6093 ada_add_block_symbols (struct obstack
*obstackp
,
6094 const struct block
*block
, const char *name
,
6095 domain_enum domain
, struct objfile
*objfile
,
6098 struct block_iterator iter
;
6099 int name_len
= strlen (name
);
6100 /* A matching argument symbol, if any. */
6101 struct symbol
*arg_sym
;
6102 /* Set true when we find a matching non-argument symbol. */
6110 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
6111 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
6113 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6114 SYMBOL_DOMAIN (sym
), domain
)
6115 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
6117 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
6119 else if (SYMBOL_IS_ARGUMENT (sym
))
6124 add_defn_to_vec (obstackp
,
6125 fixup_symbol_section (sym
, objfile
),
6133 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
6134 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
6136 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6137 SYMBOL_DOMAIN (sym
), domain
))
6139 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6141 if (SYMBOL_IS_ARGUMENT (sym
))
6146 add_defn_to_vec (obstackp
,
6147 fixup_symbol_section (sym
, objfile
),
6155 /* Handle renamings. */
6157 if (ada_add_block_renamings (obstackp
, block
, name
, domain
, wild
))
6160 if (!found_sym
&& arg_sym
!= NULL
)
6162 add_defn_to_vec (obstackp
,
6163 fixup_symbol_section (arg_sym
, objfile
),
6172 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6174 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6175 SYMBOL_DOMAIN (sym
), domain
))
6179 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6182 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6184 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6189 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6191 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6193 if (SYMBOL_IS_ARGUMENT (sym
))
6198 add_defn_to_vec (obstackp
,
6199 fixup_symbol_section (sym
, objfile
),
6207 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6208 They aren't parameters, right? */
6209 if (!found_sym
&& arg_sym
!= NULL
)
6211 add_defn_to_vec (obstackp
,
6212 fixup_symbol_section (arg_sym
, objfile
),
6219 /* Symbol Completion */
6221 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
6222 name in a form that's appropriate for the completion. The result
6223 does not need to be deallocated, but is only good until the next call.
6225 TEXT_LEN is equal to the length of TEXT.
6226 Perform a wild match if WILD_MATCH_P is set.
6227 ENCODED_P should be set if TEXT represents the start of a symbol name
6228 in its encoded form. */
6231 symbol_completion_match (const char *sym_name
,
6232 const char *text
, int text_len
,
6233 int wild_match_p
, int encoded_p
)
6235 const int verbatim_match
= (text
[0] == '<');
6240 /* Strip the leading angle bracket. */
6245 /* First, test against the fully qualified name of the symbol. */
6247 if (strncmp (sym_name
, text
, text_len
) == 0)
6250 if (match
&& !encoded_p
)
6252 /* One needed check before declaring a positive match is to verify
6253 that iff we are doing a verbatim match, the decoded version
6254 of the symbol name starts with '<'. Otherwise, this symbol name
6255 is not a suitable completion. */
6256 const char *sym_name_copy
= sym_name
;
6257 int has_angle_bracket
;
6259 sym_name
= ada_decode (sym_name
);
6260 has_angle_bracket
= (sym_name
[0] == '<');
6261 match
= (has_angle_bracket
== verbatim_match
);
6262 sym_name
= sym_name_copy
;
6265 if (match
&& !verbatim_match
)
6267 /* When doing non-verbatim match, another check that needs to
6268 be done is to verify that the potentially matching symbol name
6269 does not include capital letters, because the ada-mode would
6270 not be able to understand these symbol names without the
6271 angle bracket notation. */
6274 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6279 /* Second: Try wild matching... */
6281 if (!match
&& wild_match_p
)
6283 /* Since we are doing wild matching, this means that TEXT
6284 may represent an unqualified symbol name. We therefore must
6285 also compare TEXT against the unqualified name of the symbol. */
6286 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6288 if (strncmp (sym_name
, text
, text_len
) == 0)
6292 /* Finally: If we found a mach, prepare the result to return. */
6298 sym_name
= add_angle_brackets (sym_name
);
6301 sym_name
= ada_decode (sym_name
);
6306 /* A companion function to ada_make_symbol_completion_list().
6307 Check if SYM_NAME represents a symbol which name would be suitable
6308 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6309 it is appended at the end of the given string vector SV.
6311 ORIG_TEXT is the string original string from the user command
6312 that needs to be completed. WORD is the entire command on which
6313 completion should be performed. These two parameters are used to
6314 determine which part of the symbol name should be added to the
6316 if WILD_MATCH_P is set, then wild matching is performed.
6317 ENCODED_P should be set if TEXT represents a symbol name in its
6318 encoded formed (in which case the completion should also be
6322 symbol_completion_add (VEC(char_ptr
) **sv
,
6323 const char *sym_name
,
6324 const char *text
, int text_len
,
6325 const char *orig_text
, const char *word
,
6326 int wild_match_p
, int encoded_p
)
6328 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6329 wild_match_p
, encoded_p
);
6335 /* We found a match, so add the appropriate completion to the given
6338 if (word
== orig_text
)
6340 completion
= (char *) xmalloc (strlen (match
) + 5);
6341 strcpy (completion
, match
);
6343 else if (word
> orig_text
)
6345 /* Return some portion of sym_name. */
6346 completion
= (char *) xmalloc (strlen (match
) + 5);
6347 strcpy (completion
, match
+ (word
- orig_text
));
6351 /* Return some of ORIG_TEXT plus sym_name. */
6352 completion
= (char *) xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6353 strncpy (completion
, word
, orig_text
- word
);
6354 completion
[orig_text
- word
] = '\0';
6355 strcat (completion
, match
);
6358 VEC_safe_push (char_ptr
, *sv
, completion
);
6361 /* An object of this type is passed as the user_data argument to the
6362 expand_symtabs_matching method. */
6363 struct add_partial_datum
6365 VEC(char_ptr
) **completions
;
6374 /* A callback for expand_symtabs_matching. */
6377 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6379 struct add_partial_datum
*data
= (struct add_partial_datum
*) user_data
;
6381 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6382 data
->wild_match
, data
->encoded
) != NULL
;
6385 /* Return a list of possible symbol names completing TEXT0. WORD is
6386 the entire command on which completion is made. */
6388 static VEC (char_ptr
) *
6389 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6390 enum type_code code
)
6396 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6398 struct compunit_symtab
*s
;
6399 struct minimal_symbol
*msymbol
;
6400 struct objfile
*objfile
;
6401 const struct block
*b
, *surrounding_static_block
= 0;
6403 struct block_iterator iter
;
6404 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6406 gdb_assert (code
== TYPE_CODE_UNDEF
);
6408 if (text0
[0] == '<')
6410 text
= xstrdup (text0
);
6411 make_cleanup (xfree
, text
);
6412 text_len
= strlen (text
);
6418 text
= xstrdup (ada_encode (text0
));
6419 make_cleanup (xfree
, text
);
6420 text_len
= strlen (text
);
6421 for (i
= 0; i
< text_len
; i
++)
6422 text
[i
] = tolower (text
[i
]);
6424 encoded_p
= (strstr (text0
, "__") != NULL
);
6425 /* If the name contains a ".", then the user is entering a fully
6426 qualified entity name, and the match must not be done in wild
6427 mode. Similarly, if the user wants to complete what looks like
6428 an encoded name, the match must not be done in wild mode. */
6429 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6432 /* First, look at the partial symtab symbols. */
6434 struct add_partial_datum data
;
6436 data
.completions
= &completions
;
6438 data
.text_len
= text_len
;
6441 data
.wild_match
= wild_match_p
;
6442 data
.encoded
= encoded_p
;
6443 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, NULL
,
6447 /* At this point scan through the misc symbol vectors and add each
6448 symbol you find to the list. Eventually we want to ignore
6449 anything that isn't a text symbol (everything else will be
6450 handled by the psymtab code above). */
6452 ALL_MSYMBOLS (objfile
, msymbol
)
6455 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6456 text
, text_len
, text0
, word
, wild_match_p
,
6460 /* Search upwards from currently selected frame (so that we can
6461 complete on local vars. */
6463 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6465 if (!BLOCK_SUPERBLOCK (b
))
6466 surrounding_static_block
= b
; /* For elmin of dups */
6468 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6470 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6471 text
, text_len
, text0
, word
,
6472 wild_match_p
, encoded_p
);
6476 /* Go through the symtabs and check the externs and statics for
6477 symbols which match. */
6479 ALL_COMPUNITS (objfile
, s
)
6482 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6483 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6485 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6486 text
, text_len
, text0
, word
,
6487 wild_match_p
, encoded_p
);
6491 ALL_COMPUNITS (objfile
, s
)
6494 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6495 /* Don't do this block twice. */
6496 if (b
== surrounding_static_block
)
6498 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6500 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6501 text
, text_len
, text0
, word
,
6502 wild_match_p
, encoded_p
);
6506 do_cleanups (old_chain
);
6512 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6513 for tagged types. */
6516 ada_is_dispatch_table_ptr_type (struct type
*type
)
6520 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6523 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6527 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6530 /* Return non-zero if TYPE is an interface tag. */
6533 ada_is_interface_tag (struct type
*type
)
6535 const char *name
= TYPE_NAME (type
);
6540 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6543 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6544 to be invisible to users. */
6547 ada_is_ignored_field (struct type
*type
, int field_num
)
6549 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6552 /* Check the name of that field. */
6554 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6556 /* Anonymous field names should not be printed.
6557 brobecker/2007-02-20: I don't think this can actually happen
6558 but we don't want to print the value of annonymous fields anyway. */
6562 /* Normally, fields whose name start with an underscore ("_")
6563 are fields that have been internally generated by the compiler,
6564 and thus should not be printed. The "_parent" field is special,
6565 however: This is a field internally generated by the compiler
6566 for tagged types, and it contains the components inherited from
6567 the parent type. This field should not be printed as is, but
6568 should not be ignored either. */
6569 if (name
[0] == '_' && !startswith (name
, "_parent"))
6573 /* If this is the dispatch table of a tagged type or an interface tag,
6575 if (ada_is_tagged_type (type
, 1)
6576 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6577 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6580 /* Not a special field, so it should not be ignored. */
6584 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6585 pointer or reference type whose ultimate target has a tag field. */
6588 ada_is_tagged_type (struct type
*type
, int refok
)
6590 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6593 /* True iff TYPE represents the type of X'Tag */
6596 ada_is_tag_type (struct type
*type
)
6598 type
= ada_check_typedef (type
);
6600 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6604 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6606 return (name
!= NULL
6607 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6611 /* The type of the tag on VAL. */
6614 ada_tag_type (struct value
*val
)
6616 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6619 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6620 retired at Ada 05). */
6623 is_ada95_tag (struct value
*tag
)
6625 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6628 /* The value of the tag on VAL. */
6631 ada_value_tag (struct value
*val
)
6633 return ada_value_struct_elt (val
, "_tag", 0);
6636 /* The value of the tag on the object of type TYPE whose contents are
6637 saved at VALADDR, if it is non-null, or is at memory address
6640 static struct value
*
6641 value_tag_from_contents_and_address (struct type
*type
,
6642 const gdb_byte
*valaddr
,
6645 int tag_byte_offset
;
6646 struct type
*tag_type
;
6648 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6651 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6653 : valaddr
+ tag_byte_offset
);
6654 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6656 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6661 static struct type
*
6662 type_from_tag (struct value
*tag
)
6664 const char *type_name
= ada_tag_name (tag
);
6666 if (type_name
!= NULL
)
6667 return ada_find_any_type (ada_encode (type_name
));
6671 /* Given a value OBJ of a tagged type, return a value of this
6672 type at the base address of the object. The base address, as
6673 defined in Ada.Tags, it is the address of the primary tag of
6674 the object, and therefore where the field values of its full
6675 view can be fetched. */
6678 ada_tag_value_at_base_address (struct value
*obj
)
6681 LONGEST offset_to_top
= 0;
6682 struct type
*ptr_type
, *obj_type
;
6684 CORE_ADDR base_address
;
6686 obj_type
= value_type (obj
);
6688 /* It is the responsability of the caller to deref pointers. */
6690 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6691 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6694 tag
= ada_value_tag (obj
);
6698 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6700 if (is_ada95_tag (tag
))
6703 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6704 ptr_type
= lookup_pointer_type (ptr_type
);
6705 val
= value_cast (ptr_type
, tag
);
6709 /* It is perfectly possible that an exception be raised while
6710 trying to determine the base address, just like for the tag;
6711 see ada_tag_name for more details. We do not print the error
6712 message for the same reason. */
6716 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6719 CATCH (e
, RETURN_MASK_ERROR
)
6725 /* If offset is null, nothing to do. */
6727 if (offset_to_top
== 0)
6730 /* -1 is a special case in Ada.Tags; however, what should be done
6731 is not quite clear from the documentation. So do nothing for
6734 if (offset_to_top
== -1)
6737 base_address
= value_address (obj
) - offset_to_top
;
6738 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6740 /* Make sure that we have a proper tag at the new address.
6741 Otherwise, offset_to_top is bogus (which can happen when
6742 the object is not initialized yet). */
6747 obj_type
= type_from_tag (tag
);
6752 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6755 /* Return the "ada__tags__type_specific_data" type. */
6757 static struct type
*
6758 ada_get_tsd_type (struct inferior
*inf
)
6760 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6762 if (data
->tsd_type
== 0)
6763 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6764 return data
->tsd_type
;
6767 /* Return the TSD (type-specific data) associated to the given TAG.
6768 TAG is assumed to be the tag of a tagged-type entity.
6770 May return NULL if we are unable to get the TSD. */
6772 static struct value
*
6773 ada_get_tsd_from_tag (struct value
*tag
)
6778 /* First option: The TSD is simply stored as a field of our TAG.
6779 Only older versions of GNAT would use this format, but we have
6780 to test it first, because there are no visible markers for
6781 the current approach except the absence of that field. */
6783 val
= ada_value_struct_elt (tag
, "tsd", 1);
6787 /* Try the second representation for the dispatch table (in which
6788 there is no explicit 'tsd' field in the referent of the tag pointer,
6789 and instead the tsd pointer is stored just before the dispatch
6792 type
= ada_get_tsd_type (current_inferior());
6795 type
= lookup_pointer_type (lookup_pointer_type (type
));
6796 val
= value_cast (type
, tag
);
6799 return value_ind (value_ptradd (val
, -1));
6802 /* Given the TSD of a tag (type-specific data), return a string
6803 containing the name of the associated type.
6805 The returned value is good until the next call. May return NULL
6806 if we are unable to determine the tag name. */
6809 ada_tag_name_from_tsd (struct value
*tsd
)
6811 static char name
[1024];
6815 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6818 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6819 for (p
= name
; *p
!= '\0'; p
+= 1)
6825 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6828 Return NULL if the TAG is not an Ada tag, or if we were unable to
6829 determine the name of that tag. The result is good until the next
6833 ada_tag_name (struct value
*tag
)
6837 if (!ada_is_tag_type (value_type (tag
)))
6840 /* It is perfectly possible that an exception be raised while trying
6841 to determine the TAG's name, even under normal circumstances:
6842 The associated variable may be uninitialized or corrupted, for
6843 instance. We do not let any exception propagate past this point.
6844 instead we return NULL.
6846 We also do not print the error message either (which often is very
6847 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6848 the caller print a more meaningful message if necessary. */
6851 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6854 name
= ada_tag_name_from_tsd (tsd
);
6856 CATCH (e
, RETURN_MASK_ERROR
)
6864 /* The parent type of TYPE, or NULL if none. */
6867 ada_parent_type (struct type
*type
)
6871 type
= ada_check_typedef (type
);
6873 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6876 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6877 if (ada_is_parent_field (type
, i
))
6879 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6881 /* If the _parent field is a pointer, then dereference it. */
6882 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6883 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6884 /* If there is a parallel XVS type, get the actual base type. */
6885 parent_type
= ada_get_base_type (parent_type
);
6887 return ada_check_typedef (parent_type
);
6893 /* True iff field number FIELD_NUM of structure type TYPE contains the
6894 parent-type (inherited) fields of a derived type. Assumes TYPE is
6895 a structure type with at least FIELD_NUM+1 fields. */
6898 ada_is_parent_field (struct type
*type
, int field_num
)
6900 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6902 return (name
!= NULL
6903 && (startswith (name
, "PARENT")
6904 || startswith (name
, "_parent")));
6907 /* True iff field number FIELD_NUM of structure type TYPE is a
6908 transparent wrapper field (which should be silently traversed when doing
6909 field selection and flattened when printing). Assumes TYPE is a
6910 structure type with at least FIELD_NUM+1 fields. Such fields are always
6914 ada_is_wrapper_field (struct type
*type
, int field_num
)
6916 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6918 return (name
!= NULL
6919 && (startswith (name
, "PARENT")
6920 || strcmp (name
, "REP") == 0
6921 || startswith (name
, "_parent")
6922 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6925 /* True iff field number FIELD_NUM of structure or union type TYPE
6926 is a variant wrapper. Assumes TYPE is a structure type with at least
6927 FIELD_NUM+1 fields. */
6930 ada_is_variant_part (struct type
*type
, int field_num
)
6932 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6934 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6935 || (is_dynamic_field (type
, field_num
)
6936 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6937 == TYPE_CODE_UNION
)));
6940 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6941 whose discriminants are contained in the record type OUTER_TYPE,
6942 returns the type of the controlling discriminant for the variant.
6943 May return NULL if the type could not be found. */
6946 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6948 char *name
= ada_variant_discrim_name (var_type
);
6950 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6953 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6954 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6955 represents a 'when others' clause; otherwise 0. */
6958 ada_is_others_clause (struct type
*type
, int field_num
)
6960 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6962 return (name
!= NULL
&& name
[0] == 'O');
6965 /* Assuming that TYPE0 is the type of the variant part of a record,
6966 returns the name of the discriminant controlling the variant.
6967 The value is valid until the next call to ada_variant_discrim_name. */
6970 ada_variant_discrim_name (struct type
*type0
)
6972 static char *result
= NULL
;
6973 static size_t result_len
= 0;
6976 const char *discrim_end
;
6977 const char *discrim_start
;
6979 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6980 type
= TYPE_TARGET_TYPE (type0
);
6984 name
= ada_type_name (type
);
6986 if (name
== NULL
|| name
[0] == '\000')
6989 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6992 if (startswith (discrim_end
, "___XVN"))
6995 if (discrim_end
== name
)
6998 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7001 if (discrim_start
== name
+ 1)
7003 if ((discrim_start
> name
+ 3
7004 && startswith (discrim_start
- 3, "___"))
7005 || discrim_start
[-1] == '.')
7009 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7010 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7011 result
[discrim_end
- discrim_start
] = '\0';
7015 /* Scan STR for a subtype-encoded number, beginning at position K.
7016 Put the position of the character just past the number scanned in
7017 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7018 Return 1 if there was a valid number at the given position, and 0
7019 otherwise. A "subtype-encoded" number consists of the absolute value
7020 in decimal, followed by the letter 'm' to indicate a negative number.
7021 Assumes 0m does not occur. */
7024 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7028 if (!isdigit (str
[k
]))
7031 /* Do it the hard way so as not to make any assumption about
7032 the relationship of unsigned long (%lu scan format code) and
7035 while (isdigit (str
[k
]))
7037 RU
= RU
* 10 + (str
[k
] - '0');
7044 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7050 /* NOTE on the above: Technically, C does not say what the results of
7051 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7052 number representable as a LONGEST (although either would probably work
7053 in most implementations). When RU>0, the locution in the then branch
7054 above is always equivalent to the negative of RU. */
7061 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7062 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7063 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7066 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7068 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7082 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7092 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7093 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7095 if (val
>= L
&& val
<= U
)
7107 /* FIXME: Lots of redundancy below. Try to consolidate. */
7109 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7110 ARG_TYPE, extract and return the value of one of its (non-static)
7111 fields. FIELDNO says which field. Differs from value_primitive_field
7112 only in that it can handle packed values of arbitrary type. */
7114 static struct value
*
7115 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7116 struct type
*arg_type
)
7120 arg_type
= ada_check_typedef (arg_type
);
7121 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7123 /* Handle packed fields. */
7125 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
7127 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7128 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7130 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7131 offset
+ bit_pos
/ 8,
7132 bit_pos
% 8, bit_size
, type
);
7135 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7138 /* Find field with name NAME in object of type TYPE. If found,
7139 set the following for each argument that is non-null:
7140 - *FIELD_TYPE_P to the field's type;
7141 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7142 an object of that type;
7143 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7144 - *BIT_SIZE_P to its size in bits if the field is packed, and
7146 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7147 fields up to but not including the desired field, or by the total
7148 number of fields if not found. A NULL value of NAME never
7149 matches; the function just counts visible fields in this case.
7151 Returns 1 if found, 0 otherwise. */
7154 find_struct_field (const char *name
, struct type
*type
, int offset
,
7155 struct type
**field_type_p
,
7156 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7161 type
= ada_check_typedef (type
);
7163 if (field_type_p
!= NULL
)
7164 *field_type_p
= NULL
;
7165 if (byte_offset_p
!= NULL
)
7167 if (bit_offset_p
!= NULL
)
7169 if (bit_size_p
!= NULL
)
7172 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7174 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7175 int fld_offset
= offset
+ bit_pos
/ 8;
7176 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7178 if (t_field_name
== NULL
)
7181 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7183 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7185 if (field_type_p
!= NULL
)
7186 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7187 if (byte_offset_p
!= NULL
)
7188 *byte_offset_p
= fld_offset
;
7189 if (bit_offset_p
!= NULL
)
7190 *bit_offset_p
= bit_pos
% 8;
7191 if (bit_size_p
!= NULL
)
7192 *bit_size_p
= bit_size
;
7195 else if (ada_is_wrapper_field (type
, i
))
7197 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7198 field_type_p
, byte_offset_p
, bit_offset_p
,
7199 bit_size_p
, index_p
))
7202 else if (ada_is_variant_part (type
, i
))
7204 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7207 struct type
*field_type
7208 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7210 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7212 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7214 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7215 field_type_p
, byte_offset_p
,
7216 bit_offset_p
, bit_size_p
, index_p
))
7220 else if (index_p
!= NULL
)
7226 /* Number of user-visible fields in record type TYPE. */
7229 num_visible_fields (struct type
*type
)
7234 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7238 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7239 and search in it assuming it has (class) type TYPE.
7240 If found, return value, else return NULL.
7242 Searches recursively through wrapper fields (e.g., '_parent'). */
7244 static struct value
*
7245 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7250 type
= ada_check_typedef (type
);
7251 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7253 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7255 if (t_field_name
== NULL
)
7258 else if (field_name_match (t_field_name
, name
))
7259 return ada_value_primitive_field (arg
, offset
, i
, type
);
7261 else if (ada_is_wrapper_field (type
, i
))
7263 struct value
*v
= /* Do not let indent join lines here. */
7264 ada_search_struct_field (name
, arg
,
7265 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7266 TYPE_FIELD_TYPE (type
, i
));
7272 else if (ada_is_variant_part (type
, i
))
7274 /* PNH: Do we ever get here? See find_struct_field. */
7276 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7278 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7280 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7282 struct value
*v
= ada_search_struct_field
/* Force line
7285 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7286 TYPE_FIELD_TYPE (field_type
, j
));
7296 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7297 int, struct type
*);
7300 /* Return field #INDEX in ARG, where the index is that returned by
7301 * find_struct_field through its INDEX_P argument. Adjust the address
7302 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7303 * If found, return value, else return NULL. */
7305 static struct value
*
7306 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7309 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7313 /* Auxiliary function for ada_index_struct_field. Like
7314 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7317 static struct value
*
7318 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7322 type
= ada_check_typedef (type
);
7324 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7326 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7328 else if (ada_is_wrapper_field (type
, i
))
7330 struct value
*v
= /* Do not let indent join lines here. */
7331 ada_index_struct_field_1 (index_p
, arg
,
7332 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7333 TYPE_FIELD_TYPE (type
, i
));
7339 else if (ada_is_variant_part (type
, i
))
7341 /* PNH: Do we ever get here? See ada_search_struct_field,
7342 find_struct_field. */
7343 error (_("Cannot assign this kind of variant record"));
7345 else if (*index_p
== 0)
7346 return ada_value_primitive_field (arg
, offset
, i
, type
);
7353 /* Given ARG, a value of type (pointer or reference to a)*
7354 structure/union, extract the component named NAME from the ultimate
7355 target structure/union and return it as a value with its
7358 The routine searches for NAME among all members of the structure itself
7359 and (recursively) among all members of any wrapper members
7362 If NO_ERR, then simply return NULL in case of error, rather than
7366 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7368 struct type
*t
, *t1
;
7372 t1
= t
= ada_check_typedef (value_type (arg
));
7373 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7375 t1
= TYPE_TARGET_TYPE (t
);
7378 t1
= ada_check_typedef (t1
);
7379 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7381 arg
= coerce_ref (arg
);
7386 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7388 t1
= TYPE_TARGET_TYPE (t
);
7391 t1
= ada_check_typedef (t1
);
7392 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7394 arg
= value_ind (arg
);
7401 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7405 v
= ada_search_struct_field (name
, arg
, 0, t
);
7408 int bit_offset
, bit_size
, byte_offset
;
7409 struct type
*field_type
;
7412 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7413 address
= value_address (ada_value_ind (arg
));
7415 address
= value_address (ada_coerce_ref (arg
));
7417 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7418 if (find_struct_field (name
, t1
, 0,
7419 &field_type
, &byte_offset
, &bit_offset
,
7424 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7425 arg
= ada_coerce_ref (arg
);
7427 arg
= ada_value_ind (arg
);
7428 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7429 bit_offset
, bit_size
,
7433 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7437 if (v
!= NULL
|| no_err
)
7440 error (_("There is no member named %s."), name
);
7446 error (_("Attempt to extract a component of "
7447 "a value that is not a record."));
7450 /* Given a type TYPE, look up the type of the component of type named NAME.
7451 If DISPP is non-null, add its byte displacement from the beginning of a
7452 structure (pointed to by a value) of type TYPE to *DISPP (does not
7453 work for packed fields).
7455 Matches any field whose name has NAME as a prefix, possibly
7458 TYPE can be either a struct or union. If REFOK, TYPE may also
7459 be a (pointer or reference)+ to a struct or union, and the
7460 ultimate target type will be searched.
7462 Looks recursively into variant clauses and parent types.
7464 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7465 TYPE is not a type of the right kind. */
7467 static struct type
*
7468 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7469 int noerr
, int *dispp
)
7476 if (refok
&& type
!= NULL
)
7479 type
= ada_check_typedef (type
);
7480 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7481 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7483 type
= TYPE_TARGET_TYPE (type
);
7487 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7488 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7494 target_terminal_ours ();
7495 gdb_flush (gdb_stdout
);
7497 error (_("Type (null) is not a structure or union type"));
7500 /* XXX: type_sprint */
7501 fprintf_unfiltered (gdb_stderr
, _("Type "));
7502 type_print (type
, "", gdb_stderr
, -1);
7503 error (_(" is not a structure or union type"));
7508 type
= to_static_fixed_type (type
);
7510 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7512 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7516 if (t_field_name
== NULL
)
7519 else if (field_name_match (t_field_name
, name
))
7522 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7523 return TYPE_FIELD_TYPE (type
, i
);
7526 else if (ada_is_wrapper_field (type
, i
))
7529 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7534 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7539 else if (ada_is_variant_part (type
, i
))
7542 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7545 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7547 /* FIXME pnh 2008/01/26: We check for a field that is
7548 NOT wrapped in a struct, since the compiler sometimes
7549 generates these for unchecked variant types. Revisit
7550 if the compiler changes this practice. */
7551 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7553 if (v_field_name
!= NULL
7554 && field_name_match (v_field_name
, name
))
7555 t
= TYPE_FIELD_TYPE (field_type
, j
);
7557 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7564 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7575 target_terminal_ours ();
7576 gdb_flush (gdb_stdout
);
7579 /* XXX: type_sprint */
7580 fprintf_unfiltered (gdb_stderr
, _("Type "));
7581 type_print (type
, "", gdb_stderr
, -1);
7582 error (_(" has no component named <null>"));
7586 /* XXX: type_sprint */
7587 fprintf_unfiltered (gdb_stderr
, _("Type "));
7588 type_print (type
, "", gdb_stderr
, -1);
7589 error (_(" has no component named %s"), name
);
7596 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7597 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7598 represents an unchecked union (that is, the variant part of a
7599 record that is named in an Unchecked_Union pragma). */
7602 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7604 char *discrim_name
= ada_variant_discrim_name (var_type
);
7606 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7611 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7612 within a value of type OUTER_TYPE that is stored in GDB at
7613 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7614 numbering from 0) is applicable. Returns -1 if none are. */
7617 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7618 const gdb_byte
*outer_valaddr
)
7622 char *discrim_name
= ada_variant_discrim_name (var_type
);
7623 struct value
*outer
;
7624 struct value
*discrim
;
7625 LONGEST discrim_val
;
7627 /* Using plain value_from_contents_and_address here causes problems
7628 because we will end up trying to resolve a type that is currently
7629 being constructed. */
7630 outer
= value_from_contents_and_address_unresolved (outer_type
,
7632 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7633 if (discrim
== NULL
)
7635 discrim_val
= value_as_long (discrim
);
7638 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7640 if (ada_is_others_clause (var_type
, i
))
7642 else if (ada_in_variant (discrim_val
, var_type
, i
))
7646 return others_clause
;
7651 /* Dynamic-Sized Records */
7653 /* Strategy: The type ostensibly attached to a value with dynamic size
7654 (i.e., a size that is not statically recorded in the debugging
7655 data) does not accurately reflect the size or layout of the value.
7656 Our strategy is to convert these values to values with accurate,
7657 conventional types that are constructed on the fly. */
7659 /* There is a subtle and tricky problem here. In general, we cannot
7660 determine the size of dynamic records without its data. However,
7661 the 'struct value' data structure, which GDB uses to represent
7662 quantities in the inferior process (the target), requires the size
7663 of the type at the time of its allocation in order to reserve space
7664 for GDB's internal copy of the data. That's why the
7665 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7666 rather than struct value*s.
7668 However, GDB's internal history variables ($1, $2, etc.) are
7669 struct value*s containing internal copies of the data that are not, in
7670 general, the same as the data at their corresponding addresses in
7671 the target. Fortunately, the types we give to these values are all
7672 conventional, fixed-size types (as per the strategy described
7673 above), so that we don't usually have to perform the
7674 'to_fixed_xxx_type' conversions to look at their values.
7675 Unfortunately, there is one exception: if one of the internal
7676 history variables is an array whose elements are unconstrained
7677 records, then we will need to create distinct fixed types for each
7678 element selected. */
7680 /* The upshot of all of this is that many routines take a (type, host
7681 address, target address) triple as arguments to represent a value.
7682 The host address, if non-null, is supposed to contain an internal
7683 copy of the relevant data; otherwise, the program is to consult the
7684 target at the target address. */
7686 /* Assuming that VAL0 represents a pointer value, the result of
7687 dereferencing it. Differs from value_ind in its treatment of
7688 dynamic-sized types. */
7691 ada_value_ind (struct value
*val0
)
7693 struct value
*val
= value_ind (val0
);
7695 if (ada_is_tagged_type (value_type (val
), 0))
7696 val
= ada_tag_value_at_base_address (val
);
7698 return ada_to_fixed_value (val
);
7701 /* The value resulting from dereferencing any "reference to"
7702 qualifiers on VAL0. */
7704 static struct value
*
7705 ada_coerce_ref (struct value
*val0
)
7707 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7709 struct value
*val
= val0
;
7711 val
= coerce_ref (val
);
7713 if (ada_is_tagged_type (value_type (val
), 0))
7714 val
= ada_tag_value_at_base_address (val
);
7716 return ada_to_fixed_value (val
);
7722 /* Return OFF rounded upward if necessary to a multiple of
7723 ALIGNMENT (a power of 2). */
7726 align_value (unsigned int off
, unsigned int alignment
)
7728 return (off
+ alignment
- 1) & ~(alignment
- 1);
7731 /* Return the bit alignment required for field #F of template type TYPE. */
7734 field_alignment (struct type
*type
, int f
)
7736 const char *name
= TYPE_FIELD_NAME (type
, f
);
7740 /* The field name should never be null, unless the debugging information
7741 is somehow malformed. In this case, we assume the field does not
7742 require any alignment. */
7746 len
= strlen (name
);
7748 if (!isdigit (name
[len
- 1]))
7751 if (isdigit (name
[len
- 2]))
7752 align_offset
= len
- 2;
7754 align_offset
= len
- 1;
7756 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7757 return TARGET_CHAR_BIT
;
7759 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7762 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7764 static struct symbol
*
7765 ada_find_any_type_symbol (const char *name
)
7769 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7770 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7773 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7777 /* Find a type named NAME. Ignores ambiguity. This routine will look
7778 solely for types defined by debug info, it will not search the GDB
7781 static struct type
*
7782 ada_find_any_type (const char *name
)
7784 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7787 return SYMBOL_TYPE (sym
);
7792 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7793 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7794 symbol, in which case it is returned. Otherwise, this looks for
7795 symbols whose name is that of NAME_SYM suffixed with "___XR".
7796 Return symbol if found, and NULL otherwise. */
7799 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7801 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7804 if (strstr (name
, "___XR") != NULL
)
7807 sym
= find_old_style_renaming_symbol (name
, block
);
7812 /* Not right yet. FIXME pnh 7/20/2007. */
7813 sym
= ada_find_any_type_symbol (name
);
7814 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7820 static struct symbol
*
7821 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7823 const struct symbol
*function_sym
= block_linkage_function (block
);
7826 if (function_sym
!= NULL
)
7828 /* If the symbol is defined inside a function, NAME is not fully
7829 qualified. This means we need to prepend the function name
7830 as well as adding the ``___XR'' suffix to build the name of
7831 the associated renaming symbol. */
7832 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7833 /* Function names sometimes contain suffixes used
7834 for instance to qualify nested subprograms. When building
7835 the XR type name, we need to make sure that this suffix is
7836 not included. So do not include any suffix in the function
7837 name length below. */
7838 int function_name_len
= ada_name_prefix_len (function_name
);
7839 const int rename_len
= function_name_len
+ 2 /* "__" */
7840 + strlen (name
) + 6 /* "___XR\0" */ ;
7842 /* Strip the suffix if necessary. */
7843 ada_remove_trailing_digits (function_name
, &function_name_len
);
7844 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7845 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7847 /* Library-level functions are a special case, as GNAT adds
7848 a ``_ada_'' prefix to the function name to avoid namespace
7849 pollution. However, the renaming symbols themselves do not
7850 have this prefix, so we need to skip this prefix if present. */
7851 if (function_name_len
> 5 /* "_ada_" */
7852 && strstr (function_name
, "_ada_") == function_name
)
7855 function_name_len
-= 5;
7858 rename
= (char *) alloca (rename_len
* sizeof (char));
7859 strncpy (rename
, function_name
, function_name_len
);
7860 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7865 const int rename_len
= strlen (name
) + 6;
7867 rename
= (char *) alloca (rename_len
* sizeof (char));
7868 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7871 return ada_find_any_type_symbol (rename
);
7874 /* Because of GNAT encoding conventions, several GDB symbols may match a
7875 given type name. If the type denoted by TYPE0 is to be preferred to
7876 that of TYPE1 for purposes of type printing, return non-zero;
7877 otherwise return 0. */
7880 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7884 else if (type0
== NULL
)
7886 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7888 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7890 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7892 else if (ada_is_constrained_packed_array_type (type0
))
7894 else if (ada_is_array_descriptor_type (type0
)
7895 && !ada_is_array_descriptor_type (type1
))
7899 const char *type0_name
= type_name_no_tag (type0
);
7900 const char *type1_name
= type_name_no_tag (type1
);
7902 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7903 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7909 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7910 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7913 ada_type_name (struct type
*type
)
7917 else if (TYPE_NAME (type
) != NULL
)
7918 return TYPE_NAME (type
);
7920 return TYPE_TAG_NAME (type
);
7923 /* Search the list of "descriptive" types associated to TYPE for a type
7924 whose name is NAME. */
7926 static struct type
*
7927 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7929 struct type
*result
, *tmp
;
7931 if (ada_ignore_descriptive_types_p
)
7934 /* If there no descriptive-type info, then there is no parallel type
7936 if (!HAVE_GNAT_AUX_INFO (type
))
7939 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7940 while (result
!= NULL
)
7942 const char *result_name
= ada_type_name (result
);
7944 if (result_name
== NULL
)
7946 warning (_("unexpected null name on descriptive type"));
7950 /* If the names match, stop. */
7951 if (strcmp (result_name
, name
) == 0)
7954 /* Otherwise, look at the next item on the list, if any. */
7955 if (HAVE_GNAT_AUX_INFO (result
))
7956 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7960 /* If not found either, try after having resolved the typedef. */
7965 result
= check_typedef (result
);
7966 if (HAVE_GNAT_AUX_INFO (result
))
7967 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7973 /* If we didn't find a match, see whether this is a packed array. With
7974 older compilers, the descriptive type information is either absent or
7975 irrelevant when it comes to packed arrays so the above lookup fails.
7976 Fall back to using a parallel lookup by name in this case. */
7977 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7978 return ada_find_any_type (name
);
7983 /* Find a parallel type to TYPE with the specified NAME, using the
7984 descriptive type taken from the debugging information, if available,
7985 and otherwise using the (slower) name-based method. */
7987 static struct type
*
7988 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7990 struct type
*result
= NULL
;
7992 if (HAVE_GNAT_AUX_INFO (type
))
7993 result
= find_parallel_type_by_descriptive_type (type
, name
);
7995 result
= ada_find_any_type (name
);
8000 /* Same as above, but specify the name of the parallel type by appending
8001 SUFFIX to the name of TYPE. */
8004 ada_find_parallel_type (struct type
*type
, const char *suffix
)
8007 const char *type_name
= ada_type_name (type
);
8010 if (type_name
== NULL
)
8013 len
= strlen (type_name
);
8015 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
8017 strcpy (name
, type_name
);
8018 strcpy (name
+ len
, suffix
);
8020 return ada_find_parallel_type_with_name (type
, name
);
8023 /* If TYPE is a variable-size record type, return the corresponding template
8024 type describing its fields. Otherwise, return NULL. */
8026 static struct type
*
8027 dynamic_template_type (struct type
*type
)
8029 type
= ada_check_typedef (type
);
8031 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8032 || ada_type_name (type
) == NULL
)
8036 int len
= strlen (ada_type_name (type
));
8038 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8041 return ada_find_parallel_type (type
, "___XVE");
8045 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8046 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8049 is_dynamic_field (struct type
*templ_type
, int field_num
)
8051 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8054 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8055 && strstr (name
, "___XVL") != NULL
;
8058 /* The index of the variant field of TYPE, or -1 if TYPE does not
8059 represent a variant record type. */
8062 variant_field_index (struct type
*type
)
8066 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8069 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8071 if (ada_is_variant_part (type
, f
))
8077 /* A record type with no fields. */
8079 static struct type
*
8080 empty_record (struct type
*templ
)
8082 struct type
*type
= alloc_type_copy (templ
);
8084 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8085 TYPE_NFIELDS (type
) = 0;
8086 TYPE_FIELDS (type
) = NULL
;
8087 INIT_CPLUS_SPECIFIC (type
);
8088 TYPE_NAME (type
) = "<empty>";
8089 TYPE_TAG_NAME (type
) = NULL
;
8090 TYPE_LENGTH (type
) = 0;
8094 /* An ordinary record type (with fixed-length fields) that describes
8095 the value of type TYPE at VALADDR or ADDRESS (see comments at
8096 the beginning of this section) VAL according to GNAT conventions.
8097 DVAL0 should describe the (portion of a) record that contains any
8098 necessary discriminants. It should be NULL if value_type (VAL) is
8099 an outer-level type (i.e., as opposed to a branch of a variant.) A
8100 variant field (unless unchecked) is replaced by a particular branch
8103 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8104 length are not statically known are discarded. As a consequence,
8105 VALADDR, ADDRESS and DVAL0 are ignored.
8107 NOTE: Limitations: For now, we assume that dynamic fields and
8108 variants occupy whole numbers of bytes. However, they need not be
8112 ada_template_to_fixed_record_type_1 (struct type
*type
,
8113 const gdb_byte
*valaddr
,
8114 CORE_ADDR address
, struct value
*dval0
,
8115 int keep_dynamic_fields
)
8117 struct value
*mark
= value_mark ();
8120 int nfields
, bit_len
;
8126 /* Compute the number of fields in this record type that are going
8127 to be processed: unless keep_dynamic_fields, this includes only
8128 fields whose position and length are static will be processed. */
8129 if (keep_dynamic_fields
)
8130 nfields
= TYPE_NFIELDS (type
);
8134 while (nfields
< TYPE_NFIELDS (type
)
8135 && !ada_is_variant_part (type
, nfields
)
8136 && !is_dynamic_field (type
, nfields
))
8140 rtype
= alloc_type_copy (type
);
8141 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8142 INIT_CPLUS_SPECIFIC (rtype
);
8143 TYPE_NFIELDS (rtype
) = nfields
;
8144 TYPE_FIELDS (rtype
) = (struct field
*)
8145 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8146 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8147 TYPE_NAME (rtype
) = ada_type_name (type
);
8148 TYPE_TAG_NAME (rtype
) = NULL
;
8149 TYPE_FIXED_INSTANCE (rtype
) = 1;
8155 for (f
= 0; f
< nfields
; f
+= 1)
8157 off
= align_value (off
, field_alignment (type
, f
))
8158 + TYPE_FIELD_BITPOS (type
, f
);
8159 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8160 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8162 if (ada_is_variant_part (type
, f
))
8167 else if (is_dynamic_field (type
, f
))
8169 const gdb_byte
*field_valaddr
= valaddr
;
8170 CORE_ADDR field_address
= address
;
8171 struct type
*field_type
=
8172 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8176 /* rtype's length is computed based on the run-time
8177 value of discriminants. If the discriminants are not
8178 initialized, the type size may be completely bogus and
8179 GDB may fail to allocate a value for it. So check the
8180 size first before creating the value. */
8181 ada_ensure_varsize_limit (rtype
);
8182 /* Using plain value_from_contents_and_address here
8183 causes problems because we will end up trying to
8184 resolve a type that is currently being
8186 dval
= value_from_contents_and_address_unresolved (rtype
,
8189 rtype
= value_type (dval
);
8194 /* If the type referenced by this field is an aligner type, we need
8195 to unwrap that aligner type, because its size might not be set.
8196 Keeping the aligner type would cause us to compute the wrong
8197 size for this field, impacting the offset of the all the fields
8198 that follow this one. */
8199 if (ada_is_aligner_type (field_type
))
8201 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8203 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8204 field_address
= cond_offset_target (field_address
, field_offset
);
8205 field_type
= ada_aligned_type (field_type
);
8208 field_valaddr
= cond_offset_host (field_valaddr
,
8209 off
/ TARGET_CHAR_BIT
);
8210 field_address
= cond_offset_target (field_address
,
8211 off
/ TARGET_CHAR_BIT
);
8213 /* Get the fixed type of the field. Note that, in this case,
8214 we do not want to get the real type out of the tag: if
8215 the current field is the parent part of a tagged record,
8216 we will get the tag of the object. Clearly wrong: the real
8217 type of the parent is not the real type of the child. We
8218 would end up in an infinite loop. */
8219 field_type
= ada_get_base_type (field_type
);
8220 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8221 field_address
, dval
, 0);
8222 /* If the field size is already larger than the maximum
8223 object size, then the record itself will necessarily
8224 be larger than the maximum object size. We need to make
8225 this check now, because the size might be so ridiculously
8226 large (due to an uninitialized variable in the inferior)
8227 that it would cause an overflow when adding it to the
8229 ada_ensure_varsize_limit (field_type
);
8231 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8232 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8233 /* The multiplication can potentially overflow. But because
8234 the field length has been size-checked just above, and
8235 assuming that the maximum size is a reasonable value,
8236 an overflow should not happen in practice. So rather than
8237 adding overflow recovery code to this already complex code,
8238 we just assume that it's not going to happen. */
8240 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8244 /* Note: If this field's type is a typedef, it is important
8245 to preserve the typedef layer.
8247 Otherwise, we might be transforming a typedef to a fat
8248 pointer (encoding a pointer to an unconstrained array),
8249 into a basic fat pointer (encoding an unconstrained
8250 array). As both types are implemented using the same
8251 structure, the typedef is the only clue which allows us
8252 to distinguish between the two options. Stripping it
8253 would prevent us from printing this field appropriately. */
8254 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8255 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8256 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8258 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8261 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8263 /* We need to be careful of typedefs when computing
8264 the length of our field. If this is a typedef,
8265 get the length of the target type, not the length
8267 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8268 field_type
= ada_typedef_target_type (field_type
);
8271 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8274 if (off
+ fld_bit_len
> bit_len
)
8275 bit_len
= off
+ fld_bit_len
;
8277 TYPE_LENGTH (rtype
) =
8278 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8281 /* We handle the variant part, if any, at the end because of certain
8282 odd cases in which it is re-ordered so as NOT to be the last field of
8283 the record. This can happen in the presence of representation
8285 if (variant_field
>= 0)
8287 struct type
*branch_type
;
8289 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8293 /* Using plain value_from_contents_and_address here causes
8294 problems because we will end up trying to resolve a type
8295 that is currently being constructed. */
8296 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8298 rtype
= value_type (dval
);
8304 to_fixed_variant_branch_type
8305 (TYPE_FIELD_TYPE (type
, variant_field
),
8306 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8307 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8308 if (branch_type
== NULL
)
8310 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8311 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8312 TYPE_NFIELDS (rtype
) -= 1;
8316 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8317 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8319 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8321 if (off
+ fld_bit_len
> bit_len
)
8322 bit_len
= off
+ fld_bit_len
;
8323 TYPE_LENGTH (rtype
) =
8324 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8328 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8329 should contain the alignment of that record, which should be a strictly
8330 positive value. If null or negative, then something is wrong, most
8331 probably in the debug info. In that case, we don't round up the size
8332 of the resulting type. If this record is not part of another structure,
8333 the current RTYPE length might be good enough for our purposes. */
8334 if (TYPE_LENGTH (type
) <= 0)
8336 if (TYPE_NAME (rtype
))
8337 warning (_("Invalid type size for `%s' detected: %d."),
8338 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8340 warning (_("Invalid type size for <unnamed> detected: %d."),
8341 TYPE_LENGTH (type
));
8345 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8346 TYPE_LENGTH (type
));
8349 value_free_to_mark (mark
);
8350 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8351 error (_("record type with dynamic size is larger than varsize-limit"));
8355 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8358 static struct type
*
8359 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8360 CORE_ADDR address
, struct value
*dval0
)
8362 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8366 /* An ordinary record type in which ___XVL-convention fields and
8367 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8368 static approximations, containing all possible fields. Uses
8369 no runtime values. Useless for use in values, but that's OK,
8370 since the results are used only for type determinations. Works on both
8371 structs and unions. Representation note: to save space, we memorize
8372 the result of this function in the TYPE_TARGET_TYPE of the
8375 static struct type
*
8376 template_to_static_fixed_type (struct type
*type0
)
8382 /* No need no do anything if the input type is already fixed. */
8383 if (TYPE_FIXED_INSTANCE (type0
))
8386 /* Likewise if we already have computed the static approximation. */
8387 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8388 return TYPE_TARGET_TYPE (type0
);
8390 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8392 nfields
= TYPE_NFIELDS (type0
);
8394 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8395 recompute all over next time. */
8396 TYPE_TARGET_TYPE (type0
) = type
;
8398 for (f
= 0; f
< nfields
; f
+= 1)
8400 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8401 struct type
*new_type
;
8403 if (is_dynamic_field (type0
, f
))
8405 field_type
= ada_check_typedef (field_type
);
8406 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8409 new_type
= static_unwrap_type (field_type
);
8411 if (new_type
!= field_type
)
8413 /* Clone TYPE0 only the first time we get a new field type. */
8416 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8417 TYPE_CODE (type
) = TYPE_CODE (type0
);
8418 INIT_CPLUS_SPECIFIC (type
);
8419 TYPE_NFIELDS (type
) = nfields
;
8420 TYPE_FIELDS (type
) = (struct field
*)
8421 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8422 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8423 sizeof (struct field
) * nfields
);
8424 TYPE_NAME (type
) = ada_type_name (type0
);
8425 TYPE_TAG_NAME (type
) = NULL
;
8426 TYPE_FIXED_INSTANCE (type
) = 1;
8427 TYPE_LENGTH (type
) = 0;
8429 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8430 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8437 /* Given an object of type TYPE whose contents are at VALADDR and
8438 whose address in memory is ADDRESS, returns a revision of TYPE,
8439 which should be a non-dynamic-sized record, in which the variant
8440 part, if any, is replaced with the appropriate branch. Looks
8441 for discriminant values in DVAL0, which can be NULL if the record
8442 contains the necessary discriminant values. */
8444 static struct type
*
8445 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8446 CORE_ADDR address
, struct value
*dval0
)
8448 struct value
*mark
= value_mark ();
8451 struct type
*branch_type
;
8452 int nfields
= TYPE_NFIELDS (type
);
8453 int variant_field
= variant_field_index (type
);
8455 if (variant_field
== -1)
8460 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8461 type
= value_type (dval
);
8466 rtype
= alloc_type_copy (type
);
8467 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8468 INIT_CPLUS_SPECIFIC (rtype
);
8469 TYPE_NFIELDS (rtype
) = nfields
;
8470 TYPE_FIELDS (rtype
) =
8471 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8472 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8473 sizeof (struct field
) * nfields
);
8474 TYPE_NAME (rtype
) = ada_type_name (type
);
8475 TYPE_TAG_NAME (rtype
) = NULL
;
8476 TYPE_FIXED_INSTANCE (rtype
) = 1;
8477 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8479 branch_type
= to_fixed_variant_branch_type
8480 (TYPE_FIELD_TYPE (type
, variant_field
),
8481 cond_offset_host (valaddr
,
8482 TYPE_FIELD_BITPOS (type
, variant_field
)
8484 cond_offset_target (address
,
8485 TYPE_FIELD_BITPOS (type
, variant_field
)
8486 / TARGET_CHAR_BIT
), dval
);
8487 if (branch_type
== NULL
)
8491 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8492 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8493 TYPE_NFIELDS (rtype
) -= 1;
8497 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8498 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8499 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8500 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8502 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8504 value_free_to_mark (mark
);
8508 /* An ordinary record type (with fixed-length fields) that describes
8509 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8510 beginning of this section]. Any necessary discriminants' values
8511 should be in DVAL, a record value; it may be NULL if the object
8512 at ADDR itself contains any necessary discriminant values.
8513 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8514 values from the record are needed. Except in the case that DVAL,
8515 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8516 unchecked) is replaced by a particular branch of the variant.
8518 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8519 is questionable and may be removed. It can arise during the
8520 processing of an unconstrained-array-of-record type where all the
8521 variant branches have exactly the same size. This is because in
8522 such cases, the compiler does not bother to use the XVS convention
8523 when encoding the record. I am currently dubious of this
8524 shortcut and suspect the compiler should be altered. FIXME. */
8526 static struct type
*
8527 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8528 CORE_ADDR address
, struct value
*dval
)
8530 struct type
*templ_type
;
8532 if (TYPE_FIXED_INSTANCE (type0
))
8535 templ_type
= dynamic_template_type (type0
);
8537 if (templ_type
!= NULL
)
8538 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8539 else if (variant_field_index (type0
) >= 0)
8541 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8543 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8548 TYPE_FIXED_INSTANCE (type0
) = 1;
8554 /* An ordinary record type (with fixed-length fields) that describes
8555 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8556 union type. Any necessary discriminants' values should be in DVAL,
8557 a record value. That is, this routine selects the appropriate
8558 branch of the union at ADDR according to the discriminant value
8559 indicated in the union's type name. Returns VAR_TYPE0 itself if
8560 it represents a variant subject to a pragma Unchecked_Union. */
8562 static struct type
*
8563 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8564 CORE_ADDR address
, struct value
*dval
)
8567 struct type
*templ_type
;
8568 struct type
*var_type
;
8570 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8571 var_type
= TYPE_TARGET_TYPE (var_type0
);
8573 var_type
= var_type0
;
8575 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8577 if (templ_type
!= NULL
)
8578 var_type
= templ_type
;
8580 if (is_unchecked_variant (var_type
, value_type (dval
)))
8583 ada_which_variant_applies (var_type
,
8584 value_type (dval
), value_contents (dval
));
8587 return empty_record (var_type
);
8588 else if (is_dynamic_field (var_type
, which
))
8589 return to_fixed_record_type
8590 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8591 valaddr
, address
, dval
);
8592 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8594 to_fixed_record_type
8595 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8597 return TYPE_FIELD_TYPE (var_type
, which
);
8600 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8601 ENCODING_TYPE, a type following the GNAT conventions for discrete
8602 type encodings, only carries redundant information. */
8605 ada_is_redundant_range_encoding (struct type
*range_type
,
8606 struct type
*encoding_type
)
8608 struct type
*fixed_range_type
;
8609 const char *bounds_str
;
8613 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8615 if (TYPE_CODE (get_base_type (range_type
))
8616 != TYPE_CODE (get_base_type (encoding_type
)))
8618 /* The compiler probably used a simple base type to describe
8619 the range type instead of the range's actual base type,
8620 expecting us to get the real base type from the encoding
8621 anyway. In this situation, the encoding cannot be ignored
8626 if (is_dynamic_type (range_type
))
8629 if (TYPE_NAME (encoding_type
) == NULL
)
8632 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8633 if (bounds_str
== NULL
)
8636 n
= 8; /* Skip "___XDLU_". */
8637 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8639 if (TYPE_LOW_BOUND (range_type
) != lo
)
8642 n
+= 2; /* Skip the "__" separator between the two bounds. */
8643 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8645 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8651 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8652 a type following the GNAT encoding for describing array type
8653 indices, only carries redundant information. */
8656 ada_is_redundant_index_type_desc (struct type
*array_type
,
8657 struct type
*desc_type
)
8659 struct type
*this_layer
= check_typedef (array_type
);
8662 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8664 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8665 TYPE_FIELD_TYPE (desc_type
, i
)))
8667 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8673 /* Assuming that TYPE0 is an array type describing the type of a value
8674 at ADDR, and that DVAL describes a record containing any
8675 discriminants used in TYPE0, returns a type for the value that
8676 contains no dynamic components (that is, no components whose sizes
8677 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8678 true, gives an error message if the resulting type's size is over
8681 static struct type
*
8682 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8685 struct type
*index_type_desc
;
8686 struct type
*result
;
8687 int constrained_packed_array_p
;
8688 static const char *xa_suffix
= "___XA";
8690 type0
= ada_check_typedef (type0
);
8691 if (TYPE_FIXED_INSTANCE (type0
))
8694 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8695 if (constrained_packed_array_p
)
8696 type0
= decode_constrained_packed_array_type (type0
);
8698 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8700 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8701 encoding suffixed with 'P' may still be generated. If so,
8702 it should be used to find the XA type. */
8704 if (index_type_desc
== NULL
)
8706 const char *type_name
= ada_type_name (type0
);
8708 if (type_name
!= NULL
)
8710 const int len
= strlen (type_name
);
8711 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8713 if (type_name
[len
- 1] == 'P')
8715 strcpy (name
, type_name
);
8716 strcpy (name
+ len
- 1, xa_suffix
);
8717 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8722 ada_fixup_array_indexes_type (index_type_desc
);
8723 if (index_type_desc
!= NULL
8724 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8726 /* Ignore this ___XA parallel type, as it does not bring any
8727 useful information. This allows us to avoid creating fixed
8728 versions of the array's index types, which would be identical
8729 to the original ones. This, in turn, can also help avoid
8730 the creation of fixed versions of the array itself. */
8731 index_type_desc
= NULL
;
8734 if (index_type_desc
== NULL
)
8736 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8738 /* NOTE: elt_type---the fixed version of elt_type0---should never
8739 depend on the contents of the array in properly constructed
8741 /* Create a fixed version of the array element type.
8742 We're not providing the address of an element here,
8743 and thus the actual object value cannot be inspected to do
8744 the conversion. This should not be a problem, since arrays of
8745 unconstrained objects are not allowed. In particular, all
8746 the elements of an array of a tagged type should all be of
8747 the same type specified in the debugging info. No need to
8748 consult the object tag. */
8749 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8751 /* Make sure we always create a new array type when dealing with
8752 packed array types, since we're going to fix-up the array
8753 type length and element bitsize a little further down. */
8754 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8757 result
= create_array_type (alloc_type_copy (type0
),
8758 elt_type
, TYPE_INDEX_TYPE (type0
));
8763 struct type
*elt_type0
;
8766 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8767 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8769 /* NOTE: result---the fixed version of elt_type0---should never
8770 depend on the contents of the array in properly constructed
8772 /* Create a fixed version of the array element type.
8773 We're not providing the address of an element here,
8774 and thus the actual object value cannot be inspected to do
8775 the conversion. This should not be a problem, since arrays of
8776 unconstrained objects are not allowed. In particular, all
8777 the elements of an array of a tagged type should all be of
8778 the same type specified in the debugging info. No need to
8779 consult the object tag. */
8781 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8784 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8786 struct type
*range_type
=
8787 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8789 result
= create_array_type (alloc_type_copy (elt_type0
),
8790 result
, range_type
);
8791 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8793 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8794 error (_("array type with dynamic size is larger than varsize-limit"));
8797 /* We want to preserve the type name. This can be useful when
8798 trying to get the type name of a value that has already been
8799 printed (for instance, if the user did "print VAR; whatis $". */
8800 TYPE_NAME (result
) = TYPE_NAME (type0
);
8802 if (constrained_packed_array_p
)
8804 /* So far, the resulting type has been created as if the original
8805 type was a regular (non-packed) array type. As a result, the
8806 bitsize of the array elements needs to be set again, and the array
8807 length needs to be recomputed based on that bitsize. */
8808 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8809 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8811 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8812 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8813 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8814 TYPE_LENGTH (result
)++;
8817 TYPE_FIXED_INSTANCE (result
) = 1;
8822 /* A standard type (containing no dynamically sized components)
8823 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8824 DVAL describes a record containing any discriminants used in TYPE0,
8825 and may be NULL if there are none, or if the object of type TYPE at
8826 ADDRESS or in VALADDR contains these discriminants.
8828 If CHECK_TAG is not null, in the case of tagged types, this function
8829 attempts to locate the object's tag and use it to compute the actual
8830 type. However, when ADDRESS is null, we cannot use it to determine the
8831 location of the tag, and therefore compute the tagged type's actual type.
8832 So we return the tagged type without consulting the tag. */
8834 static struct type
*
8835 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8836 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8838 type
= ada_check_typedef (type
);
8839 switch (TYPE_CODE (type
))
8843 case TYPE_CODE_STRUCT
:
8845 struct type
*static_type
= to_static_fixed_type (type
);
8846 struct type
*fixed_record_type
=
8847 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8849 /* If STATIC_TYPE is a tagged type and we know the object's address,
8850 then we can determine its tag, and compute the object's actual
8851 type from there. Note that we have to use the fixed record
8852 type (the parent part of the record may have dynamic fields
8853 and the way the location of _tag is expressed may depend on
8856 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8859 value_tag_from_contents_and_address
8863 struct type
*real_type
= type_from_tag (tag
);
8865 value_from_contents_and_address (fixed_record_type
,
8868 fixed_record_type
= value_type (obj
);
8869 if (real_type
!= NULL
)
8870 return to_fixed_record_type
8872 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8875 /* Check to see if there is a parallel ___XVZ variable.
8876 If there is, then it provides the actual size of our type. */
8877 else if (ada_type_name (fixed_record_type
) != NULL
)
8879 const char *name
= ada_type_name (fixed_record_type
);
8881 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8885 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8886 size
= get_int_var_value (xvz_name
, &xvz_found
);
8887 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8889 fixed_record_type
= copy_type (fixed_record_type
);
8890 TYPE_LENGTH (fixed_record_type
) = size
;
8892 /* The FIXED_RECORD_TYPE may have be a stub. We have
8893 observed this when the debugging info is STABS, and
8894 apparently it is something that is hard to fix.
8896 In practice, we don't need the actual type definition
8897 at all, because the presence of the XVZ variable allows us
8898 to assume that there must be a XVS type as well, which we
8899 should be able to use later, when we need the actual type
8902 In the meantime, pretend that the "fixed" type we are
8903 returning is NOT a stub, because this can cause trouble
8904 when using this type to create new types targeting it.
8905 Indeed, the associated creation routines often check
8906 whether the target type is a stub and will try to replace
8907 it, thus using a type with the wrong size. This, in turn,
8908 might cause the new type to have the wrong size too.
8909 Consider the case of an array, for instance, where the size
8910 of the array is computed from the number of elements in
8911 our array multiplied by the size of its element. */
8912 TYPE_STUB (fixed_record_type
) = 0;
8915 return fixed_record_type
;
8917 case TYPE_CODE_ARRAY
:
8918 return to_fixed_array_type (type
, dval
, 1);
8919 case TYPE_CODE_UNION
:
8923 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8927 /* The same as ada_to_fixed_type_1, except that it preserves the type
8928 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8930 The typedef layer needs be preserved in order to differentiate between
8931 arrays and array pointers when both types are implemented using the same
8932 fat pointer. In the array pointer case, the pointer is encoded as
8933 a typedef of the pointer type. For instance, considering:
8935 type String_Access is access String;
8936 S1 : String_Access := null;
8938 To the debugger, S1 is defined as a typedef of type String. But
8939 to the user, it is a pointer. So if the user tries to print S1,
8940 we should not dereference the array, but print the array address
8943 If we didn't preserve the typedef layer, we would lose the fact that
8944 the type is to be presented as a pointer (needs de-reference before
8945 being printed). And we would also use the source-level type name. */
8948 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8949 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8952 struct type
*fixed_type
=
8953 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8955 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8956 then preserve the typedef layer.
8958 Implementation note: We can only check the main-type portion of
8959 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8960 from TYPE now returns a type that has the same instance flags
8961 as TYPE. For instance, if TYPE is a "typedef const", and its
8962 target type is a "struct", then the typedef elimination will return
8963 a "const" version of the target type. See check_typedef for more
8964 details about how the typedef layer elimination is done.
8966 brobecker/2010-11-19: It seems to me that the only case where it is
8967 useful to preserve the typedef layer is when dealing with fat pointers.
8968 Perhaps, we could add a check for that and preserve the typedef layer
8969 only in that situation. But this seems unecessary so far, probably
8970 because we call check_typedef/ada_check_typedef pretty much everywhere.
8972 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8973 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8974 == TYPE_MAIN_TYPE (fixed_type
)))
8980 /* A standard (static-sized) type corresponding as well as possible to
8981 TYPE0, but based on no runtime data. */
8983 static struct type
*
8984 to_static_fixed_type (struct type
*type0
)
8991 if (TYPE_FIXED_INSTANCE (type0
))
8994 type0
= ada_check_typedef (type0
);
8996 switch (TYPE_CODE (type0
))
9000 case TYPE_CODE_STRUCT
:
9001 type
= dynamic_template_type (type0
);
9003 return template_to_static_fixed_type (type
);
9005 return template_to_static_fixed_type (type0
);
9006 case TYPE_CODE_UNION
:
9007 type
= ada_find_parallel_type (type0
, "___XVU");
9009 return template_to_static_fixed_type (type
);
9011 return template_to_static_fixed_type (type0
);
9015 /* A static approximation of TYPE with all type wrappers removed. */
9017 static struct type
*
9018 static_unwrap_type (struct type
*type
)
9020 if (ada_is_aligner_type (type
))
9022 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9023 if (ada_type_name (type1
) == NULL
)
9024 TYPE_NAME (type1
) = ada_type_name (type
);
9026 return static_unwrap_type (type1
);
9030 struct type
*raw_real_type
= ada_get_base_type (type
);
9032 if (raw_real_type
== type
)
9035 return to_static_fixed_type (raw_real_type
);
9039 /* In some cases, incomplete and private types require
9040 cross-references that are not resolved as records (for example,
9042 type FooP is access Foo;
9044 type Foo is array ...;
9045 ). In these cases, since there is no mechanism for producing
9046 cross-references to such types, we instead substitute for FooP a
9047 stub enumeration type that is nowhere resolved, and whose tag is
9048 the name of the actual type. Call these types "non-record stubs". */
9050 /* A type equivalent to TYPE that is not a non-record stub, if one
9051 exists, otherwise TYPE. */
9054 ada_check_typedef (struct type
*type
)
9059 /* If our type is a typedef type of a fat pointer, then we're done.
9060 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9061 what allows us to distinguish between fat pointers that represent
9062 array types, and fat pointers that represent array access types
9063 (in both cases, the compiler implements them as fat pointers). */
9064 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9065 && is_thick_pntr (ada_typedef_target_type (type
)))
9068 type
= check_typedef (type
);
9069 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9070 || !TYPE_STUB (type
)
9071 || TYPE_TAG_NAME (type
) == NULL
)
9075 const char *name
= TYPE_TAG_NAME (type
);
9076 struct type
*type1
= ada_find_any_type (name
);
9081 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9082 stubs pointing to arrays, as we don't create symbols for array
9083 types, only for the typedef-to-array types). If that's the case,
9084 strip the typedef layer. */
9085 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9086 type1
= ada_check_typedef (type1
);
9092 /* A value representing the data at VALADDR/ADDRESS as described by
9093 type TYPE0, but with a standard (static-sized) type that correctly
9094 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9095 type, then return VAL0 [this feature is simply to avoid redundant
9096 creation of struct values]. */
9098 static struct value
*
9099 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9102 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9104 if (type
== type0
&& val0
!= NULL
)
9107 return value_from_contents_and_address (type
, 0, address
);
9110 /* A value representing VAL, but with a standard (static-sized) type
9111 that correctly describes it. Does not necessarily create a new
9115 ada_to_fixed_value (struct value
*val
)
9117 val
= unwrap_value (val
);
9118 val
= ada_to_fixed_value_create (value_type (val
),
9119 value_address (val
),
9127 /* Table mapping attribute numbers to names.
9128 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9130 static const char *attribute_names
[] = {
9148 ada_attribute_name (enum exp_opcode n
)
9150 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9151 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9153 return attribute_names
[0];
9156 /* Evaluate the 'POS attribute applied to ARG. */
9159 pos_atr (struct value
*arg
)
9161 struct value
*val
= coerce_ref (arg
);
9162 struct type
*type
= value_type (val
);
9165 if (!discrete_type_p (type
))
9166 error (_("'POS only defined on discrete types"));
9168 if (!discrete_position (type
, value_as_long (val
), &result
))
9169 error (_("enumeration value is invalid: can't find 'POS"));
9174 static struct value
*
9175 value_pos_atr (struct type
*type
, struct value
*arg
)
9177 return value_from_longest (type
, pos_atr (arg
));
9180 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9182 static struct value
*
9183 value_val_atr (struct type
*type
, struct value
*arg
)
9185 if (!discrete_type_p (type
))
9186 error (_("'VAL only defined on discrete types"));
9187 if (!integer_type_p (value_type (arg
)))
9188 error (_("'VAL requires integral argument"));
9190 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9192 long pos
= value_as_long (arg
);
9194 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9195 error (_("argument to 'VAL out of range"));
9196 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9199 return value_from_longest (type
, value_as_long (arg
));
9205 /* True if TYPE appears to be an Ada character type.
9206 [At the moment, this is true only for Character and Wide_Character;
9207 It is a heuristic test that could stand improvement]. */
9210 ada_is_character_type (struct type
*type
)
9214 /* If the type code says it's a character, then assume it really is,
9215 and don't check any further. */
9216 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9219 /* Otherwise, assume it's a character type iff it is a discrete type
9220 with a known character type name. */
9221 name
= ada_type_name (type
);
9222 return (name
!= NULL
9223 && (TYPE_CODE (type
) == TYPE_CODE_INT
9224 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9225 && (strcmp (name
, "character") == 0
9226 || strcmp (name
, "wide_character") == 0
9227 || strcmp (name
, "wide_wide_character") == 0
9228 || strcmp (name
, "unsigned char") == 0));
9231 /* True if TYPE appears to be an Ada string type. */
9234 ada_is_string_type (struct type
*type
)
9236 type
= ada_check_typedef (type
);
9238 && TYPE_CODE (type
) != TYPE_CODE_PTR
9239 && (ada_is_simple_array_type (type
)
9240 || ada_is_array_descriptor_type (type
))
9241 && ada_array_arity (type
) == 1)
9243 struct type
*elttype
= ada_array_element_type (type
, 1);
9245 return ada_is_character_type (elttype
);
9251 /* The compiler sometimes provides a parallel XVS type for a given
9252 PAD type. Normally, it is safe to follow the PAD type directly,
9253 but older versions of the compiler have a bug that causes the offset
9254 of its "F" field to be wrong. Following that field in that case
9255 would lead to incorrect results, but this can be worked around
9256 by ignoring the PAD type and using the associated XVS type instead.
9258 Set to True if the debugger should trust the contents of PAD types.
9259 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9260 static int trust_pad_over_xvs
= 1;
9262 /* True if TYPE is a struct type introduced by the compiler to force the
9263 alignment of a value. Such types have a single field with a
9264 distinctive name. */
9267 ada_is_aligner_type (struct type
*type
)
9269 type
= ada_check_typedef (type
);
9271 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9274 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9275 && TYPE_NFIELDS (type
) == 1
9276 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9279 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9280 the parallel type. */
9283 ada_get_base_type (struct type
*raw_type
)
9285 struct type
*real_type_namer
;
9286 struct type
*raw_real_type
;
9288 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9291 if (ada_is_aligner_type (raw_type
))
9292 /* The encoding specifies that we should always use the aligner type.
9293 So, even if this aligner type has an associated XVS type, we should
9296 According to the compiler gurus, an XVS type parallel to an aligner
9297 type may exist because of a stabs limitation. In stabs, aligner
9298 types are empty because the field has a variable-sized type, and
9299 thus cannot actually be used as an aligner type. As a result,
9300 we need the associated parallel XVS type to decode the type.
9301 Since the policy in the compiler is to not change the internal
9302 representation based on the debugging info format, we sometimes
9303 end up having a redundant XVS type parallel to the aligner type. */
9306 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9307 if (real_type_namer
== NULL
9308 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9309 || TYPE_NFIELDS (real_type_namer
) != 1)
9312 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9314 /* This is an older encoding form where the base type needs to be
9315 looked up by name. We prefer the newer enconding because it is
9317 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9318 if (raw_real_type
== NULL
)
9321 return raw_real_type
;
9324 /* The field in our XVS type is a reference to the base type. */
9325 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9328 /* The type of value designated by TYPE, with all aligners removed. */
9331 ada_aligned_type (struct type
*type
)
9333 if (ada_is_aligner_type (type
))
9334 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9336 return ada_get_base_type (type
);
9340 /* The address of the aligned value in an object at address VALADDR
9341 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9344 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9346 if (ada_is_aligner_type (type
))
9347 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9349 TYPE_FIELD_BITPOS (type
,
9350 0) / TARGET_CHAR_BIT
);
9357 /* The printed representation of an enumeration literal with encoded
9358 name NAME. The value is good to the next call of ada_enum_name. */
9360 ada_enum_name (const char *name
)
9362 static char *result
;
9363 static size_t result_len
= 0;
9366 /* First, unqualify the enumeration name:
9367 1. Search for the last '.' character. If we find one, then skip
9368 all the preceding characters, the unqualified name starts
9369 right after that dot.
9370 2. Otherwise, we may be debugging on a target where the compiler
9371 translates dots into "__". Search forward for double underscores,
9372 but stop searching when we hit an overloading suffix, which is
9373 of the form "__" followed by digits. */
9375 tmp
= strrchr (name
, '.');
9380 while ((tmp
= strstr (name
, "__")) != NULL
)
9382 if (isdigit (tmp
[2]))
9393 if (name
[1] == 'U' || name
[1] == 'W')
9395 if (sscanf (name
+ 2, "%x", &v
) != 1)
9401 GROW_VECT (result
, result_len
, 16);
9402 if (isascii (v
) && isprint (v
))
9403 xsnprintf (result
, result_len
, "'%c'", v
);
9404 else if (name
[1] == 'U')
9405 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9407 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9413 tmp
= strstr (name
, "__");
9415 tmp
= strstr (name
, "$");
9418 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9419 strncpy (result
, name
, tmp
- name
);
9420 result
[tmp
- name
] = '\0';
9428 /* Evaluate the subexpression of EXP starting at *POS as for
9429 evaluate_type, updating *POS to point just past the evaluated
9432 static struct value
*
9433 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9435 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9438 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9441 static struct value
*
9442 unwrap_value (struct value
*val
)
9444 struct type
*type
= ada_check_typedef (value_type (val
));
9446 if (ada_is_aligner_type (type
))
9448 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9449 struct type
*val_type
= ada_check_typedef (value_type (v
));
9451 if (ada_type_name (val_type
) == NULL
)
9452 TYPE_NAME (val_type
) = ada_type_name (type
);
9454 return unwrap_value (v
);
9458 struct type
*raw_real_type
=
9459 ada_check_typedef (ada_get_base_type (type
));
9461 /* If there is no parallel XVS or XVE type, then the value is
9462 already unwrapped. Return it without further modification. */
9463 if ((type
== raw_real_type
)
9464 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9468 coerce_unspec_val_to_type
9469 (val
, ada_to_fixed_type (raw_real_type
, 0,
9470 value_address (val
),
9475 static struct value
*
9476 cast_to_fixed (struct type
*type
, struct value
*arg
)
9480 if (type
== value_type (arg
))
9482 else if (ada_is_fixed_point_type (value_type (arg
)))
9483 val
= ada_float_to_fixed (type
,
9484 ada_fixed_to_float (value_type (arg
),
9485 value_as_long (arg
)));
9488 DOUBLEST argd
= value_as_double (arg
);
9490 val
= ada_float_to_fixed (type
, argd
);
9493 return value_from_longest (type
, val
);
9496 static struct value
*
9497 cast_from_fixed (struct type
*type
, struct value
*arg
)
9499 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9500 value_as_long (arg
));
9502 return value_from_double (type
, val
);
9505 /* Given two array types T1 and T2, return nonzero iff both arrays
9506 contain the same number of elements. */
9509 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9511 LONGEST lo1
, hi1
, lo2
, hi2
;
9513 /* Get the array bounds in order to verify that the size of
9514 the two arrays match. */
9515 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9516 || !get_array_bounds (t2
, &lo2
, &hi2
))
9517 error (_("unable to determine array bounds"));
9519 /* To make things easier for size comparison, normalize a bit
9520 the case of empty arrays by making sure that the difference
9521 between upper bound and lower bound is always -1. */
9527 return (hi1
- lo1
== hi2
- lo2
);
9530 /* Assuming that VAL is an array of integrals, and TYPE represents
9531 an array with the same number of elements, but with wider integral
9532 elements, return an array "casted" to TYPE. In practice, this
9533 means that the returned array is built by casting each element
9534 of the original array into TYPE's (wider) element type. */
9536 static struct value
*
9537 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9539 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9544 /* Verify that both val and type are arrays of scalars, and
9545 that the size of val's elements is smaller than the size
9546 of type's element. */
9547 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9548 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9549 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9550 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9551 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9552 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9554 if (!get_array_bounds (type
, &lo
, &hi
))
9555 error (_("unable to determine array bounds"));
9557 res
= allocate_value (type
);
9559 /* Promote each array element. */
9560 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9562 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9564 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9565 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9571 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9572 return the converted value. */
9574 static struct value
*
9575 coerce_for_assign (struct type
*type
, struct value
*val
)
9577 struct type
*type2
= value_type (val
);
9582 type2
= ada_check_typedef (type2
);
9583 type
= ada_check_typedef (type
);
9585 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9586 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9588 val
= ada_value_ind (val
);
9589 type2
= value_type (val
);
9592 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9593 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9595 if (!ada_same_array_size_p (type
, type2
))
9596 error (_("cannot assign arrays of different length"));
9598 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9599 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9600 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9601 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9603 /* Allow implicit promotion of the array elements to
9605 return ada_promote_array_of_integrals (type
, val
);
9608 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9609 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9610 error (_("Incompatible types in assignment"));
9611 deprecated_set_value_type (val
, type
);
9616 static struct value
*
9617 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9620 struct type
*type1
, *type2
;
9623 arg1
= coerce_ref (arg1
);
9624 arg2
= coerce_ref (arg2
);
9625 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9626 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9628 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9629 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9630 return value_binop (arg1
, arg2
, op
);
9639 return value_binop (arg1
, arg2
, op
);
9642 v2
= value_as_long (arg2
);
9644 error (_("second operand of %s must not be zero."), op_string (op
));
9646 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9647 return value_binop (arg1
, arg2
, op
);
9649 v1
= value_as_long (arg1
);
9654 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9655 v
+= v
> 0 ? -1 : 1;
9663 /* Should not reach this point. */
9667 val
= allocate_value (type1
);
9668 store_unsigned_integer (value_contents_raw (val
),
9669 TYPE_LENGTH (value_type (val
)),
9670 gdbarch_byte_order (get_type_arch (type1
)), v
);
9675 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9677 if (ada_is_direct_array_type (value_type (arg1
))
9678 || ada_is_direct_array_type (value_type (arg2
)))
9680 /* Automatically dereference any array reference before
9681 we attempt to perform the comparison. */
9682 arg1
= ada_coerce_ref (arg1
);
9683 arg2
= ada_coerce_ref (arg2
);
9685 arg1
= ada_coerce_to_simple_array (arg1
);
9686 arg2
= ada_coerce_to_simple_array (arg2
);
9687 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9688 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9689 error (_("Attempt to compare array with non-array"));
9690 /* FIXME: The following works only for types whose
9691 representations use all bits (no padding or undefined bits)
9692 and do not have user-defined equality. */
9694 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9695 && memcmp (value_contents (arg1
), value_contents (arg2
),
9696 TYPE_LENGTH (value_type (arg1
))) == 0;
9698 return value_equal (arg1
, arg2
);
9701 /* Total number of component associations in the aggregate starting at
9702 index PC in EXP. Assumes that index PC is the start of an
9706 num_component_specs (struct expression
*exp
, int pc
)
9710 m
= exp
->elts
[pc
+ 1].longconst
;
9713 for (i
= 0; i
< m
; i
+= 1)
9715 switch (exp
->elts
[pc
].opcode
)
9721 n
+= exp
->elts
[pc
+ 1].longconst
;
9724 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9729 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9730 component of LHS (a simple array or a record), updating *POS past
9731 the expression, assuming that LHS is contained in CONTAINER. Does
9732 not modify the inferior's memory, nor does it modify LHS (unless
9733 LHS == CONTAINER). */
9736 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9737 struct expression
*exp
, int *pos
)
9739 struct value
*mark
= value_mark ();
9742 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9744 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9745 struct value
*index_val
= value_from_longest (index_type
, index
);
9747 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9751 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9752 elt
= ada_to_fixed_value (elt
);
9755 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9756 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9758 value_assign_to_component (container
, elt
,
9759 ada_evaluate_subexp (NULL
, exp
, pos
,
9762 value_free_to_mark (mark
);
9765 /* Assuming that LHS represents an lvalue having a record or array
9766 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9767 of that aggregate's value to LHS, advancing *POS past the
9768 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9769 lvalue containing LHS (possibly LHS itself). Does not modify
9770 the inferior's memory, nor does it modify the contents of
9771 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9773 static struct value
*
9774 assign_aggregate (struct value
*container
,
9775 struct value
*lhs
, struct expression
*exp
,
9776 int *pos
, enum noside noside
)
9778 struct type
*lhs_type
;
9779 int n
= exp
->elts
[*pos
+1].longconst
;
9780 LONGEST low_index
, high_index
;
9783 int max_indices
, num_indices
;
9787 if (noside
!= EVAL_NORMAL
)
9789 for (i
= 0; i
< n
; i
+= 1)
9790 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9794 container
= ada_coerce_ref (container
);
9795 if (ada_is_direct_array_type (value_type (container
)))
9796 container
= ada_coerce_to_simple_array (container
);
9797 lhs
= ada_coerce_ref (lhs
);
9798 if (!deprecated_value_modifiable (lhs
))
9799 error (_("Left operand of assignment is not a modifiable lvalue."));
9801 lhs_type
= value_type (lhs
);
9802 if (ada_is_direct_array_type (lhs_type
))
9804 lhs
= ada_coerce_to_simple_array (lhs
);
9805 lhs_type
= value_type (lhs
);
9806 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9807 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9809 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9812 high_index
= num_visible_fields (lhs_type
) - 1;
9815 error (_("Left-hand side must be array or record."));
9817 num_specs
= num_component_specs (exp
, *pos
- 3);
9818 max_indices
= 4 * num_specs
+ 4;
9819 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9820 indices
[0] = indices
[1] = low_index
- 1;
9821 indices
[2] = indices
[3] = high_index
+ 1;
9824 for (i
= 0; i
< n
; i
+= 1)
9826 switch (exp
->elts
[*pos
].opcode
)
9829 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9830 &num_indices
, max_indices
,
9831 low_index
, high_index
);
9834 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9835 &num_indices
, max_indices
,
9836 low_index
, high_index
);
9840 error (_("Misplaced 'others' clause"));
9841 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9842 num_indices
, low_index
, high_index
);
9845 error (_("Internal error: bad aggregate clause"));
9852 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9853 construct at *POS, updating *POS past the construct, given that
9854 the positions are relative to lower bound LOW, where HIGH is the
9855 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9856 updating *NUM_INDICES as needed. CONTAINER is as for
9857 assign_aggregate. */
9859 aggregate_assign_positional (struct value
*container
,
9860 struct value
*lhs
, struct expression
*exp
,
9861 int *pos
, LONGEST
*indices
, int *num_indices
,
9862 int max_indices
, LONGEST low
, LONGEST high
)
9864 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9866 if (ind
- 1 == high
)
9867 warning (_("Extra components in aggregate ignored."));
9870 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9872 assign_component (container
, lhs
, ind
, exp
, pos
);
9875 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9878 /* Assign into the components of LHS indexed by the OP_CHOICES
9879 construct at *POS, updating *POS past the construct, given that
9880 the allowable indices are LOW..HIGH. Record the indices assigned
9881 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9882 needed. CONTAINER is as for assign_aggregate. */
9884 aggregate_assign_from_choices (struct value
*container
,
9885 struct value
*lhs
, struct expression
*exp
,
9886 int *pos
, LONGEST
*indices
, int *num_indices
,
9887 int max_indices
, LONGEST low
, LONGEST high
)
9890 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9891 int choice_pos
, expr_pc
;
9892 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9894 choice_pos
= *pos
+= 3;
9896 for (j
= 0; j
< n_choices
; j
+= 1)
9897 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9899 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9901 for (j
= 0; j
< n_choices
; j
+= 1)
9903 LONGEST lower
, upper
;
9904 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9906 if (op
== OP_DISCRETE_RANGE
)
9909 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9911 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9916 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9928 name
= &exp
->elts
[choice_pos
+ 2].string
;
9931 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9934 error (_("Invalid record component association."));
9936 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9938 if (! find_struct_field (name
, value_type (lhs
), 0,
9939 NULL
, NULL
, NULL
, NULL
, &ind
))
9940 error (_("Unknown component name: %s."), name
);
9941 lower
= upper
= ind
;
9944 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9945 error (_("Index in component association out of bounds."));
9947 add_component_interval (lower
, upper
, indices
, num_indices
,
9949 while (lower
<= upper
)
9954 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9960 /* Assign the value of the expression in the OP_OTHERS construct in
9961 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9962 have not been previously assigned. The index intervals already assigned
9963 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9964 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9966 aggregate_assign_others (struct value
*container
,
9967 struct value
*lhs
, struct expression
*exp
,
9968 int *pos
, LONGEST
*indices
, int num_indices
,
9969 LONGEST low
, LONGEST high
)
9972 int expr_pc
= *pos
+ 1;
9974 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9978 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9983 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9986 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9989 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9990 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9991 modifying *SIZE as needed. It is an error if *SIZE exceeds
9992 MAX_SIZE. The resulting intervals do not overlap. */
9994 add_component_interval (LONGEST low
, LONGEST high
,
9995 LONGEST
* indices
, int *size
, int max_size
)
9999 for (i
= 0; i
< *size
; i
+= 2) {
10000 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10004 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10005 if (high
< indices
[kh
])
10007 if (low
< indices
[i
])
10009 indices
[i
+ 1] = indices
[kh
- 1];
10010 if (high
> indices
[i
+ 1])
10011 indices
[i
+ 1] = high
;
10012 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10013 *size
-= kh
- i
- 2;
10016 else if (high
< indices
[i
])
10020 if (*size
== max_size
)
10021 error (_("Internal error: miscounted aggregate components."));
10023 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10024 indices
[j
] = indices
[j
- 2];
10026 indices
[i
+ 1] = high
;
10029 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10032 static struct value
*
10033 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
10035 if (type
== ada_check_typedef (value_type (arg2
)))
10038 if (ada_is_fixed_point_type (type
))
10039 return (cast_to_fixed (type
, arg2
));
10041 if (ada_is_fixed_point_type (value_type (arg2
)))
10042 return cast_from_fixed (type
, arg2
);
10044 return value_cast (type
, arg2
);
10047 /* Evaluating Ada expressions, and printing their result.
10048 ------------------------------------------------------
10053 We usually evaluate an Ada expression in order to print its value.
10054 We also evaluate an expression in order to print its type, which
10055 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10056 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10057 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10058 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10061 Evaluating expressions is a little more complicated for Ada entities
10062 than it is for entities in languages such as C. The main reason for
10063 this is that Ada provides types whose definition might be dynamic.
10064 One example of such types is variant records. Or another example
10065 would be an array whose bounds can only be known at run time.
10067 The following description is a general guide as to what should be
10068 done (and what should NOT be done) in order to evaluate an expression
10069 involving such types, and when. This does not cover how the semantic
10070 information is encoded by GNAT as this is covered separatly. For the
10071 document used as the reference for the GNAT encoding, see exp_dbug.ads
10072 in the GNAT sources.
10074 Ideally, we should embed each part of this description next to its
10075 associated code. Unfortunately, the amount of code is so vast right
10076 now that it's hard to see whether the code handling a particular
10077 situation might be duplicated or not. One day, when the code is
10078 cleaned up, this guide might become redundant with the comments
10079 inserted in the code, and we might want to remove it.
10081 2. ``Fixing'' an Entity, the Simple Case:
10082 -----------------------------------------
10084 When evaluating Ada expressions, the tricky issue is that they may
10085 reference entities whose type contents and size are not statically
10086 known. Consider for instance a variant record:
10088 type Rec (Empty : Boolean := True) is record
10091 when False => Value : Integer;
10094 Yes : Rec := (Empty => False, Value => 1);
10095 No : Rec := (empty => True);
10097 The size and contents of that record depends on the value of the
10098 descriminant (Rec.Empty). At this point, neither the debugging
10099 information nor the associated type structure in GDB are able to
10100 express such dynamic types. So what the debugger does is to create
10101 "fixed" versions of the type that applies to the specific object.
10102 We also informally refer to this opperation as "fixing" an object,
10103 which means creating its associated fixed type.
10105 Example: when printing the value of variable "Yes" above, its fixed
10106 type would look like this:
10113 On the other hand, if we printed the value of "No", its fixed type
10120 Things become a little more complicated when trying to fix an entity
10121 with a dynamic type that directly contains another dynamic type,
10122 such as an array of variant records, for instance. There are
10123 two possible cases: Arrays, and records.
10125 3. ``Fixing'' Arrays:
10126 ---------------------
10128 The type structure in GDB describes an array in terms of its bounds,
10129 and the type of its elements. By design, all elements in the array
10130 have the same type and we cannot represent an array of variant elements
10131 using the current type structure in GDB. When fixing an array,
10132 we cannot fix the array element, as we would potentially need one
10133 fixed type per element of the array. As a result, the best we can do
10134 when fixing an array is to produce an array whose bounds and size
10135 are correct (allowing us to read it from memory), but without having
10136 touched its element type. Fixing each element will be done later,
10137 when (if) necessary.
10139 Arrays are a little simpler to handle than records, because the same
10140 amount of memory is allocated for each element of the array, even if
10141 the amount of space actually used by each element differs from element
10142 to element. Consider for instance the following array of type Rec:
10144 type Rec_Array is array (1 .. 2) of Rec;
10146 The actual amount of memory occupied by each element might be different
10147 from element to element, depending on the value of their discriminant.
10148 But the amount of space reserved for each element in the array remains
10149 fixed regardless. So we simply need to compute that size using
10150 the debugging information available, from which we can then determine
10151 the array size (we multiply the number of elements of the array by
10152 the size of each element).
10154 The simplest case is when we have an array of a constrained element
10155 type. For instance, consider the following type declarations:
10157 type Bounded_String (Max_Size : Integer) is
10159 Buffer : String (1 .. Max_Size);
10161 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10163 In this case, the compiler describes the array as an array of
10164 variable-size elements (identified by its XVS suffix) for which
10165 the size can be read in the parallel XVZ variable.
10167 In the case of an array of an unconstrained element type, the compiler
10168 wraps the array element inside a private PAD type. This type should not
10169 be shown to the user, and must be "unwrap"'ed before printing. Note
10170 that we also use the adjective "aligner" in our code to designate
10171 these wrapper types.
10173 In some cases, the size allocated for each element is statically
10174 known. In that case, the PAD type already has the correct size,
10175 and the array element should remain unfixed.
10177 But there are cases when this size is not statically known.
10178 For instance, assuming that "Five" is an integer variable:
10180 type Dynamic is array (1 .. Five) of Integer;
10181 type Wrapper (Has_Length : Boolean := False) is record
10184 when True => Length : Integer;
10185 when False => null;
10188 type Wrapper_Array is array (1 .. 2) of Wrapper;
10190 Hello : Wrapper_Array := (others => (Has_Length => True,
10191 Data => (others => 17),
10195 The debugging info would describe variable Hello as being an
10196 array of a PAD type. The size of that PAD type is not statically
10197 known, but can be determined using a parallel XVZ variable.
10198 In that case, a copy of the PAD type with the correct size should
10199 be used for the fixed array.
10201 3. ``Fixing'' record type objects:
10202 ----------------------------------
10204 Things are slightly different from arrays in the case of dynamic
10205 record types. In this case, in order to compute the associated
10206 fixed type, we need to determine the size and offset of each of
10207 its components. This, in turn, requires us to compute the fixed
10208 type of each of these components.
10210 Consider for instance the example:
10212 type Bounded_String (Max_Size : Natural) is record
10213 Str : String (1 .. Max_Size);
10216 My_String : Bounded_String (Max_Size => 10);
10218 In that case, the position of field "Length" depends on the size
10219 of field Str, which itself depends on the value of the Max_Size
10220 discriminant. In order to fix the type of variable My_String,
10221 we need to fix the type of field Str. Therefore, fixing a variant
10222 record requires us to fix each of its components.
10224 However, if a component does not have a dynamic size, the component
10225 should not be fixed. In particular, fields that use a PAD type
10226 should not fixed. Here is an example where this might happen
10227 (assuming type Rec above):
10229 type Container (Big : Boolean) is record
10233 when True => Another : Integer;
10234 when False => null;
10237 My_Container : Container := (Big => False,
10238 First => (Empty => True),
10241 In that example, the compiler creates a PAD type for component First,
10242 whose size is constant, and then positions the component After just
10243 right after it. The offset of component After is therefore constant
10246 The debugger computes the position of each field based on an algorithm
10247 that uses, among other things, the actual position and size of the field
10248 preceding it. Let's now imagine that the user is trying to print
10249 the value of My_Container. If the type fixing was recursive, we would
10250 end up computing the offset of field After based on the size of the
10251 fixed version of field First. And since in our example First has
10252 only one actual field, the size of the fixed type is actually smaller
10253 than the amount of space allocated to that field, and thus we would
10254 compute the wrong offset of field After.
10256 To make things more complicated, we need to watch out for dynamic
10257 components of variant records (identified by the ___XVL suffix in
10258 the component name). Even if the target type is a PAD type, the size
10259 of that type might not be statically known. So the PAD type needs
10260 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10261 we might end up with the wrong size for our component. This can be
10262 observed with the following type declarations:
10264 type Octal is new Integer range 0 .. 7;
10265 type Octal_Array is array (Positive range <>) of Octal;
10266 pragma Pack (Octal_Array);
10268 type Octal_Buffer (Size : Positive) is record
10269 Buffer : Octal_Array (1 .. Size);
10273 In that case, Buffer is a PAD type whose size is unset and needs
10274 to be computed by fixing the unwrapped type.
10276 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10277 ----------------------------------------------------------
10279 Lastly, when should the sub-elements of an entity that remained unfixed
10280 thus far, be actually fixed?
10282 The answer is: Only when referencing that element. For instance
10283 when selecting one component of a record, this specific component
10284 should be fixed at that point in time. Or when printing the value
10285 of a record, each component should be fixed before its value gets
10286 printed. Similarly for arrays, the element of the array should be
10287 fixed when printing each element of the array, or when extracting
10288 one element out of that array. On the other hand, fixing should
10289 not be performed on the elements when taking a slice of an array!
10291 Note that one of the side-effects of miscomputing the offset and
10292 size of each field is that we end up also miscomputing the size
10293 of the containing type. This can have adverse results when computing
10294 the value of an entity. GDB fetches the value of an entity based
10295 on the size of its type, and thus a wrong size causes GDB to fetch
10296 the wrong amount of memory. In the case where the computed size is
10297 too small, GDB fetches too little data to print the value of our
10298 entiry. Results in this case as unpredicatble, as we usually read
10299 past the buffer containing the data =:-o. */
10301 /* Implement the evaluate_exp routine in the exp_descriptor structure
10302 for the Ada language. */
10304 static struct value
*
10305 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10306 int *pos
, enum noside noside
)
10308 enum exp_opcode op
;
10312 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10315 struct value
**argvec
;
10319 op
= exp
->elts
[pc
].opcode
;
10325 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10327 if (noside
== EVAL_NORMAL
)
10328 arg1
= unwrap_value (arg1
);
10330 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10331 then we need to perform the conversion manually, because
10332 evaluate_subexp_standard doesn't do it. This conversion is
10333 necessary in Ada because the different kinds of float/fixed
10334 types in Ada have different representations.
10336 Similarly, we need to perform the conversion from OP_LONG
10338 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10339 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10345 struct value
*result
;
10348 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10349 /* The result type will have code OP_STRING, bashed there from
10350 OP_ARRAY. Bash it back. */
10351 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10352 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10358 type
= exp
->elts
[pc
+ 1].type
;
10359 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10360 if (noside
== EVAL_SKIP
)
10362 arg1
= ada_value_cast (type
, arg1
, noside
);
10367 type
= exp
->elts
[pc
+ 1].type
;
10368 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10371 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10372 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10374 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10375 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10377 return ada_value_assign (arg1
, arg1
);
10379 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10380 except if the lhs of our assignment is a convenience variable.
10381 In the case of assigning to a convenience variable, the lhs
10382 should be exactly the result of the evaluation of the rhs. */
10383 type
= value_type (arg1
);
10384 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10386 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10387 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10389 if (ada_is_fixed_point_type (value_type (arg1
)))
10390 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10391 else if (ada_is_fixed_point_type (value_type (arg2
)))
10393 (_("Fixed-point values must be assigned to fixed-point variables"));
10395 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10396 return ada_value_assign (arg1
, arg2
);
10399 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10400 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10401 if (noside
== EVAL_SKIP
)
10403 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10404 return (value_from_longest
10405 (value_type (arg1
),
10406 value_as_long (arg1
) + value_as_long (arg2
)));
10407 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10408 return (value_from_longest
10409 (value_type (arg2
),
10410 value_as_long (arg1
) + value_as_long (arg2
)));
10411 if ((ada_is_fixed_point_type (value_type (arg1
))
10412 || ada_is_fixed_point_type (value_type (arg2
)))
10413 && value_type (arg1
) != value_type (arg2
))
10414 error (_("Operands of fixed-point addition must have the same type"));
10415 /* Do the addition, and cast the result to the type of the first
10416 argument. We cannot cast the result to a reference type, so if
10417 ARG1 is a reference type, find its underlying type. */
10418 type
= value_type (arg1
);
10419 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10420 type
= TYPE_TARGET_TYPE (type
);
10421 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10422 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10425 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10426 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10427 if (noside
== EVAL_SKIP
)
10429 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10430 return (value_from_longest
10431 (value_type (arg1
),
10432 value_as_long (arg1
) - value_as_long (arg2
)));
10433 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10434 return (value_from_longest
10435 (value_type (arg2
),
10436 value_as_long (arg1
) - value_as_long (arg2
)));
10437 if ((ada_is_fixed_point_type (value_type (arg1
))
10438 || ada_is_fixed_point_type (value_type (arg2
)))
10439 && value_type (arg1
) != value_type (arg2
))
10440 error (_("Operands of fixed-point subtraction "
10441 "must have the same type"));
10442 /* Do the substraction, and cast the result to the type of the first
10443 argument. We cannot cast the result to a reference type, so if
10444 ARG1 is a reference type, find its underlying type. */
10445 type
= value_type (arg1
);
10446 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10447 type
= TYPE_TARGET_TYPE (type
);
10448 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10449 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10455 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10456 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10457 if (noside
== EVAL_SKIP
)
10459 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10461 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10462 return value_zero (value_type (arg1
), not_lval
);
10466 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10467 if (ada_is_fixed_point_type (value_type (arg1
)))
10468 arg1
= cast_from_fixed (type
, arg1
);
10469 if (ada_is_fixed_point_type (value_type (arg2
)))
10470 arg2
= cast_from_fixed (type
, arg2
);
10471 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10472 return ada_value_binop (arg1
, arg2
, op
);
10476 case BINOP_NOTEQUAL
:
10477 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10478 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10479 if (noside
== EVAL_SKIP
)
10481 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10485 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10486 tem
= ada_value_equal (arg1
, arg2
);
10488 if (op
== BINOP_NOTEQUAL
)
10490 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10491 return value_from_longest (type
, (LONGEST
) tem
);
10494 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10495 if (noside
== EVAL_SKIP
)
10497 else if (ada_is_fixed_point_type (value_type (arg1
)))
10498 return value_cast (value_type (arg1
), value_neg (arg1
));
10501 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10502 return value_neg (arg1
);
10505 case BINOP_LOGICAL_AND
:
10506 case BINOP_LOGICAL_OR
:
10507 case UNOP_LOGICAL_NOT
:
10512 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10513 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10514 return value_cast (type
, val
);
10517 case BINOP_BITWISE_AND
:
10518 case BINOP_BITWISE_IOR
:
10519 case BINOP_BITWISE_XOR
:
10523 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10525 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10527 return value_cast (value_type (arg1
), val
);
10533 if (noside
== EVAL_SKIP
)
10539 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10540 /* Only encountered when an unresolved symbol occurs in a
10541 context other than a function call, in which case, it is
10543 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10544 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10546 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10548 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10549 /* Check to see if this is a tagged type. We also need to handle
10550 the case where the type is a reference to a tagged type, but
10551 we have to be careful to exclude pointers to tagged types.
10552 The latter should be shown as usual (as a pointer), whereas
10553 a reference should mostly be transparent to the user. */
10554 if (ada_is_tagged_type (type
, 0)
10555 || (TYPE_CODE (type
) == TYPE_CODE_REF
10556 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10558 /* Tagged types are a little special in the fact that the real
10559 type is dynamic and can only be determined by inspecting the
10560 object's tag. This means that we need to get the object's
10561 value first (EVAL_NORMAL) and then extract the actual object
10564 Note that we cannot skip the final step where we extract
10565 the object type from its tag, because the EVAL_NORMAL phase
10566 results in dynamic components being resolved into fixed ones.
10567 This can cause problems when trying to print the type
10568 description of tagged types whose parent has a dynamic size:
10569 We use the type name of the "_parent" component in order
10570 to print the name of the ancestor type in the type description.
10571 If that component had a dynamic size, the resolution into
10572 a fixed type would result in the loss of that type name,
10573 thus preventing us from printing the name of the ancestor
10574 type in the type description. */
10575 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10577 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10579 struct type
*actual_type
;
10581 actual_type
= type_from_tag (ada_value_tag (arg1
));
10582 if (actual_type
== NULL
)
10583 /* If, for some reason, we were unable to determine
10584 the actual type from the tag, then use the static
10585 approximation that we just computed as a fallback.
10586 This can happen if the debugging information is
10587 incomplete, for instance. */
10588 actual_type
= type
;
10589 return value_zero (actual_type
, not_lval
);
10593 /* In the case of a ref, ada_coerce_ref takes care
10594 of determining the actual type. But the evaluation
10595 should return a ref as it should be valid to ask
10596 for its address; so rebuild a ref after coerce. */
10597 arg1
= ada_coerce_ref (arg1
);
10598 return value_ref (arg1
);
10602 /* Records and unions for which GNAT encodings have been
10603 generated need to be statically fixed as well.
10604 Otherwise, non-static fixing produces a type where
10605 all dynamic properties are removed, which prevents "ptype"
10606 from being able to completely describe the type.
10607 For instance, a case statement in a variant record would be
10608 replaced by the relevant components based on the actual
10609 value of the discriminants. */
10610 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10611 && dynamic_template_type (type
) != NULL
)
10612 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10613 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10616 return value_zero (to_static_fixed_type (type
), not_lval
);
10620 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10621 return ada_to_fixed_value (arg1
);
10626 /* Allocate arg vector, including space for the function to be
10627 called in argvec[0] and a terminating NULL. */
10628 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10629 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10631 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10632 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10633 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10634 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10637 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10638 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10641 if (noside
== EVAL_SKIP
)
10645 if (ada_is_constrained_packed_array_type
10646 (desc_base_type (value_type (argvec
[0]))))
10647 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10648 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10649 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10650 /* This is a packed array that has already been fixed, and
10651 therefore already coerced to a simple array. Nothing further
10654 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10656 /* Make sure we dereference references so that all the code below
10657 feels like it's really handling the referenced value. Wrapping
10658 types (for alignment) may be there, so make sure we strip them as
10660 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10662 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10663 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10664 argvec
[0] = value_addr (argvec
[0]);
10666 type
= ada_check_typedef (value_type (argvec
[0]));
10668 /* Ada allows us to implicitly dereference arrays when subscripting
10669 them. So, if this is an array typedef (encoding use for array
10670 access types encoded as fat pointers), strip it now. */
10671 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10672 type
= ada_typedef_target_type (type
);
10674 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10676 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10678 case TYPE_CODE_FUNC
:
10679 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10681 case TYPE_CODE_ARRAY
:
10683 case TYPE_CODE_STRUCT
:
10684 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10685 argvec
[0] = ada_value_ind (argvec
[0]);
10686 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10689 error (_("cannot subscript or call something of type `%s'"),
10690 ada_type_name (value_type (argvec
[0])));
10695 switch (TYPE_CODE (type
))
10697 case TYPE_CODE_FUNC
:
10698 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10700 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10702 if (TYPE_GNU_IFUNC (type
))
10703 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10704 return allocate_value (rtype
);
10706 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10707 case TYPE_CODE_INTERNAL_FUNCTION
:
10708 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10709 /* We don't know anything about what the internal
10710 function might return, but we have to return
10712 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10715 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10716 argvec
[0], nargs
, argvec
+ 1);
10718 case TYPE_CODE_STRUCT
:
10722 arity
= ada_array_arity (type
);
10723 type
= ada_array_element_type (type
, nargs
);
10725 error (_("cannot subscript or call a record"));
10726 if (arity
!= nargs
)
10727 error (_("wrong number of subscripts; expecting %d"), arity
);
10728 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10729 return value_zero (ada_aligned_type (type
), lval_memory
);
10731 unwrap_value (ada_value_subscript
10732 (argvec
[0], nargs
, argvec
+ 1));
10734 case TYPE_CODE_ARRAY
:
10735 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10737 type
= ada_array_element_type (type
, nargs
);
10739 error (_("element type of array unknown"));
10741 return value_zero (ada_aligned_type (type
), lval_memory
);
10744 unwrap_value (ada_value_subscript
10745 (ada_coerce_to_simple_array (argvec
[0]),
10746 nargs
, argvec
+ 1));
10747 case TYPE_CODE_PTR
: /* Pointer to array */
10748 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10750 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10751 type
= ada_array_element_type (type
, nargs
);
10753 error (_("element type of array unknown"));
10755 return value_zero (ada_aligned_type (type
), lval_memory
);
10758 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10759 nargs
, argvec
+ 1));
10762 error (_("Attempt to index or call something other than an "
10763 "array or function"));
10768 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10769 struct value
*low_bound_val
=
10770 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10771 struct value
*high_bound_val
=
10772 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10774 LONGEST high_bound
;
10776 low_bound_val
= coerce_ref (low_bound_val
);
10777 high_bound_val
= coerce_ref (high_bound_val
);
10778 low_bound
= value_as_long (low_bound_val
);
10779 high_bound
= value_as_long (high_bound_val
);
10781 if (noside
== EVAL_SKIP
)
10784 /* If this is a reference to an aligner type, then remove all
10786 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10787 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10788 TYPE_TARGET_TYPE (value_type (array
)) =
10789 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10791 if (ada_is_constrained_packed_array_type (value_type (array
)))
10792 error (_("cannot slice a packed array"));
10794 /* If this is a reference to an array or an array lvalue,
10795 convert to a pointer. */
10796 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10797 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10798 && VALUE_LVAL (array
) == lval_memory
))
10799 array
= value_addr (array
);
10801 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10802 && ada_is_array_descriptor_type (ada_check_typedef
10803 (value_type (array
))))
10804 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10806 array
= ada_coerce_to_simple_array_ptr (array
);
10808 /* If we have more than one level of pointer indirection,
10809 dereference the value until we get only one level. */
10810 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10811 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10813 array
= value_ind (array
);
10815 /* Make sure we really do have an array type before going further,
10816 to avoid a SEGV when trying to get the index type or the target
10817 type later down the road if the debug info generated by
10818 the compiler is incorrect or incomplete. */
10819 if (!ada_is_simple_array_type (value_type (array
)))
10820 error (_("cannot take slice of non-array"));
10822 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10825 struct type
*type0
= ada_check_typedef (value_type (array
));
10827 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10828 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10831 struct type
*arr_type0
=
10832 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10834 return ada_value_slice_from_ptr (array
, arr_type0
,
10835 longest_to_int (low_bound
),
10836 longest_to_int (high_bound
));
10839 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10841 else if (high_bound
< low_bound
)
10842 return empty_array (value_type (array
), low_bound
);
10844 return ada_value_slice (array
, longest_to_int (low_bound
),
10845 longest_to_int (high_bound
));
10848 case UNOP_IN_RANGE
:
10850 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10851 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10853 if (noside
== EVAL_SKIP
)
10856 switch (TYPE_CODE (type
))
10859 lim_warning (_("Membership test incompletely implemented; "
10860 "always returns true"));
10861 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10862 return value_from_longest (type
, (LONGEST
) 1);
10864 case TYPE_CODE_RANGE
:
10865 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10866 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10867 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10868 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10869 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10871 value_from_longest (type
,
10872 (value_less (arg1
, arg3
)
10873 || value_equal (arg1
, arg3
))
10874 && (value_less (arg2
, arg1
)
10875 || value_equal (arg2
, arg1
)));
10878 case BINOP_IN_BOUNDS
:
10880 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10881 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10883 if (noside
== EVAL_SKIP
)
10886 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10888 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10889 return value_zero (type
, not_lval
);
10892 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10894 type
= ada_index_type (value_type (arg2
), tem
, "range");
10896 type
= value_type (arg1
);
10898 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10899 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10901 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10902 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10903 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10905 value_from_longest (type
,
10906 (value_less (arg1
, arg3
)
10907 || value_equal (arg1
, arg3
))
10908 && (value_less (arg2
, arg1
)
10909 || value_equal (arg2
, arg1
)));
10911 case TERNOP_IN_RANGE
:
10912 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10913 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10914 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10916 if (noside
== EVAL_SKIP
)
10919 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10920 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10921 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10923 value_from_longest (type
,
10924 (value_less (arg1
, arg3
)
10925 || value_equal (arg1
, arg3
))
10926 && (value_less (arg2
, arg1
)
10927 || value_equal (arg2
, arg1
)));
10931 case OP_ATR_LENGTH
:
10933 struct type
*type_arg
;
10935 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10937 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10939 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10943 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10947 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10948 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10949 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10952 if (noside
== EVAL_SKIP
)
10955 if (type_arg
== NULL
)
10957 arg1
= ada_coerce_ref (arg1
);
10959 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10960 arg1
= ada_coerce_to_simple_array (arg1
);
10962 if (op
== OP_ATR_LENGTH
)
10963 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10966 type
= ada_index_type (value_type (arg1
), tem
,
10967 ada_attribute_name (op
));
10969 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10972 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10973 return allocate_value (type
);
10977 default: /* Should never happen. */
10978 error (_("unexpected attribute encountered"));
10980 return value_from_longest
10981 (type
, ada_array_bound (arg1
, tem
, 0));
10983 return value_from_longest
10984 (type
, ada_array_bound (arg1
, tem
, 1));
10985 case OP_ATR_LENGTH
:
10986 return value_from_longest
10987 (type
, ada_array_length (arg1
, tem
));
10990 else if (discrete_type_p (type_arg
))
10992 struct type
*range_type
;
10993 const char *name
= ada_type_name (type_arg
);
10996 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10997 range_type
= to_fixed_range_type (type_arg
, NULL
);
10998 if (range_type
== NULL
)
10999 range_type
= type_arg
;
11003 error (_("unexpected attribute encountered"));
11005 return value_from_longest
11006 (range_type
, ada_discrete_type_low_bound (range_type
));
11008 return value_from_longest
11009 (range_type
, ada_discrete_type_high_bound (range_type
));
11010 case OP_ATR_LENGTH
:
11011 error (_("the 'length attribute applies only to array types"));
11014 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11015 error (_("unimplemented type attribute"));
11020 if (ada_is_constrained_packed_array_type (type_arg
))
11021 type_arg
= decode_constrained_packed_array_type (type_arg
);
11023 if (op
== OP_ATR_LENGTH
)
11024 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11027 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11029 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11032 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11033 return allocate_value (type
);
11038 error (_("unexpected attribute encountered"));
11040 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11041 return value_from_longest (type
, low
);
11043 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11044 return value_from_longest (type
, high
);
11045 case OP_ATR_LENGTH
:
11046 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11047 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11048 return value_from_longest (type
, high
- low
+ 1);
11054 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11055 if (noside
== EVAL_SKIP
)
11058 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11059 return value_zero (ada_tag_type (arg1
), not_lval
);
11061 return ada_value_tag (arg1
);
11065 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11066 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11067 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11068 if (noside
== EVAL_SKIP
)
11070 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11071 return value_zero (value_type (arg1
), not_lval
);
11074 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11075 return value_binop (arg1
, arg2
,
11076 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11079 case OP_ATR_MODULUS
:
11081 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11083 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11084 if (noside
== EVAL_SKIP
)
11087 if (!ada_is_modular_type (type_arg
))
11088 error (_("'modulus must be applied to modular type"));
11090 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11091 ada_modulus (type_arg
));
11096 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11097 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11098 if (noside
== EVAL_SKIP
)
11100 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11101 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11102 return value_zero (type
, not_lval
);
11104 return value_pos_atr (type
, arg1
);
11107 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11108 type
= value_type (arg1
);
11110 /* If the argument is a reference, then dereference its type, since
11111 the user is really asking for the size of the actual object,
11112 not the size of the pointer. */
11113 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11114 type
= TYPE_TARGET_TYPE (type
);
11116 if (noside
== EVAL_SKIP
)
11118 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11119 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11121 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11122 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11125 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11126 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11127 type
= exp
->elts
[pc
+ 2].type
;
11128 if (noside
== EVAL_SKIP
)
11130 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11131 return value_zero (type
, not_lval
);
11133 return value_val_atr (type
, arg1
);
11136 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11137 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11138 if (noside
== EVAL_SKIP
)
11140 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11141 return value_zero (value_type (arg1
), not_lval
);
11144 /* For integer exponentiation operations,
11145 only promote the first argument. */
11146 if (is_integral_type (value_type (arg2
)))
11147 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11149 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11151 return value_binop (arg1
, arg2
, op
);
11155 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11156 if (noside
== EVAL_SKIP
)
11162 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11163 if (noside
== EVAL_SKIP
)
11165 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11166 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11167 return value_neg (arg1
);
11172 preeval_pos
= *pos
;
11173 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11174 if (noside
== EVAL_SKIP
)
11176 type
= ada_check_typedef (value_type (arg1
));
11177 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11179 if (ada_is_array_descriptor_type (type
))
11180 /* GDB allows dereferencing GNAT array descriptors. */
11182 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11184 if (arrType
== NULL
)
11185 error (_("Attempt to dereference null array pointer."));
11186 return value_at_lazy (arrType
, 0);
11188 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11189 || TYPE_CODE (type
) == TYPE_CODE_REF
11190 /* In C you can dereference an array to get the 1st elt. */
11191 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11193 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11194 only be determined by inspecting the object's tag.
11195 This means that we need to evaluate completely the
11196 expression in order to get its type. */
11198 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11199 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11200 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11202 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11204 type
= value_type (ada_value_ind (arg1
));
11208 type
= to_static_fixed_type
11210 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11212 ada_ensure_varsize_limit (type
);
11213 return value_zero (type
, lval_memory
);
11215 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11217 /* GDB allows dereferencing an int. */
11218 if (expect_type
== NULL
)
11219 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11224 to_static_fixed_type (ada_aligned_type (expect_type
));
11225 return value_zero (expect_type
, lval_memory
);
11229 error (_("Attempt to take contents of a non-pointer value."));
11231 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11232 type
= ada_check_typedef (value_type (arg1
));
11234 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11235 /* GDB allows dereferencing an int. If we were given
11236 the expect_type, then use that as the target type.
11237 Otherwise, assume that the target type is an int. */
11239 if (expect_type
!= NULL
)
11240 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11243 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11244 (CORE_ADDR
) value_as_address (arg1
));
11247 if (ada_is_array_descriptor_type (type
))
11248 /* GDB allows dereferencing GNAT array descriptors. */
11249 return ada_coerce_to_simple_array (arg1
);
11251 return ada_value_ind (arg1
);
11253 case STRUCTOP_STRUCT
:
11254 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11255 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11256 preeval_pos
= *pos
;
11257 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11258 if (noside
== EVAL_SKIP
)
11260 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11262 struct type
*type1
= value_type (arg1
);
11264 if (ada_is_tagged_type (type1
, 1))
11266 type
= ada_lookup_struct_elt_type (type1
,
11267 &exp
->elts
[pc
+ 2].string
,
11270 /* If the field is not found, check if it exists in the
11271 extension of this object's type. This means that we
11272 need to evaluate completely the expression. */
11276 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11278 arg1
= ada_value_struct_elt (arg1
,
11279 &exp
->elts
[pc
+ 2].string
,
11281 arg1
= unwrap_value (arg1
);
11282 type
= value_type (ada_to_fixed_value (arg1
));
11287 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11290 return value_zero (ada_aligned_type (type
), lval_memory
);
11293 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11294 arg1
= unwrap_value (arg1
);
11295 return ada_to_fixed_value (arg1
);
11298 /* The value is not supposed to be used. This is here to make it
11299 easier to accommodate expressions that contain types. */
11301 if (noside
== EVAL_SKIP
)
11303 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11304 return allocate_value (exp
->elts
[pc
+ 1].type
);
11306 error (_("Attempt to use a type name as an expression"));
11311 case OP_DISCRETE_RANGE
:
11312 case OP_POSITIONAL
:
11314 if (noside
== EVAL_NORMAL
)
11318 error (_("Undefined name, ambiguous name, or renaming used in "
11319 "component association: %s."), &exp
->elts
[pc
+2].string
);
11321 error (_("Aggregates only allowed on the right of an assignment"));
11323 internal_error (__FILE__
, __LINE__
,
11324 _("aggregate apparently mangled"));
11327 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11329 for (tem
= 0; tem
< nargs
; tem
+= 1)
11330 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11335 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11341 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11342 type name that encodes the 'small and 'delta information.
11343 Otherwise, return NULL. */
11345 static const char *
11346 fixed_type_info (struct type
*type
)
11348 const char *name
= ada_type_name (type
);
11349 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11351 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11353 const char *tail
= strstr (name
, "___XF_");
11360 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11361 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11366 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11369 ada_is_fixed_point_type (struct type
*type
)
11371 return fixed_type_info (type
) != NULL
;
11374 /* Return non-zero iff TYPE represents a System.Address type. */
11377 ada_is_system_address_type (struct type
*type
)
11379 return (TYPE_NAME (type
)
11380 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11383 /* Assuming that TYPE is the representation of an Ada fixed-point
11384 type, return its delta, or -1 if the type is malformed and the
11385 delta cannot be determined. */
11388 ada_delta (struct type
*type
)
11390 const char *encoding
= fixed_type_info (type
);
11393 /* Strictly speaking, num and den are encoded as integer. However,
11394 they may not fit into a long, and they will have to be converted
11395 to DOUBLEST anyway. So scan them as DOUBLEST. */
11396 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11403 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11404 factor ('SMALL value) associated with the type. */
11407 scaling_factor (struct type
*type
)
11409 const char *encoding
= fixed_type_info (type
);
11410 DOUBLEST num0
, den0
, num1
, den1
;
11413 /* Strictly speaking, num's and den's are encoded as integer. However,
11414 they may not fit into a long, and they will have to be converted
11415 to DOUBLEST anyway. So scan them as DOUBLEST. */
11416 n
= sscanf (encoding
,
11417 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11418 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11419 &num0
, &den0
, &num1
, &den1
);
11424 return num1
/ den1
;
11426 return num0
/ den0
;
11430 /* Assuming that X is the representation of a value of fixed-point
11431 type TYPE, return its floating-point equivalent. */
11434 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11436 return (DOUBLEST
) x
*scaling_factor (type
);
11439 /* The representation of a fixed-point value of type TYPE
11440 corresponding to the value X. */
11443 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11445 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11452 /* Scan STR beginning at position K for a discriminant name, and
11453 return the value of that discriminant field of DVAL in *PX. If
11454 PNEW_K is not null, put the position of the character beyond the
11455 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11456 not alter *PX and *PNEW_K if unsuccessful. */
11459 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11462 static char *bound_buffer
= NULL
;
11463 static size_t bound_buffer_len
= 0;
11464 const char *pstart
, *pend
, *bound
;
11465 struct value
*bound_val
;
11467 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11471 pend
= strstr (pstart
, "__");
11475 k
+= strlen (bound
);
11479 int len
= pend
- pstart
;
11481 /* Strip __ and beyond. */
11482 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11483 strncpy (bound_buffer
, pstart
, len
);
11484 bound_buffer
[len
] = '\0';
11486 bound
= bound_buffer
;
11490 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11491 if (bound_val
== NULL
)
11494 *px
= value_as_long (bound_val
);
11495 if (pnew_k
!= NULL
)
11500 /* Value of variable named NAME in the current environment. If
11501 no such variable found, then if ERR_MSG is null, returns 0, and
11502 otherwise causes an error with message ERR_MSG. */
11504 static struct value
*
11505 get_var_value (char *name
, char *err_msg
)
11507 struct block_symbol
*syms
;
11510 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11515 if (err_msg
== NULL
)
11518 error (("%s"), err_msg
);
11521 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11524 /* Value of integer variable named NAME in the current environment. If
11525 no such variable found, returns 0, and sets *FLAG to 0. If
11526 successful, sets *FLAG to 1. */
11529 get_int_var_value (char *name
, int *flag
)
11531 struct value
*var_val
= get_var_value (name
, 0);
11543 return value_as_long (var_val
);
11548 /* Return a range type whose base type is that of the range type named
11549 NAME in the current environment, and whose bounds are calculated
11550 from NAME according to the GNAT range encoding conventions.
11551 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11552 corresponding range type from debug information; fall back to using it
11553 if symbol lookup fails. If a new type must be created, allocate it
11554 like ORIG_TYPE was. The bounds information, in general, is encoded
11555 in NAME, the base type given in the named range type. */
11557 static struct type
*
11558 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11561 struct type
*base_type
;
11562 const char *subtype_info
;
11564 gdb_assert (raw_type
!= NULL
);
11565 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11567 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11568 base_type
= TYPE_TARGET_TYPE (raw_type
);
11570 base_type
= raw_type
;
11572 name
= TYPE_NAME (raw_type
);
11573 subtype_info
= strstr (name
, "___XD");
11574 if (subtype_info
== NULL
)
11576 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11577 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11579 if (L
< INT_MIN
|| U
> INT_MAX
)
11582 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11587 static char *name_buf
= NULL
;
11588 static size_t name_len
= 0;
11589 int prefix_len
= subtype_info
- name
;
11592 const char *bounds_str
;
11595 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11596 strncpy (name_buf
, name
, prefix_len
);
11597 name_buf
[prefix_len
] = '\0';
11600 bounds_str
= strchr (subtype_info
, '_');
11603 if (*subtype_info
== 'L')
11605 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11606 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11608 if (bounds_str
[n
] == '_')
11610 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11618 strcpy (name_buf
+ prefix_len
, "___L");
11619 L
= get_int_var_value (name_buf
, &ok
);
11622 lim_warning (_("Unknown lower bound, using 1."));
11627 if (*subtype_info
== 'U')
11629 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11630 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11637 strcpy (name_buf
+ prefix_len
, "___U");
11638 U
= get_int_var_value (name_buf
, &ok
);
11641 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11646 type
= create_static_range_type (alloc_type_copy (raw_type
),
11648 TYPE_NAME (type
) = name
;
11653 /* True iff NAME is the name of a range type. */
11656 ada_is_range_type_name (const char *name
)
11658 return (name
!= NULL
&& strstr (name
, "___XD"));
11662 /* Modular types */
11664 /* True iff TYPE is an Ada modular type. */
11667 ada_is_modular_type (struct type
*type
)
11669 struct type
*subranged_type
= get_base_type (type
);
11671 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11672 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11673 && TYPE_UNSIGNED (subranged_type
));
11676 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11679 ada_modulus (struct type
*type
)
11681 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11685 /* Ada exception catchpoint support:
11686 ---------------------------------
11688 We support 3 kinds of exception catchpoints:
11689 . catchpoints on Ada exceptions
11690 . catchpoints on unhandled Ada exceptions
11691 . catchpoints on failed assertions
11693 Exceptions raised during failed assertions, or unhandled exceptions
11694 could perfectly be caught with the general catchpoint on Ada exceptions.
11695 However, we can easily differentiate these two special cases, and having
11696 the option to distinguish these two cases from the rest can be useful
11697 to zero-in on certain situations.
11699 Exception catchpoints are a specialized form of breakpoint,
11700 since they rely on inserting breakpoints inside known routines
11701 of the GNAT runtime. The implementation therefore uses a standard
11702 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11705 Support in the runtime for exception catchpoints have been changed
11706 a few times already, and these changes affect the implementation
11707 of these catchpoints. In order to be able to support several
11708 variants of the runtime, we use a sniffer that will determine
11709 the runtime variant used by the program being debugged. */
11711 /* Ada's standard exceptions.
11713 The Ada 83 standard also defined Numeric_Error. But there so many
11714 situations where it was unclear from the Ada 83 Reference Manual
11715 (RM) whether Constraint_Error or Numeric_Error should be raised,
11716 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11717 Interpretation saying that anytime the RM says that Numeric_Error
11718 should be raised, the implementation may raise Constraint_Error.
11719 Ada 95 went one step further and pretty much removed Numeric_Error
11720 from the list of standard exceptions (it made it a renaming of
11721 Constraint_Error, to help preserve compatibility when compiling
11722 an Ada83 compiler). As such, we do not include Numeric_Error from
11723 this list of standard exceptions. */
11725 static char *standard_exc
[] = {
11726 "constraint_error",
11732 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11734 /* A structure that describes how to support exception catchpoints
11735 for a given executable. */
11737 struct exception_support_info
11739 /* The name of the symbol to break on in order to insert
11740 a catchpoint on exceptions. */
11741 const char *catch_exception_sym
;
11743 /* The name of the symbol to break on in order to insert
11744 a catchpoint on unhandled exceptions. */
11745 const char *catch_exception_unhandled_sym
;
11747 /* The name of the symbol to break on in order to insert
11748 a catchpoint on failed assertions. */
11749 const char *catch_assert_sym
;
11751 /* Assuming that the inferior just triggered an unhandled exception
11752 catchpoint, this function is responsible for returning the address
11753 in inferior memory where the name of that exception is stored.
11754 Return zero if the address could not be computed. */
11755 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11758 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11759 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11761 /* The following exception support info structure describes how to
11762 implement exception catchpoints with the latest version of the
11763 Ada runtime (as of 2007-03-06). */
11765 static const struct exception_support_info default_exception_support_info
=
11767 "__gnat_debug_raise_exception", /* catch_exception_sym */
11768 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11769 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11770 ada_unhandled_exception_name_addr
11773 /* The following exception support info structure describes how to
11774 implement exception catchpoints with a slightly older version
11775 of the Ada runtime. */
11777 static const struct exception_support_info exception_support_info_fallback
=
11779 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11780 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11781 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11782 ada_unhandled_exception_name_addr_from_raise
11785 /* Return nonzero if we can detect the exception support routines
11786 described in EINFO.
11788 This function errors out if an abnormal situation is detected
11789 (for instance, if we find the exception support routines, but
11790 that support is found to be incomplete). */
11793 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11795 struct symbol
*sym
;
11797 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11798 that should be compiled with debugging information. As a result, we
11799 expect to find that symbol in the symtabs. */
11801 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11804 /* Perhaps we did not find our symbol because the Ada runtime was
11805 compiled without debugging info, or simply stripped of it.
11806 It happens on some GNU/Linux distributions for instance, where
11807 users have to install a separate debug package in order to get
11808 the runtime's debugging info. In that situation, let the user
11809 know why we cannot insert an Ada exception catchpoint.
11811 Note: Just for the purpose of inserting our Ada exception
11812 catchpoint, we could rely purely on the associated minimal symbol.
11813 But we would be operating in degraded mode anyway, since we are
11814 still lacking the debugging info needed later on to extract
11815 the name of the exception being raised (this name is printed in
11816 the catchpoint message, and is also used when trying to catch
11817 a specific exception). We do not handle this case for now. */
11818 struct bound_minimal_symbol msym
11819 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11821 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11822 error (_("Your Ada runtime appears to be missing some debugging "
11823 "information.\nCannot insert Ada exception catchpoint "
11824 "in this configuration."));
11829 /* Make sure that the symbol we found corresponds to a function. */
11831 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11832 error (_("Symbol \"%s\" is not a function (class = %d)"),
11833 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11838 /* Inspect the Ada runtime and determine which exception info structure
11839 should be used to provide support for exception catchpoints.
11841 This function will always set the per-inferior exception_info,
11842 or raise an error. */
11845 ada_exception_support_info_sniffer (void)
11847 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11849 /* If the exception info is already known, then no need to recompute it. */
11850 if (data
->exception_info
!= NULL
)
11853 /* Check the latest (default) exception support info. */
11854 if (ada_has_this_exception_support (&default_exception_support_info
))
11856 data
->exception_info
= &default_exception_support_info
;
11860 /* Try our fallback exception suport info. */
11861 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11863 data
->exception_info
= &exception_support_info_fallback
;
11867 /* Sometimes, it is normal for us to not be able to find the routine
11868 we are looking for. This happens when the program is linked with
11869 the shared version of the GNAT runtime, and the program has not been
11870 started yet. Inform the user of these two possible causes if
11873 if (ada_update_initial_language (language_unknown
) != language_ada
)
11874 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11876 /* If the symbol does not exist, then check that the program is
11877 already started, to make sure that shared libraries have been
11878 loaded. If it is not started, this may mean that the symbol is
11879 in a shared library. */
11881 if (ptid_get_pid (inferior_ptid
) == 0)
11882 error (_("Unable to insert catchpoint. Try to start the program first."));
11884 /* At this point, we know that we are debugging an Ada program and
11885 that the inferior has been started, but we still are not able to
11886 find the run-time symbols. That can mean that we are in
11887 configurable run time mode, or that a-except as been optimized
11888 out by the linker... In any case, at this point it is not worth
11889 supporting this feature. */
11891 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11894 /* True iff FRAME is very likely to be that of a function that is
11895 part of the runtime system. This is all very heuristic, but is
11896 intended to be used as advice as to what frames are uninteresting
11900 is_known_support_routine (struct frame_info
*frame
)
11902 struct symtab_and_line sal
;
11904 enum language func_lang
;
11906 const char *fullname
;
11908 /* If this code does not have any debugging information (no symtab),
11909 This cannot be any user code. */
11911 find_frame_sal (frame
, &sal
);
11912 if (sal
.symtab
== NULL
)
11915 /* If there is a symtab, but the associated source file cannot be
11916 located, then assume this is not user code: Selecting a frame
11917 for which we cannot display the code would not be very helpful
11918 for the user. This should also take care of case such as VxWorks
11919 where the kernel has some debugging info provided for a few units. */
11921 fullname
= symtab_to_fullname (sal
.symtab
);
11922 if (access (fullname
, R_OK
) != 0)
11925 /* Check the unit filename againt the Ada runtime file naming.
11926 We also check the name of the objfile against the name of some
11927 known system libraries that sometimes come with debugging info
11930 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11932 re_comp (known_runtime_file_name_patterns
[i
]);
11933 if (re_exec (lbasename (sal
.symtab
->filename
)))
11935 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11936 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11940 /* Check whether the function is a GNAT-generated entity. */
11942 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11943 if (func_name
== NULL
)
11946 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11948 re_comp (known_auxiliary_function_name_patterns
[i
]);
11949 if (re_exec (func_name
))
11960 /* Find the first frame that contains debugging information and that is not
11961 part of the Ada run-time, starting from FI and moving upward. */
11964 ada_find_printable_frame (struct frame_info
*fi
)
11966 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11968 if (!is_known_support_routine (fi
))
11977 /* Assuming that the inferior just triggered an unhandled exception
11978 catchpoint, return the address in inferior memory where the name
11979 of the exception is stored.
11981 Return zero if the address could not be computed. */
11984 ada_unhandled_exception_name_addr (void)
11986 return parse_and_eval_address ("e.full_name");
11989 /* Same as ada_unhandled_exception_name_addr, except that this function
11990 should be used when the inferior uses an older version of the runtime,
11991 where the exception name needs to be extracted from a specific frame
11992 several frames up in the callstack. */
11995 ada_unhandled_exception_name_addr_from_raise (void)
11998 struct frame_info
*fi
;
11999 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12000 struct cleanup
*old_chain
;
12002 /* To determine the name of this exception, we need to select
12003 the frame corresponding to RAISE_SYM_NAME. This frame is
12004 at least 3 levels up, so we simply skip the first 3 frames
12005 without checking the name of their associated function. */
12006 fi
= get_current_frame ();
12007 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12009 fi
= get_prev_frame (fi
);
12011 old_chain
= make_cleanup (null_cleanup
, NULL
);
12015 enum language func_lang
;
12017 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
12018 if (func_name
!= NULL
)
12020 make_cleanup (xfree
, func_name
);
12022 if (strcmp (func_name
,
12023 data
->exception_info
->catch_exception_sym
) == 0)
12024 break; /* We found the frame we were looking for... */
12025 fi
= get_prev_frame (fi
);
12028 do_cleanups (old_chain
);
12034 return parse_and_eval_address ("id.full_name");
12037 /* Assuming the inferior just triggered an Ada exception catchpoint
12038 (of any type), return the address in inferior memory where the name
12039 of the exception is stored, if applicable.
12041 Return zero if the address could not be computed, or if not relevant. */
12044 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12045 struct breakpoint
*b
)
12047 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12051 case ada_catch_exception
:
12052 return (parse_and_eval_address ("e.full_name"));
12055 case ada_catch_exception_unhandled
:
12056 return data
->exception_info
->unhandled_exception_name_addr ();
12059 case ada_catch_assert
:
12060 return 0; /* Exception name is not relevant in this case. */
12064 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12068 return 0; /* Should never be reached. */
12071 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12072 any error that ada_exception_name_addr_1 might cause to be thrown.
12073 When an error is intercepted, a warning with the error message is printed,
12074 and zero is returned. */
12077 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12078 struct breakpoint
*b
)
12080 CORE_ADDR result
= 0;
12084 result
= ada_exception_name_addr_1 (ex
, b
);
12087 CATCH (e
, RETURN_MASK_ERROR
)
12089 warning (_("failed to get exception name: %s"), e
.message
);
12097 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
12099 /* Ada catchpoints.
12101 In the case of catchpoints on Ada exceptions, the catchpoint will
12102 stop the target on every exception the program throws. When a user
12103 specifies the name of a specific exception, we translate this
12104 request into a condition expression (in text form), and then parse
12105 it into an expression stored in each of the catchpoint's locations.
12106 We then use this condition to check whether the exception that was
12107 raised is the one the user is interested in. If not, then the
12108 target is resumed again. We store the name of the requested
12109 exception, in order to be able to re-set the condition expression
12110 when symbols change. */
12112 /* An instance of this type is used to represent an Ada catchpoint
12113 breakpoint location. It includes a "struct bp_location" as a kind
12114 of base class; users downcast to "struct bp_location *" when
12117 struct ada_catchpoint_location
12119 /* The base class. */
12120 struct bp_location base
;
12122 /* The condition that checks whether the exception that was raised
12123 is the specific exception the user specified on catchpoint
12125 struct expression
*excep_cond_expr
;
12128 /* Implement the DTOR method in the bp_location_ops structure for all
12129 Ada exception catchpoint kinds. */
12132 ada_catchpoint_location_dtor (struct bp_location
*bl
)
12134 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
12136 xfree (al
->excep_cond_expr
);
12139 /* The vtable to be used in Ada catchpoint locations. */
12141 static const struct bp_location_ops ada_catchpoint_location_ops
=
12143 ada_catchpoint_location_dtor
12146 /* An instance of this type is used to represent an Ada catchpoint.
12147 It includes a "struct breakpoint" as a kind of base class; users
12148 downcast to "struct breakpoint *" when needed. */
12150 struct ada_catchpoint
12152 /* The base class. */
12153 struct breakpoint base
;
12155 /* The name of the specific exception the user specified. */
12156 char *excep_string
;
12159 /* Parse the exception condition string in the context of each of the
12160 catchpoint's locations, and store them for later evaluation. */
12163 create_excep_cond_exprs (struct ada_catchpoint
*c
)
12165 struct cleanup
*old_chain
;
12166 struct bp_location
*bl
;
12169 /* Nothing to do if there's no specific exception to catch. */
12170 if (c
->excep_string
== NULL
)
12173 /* Same if there are no locations... */
12174 if (c
->base
.loc
== NULL
)
12177 /* Compute the condition expression in text form, from the specific
12178 expection we want to catch. */
12179 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
12180 old_chain
= make_cleanup (xfree
, cond_string
);
12182 /* Iterate over all the catchpoint's locations, and parse an
12183 expression for each. */
12184 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
12186 struct ada_catchpoint_location
*ada_loc
12187 = (struct ada_catchpoint_location
*) bl
;
12188 struct expression
*exp
= NULL
;
12190 if (!bl
->shlib_disabled
)
12197 exp
= parse_exp_1 (&s
, bl
->address
,
12198 block_for_pc (bl
->address
), 0);
12200 CATCH (e
, RETURN_MASK_ERROR
)
12202 warning (_("failed to reevaluate internal exception condition "
12203 "for catchpoint %d: %s"),
12204 c
->base
.number
, e
.message
);
12205 /* There is a bug in GCC on sparc-solaris when building with
12206 optimization which causes EXP to change unexpectedly
12207 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
12208 The problem should be fixed starting with GCC 4.9.
12209 In the meantime, work around it by forcing EXP back
12216 ada_loc
->excep_cond_expr
= exp
;
12219 do_cleanups (old_chain
);
12222 /* Implement the DTOR method in the breakpoint_ops structure for all
12223 exception catchpoint kinds. */
12226 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12228 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12230 xfree (c
->excep_string
);
12232 bkpt_breakpoint_ops
.dtor (b
);
12235 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12236 structure for all exception catchpoint kinds. */
12238 static struct bp_location
*
12239 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12240 struct breakpoint
*self
)
12242 struct ada_catchpoint_location
*loc
;
12244 loc
= XNEW (struct ada_catchpoint_location
);
12245 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
12246 loc
->excep_cond_expr
= NULL
;
12250 /* Implement the RE_SET method in the breakpoint_ops structure for all
12251 exception catchpoint kinds. */
12254 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12256 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12258 /* Call the base class's method. This updates the catchpoint's
12260 bkpt_breakpoint_ops
.re_set (b
);
12262 /* Reparse the exception conditional expressions. One for each
12264 create_excep_cond_exprs (c
);
12267 /* Returns true if we should stop for this breakpoint hit. If the
12268 user specified a specific exception, we only want to cause a stop
12269 if the program thrown that exception. */
12272 should_stop_exception (const struct bp_location
*bl
)
12274 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12275 const struct ada_catchpoint_location
*ada_loc
12276 = (const struct ada_catchpoint_location
*) bl
;
12279 /* With no specific exception, should always stop. */
12280 if (c
->excep_string
== NULL
)
12283 if (ada_loc
->excep_cond_expr
== NULL
)
12285 /* We will have a NULL expression if back when we were creating
12286 the expressions, this location's had failed to parse. */
12293 struct value
*mark
;
12295 mark
= value_mark ();
12296 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
12297 value_free_to_mark (mark
);
12299 CATCH (ex
, RETURN_MASK_ALL
)
12301 exception_fprintf (gdb_stderr
, ex
,
12302 _("Error in testing exception condition:\n"));
12309 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12310 for all exception catchpoint kinds. */
12313 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12315 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12318 /* Implement the PRINT_IT method in the breakpoint_ops structure
12319 for all exception catchpoint kinds. */
12321 static enum print_stop_action
12322 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12324 struct ui_out
*uiout
= current_uiout
;
12325 struct breakpoint
*b
= bs
->breakpoint_at
;
12327 annotate_catchpoint (b
->number
);
12329 if (ui_out_is_mi_like_p (uiout
))
12331 ui_out_field_string (uiout
, "reason",
12332 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12333 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
12336 ui_out_text (uiout
,
12337 b
->disposition
== disp_del
? "\nTemporary catchpoint "
12338 : "\nCatchpoint ");
12339 ui_out_field_int (uiout
, "bkptno", b
->number
);
12340 ui_out_text (uiout
, ", ");
12344 case ada_catch_exception
:
12345 case ada_catch_exception_unhandled
:
12347 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12348 char exception_name
[256];
12352 read_memory (addr
, (gdb_byte
*) exception_name
,
12353 sizeof (exception_name
) - 1);
12354 exception_name
[sizeof (exception_name
) - 1] = '\0';
12358 /* For some reason, we were unable to read the exception
12359 name. This could happen if the Runtime was compiled
12360 without debugging info, for instance. In that case,
12361 just replace the exception name by the generic string
12362 "exception" - it will read as "an exception" in the
12363 notification we are about to print. */
12364 memcpy (exception_name
, "exception", sizeof ("exception"));
12366 /* In the case of unhandled exception breakpoints, we print
12367 the exception name as "unhandled EXCEPTION_NAME", to make
12368 it clearer to the user which kind of catchpoint just got
12369 hit. We used ui_out_text to make sure that this extra
12370 info does not pollute the exception name in the MI case. */
12371 if (ex
== ada_catch_exception_unhandled
)
12372 ui_out_text (uiout
, "unhandled ");
12373 ui_out_field_string (uiout
, "exception-name", exception_name
);
12376 case ada_catch_assert
:
12377 /* In this case, the name of the exception is not really
12378 important. Just print "failed assertion" to make it clearer
12379 that his program just hit an assertion-failure catchpoint.
12380 We used ui_out_text because this info does not belong in
12382 ui_out_text (uiout
, "failed assertion");
12385 ui_out_text (uiout
, " at ");
12386 ada_find_printable_frame (get_current_frame ());
12388 return PRINT_SRC_AND_LOC
;
12391 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12392 for all exception catchpoint kinds. */
12395 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12396 struct breakpoint
*b
, struct bp_location
**last_loc
)
12398 struct ui_out
*uiout
= current_uiout
;
12399 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12400 struct value_print_options opts
;
12402 get_user_print_options (&opts
);
12403 if (opts
.addressprint
)
12405 annotate_field (4);
12406 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
12409 annotate_field (5);
12410 *last_loc
= b
->loc
;
12413 case ada_catch_exception
:
12414 if (c
->excep_string
!= NULL
)
12416 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12418 ui_out_field_string (uiout
, "what", msg
);
12422 ui_out_field_string (uiout
, "what", "all Ada exceptions");
12426 case ada_catch_exception_unhandled
:
12427 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12430 case ada_catch_assert
:
12431 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12435 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12440 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12441 for all exception catchpoint kinds. */
12444 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12445 struct breakpoint
*b
)
12447 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12448 struct ui_out
*uiout
= current_uiout
;
12450 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12451 : _("Catchpoint "));
12452 ui_out_field_int (uiout
, "bkptno", b
->number
);
12453 ui_out_text (uiout
, ": ");
12457 case ada_catch_exception
:
12458 if (c
->excep_string
!= NULL
)
12460 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12461 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12463 ui_out_text (uiout
, info
);
12464 do_cleanups (old_chain
);
12467 ui_out_text (uiout
, _("all Ada exceptions"));
12470 case ada_catch_exception_unhandled
:
12471 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12474 case ada_catch_assert
:
12475 ui_out_text (uiout
, _("failed Ada assertions"));
12479 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12484 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12485 for all exception catchpoint kinds. */
12488 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12489 struct breakpoint
*b
, struct ui_file
*fp
)
12491 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12495 case ada_catch_exception
:
12496 fprintf_filtered (fp
, "catch exception");
12497 if (c
->excep_string
!= NULL
)
12498 fprintf_filtered (fp
, " %s", c
->excep_string
);
12501 case ada_catch_exception_unhandled
:
12502 fprintf_filtered (fp
, "catch exception unhandled");
12505 case ada_catch_assert
:
12506 fprintf_filtered (fp
, "catch assert");
12510 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12512 print_recreate_thread (b
, fp
);
12515 /* Virtual table for "catch exception" breakpoints. */
12518 dtor_catch_exception (struct breakpoint
*b
)
12520 dtor_exception (ada_catch_exception
, b
);
12523 static struct bp_location
*
12524 allocate_location_catch_exception (struct breakpoint
*self
)
12526 return allocate_location_exception (ada_catch_exception
, self
);
12530 re_set_catch_exception (struct breakpoint
*b
)
12532 re_set_exception (ada_catch_exception
, b
);
12536 check_status_catch_exception (bpstat bs
)
12538 check_status_exception (ada_catch_exception
, bs
);
12541 static enum print_stop_action
12542 print_it_catch_exception (bpstat bs
)
12544 return print_it_exception (ada_catch_exception
, bs
);
12548 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12550 print_one_exception (ada_catch_exception
, b
, last_loc
);
12554 print_mention_catch_exception (struct breakpoint
*b
)
12556 print_mention_exception (ada_catch_exception
, b
);
12560 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12562 print_recreate_exception (ada_catch_exception
, b
, fp
);
12565 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12567 /* Virtual table for "catch exception unhandled" breakpoints. */
12570 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12572 dtor_exception (ada_catch_exception_unhandled
, b
);
12575 static struct bp_location
*
12576 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12578 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12582 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12584 re_set_exception (ada_catch_exception_unhandled
, b
);
12588 check_status_catch_exception_unhandled (bpstat bs
)
12590 check_status_exception (ada_catch_exception_unhandled
, bs
);
12593 static enum print_stop_action
12594 print_it_catch_exception_unhandled (bpstat bs
)
12596 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12600 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12601 struct bp_location
**last_loc
)
12603 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12607 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12609 print_mention_exception (ada_catch_exception_unhandled
, b
);
12613 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12614 struct ui_file
*fp
)
12616 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12619 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12621 /* Virtual table for "catch assert" breakpoints. */
12624 dtor_catch_assert (struct breakpoint
*b
)
12626 dtor_exception (ada_catch_assert
, b
);
12629 static struct bp_location
*
12630 allocate_location_catch_assert (struct breakpoint
*self
)
12632 return allocate_location_exception (ada_catch_assert
, self
);
12636 re_set_catch_assert (struct breakpoint
*b
)
12638 re_set_exception (ada_catch_assert
, b
);
12642 check_status_catch_assert (bpstat bs
)
12644 check_status_exception (ada_catch_assert
, bs
);
12647 static enum print_stop_action
12648 print_it_catch_assert (bpstat bs
)
12650 return print_it_exception (ada_catch_assert
, bs
);
12654 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12656 print_one_exception (ada_catch_assert
, b
, last_loc
);
12660 print_mention_catch_assert (struct breakpoint
*b
)
12662 print_mention_exception (ada_catch_assert
, b
);
12666 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12668 print_recreate_exception (ada_catch_assert
, b
, fp
);
12671 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12673 /* Return a newly allocated copy of the first space-separated token
12674 in ARGSP, and then adjust ARGSP to point immediately after that
12677 Return NULL if ARGPS does not contain any more tokens. */
12680 ada_get_next_arg (char **argsp
)
12682 char *args
= *argsp
;
12686 args
= skip_spaces (args
);
12687 if (args
[0] == '\0')
12688 return NULL
; /* No more arguments. */
12690 /* Find the end of the current argument. */
12692 end
= skip_to_space (args
);
12694 /* Adjust ARGSP to point to the start of the next argument. */
12698 /* Make a copy of the current argument and return it. */
12700 result
= (char *) xmalloc (end
- args
+ 1);
12701 strncpy (result
, args
, end
- args
);
12702 result
[end
- args
] = '\0';
12707 /* Split the arguments specified in a "catch exception" command.
12708 Set EX to the appropriate catchpoint type.
12709 Set EXCEP_STRING to the name of the specific exception if
12710 specified by the user.
12711 If a condition is found at the end of the arguments, the condition
12712 expression is stored in COND_STRING (memory must be deallocated
12713 after use). Otherwise COND_STRING is set to NULL. */
12716 catch_ada_exception_command_split (char *args
,
12717 enum ada_exception_catchpoint_kind
*ex
,
12718 char **excep_string
,
12719 char **cond_string
)
12721 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12722 char *exception_name
;
12725 exception_name
= ada_get_next_arg (&args
);
12726 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12728 /* This is not an exception name; this is the start of a condition
12729 expression for a catchpoint on all exceptions. So, "un-get"
12730 this token, and set exception_name to NULL. */
12731 xfree (exception_name
);
12732 exception_name
= NULL
;
12735 make_cleanup (xfree
, exception_name
);
12737 /* Check to see if we have a condition. */
12739 args
= skip_spaces (args
);
12740 if (startswith (args
, "if")
12741 && (isspace (args
[2]) || args
[2] == '\0'))
12744 args
= skip_spaces (args
);
12746 if (args
[0] == '\0')
12747 error (_("Condition missing after `if' keyword"));
12748 cond
= xstrdup (args
);
12749 make_cleanup (xfree
, cond
);
12751 args
+= strlen (args
);
12754 /* Check that we do not have any more arguments. Anything else
12757 if (args
[0] != '\0')
12758 error (_("Junk at end of expression"));
12760 discard_cleanups (old_chain
);
12762 if (exception_name
== NULL
)
12764 /* Catch all exceptions. */
12765 *ex
= ada_catch_exception
;
12766 *excep_string
= NULL
;
12768 else if (strcmp (exception_name
, "unhandled") == 0)
12770 /* Catch unhandled exceptions. */
12771 *ex
= ada_catch_exception_unhandled
;
12772 *excep_string
= NULL
;
12776 /* Catch a specific exception. */
12777 *ex
= ada_catch_exception
;
12778 *excep_string
= exception_name
;
12780 *cond_string
= cond
;
12783 /* Return the name of the symbol on which we should break in order to
12784 implement a catchpoint of the EX kind. */
12786 static const char *
12787 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12789 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12791 gdb_assert (data
->exception_info
!= NULL
);
12795 case ada_catch_exception
:
12796 return (data
->exception_info
->catch_exception_sym
);
12798 case ada_catch_exception_unhandled
:
12799 return (data
->exception_info
->catch_exception_unhandled_sym
);
12801 case ada_catch_assert
:
12802 return (data
->exception_info
->catch_assert_sym
);
12805 internal_error (__FILE__
, __LINE__
,
12806 _("unexpected catchpoint kind (%d)"), ex
);
12810 /* Return the breakpoint ops "virtual table" used for catchpoints
12813 static const struct breakpoint_ops
*
12814 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12818 case ada_catch_exception
:
12819 return (&catch_exception_breakpoint_ops
);
12821 case ada_catch_exception_unhandled
:
12822 return (&catch_exception_unhandled_breakpoint_ops
);
12824 case ada_catch_assert
:
12825 return (&catch_assert_breakpoint_ops
);
12828 internal_error (__FILE__
, __LINE__
,
12829 _("unexpected catchpoint kind (%d)"), ex
);
12833 /* Return the condition that will be used to match the current exception
12834 being raised with the exception that the user wants to catch. This
12835 assumes that this condition is used when the inferior just triggered
12836 an exception catchpoint.
12838 The string returned is a newly allocated string that needs to be
12839 deallocated later. */
12842 ada_exception_catchpoint_cond_string (const char *excep_string
)
12846 /* The standard exceptions are a special case. They are defined in
12847 runtime units that have been compiled without debugging info; if
12848 EXCEP_STRING is the not-fully-qualified name of a standard
12849 exception (e.g. "constraint_error") then, during the evaluation
12850 of the condition expression, the symbol lookup on this name would
12851 *not* return this standard exception. The catchpoint condition
12852 may then be set only on user-defined exceptions which have the
12853 same not-fully-qualified name (e.g. my_package.constraint_error).
12855 To avoid this unexcepted behavior, these standard exceptions are
12856 systematically prefixed by "standard". This means that "catch
12857 exception constraint_error" is rewritten into "catch exception
12858 standard.constraint_error".
12860 If an exception named contraint_error is defined in another package of
12861 the inferior program, then the only way to specify this exception as a
12862 breakpoint condition is to use its fully-qualified named:
12863 e.g. my_package.constraint_error. */
12865 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12867 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12869 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12873 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12876 /* Return the symtab_and_line that should be used to insert an exception
12877 catchpoint of the TYPE kind.
12879 EXCEP_STRING should contain the name of a specific exception that
12880 the catchpoint should catch, or NULL otherwise.
12882 ADDR_STRING returns the name of the function where the real
12883 breakpoint that implements the catchpoints is set, depending on the
12884 type of catchpoint we need to create. */
12886 static struct symtab_and_line
12887 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12888 char **addr_string
, const struct breakpoint_ops
**ops
)
12890 const char *sym_name
;
12891 struct symbol
*sym
;
12893 /* First, find out which exception support info to use. */
12894 ada_exception_support_info_sniffer ();
12896 /* Then lookup the function on which we will break in order to catch
12897 the Ada exceptions requested by the user. */
12898 sym_name
= ada_exception_sym_name (ex
);
12899 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12901 /* We can assume that SYM is not NULL at this stage. If the symbol
12902 did not exist, ada_exception_support_info_sniffer would have
12903 raised an exception.
12905 Also, ada_exception_support_info_sniffer should have already
12906 verified that SYM is a function symbol. */
12907 gdb_assert (sym
!= NULL
);
12908 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12910 /* Set ADDR_STRING. */
12911 *addr_string
= xstrdup (sym_name
);
12914 *ops
= ada_exception_breakpoint_ops (ex
);
12916 return find_function_start_sal (sym
, 1);
12919 /* Create an Ada exception catchpoint.
12921 EX_KIND is the kind of exception catchpoint to be created.
12923 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12924 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12925 of the exception to which this catchpoint applies. When not NULL,
12926 the string must be allocated on the heap, and its deallocation
12927 is no longer the responsibility of the caller.
12929 COND_STRING, if not NULL, is the catchpoint condition. This string
12930 must be allocated on the heap, and its deallocation is no longer
12931 the responsibility of the caller.
12933 TEMPFLAG, if nonzero, means that the underlying breakpoint
12934 should be temporary.
12936 FROM_TTY is the usual argument passed to all commands implementations. */
12939 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12940 enum ada_exception_catchpoint_kind ex_kind
,
12941 char *excep_string
,
12947 struct ada_catchpoint
*c
;
12948 char *addr_string
= NULL
;
12949 const struct breakpoint_ops
*ops
= NULL
;
12950 struct symtab_and_line sal
12951 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12953 c
= XNEW (struct ada_catchpoint
);
12954 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12955 ops
, tempflag
, disabled
, from_tty
);
12956 c
->excep_string
= excep_string
;
12957 create_excep_cond_exprs (c
);
12958 if (cond_string
!= NULL
)
12959 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12960 install_breakpoint (0, &c
->base
, 1);
12963 /* Implement the "catch exception" command. */
12966 catch_ada_exception_command (char *arg
, int from_tty
,
12967 struct cmd_list_element
*command
)
12969 struct gdbarch
*gdbarch
= get_current_arch ();
12971 enum ada_exception_catchpoint_kind ex_kind
;
12972 char *excep_string
= NULL
;
12973 char *cond_string
= NULL
;
12975 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12979 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12981 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12982 excep_string
, cond_string
,
12983 tempflag
, 1 /* enabled */,
12987 /* Split the arguments specified in a "catch assert" command.
12989 ARGS contains the command's arguments (or the empty string if
12990 no arguments were passed).
12992 If ARGS contains a condition, set COND_STRING to that condition
12993 (the memory needs to be deallocated after use). */
12996 catch_ada_assert_command_split (char *args
, char **cond_string
)
12998 args
= skip_spaces (args
);
13000 /* Check whether a condition was provided. */
13001 if (startswith (args
, "if")
13002 && (isspace (args
[2]) || args
[2] == '\0'))
13005 args
= skip_spaces (args
);
13006 if (args
[0] == '\0')
13007 error (_("condition missing after `if' keyword"));
13008 *cond_string
= xstrdup (args
);
13011 /* Otherwise, there should be no other argument at the end of
13013 else if (args
[0] != '\0')
13014 error (_("Junk at end of arguments."));
13017 /* Implement the "catch assert" command. */
13020 catch_assert_command (char *arg
, int from_tty
,
13021 struct cmd_list_element
*command
)
13023 struct gdbarch
*gdbarch
= get_current_arch ();
13025 char *cond_string
= NULL
;
13027 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13031 catch_ada_assert_command_split (arg
, &cond_string
);
13032 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13034 tempflag
, 1 /* enabled */,
13038 /* Return non-zero if the symbol SYM is an Ada exception object. */
13041 ada_is_exception_sym (struct symbol
*sym
)
13043 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
13045 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13046 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13047 && SYMBOL_CLASS (sym
) != LOC_CONST
13048 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13049 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13052 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13053 Ada exception object. This matches all exceptions except the ones
13054 defined by the Ada language. */
13057 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13061 if (!ada_is_exception_sym (sym
))
13064 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13065 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
13066 return 0; /* A standard exception. */
13068 /* Numeric_Error is also a standard exception, so exclude it.
13069 See the STANDARD_EXC description for more details as to why
13070 this exception is not listed in that array. */
13071 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
13077 /* A helper function for qsort, comparing two struct ada_exc_info
13080 The comparison is determined first by exception name, and then
13081 by exception address. */
13084 compare_ada_exception_info (const void *a
, const void *b
)
13086 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
13087 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
13090 result
= strcmp (exc_a
->name
, exc_b
->name
);
13094 if (exc_a
->addr
< exc_b
->addr
)
13096 if (exc_a
->addr
> exc_b
->addr
)
13102 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13103 routine, but keeping the first SKIP elements untouched.
13105 All duplicates are also removed. */
13108 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
13111 struct ada_exc_info
*to_sort
13112 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
13114 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
13117 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
13118 compare_ada_exception_info
);
13120 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
13121 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
13122 to_sort
[j
++] = to_sort
[i
];
13124 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
13127 /* A function intended as the "name_matcher" callback in the struct
13128 quick_symbol_functions' expand_symtabs_matching method.
13130 SEARCH_NAME is the symbol's search name.
13132 If USER_DATA is not NULL, it is a pointer to a regext_t object
13133 used to match the symbol (by natural name). Otherwise, when USER_DATA
13134 is null, no filtering is performed, and all symbols are a positive
13138 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
13140 regex_t
*preg
= (regex_t
*) user_data
;
13145 /* In Ada, the symbol "search name" is a linkage name, whereas
13146 the regular expression used to do the matching refers to
13147 the natural name. So match against the decoded name. */
13148 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
13151 /* Add all exceptions defined by the Ada standard whose name match
13152 a regular expression.
13154 If PREG is not NULL, then this regexp_t object is used to
13155 perform the symbol name matching. Otherwise, no name-based
13156 filtering is performed.
13158 EXCEPTIONS is a vector of exceptions to which matching exceptions
13162 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13166 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13169 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
13171 struct bound_minimal_symbol msymbol
13172 = ada_lookup_simple_minsym (standard_exc
[i
]);
13174 if (msymbol
.minsym
!= NULL
)
13176 struct ada_exc_info info
13177 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13179 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13185 /* Add all Ada exceptions defined locally and accessible from the given
13188 If PREG is not NULL, then this regexp_t object is used to
13189 perform the symbol name matching. Otherwise, no name-based
13190 filtering is performed.
13192 EXCEPTIONS is a vector of exceptions to which matching exceptions
13196 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
13197 VEC(ada_exc_info
) **exceptions
)
13199 const struct block
*block
= get_frame_block (frame
, 0);
13203 struct block_iterator iter
;
13204 struct symbol
*sym
;
13206 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13208 switch (SYMBOL_CLASS (sym
))
13215 if (ada_is_exception_sym (sym
))
13217 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13218 SYMBOL_VALUE_ADDRESS (sym
)};
13220 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13224 if (BLOCK_FUNCTION (block
) != NULL
)
13226 block
= BLOCK_SUPERBLOCK (block
);
13230 /* Add all exceptions defined globally whose name name match
13231 a regular expression, excluding standard exceptions.
13233 The reason we exclude standard exceptions is that they need
13234 to be handled separately: Standard exceptions are defined inside
13235 a runtime unit which is normally not compiled with debugging info,
13236 and thus usually do not show up in our symbol search. However,
13237 if the unit was in fact built with debugging info, we need to
13238 exclude them because they would duplicate the entry we found
13239 during the special loop that specifically searches for those
13240 standard exceptions.
13242 If PREG is not NULL, then this regexp_t object is used to
13243 perform the symbol name matching. Otherwise, no name-based
13244 filtering is performed.
13246 EXCEPTIONS is a vector of exceptions to which matching exceptions
13250 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
13252 struct objfile
*objfile
;
13253 struct compunit_symtab
*s
;
13255 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
, NULL
,
13256 VARIABLES_DOMAIN
, preg
);
13258 ALL_COMPUNITS (objfile
, s
)
13260 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13263 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13265 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13266 struct block_iterator iter
;
13267 struct symbol
*sym
;
13269 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13270 if (ada_is_non_standard_exception_sym (sym
)
13272 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
13275 struct ada_exc_info info
13276 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13278 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13284 /* Implements ada_exceptions_list with the regular expression passed
13285 as a regex_t, rather than a string.
13287 If not NULL, PREG is used to filter out exceptions whose names
13288 do not match. Otherwise, all exceptions are listed. */
13290 static VEC(ada_exc_info
) *
13291 ada_exceptions_list_1 (regex_t
*preg
)
13293 VEC(ada_exc_info
) *result
= NULL
;
13294 struct cleanup
*old_chain
13295 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13298 /* First, list the known standard exceptions. These exceptions
13299 need to be handled separately, as they are usually defined in
13300 runtime units that have been compiled without debugging info. */
13302 ada_add_standard_exceptions (preg
, &result
);
13304 /* Next, find all exceptions whose scope is local and accessible
13305 from the currently selected frame. */
13307 if (has_stack_frames ())
13309 prev_len
= VEC_length (ada_exc_info
, result
);
13310 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13312 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13313 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13316 /* Add all exceptions whose scope is global. */
13318 prev_len
= VEC_length (ada_exc_info
, result
);
13319 ada_add_global_exceptions (preg
, &result
);
13320 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13321 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13323 discard_cleanups (old_chain
);
13327 /* Return a vector of ada_exc_info.
13329 If REGEXP is NULL, all exceptions are included in the result.
13330 Otherwise, it should contain a valid regular expression,
13331 and only the exceptions whose names match that regular expression
13332 are included in the result.
13334 The exceptions are sorted in the following order:
13335 - Standard exceptions (defined by the Ada language), in
13336 alphabetical order;
13337 - Exceptions only visible from the current frame, in
13338 alphabetical order;
13339 - Exceptions whose scope is global, in alphabetical order. */
13341 VEC(ada_exc_info
) *
13342 ada_exceptions_list (const char *regexp
)
13344 VEC(ada_exc_info
) *result
= NULL
;
13345 struct cleanup
*old_chain
= NULL
;
13348 if (regexp
!= NULL
)
13349 old_chain
= compile_rx_or_error (®
, regexp
,
13350 _("invalid regular expression"));
13352 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
13354 if (old_chain
!= NULL
)
13355 do_cleanups (old_chain
);
13359 /* Implement the "info exceptions" command. */
13362 info_exceptions_command (char *regexp
, int from_tty
)
13364 VEC(ada_exc_info
) *exceptions
;
13365 struct cleanup
*cleanup
;
13366 struct gdbarch
*gdbarch
= get_current_arch ();
13368 struct ada_exc_info
*info
;
13370 exceptions
= ada_exceptions_list (regexp
);
13371 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13373 if (regexp
!= NULL
)
13375 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13377 printf_filtered (_("All defined Ada exceptions:\n"));
13379 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13380 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13382 do_cleanups (cleanup
);
13386 /* Information about operators given special treatment in functions
13388 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13390 #define ADA_OPERATORS \
13391 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13392 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13393 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13394 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13395 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13396 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13397 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13398 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13399 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13400 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13401 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13402 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13403 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13404 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13405 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13406 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13407 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13408 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13409 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13412 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13415 switch (exp
->elts
[pc
- 1].opcode
)
13418 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13421 #define OP_DEFN(op, len, args, binop) \
13422 case op: *oplenp = len; *argsp = args; break;
13428 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13433 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13438 /* Implementation of the exp_descriptor method operator_check. */
13441 ada_operator_check (struct expression
*exp
, int pos
,
13442 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13445 const union exp_element
*const elts
= exp
->elts
;
13446 struct type
*type
= NULL
;
13448 switch (elts
[pos
].opcode
)
13450 case UNOP_IN_RANGE
:
13452 type
= elts
[pos
+ 1].type
;
13456 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13459 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13461 if (type
&& TYPE_OBJFILE (type
)
13462 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13469 ada_op_name (enum exp_opcode opcode
)
13474 return op_name_standard (opcode
);
13476 #define OP_DEFN(op, len, args, binop) case op: return #op;
13481 return "OP_AGGREGATE";
13483 return "OP_CHOICES";
13489 /* As for operator_length, but assumes PC is pointing at the first
13490 element of the operator, and gives meaningful results only for the
13491 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13494 ada_forward_operator_length (struct expression
*exp
, int pc
,
13495 int *oplenp
, int *argsp
)
13497 switch (exp
->elts
[pc
].opcode
)
13500 *oplenp
= *argsp
= 0;
13503 #define OP_DEFN(op, len, args, binop) \
13504 case op: *oplenp = len; *argsp = args; break;
13510 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13515 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13521 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13523 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13531 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13533 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13538 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13542 /* Ada attributes ('Foo). */
13545 case OP_ATR_LENGTH
:
13549 case OP_ATR_MODULUS
:
13556 case UNOP_IN_RANGE
:
13558 /* XXX: gdb_sprint_host_address, type_sprint */
13559 fprintf_filtered (stream
, _("Type @"));
13560 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13561 fprintf_filtered (stream
, " (");
13562 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13563 fprintf_filtered (stream
, ")");
13565 case BINOP_IN_BOUNDS
:
13566 fprintf_filtered (stream
, " (%d)",
13567 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13569 case TERNOP_IN_RANGE
:
13574 case OP_DISCRETE_RANGE
:
13575 case OP_POSITIONAL
:
13582 char *name
= &exp
->elts
[elt
+ 2].string
;
13583 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13585 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13590 return dump_subexp_body_standard (exp
, stream
, elt
);
13594 for (i
= 0; i
< nargs
; i
+= 1)
13595 elt
= dump_subexp (exp
, stream
, elt
);
13600 /* The Ada extension of print_subexp (q.v.). */
13603 ada_print_subexp (struct expression
*exp
, int *pos
,
13604 struct ui_file
*stream
, enum precedence prec
)
13606 int oplen
, nargs
, i
;
13608 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13610 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13617 print_subexp_standard (exp
, pos
, stream
, prec
);
13621 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13624 case BINOP_IN_BOUNDS
:
13625 /* XXX: sprint_subexp */
13626 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13627 fputs_filtered (" in ", stream
);
13628 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13629 fputs_filtered ("'range", stream
);
13630 if (exp
->elts
[pc
+ 1].longconst
> 1)
13631 fprintf_filtered (stream
, "(%ld)",
13632 (long) exp
->elts
[pc
+ 1].longconst
);
13635 case TERNOP_IN_RANGE
:
13636 if (prec
>= PREC_EQUAL
)
13637 fputs_filtered ("(", stream
);
13638 /* XXX: sprint_subexp */
13639 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13640 fputs_filtered (" in ", stream
);
13641 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13642 fputs_filtered (" .. ", stream
);
13643 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13644 if (prec
>= PREC_EQUAL
)
13645 fputs_filtered (")", stream
);
13650 case OP_ATR_LENGTH
:
13654 case OP_ATR_MODULUS
:
13659 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13661 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13662 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13663 &type_print_raw_options
);
13667 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13668 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13673 for (tem
= 1; tem
< nargs
; tem
+= 1)
13675 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13676 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13678 fputs_filtered (")", stream
);
13683 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13684 fputs_filtered ("'(", stream
);
13685 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13686 fputs_filtered (")", stream
);
13689 case UNOP_IN_RANGE
:
13690 /* XXX: sprint_subexp */
13691 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13692 fputs_filtered (" in ", stream
);
13693 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13694 &type_print_raw_options
);
13697 case OP_DISCRETE_RANGE
:
13698 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13699 fputs_filtered ("..", stream
);
13700 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13704 fputs_filtered ("others => ", stream
);
13705 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13709 for (i
= 0; i
< nargs
-1; i
+= 1)
13712 fputs_filtered ("|", stream
);
13713 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13715 fputs_filtered (" => ", stream
);
13716 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13719 case OP_POSITIONAL
:
13720 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13724 fputs_filtered ("(", stream
);
13725 for (i
= 0; i
< nargs
; i
+= 1)
13728 fputs_filtered (", ", stream
);
13729 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13731 fputs_filtered (")", stream
);
13736 /* Table mapping opcodes into strings for printing operators
13737 and precedences of the operators. */
13739 static const struct op_print ada_op_print_tab
[] = {
13740 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13741 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13742 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13743 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13744 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13745 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13746 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13747 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13748 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13749 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13750 {">", BINOP_GTR
, PREC_ORDER
, 0},
13751 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13752 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13753 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13754 {"+", BINOP_ADD
, PREC_ADD
, 0},
13755 {"-", BINOP_SUB
, PREC_ADD
, 0},
13756 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13757 {"*", BINOP_MUL
, PREC_MUL
, 0},
13758 {"/", BINOP_DIV
, PREC_MUL
, 0},
13759 {"rem", BINOP_REM
, PREC_MUL
, 0},
13760 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13761 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13762 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13763 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13764 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13765 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13766 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13767 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13768 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13769 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13770 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13771 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13774 enum ada_primitive_types
{
13775 ada_primitive_type_int
,
13776 ada_primitive_type_long
,
13777 ada_primitive_type_short
,
13778 ada_primitive_type_char
,
13779 ada_primitive_type_float
,
13780 ada_primitive_type_double
,
13781 ada_primitive_type_void
,
13782 ada_primitive_type_long_long
,
13783 ada_primitive_type_long_double
,
13784 ada_primitive_type_natural
,
13785 ada_primitive_type_positive
,
13786 ada_primitive_type_system_address
,
13787 nr_ada_primitive_types
13791 ada_language_arch_info (struct gdbarch
*gdbarch
,
13792 struct language_arch_info
*lai
)
13794 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13796 lai
->primitive_type_vector
13797 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13800 lai
->primitive_type_vector
[ada_primitive_type_int
]
13801 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13803 lai
->primitive_type_vector
[ada_primitive_type_long
]
13804 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13805 0, "long_integer");
13806 lai
->primitive_type_vector
[ada_primitive_type_short
]
13807 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13808 0, "short_integer");
13809 lai
->string_char_type
13810 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13811 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13812 lai
->primitive_type_vector
[ada_primitive_type_float
]
13813 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13815 lai
->primitive_type_vector
[ada_primitive_type_double
]
13816 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13817 "long_float", NULL
);
13818 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13819 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13820 0, "long_long_integer");
13821 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13822 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13823 "long_long_float", NULL
);
13824 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13825 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13827 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13828 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13830 lai
->primitive_type_vector
[ada_primitive_type_void
]
13831 = builtin
->builtin_void
;
13833 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13834 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13835 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13836 = "system__address";
13838 lai
->bool_type_symbol
= NULL
;
13839 lai
->bool_type_default
= builtin
->builtin_bool
;
13842 /* Language vector */
13844 /* Not really used, but needed in the ada_language_defn. */
13847 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13849 ada_emit_char (c
, type
, stream
, quoter
, 1);
13853 parse (struct parser_state
*ps
)
13855 warnings_issued
= 0;
13856 return ada_parse (ps
);
13859 static const struct exp_descriptor ada_exp_descriptor
= {
13861 ada_operator_length
,
13862 ada_operator_check
,
13864 ada_dump_subexp_body
,
13865 ada_evaluate_subexp
13868 /* Implement the "la_get_symbol_name_cmp" language_defn method
13871 static symbol_name_cmp_ftype
13872 ada_get_symbol_name_cmp (const char *lookup_name
)
13874 if (should_use_wild_match (lookup_name
))
13877 return compare_names
;
13880 /* Implement the "la_read_var_value" language_defn method for Ada. */
13882 static struct value
*
13883 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
13884 struct frame_info
*frame
)
13886 const struct block
*frame_block
= NULL
;
13887 struct symbol
*renaming_sym
= NULL
;
13889 /* The only case where default_read_var_value is not sufficient
13890 is when VAR is a renaming... */
13892 frame_block
= get_frame_block (frame
, NULL
);
13894 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13895 if (renaming_sym
!= NULL
)
13896 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13898 /* This is a typical case where we expect the default_read_var_value
13899 function to work. */
13900 return default_read_var_value (var
, var_block
, frame
);
13903 const struct language_defn ada_language_defn
= {
13904 "ada", /* Language name */
13908 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13909 that's not quite what this means. */
13911 macro_expansion_no
,
13912 &ada_exp_descriptor
,
13916 ada_printchar
, /* Print a character constant */
13917 ada_printstr
, /* Function to print string constant */
13918 emit_char
, /* Function to print single char (not used) */
13919 ada_print_type
, /* Print a type using appropriate syntax */
13920 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13921 ada_val_print
, /* Print a value using appropriate syntax */
13922 ada_value_print
, /* Print a top-level value */
13923 ada_read_var_value
, /* la_read_var_value */
13924 NULL
, /* Language specific skip_trampoline */
13925 NULL
, /* name_of_this */
13926 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13927 basic_lookup_transparent_type
, /* lookup_transparent_type */
13928 ada_la_decode
, /* Language specific symbol demangler */
13929 NULL
, /* Language specific
13930 class_name_from_physname */
13931 ada_op_print_tab
, /* expression operators for printing */
13932 0, /* c-style arrays */
13933 1, /* String lower bound */
13934 ada_get_gdb_completer_word_break_characters
,
13935 ada_make_symbol_completion_list
,
13936 ada_language_arch_info
,
13937 ada_print_array_index
,
13938 default_pass_by_reference
,
13940 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13941 ada_iterate_over_symbols
,
13948 /* Provide a prototype to silence -Wmissing-prototypes. */
13949 extern initialize_file_ftype _initialize_ada_language
;
13951 /* Command-list for the "set/show ada" prefix command. */
13952 static struct cmd_list_element
*set_ada_list
;
13953 static struct cmd_list_element
*show_ada_list
;
13955 /* Implement the "set ada" prefix command. */
13958 set_ada_command (char *arg
, int from_tty
)
13960 printf_unfiltered (_(\
13961 "\"set ada\" must be followed by the name of a setting.\n"));
13962 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13965 /* Implement the "show ada" prefix command. */
13968 show_ada_command (char *args
, int from_tty
)
13970 cmd_show_list (show_ada_list
, from_tty
, "");
13974 initialize_ada_catchpoint_ops (void)
13976 struct breakpoint_ops
*ops
;
13978 initialize_breakpoint_ops ();
13980 ops
= &catch_exception_breakpoint_ops
;
13981 *ops
= bkpt_breakpoint_ops
;
13982 ops
->dtor
= dtor_catch_exception
;
13983 ops
->allocate_location
= allocate_location_catch_exception
;
13984 ops
->re_set
= re_set_catch_exception
;
13985 ops
->check_status
= check_status_catch_exception
;
13986 ops
->print_it
= print_it_catch_exception
;
13987 ops
->print_one
= print_one_catch_exception
;
13988 ops
->print_mention
= print_mention_catch_exception
;
13989 ops
->print_recreate
= print_recreate_catch_exception
;
13991 ops
= &catch_exception_unhandled_breakpoint_ops
;
13992 *ops
= bkpt_breakpoint_ops
;
13993 ops
->dtor
= dtor_catch_exception_unhandled
;
13994 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13995 ops
->re_set
= re_set_catch_exception_unhandled
;
13996 ops
->check_status
= check_status_catch_exception_unhandled
;
13997 ops
->print_it
= print_it_catch_exception_unhandled
;
13998 ops
->print_one
= print_one_catch_exception_unhandled
;
13999 ops
->print_mention
= print_mention_catch_exception_unhandled
;
14000 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
14002 ops
= &catch_assert_breakpoint_ops
;
14003 *ops
= bkpt_breakpoint_ops
;
14004 ops
->dtor
= dtor_catch_assert
;
14005 ops
->allocate_location
= allocate_location_catch_assert
;
14006 ops
->re_set
= re_set_catch_assert
;
14007 ops
->check_status
= check_status_catch_assert
;
14008 ops
->print_it
= print_it_catch_assert
;
14009 ops
->print_one
= print_one_catch_assert
;
14010 ops
->print_mention
= print_mention_catch_assert
;
14011 ops
->print_recreate
= print_recreate_catch_assert
;
14014 /* This module's 'new_objfile' observer. */
14017 ada_new_objfile_observer (struct objfile
*objfile
)
14019 ada_clear_symbol_cache ();
14022 /* This module's 'free_objfile' observer. */
14025 ada_free_objfile_observer (struct objfile
*objfile
)
14027 ada_clear_symbol_cache ();
14031 _initialize_ada_language (void)
14033 add_language (&ada_language_defn
);
14035 initialize_ada_catchpoint_ops ();
14037 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14038 _("Prefix command for changing Ada-specfic settings"),
14039 &set_ada_list
, "set ada ", 0, &setlist
);
14041 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14042 _("Generic command for showing Ada-specific settings."),
14043 &show_ada_list
, "show ada ", 0, &showlist
);
14045 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14046 &trust_pad_over_xvs
, _("\
14047 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14048 Show whether an optimization trusting PAD types over XVS types is activated"),
14050 This is related to the encoding used by the GNAT compiler. The debugger\n\
14051 should normally trust the contents of PAD types, but certain older versions\n\
14052 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14053 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14054 work around this bug. It is always safe to turn this option \"off\", but\n\
14055 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14056 this option to \"off\" unless necessary."),
14057 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14059 add_catch_command ("exception", _("\
14060 Catch Ada exceptions, when raised.\n\
14061 With an argument, catch only exceptions with the given name."),
14062 catch_ada_exception_command
,
14066 add_catch_command ("assert", _("\
14067 Catch failed Ada assertions, when raised.\n\
14068 With an argument, catch only exceptions with the given name."),
14069 catch_assert_command
,
14074 varsize_limit
= 65536;
14076 add_info ("exceptions", info_exceptions_command
,
14078 List all Ada exception names.\n\
14079 If a regular expression is passed as an argument, only those matching\n\
14080 the regular expression are listed."));
14082 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14083 _("Set Ada maintenance-related variables."),
14084 &maint_set_ada_cmdlist
, "maintenance set ada ",
14085 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14087 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14088 _("Show Ada maintenance-related variables"),
14089 &maint_show_ada_cmdlist
, "maintenance show ada ",
14090 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14092 add_setshow_boolean_cmd
14093 ("ignore-descriptive-types", class_maintenance
,
14094 &ada_ignore_descriptive_types_p
,
14095 _("Set whether descriptive types generated by GNAT should be ignored."),
14096 _("Show whether descriptive types generated by GNAT should be ignored."),
14098 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14099 DWARF attribute."),
14100 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14102 obstack_init (&symbol_list_obstack
);
14104 decoded_names_store
= htab_create_alloc
14105 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
14106 NULL
, xcalloc
, xfree
);
14108 /* The ada-lang observers. */
14109 observer_attach_new_objfile (ada_new_objfile_observer
);
14110 observer_attach_free_objfile (ada_free_objfile_observer
);
14111 observer_attach_inferior_exit (ada_inferior_exit
);
14113 /* Setup various context-specific data. */
14115 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
14116 ada_pspace_data_handle
14117 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);