1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2017 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"
63 #include "common/function-view.h"
64 #include "common/byte-vector.h"
66 /* Define whether or not the C operator '/' truncates towards zero for
67 differently signed operands (truncation direction is undefined in C).
68 Copied from valarith.c. */
70 #ifndef TRUNCATION_TOWARDS_ZERO
71 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
74 static struct type
*desc_base_type (struct type
*);
76 static struct type
*desc_bounds_type (struct type
*);
78 static struct value
*desc_bounds (struct value
*);
80 static int fat_pntr_bounds_bitpos (struct type
*);
82 static int fat_pntr_bounds_bitsize (struct type
*);
84 static struct type
*desc_data_target_type (struct type
*);
86 static struct value
*desc_data (struct value
*);
88 static int fat_pntr_data_bitpos (struct type
*);
90 static int fat_pntr_data_bitsize (struct type
*);
92 static struct value
*desc_one_bound (struct value
*, int, int);
94 static int desc_bound_bitpos (struct type
*, int, int);
96 static int desc_bound_bitsize (struct type
*, int, int);
98 static struct type
*desc_index_type (struct type
*, int);
100 static int desc_arity (struct type
*);
102 static int ada_type_match (struct type
*, struct type
*, int);
104 static int ada_args_match (struct symbol
*, struct value
**, int);
106 static int full_match (const char *, const char *);
108 static struct value
*make_array_descriptor (struct type
*, struct value
*);
110 static void ada_add_block_symbols (struct obstack
*,
111 const struct block
*, const char *,
112 domain_enum
, struct objfile
*, int);
114 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
115 const char *, domain_enum
, int, int *);
117 static int is_nonfunction (struct block_symbol
*, int);
119 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
120 const struct block
*);
122 static int num_defns_collected (struct obstack
*);
124 static struct block_symbol
*defns_collected (struct obstack
*, int);
126 static struct value
*resolve_subexp (struct expression
**, int *, int,
129 static void replace_operator_with_call (struct expression
**, int, int, int,
130 struct symbol
*, const struct block
*);
132 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
134 static const char *ada_op_name (enum exp_opcode
);
136 static const char *ada_decoded_op_name (enum exp_opcode
);
138 static int numeric_type_p (struct type
*);
140 static int integer_type_p (struct type
*);
142 static int scalar_type_p (struct type
*);
144 static int discrete_type_p (struct type
*);
146 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
151 static struct symbol
*find_old_style_renaming_symbol (const char *,
152 const struct block
*);
154 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
157 static struct value
*evaluate_subexp_type (struct expression
*, int *);
159 static struct type
*ada_find_parallel_type_with_name (struct type
*,
162 static int is_dynamic_field (struct type
*, int);
164 static struct type
*to_fixed_variant_branch_type (struct type
*,
166 CORE_ADDR
, struct value
*);
168 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
170 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
172 static struct type
*to_static_fixed_type (struct type
*);
173 static struct type
*static_unwrap_type (struct type
*type
);
175 static struct value
*unwrap_value (struct value
*);
177 static struct type
*constrained_packed_array_type (struct type
*, long *);
179 static struct type
*decode_constrained_packed_array_type (struct type
*);
181 static long decode_packed_array_bitsize (struct type
*);
183 static struct value
*decode_constrained_packed_array (struct value
*);
185 static int ada_is_packed_array_type (struct type
*);
187 static int ada_is_unconstrained_packed_array_type (struct type
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
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 static const char ada_completer_word_break_characters
[] =
319 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
321 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
324 /* The name of the symbol to use to get the name of the main subprogram. */
325 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
326 = "__gnat_ada_main_program_name";
328 /* Limit on the number of warnings to raise per expression evaluation. */
329 static int warning_limit
= 2;
331 /* Number of warning messages issued; reset to 0 by cleanups after
332 expression evaluation. */
333 static int warnings_issued
= 0;
335 static const char *known_runtime_file_name_patterns
[] = {
336 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
339 static const char *known_auxiliary_function_name_patterns
[] = {
340 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
343 /* Space for allocating results of ada_lookup_symbol_list. */
344 static struct obstack symbol_list_obstack
;
346 /* Maintenance-related settings for this module. */
348 static struct cmd_list_element
*maint_set_ada_cmdlist
;
349 static struct cmd_list_element
*maint_show_ada_cmdlist
;
351 /* Implement the "maintenance set ada" (prefix) command. */
354 maint_set_ada_cmd (char *args
, int from_tty
)
356 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
360 /* Implement the "maintenance show ada" (prefix) command. */
363 maint_show_ada_cmd (char *args
, int from_tty
)
365 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
368 /* The "maintenance ada set/show ignore-descriptive-type" value. */
370 static int ada_ignore_descriptive_types_p
= 0;
372 /* Inferior-specific data. */
374 /* Per-inferior data for this module. */
376 struct ada_inferior_data
378 /* The ada__tags__type_specific_data type, which is used when decoding
379 tagged types. With older versions of GNAT, this type was directly
380 accessible through a component ("tsd") in the object tag. But this
381 is no longer the case, so we cache it for each inferior. */
382 struct type
*tsd_type
;
384 /* The exception_support_info data. This data is used to determine
385 how to implement support for Ada exception catchpoints in a given
387 const struct exception_support_info
*exception_info
;
390 /* Our key to this module's inferior data. */
391 static const struct inferior_data
*ada_inferior_data
;
393 /* A cleanup routine for our inferior data. */
395 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
397 struct ada_inferior_data
*data
;
399 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
404 /* Return our inferior data for the given inferior (INF).
406 This function always returns a valid pointer to an allocated
407 ada_inferior_data structure. If INF's inferior data has not
408 been previously set, this functions creates a new one with all
409 fields set to zero, sets INF's inferior to it, and then returns
410 a pointer to that newly allocated ada_inferior_data. */
412 static struct ada_inferior_data
*
413 get_ada_inferior_data (struct inferior
*inf
)
415 struct ada_inferior_data
*data
;
417 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
420 data
= XCNEW (struct ada_inferior_data
);
421 set_inferior_data (inf
, ada_inferior_data
, data
);
427 /* Perform all necessary cleanups regarding our module's inferior data
428 that is required after the inferior INF just exited. */
431 ada_inferior_exit (struct inferior
*inf
)
433 ada_inferior_data_cleanup (inf
, NULL
);
434 set_inferior_data (inf
, ada_inferior_data
, NULL
);
438 /* program-space-specific data. */
440 /* This module's per-program-space data. */
441 struct ada_pspace_data
443 /* The Ada symbol cache. */
444 struct ada_symbol_cache
*sym_cache
;
447 /* Key to our per-program-space data. */
448 static const struct program_space_data
*ada_pspace_data_handle
;
450 /* Return this module's data for the given program space (PSPACE).
451 If not is found, add a zero'ed one now.
453 This function always returns a valid object. */
455 static struct ada_pspace_data
*
456 get_ada_pspace_data (struct program_space
*pspace
)
458 struct ada_pspace_data
*data
;
460 data
= ((struct ada_pspace_data
*)
461 program_space_data (pspace
, ada_pspace_data_handle
));
464 data
= XCNEW (struct ada_pspace_data
);
465 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
471 /* The cleanup callback for this module's per-program-space data. */
474 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
476 struct ada_pspace_data
*pspace_data
= (struct ada_pspace_data
*) data
;
478 if (pspace_data
->sym_cache
!= NULL
)
479 ada_free_symbol_cache (pspace_data
->sym_cache
);
485 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
486 all typedef layers have been peeled. Otherwise, return TYPE.
488 Normally, we really expect a typedef type to only have 1 typedef layer.
489 In other words, we really expect the target type of a typedef type to be
490 a non-typedef type. This is particularly true for Ada units, because
491 the language does not have a typedef vs not-typedef distinction.
492 In that respect, the Ada compiler has been trying to eliminate as many
493 typedef definitions in the debugging information, since they generally
494 do not bring any extra information (we still use typedef under certain
495 circumstances related mostly to the GNAT encoding).
497 Unfortunately, we have seen situations where the debugging information
498 generated by the compiler leads to such multiple typedef layers. For
499 instance, consider the following example with stabs:
501 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
502 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
504 This is an error in the debugging information which causes type
505 pck__float_array___XUP to be defined twice, and the second time,
506 it is defined as a typedef of a typedef.
508 This is on the fringe of legality as far as debugging information is
509 concerned, and certainly unexpected. But it is easy to handle these
510 situations correctly, so we can afford to be lenient in this case. */
513 ada_typedef_target_type (struct type
*type
)
515 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
516 type
= TYPE_TARGET_TYPE (type
);
520 /* Given DECODED_NAME a string holding a symbol name in its
521 decoded form (ie using the Ada dotted notation), returns
522 its unqualified name. */
525 ada_unqualified_name (const char *decoded_name
)
529 /* If the decoded name starts with '<', it means that the encoded
530 name does not follow standard naming conventions, and thus that
531 it is not your typical Ada symbol name. Trying to unqualify it
532 is therefore pointless and possibly erroneous. */
533 if (decoded_name
[0] == '<')
536 result
= strrchr (decoded_name
, '.');
538 result
++; /* Skip the dot... */
540 result
= decoded_name
;
545 /* Return a string starting with '<', followed by STR, and '>'.
546 The result is good until the next call. */
549 add_angle_brackets (const char *str
)
551 static char *result
= NULL
;
554 result
= xstrprintf ("<%s>", str
);
559 ada_get_gdb_completer_word_break_characters (void)
561 return ada_completer_word_break_characters
;
564 /* Print an array element index using the Ada syntax. */
567 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
568 const struct value_print_options
*options
)
570 LA_VALUE_PRINT (index_value
, stream
, options
);
571 fprintf_filtered (stream
, " => ");
574 /* Assuming VECT points to an array of *SIZE objects of size
575 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
576 updating *SIZE as necessary and returning the (new) array. */
579 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
581 if (*size
< min_size
)
584 if (*size
< min_size
)
586 vect
= xrealloc (vect
, *size
* element_size
);
591 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
592 suffix of FIELD_NAME beginning "___". */
595 field_name_match (const char *field_name
, const char *target
)
597 int len
= strlen (target
);
600 (strncmp (field_name
, target
, len
) == 0
601 && (field_name
[len
] == '\0'
602 || (startswith (field_name
+ len
, "___")
603 && strcmp (field_name
+ strlen (field_name
) - 6,
608 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
609 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
610 and return its index. This function also handles fields whose name
611 have ___ suffixes because the compiler sometimes alters their name
612 by adding such a suffix to represent fields with certain constraints.
613 If the field could not be found, return a negative number if
614 MAYBE_MISSING is set. Otherwise raise an error. */
617 ada_get_field_index (const struct type
*type
, const char *field_name
,
621 struct type
*struct_type
= check_typedef ((struct type
*) type
);
623 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
624 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
628 error (_("Unable to find field %s in struct %s. Aborting"),
629 field_name
, TYPE_NAME (struct_type
));
634 /* The length of the prefix of NAME prior to any "___" suffix. */
637 ada_name_prefix_len (const char *name
)
643 const char *p
= strstr (name
, "___");
646 return strlen (name
);
652 /* Return non-zero if SUFFIX is a suffix of STR.
653 Return zero if STR is null. */
656 is_suffix (const char *str
, const char *suffix
)
663 len2
= strlen (suffix
);
664 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
667 /* The contents of value VAL, treated as a value of type TYPE. The
668 result is an lval in memory if VAL is. */
670 static struct value
*
671 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
673 type
= ada_check_typedef (type
);
674 if (value_type (val
) == type
)
678 struct value
*result
;
680 /* Make sure that the object size is not unreasonable before
681 trying to allocate some memory for it. */
682 ada_ensure_varsize_limit (type
);
685 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
686 result
= allocate_value_lazy (type
);
689 result
= allocate_value (type
);
690 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
692 set_value_component_location (result
, val
);
693 set_value_bitsize (result
, value_bitsize (val
));
694 set_value_bitpos (result
, value_bitpos (val
));
695 set_value_address (result
, value_address (val
));
700 static const gdb_byte
*
701 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
706 return valaddr
+ offset
;
710 cond_offset_target (CORE_ADDR address
, long offset
)
715 return address
+ offset
;
718 /* Issue a warning (as for the definition of warning in utils.c, but
719 with exactly one argument rather than ...), unless the limit on the
720 number of warnings has passed during the evaluation of the current
723 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
724 provided by "complaint". */
725 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
728 lim_warning (const char *format
, ...)
732 va_start (args
, format
);
733 warnings_issued
+= 1;
734 if (warnings_issued
<= warning_limit
)
735 vwarning (format
, args
);
740 /* Issue an error if the size of an object of type T is unreasonable,
741 i.e. if it would be a bad idea to allocate a value of this type in
745 ada_ensure_varsize_limit (const struct type
*type
)
747 if (TYPE_LENGTH (type
) > varsize_limit
)
748 error (_("object size is larger than varsize-limit"));
751 /* Maximum value of a SIZE-byte signed integer type. */
753 max_of_size (int size
)
755 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
757 return top_bit
| (top_bit
- 1);
760 /* Minimum value of a SIZE-byte signed integer type. */
762 min_of_size (int size
)
764 return -max_of_size (size
) - 1;
767 /* Maximum value of a SIZE-byte unsigned integer type. */
769 umax_of_size (int size
)
771 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
773 return top_bit
| (top_bit
- 1);
776 /* Maximum value of integral type T, as a signed quantity. */
778 max_of_type (struct type
*t
)
780 if (TYPE_UNSIGNED (t
))
781 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
783 return max_of_size (TYPE_LENGTH (t
));
786 /* Minimum value of integral type T, as a signed quantity. */
788 min_of_type (struct type
*t
)
790 if (TYPE_UNSIGNED (t
))
793 return min_of_size (TYPE_LENGTH (t
));
796 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
798 ada_discrete_type_high_bound (struct type
*type
)
800 type
= resolve_dynamic_type (type
, NULL
, 0);
801 switch (TYPE_CODE (type
))
803 case TYPE_CODE_RANGE
:
804 return TYPE_HIGH_BOUND (type
);
806 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
811 return max_of_type (type
);
813 error (_("Unexpected type in ada_discrete_type_high_bound."));
817 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
819 ada_discrete_type_low_bound (struct type
*type
)
821 type
= resolve_dynamic_type (type
, NULL
, 0);
822 switch (TYPE_CODE (type
))
824 case TYPE_CODE_RANGE
:
825 return TYPE_LOW_BOUND (type
);
827 return TYPE_FIELD_ENUMVAL (type
, 0);
832 return min_of_type (type
);
834 error (_("Unexpected type in ada_discrete_type_low_bound."));
838 /* The identity on non-range types. For range types, the underlying
839 non-range scalar type. */
842 get_base_type (struct type
*type
)
844 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
846 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
848 type
= TYPE_TARGET_TYPE (type
);
853 /* Return a decoded version of the given VALUE. This means returning
854 a value whose type is obtained by applying all the GNAT-specific
855 encondings, making the resulting type a static but standard description
856 of the initial type. */
859 ada_get_decoded_value (struct value
*value
)
861 struct type
*type
= ada_check_typedef (value_type (value
));
863 if (ada_is_array_descriptor_type (type
)
864 || (ada_is_constrained_packed_array_type (type
)
865 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
867 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
868 value
= ada_coerce_to_simple_array_ptr (value
);
870 value
= ada_coerce_to_simple_array (value
);
873 value
= ada_to_fixed_value (value
);
878 /* Same as ada_get_decoded_value, but with the given TYPE.
879 Because there is no associated actual value for this type,
880 the resulting type might be a best-effort approximation in
881 the case of dynamic types. */
884 ada_get_decoded_type (struct type
*type
)
886 type
= to_static_fixed_type (type
);
887 if (ada_is_constrained_packed_array_type (type
))
888 type
= ada_coerce_to_simple_array_type (type
);
894 /* Language Selection */
896 /* If the main program is in Ada, return language_ada, otherwise return LANG
897 (the main program is in Ada iif the adainit symbol is found). */
900 ada_update_initial_language (enum language lang
)
902 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
903 (struct objfile
*) NULL
).minsym
!= NULL
)
909 /* If the main procedure is written in Ada, then return its name.
910 The result is good until the next call. Return NULL if the main
911 procedure doesn't appear to be in Ada. */
916 struct bound_minimal_symbol msym
;
917 static char *main_program_name
= NULL
;
919 /* For Ada, the name of the main procedure is stored in a specific
920 string constant, generated by the binder. Look for that symbol,
921 extract its address, and then read that string. If we didn't find
922 that string, then most probably the main procedure is not written
924 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
926 if (msym
.minsym
!= NULL
)
928 CORE_ADDR main_program_name_addr
;
931 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
932 if (main_program_name_addr
== 0)
933 error (_("Invalid address for Ada main program name."));
935 xfree (main_program_name
);
936 target_read_string (main_program_name_addr
, &main_program_name
,
941 return main_program_name
;
944 /* The main procedure doesn't seem to be in Ada. */
950 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
953 const struct ada_opname_map ada_opname_table
[] = {
954 {"Oadd", "\"+\"", BINOP_ADD
},
955 {"Osubtract", "\"-\"", BINOP_SUB
},
956 {"Omultiply", "\"*\"", BINOP_MUL
},
957 {"Odivide", "\"/\"", BINOP_DIV
},
958 {"Omod", "\"mod\"", BINOP_MOD
},
959 {"Orem", "\"rem\"", BINOP_REM
},
960 {"Oexpon", "\"**\"", BINOP_EXP
},
961 {"Olt", "\"<\"", BINOP_LESS
},
962 {"Ole", "\"<=\"", BINOP_LEQ
},
963 {"Ogt", "\">\"", BINOP_GTR
},
964 {"Oge", "\">=\"", BINOP_GEQ
},
965 {"Oeq", "\"=\"", BINOP_EQUAL
},
966 {"One", "\"/=\"", BINOP_NOTEQUAL
},
967 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
968 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
969 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
970 {"Oconcat", "\"&\"", BINOP_CONCAT
},
971 {"Oabs", "\"abs\"", UNOP_ABS
},
972 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
973 {"Oadd", "\"+\"", UNOP_PLUS
},
974 {"Osubtract", "\"-\"", UNOP_NEG
},
978 /* The "encoded" form of DECODED, according to GNAT conventions.
979 The result is valid until the next call to ada_encode. */
982 ada_encode (const char *decoded
)
984 static char *encoding_buffer
= NULL
;
985 static size_t encoding_buffer_size
= 0;
992 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
993 2 * strlen (decoded
) + 10);
996 for (p
= decoded
; *p
!= '\0'; p
+= 1)
1000 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
1005 const struct ada_opname_map
*mapping
;
1007 for (mapping
= ada_opname_table
;
1008 mapping
->encoded
!= NULL
1009 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
1011 if (mapping
->encoded
== NULL
)
1012 error (_("invalid Ada operator name: %s"), p
);
1013 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1014 k
+= strlen (mapping
->encoded
);
1019 encoding_buffer
[k
] = *p
;
1024 encoding_buffer
[k
] = '\0';
1025 return encoding_buffer
;
1028 /* Return NAME folded to lower case, or, if surrounded by single
1029 quotes, unfolded, but with the quotes stripped away. Result good
1033 ada_fold_name (const char *name
)
1035 static char *fold_buffer
= NULL
;
1036 static size_t fold_buffer_size
= 0;
1038 int len
= strlen (name
);
1039 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1041 if (name
[0] == '\'')
1043 strncpy (fold_buffer
, name
+ 1, len
- 2);
1044 fold_buffer
[len
- 2] = '\000';
1050 for (i
= 0; i
<= len
; i
+= 1)
1051 fold_buffer
[i
] = tolower (name
[i
]);
1057 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1060 is_lower_alphanum (const char c
)
1062 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1065 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1066 This function saves in LEN the length of that same symbol name but
1067 without either of these suffixes:
1073 These are suffixes introduced by the compiler for entities such as
1074 nested subprogram for instance, in order to avoid name clashes.
1075 They do not serve any purpose for the debugger. */
1078 ada_remove_trailing_digits (const char *encoded
, int *len
)
1080 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1084 while (i
> 0 && isdigit (encoded
[i
]))
1086 if (i
>= 0 && encoded
[i
] == '.')
1088 else if (i
>= 0 && encoded
[i
] == '$')
1090 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1092 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1097 /* Remove the suffix introduced by the compiler for protected object
1101 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1103 /* Remove trailing N. */
1105 /* Protected entry subprograms are broken into two
1106 separate subprograms: The first one is unprotected, and has
1107 a 'N' suffix; the second is the protected version, and has
1108 the 'P' suffix. The second calls the first one after handling
1109 the protection. Since the P subprograms are internally generated,
1110 we leave these names undecoded, giving the user a clue that this
1111 entity is internal. */
1114 && encoded
[*len
- 1] == 'N'
1115 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1119 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1122 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1126 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1129 if (encoded
[i
] != 'X')
1135 if (isalnum (encoded
[i
-1]))
1139 /* If ENCODED follows the GNAT entity encoding conventions, then return
1140 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1141 replaced by ENCODED.
1143 The resulting string is valid until the next call of ada_decode.
1144 If the string is unchanged by decoding, the original string pointer
1148 ada_decode (const char *encoded
)
1155 static char *decoding_buffer
= NULL
;
1156 static size_t decoding_buffer_size
= 0;
1158 /* The name of the Ada main procedure starts with "_ada_".
1159 This prefix is not part of the decoded name, so skip this part
1160 if we see this prefix. */
1161 if (startswith (encoded
, "_ada_"))
1164 /* If the name starts with '_', then it is not a properly encoded
1165 name, so do not attempt to decode it. Similarly, if the name
1166 starts with '<', the name should not be decoded. */
1167 if (encoded
[0] == '_' || encoded
[0] == '<')
1170 len0
= strlen (encoded
);
1172 ada_remove_trailing_digits (encoded
, &len0
);
1173 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1175 /* Remove the ___X.* suffix if present. Do not forget to verify that
1176 the suffix is located before the current "end" of ENCODED. We want
1177 to avoid re-matching parts of ENCODED that have previously been
1178 marked as discarded (by decrementing LEN0). */
1179 p
= strstr (encoded
, "___");
1180 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1188 /* Remove any trailing TKB suffix. It tells us that this symbol
1189 is for the body of a task, but that information does not actually
1190 appear in the decoded name. */
1192 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1195 /* Remove any trailing TB suffix. The TB suffix is slightly different
1196 from the TKB suffix because it is used for non-anonymous task
1199 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1202 /* Remove trailing "B" suffixes. */
1203 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1205 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1208 /* Make decoded big enough for possible expansion by operator name. */
1210 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1211 decoded
= decoding_buffer
;
1213 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1215 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1218 while ((i
>= 0 && isdigit (encoded
[i
]))
1219 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1221 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1223 else if (encoded
[i
] == '$')
1227 /* The first few characters that are not alphabetic are not part
1228 of any encoding we use, so we can copy them over verbatim. */
1230 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1231 decoded
[j
] = encoded
[i
];
1236 /* Is this a symbol function? */
1237 if (at_start_name
&& encoded
[i
] == 'O')
1241 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1243 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1244 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1246 && !isalnum (encoded
[i
+ op_len
]))
1248 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1251 j
+= strlen (ada_opname_table
[k
].decoded
);
1255 if (ada_opname_table
[k
].encoded
!= NULL
)
1260 /* Replace "TK__" with "__", which will eventually be translated
1261 into "." (just below). */
1263 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1266 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1267 be translated into "." (just below). These are internal names
1268 generated for anonymous blocks inside which our symbol is nested. */
1270 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1271 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1272 && isdigit (encoded
[i
+4]))
1276 while (k
< len0
&& isdigit (encoded
[k
]))
1277 k
++; /* Skip any extra digit. */
1279 /* Double-check that the "__B_{DIGITS}+" sequence we found
1280 is indeed followed by "__". */
1281 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1285 /* Remove _E{DIGITS}+[sb] */
1287 /* Just as for protected object subprograms, there are 2 categories
1288 of subprograms created by the compiler for each entry. The first
1289 one implements the actual entry code, and has a suffix following
1290 the convention above; the second one implements the barrier and
1291 uses the same convention as above, except that the 'E' is replaced
1294 Just as above, we do not decode the name of barrier functions
1295 to give the user a clue that the code he is debugging has been
1296 internally generated. */
1298 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1299 && isdigit (encoded
[i
+2]))
1303 while (k
< len0
&& isdigit (encoded
[k
]))
1307 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1310 /* Just as an extra precaution, make sure that if this
1311 suffix is followed by anything else, it is a '_'.
1312 Otherwise, we matched this sequence by accident. */
1314 || (k
< len0
&& encoded
[k
] == '_'))
1319 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1320 the GNAT front-end in protected object subprograms. */
1323 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1325 /* Backtrack a bit up until we reach either the begining of
1326 the encoded name, or "__". Make sure that we only find
1327 digits or lowercase characters. */
1328 const char *ptr
= encoded
+ i
- 1;
1330 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1333 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1337 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1339 /* This is a X[bn]* sequence not separated from the previous
1340 part of the name with a non-alpha-numeric character (in other
1341 words, immediately following an alpha-numeric character), then
1342 verify that it is placed at the end of the encoded name. If
1343 not, then the encoding is not valid and we should abort the
1344 decoding. Otherwise, just skip it, it is used in body-nested
1348 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1352 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1354 /* Replace '__' by '.'. */
1362 /* It's a character part of the decoded name, so just copy it
1364 decoded
[j
] = encoded
[i
];
1369 decoded
[j
] = '\000';
1371 /* Decoded names should never contain any uppercase character.
1372 Double-check this, and abort the decoding if we find one. */
1374 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1375 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1378 if (strcmp (decoded
, encoded
) == 0)
1384 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1385 decoded
= decoding_buffer
;
1386 if (encoded
[0] == '<')
1387 strcpy (decoded
, encoded
);
1389 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1394 /* Table for keeping permanent unique copies of decoded names. Once
1395 allocated, names in this table are never released. While this is a
1396 storage leak, it should not be significant unless there are massive
1397 changes in the set of decoded names in successive versions of a
1398 symbol table loaded during a single session. */
1399 static struct htab
*decoded_names_store
;
1401 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1402 in the language-specific part of GSYMBOL, if it has not been
1403 previously computed. Tries to save the decoded name in the same
1404 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1405 in any case, the decoded symbol has a lifetime at least that of
1407 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1408 const, but nevertheless modified to a semantically equivalent form
1409 when a decoded name is cached in it. */
1412 ada_decode_symbol (const struct general_symbol_info
*arg
)
1414 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1415 const char **resultp
=
1416 &gsymbol
->language_specific
.demangled_name
;
1418 if (!gsymbol
->ada_mangled
)
1420 const char *decoded
= ada_decode (gsymbol
->name
);
1421 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1423 gsymbol
->ada_mangled
= 1;
1425 if (obstack
!= NULL
)
1427 = (const char *) obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1430 /* Sometimes, we can't find a corresponding objfile, in
1431 which case, we put the result on the heap. Since we only
1432 decode when needed, we hope this usually does not cause a
1433 significant memory leak (FIXME). */
1435 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1439 *slot
= xstrdup (decoded
);
1448 ada_la_decode (const char *encoded
, int options
)
1450 return xstrdup (ada_decode (encoded
));
1453 /* Implement la_sniff_from_mangled_name for Ada. */
1456 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1458 const char *demangled
= ada_decode (mangled
);
1462 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
1464 /* Set the gsymbol language to Ada, but still return 0.
1465 Two reasons for that:
1467 1. For Ada, we prefer computing the symbol's decoded name
1468 on the fly rather than pre-compute it, in order to save
1469 memory (Ada projects are typically very large).
1471 2. There are some areas in the definition of the GNAT
1472 encoding where, with a bit of bad luck, we might be able
1473 to decode a non-Ada symbol, generating an incorrect
1474 demangled name (Eg: names ending with "TB" for instance
1475 are identified as task bodies and so stripped from
1476 the decoded name returned).
1478 Returning 1, here, but not setting *DEMANGLED, helps us get a
1479 little bit of the best of both worlds. Because we're last,
1480 we should not affect any of the other languages that were
1481 able to demangle the symbol before us; we get to correctly
1482 tag Ada symbols as such; and even if we incorrectly tagged a
1483 non-Ada symbol, which should be rare, any routing through the
1484 Ada language should be transparent (Ada tries to behave much
1485 like C/C++ with non-Ada symbols). */
1492 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1493 suffixes that encode debugging information or leading _ada_ on
1494 SYM_NAME (see is_name_suffix commentary for the debugging
1495 information that is ignored). If WILD, then NAME need only match a
1496 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1497 either argument is NULL. */
1500 match_name (const char *sym_name
, const char *name
, int wild
)
1502 if (sym_name
== NULL
|| name
== NULL
)
1505 return wild_match (sym_name
, name
) == 0;
1508 int len_name
= strlen (name
);
1510 return (strncmp (sym_name
, name
, len_name
) == 0
1511 && is_name_suffix (sym_name
+ len_name
))
1512 || (startswith (sym_name
, "_ada_")
1513 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1514 && is_name_suffix (sym_name
+ len_name
+ 5));
1521 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1522 generated by the GNAT compiler to describe the index type used
1523 for each dimension of an array, check whether it follows the latest
1524 known encoding. If not, fix it up to conform to the latest encoding.
1525 Otherwise, do nothing. This function also does nothing if
1526 INDEX_DESC_TYPE is NULL.
1528 The GNAT encoding used to describle the array index type evolved a bit.
1529 Initially, the information would be provided through the name of each
1530 field of the structure type only, while the type of these fields was
1531 described as unspecified and irrelevant. The debugger was then expected
1532 to perform a global type lookup using the name of that field in order
1533 to get access to the full index type description. Because these global
1534 lookups can be very expensive, the encoding was later enhanced to make
1535 the global lookup unnecessary by defining the field type as being
1536 the full index type description.
1538 The purpose of this routine is to allow us to support older versions
1539 of the compiler by detecting the use of the older encoding, and by
1540 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1541 we essentially replace each field's meaningless type by the associated
1545 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1549 if (index_desc_type
== NULL
)
1551 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1553 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1554 to check one field only, no need to check them all). If not, return
1557 If our INDEX_DESC_TYPE was generated using the older encoding,
1558 the field type should be a meaningless integer type whose name
1559 is not equal to the field name. */
1560 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1561 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1562 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1565 /* Fixup each field of INDEX_DESC_TYPE. */
1566 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1568 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1569 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1572 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1576 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1578 static const char *bound_name
[] = {
1579 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1580 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1583 /* Maximum number of array dimensions we are prepared to handle. */
1585 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1588 /* The desc_* routines return primitive portions of array descriptors
1591 /* The descriptor or array type, if any, indicated by TYPE; removes
1592 level of indirection, if needed. */
1594 static struct type
*
1595 desc_base_type (struct type
*type
)
1599 type
= ada_check_typedef (type
);
1600 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1601 type
= ada_typedef_target_type (type
);
1604 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1605 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1606 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1611 /* True iff TYPE indicates a "thin" array pointer type. */
1614 is_thin_pntr (struct type
*type
)
1617 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1618 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1621 /* The descriptor type for thin pointer type TYPE. */
1623 static struct type
*
1624 thin_descriptor_type (struct type
*type
)
1626 struct type
*base_type
= desc_base_type (type
);
1628 if (base_type
== NULL
)
1630 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1634 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1636 if (alt_type
== NULL
)
1643 /* A pointer to the array data for thin-pointer value VAL. */
1645 static struct value
*
1646 thin_data_pntr (struct value
*val
)
1648 struct type
*type
= ada_check_typedef (value_type (val
));
1649 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1651 data_type
= lookup_pointer_type (data_type
);
1653 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1654 return value_cast (data_type
, value_copy (val
));
1656 return value_from_longest (data_type
, value_address (val
));
1659 /* True iff TYPE indicates a "thick" array pointer type. */
1662 is_thick_pntr (struct type
*type
)
1664 type
= desc_base_type (type
);
1665 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1666 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1669 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1670 pointer to one, the type of its bounds data; otherwise, NULL. */
1672 static struct type
*
1673 desc_bounds_type (struct type
*type
)
1677 type
= desc_base_type (type
);
1681 else if (is_thin_pntr (type
))
1683 type
= thin_descriptor_type (type
);
1686 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1688 return ada_check_typedef (r
);
1690 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1692 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1694 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1699 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1700 one, a pointer to its bounds data. Otherwise NULL. */
1702 static struct value
*
1703 desc_bounds (struct value
*arr
)
1705 struct type
*type
= ada_check_typedef (value_type (arr
));
1707 if (is_thin_pntr (type
))
1709 struct type
*bounds_type
=
1710 desc_bounds_type (thin_descriptor_type (type
));
1713 if (bounds_type
== NULL
)
1714 error (_("Bad GNAT array descriptor"));
1716 /* NOTE: The following calculation is not really kosher, but
1717 since desc_type is an XVE-encoded type (and shouldn't be),
1718 the correct calculation is a real pain. FIXME (and fix GCC). */
1719 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1720 addr
= value_as_long (arr
);
1722 addr
= value_address (arr
);
1725 value_from_longest (lookup_pointer_type (bounds_type
),
1726 addr
- TYPE_LENGTH (bounds_type
));
1729 else if (is_thick_pntr (type
))
1731 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1732 _("Bad GNAT array descriptor"));
1733 struct type
*p_bounds_type
= value_type (p_bounds
);
1736 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1738 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1740 if (TYPE_STUB (target_type
))
1741 p_bounds
= value_cast (lookup_pointer_type
1742 (ada_check_typedef (target_type
)),
1746 error (_("Bad GNAT array descriptor"));
1754 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1755 position of the field containing the address of the bounds data. */
1758 fat_pntr_bounds_bitpos (struct type
*type
)
1760 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1763 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1764 size of the field containing the address of the bounds data. */
1767 fat_pntr_bounds_bitsize (struct type
*type
)
1769 type
= desc_base_type (type
);
1771 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1772 return TYPE_FIELD_BITSIZE (type
, 1);
1774 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1777 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1778 pointer to one, the type of its array data (a array-with-no-bounds type);
1779 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1782 static struct type
*
1783 desc_data_target_type (struct type
*type
)
1785 type
= desc_base_type (type
);
1787 /* NOTE: The following is bogus; see comment in desc_bounds. */
1788 if (is_thin_pntr (type
))
1789 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1790 else if (is_thick_pntr (type
))
1792 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1795 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1796 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1802 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1805 static struct value
*
1806 desc_data (struct value
*arr
)
1808 struct type
*type
= value_type (arr
);
1810 if (is_thin_pntr (type
))
1811 return thin_data_pntr (arr
);
1812 else if (is_thick_pntr (type
))
1813 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1814 _("Bad GNAT array descriptor"));
1820 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1821 position of the field containing the address of the data. */
1824 fat_pntr_data_bitpos (struct type
*type
)
1826 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1829 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1830 size of the field containing the address of the data. */
1833 fat_pntr_data_bitsize (struct type
*type
)
1835 type
= desc_base_type (type
);
1837 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1838 return TYPE_FIELD_BITSIZE (type
, 0);
1840 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1843 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1844 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1845 bound, if WHICH is 1. The first bound is I=1. */
1847 static struct value
*
1848 desc_one_bound (struct value
*bounds
, int i
, int which
)
1850 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1851 _("Bad GNAT array descriptor bounds"));
1854 /* If BOUNDS is an array-bounds structure type, return the bit position
1855 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1856 bound, if WHICH is 1. The first bound is I=1. */
1859 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1861 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1864 /* If BOUNDS is an array-bounds structure type, return the bit field size
1865 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1866 bound, if WHICH is 1. The first bound is I=1. */
1869 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1871 type
= desc_base_type (type
);
1873 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1874 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1876 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1879 /* If TYPE is the type of an array-bounds structure, the type of its
1880 Ith bound (numbering from 1). Otherwise, NULL. */
1882 static struct type
*
1883 desc_index_type (struct type
*type
, int i
)
1885 type
= desc_base_type (type
);
1887 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1888 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1893 /* The number of index positions in the array-bounds type TYPE.
1894 Return 0 if TYPE is NULL. */
1897 desc_arity (struct type
*type
)
1899 type
= desc_base_type (type
);
1902 return TYPE_NFIELDS (type
) / 2;
1906 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1907 an array descriptor type (representing an unconstrained array
1911 ada_is_direct_array_type (struct type
*type
)
1915 type
= ada_check_typedef (type
);
1916 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1917 || ada_is_array_descriptor_type (type
));
1920 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1924 ada_is_array_type (struct type
*type
)
1927 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1928 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1929 type
= TYPE_TARGET_TYPE (type
);
1930 return ada_is_direct_array_type (type
);
1933 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1936 ada_is_simple_array_type (struct type
*type
)
1940 type
= ada_check_typedef (type
);
1941 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1942 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1943 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1944 == TYPE_CODE_ARRAY
));
1947 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1950 ada_is_array_descriptor_type (struct type
*type
)
1952 struct type
*data_type
= desc_data_target_type (type
);
1956 type
= ada_check_typedef (type
);
1957 return (data_type
!= NULL
1958 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1959 && desc_arity (desc_bounds_type (type
)) > 0);
1962 /* Non-zero iff type is a partially mal-formed GNAT array
1963 descriptor. FIXME: This is to compensate for some problems with
1964 debugging output from GNAT. Re-examine periodically to see if it
1968 ada_is_bogus_array_descriptor (struct type
*type
)
1972 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1973 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1974 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1975 && !ada_is_array_descriptor_type (type
);
1979 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1980 (fat pointer) returns the type of the array data described---specifically,
1981 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1982 in from the descriptor; otherwise, they are left unspecified. If
1983 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1984 returns NULL. The result is simply the type of ARR if ARR is not
1987 ada_type_of_array (struct value
*arr
, int bounds
)
1989 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1990 return decode_constrained_packed_array_type (value_type (arr
));
1992 if (!ada_is_array_descriptor_type (value_type (arr
)))
1993 return value_type (arr
);
1997 struct type
*array_type
=
1998 ada_check_typedef (desc_data_target_type (value_type (arr
)));
2000 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
2001 TYPE_FIELD_BITSIZE (array_type
, 0) =
2002 decode_packed_array_bitsize (value_type (arr
));
2008 struct type
*elt_type
;
2010 struct value
*descriptor
;
2012 elt_type
= ada_array_element_type (value_type (arr
), -1);
2013 arity
= ada_array_arity (value_type (arr
));
2015 if (elt_type
== NULL
|| arity
== 0)
2016 return ada_check_typedef (value_type (arr
));
2018 descriptor
= desc_bounds (arr
);
2019 if (value_as_long (descriptor
) == 0)
2023 struct type
*range_type
= alloc_type_copy (value_type (arr
));
2024 struct type
*array_type
= alloc_type_copy (value_type (arr
));
2025 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
2026 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
2029 create_static_range_type (range_type
, value_type (low
),
2030 longest_to_int (value_as_long (low
)),
2031 longest_to_int (value_as_long (high
)));
2032 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
2034 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
2036 /* We need to store the element packed bitsize, as well as
2037 recompute the array size, because it was previously
2038 computed based on the unpacked element size. */
2039 LONGEST lo
= value_as_long (low
);
2040 LONGEST hi
= value_as_long (high
);
2042 TYPE_FIELD_BITSIZE (elt_type
, 0) =
2043 decode_packed_array_bitsize (value_type (arr
));
2044 /* If the array has no element, then the size is already
2045 zero, and does not need to be recomputed. */
2049 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2051 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2056 return lookup_pointer_type (elt_type
);
2060 /* If ARR does not represent an array, returns ARR unchanged.
2061 Otherwise, returns either a standard GDB array with bounds set
2062 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2063 GDB array. Returns NULL if ARR is a null fat pointer. */
2066 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2068 if (ada_is_array_descriptor_type (value_type (arr
)))
2070 struct type
*arrType
= ada_type_of_array (arr
, 1);
2072 if (arrType
== NULL
)
2074 return value_cast (arrType
, value_copy (desc_data (arr
)));
2076 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2077 return decode_constrained_packed_array (arr
);
2082 /* If ARR does not represent an array, returns ARR unchanged.
2083 Otherwise, returns a standard GDB array describing ARR (which may
2084 be ARR itself if it already is in the proper form). */
2087 ada_coerce_to_simple_array (struct value
*arr
)
2089 if (ada_is_array_descriptor_type (value_type (arr
)))
2091 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2094 error (_("Bounds unavailable for null array pointer."));
2095 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2096 return value_ind (arrVal
);
2098 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2099 return decode_constrained_packed_array (arr
);
2104 /* If TYPE represents a GNAT array type, return it translated to an
2105 ordinary GDB array type (possibly with BITSIZE fields indicating
2106 packing). For other types, is the identity. */
2109 ada_coerce_to_simple_array_type (struct type
*type
)
2111 if (ada_is_constrained_packed_array_type (type
))
2112 return decode_constrained_packed_array_type (type
);
2114 if (ada_is_array_descriptor_type (type
))
2115 return ada_check_typedef (desc_data_target_type (type
));
2120 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2123 ada_is_packed_array_type (struct type
*type
)
2127 type
= desc_base_type (type
);
2128 type
= ada_check_typedef (type
);
2130 ada_type_name (type
) != NULL
2131 && strstr (ada_type_name (type
), "___XP") != NULL
;
2134 /* Non-zero iff TYPE represents a standard GNAT constrained
2135 packed-array type. */
2138 ada_is_constrained_packed_array_type (struct type
*type
)
2140 return ada_is_packed_array_type (type
)
2141 && !ada_is_array_descriptor_type (type
);
2144 /* Non-zero iff TYPE represents an array descriptor for a
2145 unconstrained packed-array type. */
2148 ada_is_unconstrained_packed_array_type (struct type
*type
)
2150 return ada_is_packed_array_type (type
)
2151 && ada_is_array_descriptor_type (type
);
2154 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2155 return the size of its elements in bits. */
2158 decode_packed_array_bitsize (struct type
*type
)
2160 const char *raw_name
;
2164 /* Access to arrays implemented as fat pointers are encoded as a typedef
2165 of the fat pointer type. We need the name of the fat pointer type
2166 to do the decoding, so strip the typedef layer. */
2167 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2168 type
= ada_typedef_target_type (type
);
2170 raw_name
= ada_type_name (ada_check_typedef (type
));
2172 raw_name
= ada_type_name (desc_base_type (type
));
2177 tail
= strstr (raw_name
, "___XP");
2178 gdb_assert (tail
!= NULL
);
2180 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2183 (_("could not understand bit size information on packed array"));
2190 /* Given that TYPE is a standard GDB array type with all bounds filled
2191 in, and that the element size of its ultimate scalar constituents
2192 (that is, either its elements, or, if it is an array of arrays, its
2193 elements' elements, etc.) is *ELT_BITS, return an identical type,
2194 but with the bit sizes of its elements (and those of any
2195 constituent arrays) recorded in the BITSIZE components of its
2196 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2199 Note that, for arrays whose index type has an XA encoding where
2200 a bound references a record discriminant, getting that discriminant,
2201 and therefore the actual value of that bound, is not possible
2202 because none of the given parameters gives us access to the record.
2203 This function assumes that it is OK in the context where it is being
2204 used to return an array whose bounds are still dynamic and where
2205 the length is arbitrary. */
2207 static struct type
*
2208 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2210 struct type
*new_elt_type
;
2211 struct type
*new_type
;
2212 struct type
*index_type_desc
;
2213 struct type
*index_type
;
2214 LONGEST low_bound
, high_bound
;
2216 type
= ada_check_typedef (type
);
2217 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2220 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2221 if (index_type_desc
)
2222 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2225 index_type
= TYPE_INDEX_TYPE (type
);
2227 new_type
= alloc_type_copy (type
);
2229 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2231 create_array_type (new_type
, new_elt_type
, index_type
);
2232 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2233 TYPE_NAME (new_type
) = ada_type_name (type
);
2235 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2236 && is_dynamic_type (check_typedef (index_type
)))
2237 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2238 low_bound
= high_bound
= 0;
2239 if (high_bound
< low_bound
)
2240 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2243 *elt_bits
*= (high_bound
- low_bound
+ 1);
2244 TYPE_LENGTH (new_type
) =
2245 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2248 TYPE_FIXED_INSTANCE (new_type
) = 1;
2252 /* The array type encoded by TYPE, where
2253 ada_is_constrained_packed_array_type (TYPE). */
2255 static struct type
*
2256 decode_constrained_packed_array_type (struct type
*type
)
2258 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2261 struct type
*shadow_type
;
2265 raw_name
= ada_type_name (desc_base_type (type
));
2270 name
= (char *) alloca (strlen (raw_name
) + 1);
2271 tail
= strstr (raw_name
, "___XP");
2272 type
= desc_base_type (type
);
2274 memcpy (name
, raw_name
, tail
- raw_name
);
2275 name
[tail
- raw_name
] = '\000';
2277 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2279 if (shadow_type
== NULL
)
2281 lim_warning (_("could not find bounds information on packed array"));
2284 shadow_type
= check_typedef (shadow_type
);
2286 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2288 lim_warning (_("could not understand bounds "
2289 "information on packed array"));
2293 bits
= decode_packed_array_bitsize (type
);
2294 return constrained_packed_array_type (shadow_type
, &bits
);
2297 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2298 array, returns a simple array that denotes that array. Its type is a
2299 standard GDB array type except that the BITSIZEs of the array
2300 target types are set to the number of bits in each element, and the
2301 type length is set appropriately. */
2303 static struct value
*
2304 decode_constrained_packed_array (struct value
*arr
)
2308 /* If our value is a pointer, then dereference it. Likewise if
2309 the value is a reference. Make sure that this operation does not
2310 cause the target type to be fixed, as this would indirectly cause
2311 this array to be decoded. The rest of the routine assumes that
2312 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2313 and "value_ind" routines to perform the dereferencing, as opposed
2314 to using "ada_coerce_ref" or "ada_value_ind". */
2315 arr
= coerce_ref (arr
);
2316 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2317 arr
= value_ind (arr
);
2319 type
= decode_constrained_packed_array_type (value_type (arr
));
2322 error (_("can't unpack array"));
2326 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2327 && ada_is_modular_type (value_type (arr
)))
2329 /* This is a (right-justified) modular type representing a packed
2330 array with no wrapper. In order to interpret the value through
2331 the (left-justified) packed array type we just built, we must
2332 first left-justify it. */
2333 int bit_size
, bit_pos
;
2336 mod
= ada_modulus (value_type (arr
)) - 1;
2343 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2344 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2345 bit_pos
/ HOST_CHAR_BIT
,
2346 bit_pos
% HOST_CHAR_BIT
,
2351 return coerce_unspec_val_to_type (arr
, type
);
2355 /* The value of the element of packed array ARR at the ARITY indices
2356 given in IND. ARR must be a simple array. */
2358 static struct value
*
2359 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2362 int bits
, elt_off
, bit_off
;
2363 long elt_total_bit_offset
;
2364 struct type
*elt_type
;
2368 elt_total_bit_offset
= 0;
2369 elt_type
= ada_check_typedef (value_type (arr
));
2370 for (i
= 0; i
< arity
; i
+= 1)
2372 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2373 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2375 (_("attempt to do packed indexing of "
2376 "something other than a packed array"));
2379 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2380 LONGEST lowerbound
, upperbound
;
2383 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2385 lim_warning (_("don't know bounds of array"));
2386 lowerbound
= upperbound
= 0;
2389 idx
= pos_atr (ind
[i
]);
2390 if (idx
< lowerbound
|| idx
> upperbound
)
2391 lim_warning (_("packed array index %ld out of bounds"),
2393 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2394 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2395 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2398 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2399 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2401 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2406 /* Non-zero iff TYPE includes negative integer values. */
2409 has_negatives (struct type
*type
)
2411 switch (TYPE_CODE (type
))
2416 return !TYPE_UNSIGNED (type
);
2417 case TYPE_CODE_RANGE
:
2418 return TYPE_LOW_BOUND (type
) < 0;
2422 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2423 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2424 the unpacked buffer.
2426 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2427 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2429 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2432 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2434 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2437 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2438 gdb_byte
*unpacked
, int unpacked_len
,
2439 int is_big_endian
, int is_signed_type
,
2442 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2443 int src_idx
; /* Index into the source area */
2444 int src_bytes_left
; /* Number of source bytes left to process. */
2445 int srcBitsLeft
; /* Number of source bits left to move */
2446 int unusedLS
; /* Number of bits in next significant
2447 byte of source that are unused */
2449 int unpacked_idx
; /* Index into the unpacked buffer */
2450 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2452 unsigned long accum
; /* Staging area for bits being transferred */
2453 int accumSize
; /* Number of meaningful bits in accum */
2456 /* Transmit bytes from least to most significant; delta is the direction
2457 the indices move. */
2458 int delta
= is_big_endian
? -1 : 1;
2460 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2462 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2463 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2464 bit_size
, unpacked_len
);
2466 srcBitsLeft
= bit_size
;
2467 src_bytes_left
= src_len
;
2468 unpacked_bytes_left
= unpacked_len
;
2473 src_idx
= src_len
- 1;
2475 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2479 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2485 unpacked_idx
= unpacked_len
- 1;
2489 /* Non-scalar values must be aligned at a byte boundary... */
2491 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2492 /* ... And are placed at the beginning (most-significant) bytes
2494 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2495 unpacked_bytes_left
= unpacked_idx
+ 1;
2500 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2502 src_idx
= unpacked_idx
= 0;
2503 unusedLS
= bit_offset
;
2506 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2511 while (src_bytes_left
> 0)
2513 /* Mask for removing bits of the next source byte that are not
2514 part of the value. */
2515 unsigned int unusedMSMask
=
2516 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2518 /* Sign-extend bits for this byte. */
2519 unsigned int signMask
= sign
& ~unusedMSMask
;
2522 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2523 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2524 if (accumSize
>= HOST_CHAR_BIT
)
2526 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2527 accumSize
-= HOST_CHAR_BIT
;
2528 accum
>>= HOST_CHAR_BIT
;
2529 unpacked_bytes_left
-= 1;
2530 unpacked_idx
+= delta
;
2532 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2534 src_bytes_left
-= 1;
2537 while (unpacked_bytes_left
> 0)
2539 accum
|= sign
<< accumSize
;
2540 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2541 accumSize
-= HOST_CHAR_BIT
;
2544 accum
>>= HOST_CHAR_BIT
;
2545 unpacked_bytes_left
-= 1;
2546 unpacked_idx
+= delta
;
2550 /* Create a new value of type TYPE from the contents of OBJ starting
2551 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2552 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2553 assigning through the result will set the field fetched from.
2554 VALADDR is ignored unless OBJ is NULL, in which case,
2555 VALADDR+OFFSET must address the start of storage containing the
2556 packed value. The value returned in this case is never an lval.
2557 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2560 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2561 long offset
, int bit_offset
, int bit_size
,
2565 const gdb_byte
*src
; /* First byte containing data to unpack */
2567 const int is_scalar
= is_scalar_type (type
);
2568 const int is_big_endian
= gdbarch_bits_big_endian (get_type_arch (type
));
2569 gdb::byte_vector staging
;
2571 type
= ada_check_typedef (type
);
2574 src
= valaddr
+ offset
;
2576 src
= value_contents (obj
) + offset
;
2578 if (is_dynamic_type (type
))
2580 /* The length of TYPE might by dynamic, so we need to resolve
2581 TYPE in order to know its actual size, which we then use
2582 to create the contents buffer of the value we return.
2583 The difficulty is that the data containing our object is
2584 packed, and therefore maybe not at a byte boundary. So, what
2585 we do, is unpack the data into a byte-aligned buffer, and then
2586 use that buffer as our object's value for resolving the type. */
2587 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2588 staging
.resize (staging_len
);
2590 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2591 staging
.data (), staging
.size (),
2592 is_big_endian
, has_negatives (type
),
2594 type
= resolve_dynamic_type (type
, staging
.data (), 0);
2595 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2597 /* This happens when the length of the object is dynamic,
2598 and is actually smaller than the space reserved for it.
2599 For instance, in an array of variant records, the bit_size
2600 we're given is the array stride, which is constant and
2601 normally equal to the maximum size of its element.
2602 But, in reality, each element only actually spans a portion
2604 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2610 v
= allocate_value (type
);
2611 src
= valaddr
+ offset
;
2613 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2615 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2618 v
= value_at (type
, value_address (obj
) + offset
);
2619 buf
= (gdb_byte
*) alloca (src_len
);
2620 read_memory (value_address (v
), buf
, src_len
);
2625 v
= allocate_value (type
);
2626 src
= value_contents (obj
) + offset
;
2631 long new_offset
= offset
;
2633 set_value_component_location (v
, obj
);
2634 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2635 set_value_bitsize (v
, bit_size
);
2636 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2639 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2641 set_value_offset (v
, new_offset
);
2643 /* Also set the parent value. This is needed when trying to
2644 assign a new value (in inferior memory). */
2645 set_value_parent (v
, obj
);
2648 set_value_bitsize (v
, bit_size
);
2649 unpacked
= value_contents_writeable (v
);
2653 memset (unpacked
, 0, TYPE_LENGTH (type
));
2657 if (staging
.size () == TYPE_LENGTH (type
))
2659 /* Small short-cut: If we've unpacked the data into a buffer
2660 of the same size as TYPE's length, then we can reuse that,
2661 instead of doing the unpacking again. */
2662 memcpy (unpacked
, staging
.data (), staging
.size ());
2665 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2666 unpacked
, TYPE_LENGTH (type
),
2667 is_big_endian
, has_negatives (type
), is_scalar
);
2672 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2673 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2676 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2677 int src_offset
, int n
, int bits_big_endian_p
)
2679 unsigned int accum
, mask
;
2680 int accum_bits
, chunk_size
;
2682 target
+= targ_offset
/ HOST_CHAR_BIT
;
2683 targ_offset
%= HOST_CHAR_BIT
;
2684 source
+= src_offset
/ HOST_CHAR_BIT
;
2685 src_offset
%= HOST_CHAR_BIT
;
2686 if (bits_big_endian_p
)
2688 accum
= (unsigned char) *source
;
2690 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2696 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2697 accum_bits
+= HOST_CHAR_BIT
;
2699 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2702 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2703 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2706 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2708 accum_bits
-= chunk_size
;
2715 accum
= (unsigned char) *source
>> src_offset
;
2717 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2721 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2722 accum_bits
+= HOST_CHAR_BIT
;
2724 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2727 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2728 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2730 accum_bits
-= chunk_size
;
2731 accum
>>= chunk_size
;
2738 /* Store the contents of FROMVAL into the location of TOVAL.
2739 Return a new value with the location of TOVAL and contents of
2740 FROMVAL. Handles assignment into packed fields that have
2741 floating-point or non-scalar types. */
2743 static struct value
*
2744 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2746 struct type
*type
= value_type (toval
);
2747 int bits
= value_bitsize (toval
);
2749 toval
= ada_coerce_ref (toval
);
2750 fromval
= ada_coerce_ref (fromval
);
2752 if (ada_is_direct_array_type (value_type (toval
)))
2753 toval
= ada_coerce_to_simple_array (toval
);
2754 if (ada_is_direct_array_type (value_type (fromval
)))
2755 fromval
= ada_coerce_to_simple_array (fromval
);
2757 if (!deprecated_value_modifiable (toval
))
2758 error (_("Left operand of assignment is not a modifiable lvalue."));
2760 if (VALUE_LVAL (toval
) == lval_memory
2762 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2763 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2765 int len
= (value_bitpos (toval
)
2766 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2768 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2770 CORE_ADDR to_addr
= value_address (toval
);
2772 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2773 fromval
= value_cast (type
, fromval
);
2775 read_memory (to_addr
, buffer
, len
);
2776 from_size
= value_bitsize (fromval
);
2778 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2779 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2780 move_bits (buffer
, value_bitpos (toval
),
2781 value_contents (fromval
), from_size
- bits
, bits
, 1);
2783 move_bits (buffer
, value_bitpos (toval
),
2784 value_contents (fromval
), 0, bits
, 0);
2785 write_memory_with_notification (to_addr
, buffer
, len
);
2787 val
= value_copy (toval
);
2788 memcpy (value_contents_raw (val
), value_contents (fromval
),
2789 TYPE_LENGTH (type
));
2790 deprecated_set_value_type (val
, type
);
2795 return value_assign (toval
, fromval
);
2799 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2800 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2801 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2802 COMPONENT, and not the inferior's memory. The current contents
2803 of COMPONENT are ignored.
2805 Although not part of the initial design, this function also works
2806 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2807 had a null address, and COMPONENT had an address which is equal to
2808 its offset inside CONTAINER. */
2811 value_assign_to_component (struct value
*container
, struct value
*component
,
2814 LONGEST offset_in_container
=
2815 (LONGEST
) (value_address (component
) - value_address (container
));
2816 int bit_offset_in_container
=
2817 value_bitpos (component
) - value_bitpos (container
);
2820 val
= value_cast (value_type (component
), val
);
2822 if (value_bitsize (component
) == 0)
2823 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2825 bits
= value_bitsize (component
);
2827 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2828 move_bits (value_contents_writeable (container
) + offset_in_container
,
2829 value_bitpos (container
) + bit_offset_in_container
,
2830 value_contents (val
),
2831 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2834 move_bits (value_contents_writeable (container
) + offset_in_container
,
2835 value_bitpos (container
) + bit_offset_in_container
,
2836 value_contents (val
), 0, bits
, 0);
2839 /* The value of the element of array ARR at the ARITY indices given in IND.
2840 ARR may be either a simple array, GNAT array descriptor, or pointer
2844 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2848 struct type
*elt_type
;
2850 elt
= ada_coerce_to_simple_array (arr
);
2852 elt_type
= ada_check_typedef (value_type (elt
));
2853 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2854 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2855 return value_subscript_packed (elt
, arity
, ind
);
2857 for (k
= 0; k
< arity
; k
+= 1)
2859 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2860 error (_("too many subscripts (%d expected)"), k
);
2861 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2866 /* Assuming ARR is a pointer to a GDB array, the value of the element
2867 of *ARR at the ARITY indices given in IND.
2868 Does not read the entire array into memory.
2870 Note: Unlike what one would expect, this function is used instead of
2871 ada_value_subscript for basically all non-packed array types. The reason
2872 for this is that a side effect of doing our own pointer arithmetics instead
2873 of relying on value_subscript is that there is no implicit typedef peeling.
2874 This is important for arrays of array accesses, where it allows us to
2875 preserve the fact that the array's element is an array access, where the
2876 access part os encoded in a typedef layer. */
2878 static struct value
*
2879 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2882 struct value
*array_ind
= ada_value_ind (arr
);
2884 = check_typedef (value_enclosing_type (array_ind
));
2886 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2887 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2888 return value_subscript_packed (array_ind
, arity
, ind
);
2890 for (k
= 0; k
< arity
; k
+= 1)
2893 struct value
*lwb_value
;
2895 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2896 error (_("too many subscripts (%d expected)"), k
);
2897 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2899 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2900 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2901 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2902 type
= TYPE_TARGET_TYPE (type
);
2905 return value_ind (arr
);
2908 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2909 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2910 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2911 this array is LOW, as per Ada rules. */
2912 static struct value
*
2913 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2916 struct type
*type0
= ada_check_typedef (type
);
2917 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2918 struct type
*index_type
2919 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2920 struct type
*slice_type
=
2921 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2922 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2923 LONGEST base_low_pos
, low_pos
;
2926 if (!discrete_position (base_index_type
, low
, &low_pos
)
2927 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2929 warning (_("unable to get positions in slice, use bounds instead"));
2931 base_low_pos
= base_low
;
2934 base
= value_as_address (array_ptr
)
2935 + ((low_pos
- base_low_pos
)
2936 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2937 return value_at_lazy (slice_type
, base
);
2941 static struct value
*
2942 ada_value_slice (struct value
*array
, int low
, int high
)
2944 struct type
*type
= ada_check_typedef (value_type (array
));
2945 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2946 struct type
*index_type
2947 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2948 struct type
*slice_type
=
2949 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2950 LONGEST low_pos
, high_pos
;
2952 if (!discrete_position (base_index_type
, low
, &low_pos
)
2953 || !discrete_position (base_index_type
, high
, &high_pos
))
2955 warning (_("unable to get positions in slice, use bounds instead"));
2960 return value_cast (slice_type
,
2961 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2964 /* If type is a record type in the form of a standard GNAT array
2965 descriptor, returns the number of dimensions for type. If arr is a
2966 simple array, returns the number of "array of"s that prefix its
2967 type designation. Otherwise, returns 0. */
2970 ada_array_arity (struct type
*type
)
2977 type
= desc_base_type (type
);
2980 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2981 return desc_arity (desc_bounds_type (type
));
2983 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2986 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2992 /* If TYPE is a record type in the form of a standard GNAT array
2993 descriptor or a simple array type, returns the element type for
2994 TYPE after indexing by NINDICES indices, or by all indices if
2995 NINDICES is -1. Otherwise, returns NULL. */
2998 ada_array_element_type (struct type
*type
, int nindices
)
3000 type
= desc_base_type (type
);
3002 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
3005 struct type
*p_array_type
;
3007 p_array_type
= desc_data_target_type (type
);
3009 k
= ada_array_arity (type
);
3013 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
3014 if (nindices
>= 0 && k
> nindices
)
3016 while (k
> 0 && p_array_type
!= NULL
)
3018 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
3021 return p_array_type
;
3023 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3025 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3027 type
= TYPE_TARGET_TYPE (type
);
3036 /* The type of nth index in arrays of given type (n numbering from 1).
3037 Does not examine memory. Throws an error if N is invalid or TYPE
3038 is not an array type. NAME is the name of the Ada attribute being
3039 evaluated ('range, 'first, 'last, or 'length); it is used in building
3040 the error message. */
3042 static struct type
*
3043 ada_index_type (struct type
*type
, int n
, const char *name
)
3045 struct type
*result_type
;
3047 type
= desc_base_type (type
);
3049 if (n
< 0 || n
> ada_array_arity (type
))
3050 error (_("invalid dimension number to '%s"), name
);
3052 if (ada_is_simple_array_type (type
))
3056 for (i
= 1; i
< n
; i
+= 1)
3057 type
= TYPE_TARGET_TYPE (type
);
3058 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
3059 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3060 has a target type of TYPE_CODE_UNDEF. We compensate here, but
3061 perhaps stabsread.c would make more sense. */
3062 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
3067 result_type
= desc_index_type (desc_bounds_type (type
), n
);
3068 if (result_type
== NULL
)
3069 error (_("attempt to take bound of something that is not an array"));
3075 /* Given that arr is an array type, returns the lower bound of the
3076 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
3077 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
3078 array-descriptor type. It works for other arrays with bounds supplied
3079 by run-time quantities other than discriminants. */
3082 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
3084 struct type
*type
, *index_type_desc
, *index_type
;
3087 gdb_assert (which
== 0 || which
== 1);
3089 if (ada_is_constrained_packed_array_type (arr_type
))
3090 arr_type
= decode_constrained_packed_array_type (arr_type
);
3092 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3093 return (LONGEST
) - which
;
3095 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
3096 type
= TYPE_TARGET_TYPE (arr_type
);
3100 if (TYPE_FIXED_INSTANCE (type
))
3102 /* The array has already been fixed, so we do not need to
3103 check the parallel ___XA type again. That encoding has
3104 already been applied, so ignore it now. */
3105 index_type_desc
= NULL
;
3109 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3110 ada_fixup_array_indexes_type (index_type_desc
);
3113 if (index_type_desc
!= NULL
)
3114 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3118 struct type
*elt_type
= check_typedef (type
);
3120 for (i
= 1; i
< n
; i
++)
3121 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3123 index_type
= TYPE_INDEX_TYPE (elt_type
);
3127 (LONGEST
) (which
== 0
3128 ? ada_discrete_type_low_bound (index_type
)
3129 : ada_discrete_type_high_bound (index_type
));
3132 /* Given that arr is an array value, returns the lower bound of the
3133 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3134 WHICH is 1. This routine will also work for arrays with bounds
3135 supplied by run-time quantities other than discriminants. */
3138 ada_array_bound (struct value
*arr
, int n
, int which
)
3140 struct type
*arr_type
;
3142 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3143 arr
= value_ind (arr
);
3144 arr_type
= value_enclosing_type (arr
);
3146 if (ada_is_constrained_packed_array_type (arr_type
))
3147 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3148 else if (ada_is_simple_array_type (arr_type
))
3149 return ada_array_bound_from_type (arr_type
, n
, which
);
3151 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3154 /* Given that arr is an array value, returns the length of the
3155 nth index. This routine will also work for arrays with bounds
3156 supplied by run-time quantities other than discriminants.
3157 Does not work for arrays indexed by enumeration types with representation
3158 clauses at the moment. */
3161 ada_array_length (struct value
*arr
, int n
)
3163 struct type
*arr_type
, *index_type
;
3166 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3167 arr
= value_ind (arr
);
3168 arr_type
= value_enclosing_type (arr
);
3170 if (ada_is_constrained_packed_array_type (arr_type
))
3171 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3173 if (ada_is_simple_array_type (arr_type
))
3175 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3176 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3180 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3181 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3184 arr_type
= check_typedef (arr_type
);
3185 index_type
= TYPE_INDEX_TYPE (arr_type
);
3186 if (index_type
!= NULL
)
3188 struct type
*base_type
;
3189 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3190 base_type
= TYPE_TARGET_TYPE (index_type
);
3192 base_type
= index_type
;
3194 low
= pos_atr (value_from_longest (base_type
, low
));
3195 high
= pos_atr (value_from_longest (base_type
, high
));
3197 return high
- low
+ 1;
3200 /* An empty array whose type is that of ARR_TYPE (an array type),
3201 with bounds LOW to LOW-1. */
3203 static struct value
*
3204 empty_array (struct type
*arr_type
, int low
)
3206 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3207 struct type
*index_type
3208 = create_static_range_type
3209 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3210 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3212 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3216 /* Name resolution */
3218 /* The "decoded" name for the user-definable Ada operator corresponding
3222 ada_decoded_op_name (enum exp_opcode op
)
3226 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3228 if (ada_opname_table
[i
].op
== op
)
3229 return ada_opname_table
[i
].decoded
;
3231 error (_("Could not find operator name for opcode"));
3235 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3236 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3237 undefined namespace) and converts operators that are
3238 user-defined into appropriate function calls. If CONTEXT_TYPE is
3239 non-null, it provides a preferred result type [at the moment, only
3240 type void has any effect---causing procedures to be preferred over
3241 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3242 return type is preferred. May change (expand) *EXP. */
3245 resolve (struct expression
**expp
, int void_context_p
)
3247 struct type
*context_type
= NULL
;
3251 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3253 resolve_subexp (expp
, &pc
, 1, context_type
);
3256 /* Resolve the operator of the subexpression beginning at
3257 position *POS of *EXPP. "Resolving" consists of replacing
3258 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3259 with their resolutions, replacing built-in operators with
3260 function calls to user-defined operators, where appropriate, and,
3261 when DEPROCEDURE_P is non-zero, converting function-valued variables
3262 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3263 are as in ada_resolve, above. */
3265 static struct value
*
3266 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3267 struct type
*context_type
)
3271 struct expression
*exp
; /* Convenience: == *expp. */
3272 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3273 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3274 int nargs
; /* Number of operands. */
3281 /* Pass one: resolve operands, saving their types and updating *pos,
3286 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3287 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3292 resolve_subexp (expp
, pos
, 0, NULL
);
3294 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3299 resolve_subexp (expp
, pos
, 0, NULL
);
3304 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3307 case OP_ATR_MODULUS
:
3317 case TERNOP_IN_RANGE
:
3318 case BINOP_IN_BOUNDS
:
3324 case OP_DISCRETE_RANGE
:
3326 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3335 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3337 resolve_subexp (expp
, pos
, 1, NULL
);
3339 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3356 case BINOP_LOGICAL_AND
:
3357 case BINOP_LOGICAL_OR
:
3358 case BINOP_BITWISE_AND
:
3359 case BINOP_BITWISE_IOR
:
3360 case BINOP_BITWISE_XOR
:
3363 case BINOP_NOTEQUAL
:
3370 case BINOP_SUBSCRIPT
:
3378 case UNOP_LOGICAL_NOT
:
3394 case OP_INTERNALVAR
:
3404 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3407 case STRUCTOP_STRUCT
:
3408 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3421 error (_("Unexpected operator during name resolution"));
3424 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3425 for (i
= 0; i
< nargs
; i
+= 1)
3426 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3430 /* Pass two: perform any resolution on principal operator. */
3437 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3439 struct block_symbol
*candidates
;
3443 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3444 (exp
->elts
[pc
+ 2].symbol
),
3445 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3448 if (n_candidates
> 1)
3450 /* Types tend to get re-introduced locally, so if there
3451 are any local symbols that are not types, first filter
3454 for (j
= 0; j
< n_candidates
; j
+= 1)
3455 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3460 case LOC_REGPARM_ADDR
:
3468 if (j
< n_candidates
)
3471 while (j
< n_candidates
)
3473 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3475 candidates
[j
] = candidates
[n_candidates
- 1];
3484 if (n_candidates
== 0)
3485 error (_("No definition found for %s"),
3486 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3487 else if (n_candidates
== 1)
3489 else if (deprocedure_p
3490 && !is_nonfunction (candidates
, n_candidates
))
3492 i
= ada_resolve_function
3493 (candidates
, n_candidates
, NULL
, 0,
3494 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3497 error (_("Could not find a match for %s"),
3498 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3502 printf_filtered (_("Multiple matches for %s\n"),
3503 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3504 user_select_syms (candidates
, n_candidates
, 1);
3508 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3509 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3510 if (innermost_block
== NULL
3511 || contained_in (candidates
[i
].block
, innermost_block
))
3512 innermost_block
= candidates
[i
].block
;
3516 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3519 replace_operator_with_call (expp
, pc
, 0, 0,
3520 exp
->elts
[pc
+ 2].symbol
,
3521 exp
->elts
[pc
+ 1].block
);
3528 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3529 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3531 struct block_symbol
*candidates
;
3535 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3536 (exp
->elts
[pc
+ 5].symbol
),
3537 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3539 if (n_candidates
== 1)
3543 i
= ada_resolve_function
3544 (candidates
, n_candidates
,
3546 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3549 error (_("Could not find a match for %s"),
3550 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3553 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3554 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3555 if (innermost_block
== NULL
3556 || contained_in (candidates
[i
].block
, innermost_block
))
3557 innermost_block
= candidates
[i
].block
;
3568 case BINOP_BITWISE_AND
:
3569 case BINOP_BITWISE_IOR
:
3570 case BINOP_BITWISE_XOR
:
3572 case BINOP_NOTEQUAL
:
3580 case UNOP_LOGICAL_NOT
:
3582 if (possible_user_operator_p (op
, argvec
))
3584 struct block_symbol
*candidates
;
3588 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3589 (struct block
*) NULL
, VAR_DOMAIN
,
3591 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3592 ada_decoded_op_name (op
), NULL
);
3596 replace_operator_with_call (expp
, pc
, nargs
, 1,
3597 candidates
[i
].symbol
,
3598 candidates
[i
].block
);
3609 return evaluate_subexp_type (exp
, pos
);
3612 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3613 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3615 /* The term "match" here is rather loose. The match is heuristic and
3619 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3621 ftype
= ada_check_typedef (ftype
);
3622 atype
= ada_check_typedef (atype
);
3624 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3625 ftype
= TYPE_TARGET_TYPE (ftype
);
3626 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3627 atype
= TYPE_TARGET_TYPE (atype
);
3629 switch (TYPE_CODE (ftype
))
3632 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3634 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3635 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3636 TYPE_TARGET_TYPE (atype
), 0);
3639 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3641 case TYPE_CODE_ENUM
:
3642 case TYPE_CODE_RANGE
:
3643 switch (TYPE_CODE (atype
))
3646 case TYPE_CODE_ENUM
:
3647 case TYPE_CODE_RANGE
:
3653 case TYPE_CODE_ARRAY
:
3654 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3655 || ada_is_array_descriptor_type (atype
));
3657 case TYPE_CODE_STRUCT
:
3658 if (ada_is_array_descriptor_type (ftype
))
3659 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3660 || ada_is_array_descriptor_type (atype
));
3662 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3663 && !ada_is_array_descriptor_type (atype
));
3665 case TYPE_CODE_UNION
:
3667 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3671 /* Return non-zero if the formals of FUNC "sufficiently match" the
3672 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3673 may also be an enumeral, in which case it is treated as a 0-
3674 argument function. */
3677 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3680 struct type
*func_type
= SYMBOL_TYPE (func
);
3682 if (SYMBOL_CLASS (func
) == LOC_CONST
3683 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3684 return (n_actuals
== 0);
3685 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3688 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3691 for (i
= 0; i
< n_actuals
; i
+= 1)
3693 if (actuals
[i
] == NULL
)
3697 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3699 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3701 if (!ada_type_match (ftype
, atype
, 1))
3708 /* False iff function type FUNC_TYPE definitely does not produce a value
3709 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3710 FUNC_TYPE is not a valid function type with a non-null return type
3711 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3714 return_match (struct type
*func_type
, struct type
*context_type
)
3716 struct type
*return_type
;
3718 if (func_type
== NULL
)
3721 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3722 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3724 return_type
= get_base_type (func_type
);
3725 if (return_type
== NULL
)
3728 context_type
= get_base_type (context_type
);
3730 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3731 return context_type
== NULL
|| return_type
== context_type
;
3732 else if (context_type
== NULL
)
3733 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3735 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3739 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3740 function (if any) that matches the types of the NARGS arguments in
3741 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3742 that returns that type, then eliminate matches that don't. If
3743 CONTEXT_TYPE is void and there is at least one match that does not
3744 return void, eliminate all matches that do.
3746 Asks the user if there is more than one match remaining. Returns -1
3747 if there is no such symbol or none is selected. NAME is used
3748 solely for messages. May re-arrange and modify SYMS in
3749 the process; the index returned is for the modified vector. */
3752 ada_resolve_function (struct block_symbol syms
[],
3753 int nsyms
, struct value
**args
, int nargs
,
3754 const char *name
, struct type
*context_type
)
3758 int m
; /* Number of hits */
3761 /* In the first pass of the loop, we only accept functions matching
3762 context_type. If none are found, we add a second pass of the loop
3763 where every function is accepted. */
3764 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3766 for (k
= 0; k
< nsyms
; k
+= 1)
3768 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3770 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3771 && (fallback
|| return_match (type
, context_type
)))
3779 /* If we got multiple matches, ask the user which one to use. Don't do this
3780 interactive thing during completion, though, as the purpose of the
3781 completion is providing a list of all possible matches. Prompting the
3782 user to filter it down would be completely unexpected in this case. */
3785 else if (m
> 1 && !parse_completion
)
3787 printf_filtered (_("Multiple matches for %s\n"), name
);
3788 user_select_syms (syms
, m
, 1);
3794 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3795 in a listing of choices during disambiguation (see sort_choices, below).
3796 The idea is that overloadings of a subprogram name from the
3797 same package should sort in their source order. We settle for ordering
3798 such symbols by their trailing number (__N or $N). */
3801 encoded_ordered_before (const char *N0
, const char *N1
)
3805 else if (N0
== NULL
)
3811 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3813 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3815 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3816 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3821 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3824 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3826 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3827 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3829 return (strcmp (N0
, N1
) < 0);
3833 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3837 sort_choices (struct block_symbol syms
[], int nsyms
)
3841 for (i
= 1; i
< nsyms
; i
+= 1)
3843 struct block_symbol sym
= syms
[i
];
3846 for (j
= i
- 1; j
>= 0; j
-= 1)
3848 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
3849 SYMBOL_LINKAGE_NAME (sym
.symbol
)))
3851 syms
[j
+ 1] = syms
[j
];
3857 /* Whether GDB should display formals and return types for functions in the
3858 overloads selection menu. */
3859 static int print_signatures
= 1;
3861 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3862 all but functions, the signature is just the name of the symbol. For
3863 functions, this is the name of the function, the list of types for formals
3864 and the return type (if any). */
3867 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3868 const struct type_print_options
*flags
)
3870 struct type
*type
= SYMBOL_TYPE (sym
);
3872 fprintf_filtered (stream
, "%s", SYMBOL_PRINT_NAME (sym
));
3873 if (!print_signatures
3875 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3878 if (TYPE_NFIELDS (type
) > 0)
3882 fprintf_filtered (stream
, " (");
3883 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3886 fprintf_filtered (stream
, "; ");
3887 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3890 fprintf_filtered (stream
, ")");
3892 if (TYPE_TARGET_TYPE (type
) != NULL
3893 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3895 fprintf_filtered (stream
, " return ");
3896 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3900 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3901 by asking the user (if necessary), returning the number selected,
3902 and setting the first elements of SYMS items. Error if no symbols
3905 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3906 to be re-integrated one of these days. */
3909 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3912 int *chosen
= XALLOCAVEC (int , nsyms
);
3914 int first_choice
= (max_results
== 1) ? 1 : 2;
3915 const char *select_mode
= multiple_symbols_select_mode ();
3917 if (max_results
< 1)
3918 error (_("Request to select 0 symbols!"));
3922 if (select_mode
== multiple_symbols_cancel
)
3924 canceled because the command is ambiguous\n\
3925 See set/show multiple-symbol."));
3927 /* If select_mode is "all", then return all possible symbols.
3928 Only do that if more than one symbol can be selected, of course.
3929 Otherwise, display the menu as usual. */
3930 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3933 printf_unfiltered (_("[0] cancel\n"));
3934 if (max_results
> 1)
3935 printf_unfiltered (_("[1] all\n"));
3937 sort_choices (syms
, nsyms
);
3939 for (i
= 0; i
< nsyms
; i
+= 1)
3941 if (syms
[i
].symbol
== NULL
)
3944 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3946 struct symtab_and_line sal
=
3947 find_function_start_sal (syms
[i
].symbol
, 1);
3949 printf_unfiltered ("[%d] ", i
+ first_choice
);
3950 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3951 &type_print_raw_options
);
3952 if (sal
.symtab
== NULL
)
3953 printf_unfiltered (_(" at <no source file available>:%d\n"),
3956 printf_unfiltered (_(" at %s:%d\n"),
3957 symtab_to_filename_for_display (sal
.symtab
),
3964 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3965 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3966 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3967 struct symtab
*symtab
= NULL
;
3969 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3970 symtab
= symbol_symtab (syms
[i
].symbol
);
3972 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3974 printf_unfiltered ("[%d] ", i
+ first_choice
);
3975 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3976 &type_print_raw_options
);
3977 printf_unfiltered (_(" at %s:%d\n"),
3978 symtab_to_filename_for_display (symtab
),
3979 SYMBOL_LINE (syms
[i
].symbol
));
3981 else if (is_enumeral
3982 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3984 printf_unfiltered (("[%d] "), i
+ first_choice
);
3985 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3986 gdb_stdout
, -1, 0, &type_print_raw_options
);
3987 printf_unfiltered (_("'(%s) (enumeral)\n"),
3988 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
3992 printf_unfiltered ("[%d] ", i
+ first_choice
);
3993 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3994 &type_print_raw_options
);
3997 printf_unfiltered (is_enumeral
3998 ? _(" in %s (enumeral)\n")
4000 symtab_to_filename_for_display (symtab
));
4002 printf_unfiltered (is_enumeral
4003 ? _(" (enumeral)\n")
4009 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
4012 for (i
= 0; i
< n_chosen
; i
+= 1)
4013 syms
[i
] = syms
[chosen
[i
]];
4018 /* Read and validate a set of numeric choices from the user in the
4019 range 0 .. N_CHOICES-1. Place the results in increasing
4020 order in CHOICES[0 .. N-1], and return N.
4022 The user types choices as a sequence of numbers on one line
4023 separated by blanks, encoding them as follows:
4025 + A choice of 0 means to cancel the selection, throwing an error.
4026 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4027 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4029 The user is not allowed to choose more than MAX_RESULTS values.
4031 ANNOTATION_SUFFIX, if present, is used to annotate the input
4032 prompts (for use with the -f switch). */
4035 get_selections (int *choices
, int n_choices
, int max_results
,
4036 int is_all_choice
, const char *annotation_suffix
)
4041 int first_choice
= is_all_choice
? 2 : 1;
4043 prompt
= getenv ("PS2");
4047 args
= command_line_input (prompt
, 0, annotation_suffix
);
4050 error_no_arg (_("one or more choice numbers"));
4054 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4055 order, as given in args. Choices are validated. */
4061 args
= skip_spaces (args
);
4062 if (*args
== '\0' && n_chosen
== 0)
4063 error_no_arg (_("one or more choice numbers"));
4064 else if (*args
== '\0')
4067 choice
= strtol (args
, &args2
, 10);
4068 if (args
== args2
|| choice
< 0
4069 || choice
> n_choices
+ first_choice
- 1)
4070 error (_("Argument must be choice number"));
4074 error (_("cancelled"));
4076 if (choice
< first_choice
)
4078 n_chosen
= n_choices
;
4079 for (j
= 0; j
< n_choices
; j
+= 1)
4083 choice
-= first_choice
;
4085 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
4089 if (j
< 0 || choice
!= choices
[j
])
4093 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
4094 choices
[k
+ 1] = choices
[k
];
4095 choices
[j
+ 1] = choice
;
4100 if (n_chosen
> max_results
)
4101 error (_("Select no more than %d of the above"), max_results
);
4106 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4107 on the function identified by SYM and BLOCK, and taking NARGS
4108 arguments. Update *EXPP as needed to hold more space. */
4111 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
4112 int oplen
, struct symbol
*sym
,
4113 const struct block
*block
)
4115 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4116 symbol, -oplen for operator being replaced). */
4117 struct expression
*newexp
= (struct expression
*)
4118 xzalloc (sizeof (struct expression
)
4119 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4120 struct expression
*exp
= *expp
;
4122 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4123 newexp
->language_defn
= exp
->language_defn
;
4124 newexp
->gdbarch
= exp
->gdbarch
;
4125 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4126 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4127 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4129 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4130 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4132 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4133 newexp
->elts
[pc
+ 4].block
= block
;
4134 newexp
->elts
[pc
+ 5].symbol
= sym
;
4140 /* Type-class predicates */
4142 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4146 numeric_type_p (struct type
*type
)
4152 switch (TYPE_CODE (type
))
4157 case TYPE_CODE_RANGE
:
4158 return (type
== TYPE_TARGET_TYPE (type
)
4159 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4166 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4169 integer_type_p (struct type
*type
)
4175 switch (TYPE_CODE (type
))
4179 case TYPE_CODE_RANGE
:
4180 return (type
== TYPE_TARGET_TYPE (type
)
4181 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4188 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4191 scalar_type_p (struct type
*type
)
4197 switch (TYPE_CODE (type
))
4200 case TYPE_CODE_RANGE
:
4201 case TYPE_CODE_ENUM
:
4210 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4213 discrete_type_p (struct type
*type
)
4219 switch (TYPE_CODE (type
))
4222 case TYPE_CODE_RANGE
:
4223 case TYPE_CODE_ENUM
:
4224 case TYPE_CODE_BOOL
:
4232 /* Returns non-zero if OP with operands in the vector ARGS could be
4233 a user-defined function. Errs on the side of pre-defined operators
4234 (i.e., result 0). */
4237 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4239 struct type
*type0
=
4240 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4241 struct type
*type1
=
4242 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4256 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4260 case BINOP_BITWISE_AND
:
4261 case BINOP_BITWISE_IOR
:
4262 case BINOP_BITWISE_XOR
:
4263 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4266 case BINOP_NOTEQUAL
:
4271 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4274 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4277 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4281 case UNOP_LOGICAL_NOT
:
4283 return (!numeric_type_p (type0
));
4292 1. In the following, we assume that a renaming type's name may
4293 have an ___XD suffix. It would be nice if this went away at some
4295 2. We handle both the (old) purely type-based representation of
4296 renamings and the (new) variable-based encoding. At some point,
4297 it is devoutly to be hoped that the former goes away
4298 (FIXME: hilfinger-2007-07-09).
4299 3. Subprogram renamings are not implemented, although the XRS
4300 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4302 /* If SYM encodes a renaming,
4304 <renaming> renames <renamed entity>,
4306 sets *LEN to the length of the renamed entity's name,
4307 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4308 the string describing the subcomponent selected from the renamed
4309 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4310 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4311 are undefined). Otherwise, returns a value indicating the category
4312 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4313 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4314 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4315 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4316 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4317 may be NULL, in which case they are not assigned.
4319 [Currently, however, GCC does not generate subprogram renamings.] */
4321 enum ada_renaming_category
4322 ada_parse_renaming (struct symbol
*sym
,
4323 const char **renamed_entity
, int *len
,
4324 const char **renaming_expr
)
4326 enum ada_renaming_category kind
;
4331 return ADA_NOT_RENAMING
;
4332 switch (SYMBOL_CLASS (sym
))
4335 return ADA_NOT_RENAMING
;
4337 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4338 renamed_entity
, len
, renaming_expr
);
4342 case LOC_OPTIMIZED_OUT
:
4343 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4345 return ADA_NOT_RENAMING
;
4349 kind
= ADA_OBJECT_RENAMING
;
4353 kind
= ADA_EXCEPTION_RENAMING
;
4357 kind
= ADA_PACKAGE_RENAMING
;
4361 kind
= ADA_SUBPROGRAM_RENAMING
;
4365 return ADA_NOT_RENAMING
;
4369 if (renamed_entity
!= NULL
)
4370 *renamed_entity
= info
;
4371 suffix
= strstr (info
, "___XE");
4372 if (suffix
== NULL
|| suffix
== info
)
4373 return ADA_NOT_RENAMING
;
4375 *len
= strlen (info
) - strlen (suffix
);
4377 if (renaming_expr
!= NULL
)
4378 *renaming_expr
= suffix
;
4382 /* Assuming TYPE encodes a renaming according to the old encoding in
4383 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4384 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4385 ADA_NOT_RENAMING otherwise. */
4386 static enum ada_renaming_category
4387 parse_old_style_renaming (struct type
*type
,
4388 const char **renamed_entity
, int *len
,
4389 const char **renaming_expr
)
4391 enum ada_renaming_category kind
;
4396 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4397 || TYPE_NFIELDS (type
) != 1)
4398 return ADA_NOT_RENAMING
;
4400 name
= type_name_no_tag (type
);
4402 return ADA_NOT_RENAMING
;
4404 name
= strstr (name
, "___XR");
4406 return ADA_NOT_RENAMING
;
4411 kind
= ADA_OBJECT_RENAMING
;
4414 kind
= ADA_EXCEPTION_RENAMING
;
4417 kind
= ADA_PACKAGE_RENAMING
;
4420 kind
= ADA_SUBPROGRAM_RENAMING
;
4423 return ADA_NOT_RENAMING
;
4426 info
= TYPE_FIELD_NAME (type
, 0);
4428 return ADA_NOT_RENAMING
;
4429 if (renamed_entity
!= NULL
)
4430 *renamed_entity
= info
;
4431 suffix
= strstr (info
, "___XE");
4432 if (renaming_expr
!= NULL
)
4433 *renaming_expr
= suffix
+ 5;
4434 if (suffix
== NULL
|| suffix
== info
)
4435 return ADA_NOT_RENAMING
;
4437 *len
= suffix
- info
;
4441 /* Compute the value of the given RENAMING_SYM, which is expected to
4442 be a symbol encoding a renaming expression. BLOCK is the block
4443 used to evaluate the renaming. */
4445 static struct value
*
4446 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4447 const struct block
*block
)
4449 const char *sym_name
;
4451 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4452 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4453 return evaluate_expression (expr
.get ());
4457 /* Evaluation: Function Calls */
4459 /* Return an lvalue containing the value VAL. This is the identity on
4460 lvalues, and otherwise has the side-effect of allocating memory
4461 in the inferior where a copy of the value contents is copied. */
4463 static struct value
*
4464 ensure_lval (struct value
*val
)
4466 if (VALUE_LVAL (val
) == not_lval
4467 || VALUE_LVAL (val
) == lval_internalvar
)
4469 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4470 const CORE_ADDR addr
=
4471 value_as_long (value_allocate_space_in_inferior (len
));
4473 VALUE_LVAL (val
) = lval_memory
;
4474 set_value_address (val
, addr
);
4475 write_memory (addr
, value_contents (val
), len
);
4481 /* Return the value ACTUAL, converted to be an appropriate value for a
4482 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4483 allocating any necessary descriptors (fat pointers), or copies of
4484 values not residing in memory, updating it as needed. */
4487 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4489 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4490 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4491 struct type
*formal_target
=
4492 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4493 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4494 struct type
*actual_target
=
4495 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4496 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4498 if (ada_is_array_descriptor_type (formal_target
)
4499 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4500 return make_array_descriptor (formal_type
, actual
);
4501 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4502 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4504 struct value
*result
;
4506 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4507 && ada_is_array_descriptor_type (actual_target
))
4508 result
= desc_data (actual
);
4509 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4511 if (VALUE_LVAL (actual
) != lval_memory
)
4515 actual_type
= ada_check_typedef (value_type (actual
));
4516 val
= allocate_value (actual_type
);
4517 memcpy ((char *) value_contents_raw (val
),
4518 (char *) value_contents (actual
),
4519 TYPE_LENGTH (actual_type
));
4520 actual
= ensure_lval (val
);
4522 result
= value_addr (actual
);
4526 return value_cast_pointers (formal_type
, result
, 0);
4528 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4529 return ada_value_ind (actual
);
4530 else if (ada_is_aligner_type (formal_type
))
4532 /* We need to turn this parameter into an aligner type
4534 struct value
*aligner
= allocate_value (formal_type
);
4535 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4537 value_assign_to_component (aligner
, component
, actual
);
4544 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4545 type TYPE. This is usually an inefficient no-op except on some targets
4546 (such as AVR) where the representation of a pointer and an address
4550 value_pointer (struct value
*value
, struct type
*type
)
4552 struct gdbarch
*gdbarch
= get_type_arch (type
);
4553 unsigned len
= TYPE_LENGTH (type
);
4554 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4557 addr
= value_address (value
);
4558 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4559 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4564 /* Push a descriptor of type TYPE for array value ARR on the stack at
4565 *SP, updating *SP to reflect the new descriptor. Return either
4566 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4567 to-descriptor type rather than a descriptor type), a struct value *
4568 representing a pointer to this descriptor. */
4570 static struct value
*
4571 make_array_descriptor (struct type
*type
, struct value
*arr
)
4573 struct type
*bounds_type
= desc_bounds_type (type
);
4574 struct type
*desc_type
= desc_base_type (type
);
4575 struct value
*descriptor
= allocate_value (desc_type
);
4576 struct value
*bounds
= allocate_value (bounds_type
);
4579 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4582 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4583 ada_array_bound (arr
, i
, 0),
4584 desc_bound_bitpos (bounds_type
, i
, 0),
4585 desc_bound_bitsize (bounds_type
, i
, 0));
4586 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4587 ada_array_bound (arr
, i
, 1),
4588 desc_bound_bitpos (bounds_type
, i
, 1),
4589 desc_bound_bitsize (bounds_type
, i
, 1));
4592 bounds
= ensure_lval (bounds
);
4594 modify_field (value_type (descriptor
),
4595 value_contents_writeable (descriptor
),
4596 value_pointer (ensure_lval (arr
),
4597 TYPE_FIELD_TYPE (desc_type
, 0)),
4598 fat_pntr_data_bitpos (desc_type
),
4599 fat_pntr_data_bitsize (desc_type
));
4601 modify_field (value_type (descriptor
),
4602 value_contents_writeable (descriptor
),
4603 value_pointer (bounds
,
4604 TYPE_FIELD_TYPE (desc_type
, 1)),
4605 fat_pntr_bounds_bitpos (desc_type
),
4606 fat_pntr_bounds_bitsize (desc_type
));
4608 descriptor
= ensure_lval (descriptor
);
4610 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4611 return value_addr (descriptor
);
4616 /* Symbol Cache Module */
4618 /* Performance measurements made as of 2010-01-15 indicate that
4619 this cache does bring some noticeable improvements. Depending
4620 on the type of entity being printed, the cache can make it as much
4621 as an order of magnitude faster than without it.
4623 The descriptive type DWARF extension has significantly reduced
4624 the need for this cache, at least when DWARF is being used. However,
4625 even in this case, some expensive name-based symbol searches are still
4626 sometimes necessary - to find an XVZ variable, mostly. */
4628 /* Initialize the contents of SYM_CACHE. */
4631 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4633 obstack_init (&sym_cache
->cache_space
);
4634 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4637 /* Free the memory used by SYM_CACHE. */
4640 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4642 obstack_free (&sym_cache
->cache_space
, NULL
);
4646 /* Return the symbol cache associated to the given program space PSPACE.
4647 If not allocated for this PSPACE yet, allocate and initialize one. */
4649 static struct ada_symbol_cache
*
4650 ada_get_symbol_cache (struct program_space
*pspace
)
4652 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4654 if (pspace_data
->sym_cache
== NULL
)
4656 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4657 ada_init_symbol_cache (pspace_data
->sym_cache
);
4660 return pspace_data
->sym_cache
;
4663 /* Clear all entries from the symbol cache. */
4666 ada_clear_symbol_cache (void)
4668 struct ada_symbol_cache
*sym_cache
4669 = ada_get_symbol_cache (current_program_space
);
4671 obstack_free (&sym_cache
->cache_space
, NULL
);
4672 ada_init_symbol_cache (sym_cache
);
4675 /* Search our cache for an entry matching NAME and DOMAIN.
4676 Return it if found, or NULL otherwise. */
4678 static struct cache_entry
**
4679 find_entry (const char *name
, domain_enum domain
)
4681 struct ada_symbol_cache
*sym_cache
4682 = ada_get_symbol_cache (current_program_space
);
4683 int h
= msymbol_hash (name
) % HASH_SIZE
;
4684 struct cache_entry
**e
;
4686 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4688 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4694 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4695 Return 1 if found, 0 otherwise.
4697 If an entry was found and SYM is not NULL, set *SYM to the entry's
4698 SYM. Same principle for BLOCK if not NULL. */
4701 lookup_cached_symbol (const char *name
, domain_enum domain
,
4702 struct symbol
**sym
, const struct block
**block
)
4704 struct cache_entry
**e
= find_entry (name
, domain
);
4711 *block
= (*e
)->block
;
4715 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4716 in domain DOMAIN, save this result in our symbol cache. */
4719 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4720 const struct block
*block
)
4722 struct ada_symbol_cache
*sym_cache
4723 = ada_get_symbol_cache (current_program_space
);
4726 struct cache_entry
*e
;
4728 /* Symbols for builtin types don't have a block.
4729 For now don't cache such symbols. */
4730 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4733 /* If the symbol is a local symbol, then do not cache it, as a search
4734 for that symbol depends on the context. To determine whether
4735 the symbol is local or not, we check the block where we found it
4736 against the global and static blocks of its associated symtab. */
4738 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4739 GLOBAL_BLOCK
) != block
4740 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4741 STATIC_BLOCK
) != block
)
4744 h
= msymbol_hash (name
) % HASH_SIZE
;
4745 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4747 e
->next
= sym_cache
->root
[h
];
4748 sym_cache
->root
[h
] = e
;
4750 = (char *) obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4751 strcpy (copy
, name
);
4759 /* Return nonzero if wild matching should be used when searching for
4760 all symbols matching LOOKUP_NAME.
4762 LOOKUP_NAME is expected to be a symbol name after transformation
4763 for Ada lookups (see ada_name_for_lookup). */
4766 should_use_wild_match (const char *lookup_name
)
4768 return (strstr (lookup_name
, "__") == NULL
);
4771 /* Return the result of a standard (literal, C-like) lookup of NAME in
4772 given DOMAIN, visible from lexical block BLOCK. */
4774 static struct symbol
*
4775 standard_lookup (const char *name
, const struct block
*block
,
4778 /* Initialize it just to avoid a GCC false warning. */
4779 struct block_symbol sym
= {NULL
, NULL
};
4781 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4783 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4784 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4789 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4790 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4791 since they contend in overloading in the same way. */
4793 is_nonfunction (struct block_symbol syms
[], int n
)
4797 for (i
= 0; i
< n
; i
+= 1)
4798 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4799 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4800 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4806 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4807 struct types. Otherwise, they may not. */
4810 equiv_types (struct type
*type0
, struct type
*type1
)
4814 if (type0
== NULL
|| type1
== NULL
4815 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4817 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4818 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4819 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4820 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4826 /* True iff SYM0 represents the same entity as SYM1, or one that is
4827 no more defined than that of SYM1. */
4830 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4834 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4835 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4838 switch (SYMBOL_CLASS (sym0
))
4844 struct type
*type0
= SYMBOL_TYPE (sym0
);
4845 struct type
*type1
= SYMBOL_TYPE (sym1
);
4846 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4847 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4848 int len0
= strlen (name0
);
4851 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4852 && (equiv_types (type0
, type1
)
4853 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4854 && startswith (name1
+ len0
, "___XV")));
4857 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4858 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4864 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4865 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4868 add_defn_to_vec (struct obstack
*obstackp
,
4870 const struct block
*block
)
4873 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4875 /* Do not try to complete stub types, as the debugger is probably
4876 already scanning all symbols matching a certain name at the
4877 time when this function is called. Trying to replace the stub
4878 type by its associated full type will cause us to restart a scan
4879 which may lead to an infinite recursion. Instead, the client
4880 collecting the matching symbols will end up collecting several
4881 matches, with at least one of them complete. It can then filter
4882 out the stub ones if needed. */
4884 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4886 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4888 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4890 prevDefns
[i
].symbol
= sym
;
4891 prevDefns
[i
].block
= block
;
4897 struct block_symbol info
;
4901 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4905 /* Number of block_symbol structures currently collected in current vector in
4909 num_defns_collected (struct obstack
*obstackp
)
4911 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4914 /* Vector of block_symbol structures currently collected in current vector in
4915 OBSTACKP. If FINISH, close off the vector and return its final address. */
4917 static struct block_symbol
*
4918 defns_collected (struct obstack
*obstackp
, int finish
)
4921 return (struct block_symbol
*) obstack_finish (obstackp
);
4923 return (struct block_symbol
*) obstack_base (obstackp
);
4926 /* Return a bound minimal symbol matching NAME according to Ada
4927 decoding rules. Returns an invalid symbol if there is no such
4928 minimal symbol. Names prefixed with "standard__" are handled
4929 specially: "standard__" is first stripped off, and only static and
4930 global symbols are searched. */
4932 struct bound_minimal_symbol
4933 ada_lookup_simple_minsym (const char *name
)
4935 struct bound_minimal_symbol result
;
4936 struct objfile
*objfile
;
4937 struct minimal_symbol
*msymbol
;
4938 const int wild_match_p
= should_use_wild_match (name
);
4940 memset (&result
, 0, sizeof (result
));
4942 /* Special case: If the user specifies a symbol name inside package
4943 Standard, do a non-wild matching of the symbol name without
4944 the "standard__" prefix. This was primarily introduced in order
4945 to allow the user to specifically access the standard exceptions
4946 using, for instance, Standard.Constraint_Error when Constraint_Error
4947 is ambiguous (due to the user defining its own Constraint_Error
4948 entity inside its program). */
4949 if (startswith (name
, "standard__"))
4950 name
+= sizeof ("standard__") - 1;
4952 ALL_MSYMBOLS (objfile
, msymbol
)
4954 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4955 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4957 result
.minsym
= msymbol
;
4958 result
.objfile
= objfile
;
4966 /* For all subprograms that statically enclose the subprogram of the
4967 selected frame, add symbols matching identifier NAME in DOMAIN
4968 and their blocks to the list of data in OBSTACKP, as for
4969 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4970 with a wildcard prefix. */
4973 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4974 const char *name
, domain_enum domain
,
4979 /* True if TYPE is definitely an artificial type supplied to a symbol
4980 for which no debugging information was given in the symbol file. */
4983 is_nondebugging_type (struct type
*type
)
4985 const char *name
= ada_type_name (type
);
4987 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4990 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4991 that are deemed "identical" for practical purposes.
4993 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4994 types and that their number of enumerals is identical (in other
4995 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4998 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
5002 /* The heuristic we use here is fairly conservative. We consider
5003 that 2 enumerate types are identical if they have the same
5004 number of enumerals and that all enumerals have the same
5005 underlying value and name. */
5007 /* All enums in the type should have an identical underlying value. */
5008 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5009 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
5012 /* All enumerals should also have the same name (modulo any numerical
5014 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5016 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
5017 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
5018 int len_1
= strlen (name_1
);
5019 int len_2
= strlen (name_2
);
5021 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
5022 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
5024 || strncmp (TYPE_FIELD_NAME (type1
, i
),
5025 TYPE_FIELD_NAME (type2
, i
),
5033 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5034 that are deemed "identical" for practical purposes. Sometimes,
5035 enumerals are not strictly identical, but their types are so similar
5036 that they can be considered identical.
5038 For instance, consider the following code:
5040 type Color is (Black, Red, Green, Blue, White);
5041 type RGB_Color is new Color range Red .. Blue;
5043 Type RGB_Color is a subrange of an implicit type which is a copy
5044 of type Color. If we call that implicit type RGB_ColorB ("B" is
5045 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5046 As a result, when an expression references any of the enumeral
5047 by name (Eg. "print green"), the expression is technically
5048 ambiguous and the user should be asked to disambiguate. But
5049 doing so would only hinder the user, since it wouldn't matter
5050 what choice he makes, the outcome would always be the same.
5051 So, for practical purposes, we consider them as the same. */
5054 symbols_are_identical_enums (struct block_symbol
*syms
, int nsyms
)
5058 /* Before performing a thorough comparison check of each type,
5059 we perform a series of inexpensive checks. We expect that these
5060 checks will quickly fail in the vast majority of cases, and thus
5061 help prevent the unnecessary use of a more expensive comparison.
5062 Said comparison also expects us to make some of these checks
5063 (see ada_identical_enum_types_p). */
5065 /* Quick check: All symbols should have an enum type. */
5066 for (i
= 0; i
< nsyms
; i
++)
5067 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
5070 /* Quick check: They should all have the same value. */
5071 for (i
= 1; i
< nsyms
; i
++)
5072 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5075 /* Quick check: They should all have the same number of enumerals. */
5076 for (i
= 1; i
< nsyms
; i
++)
5077 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5078 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5081 /* All the sanity checks passed, so we might have a set of
5082 identical enumeration types. Perform a more complete
5083 comparison of the type of each symbol. */
5084 for (i
= 1; i
< nsyms
; i
++)
5085 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5086 SYMBOL_TYPE (syms
[0].symbol
)))
5092 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
5093 duplicate other symbols in the list (The only case I know of where
5094 this happens is when object files containing stabs-in-ecoff are
5095 linked with files containing ordinary ecoff debugging symbols (or no
5096 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5097 Returns the number of items in the modified list. */
5100 remove_extra_symbols (struct block_symbol
*syms
, int nsyms
)
5104 /* We should never be called with less than 2 symbols, as there
5105 cannot be any extra symbol in that case. But it's easy to
5106 handle, since we have nothing to do in that case. */
5115 /* If two symbols have the same name and one of them is a stub type,
5116 the get rid of the stub. */
5118 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].symbol
))
5119 && SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
)
5121 for (j
= 0; j
< nsyms
; j
++)
5124 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].symbol
))
5125 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5126 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5127 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0)
5132 /* Two symbols with the same name, same class and same address
5133 should be identical. */
5135 else if (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
5136 && SYMBOL_CLASS (syms
[i
].symbol
) == LOC_STATIC
5137 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].symbol
)))
5139 for (j
= 0; j
< nsyms
; j
+= 1)
5142 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5143 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5144 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0
5145 && SYMBOL_CLASS (syms
[i
].symbol
)
5146 == SYMBOL_CLASS (syms
[j
].symbol
)
5147 && SYMBOL_VALUE_ADDRESS (syms
[i
].symbol
)
5148 == SYMBOL_VALUE_ADDRESS (syms
[j
].symbol
))
5155 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5156 syms
[j
- 1] = syms
[j
];
5163 /* If all the remaining symbols are identical enumerals, then
5164 just keep the first one and discard the rest.
5166 Unlike what we did previously, we do not discard any entry
5167 unless they are ALL identical. This is because the symbol
5168 comparison is not a strict comparison, but rather a practical
5169 comparison. If all symbols are considered identical, then
5170 we can just go ahead and use the first one and discard the rest.
5171 But if we cannot reduce the list to a single element, we have
5172 to ask the user to disambiguate anyways. And if we have to
5173 present a multiple-choice menu, it's less confusing if the list
5174 isn't missing some choices that were identical and yet distinct. */
5175 if (symbols_are_identical_enums (syms
, nsyms
))
5181 /* Given a type that corresponds to a renaming entity, use the type name
5182 to extract the scope (package name or function name, fully qualified,
5183 and following the GNAT encoding convention) where this renaming has been
5184 defined. The string returned needs to be deallocated after use. */
5187 xget_renaming_scope (struct type
*renaming_type
)
5189 /* The renaming types adhere to the following convention:
5190 <scope>__<rename>___<XR extension>.
5191 So, to extract the scope, we search for the "___XR" extension,
5192 and then backtrack until we find the first "__". */
5194 const char *name
= type_name_no_tag (renaming_type
);
5195 const char *suffix
= strstr (name
, "___XR");
5200 /* Now, backtrack a bit until we find the first "__". Start looking
5201 at suffix - 3, as the <rename> part is at least one character long. */
5203 for (last
= suffix
- 3; last
> name
; last
--)
5204 if (last
[0] == '_' && last
[1] == '_')
5207 /* Make a copy of scope and return it. */
5209 scope_len
= last
- name
;
5210 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
5212 strncpy (scope
, name
, scope_len
);
5213 scope
[scope_len
] = '\0';
5218 /* Return nonzero if NAME corresponds to a package name. */
5221 is_package_name (const char *name
)
5223 /* Here, We take advantage of the fact that no symbols are generated
5224 for packages, while symbols are generated for each function.
5225 So the condition for NAME represent a package becomes equivalent
5226 to NAME not existing in our list of symbols. There is only one
5227 small complication with library-level functions (see below). */
5231 /* If it is a function that has not been defined at library level,
5232 then we should be able to look it up in the symbols. */
5233 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5236 /* Library-level function names start with "_ada_". See if function
5237 "_ada_" followed by NAME can be found. */
5239 /* Do a quick check that NAME does not contain "__", since library-level
5240 functions names cannot contain "__" in them. */
5241 if (strstr (name
, "__") != NULL
)
5244 fun_name
= xstrprintf ("_ada_%s", name
);
5246 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5249 /* Return nonzero if SYM corresponds to a renaming entity that is
5250 not visible from FUNCTION_NAME. */
5253 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5256 struct cleanup
*old_chain
;
5258 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5261 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5262 old_chain
= make_cleanup (xfree
, scope
);
5264 /* If the rename has been defined in a package, then it is visible. */
5265 if (is_package_name (scope
))
5267 do_cleanups (old_chain
);
5271 /* Check that the rename is in the current function scope by checking
5272 that its name starts with SCOPE. */
5274 /* If the function name starts with "_ada_", it means that it is
5275 a library-level function. Strip this prefix before doing the
5276 comparison, as the encoding for the renaming does not contain
5278 if (startswith (function_name
, "_ada_"))
5282 int is_invisible
= !startswith (function_name
, scope
);
5284 do_cleanups (old_chain
);
5285 return is_invisible
;
5289 /* Remove entries from SYMS that corresponds to a renaming entity that
5290 is not visible from the function associated with CURRENT_BLOCK or
5291 that is superfluous due to the presence of more specific renaming
5292 information. Places surviving symbols in the initial entries of
5293 SYMS and returns the number of surviving symbols.
5296 First, in cases where an object renaming is implemented as a
5297 reference variable, GNAT may produce both the actual reference
5298 variable and the renaming encoding. In this case, we discard the
5301 Second, GNAT emits a type following a specified encoding for each renaming
5302 entity. Unfortunately, STABS currently does not support the definition
5303 of types that are local to a given lexical block, so all renamings types
5304 are emitted at library level. As a consequence, if an application
5305 contains two renaming entities using the same name, and a user tries to
5306 print the value of one of these entities, the result of the ada symbol
5307 lookup will also contain the wrong renaming type.
5309 This function partially covers for this limitation by attempting to
5310 remove from the SYMS list renaming symbols that should be visible
5311 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5312 method with the current information available. The implementation
5313 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5315 - When the user tries to print a rename in a function while there
5316 is another rename entity defined in a package: Normally, the
5317 rename in the function has precedence over the rename in the
5318 package, so the latter should be removed from the list. This is
5319 currently not the case.
5321 - This function will incorrectly remove valid renames if
5322 the CURRENT_BLOCK corresponds to a function which symbol name
5323 has been changed by an "Export" pragma. As a consequence,
5324 the user will be unable to print such rename entities. */
5327 remove_irrelevant_renamings (struct block_symbol
*syms
,
5328 int nsyms
, const struct block
*current_block
)
5330 struct symbol
*current_function
;
5331 const char *current_function_name
;
5333 int is_new_style_renaming
;
5335 /* If there is both a renaming foo___XR... encoded as a variable and
5336 a simple variable foo in the same block, discard the latter.
5337 First, zero out such symbols, then compress. */
5338 is_new_style_renaming
= 0;
5339 for (i
= 0; i
< nsyms
; i
+= 1)
5341 struct symbol
*sym
= syms
[i
].symbol
;
5342 const struct block
*block
= syms
[i
].block
;
5346 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5348 name
= SYMBOL_LINKAGE_NAME (sym
);
5349 suffix
= strstr (name
, "___XR");
5353 int name_len
= suffix
- name
;
5356 is_new_style_renaming
= 1;
5357 for (j
= 0; j
< nsyms
; j
+= 1)
5358 if (i
!= j
&& syms
[j
].symbol
!= NULL
5359 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
5361 && block
== syms
[j
].block
)
5362 syms
[j
].symbol
= NULL
;
5365 if (is_new_style_renaming
)
5369 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5370 if (syms
[j
].symbol
!= NULL
)
5378 /* Extract the function name associated to CURRENT_BLOCK.
5379 Abort if unable to do so. */
5381 if (current_block
== NULL
)
5384 current_function
= block_linkage_function (current_block
);
5385 if (current_function
== NULL
)
5388 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5389 if (current_function_name
== NULL
)
5392 /* Check each of the symbols, and remove it from the list if it is
5393 a type corresponding to a renaming that is out of the scope of
5394 the current block. */
5399 if (ada_parse_renaming (syms
[i
].symbol
, NULL
, NULL
, NULL
)
5400 == ADA_OBJECT_RENAMING
5401 && old_renaming_is_invisible (syms
[i
].symbol
, current_function_name
))
5405 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5406 syms
[j
- 1] = syms
[j
];
5416 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5417 whose name and domain match NAME and DOMAIN respectively.
5418 If no match was found, then extend the search to "enclosing"
5419 routines (in other words, if we're inside a nested function,
5420 search the symbols defined inside the enclosing functions).
5421 If WILD_MATCH_P is nonzero, perform the naming matching in
5422 "wild" mode (see function "wild_match" for more info).
5424 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5427 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5428 const struct block
*block
, domain_enum domain
,
5431 int block_depth
= 0;
5433 while (block
!= NULL
)
5436 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5439 /* If we found a non-function match, assume that's the one. */
5440 if (is_nonfunction (defns_collected (obstackp
, 0),
5441 num_defns_collected (obstackp
)))
5444 block
= BLOCK_SUPERBLOCK (block
);
5447 /* If no luck so far, try to find NAME as a local symbol in some lexically
5448 enclosing subprogram. */
5449 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5450 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5453 /* An object of this type is used as the user_data argument when
5454 calling the map_matching_symbols method. */
5458 struct objfile
*objfile
;
5459 struct obstack
*obstackp
;
5460 struct symbol
*arg_sym
;
5464 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5465 to a list of symbols. DATA0 is a pointer to a struct match_data *
5466 containing the obstack that collects the symbol list, the file that SYM
5467 must come from, a flag indicating whether a non-argument symbol has
5468 been found in the current block, and the last argument symbol
5469 passed in SYM within the current block (if any). When SYM is null,
5470 marking the end of a block, the argument symbol is added if no
5471 other has been found. */
5474 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5476 struct match_data
*data
= (struct match_data
*) data0
;
5480 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5481 add_defn_to_vec (data
->obstackp
,
5482 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5484 data
->found_sym
= 0;
5485 data
->arg_sym
= NULL
;
5489 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5491 else if (SYMBOL_IS_ARGUMENT (sym
))
5492 data
->arg_sym
= sym
;
5495 data
->found_sym
= 1;
5496 add_defn_to_vec (data
->obstackp
,
5497 fixup_symbol_section (sym
, data
->objfile
),
5504 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are targetted
5505 by renamings matching NAME in BLOCK. Add these symbols to OBSTACKP. If
5506 WILD_MATCH_P is nonzero, perform the naming matching in "wild" mode (see
5507 function "wild_match" for more information). Return whether we found such
5511 ada_add_block_renamings (struct obstack
*obstackp
,
5512 const struct block
*block
,
5517 struct using_direct
*renaming
;
5518 int defns_mark
= num_defns_collected (obstackp
);
5520 for (renaming
= block_using (block
);
5522 renaming
= renaming
->next
)
5527 /* Avoid infinite recursions: skip this renaming if we are actually
5528 already traversing it.
5530 Currently, symbol lookup in Ada don't use the namespace machinery from
5531 C++/Fortran support: skip namespace imports that use them. */
5532 if (renaming
->searched
5533 || (renaming
->import_src
!= NULL
5534 && renaming
->import_src
[0] != '\0')
5535 || (renaming
->import_dest
!= NULL
5536 && renaming
->import_dest
[0] != '\0'))
5538 renaming
->searched
= 1;
5540 /* TODO: here, we perform another name-based symbol lookup, which can
5541 pull its own multiple overloads. In theory, we should be able to do
5542 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5543 not a simple name. But in order to do this, we would need to enhance
5544 the DWARF reader to associate a symbol to this renaming, instead of a
5545 name. So, for now, we do something simpler: re-use the C++/Fortran
5546 namespace machinery. */
5547 r_name
= (renaming
->alias
!= NULL
5549 : renaming
->declaration
);
5551 = wild_match_p
? wild_match (r_name
, name
) : strcmp (r_name
, name
);
5552 if (name_match
== 0)
5553 ada_add_all_symbols (obstackp
, block
, renaming
->declaration
, domain
,
5555 renaming
->searched
= 0;
5557 return num_defns_collected (obstackp
) != defns_mark
;
5560 /* Implements compare_names, but only applying the comparision using
5561 the given CASING. */
5564 compare_names_with_case (const char *string1
, const char *string2
,
5565 enum case_sensitivity casing
)
5567 while (*string1
!= '\0' && *string2
!= '\0')
5571 if (isspace (*string1
) || isspace (*string2
))
5572 return strcmp_iw_ordered (string1
, string2
);
5574 if (casing
== case_sensitive_off
)
5576 c1
= tolower (*string1
);
5577 c2
= tolower (*string2
);
5594 return strcmp_iw_ordered (string1
, string2
);
5596 if (*string2
== '\0')
5598 if (is_name_suffix (string1
))
5605 if (*string2
== '(')
5606 return strcmp_iw_ordered (string1
, string2
);
5609 if (casing
== case_sensitive_off
)
5610 return tolower (*string1
) - tolower (*string2
);
5612 return *string1
- *string2
;
5617 /* Compare STRING1 to STRING2, with results as for strcmp.
5618 Compatible with strcmp_iw_ordered in that...
5620 strcmp_iw_ordered (STRING1, STRING2) <= 0
5624 compare_names (STRING1, STRING2) <= 0
5626 (they may differ as to what symbols compare equal). */
5629 compare_names (const char *string1
, const char *string2
)
5633 /* Similar to what strcmp_iw_ordered does, we need to perform
5634 a case-insensitive comparison first, and only resort to
5635 a second, case-sensitive, comparison if the first one was
5636 not sufficient to differentiate the two strings. */
5638 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5640 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5645 /* Add to OBSTACKP all non-local symbols whose name and domain match
5646 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5647 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5650 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5651 domain_enum domain
, int global
,
5654 struct objfile
*objfile
;
5655 struct compunit_symtab
*cu
;
5656 struct match_data data
;
5658 memset (&data
, 0, sizeof data
);
5659 data
.obstackp
= obstackp
;
5661 ALL_OBJFILES (objfile
)
5663 data
.objfile
= objfile
;
5666 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5667 aux_add_nonlocal_symbols
, &data
,
5670 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5671 aux_add_nonlocal_symbols
, &data
,
5672 full_match
, compare_names
);
5674 ALL_OBJFILE_COMPUNITS (objfile
, cu
)
5676 const struct block
*global_block
5677 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5679 if (ada_add_block_renamings (obstackp
, global_block
, name
, domain
,
5685 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5687 ALL_OBJFILES (objfile
)
5689 char *name1
= (char *) alloca (strlen (name
) + sizeof ("_ada_"));
5690 strcpy (name1
, "_ada_");
5691 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5692 data
.objfile
= objfile
;
5693 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5695 aux_add_nonlocal_symbols
,
5697 full_match
, compare_names
);
5702 /* Find symbols in DOMAIN matching NAME, in BLOCK and, if FULL_SEARCH is
5703 non-zero, enclosing scope and in global scopes, returning the number of
5704 matches. Add these to OBSTACKP.
5706 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5707 symbol match within the nest of blocks whose innermost member is BLOCK,
5708 is the one match returned (no other matches in that or
5709 enclosing blocks is returned). If there are any matches in or
5710 surrounding BLOCK, then these alone are returned.
5712 Names prefixed with "standard__" are handled specially: "standard__"
5713 is first stripped off, and only static and global symbols are searched.
5715 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5716 to lookup global symbols. */
5719 ada_add_all_symbols (struct obstack
*obstackp
,
5720 const struct block
*block
,
5724 int *made_global_lookup_p
)
5727 const int wild_match_p
= should_use_wild_match (name
);
5729 if (made_global_lookup_p
)
5730 *made_global_lookup_p
= 0;
5732 /* Special case: If the user specifies a symbol name inside package
5733 Standard, do a non-wild matching of the symbol name without
5734 the "standard__" prefix. This was primarily introduced in order
5735 to allow the user to specifically access the standard exceptions
5736 using, for instance, Standard.Constraint_Error when Constraint_Error
5737 is ambiguous (due to the user defining its own Constraint_Error
5738 entity inside its program). */
5739 if (startswith (name
, "standard__"))
5742 name
= name
+ sizeof ("standard__") - 1;
5745 /* Check the non-global symbols. If we have ANY match, then we're done. */
5750 ada_add_local_symbols (obstackp
, name
, block
, domain
, wild_match_p
);
5753 /* In the !full_search case we're are being called by
5754 ada_iterate_over_symbols, and we don't want to search
5756 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5759 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5763 /* No non-global symbols found. Check our cache to see if we have
5764 already performed this search before. If we have, then return
5767 if (lookup_cached_symbol (name
, domain
, &sym
, &block
))
5770 add_defn_to_vec (obstackp
, sym
, block
);
5774 if (made_global_lookup_p
)
5775 *made_global_lookup_p
= 1;
5777 /* Search symbols from all global blocks. */
5779 add_nonlocal_symbols (obstackp
, name
, domain
, 1, wild_match_p
);
5781 /* Now add symbols from all per-file blocks if we've gotten no hits
5782 (not strictly correct, but perhaps better than an error). */
5784 if (num_defns_collected (obstackp
) == 0)
5785 add_nonlocal_symbols (obstackp
, name
, domain
, 0, wild_match_p
);
5788 /* Find symbols in DOMAIN matching NAME, in BLOCK and, if full_search is
5789 non-zero, enclosing scope and in global scopes, returning the number of
5791 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5792 indicating the symbols found and the blocks and symbol tables (if
5793 any) in which they were found. This vector is transient---good only to
5794 the next call of ada_lookup_symbol_list.
5796 When full_search is non-zero, any non-function/non-enumeral
5797 symbol match within the nest of blocks whose innermost member is BLOCK,
5798 is the one match returned (no other matches in that or
5799 enclosing blocks is returned). If there are any matches in or
5800 surrounding BLOCK, then these alone are returned.
5802 Names prefixed with "standard__" are handled specially: "standard__"
5803 is first stripped off, and only static and global symbols are searched. */
5806 ada_lookup_symbol_list_worker (const char *name
, const struct block
*block
,
5808 struct block_symbol
**results
,
5811 const int wild_match_p
= should_use_wild_match (name
);
5812 int syms_from_global_search
;
5815 obstack_free (&symbol_list_obstack
, NULL
);
5816 obstack_init (&symbol_list_obstack
);
5817 ada_add_all_symbols (&symbol_list_obstack
, block
, name
, domain
,
5818 full_search
, &syms_from_global_search
);
5820 ndefns
= num_defns_collected (&symbol_list_obstack
);
5821 *results
= defns_collected (&symbol_list_obstack
, 1);
5823 ndefns
= remove_extra_symbols (*results
, ndefns
);
5825 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5826 cache_symbol (name
, domain
, NULL
, NULL
);
5828 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5829 cache_symbol (name
, domain
, (*results
)[0].symbol
, (*results
)[0].block
);
5831 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block
);
5835 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5836 in global scopes, returning the number of matches, and setting *RESULTS
5837 to a vector of (SYM,BLOCK) tuples.
5838 See ada_lookup_symbol_list_worker for further details. */
5841 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5842 domain_enum domain
, struct block_symbol
**results
)
5844 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5847 /* Implementation of the la_iterate_over_symbols method. */
5850 ada_iterate_over_symbols
5851 (const struct block
*block
, const char *name
, domain_enum domain
,
5852 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5855 struct block_symbol
*results
;
5857 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5858 for (i
= 0; i
< ndefs
; ++i
)
5860 if (!callback (results
[i
].symbol
))
5865 /* If NAME is the name of an entity, return a string that should
5866 be used to look that entity up in Ada units.
5868 NAME can have any form that the "break" or "print" commands might
5869 recognize. In other words, it does not have to be the "natural"
5870 name, or the "encoded" name. */
5873 ada_name_for_lookup (const char *name
)
5875 int nlen
= strlen (name
);
5877 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5878 return std::string (name
+ 1, nlen
- 2);
5880 return ada_encode (ada_fold_name (name
));
5883 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5884 to 1, but choosing the first symbol found if there are multiple
5887 The result is stored in *INFO, which must be non-NULL.
5888 If no match is found, INFO->SYM is set to NULL. */
5891 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5893 struct block_symbol
*info
)
5895 struct block_symbol
*candidates
;
5898 gdb_assert (info
!= NULL
);
5899 memset (info
, 0, sizeof (struct block_symbol
));
5901 n_candidates
= ada_lookup_symbol_list (name
, block
, domain
, &candidates
);
5902 if (n_candidates
== 0)
5905 *info
= candidates
[0];
5906 info
->symbol
= fixup_symbol_section (info
->symbol
, NULL
);
5909 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5910 scope and in global scopes, or NULL if none. NAME is folded and
5911 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5912 choosing the first symbol if there are multiple choices.
5913 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5916 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5917 domain_enum domain
, int *is_a_field_of_this
)
5919 struct block_symbol info
;
5921 if (is_a_field_of_this
!= NULL
)
5922 *is_a_field_of_this
= 0;
5924 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5925 block0
, domain
, &info
);
5929 static struct block_symbol
5930 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5932 const struct block
*block
,
5933 const domain_enum domain
)
5935 struct block_symbol sym
;
5937 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5938 if (sym
.symbol
!= NULL
)
5941 /* If we haven't found a match at this point, try the primitive
5942 types. In other languages, this search is performed before
5943 searching for global symbols in order to short-circuit that
5944 global-symbol search if it happens that the name corresponds
5945 to a primitive type. But we cannot do the same in Ada, because
5946 it is perfectly legitimate for a program to declare a type which
5947 has the same name as a standard type. If looking up a type in
5948 that situation, we have traditionally ignored the primitive type
5949 in favor of user-defined types. This is why, unlike most other
5950 languages, we search the primitive types this late and only after
5951 having searched the global symbols without success. */
5953 if (domain
== VAR_DOMAIN
)
5955 struct gdbarch
*gdbarch
;
5958 gdbarch
= target_gdbarch ();
5960 gdbarch
= block_gdbarch (block
);
5961 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5962 if (sym
.symbol
!= NULL
)
5966 return (struct block_symbol
) {NULL
, NULL
};
5970 /* True iff STR is a possible encoded suffix of a normal Ada name
5971 that is to be ignored for matching purposes. Suffixes of parallel
5972 names (e.g., XVE) are not included here. Currently, the possible suffixes
5973 are given by any of the regular expressions:
5975 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5976 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5977 TKB [subprogram suffix for task bodies]
5978 _E[0-9]+[bs]$ [protected object entry suffixes]
5979 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5981 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5982 match is performed. This sequence is used to differentiate homonyms,
5983 is an optional part of a valid name suffix. */
5986 is_name_suffix (const char *str
)
5989 const char *matching
;
5990 const int len
= strlen (str
);
5992 /* Skip optional leading __[0-9]+. */
5994 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5997 while (isdigit (str
[0]))
6003 if (str
[0] == '.' || str
[0] == '$')
6006 while (isdigit (matching
[0]))
6008 if (matching
[0] == '\0')
6014 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
6017 while (isdigit (matching
[0]))
6019 if (matching
[0] == '\0')
6023 /* "TKB" suffixes are used for subprograms implementing task bodies. */
6025 if (strcmp (str
, "TKB") == 0)
6029 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
6030 with a N at the end. Unfortunately, the compiler uses the same
6031 convention for other internal types it creates. So treating
6032 all entity names that end with an "N" as a name suffix causes
6033 some regressions. For instance, consider the case of an enumerated
6034 type. To support the 'Image attribute, it creates an array whose
6036 Having a single character like this as a suffix carrying some
6037 information is a bit risky. Perhaps we should change the encoding
6038 to be something like "_N" instead. In the meantime, do not do
6039 the following check. */
6040 /* Protected Object Subprograms */
6041 if (len
== 1 && str
[0] == 'N')
6046 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
6049 while (isdigit (matching
[0]))
6051 if ((matching
[0] == 'b' || matching
[0] == 's')
6052 && matching
[1] == '\0')
6056 /* ??? We should not modify STR directly, as we are doing below. This
6057 is fine in this case, but may become problematic later if we find
6058 that this alternative did not work, and want to try matching
6059 another one from the begining of STR. Since we modified it, we
6060 won't be able to find the begining of the string anymore! */
6064 while (str
[0] != '_' && str
[0] != '\0')
6066 if (str
[0] != 'n' && str
[0] != 'b')
6072 if (str
[0] == '\000')
6077 if (str
[1] != '_' || str
[2] == '\000')
6081 if (strcmp (str
+ 3, "JM") == 0)
6083 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6084 the LJM suffix in favor of the JM one. But we will
6085 still accept LJM as a valid suffix for a reasonable
6086 amount of time, just to allow ourselves to debug programs
6087 compiled using an older version of GNAT. */
6088 if (strcmp (str
+ 3, "LJM") == 0)
6092 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6093 || str
[4] == 'U' || str
[4] == 'P')
6095 if (str
[4] == 'R' && str
[5] != 'T')
6099 if (!isdigit (str
[2]))
6101 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6102 if (!isdigit (str
[k
]) && str
[k
] != '_')
6106 if (str
[0] == '$' && isdigit (str
[1]))
6108 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6109 if (!isdigit (str
[k
]) && str
[k
] != '_')
6116 /* Return non-zero if the string starting at NAME and ending before
6117 NAME_END contains no capital letters. */
6120 is_valid_name_for_wild_match (const char *name0
)
6122 const char *decoded_name
= ada_decode (name0
);
6125 /* If the decoded name starts with an angle bracket, it means that
6126 NAME0 does not follow the GNAT encoding format. It should then
6127 not be allowed as a possible wild match. */
6128 if (decoded_name
[0] == '<')
6131 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6132 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6138 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6139 that could start a simple name. Assumes that *NAMEP points into
6140 the string beginning at NAME0. */
6143 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6145 const char *name
= *namep
;
6155 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6158 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6163 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6164 || name
[2] == target0
))
6172 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6182 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
6183 informational suffixes of NAME (i.e., for which is_name_suffix is
6184 true). Assumes that PATN is a lower-cased Ada simple name. */
6187 wild_match (const char *name
, const char *patn
)
6190 const char *name0
= name
;
6194 const char *match
= name
;
6198 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6201 if (*p
== '\0' && is_name_suffix (name
))
6202 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
6204 if (name
[-1] == '_')
6207 if (!advance_wild_match (&name
, name0
, *patn
))
6212 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
6213 informational suffix. */
6216 full_match (const char *sym_name
, const char *search_name
)
6218 return !match_name (sym_name
, search_name
, 0);
6222 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
6223 vector *defn_symbols, updating the list of symbols in OBSTACKP
6224 (if necessary). If WILD, treat as NAME with a wildcard prefix.
6225 OBJFILE is the section containing BLOCK. */
6228 ada_add_block_symbols (struct obstack
*obstackp
,
6229 const struct block
*block
, const char *name
,
6230 domain_enum domain
, struct objfile
*objfile
,
6233 struct block_iterator iter
;
6234 int name_len
= strlen (name
);
6235 /* A matching argument symbol, if any. */
6236 struct symbol
*arg_sym
;
6237 /* Set true when we find a matching non-argument symbol. */
6245 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
6246 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
6248 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6249 SYMBOL_DOMAIN (sym
), domain
)
6250 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
6252 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
6254 else if (SYMBOL_IS_ARGUMENT (sym
))
6259 add_defn_to_vec (obstackp
,
6260 fixup_symbol_section (sym
, objfile
),
6268 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
6269 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
6271 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6272 SYMBOL_DOMAIN (sym
), domain
))
6274 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6276 if (SYMBOL_IS_ARGUMENT (sym
))
6281 add_defn_to_vec (obstackp
,
6282 fixup_symbol_section (sym
, objfile
),
6290 /* Handle renamings. */
6292 if (ada_add_block_renamings (obstackp
, block
, name
, domain
, wild
))
6295 if (!found_sym
&& arg_sym
!= NULL
)
6297 add_defn_to_vec (obstackp
,
6298 fixup_symbol_section (arg_sym
, objfile
),
6307 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6309 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6310 SYMBOL_DOMAIN (sym
), domain
))
6314 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6317 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6319 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6324 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6326 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6328 if (SYMBOL_IS_ARGUMENT (sym
))
6333 add_defn_to_vec (obstackp
,
6334 fixup_symbol_section (sym
, objfile
),
6342 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6343 They aren't parameters, right? */
6344 if (!found_sym
&& arg_sym
!= NULL
)
6346 add_defn_to_vec (obstackp
,
6347 fixup_symbol_section (arg_sym
, objfile
),
6354 /* Symbol Completion */
6356 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
6357 name in a form that's appropriate for the completion. The result
6358 does not need to be deallocated, but is only good until the next call.
6360 TEXT_LEN is equal to the length of TEXT.
6361 Perform a wild match if WILD_MATCH_P is set.
6362 ENCODED_P should be set if TEXT represents the start of a symbol name
6363 in its encoded form. */
6366 symbol_completion_match (const char *sym_name
,
6367 const char *text
, int text_len
,
6368 int wild_match_p
, int encoded_p
)
6370 const int verbatim_match
= (text
[0] == '<');
6375 /* Strip the leading angle bracket. */
6380 /* First, test against the fully qualified name of the symbol. */
6382 if (strncmp (sym_name
, text
, text_len
) == 0)
6385 if (match
&& !encoded_p
)
6387 /* One needed check before declaring a positive match is to verify
6388 that iff we are doing a verbatim match, the decoded version
6389 of the symbol name starts with '<'. Otherwise, this symbol name
6390 is not a suitable completion. */
6391 const char *sym_name_copy
= sym_name
;
6392 int has_angle_bracket
;
6394 sym_name
= ada_decode (sym_name
);
6395 has_angle_bracket
= (sym_name
[0] == '<');
6396 match
= (has_angle_bracket
== verbatim_match
);
6397 sym_name
= sym_name_copy
;
6400 if (match
&& !verbatim_match
)
6402 /* When doing non-verbatim match, another check that needs to
6403 be done is to verify that the potentially matching symbol name
6404 does not include capital letters, because the ada-mode would
6405 not be able to understand these symbol names without the
6406 angle bracket notation. */
6409 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6414 /* Second: Try wild matching... */
6416 if (!match
&& wild_match_p
)
6418 /* Since we are doing wild matching, this means that TEXT
6419 may represent an unqualified symbol name. We therefore must
6420 also compare TEXT against the unqualified name of the symbol. */
6421 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6423 if (strncmp (sym_name
, text
, text_len
) == 0)
6427 /* Finally: If we found a mach, prepare the result to return. */
6433 sym_name
= add_angle_brackets (sym_name
);
6436 sym_name
= ada_decode (sym_name
);
6441 /* A companion function to ada_collect_symbol_completion_matches().
6442 Check if SYM_NAME represents a symbol which name would be suitable
6443 to complete TEXT (TEXT_LEN is the length of TEXT), in which case it
6444 is added as a completion match to TRACKER.
6446 ORIG_TEXT is the string original string from the user command
6447 that needs to be completed. WORD is the entire command on which
6448 completion should be performed. These two parameters are used to
6449 determine which part of the symbol name should be added to the
6451 if WILD_MATCH_P is set, then wild matching is performed.
6452 ENCODED_P should be set if TEXT represents a symbol name in its
6453 encoded formed (in which case the completion should also be
6457 symbol_completion_add (completion_tracker
&tracker
,
6458 const char *sym_name
,
6459 const char *text
, int text_len
,
6460 const char *orig_text
, const char *word
,
6461 int wild_match_p
, int encoded_p
)
6463 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6464 wild_match_p
, encoded_p
);
6470 /* We found a match, so add the appropriate completion to the given
6473 if (word
== orig_text
)
6475 completion
= (char *) xmalloc (strlen (match
) + 5);
6476 strcpy (completion
, match
);
6478 else if (word
> orig_text
)
6480 /* Return some portion of sym_name. */
6481 completion
= (char *) xmalloc (strlen (match
) + 5);
6482 strcpy (completion
, match
+ (word
- orig_text
));
6486 /* Return some of ORIG_TEXT plus sym_name. */
6487 completion
= (char *) xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6488 strncpy (completion
, word
, orig_text
- word
);
6489 completion
[orig_text
- word
] = '\0';
6490 strcat (completion
, match
);
6493 tracker
.add_completion (gdb::unique_xmalloc_ptr
<char> (completion
));
6496 /* Add the list of possible symbol names completing TEXT0 to TRACKER.
6497 WORD is the entire command on which completion is made. */
6500 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6501 complete_symbol_mode mode
,
6502 const char *text0
, const char *word
,
6503 enum type_code code
)
6510 struct compunit_symtab
*s
;
6511 struct minimal_symbol
*msymbol
;
6512 struct objfile
*objfile
;
6513 const struct block
*b
, *surrounding_static_block
= 0;
6515 struct block_iterator iter
;
6516 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6518 gdb_assert (code
== TYPE_CODE_UNDEF
);
6520 if (text0
[0] == '<')
6522 text
= xstrdup (text0
);
6523 make_cleanup (xfree
, text
);
6524 text_len
= strlen (text
);
6530 text
= xstrdup (ada_encode (text0
));
6531 make_cleanup (xfree
, text
);
6532 text_len
= strlen (text
);
6533 for (i
= 0; i
< text_len
; i
++)
6534 text
[i
] = tolower (text
[i
]);
6536 encoded_p
= (strstr (text0
, "__") != NULL
);
6537 /* If the name contains a ".", then the user is entering a fully
6538 qualified entity name, and the match must not be done in wild
6539 mode. Similarly, if the user wants to complete what looks like
6540 an encoded name, the match must not be done in wild mode. */
6541 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6544 /* First, look at the partial symtab symbols. */
6545 expand_symtabs_matching (NULL
,
6546 [&] (const char *symname
)
6548 return symbol_completion_match (symname
,
6556 /* At this point scan through the misc symbol vectors and add each
6557 symbol you find to the list. Eventually we want to ignore
6558 anything that isn't a text symbol (everything else will be
6559 handled by the psymtab code above). */
6561 ALL_MSYMBOLS (objfile
, msymbol
)
6564 symbol_completion_add (tracker
, MSYMBOL_LINKAGE_NAME (msymbol
),
6565 text
, text_len
, text0
, word
, wild_match_p
,
6569 /* Search upwards from currently selected frame (so that we can
6570 complete on local vars. */
6572 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6574 if (!BLOCK_SUPERBLOCK (b
))
6575 surrounding_static_block
= b
; /* For elmin of dups */
6577 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6579 symbol_completion_add (tracker
, SYMBOL_LINKAGE_NAME (sym
),
6580 text
, text_len
, text0
, word
,
6581 wild_match_p
, encoded_p
);
6585 /* Go through the symtabs and check the externs and statics for
6586 symbols which match. */
6588 ALL_COMPUNITS (objfile
, s
)
6591 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6592 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6594 symbol_completion_add (tracker
, SYMBOL_LINKAGE_NAME (sym
),
6595 text
, text_len
, text0
, word
,
6596 wild_match_p
, encoded_p
);
6600 ALL_COMPUNITS (objfile
, s
)
6603 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6604 /* Don't do this block twice. */
6605 if (b
== surrounding_static_block
)
6607 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6609 symbol_completion_add (tracker
, SYMBOL_LINKAGE_NAME (sym
),
6610 text
, text_len
, text0
, word
,
6611 wild_match_p
, encoded_p
);
6615 do_cleanups (old_chain
);
6620 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6621 for tagged types. */
6624 ada_is_dispatch_table_ptr_type (struct type
*type
)
6628 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6631 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6635 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6638 /* Return non-zero if TYPE is an interface tag. */
6641 ada_is_interface_tag (struct type
*type
)
6643 const char *name
= TYPE_NAME (type
);
6648 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6651 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6652 to be invisible to users. */
6655 ada_is_ignored_field (struct type
*type
, int field_num
)
6657 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6660 /* Check the name of that field. */
6662 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6664 /* Anonymous field names should not be printed.
6665 brobecker/2007-02-20: I don't think this can actually happen
6666 but we don't want to print the value of annonymous fields anyway. */
6670 /* Normally, fields whose name start with an underscore ("_")
6671 are fields that have been internally generated by the compiler,
6672 and thus should not be printed. The "_parent" field is special,
6673 however: This is a field internally generated by the compiler
6674 for tagged types, and it contains the components inherited from
6675 the parent type. This field should not be printed as is, but
6676 should not be ignored either. */
6677 if (name
[0] == '_' && !startswith (name
, "_parent"))
6681 /* If this is the dispatch table of a tagged type or an interface tag,
6683 if (ada_is_tagged_type (type
, 1)
6684 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6685 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6688 /* Not a special field, so it should not be ignored. */
6692 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6693 pointer or reference type whose ultimate target has a tag field. */
6696 ada_is_tagged_type (struct type
*type
, int refok
)
6698 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6701 /* True iff TYPE represents the type of X'Tag */
6704 ada_is_tag_type (struct type
*type
)
6706 type
= ada_check_typedef (type
);
6708 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6712 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6714 return (name
!= NULL
6715 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6719 /* The type of the tag on VAL. */
6722 ada_tag_type (struct value
*val
)
6724 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6727 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6728 retired at Ada 05). */
6731 is_ada95_tag (struct value
*tag
)
6733 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6736 /* The value of the tag on VAL. */
6739 ada_value_tag (struct value
*val
)
6741 return ada_value_struct_elt (val
, "_tag", 0);
6744 /* The value of the tag on the object of type TYPE whose contents are
6745 saved at VALADDR, if it is non-null, or is at memory address
6748 static struct value
*
6749 value_tag_from_contents_and_address (struct type
*type
,
6750 const gdb_byte
*valaddr
,
6753 int tag_byte_offset
;
6754 struct type
*tag_type
;
6756 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6759 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6761 : valaddr
+ tag_byte_offset
);
6762 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6764 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6769 static struct type
*
6770 type_from_tag (struct value
*tag
)
6772 const char *type_name
= ada_tag_name (tag
);
6774 if (type_name
!= NULL
)
6775 return ada_find_any_type (ada_encode (type_name
));
6779 /* Given a value OBJ of a tagged type, return a value of this
6780 type at the base address of the object. The base address, as
6781 defined in Ada.Tags, it is the address of the primary tag of
6782 the object, and therefore where the field values of its full
6783 view can be fetched. */
6786 ada_tag_value_at_base_address (struct value
*obj
)
6789 LONGEST offset_to_top
= 0;
6790 struct type
*ptr_type
, *obj_type
;
6792 CORE_ADDR base_address
;
6794 obj_type
= value_type (obj
);
6796 /* It is the responsability of the caller to deref pointers. */
6798 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6799 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6802 tag
= ada_value_tag (obj
);
6806 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6808 if (is_ada95_tag (tag
))
6811 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6812 ptr_type
= lookup_pointer_type (ptr_type
);
6813 val
= value_cast (ptr_type
, tag
);
6817 /* It is perfectly possible that an exception be raised while
6818 trying to determine the base address, just like for the tag;
6819 see ada_tag_name for more details. We do not print the error
6820 message for the same reason. */
6824 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6827 CATCH (e
, RETURN_MASK_ERROR
)
6833 /* If offset is null, nothing to do. */
6835 if (offset_to_top
== 0)
6838 /* -1 is a special case in Ada.Tags; however, what should be done
6839 is not quite clear from the documentation. So do nothing for
6842 if (offset_to_top
== -1)
6845 base_address
= value_address (obj
) - offset_to_top
;
6846 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6848 /* Make sure that we have a proper tag at the new address.
6849 Otherwise, offset_to_top is bogus (which can happen when
6850 the object is not initialized yet). */
6855 obj_type
= type_from_tag (tag
);
6860 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6863 /* Return the "ada__tags__type_specific_data" type. */
6865 static struct type
*
6866 ada_get_tsd_type (struct inferior
*inf
)
6868 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6870 if (data
->tsd_type
== 0)
6871 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6872 return data
->tsd_type
;
6875 /* Return the TSD (type-specific data) associated to the given TAG.
6876 TAG is assumed to be the tag of a tagged-type entity.
6878 May return NULL if we are unable to get the TSD. */
6880 static struct value
*
6881 ada_get_tsd_from_tag (struct value
*tag
)
6886 /* First option: The TSD is simply stored as a field of our TAG.
6887 Only older versions of GNAT would use this format, but we have
6888 to test it first, because there are no visible markers for
6889 the current approach except the absence of that field. */
6891 val
= ada_value_struct_elt (tag
, "tsd", 1);
6895 /* Try the second representation for the dispatch table (in which
6896 there is no explicit 'tsd' field in the referent of the tag pointer,
6897 and instead the tsd pointer is stored just before the dispatch
6900 type
= ada_get_tsd_type (current_inferior());
6903 type
= lookup_pointer_type (lookup_pointer_type (type
));
6904 val
= value_cast (type
, tag
);
6907 return value_ind (value_ptradd (val
, -1));
6910 /* Given the TSD of a tag (type-specific data), return a string
6911 containing the name of the associated type.
6913 The returned value is good until the next call. May return NULL
6914 if we are unable to determine the tag name. */
6917 ada_tag_name_from_tsd (struct value
*tsd
)
6919 static char name
[1024];
6923 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6926 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6927 for (p
= name
; *p
!= '\0'; p
+= 1)
6933 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6936 Return NULL if the TAG is not an Ada tag, or if we were unable to
6937 determine the name of that tag. The result is good until the next
6941 ada_tag_name (struct value
*tag
)
6945 if (!ada_is_tag_type (value_type (tag
)))
6948 /* It is perfectly possible that an exception be raised while trying
6949 to determine the TAG's name, even under normal circumstances:
6950 The associated variable may be uninitialized or corrupted, for
6951 instance. We do not let any exception propagate past this point.
6952 instead we return NULL.
6954 We also do not print the error message either (which often is very
6955 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6956 the caller print a more meaningful message if necessary. */
6959 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6962 name
= ada_tag_name_from_tsd (tsd
);
6964 CATCH (e
, RETURN_MASK_ERROR
)
6972 /* The parent type of TYPE, or NULL if none. */
6975 ada_parent_type (struct type
*type
)
6979 type
= ada_check_typedef (type
);
6981 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6984 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6985 if (ada_is_parent_field (type
, i
))
6987 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6989 /* If the _parent field is a pointer, then dereference it. */
6990 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6991 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6992 /* If there is a parallel XVS type, get the actual base type. */
6993 parent_type
= ada_get_base_type (parent_type
);
6995 return ada_check_typedef (parent_type
);
7001 /* True iff field number FIELD_NUM of structure type TYPE contains the
7002 parent-type (inherited) fields of a derived type. Assumes TYPE is
7003 a structure type with at least FIELD_NUM+1 fields. */
7006 ada_is_parent_field (struct type
*type
, int field_num
)
7008 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
7010 return (name
!= NULL
7011 && (startswith (name
, "PARENT")
7012 || startswith (name
, "_parent")));
7015 /* True iff field number FIELD_NUM of structure type TYPE is a
7016 transparent wrapper field (which should be silently traversed when doing
7017 field selection and flattened when printing). Assumes TYPE is a
7018 structure type with at least FIELD_NUM+1 fields. Such fields are always
7022 ada_is_wrapper_field (struct type
*type
, int field_num
)
7024 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7026 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
7028 /* This happens in functions with "out" or "in out" parameters
7029 which are passed by copy. For such functions, GNAT describes
7030 the function's return type as being a struct where the return
7031 value is in a field called RETVAL, and where the other "out"
7032 or "in out" parameters are fields of that struct. This is not
7037 return (name
!= NULL
7038 && (startswith (name
, "PARENT")
7039 || strcmp (name
, "REP") == 0
7040 || startswith (name
, "_parent")
7041 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
7044 /* True iff field number FIELD_NUM of structure or union type TYPE
7045 is a variant wrapper. Assumes TYPE is a structure type with at least
7046 FIELD_NUM+1 fields. */
7049 ada_is_variant_part (struct type
*type
, int field_num
)
7051 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
7053 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
7054 || (is_dynamic_field (type
, field_num
)
7055 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
7056 == TYPE_CODE_UNION
)));
7059 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
7060 whose discriminants are contained in the record type OUTER_TYPE,
7061 returns the type of the controlling discriminant for the variant.
7062 May return NULL if the type could not be found. */
7065 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
7067 const char *name
= ada_variant_discrim_name (var_type
);
7069 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
7072 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
7073 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
7074 represents a 'when others' clause; otherwise 0. */
7077 ada_is_others_clause (struct type
*type
, int field_num
)
7079 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7081 return (name
!= NULL
&& name
[0] == 'O');
7084 /* Assuming that TYPE0 is the type of the variant part of a record,
7085 returns the name of the discriminant controlling the variant.
7086 The value is valid until the next call to ada_variant_discrim_name. */
7089 ada_variant_discrim_name (struct type
*type0
)
7091 static char *result
= NULL
;
7092 static size_t result_len
= 0;
7095 const char *discrim_end
;
7096 const char *discrim_start
;
7098 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
7099 type
= TYPE_TARGET_TYPE (type0
);
7103 name
= ada_type_name (type
);
7105 if (name
== NULL
|| name
[0] == '\000')
7108 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7111 if (startswith (discrim_end
, "___XVN"))
7114 if (discrim_end
== name
)
7117 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7120 if (discrim_start
== name
+ 1)
7122 if ((discrim_start
> name
+ 3
7123 && startswith (discrim_start
- 3, "___"))
7124 || discrim_start
[-1] == '.')
7128 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7129 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7130 result
[discrim_end
- discrim_start
] = '\0';
7134 /* Scan STR for a subtype-encoded number, beginning at position K.
7135 Put the position of the character just past the number scanned in
7136 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7137 Return 1 if there was a valid number at the given position, and 0
7138 otherwise. A "subtype-encoded" number consists of the absolute value
7139 in decimal, followed by the letter 'm' to indicate a negative number.
7140 Assumes 0m does not occur. */
7143 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7147 if (!isdigit (str
[k
]))
7150 /* Do it the hard way so as not to make any assumption about
7151 the relationship of unsigned long (%lu scan format code) and
7154 while (isdigit (str
[k
]))
7156 RU
= RU
* 10 + (str
[k
] - '0');
7163 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7169 /* NOTE on the above: Technically, C does not say what the results of
7170 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7171 number representable as a LONGEST (although either would probably work
7172 in most implementations). When RU>0, the locution in the then branch
7173 above is always equivalent to the negative of RU. */
7180 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7181 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7182 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7185 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7187 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7201 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7211 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7212 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7214 if (val
>= L
&& val
<= U
)
7226 /* FIXME: Lots of redundancy below. Try to consolidate. */
7228 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7229 ARG_TYPE, extract and return the value of one of its (non-static)
7230 fields. FIELDNO says which field. Differs from value_primitive_field
7231 only in that it can handle packed values of arbitrary type. */
7233 static struct value
*
7234 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7235 struct type
*arg_type
)
7239 arg_type
= ada_check_typedef (arg_type
);
7240 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7242 /* Handle packed fields. */
7244 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
7246 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7247 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7249 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7250 offset
+ bit_pos
/ 8,
7251 bit_pos
% 8, bit_size
, type
);
7254 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7257 /* Find field with name NAME in object of type TYPE. If found,
7258 set the following for each argument that is non-null:
7259 - *FIELD_TYPE_P to the field's type;
7260 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7261 an object of that type;
7262 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7263 - *BIT_SIZE_P to its size in bits if the field is packed, and
7265 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7266 fields up to but not including the desired field, or by the total
7267 number of fields if not found. A NULL value of NAME never
7268 matches; the function just counts visible fields in this case.
7270 Returns 1 if found, 0 otherwise. */
7273 find_struct_field (const char *name
, struct type
*type
, int offset
,
7274 struct type
**field_type_p
,
7275 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7280 type
= ada_check_typedef (type
);
7282 if (field_type_p
!= NULL
)
7283 *field_type_p
= NULL
;
7284 if (byte_offset_p
!= NULL
)
7286 if (bit_offset_p
!= NULL
)
7288 if (bit_size_p
!= NULL
)
7291 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7293 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7294 int fld_offset
= offset
+ bit_pos
/ 8;
7295 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7297 if (t_field_name
== NULL
)
7300 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7302 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7304 if (field_type_p
!= NULL
)
7305 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7306 if (byte_offset_p
!= NULL
)
7307 *byte_offset_p
= fld_offset
;
7308 if (bit_offset_p
!= NULL
)
7309 *bit_offset_p
= bit_pos
% 8;
7310 if (bit_size_p
!= NULL
)
7311 *bit_size_p
= bit_size
;
7314 else if (ada_is_wrapper_field (type
, i
))
7316 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7317 field_type_p
, byte_offset_p
, bit_offset_p
,
7318 bit_size_p
, index_p
))
7321 else if (ada_is_variant_part (type
, i
))
7323 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7326 struct type
*field_type
7327 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7329 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7331 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7333 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7334 field_type_p
, byte_offset_p
,
7335 bit_offset_p
, bit_size_p
, index_p
))
7339 else if (index_p
!= NULL
)
7345 /* Number of user-visible fields in record type TYPE. */
7348 num_visible_fields (struct type
*type
)
7353 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7357 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7358 and search in it assuming it has (class) type TYPE.
7359 If found, return value, else return NULL.
7361 Searches recursively through wrapper fields (e.g., '_parent'). */
7363 static struct value
*
7364 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7369 type
= ada_check_typedef (type
);
7370 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7372 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7374 if (t_field_name
== NULL
)
7377 else if (field_name_match (t_field_name
, name
))
7378 return ada_value_primitive_field (arg
, offset
, i
, type
);
7380 else if (ada_is_wrapper_field (type
, i
))
7382 struct value
*v
= /* Do not let indent join lines here. */
7383 ada_search_struct_field (name
, arg
,
7384 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7385 TYPE_FIELD_TYPE (type
, i
));
7391 else if (ada_is_variant_part (type
, i
))
7393 /* PNH: Do we ever get here? See find_struct_field. */
7395 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7397 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7399 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7401 struct value
*v
= ada_search_struct_field
/* Force line
7404 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7405 TYPE_FIELD_TYPE (field_type
, j
));
7415 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7416 int, struct type
*);
7419 /* Return field #INDEX in ARG, where the index is that returned by
7420 * find_struct_field through its INDEX_P argument. Adjust the address
7421 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7422 * If found, return value, else return NULL. */
7424 static struct value
*
7425 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7428 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7432 /* Auxiliary function for ada_index_struct_field. Like
7433 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7436 static struct value
*
7437 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7441 type
= ada_check_typedef (type
);
7443 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7445 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7447 else if (ada_is_wrapper_field (type
, i
))
7449 struct value
*v
= /* Do not let indent join lines here. */
7450 ada_index_struct_field_1 (index_p
, arg
,
7451 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7452 TYPE_FIELD_TYPE (type
, i
));
7458 else if (ada_is_variant_part (type
, i
))
7460 /* PNH: Do we ever get here? See ada_search_struct_field,
7461 find_struct_field. */
7462 error (_("Cannot assign this kind of variant record"));
7464 else if (*index_p
== 0)
7465 return ada_value_primitive_field (arg
, offset
, i
, type
);
7472 /* Given ARG, a value of type (pointer or reference to a)*
7473 structure/union, extract the component named NAME from the ultimate
7474 target structure/union and return it as a value with its
7477 The routine searches for NAME among all members of the structure itself
7478 and (recursively) among all members of any wrapper members
7481 If NO_ERR, then simply return NULL in case of error, rather than
7485 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
7487 struct type
*t
, *t1
;
7491 t1
= t
= ada_check_typedef (value_type (arg
));
7492 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7494 t1
= TYPE_TARGET_TYPE (t
);
7497 t1
= ada_check_typedef (t1
);
7498 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7500 arg
= coerce_ref (arg
);
7505 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7507 t1
= TYPE_TARGET_TYPE (t
);
7510 t1
= ada_check_typedef (t1
);
7511 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7513 arg
= value_ind (arg
);
7520 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7524 v
= ada_search_struct_field (name
, arg
, 0, t
);
7527 int bit_offset
, bit_size
, byte_offset
;
7528 struct type
*field_type
;
7531 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7532 address
= value_address (ada_value_ind (arg
));
7534 address
= value_address (ada_coerce_ref (arg
));
7536 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7537 if (find_struct_field (name
, t1
, 0,
7538 &field_type
, &byte_offset
, &bit_offset
,
7543 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7544 arg
= ada_coerce_ref (arg
);
7546 arg
= ada_value_ind (arg
);
7547 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7548 bit_offset
, bit_size
,
7552 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7556 if (v
!= NULL
|| no_err
)
7559 error (_("There is no member named %s."), name
);
7565 error (_("Attempt to extract a component of "
7566 "a value that is not a record."));
7569 /* Return a string representation of type TYPE. */
7572 type_as_string (struct type
*type
)
7574 string_file tmp_stream
;
7576 type_print (type
, "", &tmp_stream
, -1);
7578 return std::move (tmp_stream
.string ());
7581 /* Given a type TYPE, look up the type of the component of type named NAME.
7582 If DISPP is non-null, add its byte displacement from the beginning of a
7583 structure (pointed to by a value) of type TYPE to *DISPP (does not
7584 work for packed fields).
7586 Matches any field whose name has NAME as a prefix, possibly
7589 TYPE can be either a struct or union. If REFOK, TYPE may also
7590 be a (pointer or reference)+ to a struct or union, and the
7591 ultimate target type will be searched.
7593 Looks recursively into variant clauses and parent types.
7595 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7596 TYPE is not a type of the right kind. */
7598 static struct type
*
7599 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7607 if (refok
&& type
!= NULL
)
7610 type
= ada_check_typedef (type
);
7611 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7612 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7614 type
= TYPE_TARGET_TYPE (type
);
7618 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7619 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7624 error (_("Type %s is not a structure or union type"),
7625 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7628 type
= to_static_fixed_type (type
);
7630 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7632 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7635 if (t_field_name
== NULL
)
7638 else if (field_name_match (t_field_name
, name
))
7639 return TYPE_FIELD_TYPE (type
, i
);
7641 else if (ada_is_wrapper_field (type
, i
))
7643 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7649 else if (ada_is_variant_part (type
, i
))
7652 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7655 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7657 /* FIXME pnh 2008/01/26: We check for a field that is
7658 NOT wrapped in a struct, since the compiler sometimes
7659 generates these for unchecked variant types. Revisit
7660 if the compiler changes this practice. */
7661 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7663 if (v_field_name
!= NULL
7664 && field_name_match (v_field_name
, name
))
7665 t
= TYPE_FIELD_TYPE (field_type
, j
);
7667 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7681 const char *name_str
= name
!= NULL
? name
: _("<null>");
7683 error (_("Type %s has no component named %s"),
7684 type_as_string (type
).c_str (), name_str
);
7690 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7691 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7692 represents an unchecked union (that is, the variant part of a
7693 record that is named in an Unchecked_Union pragma). */
7696 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7698 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7700 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7704 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7705 within a value of type OUTER_TYPE that is stored in GDB at
7706 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7707 numbering from 0) is applicable. Returns -1 if none are. */
7710 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7711 const gdb_byte
*outer_valaddr
)
7715 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7716 struct value
*outer
;
7717 struct value
*discrim
;
7718 LONGEST discrim_val
;
7720 /* Using plain value_from_contents_and_address here causes problems
7721 because we will end up trying to resolve a type that is currently
7722 being constructed. */
7723 outer
= value_from_contents_and_address_unresolved (outer_type
,
7725 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7726 if (discrim
== NULL
)
7728 discrim_val
= value_as_long (discrim
);
7731 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7733 if (ada_is_others_clause (var_type
, i
))
7735 else if (ada_in_variant (discrim_val
, var_type
, i
))
7739 return others_clause
;
7744 /* Dynamic-Sized Records */
7746 /* Strategy: The type ostensibly attached to a value with dynamic size
7747 (i.e., a size that is not statically recorded in the debugging
7748 data) does not accurately reflect the size or layout of the value.
7749 Our strategy is to convert these values to values with accurate,
7750 conventional types that are constructed on the fly. */
7752 /* There is a subtle and tricky problem here. In general, we cannot
7753 determine the size of dynamic records without its data. However,
7754 the 'struct value' data structure, which GDB uses to represent
7755 quantities in the inferior process (the target), requires the size
7756 of the type at the time of its allocation in order to reserve space
7757 for GDB's internal copy of the data. That's why the
7758 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7759 rather than struct value*s.
7761 However, GDB's internal history variables ($1, $2, etc.) are
7762 struct value*s containing internal copies of the data that are not, in
7763 general, the same as the data at their corresponding addresses in
7764 the target. Fortunately, the types we give to these values are all
7765 conventional, fixed-size types (as per the strategy described
7766 above), so that we don't usually have to perform the
7767 'to_fixed_xxx_type' conversions to look at their values.
7768 Unfortunately, there is one exception: if one of the internal
7769 history variables is an array whose elements are unconstrained
7770 records, then we will need to create distinct fixed types for each
7771 element selected. */
7773 /* The upshot of all of this is that many routines take a (type, host
7774 address, target address) triple as arguments to represent a value.
7775 The host address, if non-null, is supposed to contain an internal
7776 copy of the relevant data; otherwise, the program is to consult the
7777 target at the target address. */
7779 /* Assuming that VAL0 represents a pointer value, the result of
7780 dereferencing it. Differs from value_ind in its treatment of
7781 dynamic-sized types. */
7784 ada_value_ind (struct value
*val0
)
7786 struct value
*val
= value_ind (val0
);
7788 if (ada_is_tagged_type (value_type (val
), 0))
7789 val
= ada_tag_value_at_base_address (val
);
7791 return ada_to_fixed_value (val
);
7794 /* The value resulting from dereferencing any "reference to"
7795 qualifiers on VAL0. */
7797 static struct value
*
7798 ada_coerce_ref (struct value
*val0
)
7800 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7802 struct value
*val
= val0
;
7804 val
= coerce_ref (val
);
7806 if (ada_is_tagged_type (value_type (val
), 0))
7807 val
= ada_tag_value_at_base_address (val
);
7809 return ada_to_fixed_value (val
);
7815 /* Return OFF rounded upward if necessary to a multiple of
7816 ALIGNMENT (a power of 2). */
7819 align_value (unsigned int off
, unsigned int alignment
)
7821 return (off
+ alignment
- 1) & ~(alignment
- 1);
7824 /* Return the bit alignment required for field #F of template type TYPE. */
7827 field_alignment (struct type
*type
, int f
)
7829 const char *name
= TYPE_FIELD_NAME (type
, f
);
7833 /* The field name should never be null, unless the debugging information
7834 is somehow malformed. In this case, we assume the field does not
7835 require any alignment. */
7839 len
= strlen (name
);
7841 if (!isdigit (name
[len
- 1]))
7844 if (isdigit (name
[len
- 2]))
7845 align_offset
= len
- 2;
7847 align_offset
= len
- 1;
7849 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7850 return TARGET_CHAR_BIT
;
7852 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7855 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7857 static struct symbol
*
7858 ada_find_any_type_symbol (const char *name
)
7862 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7863 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7866 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7870 /* Find a type named NAME. Ignores ambiguity. This routine will look
7871 solely for types defined by debug info, it will not search the GDB
7874 static struct type
*
7875 ada_find_any_type (const char *name
)
7877 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7880 return SYMBOL_TYPE (sym
);
7885 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7886 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7887 symbol, in which case it is returned. Otherwise, this looks for
7888 symbols whose name is that of NAME_SYM suffixed with "___XR".
7889 Return symbol if found, and NULL otherwise. */
7892 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7894 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7897 if (strstr (name
, "___XR") != NULL
)
7900 sym
= find_old_style_renaming_symbol (name
, block
);
7905 /* Not right yet. FIXME pnh 7/20/2007. */
7906 sym
= ada_find_any_type_symbol (name
);
7907 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7913 static struct symbol
*
7914 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7916 const struct symbol
*function_sym
= block_linkage_function (block
);
7919 if (function_sym
!= NULL
)
7921 /* If the symbol is defined inside a function, NAME is not fully
7922 qualified. This means we need to prepend the function name
7923 as well as adding the ``___XR'' suffix to build the name of
7924 the associated renaming symbol. */
7925 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7926 /* Function names sometimes contain suffixes used
7927 for instance to qualify nested subprograms. When building
7928 the XR type name, we need to make sure that this suffix is
7929 not included. So do not include any suffix in the function
7930 name length below. */
7931 int function_name_len
= ada_name_prefix_len (function_name
);
7932 const int rename_len
= function_name_len
+ 2 /* "__" */
7933 + strlen (name
) + 6 /* "___XR\0" */ ;
7935 /* Strip the suffix if necessary. */
7936 ada_remove_trailing_digits (function_name
, &function_name_len
);
7937 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7938 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7940 /* Library-level functions are a special case, as GNAT adds
7941 a ``_ada_'' prefix to the function name to avoid namespace
7942 pollution. However, the renaming symbols themselves do not
7943 have this prefix, so we need to skip this prefix if present. */
7944 if (function_name_len
> 5 /* "_ada_" */
7945 && strstr (function_name
, "_ada_") == function_name
)
7948 function_name_len
-= 5;
7951 rename
= (char *) alloca (rename_len
* sizeof (char));
7952 strncpy (rename
, function_name
, function_name_len
);
7953 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7958 const int rename_len
= strlen (name
) + 6;
7960 rename
= (char *) alloca (rename_len
* sizeof (char));
7961 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7964 return ada_find_any_type_symbol (rename
);
7967 /* Because of GNAT encoding conventions, several GDB symbols may match a
7968 given type name. If the type denoted by TYPE0 is to be preferred to
7969 that of TYPE1 for purposes of type printing, return non-zero;
7970 otherwise return 0. */
7973 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7977 else if (type0
== NULL
)
7979 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7981 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7983 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7985 else if (ada_is_constrained_packed_array_type (type0
))
7987 else if (ada_is_array_descriptor_type (type0
)
7988 && !ada_is_array_descriptor_type (type1
))
7992 const char *type0_name
= type_name_no_tag (type0
);
7993 const char *type1_name
= type_name_no_tag (type1
);
7995 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7996 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
8002 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
8003 null, its TYPE_TAG_NAME. Null if TYPE is null. */
8006 ada_type_name (struct type
*type
)
8010 else if (TYPE_NAME (type
) != NULL
)
8011 return TYPE_NAME (type
);
8013 return TYPE_TAG_NAME (type
);
8016 /* Search the list of "descriptive" types associated to TYPE for a type
8017 whose name is NAME. */
8019 static struct type
*
8020 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
8022 struct type
*result
, *tmp
;
8024 if (ada_ignore_descriptive_types_p
)
8027 /* If there no descriptive-type info, then there is no parallel type
8029 if (!HAVE_GNAT_AUX_INFO (type
))
8032 result
= TYPE_DESCRIPTIVE_TYPE (type
);
8033 while (result
!= NULL
)
8035 const char *result_name
= ada_type_name (result
);
8037 if (result_name
== NULL
)
8039 warning (_("unexpected null name on descriptive type"));
8043 /* If the names match, stop. */
8044 if (strcmp (result_name
, name
) == 0)
8047 /* Otherwise, look at the next item on the list, if any. */
8048 if (HAVE_GNAT_AUX_INFO (result
))
8049 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
8053 /* If not found either, try after having resolved the typedef. */
8058 result
= check_typedef (result
);
8059 if (HAVE_GNAT_AUX_INFO (result
))
8060 result
= TYPE_DESCRIPTIVE_TYPE (result
);
8066 /* If we didn't find a match, see whether this is a packed array. With
8067 older compilers, the descriptive type information is either absent or
8068 irrelevant when it comes to packed arrays so the above lookup fails.
8069 Fall back to using a parallel lookup by name in this case. */
8070 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
8071 return ada_find_any_type (name
);
8076 /* Find a parallel type to TYPE with the specified NAME, using the
8077 descriptive type taken from the debugging information, if available,
8078 and otherwise using the (slower) name-based method. */
8080 static struct type
*
8081 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
8083 struct type
*result
= NULL
;
8085 if (HAVE_GNAT_AUX_INFO (type
))
8086 result
= find_parallel_type_by_descriptive_type (type
, name
);
8088 result
= ada_find_any_type (name
);
8093 /* Same as above, but specify the name of the parallel type by appending
8094 SUFFIX to the name of TYPE. */
8097 ada_find_parallel_type (struct type
*type
, const char *suffix
)
8100 const char *type_name
= ada_type_name (type
);
8103 if (type_name
== NULL
)
8106 len
= strlen (type_name
);
8108 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
8110 strcpy (name
, type_name
);
8111 strcpy (name
+ len
, suffix
);
8113 return ada_find_parallel_type_with_name (type
, name
);
8116 /* If TYPE is a variable-size record type, return the corresponding template
8117 type describing its fields. Otherwise, return NULL. */
8119 static struct type
*
8120 dynamic_template_type (struct type
*type
)
8122 type
= ada_check_typedef (type
);
8124 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8125 || ada_type_name (type
) == NULL
)
8129 int len
= strlen (ada_type_name (type
));
8131 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8134 return ada_find_parallel_type (type
, "___XVE");
8138 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8139 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8142 is_dynamic_field (struct type
*templ_type
, int field_num
)
8144 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8147 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8148 && strstr (name
, "___XVL") != NULL
;
8151 /* The index of the variant field of TYPE, or -1 if TYPE does not
8152 represent a variant record type. */
8155 variant_field_index (struct type
*type
)
8159 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8162 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8164 if (ada_is_variant_part (type
, f
))
8170 /* A record type with no fields. */
8172 static struct type
*
8173 empty_record (struct type
*templ
)
8175 struct type
*type
= alloc_type_copy (templ
);
8177 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8178 TYPE_NFIELDS (type
) = 0;
8179 TYPE_FIELDS (type
) = NULL
;
8180 INIT_CPLUS_SPECIFIC (type
);
8181 TYPE_NAME (type
) = "<empty>";
8182 TYPE_TAG_NAME (type
) = NULL
;
8183 TYPE_LENGTH (type
) = 0;
8187 /* An ordinary record type (with fixed-length fields) that describes
8188 the value of type TYPE at VALADDR or ADDRESS (see comments at
8189 the beginning of this section) VAL according to GNAT conventions.
8190 DVAL0 should describe the (portion of a) record that contains any
8191 necessary discriminants. It should be NULL if value_type (VAL) is
8192 an outer-level type (i.e., as opposed to a branch of a variant.) A
8193 variant field (unless unchecked) is replaced by a particular branch
8196 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8197 length are not statically known are discarded. As a consequence,
8198 VALADDR, ADDRESS and DVAL0 are ignored.
8200 NOTE: Limitations: For now, we assume that dynamic fields and
8201 variants occupy whole numbers of bytes. However, they need not be
8205 ada_template_to_fixed_record_type_1 (struct type
*type
,
8206 const gdb_byte
*valaddr
,
8207 CORE_ADDR address
, struct value
*dval0
,
8208 int keep_dynamic_fields
)
8210 struct value
*mark
= value_mark ();
8213 int nfields
, bit_len
;
8219 /* Compute the number of fields in this record type that are going
8220 to be processed: unless keep_dynamic_fields, this includes only
8221 fields whose position and length are static will be processed. */
8222 if (keep_dynamic_fields
)
8223 nfields
= TYPE_NFIELDS (type
);
8227 while (nfields
< TYPE_NFIELDS (type
)
8228 && !ada_is_variant_part (type
, nfields
)
8229 && !is_dynamic_field (type
, nfields
))
8233 rtype
= alloc_type_copy (type
);
8234 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8235 INIT_CPLUS_SPECIFIC (rtype
);
8236 TYPE_NFIELDS (rtype
) = nfields
;
8237 TYPE_FIELDS (rtype
) = (struct field
*)
8238 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8239 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8240 TYPE_NAME (rtype
) = ada_type_name (type
);
8241 TYPE_TAG_NAME (rtype
) = NULL
;
8242 TYPE_FIXED_INSTANCE (rtype
) = 1;
8248 for (f
= 0; f
< nfields
; f
+= 1)
8250 off
= align_value (off
, field_alignment (type
, f
))
8251 + TYPE_FIELD_BITPOS (type
, f
);
8252 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8253 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8255 if (ada_is_variant_part (type
, f
))
8260 else if (is_dynamic_field (type
, f
))
8262 const gdb_byte
*field_valaddr
= valaddr
;
8263 CORE_ADDR field_address
= address
;
8264 struct type
*field_type
=
8265 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8269 /* rtype's length is computed based on the run-time
8270 value of discriminants. If the discriminants are not
8271 initialized, the type size may be completely bogus and
8272 GDB may fail to allocate a value for it. So check the
8273 size first before creating the value. */
8274 ada_ensure_varsize_limit (rtype
);
8275 /* Using plain value_from_contents_and_address here
8276 causes problems because we will end up trying to
8277 resolve a type that is currently being
8279 dval
= value_from_contents_and_address_unresolved (rtype
,
8282 rtype
= value_type (dval
);
8287 /* If the type referenced by this field is an aligner type, we need
8288 to unwrap that aligner type, because its size might not be set.
8289 Keeping the aligner type would cause us to compute the wrong
8290 size for this field, impacting the offset of the all the fields
8291 that follow this one. */
8292 if (ada_is_aligner_type (field_type
))
8294 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8296 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8297 field_address
= cond_offset_target (field_address
, field_offset
);
8298 field_type
= ada_aligned_type (field_type
);
8301 field_valaddr
= cond_offset_host (field_valaddr
,
8302 off
/ TARGET_CHAR_BIT
);
8303 field_address
= cond_offset_target (field_address
,
8304 off
/ TARGET_CHAR_BIT
);
8306 /* Get the fixed type of the field. Note that, in this case,
8307 we do not want to get the real type out of the tag: if
8308 the current field is the parent part of a tagged record,
8309 we will get the tag of the object. Clearly wrong: the real
8310 type of the parent is not the real type of the child. We
8311 would end up in an infinite loop. */
8312 field_type
= ada_get_base_type (field_type
);
8313 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8314 field_address
, dval
, 0);
8315 /* If the field size is already larger than the maximum
8316 object size, then the record itself will necessarily
8317 be larger than the maximum object size. We need to make
8318 this check now, because the size might be so ridiculously
8319 large (due to an uninitialized variable in the inferior)
8320 that it would cause an overflow when adding it to the
8322 ada_ensure_varsize_limit (field_type
);
8324 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8325 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8326 /* The multiplication can potentially overflow. But because
8327 the field length has been size-checked just above, and
8328 assuming that the maximum size is a reasonable value,
8329 an overflow should not happen in practice. So rather than
8330 adding overflow recovery code to this already complex code,
8331 we just assume that it's not going to happen. */
8333 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8337 /* Note: If this field's type is a typedef, it is important
8338 to preserve the typedef layer.
8340 Otherwise, we might be transforming a typedef to a fat
8341 pointer (encoding a pointer to an unconstrained array),
8342 into a basic fat pointer (encoding an unconstrained
8343 array). As both types are implemented using the same
8344 structure, the typedef is the only clue which allows us
8345 to distinguish between the two options. Stripping it
8346 would prevent us from printing this field appropriately. */
8347 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8348 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8349 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8351 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8354 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8356 /* We need to be careful of typedefs when computing
8357 the length of our field. If this is a typedef,
8358 get the length of the target type, not the length
8360 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8361 field_type
= ada_typedef_target_type (field_type
);
8364 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8367 if (off
+ fld_bit_len
> bit_len
)
8368 bit_len
= off
+ fld_bit_len
;
8370 TYPE_LENGTH (rtype
) =
8371 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8374 /* We handle the variant part, if any, at the end because of certain
8375 odd cases in which it is re-ordered so as NOT to be the last field of
8376 the record. This can happen in the presence of representation
8378 if (variant_field
>= 0)
8380 struct type
*branch_type
;
8382 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8386 /* Using plain value_from_contents_and_address here causes
8387 problems because we will end up trying to resolve a type
8388 that is currently being constructed. */
8389 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8391 rtype
= value_type (dval
);
8397 to_fixed_variant_branch_type
8398 (TYPE_FIELD_TYPE (type
, variant_field
),
8399 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8400 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8401 if (branch_type
== NULL
)
8403 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8404 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8405 TYPE_NFIELDS (rtype
) -= 1;
8409 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8410 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8412 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8414 if (off
+ fld_bit_len
> bit_len
)
8415 bit_len
= off
+ fld_bit_len
;
8416 TYPE_LENGTH (rtype
) =
8417 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8421 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8422 should contain the alignment of that record, which should be a strictly
8423 positive value. If null or negative, then something is wrong, most
8424 probably in the debug info. In that case, we don't round up the size
8425 of the resulting type. If this record is not part of another structure,
8426 the current RTYPE length might be good enough for our purposes. */
8427 if (TYPE_LENGTH (type
) <= 0)
8429 if (TYPE_NAME (rtype
))
8430 warning (_("Invalid type size for `%s' detected: %d."),
8431 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8433 warning (_("Invalid type size for <unnamed> detected: %d."),
8434 TYPE_LENGTH (type
));
8438 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8439 TYPE_LENGTH (type
));
8442 value_free_to_mark (mark
);
8443 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8444 error (_("record type with dynamic size is larger than varsize-limit"));
8448 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8451 static struct type
*
8452 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8453 CORE_ADDR address
, struct value
*dval0
)
8455 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8459 /* An ordinary record type in which ___XVL-convention fields and
8460 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8461 static approximations, containing all possible fields. Uses
8462 no runtime values. Useless for use in values, but that's OK,
8463 since the results are used only for type determinations. Works on both
8464 structs and unions. Representation note: to save space, we memorize
8465 the result of this function in the TYPE_TARGET_TYPE of the
8468 static struct type
*
8469 template_to_static_fixed_type (struct type
*type0
)
8475 /* No need no do anything if the input type is already fixed. */
8476 if (TYPE_FIXED_INSTANCE (type0
))
8479 /* Likewise if we already have computed the static approximation. */
8480 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8481 return TYPE_TARGET_TYPE (type0
);
8483 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8485 nfields
= TYPE_NFIELDS (type0
);
8487 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8488 recompute all over next time. */
8489 TYPE_TARGET_TYPE (type0
) = type
;
8491 for (f
= 0; f
< nfields
; f
+= 1)
8493 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8494 struct type
*new_type
;
8496 if (is_dynamic_field (type0
, f
))
8498 field_type
= ada_check_typedef (field_type
);
8499 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8502 new_type
= static_unwrap_type (field_type
);
8504 if (new_type
!= field_type
)
8506 /* Clone TYPE0 only the first time we get a new field type. */
8509 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8510 TYPE_CODE (type
) = TYPE_CODE (type0
);
8511 INIT_CPLUS_SPECIFIC (type
);
8512 TYPE_NFIELDS (type
) = nfields
;
8513 TYPE_FIELDS (type
) = (struct field
*)
8514 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8515 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8516 sizeof (struct field
) * nfields
);
8517 TYPE_NAME (type
) = ada_type_name (type0
);
8518 TYPE_TAG_NAME (type
) = NULL
;
8519 TYPE_FIXED_INSTANCE (type
) = 1;
8520 TYPE_LENGTH (type
) = 0;
8522 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8523 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8530 /* Given an object of type TYPE whose contents are at VALADDR and
8531 whose address in memory is ADDRESS, returns a revision of TYPE,
8532 which should be a non-dynamic-sized record, in which the variant
8533 part, if any, is replaced with the appropriate branch. Looks
8534 for discriminant values in DVAL0, which can be NULL if the record
8535 contains the necessary discriminant values. */
8537 static struct type
*
8538 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8539 CORE_ADDR address
, struct value
*dval0
)
8541 struct value
*mark
= value_mark ();
8544 struct type
*branch_type
;
8545 int nfields
= TYPE_NFIELDS (type
);
8546 int variant_field
= variant_field_index (type
);
8548 if (variant_field
== -1)
8553 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8554 type
= value_type (dval
);
8559 rtype
= alloc_type_copy (type
);
8560 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8561 INIT_CPLUS_SPECIFIC (rtype
);
8562 TYPE_NFIELDS (rtype
) = nfields
;
8563 TYPE_FIELDS (rtype
) =
8564 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8565 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8566 sizeof (struct field
) * nfields
);
8567 TYPE_NAME (rtype
) = ada_type_name (type
);
8568 TYPE_TAG_NAME (rtype
) = NULL
;
8569 TYPE_FIXED_INSTANCE (rtype
) = 1;
8570 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8572 branch_type
= to_fixed_variant_branch_type
8573 (TYPE_FIELD_TYPE (type
, variant_field
),
8574 cond_offset_host (valaddr
,
8575 TYPE_FIELD_BITPOS (type
, variant_field
)
8577 cond_offset_target (address
,
8578 TYPE_FIELD_BITPOS (type
, variant_field
)
8579 / TARGET_CHAR_BIT
), dval
);
8580 if (branch_type
== NULL
)
8584 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8585 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8586 TYPE_NFIELDS (rtype
) -= 1;
8590 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8591 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8592 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8593 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8595 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8597 value_free_to_mark (mark
);
8601 /* An ordinary record type (with fixed-length fields) that describes
8602 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8603 beginning of this section]. Any necessary discriminants' values
8604 should be in DVAL, a record value; it may be NULL if the object
8605 at ADDR itself contains any necessary discriminant values.
8606 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8607 values from the record are needed. Except in the case that DVAL,
8608 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8609 unchecked) is replaced by a particular branch of the variant.
8611 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8612 is questionable and may be removed. It can arise during the
8613 processing of an unconstrained-array-of-record type where all the
8614 variant branches have exactly the same size. This is because in
8615 such cases, the compiler does not bother to use the XVS convention
8616 when encoding the record. I am currently dubious of this
8617 shortcut and suspect the compiler should be altered. FIXME. */
8619 static struct type
*
8620 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8621 CORE_ADDR address
, struct value
*dval
)
8623 struct type
*templ_type
;
8625 if (TYPE_FIXED_INSTANCE (type0
))
8628 templ_type
= dynamic_template_type (type0
);
8630 if (templ_type
!= NULL
)
8631 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8632 else if (variant_field_index (type0
) >= 0)
8634 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8636 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8641 TYPE_FIXED_INSTANCE (type0
) = 1;
8647 /* An ordinary record type (with fixed-length fields) that describes
8648 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8649 union type. Any necessary discriminants' values should be in DVAL,
8650 a record value. That is, this routine selects the appropriate
8651 branch of the union at ADDR according to the discriminant value
8652 indicated in the union's type name. Returns VAR_TYPE0 itself if
8653 it represents a variant subject to a pragma Unchecked_Union. */
8655 static struct type
*
8656 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8657 CORE_ADDR address
, struct value
*dval
)
8660 struct type
*templ_type
;
8661 struct type
*var_type
;
8663 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8664 var_type
= TYPE_TARGET_TYPE (var_type0
);
8666 var_type
= var_type0
;
8668 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8670 if (templ_type
!= NULL
)
8671 var_type
= templ_type
;
8673 if (is_unchecked_variant (var_type
, value_type (dval
)))
8676 ada_which_variant_applies (var_type
,
8677 value_type (dval
), value_contents (dval
));
8680 return empty_record (var_type
);
8681 else if (is_dynamic_field (var_type
, which
))
8682 return to_fixed_record_type
8683 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8684 valaddr
, address
, dval
);
8685 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8687 to_fixed_record_type
8688 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8690 return TYPE_FIELD_TYPE (var_type
, which
);
8693 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8694 ENCODING_TYPE, a type following the GNAT conventions for discrete
8695 type encodings, only carries redundant information. */
8698 ada_is_redundant_range_encoding (struct type
*range_type
,
8699 struct type
*encoding_type
)
8701 struct type
*fixed_range_type
;
8702 const char *bounds_str
;
8706 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8708 if (TYPE_CODE (get_base_type (range_type
))
8709 != TYPE_CODE (get_base_type (encoding_type
)))
8711 /* The compiler probably used a simple base type to describe
8712 the range type instead of the range's actual base type,
8713 expecting us to get the real base type from the encoding
8714 anyway. In this situation, the encoding cannot be ignored
8719 if (is_dynamic_type (range_type
))
8722 if (TYPE_NAME (encoding_type
) == NULL
)
8725 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8726 if (bounds_str
== NULL
)
8729 n
= 8; /* Skip "___XDLU_". */
8730 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8732 if (TYPE_LOW_BOUND (range_type
) != lo
)
8735 n
+= 2; /* Skip the "__" separator between the two bounds. */
8736 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8738 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8744 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8745 a type following the GNAT encoding for describing array type
8746 indices, only carries redundant information. */
8749 ada_is_redundant_index_type_desc (struct type
*array_type
,
8750 struct type
*desc_type
)
8752 struct type
*this_layer
= check_typedef (array_type
);
8755 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8757 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8758 TYPE_FIELD_TYPE (desc_type
, i
)))
8760 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8766 /* Assuming that TYPE0 is an array type describing the type of a value
8767 at ADDR, and that DVAL describes a record containing any
8768 discriminants used in TYPE0, returns a type for the value that
8769 contains no dynamic components (that is, no components whose sizes
8770 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8771 true, gives an error message if the resulting type's size is over
8774 static struct type
*
8775 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8778 struct type
*index_type_desc
;
8779 struct type
*result
;
8780 int constrained_packed_array_p
;
8781 static const char *xa_suffix
= "___XA";
8783 type0
= ada_check_typedef (type0
);
8784 if (TYPE_FIXED_INSTANCE (type0
))
8787 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8788 if (constrained_packed_array_p
)
8789 type0
= decode_constrained_packed_array_type (type0
);
8791 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8793 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8794 encoding suffixed with 'P' may still be generated. If so,
8795 it should be used to find the XA type. */
8797 if (index_type_desc
== NULL
)
8799 const char *type_name
= ada_type_name (type0
);
8801 if (type_name
!= NULL
)
8803 const int len
= strlen (type_name
);
8804 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8806 if (type_name
[len
- 1] == 'P')
8808 strcpy (name
, type_name
);
8809 strcpy (name
+ len
- 1, xa_suffix
);
8810 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8815 ada_fixup_array_indexes_type (index_type_desc
);
8816 if (index_type_desc
!= NULL
8817 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8819 /* Ignore this ___XA parallel type, as it does not bring any
8820 useful information. This allows us to avoid creating fixed
8821 versions of the array's index types, which would be identical
8822 to the original ones. This, in turn, can also help avoid
8823 the creation of fixed versions of the array itself. */
8824 index_type_desc
= NULL
;
8827 if (index_type_desc
== NULL
)
8829 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8831 /* NOTE: elt_type---the fixed version of elt_type0---should never
8832 depend on the contents of the array in properly constructed
8834 /* Create a fixed version of the array element type.
8835 We're not providing the address of an element here,
8836 and thus the actual object value cannot be inspected to do
8837 the conversion. This should not be a problem, since arrays of
8838 unconstrained objects are not allowed. In particular, all
8839 the elements of an array of a tagged type should all be of
8840 the same type specified in the debugging info. No need to
8841 consult the object tag. */
8842 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8844 /* Make sure we always create a new array type when dealing with
8845 packed array types, since we're going to fix-up the array
8846 type length and element bitsize a little further down. */
8847 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8850 result
= create_array_type (alloc_type_copy (type0
),
8851 elt_type
, TYPE_INDEX_TYPE (type0
));
8856 struct type
*elt_type0
;
8859 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8860 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8862 /* NOTE: result---the fixed version of elt_type0---should never
8863 depend on the contents of the array in properly constructed
8865 /* Create a fixed version of the array element type.
8866 We're not providing the address of an element here,
8867 and thus the actual object value cannot be inspected to do
8868 the conversion. This should not be a problem, since arrays of
8869 unconstrained objects are not allowed. In particular, all
8870 the elements of an array of a tagged type should all be of
8871 the same type specified in the debugging info. No need to
8872 consult the object tag. */
8874 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8877 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8879 struct type
*range_type
=
8880 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8882 result
= create_array_type (alloc_type_copy (elt_type0
),
8883 result
, range_type
);
8884 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8886 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8887 error (_("array type with dynamic size is larger than varsize-limit"));
8890 /* We want to preserve the type name. This can be useful when
8891 trying to get the type name of a value that has already been
8892 printed (for instance, if the user did "print VAR; whatis $". */
8893 TYPE_NAME (result
) = TYPE_NAME (type0
);
8895 if (constrained_packed_array_p
)
8897 /* So far, the resulting type has been created as if the original
8898 type was a regular (non-packed) array type. As a result, the
8899 bitsize of the array elements needs to be set again, and the array
8900 length needs to be recomputed based on that bitsize. */
8901 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8902 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8904 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8905 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8906 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8907 TYPE_LENGTH (result
)++;
8910 TYPE_FIXED_INSTANCE (result
) = 1;
8915 /* A standard type (containing no dynamically sized components)
8916 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8917 DVAL describes a record containing any discriminants used in TYPE0,
8918 and may be NULL if there are none, or if the object of type TYPE at
8919 ADDRESS or in VALADDR contains these discriminants.
8921 If CHECK_TAG is not null, in the case of tagged types, this function
8922 attempts to locate the object's tag and use it to compute the actual
8923 type. However, when ADDRESS is null, we cannot use it to determine the
8924 location of the tag, and therefore compute the tagged type's actual type.
8925 So we return the tagged type without consulting the tag. */
8927 static struct type
*
8928 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8929 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8931 type
= ada_check_typedef (type
);
8932 switch (TYPE_CODE (type
))
8936 case TYPE_CODE_STRUCT
:
8938 struct type
*static_type
= to_static_fixed_type (type
);
8939 struct type
*fixed_record_type
=
8940 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8942 /* If STATIC_TYPE is a tagged type and we know the object's address,
8943 then we can determine its tag, and compute the object's actual
8944 type from there. Note that we have to use the fixed record
8945 type (the parent part of the record may have dynamic fields
8946 and the way the location of _tag is expressed may depend on
8949 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8952 value_tag_from_contents_and_address
8956 struct type
*real_type
= type_from_tag (tag
);
8958 value_from_contents_and_address (fixed_record_type
,
8961 fixed_record_type
= value_type (obj
);
8962 if (real_type
!= NULL
)
8963 return to_fixed_record_type
8965 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8968 /* Check to see if there is a parallel ___XVZ variable.
8969 If there is, then it provides the actual size of our type. */
8970 else if (ada_type_name (fixed_record_type
) != NULL
)
8972 const char *name
= ada_type_name (fixed_record_type
);
8974 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8977 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8978 if (get_int_var_value (xvz_name
, size
)
8979 && TYPE_LENGTH (fixed_record_type
) != size
)
8981 fixed_record_type
= copy_type (fixed_record_type
);
8982 TYPE_LENGTH (fixed_record_type
) = size
;
8984 /* The FIXED_RECORD_TYPE may have be a stub. We have
8985 observed this when the debugging info is STABS, and
8986 apparently it is something that is hard to fix.
8988 In practice, we don't need the actual type definition
8989 at all, because the presence of the XVZ variable allows us
8990 to assume that there must be a XVS type as well, which we
8991 should be able to use later, when we need the actual type
8994 In the meantime, pretend that the "fixed" type we are
8995 returning is NOT a stub, because this can cause trouble
8996 when using this type to create new types targeting it.
8997 Indeed, the associated creation routines often check
8998 whether the target type is a stub and will try to replace
8999 it, thus using a type with the wrong size. This, in turn,
9000 might cause the new type to have the wrong size too.
9001 Consider the case of an array, for instance, where the size
9002 of the array is computed from the number of elements in
9003 our array multiplied by the size of its element. */
9004 TYPE_STUB (fixed_record_type
) = 0;
9007 return fixed_record_type
;
9009 case TYPE_CODE_ARRAY
:
9010 return to_fixed_array_type (type
, dval
, 1);
9011 case TYPE_CODE_UNION
:
9015 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
9019 /* The same as ada_to_fixed_type_1, except that it preserves the type
9020 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
9022 The typedef layer needs be preserved in order to differentiate between
9023 arrays and array pointers when both types are implemented using the same
9024 fat pointer. In the array pointer case, the pointer is encoded as
9025 a typedef of the pointer type. For instance, considering:
9027 type String_Access is access String;
9028 S1 : String_Access := null;
9030 To the debugger, S1 is defined as a typedef of type String. But
9031 to the user, it is a pointer. So if the user tries to print S1,
9032 we should not dereference the array, but print the array address
9035 If we didn't preserve the typedef layer, we would lose the fact that
9036 the type is to be presented as a pointer (needs de-reference before
9037 being printed). And we would also use the source-level type name. */
9040 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
9041 CORE_ADDR address
, struct value
*dval
, int check_tag
)
9044 struct type
*fixed_type
=
9045 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
9047 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
9048 then preserve the typedef layer.
9050 Implementation note: We can only check the main-type portion of
9051 the TYPE and FIXED_TYPE, because eliminating the typedef layer
9052 from TYPE now returns a type that has the same instance flags
9053 as TYPE. For instance, if TYPE is a "typedef const", and its
9054 target type is a "struct", then the typedef elimination will return
9055 a "const" version of the target type. See check_typedef for more
9056 details about how the typedef layer elimination is done.
9058 brobecker/2010-11-19: It seems to me that the only case where it is
9059 useful to preserve the typedef layer is when dealing with fat pointers.
9060 Perhaps, we could add a check for that and preserve the typedef layer
9061 only in that situation. But this seems unecessary so far, probably
9062 because we call check_typedef/ada_check_typedef pretty much everywhere.
9064 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9065 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
9066 == TYPE_MAIN_TYPE (fixed_type
)))
9072 /* A standard (static-sized) type corresponding as well as possible to
9073 TYPE0, but based on no runtime data. */
9075 static struct type
*
9076 to_static_fixed_type (struct type
*type0
)
9083 if (TYPE_FIXED_INSTANCE (type0
))
9086 type0
= ada_check_typedef (type0
);
9088 switch (TYPE_CODE (type0
))
9092 case TYPE_CODE_STRUCT
:
9093 type
= dynamic_template_type (type0
);
9095 return template_to_static_fixed_type (type
);
9097 return template_to_static_fixed_type (type0
);
9098 case TYPE_CODE_UNION
:
9099 type
= ada_find_parallel_type (type0
, "___XVU");
9101 return template_to_static_fixed_type (type
);
9103 return template_to_static_fixed_type (type0
);
9107 /* A static approximation of TYPE with all type wrappers removed. */
9109 static struct type
*
9110 static_unwrap_type (struct type
*type
)
9112 if (ada_is_aligner_type (type
))
9114 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9115 if (ada_type_name (type1
) == NULL
)
9116 TYPE_NAME (type1
) = ada_type_name (type
);
9118 return static_unwrap_type (type1
);
9122 struct type
*raw_real_type
= ada_get_base_type (type
);
9124 if (raw_real_type
== type
)
9127 return to_static_fixed_type (raw_real_type
);
9131 /* In some cases, incomplete and private types require
9132 cross-references that are not resolved as records (for example,
9134 type FooP is access Foo;
9136 type Foo is array ...;
9137 ). In these cases, since there is no mechanism for producing
9138 cross-references to such types, we instead substitute for FooP a
9139 stub enumeration type that is nowhere resolved, and whose tag is
9140 the name of the actual type. Call these types "non-record stubs". */
9142 /* A type equivalent to TYPE that is not a non-record stub, if one
9143 exists, otherwise TYPE. */
9146 ada_check_typedef (struct type
*type
)
9151 /* If our type is a typedef type of a fat pointer, then we're done.
9152 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9153 what allows us to distinguish between fat pointers that represent
9154 array types, and fat pointers that represent array access types
9155 (in both cases, the compiler implements them as fat pointers). */
9156 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9157 && is_thick_pntr (ada_typedef_target_type (type
)))
9160 type
= check_typedef (type
);
9161 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9162 || !TYPE_STUB (type
)
9163 || TYPE_TAG_NAME (type
) == NULL
)
9167 const char *name
= TYPE_TAG_NAME (type
);
9168 struct type
*type1
= ada_find_any_type (name
);
9173 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9174 stubs pointing to arrays, as we don't create symbols for array
9175 types, only for the typedef-to-array types). If that's the case,
9176 strip the typedef layer. */
9177 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9178 type1
= ada_check_typedef (type1
);
9184 /* A value representing the data at VALADDR/ADDRESS as described by
9185 type TYPE0, but with a standard (static-sized) type that correctly
9186 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9187 type, then return VAL0 [this feature is simply to avoid redundant
9188 creation of struct values]. */
9190 static struct value
*
9191 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9194 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9196 if (type
== type0
&& val0
!= NULL
)
9199 return value_from_contents_and_address (type
, 0, address
);
9202 /* A value representing VAL, but with a standard (static-sized) type
9203 that correctly describes it. Does not necessarily create a new
9207 ada_to_fixed_value (struct value
*val
)
9209 val
= unwrap_value (val
);
9210 val
= ada_to_fixed_value_create (value_type (val
),
9211 value_address (val
),
9219 /* Table mapping attribute numbers to names.
9220 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9222 static const char *attribute_names
[] = {
9240 ada_attribute_name (enum exp_opcode n
)
9242 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9243 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9245 return attribute_names
[0];
9248 /* Evaluate the 'POS attribute applied to ARG. */
9251 pos_atr (struct value
*arg
)
9253 struct value
*val
= coerce_ref (arg
);
9254 struct type
*type
= value_type (val
);
9257 if (!discrete_type_p (type
))
9258 error (_("'POS only defined on discrete types"));
9260 if (!discrete_position (type
, value_as_long (val
), &result
))
9261 error (_("enumeration value is invalid: can't find 'POS"));
9266 static struct value
*
9267 value_pos_atr (struct type
*type
, struct value
*arg
)
9269 return value_from_longest (type
, pos_atr (arg
));
9272 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9274 static struct value
*
9275 value_val_atr (struct type
*type
, struct value
*arg
)
9277 if (!discrete_type_p (type
))
9278 error (_("'VAL only defined on discrete types"));
9279 if (!integer_type_p (value_type (arg
)))
9280 error (_("'VAL requires integral argument"));
9282 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9284 long pos
= value_as_long (arg
);
9286 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9287 error (_("argument to 'VAL out of range"));
9288 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9291 return value_from_longest (type
, value_as_long (arg
));
9297 /* True if TYPE appears to be an Ada character type.
9298 [At the moment, this is true only for Character and Wide_Character;
9299 It is a heuristic test that could stand improvement]. */
9302 ada_is_character_type (struct type
*type
)
9306 /* If the type code says it's a character, then assume it really is,
9307 and don't check any further. */
9308 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9311 /* Otherwise, assume it's a character type iff it is a discrete type
9312 with a known character type name. */
9313 name
= ada_type_name (type
);
9314 return (name
!= NULL
9315 && (TYPE_CODE (type
) == TYPE_CODE_INT
9316 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9317 && (strcmp (name
, "character") == 0
9318 || strcmp (name
, "wide_character") == 0
9319 || strcmp (name
, "wide_wide_character") == 0
9320 || strcmp (name
, "unsigned char") == 0));
9323 /* True if TYPE appears to be an Ada string type. */
9326 ada_is_string_type (struct type
*type
)
9328 type
= ada_check_typedef (type
);
9330 && TYPE_CODE (type
) != TYPE_CODE_PTR
9331 && (ada_is_simple_array_type (type
)
9332 || ada_is_array_descriptor_type (type
))
9333 && ada_array_arity (type
) == 1)
9335 struct type
*elttype
= ada_array_element_type (type
, 1);
9337 return ada_is_character_type (elttype
);
9343 /* The compiler sometimes provides a parallel XVS type for a given
9344 PAD type. Normally, it is safe to follow the PAD type directly,
9345 but older versions of the compiler have a bug that causes the offset
9346 of its "F" field to be wrong. Following that field in that case
9347 would lead to incorrect results, but this can be worked around
9348 by ignoring the PAD type and using the associated XVS type instead.
9350 Set to True if the debugger should trust the contents of PAD types.
9351 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9352 static int trust_pad_over_xvs
= 1;
9354 /* True if TYPE is a struct type introduced by the compiler to force the
9355 alignment of a value. Such types have a single field with a
9356 distinctive name. */
9359 ada_is_aligner_type (struct type
*type
)
9361 type
= ada_check_typedef (type
);
9363 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9366 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9367 && TYPE_NFIELDS (type
) == 1
9368 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9371 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9372 the parallel type. */
9375 ada_get_base_type (struct type
*raw_type
)
9377 struct type
*real_type_namer
;
9378 struct type
*raw_real_type
;
9380 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9383 if (ada_is_aligner_type (raw_type
))
9384 /* The encoding specifies that we should always use the aligner type.
9385 So, even if this aligner type has an associated XVS type, we should
9388 According to the compiler gurus, an XVS type parallel to an aligner
9389 type may exist because of a stabs limitation. In stabs, aligner
9390 types are empty because the field has a variable-sized type, and
9391 thus cannot actually be used as an aligner type. As a result,
9392 we need the associated parallel XVS type to decode the type.
9393 Since the policy in the compiler is to not change the internal
9394 representation based on the debugging info format, we sometimes
9395 end up having a redundant XVS type parallel to the aligner type. */
9398 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9399 if (real_type_namer
== NULL
9400 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9401 || TYPE_NFIELDS (real_type_namer
) != 1)
9404 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9406 /* This is an older encoding form where the base type needs to be
9407 looked up by name. We prefer the newer enconding because it is
9409 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9410 if (raw_real_type
== NULL
)
9413 return raw_real_type
;
9416 /* The field in our XVS type is a reference to the base type. */
9417 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9420 /* The type of value designated by TYPE, with all aligners removed. */
9423 ada_aligned_type (struct type
*type
)
9425 if (ada_is_aligner_type (type
))
9426 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9428 return ada_get_base_type (type
);
9432 /* The address of the aligned value in an object at address VALADDR
9433 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9436 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9438 if (ada_is_aligner_type (type
))
9439 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9441 TYPE_FIELD_BITPOS (type
,
9442 0) / TARGET_CHAR_BIT
);
9449 /* The printed representation of an enumeration literal with encoded
9450 name NAME. The value is good to the next call of ada_enum_name. */
9452 ada_enum_name (const char *name
)
9454 static char *result
;
9455 static size_t result_len
= 0;
9458 /* First, unqualify the enumeration name:
9459 1. Search for the last '.' character. If we find one, then skip
9460 all the preceding characters, the unqualified name starts
9461 right after that dot.
9462 2. Otherwise, we may be debugging on a target where the compiler
9463 translates dots into "__". Search forward for double underscores,
9464 but stop searching when we hit an overloading suffix, which is
9465 of the form "__" followed by digits. */
9467 tmp
= strrchr (name
, '.');
9472 while ((tmp
= strstr (name
, "__")) != NULL
)
9474 if (isdigit (tmp
[2]))
9485 if (name
[1] == 'U' || name
[1] == 'W')
9487 if (sscanf (name
+ 2, "%x", &v
) != 1)
9493 GROW_VECT (result
, result_len
, 16);
9494 if (isascii (v
) && isprint (v
))
9495 xsnprintf (result
, result_len
, "'%c'", v
);
9496 else if (name
[1] == 'U')
9497 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9499 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9505 tmp
= strstr (name
, "__");
9507 tmp
= strstr (name
, "$");
9510 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9511 strncpy (result
, name
, tmp
- name
);
9512 result
[tmp
- name
] = '\0';
9520 /* Evaluate the subexpression of EXP starting at *POS as for
9521 evaluate_type, updating *POS to point just past the evaluated
9524 static struct value
*
9525 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9527 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9530 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9533 static struct value
*
9534 unwrap_value (struct value
*val
)
9536 struct type
*type
= ada_check_typedef (value_type (val
));
9538 if (ada_is_aligner_type (type
))
9540 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9541 struct type
*val_type
= ada_check_typedef (value_type (v
));
9543 if (ada_type_name (val_type
) == NULL
)
9544 TYPE_NAME (val_type
) = ada_type_name (type
);
9546 return unwrap_value (v
);
9550 struct type
*raw_real_type
=
9551 ada_check_typedef (ada_get_base_type (type
));
9553 /* If there is no parallel XVS or XVE type, then the value is
9554 already unwrapped. Return it without further modification. */
9555 if ((type
== raw_real_type
)
9556 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9560 coerce_unspec_val_to_type
9561 (val
, ada_to_fixed_type (raw_real_type
, 0,
9562 value_address (val
),
9567 static struct value
*
9568 cast_to_fixed (struct type
*type
, struct value
*arg
)
9572 if (type
== value_type (arg
))
9574 else if (ada_is_fixed_point_type (value_type (arg
)))
9575 val
= ada_float_to_fixed (type
,
9576 ada_fixed_to_float (value_type (arg
),
9577 value_as_long (arg
)));
9580 DOUBLEST argd
= value_as_double (arg
);
9582 val
= ada_float_to_fixed (type
, argd
);
9585 return value_from_longest (type
, val
);
9588 static struct value
*
9589 cast_from_fixed (struct type
*type
, struct value
*arg
)
9591 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9592 value_as_long (arg
));
9594 return value_from_double (type
, val
);
9597 /* Given two array types T1 and T2, return nonzero iff both arrays
9598 contain the same number of elements. */
9601 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9603 LONGEST lo1
, hi1
, lo2
, hi2
;
9605 /* Get the array bounds in order to verify that the size of
9606 the two arrays match. */
9607 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9608 || !get_array_bounds (t2
, &lo2
, &hi2
))
9609 error (_("unable to determine array bounds"));
9611 /* To make things easier for size comparison, normalize a bit
9612 the case of empty arrays by making sure that the difference
9613 between upper bound and lower bound is always -1. */
9619 return (hi1
- lo1
== hi2
- lo2
);
9622 /* Assuming that VAL is an array of integrals, and TYPE represents
9623 an array with the same number of elements, but with wider integral
9624 elements, return an array "casted" to TYPE. In practice, this
9625 means that the returned array is built by casting each element
9626 of the original array into TYPE's (wider) element type. */
9628 static struct value
*
9629 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9631 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9636 /* Verify that both val and type are arrays of scalars, and
9637 that the size of val's elements is smaller than the size
9638 of type's element. */
9639 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9640 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9641 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9642 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9643 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9644 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9646 if (!get_array_bounds (type
, &lo
, &hi
))
9647 error (_("unable to determine array bounds"));
9649 res
= allocate_value (type
);
9651 /* Promote each array element. */
9652 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9654 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9656 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9657 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9663 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9664 return the converted value. */
9666 static struct value
*
9667 coerce_for_assign (struct type
*type
, struct value
*val
)
9669 struct type
*type2
= value_type (val
);
9674 type2
= ada_check_typedef (type2
);
9675 type
= ada_check_typedef (type
);
9677 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9678 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9680 val
= ada_value_ind (val
);
9681 type2
= value_type (val
);
9684 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9685 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9687 if (!ada_same_array_size_p (type
, type2
))
9688 error (_("cannot assign arrays of different length"));
9690 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9691 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9692 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9693 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9695 /* Allow implicit promotion of the array elements to
9697 return ada_promote_array_of_integrals (type
, val
);
9700 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9701 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9702 error (_("Incompatible types in assignment"));
9703 deprecated_set_value_type (val
, type
);
9708 static struct value
*
9709 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9712 struct type
*type1
, *type2
;
9715 arg1
= coerce_ref (arg1
);
9716 arg2
= coerce_ref (arg2
);
9717 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9718 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9720 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9721 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9722 return value_binop (arg1
, arg2
, op
);
9731 return value_binop (arg1
, arg2
, op
);
9734 v2
= value_as_long (arg2
);
9736 error (_("second operand of %s must not be zero."), op_string (op
));
9738 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9739 return value_binop (arg1
, arg2
, op
);
9741 v1
= value_as_long (arg1
);
9746 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9747 v
+= v
> 0 ? -1 : 1;
9755 /* Should not reach this point. */
9759 val
= allocate_value (type1
);
9760 store_unsigned_integer (value_contents_raw (val
),
9761 TYPE_LENGTH (value_type (val
)),
9762 gdbarch_byte_order (get_type_arch (type1
)), v
);
9767 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9769 if (ada_is_direct_array_type (value_type (arg1
))
9770 || ada_is_direct_array_type (value_type (arg2
)))
9772 /* Automatically dereference any array reference before
9773 we attempt to perform the comparison. */
9774 arg1
= ada_coerce_ref (arg1
);
9775 arg2
= ada_coerce_ref (arg2
);
9777 arg1
= ada_coerce_to_simple_array (arg1
);
9778 arg2
= ada_coerce_to_simple_array (arg2
);
9779 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9780 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9781 error (_("Attempt to compare array with non-array"));
9782 /* FIXME: The following works only for types whose
9783 representations use all bits (no padding or undefined bits)
9784 and do not have user-defined equality. */
9786 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9787 && memcmp (value_contents (arg1
), value_contents (arg2
),
9788 TYPE_LENGTH (value_type (arg1
))) == 0;
9790 return value_equal (arg1
, arg2
);
9793 /* Total number of component associations in the aggregate starting at
9794 index PC in EXP. Assumes that index PC is the start of an
9798 num_component_specs (struct expression
*exp
, int pc
)
9802 m
= exp
->elts
[pc
+ 1].longconst
;
9805 for (i
= 0; i
< m
; i
+= 1)
9807 switch (exp
->elts
[pc
].opcode
)
9813 n
+= exp
->elts
[pc
+ 1].longconst
;
9816 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9821 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9822 component of LHS (a simple array or a record), updating *POS past
9823 the expression, assuming that LHS is contained in CONTAINER. Does
9824 not modify the inferior's memory, nor does it modify LHS (unless
9825 LHS == CONTAINER). */
9828 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9829 struct expression
*exp
, int *pos
)
9831 struct value
*mark
= value_mark ();
9834 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9836 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9837 struct value
*index_val
= value_from_longest (index_type
, index
);
9839 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9843 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9844 elt
= ada_to_fixed_value (elt
);
9847 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9848 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9850 value_assign_to_component (container
, elt
,
9851 ada_evaluate_subexp (NULL
, exp
, pos
,
9854 value_free_to_mark (mark
);
9857 /* Assuming that LHS represents an lvalue having a record or array
9858 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9859 of that aggregate's value to LHS, advancing *POS past the
9860 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9861 lvalue containing LHS (possibly LHS itself). Does not modify
9862 the inferior's memory, nor does it modify the contents of
9863 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9865 static struct value
*
9866 assign_aggregate (struct value
*container
,
9867 struct value
*lhs
, struct expression
*exp
,
9868 int *pos
, enum noside noside
)
9870 struct type
*lhs_type
;
9871 int n
= exp
->elts
[*pos
+1].longconst
;
9872 LONGEST low_index
, high_index
;
9875 int max_indices
, num_indices
;
9879 if (noside
!= EVAL_NORMAL
)
9881 for (i
= 0; i
< n
; i
+= 1)
9882 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9886 container
= ada_coerce_ref (container
);
9887 if (ada_is_direct_array_type (value_type (container
)))
9888 container
= ada_coerce_to_simple_array (container
);
9889 lhs
= ada_coerce_ref (lhs
);
9890 if (!deprecated_value_modifiable (lhs
))
9891 error (_("Left operand of assignment is not a modifiable lvalue."));
9893 lhs_type
= value_type (lhs
);
9894 if (ada_is_direct_array_type (lhs_type
))
9896 lhs
= ada_coerce_to_simple_array (lhs
);
9897 lhs_type
= value_type (lhs
);
9898 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9899 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9901 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9904 high_index
= num_visible_fields (lhs_type
) - 1;
9907 error (_("Left-hand side must be array or record."));
9909 num_specs
= num_component_specs (exp
, *pos
- 3);
9910 max_indices
= 4 * num_specs
+ 4;
9911 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9912 indices
[0] = indices
[1] = low_index
- 1;
9913 indices
[2] = indices
[3] = high_index
+ 1;
9916 for (i
= 0; i
< n
; i
+= 1)
9918 switch (exp
->elts
[*pos
].opcode
)
9921 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9922 &num_indices
, max_indices
,
9923 low_index
, high_index
);
9926 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9927 &num_indices
, max_indices
,
9928 low_index
, high_index
);
9932 error (_("Misplaced 'others' clause"));
9933 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9934 num_indices
, low_index
, high_index
);
9937 error (_("Internal error: bad aggregate clause"));
9944 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9945 construct at *POS, updating *POS past the construct, given that
9946 the positions are relative to lower bound LOW, where HIGH is the
9947 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9948 updating *NUM_INDICES as needed. CONTAINER is as for
9949 assign_aggregate. */
9951 aggregate_assign_positional (struct value
*container
,
9952 struct value
*lhs
, struct expression
*exp
,
9953 int *pos
, LONGEST
*indices
, int *num_indices
,
9954 int max_indices
, LONGEST low
, LONGEST high
)
9956 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9958 if (ind
- 1 == high
)
9959 warning (_("Extra components in aggregate ignored."));
9962 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9964 assign_component (container
, lhs
, ind
, exp
, pos
);
9967 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9970 /* Assign into the components of LHS indexed by the OP_CHOICES
9971 construct at *POS, updating *POS past the construct, given that
9972 the allowable indices are LOW..HIGH. Record the indices assigned
9973 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9974 needed. CONTAINER is as for assign_aggregate. */
9976 aggregate_assign_from_choices (struct value
*container
,
9977 struct value
*lhs
, struct expression
*exp
,
9978 int *pos
, LONGEST
*indices
, int *num_indices
,
9979 int max_indices
, LONGEST low
, LONGEST high
)
9982 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9983 int choice_pos
, expr_pc
;
9984 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9986 choice_pos
= *pos
+= 3;
9988 for (j
= 0; j
< n_choices
; j
+= 1)
9989 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9991 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9993 for (j
= 0; j
< n_choices
; j
+= 1)
9995 LONGEST lower
, upper
;
9996 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9998 if (op
== OP_DISCRETE_RANGE
)
10001 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
10003 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
10008 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
10020 name
= &exp
->elts
[choice_pos
+ 2].string
;
10023 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
10026 error (_("Invalid record component association."));
10028 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
10030 if (! find_struct_field (name
, value_type (lhs
), 0,
10031 NULL
, NULL
, NULL
, NULL
, &ind
))
10032 error (_("Unknown component name: %s."), name
);
10033 lower
= upper
= ind
;
10036 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
10037 error (_("Index in component association out of bounds."));
10039 add_component_interval (lower
, upper
, indices
, num_indices
,
10041 while (lower
<= upper
)
10046 assign_component (container
, lhs
, lower
, exp
, &pos1
);
10052 /* Assign the value of the expression in the OP_OTHERS construct in
10053 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
10054 have not been previously assigned. The index intervals already assigned
10055 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
10056 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
10058 aggregate_assign_others (struct value
*container
,
10059 struct value
*lhs
, struct expression
*exp
,
10060 int *pos
, LONGEST
*indices
, int num_indices
,
10061 LONGEST low
, LONGEST high
)
10064 int expr_pc
= *pos
+ 1;
10066 for (i
= 0; i
< num_indices
- 2; i
+= 2)
10070 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
10074 localpos
= expr_pc
;
10075 assign_component (container
, lhs
, ind
, exp
, &localpos
);
10078 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
10081 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
10082 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10083 modifying *SIZE as needed. It is an error if *SIZE exceeds
10084 MAX_SIZE. The resulting intervals do not overlap. */
10086 add_component_interval (LONGEST low
, LONGEST high
,
10087 LONGEST
* indices
, int *size
, int max_size
)
10091 for (i
= 0; i
< *size
; i
+= 2) {
10092 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10096 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10097 if (high
< indices
[kh
])
10099 if (low
< indices
[i
])
10101 indices
[i
+ 1] = indices
[kh
- 1];
10102 if (high
> indices
[i
+ 1])
10103 indices
[i
+ 1] = high
;
10104 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10105 *size
-= kh
- i
- 2;
10108 else if (high
< indices
[i
])
10112 if (*size
== max_size
)
10113 error (_("Internal error: miscounted aggregate components."));
10115 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10116 indices
[j
] = indices
[j
- 2];
10118 indices
[i
+ 1] = high
;
10121 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10124 static struct value
*
10125 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
10127 if (type
== ada_check_typedef (value_type (arg2
)))
10130 if (ada_is_fixed_point_type (type
))
10131 return (cast_to_fixed (type
, arg2
));
10133 if (ada_is_fixed_point_type (value_type (arg2
)))
10134 return cast_from_fixed (type
, arg2
);
10136 return value_cast (type
, arg2
);
10139 /* Evaluating Ada expressions, and printing their result.
10140 ------------------------------------------------------
10145 We usually evaluate an Ada expression in order to print its value.
10146 We also evaluate an expression in order to print its type, which
10147 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10148 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10149 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10150 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10153 Evaluating expressions is a little more complicated for Ada entities
10154 than it is for entities in languages such as C. The main reason for
10155 this is that Ada provides types whose definition might be dynamic.
10156 One example of such types is variant records. Or another example
10157 would be an array whose bounds can only be known at run time.
10159 The following description is a general guide as to what should be
10160 done (and what should NOT be done) in order to evaluate an expression
10161 involving such types, and when. This does not cover how the semantic
10162 information is encoded by GNAT as this is covered separatly. For the
10163 document used as the reference for the GNAT encoding, see exp_dbug.ads
10164 in the GNAT sources.
10166 Ideally, we should embed each part of this description next to its
10167 associated code. Unfortunately, the amount of code is so vast right
10168 now that it's hard to see whether the code handling a particular
10169 situation might be duplicated or not. One day, when the code is
10170 cleaned up, this guide might become redundant with the comments
10171 inserted in the code, and we might want to remove it.
10173 2. ``Fixing'' an Entity, the Simple Case:
10174 -----------------------------------------
10176 When evaluating Ada expressions, the tricky issue is that they may
10177 reference entities whose type contents and size are not statically
10178 known. Consider for instance a variant record:
10180 type Rec (Empty : Boolean := True) is record
10183 when False => Value : Integer;
10186 Yes : Rec := (Empty => False, Value => 1);
10187 No : Rec := (empty => True);
10189 The size and contents of that record depends on the value of the
10190 descriminant (Rec.Empty). At this point, neither the debugging
10191 information nor the associated type structure in GDB are able to
10192 express such dynamic types. So what the debugger does is to create
10193 "fixed" versions of the type that applies to the specific object.
10194 We also informally refer to this opperation as "fixing" an object,
10195 which means creating its associated fixed type.
10197 Example: when printing the value of variable "Yes" above, its fixed
10198 type would look like this:
10205 On the other hand, if we printed the value of "No", its fixed type
10212 Things become a little more complicated when trying to fix an entity
10213 with a dynamic type that directly contains another dynamic type,
10214 such as an array of variant records, for instance. There are
10215 two possible cases: Arrays, and records.
10217 3. ``Fixing'' Arrays:
10218 ---------------------
10220 The type structure in GDB describes an array in terms of its bounds,
10221 and the type of its elements. By design, all elements in the array
10222 have the same type and we cannot represent an array of variant elements
10223 using the current type structure in GDB. When fixing an array,
10224 we cannot fix the array element, as we would potentially need one
10225 fixed type per element of the array. As a result, the best we can do
10226 when fixing an array is to produce an array whose bounds and size
10227 are correct (allowing us to read it from memory), but without having
10228 touched its element type. Fixing each element will be done later,
10229 when (if) necessary.
10231 Arrays are a little simpler to handle than records, because the same
10232 amount of memory is allocated for each element of the array, even if
10233 the amount of space actually used by each element differs from element
10234 to element. Consider for instance the following array of type Rec:
10236 type Rec_Array is array (1 .. 2) of Rec;
10238 The actual amount of memory occupied by each element might be different
10239 from element to element, depending on the value of their discriminant.
10240 But the amount of space reserved for each element in the array remains
10241 fixed regardless. So we simply need to compute that size using
10242 the debugging information available, from which we can then determine
10243 the array size (we multiply the number of elements of the array by
10244 the size of each element).
10246 The simplest case is when we have an array of a constrained element
10247 type. For instance, consider the following type declarations:
10249 type Bounded_String (Max_Size : Integer) is
10251 Buffer : String (1 .. Max_Size);
10253 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10255 In this case, the compiler describes the array as an array of
10256 variable-size elements (identified by its XVS suffix) for which
10257 the size can be read in the parallel XVZ variable.
10259 In the case of an array of an unconstrained element type, the compiler
10260 wraps the array element inside a private PAD type. This type should not
10261 be shown to the user, and must be "unwrap"'ed before printing. Note
10262 that we also use the adjective "aligner" in our code to designate
10263 these wrapper types.
10265 In some cases, the size allocated for each element is statically
10266 known. In that case, the PAD type already has the correct size,
10267 and the array element should remain unfixed.
10269 But there are cases when this size is not statically known.
10270 For instance, assuming that "Five" is an integer variable:
10272 type Dynamic is array (1 .. Five) of Integer;
10273 type Wrapper (Has_Length : Boolean := False) is record
10276 when True => Length : Integer;
10277 when False => null;
10280 type Wrapper_Array is array (1 .. 2) of Wrapper;
10282 Hello : Wrapper_Array := (others => (Has_Length => True,
10283 Data => (others => 17),
10287 The debugging info would describe variable Hello as being an
10288 array of a PAD type. The size of that PAD type is not statically
10289 known, but can be determined using a parallel XVZ variable.
10290 In that case, a copy of the PAD type with the correct size should
10291 be used for the fixed array.
10293 3. ``Fixing'' record type objects:
10294 ----------------------------------
10296 Things are slightly different from arrays in the case of dynamic
10297 record types. In this case, in order to compute the associated
10298 fixed type, we need to determine the size and offset of each of
10299 its components. This, in turn, requires us to compute the fixed
10300 type of each of these components.
10302 Consider for instance the example:
10304 type Bounded_String (Max_Size : Natural) is record
10305 Str : String (1 .. Max_Size);
10308 My_String : Bounded_String (Max_Size => 10);
10310 In that case, the position of field "Length" depends on the size
10311 of field Str, which itself depends on the value of the Max_Size
10312 discriminant. In order to fix the type of variable My_String,
10313 we need to fix the type of field Str. Therefore, fixing a variant
10314 record requires us to fix each of its components.
10316 However, if a component does not have a dynamic size, the component
10317 should not be fixed. In particular, fields that use a PAD type
10318 should not fixed. Here is an example where this might happen
10319 (assuming type Rec above):
10321 type Container (Big : Boolean) is record
10325 when True => Another : Integer;
10326 when False => null;
10329 My_Container : Container := (Big => False,
10330 First => (Empty => True),
10333 In that example, the compiler creates a PAD type for component First,
10334 whose size is constant, and then positions the component After just
10335 right after it. The offset of component After is therefore constant
10338 The debugger computes the position of each field based on an algorithm
10339 that uses, among other things, the actual position and size of the field
10340 preceding it. Let's now imagine that the user is trying to print
10341 the value of My_Container. If the type fixing was recursive, we would
10342 end up computing the offset of field After based on the size of the
10343 fixed version of field First. And since in our example First has
10344 only one actual field, the size of the fixed type is actually smaller
10345 than the amount of space allocated to that field, and thus we would
10346 compute the wrong offset of field After.
10348 To make things more complicated, we need to watch out for dynamic
10349 components of variant records (identified by the ___XVL suffix in
10350 the component name). Even if the target type is a PAD type, the size
10351 of that type might not be statically known. So the PAD type needs
10352 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10353 we might end up with the wrong size for our component. This can be
10354 observed with the following type declarations:
10356 type Octal is new Integer range 0 .. 7;
10357 type Octal_Array is array (Positive range <>) of Octal;
10358 pragma Pack (Octal_Array);
10360 type Octal_Buffer (Size : Positive) is record
10361 Buffer : Octal_Array (1 .. Size);
10365 In that case, Buffer is a PAD type whose size is unset and needs
10366 to be computed by fixing the unwrapped type.
10368 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10369 ----------------------------------------------------------
10371 Lastly, when should the sub-elements of an entity that remained unfixed
10372 thus far, be actually fixed?
10374 The answer is: Only when referencing that element. For instance
10375 when selecting one component of a record, this specific component
10376 should be fixed at that point in time. Or when printing the value
10377 of a record, each component should be fixed before its value gets
10378 printed. Similarly for arrays, the element of the array should be
10379 fixed when printing each element of the array, or when extracting
10380 one element out of that array. On the other hand, fixing should
10381 not be performed on the elements when taking a slice of an array!
10383 Note that one of the side-effects of miscomputing the offset and
10384 size of each field is that we end up also miscomputing the size
10385 of the containing type. This can have adverse results when computing
10386 the value of an entity. GDB fetches the value of an entity based
10387 on the size of its type, and thus a wrong size causes GDB to fetch
10388 the wrong amount of memory. In the case where the computed size is
10389 too small, GDB fetches too little data to print the value of our
10390 entiry. Results in this case as unpredicatble, as we usually read
10391 past the buffer containing the data =:-o. */
10393 /* Implement the evaluate_exp routine in the exp_descriptor structure
10394 for the Ada language. */
10396 static struct value
*
10397 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10398 int *pos
, enum noside noside
)
10400 enum exp_opcode op
;
10404 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10407 struct value
**argvec
;
10411 op
= exp
->elts
[pc
].opcode
;
10417 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10419 if (noside
== EVAL_NORMAL
)
10420 arg1
= unwrap_value (arg1
);
10422 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10423 then we need to perform the conversion manually, because
10424 evaluate_subexp_standard doesn't do it. This conversion is
10425 necessary in Ada because the different kinds of float/fixed
10426 types in Ada have different representations.
10428 Similarly, we need to perform the conversion from OP_LONG
10430 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
10431 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10437 struct value
*result
;
10440 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10441 /* The result type will have code OP_STRING, bashed there from
10442 OP_ARRAY. Bash it back. */
10443 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10444 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10450 type
= exp
->elts
[pc
+ 1].type
;
10451 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10452 if (noside
== EVAL_SKIP
)
10454 arg1
= ada_value_cast (type
, arg1
, noside
);
10459 type
= exp
->elts
[pc
+ 1].type
;
10460 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10463 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10464 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10466 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10467 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10469 return ada_value_assign (arg1
, arg1
);
10471 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10472 except if the lhs of our assignment is a convenience variable.
10473 In the case of assigning to a convenience variable, the lhs
10474 should be exactly the result of the evaluation of the rhs. */
10475 type
= value_type (arg1
);
10476 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10478 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10479 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10481 if (ada_is_fixed_point_type (value_type (arg1
)))
10482 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10483 else if (ada_is_fixed_point_type (value_type (arg2
)))
10485 (_("Fixed-point values must be assigned to fixed-point variables"));
10487 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10488 return ada_value_assign (arg1
, arg2
);
10491 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10492 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10493 if (noside
== EVAL_SKIP
)
10495 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10496 return (value_from_longest
10497 (value_type (arg1
),
10498 value_as_long (arg1
) + value_as_long (arg2
)));
10499 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10500 return (value_from_longest
10501 (value_type (arg2
),
10502 value_as_long (arg1
) + value_as_long (arg2
)));
10503 if ((ada_is_fixed_point_type (value_type (arg1
))
10504 || ada_is_fixed_point_type (value_type (arg2
)))
10505 && value_type (arg1
) != value_type (arg2
))
10506 error (_("Operands of fixed-point addition must have the same type"));
10507 /* Do the addition, and cast the result to the type of the first
10508 argument. We cannot cast the result to a reference type, so if
10509 ARG1 is a reference type, find its underlying type. */
10510 type
= value_type (arg1
);
10511 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10512 type
= TYPE_TARGET_TYPE (type
);
10513 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10514 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10517 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10518 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10519 if (noside
== EVAL_SKIP
)
10521 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10522 return (value_from_longest
10523 (value_type (arg1
),
10524 value_as_long (arg1
) - value_as_long (arg2
)));
10525 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10526 return (value_from_longest
10527 (value_type (arg2
),
10528 value_as_long (arg1
) - value_as_long (arg2
)));
10529 if ((ada_is_fixed_point_type (value_type (arg1
))
10530 || ada_is_fixed_point_type (value_type (arg2
)))
10531 && value_type (arg1
) != value_type (arg2
))
10532 error (_("Operands of fixed-point subtraction "
10533 "must have the same type"));
10534 /* Do the substraction, and cast the result to the type of the first
10535 argument. We cannot cast the result to a reference type, so if
10536 ARG1 is a reference type, find its underlying type. */
10537 type
= value_type (arg1
);
10538 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10539 type
= TYPE_TARGET_TYPE (type
);
10540 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10541 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10547 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10548 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10549 if (noside
== EVAL_SKIP
)
10551 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10553 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10554 return value_zero (value_type (arg1
), not_lval
);
10558 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10559 if (ada_is_fixed_point_type (value_type (arg1
)))
10560 arg1
= cast_from_fixed (type
, arg1
);
10561 if (ada_is_fixed_point_type (value_type (arg2
)))
10562 arg2
= cast_from_fixed (type
, arg2
);
10563 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10564 return ada_value_binop (arg1
, arg2
, op
);
10568 case BINOP_NOTEQUAL
:
10569 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10570 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10571 if (noside
== EVAL_SKIP
)
10573 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10577 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10578 tem
= ada_value_equal (arg1
, arg2
);
10580 if (op
== BINOP_NOTEQUAL
)
10582 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10583 return value_from_longest (type
, (LONGEST
) tem
);
10586 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10587 if (noside
== EVAL_SKIP
)
10589 else if (ada_is_fixed_point_type (value_type (arg1
)))
10590 return value_cast (value_type (arg1
), value_neg (arg1
));
10593 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10594 return value_neg (arg1
);
10597 case BINOP_LOGICAL_AND
:
10598 case BINOP_LOGICAL_OR
:
10599 case UNOP_LOGICAL_NOT
:
10604 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10605 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10606 return value_cast (type
, val
);
10609 case BINOP_BITWISE_AND
:
10610 case BINOP_BITWISE_IOR
:
10611 case BINOP_BITWISE_XOR
:
10615 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10617 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10619 return value_cast (value_type (arg1
), val
);
10625 if (noside
== EVAL_SKIP
)
10631 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10632 /* Only encountered when an unresolved symbol occurs in a
10633 context other than a function call, in which case, it is
10635 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10636 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10638 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10640 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10641 /* Check to see if this is a tagged type. We also need to handle
10642 the case where the type is a reference to a tagged type, but
10643 we have to be careful to exclude pointers to tagged types.
10644 The latter should be shown as usual (as a pointer), whereas
10645 a reference should mostly be transparent to the user. */
10646 if (ada_is_tagged_type (type
, 0)
10647 || (TYPE_CODE (type
) == TYPE_CODE_REF
10648 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10650 /* Tagged types are a little special in the fact that the real
10651 type is dynamic and can only be determined by inspecting the
10652 object's tag. This means that we need to get the object's
10653 value first (EVAL_NORMAL) and then extract the actual object
10656 Note that we cannot skip the final step where we extract
10657 the object type from its tag, because the EVAL_NORMAL phase
10658 results in dynamic components being resolved into fixed ones.
10659 This can cause problems when trying to print the type
10660 description of tagged types whose parent has a dynamic size:
10661 We use the type name of the "_parent" component in order
10662 to print the name of the ancestor type in the type description.
10663 If that component had a dynamic size, the resolution into
10664 a fixed type would result in the loss of that type name,
10665 thus preventing us from printing the name of the ancestor
10666 type in the type description. */
10667 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10669 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10671 struct type
*actual_type
;
10673 actual_type
= type_from_tag (ada_value_tag (arg1
));
10674 if (actual_type
== NULL
)
10675 /* If, for some reason, we were unable to determine
10676 the actual type from the tag, then use the static
10677 approximation that we just computed as a fallback.
10678 This can happen if the debugging information is
10679 incomplete, for instance. */
10680 actual_type
= type
;
10681 return value_zero (actual_type
, not_lval
);
10685 /* In the case of a ref, ada_coerce_ref takes care
10686 of determining the actual type. But the evaluation
10687 should return a ref as it should be valid to ask
10688 for its address; so rebuild a ref after coerce. */
10689 arg1
= ada_coerce_ref (arg1
);
10690 return value_ref (arg1
, TYPE_CODE_REF
);
10694 /* Records and unions for which GNAT encodings have been
10695 generated need to be statically fixed as well.
10696 Otherwise, non-static fixing produces a type where
10697 all dynamic properties are removed, which prevents "ptype"
10698 from being able to completely describe the type.
10699 For instance, a case statement in a variant record would be
10700 replaced by the relevant components based on the actual
10701 value of the discriminants. */
10702 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10703 && dynamic_template_type (type
) != NULL
)
10704 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10705 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10708 return value_zero (to_static_fixed_type (type
), not_lval
);
10712 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10713 return ada_to_fixed_value (arg1
);
10718 /* Allocate arg vector, including space for the function to be
10719 called in argvec[0] and a terminating NULL. */
10720 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10721 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10723 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10724 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10725 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10726 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10729 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10730 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10733 if (noside
== EVAL_SKIP
)
10737 if (ada_is_constrained_packed_array_type
10738 (desc_base_type (value_type (argvec
[0]))))
10739 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10740 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10741 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10742 /* This is a packed array that has already been fixed, and
10743 therefore already coerced to a simple array. Nothing further
10746 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10748 /* Make sure we dereference references so that all the code below
10749 feels like it's really handling the referenced value. Wrapping
10750 types (for alignment) may be there, so make sure we strip them as
10752 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10754 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10755 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10756 argvec
[0] = value_addr (argvec
[0]);
10758 type
= ada_check_typedef (value_type (argvec
[0]));
10760 /* Ada allows us to implicitly dereference arrays when subscripting
10761 them. So, if this is an array typedef (encoding use for array
10762 access types encoded as fat pointers), strip it now. */
10763 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10764 type
= ada_typedef_target_type (type
);
10766 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10768 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10770 case TYPE_CODE_FUNC
:
10771 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10773 case TYPE_CODE_ARRAY
:
10775 case TYPE_CODE_STRUCT
:
10776 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10777 argvec
[0] = ada_value_ind (argvec
[0]);
10778 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10781 error (_("cannot subscript or call something of type `%s'"),
10782 ada_type_name (value_type (argvec
[0])));
10787 switch (TYPE_CODE (type
))
10789 case TYPE_CODE_FUNC
:
10790 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10792 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10794 if (TYPE_GNU_IFUNC (type
))
10795 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10796 return allocate_value (rtype
);
10798 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10799 case TYPE_CODE_INTERNAL_FUNCTION
:
10800 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10801 /* We don't know anything about what the internal
10802 function might return, but we have to return
10804 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10807 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10808 argvec
[0], nargs
, argvec
+ 1);
10810 case TYPE_CODE_STRUCT
:
10814 arity
= ada_array_arity (type
);
10815 type
= ada_array_element_type (type
, nargs
);
10817 error (_("cannot subscript or call a record"));
10818 if (arity
!= nargs
)
10819 error (_("wrong number of subscripts; expecting %d"), arity
);
10820 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10821 return value_zero (ada_aligned_type (type
), lval_memory
);
10823 unwrap_value (ada_value_subscript
10824 (argvec
[0], nargs
, argvec
+ 1));
10826 case TYPE_CODE_ARRAY
:
10827 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10829 type
= ada_array_element_type (type
, nargs
);
10831 error (_("element type of array unknown"));
10833 return value_zero (ada_aligned_type (type
), lval_memory
);
10836 unwrap_value (ada_value_subscript
10837 (ada_coerce_to_simple_array (argvec
[0]),
10838 nargs
, argvec
+ 1));
10839 case TYPE_CODE_PTR
: /* Pointer to array */
10840 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10842 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10843 type
= ada_array_element_type (type
, nargs
);
10845 error (_("element type of array unknown"));
10847 return value_zero (ada_aligned_type (type
), lval_memory
);
10850 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10851 nargs
, argvec
+ 1));
10854 error (_("Attempt to index or call something other than an "
10855 "array or function"));
10860 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10861 struct value
*low_bound_val
=
10862 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10863 struct value
*high_bound_val
=
10864 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10866 LONGEST high_bound
;
10868 low_bound_val
= coerce_ref (low_bound_val
);
10869 high_bound_val
= coerce_ref (high_bound_val
);
10870 low_bound
= value_as_long (low_bound_val
);
10871 high_bound
= value_as_long (high_bound_val
);
10873 if (noside
== EVAL_SKIP
)
10876 /* If this is a reference to an aligner type, then remove all
10878 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10879 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10880 TYPE_TARGET_TYPE (value_type (array
)) =
10881 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10883 if (ada_is_constrained_packed_array_type (value_type (array
)))
10884 error (_("cannot slice a packed array"));
10886 /* If this is a reference to an array or an array lvalue,
10887 convert to a pointer. */
10888 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10889 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10890 && VALUE_LVAL (array
) == lval_memory
))
10891 array
= value_addr (array
);
10893 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10894 && ada_is_array_descriptor_type (ada_check_typedef
10895 (value_type (array
))))
10896 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10898 array
= ada_coerce_to_simple_array_ptr (array
);
10900 /* If we have more than one level of pointer indirection,
10901 dereference the value until we get only one level. */
10902 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10903 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10905 array
= value_ind (array
);
10907 /* Make sure we really do have an array type before going further,
10908 to avoid a SEGV when trying to get the index type or the target
10909 type later down the road if the debug info generated by
10910 the compiler is incorrect or incomplete. */
10911 if (!ada_is_simple_array_type (value_type (array
)))
10912 error (_("cannot take slice of non-array"));
10914 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10917 struct type
*type0
= ada_check_typedef (value_type (array
));
10919 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10920 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10923 struct type
*arr_type0
=
10924 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10926 return ada_value_slice_from_ptr (array
, arr_type0
,
10927 longest_to_int (low_bound
),
10928 longest_to_int (high_bound
));
10931 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10933 else if (high_bound
< low_bound
)
10934 return empty_array (value_type (array
), low_bound
);
10936 return ada_value_slice (array
, longest_to_int (low_bound
),
10937 longest_to_int (high_bound
));
10940 case UNOP_IN_RANGE
:
10942 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10943 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10945 if (noside
== EVAL_SKIP
)
10948 switch (TYPE_CODE (type
))
10951 lim_warning (_("Membership test incompletely implemented; "
10952 "always returns true"));
10953 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10954 return value_from_longest (type
, (LONGEST
) 1);
10956 case TYPE_CODE_RANGE
:
10957 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10958 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10959 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10960 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10961 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10963 value_from_longest (type
,
10964 (value_less (arg1
, arg3
)
10965 || value_equal (arg1
, arg3
))
10966 && (value_less (arg2
, arg1
)
10967 || value_equal (arg2
, arg1
)));
10970 case BINOP_IN_BOUNDS
:
10972 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10973 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10975 if (noside
== EVAL_SKIP
)
10978 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10980 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10981 return value_zero (type
, not_lval
);
10984 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10986 type
= ada_index_type (value_type (arg2
), tem
, "range");
10988 type
= value_type (arg1
);
10990 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10991 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10993 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10994 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10995 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10997 value_from_longest (type
,
10998 (value_less (arg1
, arg3
)
10999 || value_equal (arg1
, arg3
))
11000 && (value_less (arg2
, arg1
)
11001 || value_equal (arg2
, arg1
)));
11003 case TERNOP_IN_RANGE
:
11004 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11005 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11006 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11008 if (noside
== EVAL_SKIP
)
11011 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11012 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
11013 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
11015 value_from_longest (type
,
11016 (value_less (arg1
, arg3
)
11017 || value_equal (arg1
, arg3
))
11018 && (value_less (arg2
, arg1
)
11019 || value_equal (arg2
, arg1
)));
11023 case OP_ATR_LENGTH
:
11025 struct type
*type_arg
;
11027 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11029 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11031 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11035 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11039 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
11040 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
11041 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
11044 if (noside
== EVAL_SKIP
)
11047 if (type_arg
== NULL
)
11049 arg1
= ada_coerce_ref (arg1
);
11051 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11052 arg1
= ada_coerce_to_simple_array (arg1
);
11054 if (op
== OP_ATR_LENGTH
)
11055 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11058 type
= ada_index_type (value_type (arg1
), tem
,
11059 ada_attribute_name (op
));
11061 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11064 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11065 return allocate_value (type
);
11069 default: /* Should never happen. */
11070 error (_("unexpected attribute encountered"));
11072 return value_from_longest
11073 (type
, ada_array_bound (arg1
, tem
, 0));
11075 return value_from_longest
11076 (type
, ada_array_bound (arg1
, tem
, 1));
11077 case OP_ATR_LENGTH
:
11078 return value_from_longest
11079 (type
, ada_array_length (arg1
, tem
));
11082 else if (discrete_type_p (type_arg
))
11084 struct type
*range_type
;
11085 const char *name
= ada_type_name (type_arg
);
11088 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
11089 range_type
= to_fixed_range_type (type_arg
, NULL
);
11090 if (range_type
== NULL
)
11091 range_type
= type_arg
;
11095 error (_("unexpected attribute encountered"));
11097 return value_from_longest
11098 (range_type
, ada_discrete_type_low_bound (range_type
));
11100 return value_from_longest
11101 (range_type
, ada_discrete_type_high_bound (range_type
));
11102 case OP_ATR_LENGTH
:
11103 error (_("the 'length attribute applies only to array types"));
11106 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11107 error (_("unimplemented type attribute"));
11112 if (ada_is_constrained_packed_array_type (type_arg
))
11113 type_arg
= decode_constrained_packed_array_type (type_arg
);
11115 if (op
== OP_ATR_LENGTH
)
11116 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11119 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11121 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11124 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11125 return allocate_value (type
);
11130 error (_("unexpected attribute encountered"));
11132 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11133 return value_from_longest (type
, low
);
11135 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11136 return value_from_longest (type
, high
);
11137 case OP_ATR_LENGTH
:
11138 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11139 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11140 return value_from_longest (type
, high
- low
+ 1);
11146 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11147 if (noside
== EVAL_SKIP
)
11150 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11151 return value_zero (ada_tag_type (arg1
), not_lval
);
11153 return ada_value_tag (arg1
);
11157 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11158 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11159 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11160 if (noside
== EVAL_SKIP
)
11162 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11163 return value_zero (value_type (arg1
), not_lval
);
11166 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11167 return value_binop (arg1
, arg2
,
11168 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11171 case OP_ATR_MODULUS
:
11173 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11175 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11176 if (noside
== EVAL_SKIP
)
11179 if (!ada_is_modular_type (type_arg
))
11180 error (_("'modulus must be applied to modular type"));
11182 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11183 ada_modulus (type_arg
));
11188 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11189 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11190 if (noside
== EVAL_SKIP
)
11192 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11193 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11194 return value_zero (type
, not_lval
);
11196 return value_pos_atr (type
, arg1
);
11199 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11200 type
= value_type (arg1
);
11202 /* If the argument is a reference, then dereference its type, since
11203 the user is really asking for the size of the actual object,
11204 not the size of the pointer. */
11205 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11206 type
= TYPE_TARGET_TYPE (type
);
11208 if (noside
== EVAL_SKIP
)
11210 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11211 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11213 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11214 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11217 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11218 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11219 type
= exp
->elts
[pc
+ 2].type
;
11220 if (noside
== EVAL_SKIP
)
11222 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11223 return value_zero (type
, not_lval
);
11225 return value_val_atr (type
, arg1
);
11228 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11229 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11230 if (noside
== EVAL_SKIP
)
11232 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11233 return value_zero (value_type (arg1
), not_lval
);
11236 /* For integer exponentiation operations,
11237 only promote the first argument. */
11238 if (is_integral_type (value_type (arg2
)))
11239 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11241 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11243 return value_binop (arg1
, arg2
, op
);
11247 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11248 if (noside
== EVAL_SKIP
)
11254 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11255 if (noside
== EVAL_SKIP
)
11257 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11258 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11259 return value_neg (arg1
);
11264 preeval_pos
= *pos
;
11265 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11266 if (noside
== EVAL_SKIP
)
11268 type
= ada_check_typedef (value_type (arg1
));
11269 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11271 if (ada_is_array_descriptor_type (type
))
11272 /* GDB allows dereferencing GNAT array descriptors. */
11274 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11276 if (arrType
== NULL
)
11277 error (_("Attempt to dereference null array pointer."));
11278 return value_at_lazy (arrType
, 0);
11280 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11281 || TYPE_CODE (type
) == TYPE_CODE_REF
11282 /* In C you can dereference an array to get the 1st elt. */
11283 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11285 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11286 only be determined by inspecting the object's tag.
11287 This means that we need to evaluate completely the
11288 expression in order to get its type. */
11290 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11291 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11292 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11294 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11296 type
= value_type (ada_value_ind (arg1
));
11300 type
= to_static_fixed_type
11302 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11304 ada_ensure_varsize_limit (type
);
11305 return value_zero (type
, lval_memory
);
11307 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11309 /* GDB allows dereferencing an int. */
11310 if (expect_type
== NULL
)
11311 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11316 to_static_fixed_type (ada_aligned_type (expect_type
));
11317 return value_zero (expect_type
, lval_memory
);
11321 error (_("Attempt to take contents of a non-pointer value."));
11323 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11324 type
= ada_check_typedef (value_type (arg1
));
11326 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11327 /* GDB allows dereferencing an int. If we were given
11328 the expect_type, then use that as the target type.
11329 Otherwise, assume that the target type is an int. */
11331 if (expect_type
!= NULL
)
11332 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11335 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11336 (CORE_ADDR
) value_as_address (arg1
));
11339 if (ada_is_array_descriptor_type (type
))
11340 /* GDB allows dereferencing GNAT array descriptors. */
11341 return ada_coerce_to_simple_array (arg1
);
11343 return ada_value_ind (arg1
);
11345 case STRUCTOP_STRUCT
:
11346 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11347 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11348 preeval_pos
= *pos
;
11349 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11350 if (noside
== EVAL_SKIP
)
11352 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11354 struct type
*type1
= value_type (arg1
);
11356 if (ada_is_tagged_type (type1
, 1))
11358 type
= ada_lookup_struct_elt_type (type1
,
11359 &exp
->elts
[pc
+ 2].string
,
11362 /* If the field is not found, check if it exists in the
11363 extension of this object's type. This means that we
11364 need to evaluate completely the expression. */
11368 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11370 arg1
= ada_value_struct_elt (arg1
,
11371 &exp
->elts
[pc
+ 2].string
,
11373 arg1
= unwrap_value (arg1
);
11374 type
= value_type (ada_to_fixed_value (arg1
));
11379 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11382 return value_zero (ada_aligned_type (type
), lval_memory
);
11386 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11387 arg1
= unwrap_value (arg1
);
11388 return ada_to_fixed_value (arg1
);
11392 /* The value is not supposed to be used. This is here to make it
11393 easier to accommodate expressions that contain types. */
11395 if (noside
== EVAL_SKIP
)
11397 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11398 return allocate_value (exp
->elts
[pc
+ 1].type
);
11400 error (_("Attempt to use a type name as an expression"));
11405 case OP_DISCRETE_RANGE
:
11406 case OP_POSITIONAL
:
11408 if (noside
== EVAL_NORMAL
)
11412 error (_("Undefined name, ambiguous name, or renaming used in "
11413 "component association: %s."), &exp
->elts
[pc
+2].string
);
11415 error (_("Aggregates only allowed on the right of an assignment"));
11417 internal_error (__FILE__
, __LINE__
,
11418 _("aggregate apparently mangled"));
11421 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11423 for (tem
= 0; tem
< nargs
; tem
+= 1)
11424 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11429 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11435 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11436 type name that encodes the 'small and 'delta information.
11437 Otherwise, return NULL. */
11439 static const char *
11440 fixed_type_info (struct type
*type
)
11442 const char *name
= ada_type_name (type
);
11443 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11445 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11447 const char *tail
= strstr (name
, "___XF_");
11454 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11455 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11460 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11463 ada_is_fixed_point_type (struct type
*type
)
11465 return fixed_type_info (type
) != NULL
;
11468 /* Return non-zero iff TYPE represents a System.Address type. */
11471 ada_is_system_address_type (struct type
*type
)
11473 return (TYPE_NAME (type
)
11474 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11477 /* Assuming that TYPE is the representation of an Ada fixed-point
11478 type, return its delta, or -1 if the type is malformed and the
11479 delta cannot be determined. */
11482 ada_delta (struct type
*type
)
11484 const char *encoding
= fixed_type_info (type
);
11487 /* Strictly speaking, num and den are encoded as integer. However,
11488 they may not fit into a long, and they will have to be converted
11489 to DOUBLEST anyway. So scan them as DOUBLEST. */
11490 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11497 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11498 factor ('SMALL value) associated with the type. */
11501 scaling_factor (struct type
*type
)
11503 const char *encoding
= fixed_type_info (type
);
11504 DOUBLEST num0
, den0
, num1
, den1
;
11507 /* Strictly speaking, num's and den's are encoded as integer. However,
11508 they may not fit into a long, and they will have to be converted
11509 to DOUBLEST anyway. So scan them as DOUBLEST. */
11510 n
= sscanf (encoding
,
11511 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11512 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11513 &num0
, &den0
, &num1
, &den1
);
11518 return num1
/ den1
;
11520 return num0
/ den0
;
11524 /* Assuming that X is the representation of a value of fixed-point
11525 type TYPE, return its floating-point equivalent. */
11528 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11530 return (DOUBLEST
) x
*scaling_factor (type
);
11533 /* The representation of a fixed-point value of type TYPE
11534 corresponding to the value X. */
11537 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11539 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11546 /* Scan STR beginning at position K for a discriminant name, and
11547 return the value of that discriminant field of DVAL in *PX. If
11548 PNEW_K is not null, put the position of the character beyond the
11549 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11550 not alter *PX and *PNEW_K if unsuccessful. */
11553 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11556 static char *bound_buffer
= NULL
;
11557 static size_t bound_buffer_len
= 0;
11558 const char *pstart
, *pend
, *bound
;
11559 struct value
*bound_val
;
11561 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11565 pend
= strstr (pstart
, "__");
11569 k
+= strlen (bound
);
11573 int len
= pend
- pstart
;
11575 /* Strip __ and beyond. */
11576 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11577 strncpy (bound_buffer
, pstart
, len
);
11578 bound_buffer
[len
] = '\0';
11580 bound
= bound_buffer
;
11584 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11585 if (bound_val
== NULL
)
11588 *px
= value_as_long (bound_val
);
11589 if (pnew_k
!= NULL
)
11594 /* Value of variable named NAME in the current environment. If
11595 no such variable found, then if ERR_MSG is null, returns 0, and
11596 otherwise causes an error with message ERR_MSG. */
11598 static struct value
*
11599 get_var_value (const char *name
, const char *err_msg
)
11601 struct block_symbol
*syms
;
11604 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11609 if (err_msg
== NULL
)
11612 error (("%s"), err_msg
);
11615 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11618 /* Value of integer variable named NAME in the current environment.
11619 If no such variable is found, returns false. Otherwise, sets VALUE
11620 to the variable's value and returns true. */
11623 get_int_var_value (const char *name
, LONGEST
&value
)
11625 struct value
*var_val
= get_var_value (name
, 0);
11630 value
= value_as_long (var_val
);
11635 /* Return a range type whose base type is that of the range type named
11636 NAME in the current environment, and whose bounds are calculated
11637 from NAME according to the GNAT range encoding conventions.
11638 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11639 corresponding range type from debug information; fall back to using it
11640 if symbol lookup fails. If a new type must be created, allocate it
11641 like ORIG_TYPE was. The bounds information, in general, is encoded
11642 in NAME, the base type given in the named range type. */
11644 static struct type
*
11645 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11648 struct type
*base_type
;
11649 const char *subtype_info
;
11651 gdb_assert (raw_type
!= NULL
);
11652 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11654 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11655 base_type
= TYPE_TARGET_TYPE (raw_type
);
11657 base_type
= raw_type
;
11659 name
= TYPE_NAME (raw_type
);
11660 subtype_info
= strstr (name
, "___XD");
11661 if (subtype_info
== NULL
)
11663 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11664 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11666 if (L
< INT_MIN
|| U
> INT_MAX
)
11669 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11674 static char *name_buf
= NULL
;
11675 static size_t name_len
= 0;
11676 int prefix_len
= subtype_info
- name
;
11679 const char *bounds_str
;
11682 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11683 strncpy (name_buf
, name
, prefix_len
);
11684 name_buf
[prefix_len
] = '\0';
11687 bounds_str
= strchr (subtype_info
, '_');
11690 if (*subtype_info
== 'L')
11692 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11693 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11695 if (bounds_str
[n
] == '_')
11697 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11703 strcpy (name_buf
+ prefix_len
, "___L");
11704 if (!get_int_var_value (name_buf
, L
))
11706 lim_warning (_("Unknown lower bound, using 1."));
11711 if (*subtype_info
== 'U')
11713 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11714 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11719 strcpy (name_buf
+ prefix_len
, "___U");
11720 if (!get_int_var_value (name_buf
, U
))
11722 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11727 type
= create_static_range_type (alloc_type_copy (raw_type
),
11729 TYPE_NAME (type
) = name
;
11734 /* True iff NAME is the name of a range type. */
11737 ada_is_range_type_name (const char *name
)
11739 return (name
!= NULL
&& strstr (name
, "___XD"));
11743 /* Modular types */
11745 /* True iff TYPE is an Ada modular type. */
11748 ada_is_modular_type (struct type
*type
)
11750 struct type
*subranged_type
= get_base_type (type
);
11752 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11753 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11754 && TYPE_UNSIGNED (subranged_type
));
11757 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11760 ada_modulus (struct type
*type
)
11762 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11766 /* Ada exception catchpoint support:
11767 ---------------------------------
11769 We support 3 kinds of exception catchpoints:
11770 . catchpoints on Ada exceptions
11771 . catchpoints on unhandled Ada exceptions
11772 . catchpoints on failed assertions
11774 Exceptions raised during failed assertions, or unhandled exceptions
11775 could perfectly be caught with the general catchpoint on Ada exceptions.
11776 However, we can easily differentiate these two special cases, and having
11777 the option to distinguish these two cases from the rest can be useful
11778 to zero-in on certain situations.
11780 Exception catchpoints are a specialized form of breakpoint,
11781 since they rely on inserting breakpoints inside known routines
11782 of the GNAT runtime. The implementation therefore uses a standard
11783 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11786 Support in the runtime for exception catchpoints have been changed
11787 a few times already, and these changes affect the implementation
11788 of these catchpoints. In order to be able to support several
11789 variants of the runtime, we use a sniffer that will determine
11790 the runtime variant used by the program being debugged. */
11792 /* Ada's standard exceptions.
11794 The Ada 83 standard also defined Numeric_Error. But there so many
11795 situations where it was unclear from the Ada 83 Reference Manual
11796 (RM) whether Constraint_Error or Numeric_Error should be raised,
11797 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11798 Interpretation saying that anytime the RM says that Numeric_Error
11799 should be raised, the implementation may raise Constraint_Error.
11800 Ada 95 went one step further and pretty much removed Numeric_Error
11801 from the list of standard exceptions (it made it a renaming of
11802 Constraint_Error, to help preserve compatibility when compiling
11803 an Ada83 compiler). As such, we do not include Numeric_Error from
11804 this list of standard exceptions. */
11806 static const char *standard_exc
[] = {
11807 "constraint_error",
11813 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11815 /* A structure that describes how to support exception catchpoints
11816 for a given executable. */
11818 struct exception_support_info
11820 /* The name of the symbol to break on in order to insert
11821 a catchpoint on exceptions. */
11822 const char *catch_exception_sym
;
11824 /* The name of the symbol to break on in order to insert
11825 a catchpoint on unhandled exceptions. */
11826 const char *catch_exception_unhandled_sym
;
11828 /* The name of the symbol to break on in order to insert
11829 a catchpoint on failed assertions. */
11830 const char *catch_assert_sym
;
11832 /* Assuming that the inferior just triggered an unhandled exception
11833 catchpoint, this function is responsible for returning the address
11834 in inferior memory where the name of that exception is stored.
11835 Return zero if the address could not be computed. */
11836 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11839 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11840 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11842 /* The following exception support info structure describes how to
11843 implement exception catchpoints with the latest version of the
11844 Ada runtime (as of 2007-03-06). */
11846 static const struct exception_support_info default_exception_support_info
=
11848 "__gnat_debug_raise_exception", /* catch_exception_sym */
11849 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11850 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11851 ada_unhandled_exception_name_addr
11854 /* The following exception support info structure describes how to
11855 implement exception catchpoints with a slightly older version
11856 of the Ada runtime. */
11858 static const struct exception_support_info exception_support_info_fallback
=
11860 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11861 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11862 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11863 ada_unhandled_exception_name_addr_from_raise
11866 /* Return nonzero if we can detect the exception support routines
11867 described in EINFO.
11869 This function errors out if an abnormal situation is detected
11870 (for instance, if we find the exception support routines, but
11871 that support is found to be incomplete). */
11874 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11876 struct symbol
*sym
;
11878 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11879 that should be compiled with debugging information. As a result, we
11880 expect to find that symbol in the symtabs. */
11882 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11885 /* Perhaps we did not find our symbol because the Ada runtime was
11886 compiled without debugging info, or simply stripped of it.
11887 It happens on some GNU/Linux distributions for instance, where
11888 users have to install a separate debug package in order to get
11889 the runtime's debugging info. In that situation, let the user
11890 know why we cannot insert an Ada exception catchpoint.
11892 Note: Just for the purpose of inserting our Ada exception
11893 catchpoint, we could rely purely on the associated minimal symbol.
11894 But we would be operating in degraded mode anyway, since we are
11895 still lacking the debugging info needed later on to extract
11896 the name of the exception being raised (this name is printed in
11897 the catchpoint message, and is also used when trying to catch
11898 a specific exception). We do not handle this case for now. */
11899 struct bound_minimal_symbol msym
11900 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11902 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11903 error (_("Your Ada runtime appears to be missing some debugging "
11904 "information.\nCannot insert Ada exception catchpoint "
11905 "in this configuration."));
11910 /* Make sure that the symbol we found corresponds to a function. */
11912 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11913 error (_("Symbol \"%s\" is not a function (class = %d)"),
11914 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11919 /* Inspect the Ada runtime and determine which exception info structure
11920 should be used to provide support for exception catchpoints.
11922 This function will always set the per-inferior exception_info,
11923 or raise an error. */
11926 ada_exception_support_info_sniffer (void)
11928 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11930 /* If the exception info is already known, then no need to recompute it. */
11931 if (data
->exception_info
!= NULL
)
11934 /* Check the latest (default) exception support info. */
11935 if (ada_has_this_exception_support (&default_exception_support_info
))
11937 data
->exception_info
= &default_exception_support_info
;
11941 /* Try our fallback exception suport info. */
11942 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11944 data
->exception_info
= &exception_support_info_fallback
;
11948 /* Sometimes, it is normal for us to not be able to find the routine
11949 we are looking for. This happens when the program is linked with
11950 the shared version of the GNAT runtime, and the program has not been
11951 started yet. Inform the user of these two possible causes if
11954 if (ada_update_initial_language (language_unknown
) != language_ada
)
11955 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11957 /* If the symbol does not exist, then check that the program is
11958 already started, to make sure that shared libraries have been
11959 loaded. If it is not started, this may mean that the symbol is
11960 in a shared library. */
11962 if (ptid_get_pid (inferior_ptid
) == 0)
11963 error (_("Unable to insert catchpoint. Try to start the program first."));
11965 /* At this point, we know that we are debugging an Ada program and
11966 that the inferior has been started, but we still are not able to
11967 find the run-time symbols. That can mean that we are in
11968 configurable run time mode, or that a-except as been optimized
11969 out by the linker... In any case, at this point it is not worth
11970 supporting this feature. */
11972 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11975 /* True iff FRAME is very likely to be that of a function that is
11976 part of the runtime system. This is all very heuristic, but is
11977 intended to be used as advice as to what frames are uninteresting
11981 is_known_support_routine (struct frame_info
*frame
)
11983 struct symtab_and_line sal
;
11985 enum language func_lang
;
11987 const char *fullname
;
11989 /* If this code does not have any debugging information (no symtab),
11990 This cannot be any user code. */
11992 find_frame_sal (frame
, &sal
);
11993 if (sal
.symtab
== NULL
)
11996 /* If there is a symtab, but the associated source file cannot be
11997 located, then assume this is not user code: Selecting a frame
11998 for which we cannot display the code would not be very helpful
11999 for the user. This should also take care of case such as VxWorks
12000 where the kernel has some debugging info provided for a few units. */
12002 fullname
= symtab_to_fullname (sal
.symtab
);
12003 if (access (fullname
, R_OK
) != 0)
12006 /* Check the unit filename againt the Ada runtime file naming.
12007 We also check the name of the objfile against the name of some
12008 known system libraries that sometimes come with debugging info
12011 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12013 re_comp (known_runtime_file_name_patterns
[i
]);
12014 if (re_exec (lbasename (sal
.symtab
->filename
)))
12016 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12017 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12021 /* Check whether the function is a GNAT-generated entity. */
12023 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
12024 if (func_name
== NULL
)
12027 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12029 re_comp (known_auxiliary_function_name_patterns
[i
]);
12030 if (re_exec (func_name
))
12041 /* Find the first frame that contains debugging information and that is not
12042 part of the Ada run-time, starting from FI and moving upward. */
12045 ada_find_printable_frame (struct frame_info
*fi
)
12047 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12049 if (!is_known_support_routine (fi
))
12058 /* Assuming that the inferior just triggered an unhandled exception
12059 catchpoint, return the address in inferior memory where the name
12060 of the exception is stored.
12062 Return zero if the address could not be computed. */
12065 ada_unhandled_exception_name_addr (void)
12067 return parse_and_eval_address ("e.full_name");
12070 /* Same as ada_unhandled_exception_name_addr, except that this function
12071 should be used when the inferior uses an older version of the runtime,
12072 where the exception name needs to be extracted from a specific frame
12073 several frames up in the callstack. */
12076 ada_unhandled_exception_name_addr_from_raise (void)
12079 struct frame_info
*fi
;
12080 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12081 struct cleanup
*old_chain
;
12083 /* To determine the name of this exception, we need to select
12084 the frame corresponding to RAISE_SYM_NAME. This frame is
12085 at least 3 levels up, so we simply skip the first 3 frames
12086 without checking the name of their associated function. */
12087 fi
= get_current_frame ();
12088 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12090 fi
= get_prev_frame (fi
);
12092 old_chain
= make_cleanup (null_cleanup
, NULL
);
12096 enum language func_lang
;
12098 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
12099 if (func_name
!= NULL
)
12101 make_cleanup (xfree
, func_name
);
12103 if (strcmp (func_name
,
12104 data
->exception_info
->catch_exception_sym
) == 0)
12105 break; /* We found the frame we were looking for... */
12106 fi
= get_prev_frame (fi
);
12109 do_cleanups (old_chain
);
12115 return parse_and_eval_address ("id.full_name");
12118 /* Assuming the inferior just triggered an Ada exception catchpoint
12119 (of any type), return the address in inferior memory where the name
12120 of the exception is stored, if applicable.
12122 Assumes the selected frame is the current frame.
12124 Return zero if the address could not be computed, or if not relevant. */
12127 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12128 struct breakpoint
*b
)
12130 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12134 case ada_catch_exception
:
12135 return (parse_and_eval_address ("e.full_name"));
12138 case ada_catch_exception_unhandled
:
12139 return data
->exception_info
->unhandled_exception_name_addr ();
12142 case ada_catch_assert
:
12143 return 0; /* Exception name is not relevant in this case. */
12147 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12151 return 0; /* Should never be reached. */
12154 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12155 any error that ada_exception_name_addr_1 might cause to be thrown.
12156 When an error is intercepted, a warning with the error message is printed,
12157 and zero is returned. */
12160 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12161 struct breakpoint
*b
)
12163 CORE_ADDR result
= 0;
12167 result
= ada_exception_name_addr_1 (ex
, b
);
12170 CATCH (e
, RETURN_MASK_ERROR
)
12172 warning (_("failed to get exception name: %s"), e
.message
);
12180 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
12182 /* Ada catchpoints.
12184 In the case of catchpoints on Ada exceptions, the catchpoint will
12185 stop the target on every exception the program throws. When a user
12186 specifies the name of a specific exception, we translate this
12187 request into a condition expression (in text form), and then parse
12188 it into an expression stored in each of the catchpoint's locations.
12189 We then use this condition to check whether the exception that was
12190 raised is the one the user is interested in. If not, then the
12191 target is resumed again. We store the name of the requested
12192 exception, in order to be able to re-set the condition expression
12193 when symbols change. */
12195 /* An instance of this type is used to represent an Ada catchpoint
12196 breakpoint location. */
12198 class ada_catchpoint_location
: public bp_location
12201 ada_catchpoint_location (const bp_location_ops
*ops
, breakpoint
*owner
)
12202 : bp_location (ops
, owner
)
12205 /* The condition that checks whether the exception that was raised
12206 is the specific exception the user specified on catchpoint
12208 expression_up excep_cond_expr
;
12211 /* Implement the DTOR method in the bp_location_ops structure for all
12212 Ada exception catchpoint kinds. */
12215 ada_catchpoint_location_dtor (struct bp_location
*bl
)
12217 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
12219 al
->excep_cond_expr
.reset ();
12222 /* The vtable to be used in Ada catchpoint locations. */
12224 static const struct bp_location_ops ada_catchpoint_location_ops
=
12226 ada_catchpoint_location_dtor
12229 /* An instance of this type is used to represent an Ada catchpoint. */
12231 struct ada_catchpoint
: public breakpoint
12233 ~ada_catchpoint () override
;
12235 /* The name of the specific exception the user specified. */
12236 char *excep_string
;
12239 /* Parse the exception condition string in the context of each of the
12240 catchpoint's locations, and store them for later evaluation. */
12243 create_excep_cond_exprs (struct ada_catchpoint
*c
)
12245 struct cleanup
*old_chain
;
12246 struct bp_location
*bl
;
12249 /* Nothing to do if there's no specific exception to catch. */
12250 if (c
->excep_string
== NULL
)
12253 /* Same if there are no locations... */
12254 if (c
->loc
== NULL
)
12257 /* Compute the condition expression in text form, from the specific
12258 expection we want to catch. */
12259 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
12260 old_chain
= make_cleanup (xfree
, cond_string
);
12262 /* Iterate over all the catchpoint's locations, and parse an
12263 expression for each. */
12264 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12266 struct ada_catchpoint_location
*ada_loc
12267 = (struct ada_catchpoint_location
*) bl
;
12270 if (!bl
->shlib_disabled
)
12277 exp
= parse_exp_1 (&s
, bl
->address
,
12278 block_for_pc (bl
->address
),
12281 CATCH (e
, RETURN_MASK_ERROR
)
12283 warning (_("failed to reevaluate internal exception condition "
12284 "for catchpoint %d: %s"),
12285 c
->number
, e
.message
);
12290 ada_loc
->excep_cond_expr
= std::move (exp
);
12293 do_cleanups (old_chain
);
12296 /* ada_catchpoint destructor. */
12298 ada_catchpoint::~ada_catchpoint ()
12300 xfree (this->excep_string
);
12303 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12304 structure for all exception catchpoint kinds. */
12306 static struct bp_location
*
12307 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12308 struct breakpoint
*self
)
12310 return new ada_catchpoint_location (&ada_catchpoint_location_ops
, self
);
12313 /* Implement the RE_SET method in the breakpoint_ops structure for all
12314 exception catchpoint kinds. */
12317 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12319 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12321 /* Call the base class's method. This updates the catchpoint's
12323 bkpt_breakpoint_ops
.re_set (b
);
12325 /* Reparse the exception conditional expressions. One for each
12327 create_excep_cond_exprs (c
);
12330 /* Returns true if we should stop for this breakpoint hit. If the
12331 user specified a specific exception, we only want to cause a stop
12332 if the program thrown that exception. */
12335 should_stop_exception (const struct bp_location
*bl
)
12337 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12338 const struct ada_catchpoint_location
*ada_loc
12339 = (const struct ada_catchpoint_location
*) bl
;
12342 /* With no specific exception, should always stop. */
12343 if (c
->excep_string
== NULL
)
12346 if (ada_loc
->excep_cond_expr
== NULL
)
12348 /* We will have a NULL expression if back when we were creating
12349 the expressions, this location's had failed to parse. */
12356 struct value
*mark
;
12358 mark
= value_mark ();
12359 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12360 value_free_to_mark (mark
);
12362 CATCH (ex
, RETURN_MASK_ALL
)
12364 exception_fprintf (gdb_stderr
, ex
,
12365 _("Error in testing exception condition:\n"));
12372 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12373 for all exception catchpoint kinds. */
12376 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12378 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12381 /* Implement the PRINT_IT method in the breakpoint_ops structure
12382 for all exception catchpoint kinds. */
12384 static enum print_stop_action
12385 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12387 struct ui_out
*uiout
= current_uiout
;
12388 struct breakpoint
*b
= bs
->breakpoint_at
;
12390 annotate_catchpoint (b
->number
);
12392 if (uiout
->is_mi_like_p ())
12394 uiout
->field_string ("reason",
12395 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12396 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12399 uiout
->text (b
->disposition
== disp_del
12400 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12401 uiout
->field_int ("bkptno", b
->number
);
12402 uiout
->text (", ");
12404 /* ada_exception_name_addr relies on the selected frame being the
12405 current frame. Need to do this here because this function may be
12406 called more than once when printing a stop, and below, we'll
12407 select the first frame past the Ada run-time (see
12408 ada_find_printable_frame). */
12409 select_frame (get_current_frame ());
12413 case ada_catch_exception
:
12414 case ada_catch_exception_unhandled
:
12416 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12417 char exception_name
[256];
12421 read_memory (addr
, (gdb_byte
*) exception_name
,
12422 sizeof (exception_name
) - 1);
12423 exception_name
[sizeof (exception_name
) - 1] = '\0';
12427 /* For some reason, we were unable to read the exception
12428 name. This could happen if the Runtime was compiled
12429 without debugging info, for instance. In that case,
12430 just replace the exception name by the generic string
12431 "exception" - it will read as "an exception" in the
12432 notification we are about to print. */
12433 memcpy (exception_name
, "exception", sizeof ("exception"));
12435 /* In the case of unhandled exception breakpoints, we print
12436 the exception name as "unhandled EXCEPTION_NAME", to make
12437 it clearer to the user which kind of catchpoint just got
12438 hit. We used ui_out_text to make sure that this extra
12439 info does not pollute the exception name in the MI case. */
12440 if (ex
== ada_catch_exception_unhandled
)
12441 uiout
->text ("unhandled ");
12442 uiout
->field_string ("exception-name", exception_name
);
12445 case ada_catch_assert
:
12446 /* In this case, the name of the exception is not really
12447 important. Just print "failed assertion" to make it clearer
12448 that his program just hit an assertion-failure catchpoint.
12449 We used ui_out_text because this info does not belong in
12451 uiout
->text ("failed assertion");
12454 uiout
->text (" at ");
12455 ada_find_printable_frame (get_current_frame ());
12457 return PRINT_SRC_AND_LOC
;
12460 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12461 for all exception catchpoint kinds. */
12464 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12465 struct breakpoint
*b
, struct bp_location
**last_loc
)
12467 struct ui_out
*uiout
= current_uiout
;
12468 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12469 struct value_print_options opts
;
12471 get_user_print_options (&opts
);
12472 if (opts
.addressprint
)
12474 annotate_field (4);
12475 uiout
->field_core_addr ("addr", b
->loc
->gdbarch
, b
->loc
->address
);
12478 annotate_field (5);
12479 *last_loc
= b
->loc
;
12482 case ada_catch_exception
:
12483 if (c
->excep_string
!= NULL
)
12485 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12487 uiout
->field_string ("what", msg
);
12491 uiout
->field_string ("what", "all Ada exceptions");
12495 case ada_catch_exception_unhandled
:
12496 uiout
->field_string ("what", "unhandled Ada exceptions");
12499 case ada_catch_assert
:
12500 uiout
->field_string ("what", "failed Ada assertions");
12504 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12509 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12510 for all exception catchpoint kinds. */
12513 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12514 struct breakpoint
*b
)
12516 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12517 struct ui_out
*uiout
= current_uiout
;
12519 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12520 : _("Catchpoint "));
12521 uiout
->field_int ("bkptno", b
->number
);
12522 uiout
->text (": ");
12526 case ada_catch_exception
:
12527 if (c
->excep_string
!= NULL
)
12529 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12530 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12532 uiout
->text (info
);
12533 do_cleanups (old_chain
);
12536 uiout
->text (_("all Ada exceptions"));
12539 case ada_catch_exception_unhandled
:
12540 uiout
->text (_("unhandled Ada exceptions"));
12543 case ada_catch_assert
:
12544 uiout
->text (_("failed Ada assertions"));
12548 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12553 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12554 for all exception catchpoint kinds. */
12557 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12558 struct breakpoint
*b
, struct ui_file
*fp
)
12560 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12564 case ada_catch_exception
:
12565 fprintf_filtered (fp
, "catch exception");
12566 if (c
->excep_string
!= NULL
)
12567 fprintf_filtered (fp
, " %s", c
->excep_string
);
12570 case ada_catch_exception_unhandled
:
12571 fprintf_filtered (fp
, "catch exception unhandled");
12574 case ada_catch_assert
:
12575 fprintf_filtered (fp
, "catch assert");
12579 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12581 print_recreate_thread (b
, fp
);
12584 /* Virtual table for "catch exception" breakpoints. */
12586 static struct bp_location
*
12587 allocate_location_catch_exception (struct breakpoint
*self
)
12589 return allocate_location_exception (ada_catch_exception
, self
);
12593 re_set_catch_exception (struct breakpoint
*b
)
12595 re_set_exception (ada_catch_exception
, b
);
12599 check_status_catch_exception (bpstat bs
)
12601 check_status_exception (ada_catch_exception
, bs
);
12604 static enum print_stop_action
12605 print_it_catch_exception (bpstat bs
)
12607 return print_it_exception (ada_catch_exception
, bs
);
12611 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12613 print_one_exception (ada_catch_exception
, b
, last_loc
);
12617 print_mention_catch_exception (struct breakpoint
*b
)
12619 print_mention_exception (ada_catch_exception
, b
);
12623 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12625 print_recreate_exception (ada_catch_exception
, b
, fp
);
12628 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12630 /* Virtual table for "catch exception unhandled" breakpoints. */
12632 static struct bp_location
*
12633 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12635 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12639 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12641 re_set_exception (ada_catch_exception_unhandled
, b
);
12645 check_status_catch_exception_unhandled (bpstat bs
)
12647 check_status_exception (ada_catch_exception_unhandled
, bs
);
12650 static enum print_stop_action
12651 print_it_catch_exception_unhandled (bpstat bs
)
12653 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12657 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12658 struct bp_location
**last_loc
)
12660 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12664 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12666 print_mention_exception (ada_catch_exception_unhandled
, b
);
12670 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12671 struct ui_file
*fp
)
12673 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12676 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12678 /* Virtual table for "catch assert" breakpoints. */
12680 static struct bp_location
*
12681 allocate_location_catch_assert (struct breakpoint
*self
)
12683 return allocate_location_exception (ada_catch_assert
, self
);
12687 re_set_catch_assert (struct breakpoint
*b
)
12689 re_set_exception (ada_catch_assert
, b
);
12693 check_status_catch_assert (bpstat bs
)
12695 check_status_exception (ada_catch_assert
, bs
);
12698 static enum print_stop_action
12699 print_it_catch_assert (bpstat bs
)
12701 return print_it_exception (ada_catch_assert
, bs
);
12705 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12707 print_one_exception (ada_catch_assert
, b
, last_loc
);
12711 print_mention_catch_assert (struct breakpoint
*b
)
12713 print_mention_exception (ada_catch_assert
, b
);
12717 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12719 print_recreate_exception (ada_catch_assert
, b
, fp
);
12722 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12724 /* Return a newly allocated copy of the first space-separated token
12725 in ARGSP, and then adjust ARGSP to point immediately after that
12728 Return NULL if ARGPS does not contain any more tokens. */
12731 ada_get_next_arg (const char **argsp
)
12733 const char *args
= *argsp
;
12737 args
= skip_spaces_const (args
);
12738 if (args
[0] == '\0')
12739 return NULL
; /* No more arguments. */
12741 /* Find the end of the current argument. */
12743 end
= skip_to_space_const (args
);
12745 /* Adjust ARGSP to point to the start of the next argument. */
12749 /* Make a copy of the current argument and return it. */
12751 result
= (char *) xmalloc (end
- args
+ 1);
12752 strncpy (result
, args
, end
- args
);
12753 result
[end
- args
] = '\0';
12758 /* Split the arguments specified in a "catch exception" command.
12759 Set EX to the appropriate catchpoint type.
12760 Set EXCEP_STRING to the name of the specific exception if
12761 specified by the user.
12762 If a condition is found at the end of the arguments, the condition
12763 expression is stored in COND_STRING (memory must be deallocated
12764 after use). Otherwise COND_STRING is set to NULL. */
12767 catch_ada_exception_command_split (const char *args
,
12768 enum ada_exception_catchpoint_kind
*ex
,
12769 char **excep_string
,
12770 char **cond_string
)
12772 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12773 char *exception_name
;
12776 exception_name
= ada_get_next_arg (&args
);
12777 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12779 /* This is not an exception name; this is the start of a condition
12780 expression for a catchpoint on all exceptions. So, "un-get"
12781 this token, and set exception_name to NULL. */
12782 xfree (exception_name
);
12783 exception_name
= NULL
;
12786 make_cleanup (xfree
, exception_name
);
12788 /* Check to see if we have a condition. */
12790 args
= skip_spaces_const (args
);
12791 if (startswith (args
, "if")
12792 && (isspace (args
[2]) || args
[2] == '\0'))
12795 args
= skip_spaces_const (args
);
12797 if (args
[0] == '\0')
12798 error (_("Condition missing after `if' keyword"));
12799 cond
= xstrdup (args
);
12800 make_cleanup (xfree
, cond
);
12802 args
+= strlen (args
);
12805 /* Check that we do not have any more arguments. Anything else
12808 if (args
[0] != '\0')
12809 error (_("Junk at end of expression"));
12811 discard_cleanups (old_chain
);
12813 if (exception_name
== NULL
)
12815 /* Catch all exceptions. */
12816 *ex
= ada_catch_exception
;
12817 *excep_string
= NULL
;
12819 else if (strcmp (exception_name
, "unhandled") == 0)
12821 /* Catch unhandled exceptions. */
12822 *ex
= ada_catch_exception_unhandled
;
12823 *excep_string
= NULL
;
12827 /* Catch a specific exception. */
12828 *ex
= ada_catch_exception
;
12829 *excep_string
= exception_name
;
12831 *cond_string
= cond
;
12834 /* Return the name of the symbol on which we should break in order to
12835 implement a catchpoint of the EX kind. */
12837 static const char *
12838 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12840 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12842 gdb_assert (data
->exception_info
!= NULL
);
12846 case ada_catch_exception
:
12847 return (data
->exception_info
->catch_exception_sym
);
12849 case ada_catch_exception_unhandled
:
12850 return (data
->exception_info
->catch_exception_unhandled_sym
);
12852 case ada_catch_assert
:
12853 return (data
->exception_info
->catch_assert_sym
);
12856 internal_error (__FILE__
, __LINE__
,
12857 _("unexpected catchpoint kind (%d)"), ex
);
12861 /* Return the breakpoint ops "virtual table" used for catchpoints
12864 static const struct breakpoint_ops
*
12865 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12869 case ada_catch_exception
:
12870 return (&catch_exception_breakpoint_ops
);
12872 case ada_catch_exception_unhandled
:
12873 return (&catch_exception_unhandled_breakpoint_ops
);
12875 case ada_catch_assert
:
12876 return (&catch_assert_breakpoint_ops
);
12879 internal_error (__FILE__
, __LINE__
,
12880 _("unexpected catchpoint kind (%d)"), ex
);
12884 /* Return the condition that will be used to match the current exception
12885 being raised with the exception that the user wants to catch. This
12886 assumes that this condition is used when the inferior just triggered
12887 an exception catchpoint.
12889 The string returned is a newly allocated string that needs to be
12890 deallocated later. */
12893 ada_exception_catchpoint_cond_string (const char *excep_string
)
12897 /* The standard exceptions are a special case. They are defined in
12898 runtime units that have been compiled without debugging info; if
12899 EXCEP_STRING is the not-fully-qualified name of a standard
12900 exception (e.g. "constraint_error") then, during the evaluation
12901 of the condition expression, the symbol lookup on this name would
12902 *not* return this standard exception. The catchpoint condition
12903 may then be set only on user-defined exceptions which have the
12904 same not-fully-qualified name (e.g. my_package.constraint_error).
12906 To avoid this unexcepted behavior, these standard exceptions are
12907 systematically prefixed by "standard". This means that "catch
12908 exception constraint_error" is rewritten into "catch exception
12909 standard.constraint_error".
12911 If an exception named contraint_error is defined in another package of
12912 the inferior program, then the only way to specify this exception as a
12913 breakpoint condition is to use its fully-qualified named:
12914 e.g. my_package.constraint_error. */
12916 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12918 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12920 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12924 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12927 /* Return the symtab_and_line that should be used to insert an exception
12928 catchpoint of the TYPE kind.
12930 EXCEP_STRING should contain the name of a specific exception that
12931 the catchpoint should catch, or NULL otherwise.
12933 ADDR_STRING returns the name of the function where the real
12934 breakpoint that implements the catchpoints is set, depending on the
12935 type of catchpoint we need to create. */
12937 static struct symtab_and_line
12938 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12939 char **addr_string
, const struct breakpoint_ops
**ops
)
12941 const char *sym_name
;
12942 struct symbol
*sym
;
12944 /* First, find out which exception support info to use. */
12945 ada_exception_support_info_sniffer ();
12947 /* Then lookup the function on which we will break in order to catch
12948 the Ada exceptions requested by the user. */
12949 sym_name
= ada_exception_sym_name (ex
);
12950 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12952 /* We can assume that SYM is not NULL at this stage. If the symbol
12953 did not exist, ada_exception_support_info_sniffer would have
12954 raised an exception.
12956 Also, ada_exception_support_info_sniffer should have already
12957 verified that SYM is a function symbol. */
12958 gdb_assert (sym
!= NULL
);
12959 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12961 /* Set ADDR_STRING. */
12962 *addr_string
= xstrdup (sym_name
);
12965 *ops
= ada_exception_breakpoint_ops (ex
);
12967 return find_function_start_sal (sym
, 1);
12970 /* Create an Ada exception catchpoint.
12972 EX_KIND is the kind of exception catchpoint to be created.
12974 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12975 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12976 of the exception to which this catchpoint applies. When not NULL,
12977 the string must be allocated on the heap, and its deallocation
12978 is no longer the responsibility of the caller.
12980 COND_STRING, if not NULL, is the catchpoint condition. This string
12981 must be allocated on the heap, and its deallocation is no longer
12982 the responsibility of the caller.
12984 TEMPFLAG, if nonzero, means that the underlying breakpoint
12985 should be temporary.
12987 FROM_TTY is the usual argument passed to all commands implementations. */
12990 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12991 enum ada_exception_catchpoint_kind ex_kind
,
12992 char *excep_string
,
12998 char *addr_string
= NULL
;
12999 const struct breakpoint_ops
*ops
= NULL
;
13000 struct symtab_and_line sal
13001 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
13003 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint ());
13004 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
,
13005 ops
, tempflag
, disabled
, from_tty
);
13006 c
->excep_string
= excep_string
;
13007 create_excep_cond_exprs (c
.get ());
13008 if (cond_string
!= NULL
)
13009 set_breakpoint_condition (c
.get (), cond_string
, from_tty
);
13010 install_breakpoint (0, std::move (c
), 1);
13013 /* Implement the "catch exception" command. */
13016 catch_ada_exception_command (char *arg_entry
, int from_tty
,
13017 struct cmd_list_element
*command
)
13019 const char *arg
= arg_entry
;
13020 struct gdbarch
*gdbarch
= get_current_arch ();
13022 enum ada_exception_catchpoint_kind ex_kind
;
13023 char *excep_string
= NULL
;
13024 char *cond_string
= NULL
;
13026 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13030 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
13032 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13033 excep_string
, cond_string
,
13034 tempflag
, 1 /* enabled */,
13038 /* Split the arguments specified in a "catch assert" command.
13040 ARGS contains the command's arguments (or the empty string if
13041 no arguments were passed).
13043 If ARGS contains a condition, set COND_STRING to that condition
13044 (the memory needs to be deallocated after use). */
13047 catch_ada_assert_command_split (const char *args
, char **cond_string
)
13049 args
= skip_spaces_const (args
);
13051 /* Check whether a condition was provided. */
13052 if (startswith (args
, "if")
13053 && (isspace (args
[2]) || args
[2] == '\0'))
13056 args
= skip_spaces_const (args
);
13057 if (args
[0] == '\0')
13058 error (_("condition missing after `if' keyword"));
13059 *cond_string
= xstrdup (args
);
13062 /* Otherwise, there should be no other argument at the end of
13064 else if (args
[0] != '\0')
13065 error (_("Junk at end of arguments."));
13068 /* Implement the "catch assert" command. */
13071 catch_assert_command (char *arg_entry
, int from_tty
,
13072 struct cmd_list_element
*command
)
13074 const char *arg
= arg_entry
;
13075 struct gdbarch
*gdbarch
= get_current_arch ();
13077 char *cond_string
= NULL
;
13079 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13083 catch_ada_assert_command_split (arg
, &cond_string
);
13084 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13086 tempflag
, 1 /* enabled */,
13090 /* Return non-zero if the symbol SYM is an Ada exception object. */
13093 ada_is_exception_sym (struct symbol
*sym
)
13095 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
13097 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13098 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13099 && SYMBOL_CLASS (sym
) != LOC_CONST
13100 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13101 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13104 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13105 Ada exception object. This matches all exceptions except the ones
13106 defined by the Ada language. */
13109 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13113 if (!ada_is_exception_sym (sym
))
13116 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13117 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
13118 return 0; /* A standard exception. */
13120 /* Numeric_Error is also a standard exception, so exclude it.
13121 See the STANDARD_EXC description for more details as to why
13122 this exception is not listed in that array. */
13123 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
13129 /* A helper function for qsort, comparing two struct ada_exc_info
13132 The comparison is determined first by exception name, and then
13133 by exception address. */
13136 compare_ada_exception_info (const void *a
, const void *b
)
13138 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
13139 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
13142 result
= strcmp (exc_a
->name
, exc_b
->name
);
13146 if (exc_a
->addr
< exc_b
->addr
)
13148 if (exc_a
->addr
> exc_b
->addr
)
13154 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13155 routine, but keeping the first SKIP elements untouched.
13157 All duplicates are also removed. */
13160 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
13163 struct ada_exc_info
*to_sort
13164 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
13166 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
13169 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
13170 compare_ada_exception_info
);
13172 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
13173 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
13174 to_sort
[j
++] = to_sort
[i
];
13176 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
13179 /* Add all exceptions defined by the Ada standard whose name match
13180 a regular expression.
13182 If PREG is not NULL, then this regexp_t object is used to
13183 perform the symbol name matching. Otherwise, no name-based
13184 filtering is performed.
13186 EXCEPTIONS is a vector of exceptions to which matching exceptions
13190 ada_add_standard_exceptions (compiled_regex
*preg
,
13191 VEC(ada_exc_info
) **exceptions
)
13195 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13198 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13200 struct bound_minimal_symbol msymbol
13201 = ada_lookup_simple_minsym (standard_exc
[i
]);
13203 if (msymbol
.minsym
!= NULL
)
13205 struct ada_exc_info info
13206 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13208 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13214 /* Add all Ada exceptions defined locally and accessible from the given
13217 If PREG is not NULL, then this regexp_t object is used to
13218 perform the symbol name matching. Otherwise, no name-based
13219 filtering is performed.
13221 EXCEPTIONS is a vector of exceptions to which matching exceptions
13225 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13226 struct frame_info
*frame
,
13227 VEC(ada_exc_info
) **exceptions
)
13229 const struct block
*block
= get_frame_block (frame
, 0);
13233 struct block_iterator iter
;
13234 struct symbol
*sym
;
13236 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13238 switch (SYMBOL_CLASS (sym
))
13245 if (ada_is_exception_sym (sym
))
13247 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13248 SYMBOL_VALUE_ADDRESS (sym
)};
13250 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13254 if (BLOCK_FUNCTION (block
) != NULL
)
13256 block
= BLOCK_SUPERBLOCK (block
);
13260 /* Return true if NAME matches PREG or if PREG is NULL. */
13263 name_matches_regex (const char *name
, compiled_regex
*preg
)
13265 return (preg
== NULL
13266 || preg
->exec (ada_decode (name
), 0, NULL
, 0) == 0);
13269 /* Add all exceptions defined globally whose name name match
13270 a regular expression, excluding standard exceptions.
13272 The reason we exclude standard exceptions is that they need
13273 to be handled separately: Standard exceptions are defined inside
13274 a runtime unit which is normally not compiled with debugging info,
13275 and thus usually do not show up in our symbol search. However,
13276 if the unit was in fact built with debugging info, we need to
13277 exclude them because they would duplicate the entry we found
13278 during the special loop that specifically searches for those
13279 standard exceptions.
13281 If PREG is not NULL, then this regexp_t object is used to
13282 perform the symbol name matching. Otherwise, no name-based
13283 filtering is performed.
13285 EXCEPTIONS is a vector of exceptions to which matching exceptions
13289 ada_add_global_exceptions (compiled_regex
*preg
,
13290 VEC(ada_exc_info
) **exceptions
)
13292 struct objfile
*objfile
;
13293 struct compunit_symtab
*s
;
13295 /* In Ada, the symbol "search name" is a linkage name, whereas the
13296 regular expression used to do the matching refers to the natural
13297 name. So match against the decoded name. */
13298 expand_symtabs_matching (NULL
,
13299 [&] (const char *search_name
)
13301 const char *decoded
= ada_decode (search_name
);
13302 return name_matches_regex (decoded
, preg
);
13307 ALL_COMPUNITS (objfile
, s
)
13309 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13312 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13314 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13315 struct block_iterator iter
;
13316 struct symbol
*sym
;
13318 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13319 if (ada_is_non_standard_exception_sym (sym
)
13320 && name_matches_regex (SYMBOL_NATURAL_NAME (sym
), preg
))
13322 struct ada_exc_info info
13323 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13325 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
13331 /* Implements ada_exceptions_list with the regular expression passed
13332 as a regex_t, rather than a string.
13334 If not NULL, PREG is used to filter out exceptions whose names
13335 do not match. Otherwise, all exceptions are listed. */
13337 static VEC(ada_exc_info
) *
13338 ada_exceptions_list_1 (compiled_regex
*preg
)
13340 VEC(ada_exc_info
) *result
= NULL
;
13341 struct cleanup
*old_chain
13342 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
13345 /* First, list the known standard exceptions. These exceptions
13346 need to be handled separately, as they are usually defined in
13347 runtime units that have been compiled without debugging info. */
13349 ada_add_standard_exceptions (preg
, &result
);
13351 /* Next, find all exceptions whose scope is local and accessible
13352 from the currently selected frame. */
13354 if (has_stack_frames ())
13356 prev_len
= VEC_length (ada_exc_info
, result
);
13357 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13359 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13360 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13363 /* Add all exceptions whose scope is global. */
13365 prev_len
= VEC_length (ada_exc_info
, result
);
13366 ada_add_global_exceptions (preg
, &result
);
13367 if (VEC_length (ada_exc_info
, result
) > prev_len
)
13368 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13370 discard_cleanups (old_chain
);
13374 /* Return a vector of ada_exc_info.
13376 If REGEXP is NULL, all exceptions are included in the result.
13377 Otherwise, it should contain a valid regular expression,
13378 and only the exceptions whose names match that regular expression
13379 are included in the result.
13381 The exceptions are sorted in the following order:
13382 - Standard exceptions (defined by the Ada language), in
13383 alphabetical order;
13384 - Exceptions only visible from the current frame, in
13385 alphabetical order;
13386 - Exceptions whose scope is global, in alphabetical order. */
13388 VEC(ada_exc_info
) *
13389 ada_exceptions_list (const char *regexp
)
13391 if (regexp
== NULL
)
13392 return ada_exceptions_list_1 (NULL
);
13394 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13395 return ada_exceptions_list_1 (®
);
13398 /* Implement the "info exceptions" command. */
13401 info_exceptions_command (char *regexp
, int from_tty
)
13403 VEC(ada_exc_info
) *exceptions
;
13404 struct cleanup
*cleanup
;
13405 struct gdbarch
*gdbarch
= get_current_arch ();
13407 struct ada_exc_info
*info
;
13409 exceptions
= ada_exceptions_list (regexp
);
13410 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
13412 if (regexp
!= NULL
)
13414 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13416 printf_filtered (_("All defined Ada exceptions:\n"));
13418 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
13419 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
13421 do_cleanups (cleanup
);
13425 /* Information about operators given special treatment in functions
13427 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13429 #define ADA_OPERATORS \
13430 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13431 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13432 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13433 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13434 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13435 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13436 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13437 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13438 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13439 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13440 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13441 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13442 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13443 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13444 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13445 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13446 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13447 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13448 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13451 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13454 switch (exp
->elts
[pc
- 1].opcode
)
13457 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13460 #define OP_DEFN(op, len, args, binop) \
13461 case op: *oplenp = len; *argsp = args; break;
13467 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13472 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13477 /* Implementation of the exp_descriptor method operator_check. */
13480 ada_operator_check (struct expression
*exp
, int pos
,
13481 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13484 const union exp_element
*const elts
= exp
->elts
;
13485 struct type
*type
= NULL
;
13487 switch (elts
[pos
].opcode
)
13489 case UNOP_IN_RANGE
:
13491 type
= elts
[pos
+ 1].type
;
13495 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13498 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13500 if (type
&& TYPE_OBJFILE (type
)
13501 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13507 static const char *
13508 ada_op_name (enum exp_opcode opcode
)
13513 return op_name_standard (opcode
);
13515 #define OP_DEFN(op, len, args, binop) case op: return #op;
13520 return "OP_AGGREGATE";
13522 return "OP_CHOICES";
13528 /* As for operator_length, but assumes PC is pointing at the first
13529 element of the operator, and gives meaningful results only for the
13530 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13533 ada_forward_operator_length (struct expression
*exp
, int pc
,
13534 int *oplenp
, int *argsp
)
13536 switch (exp
->elts
[pc
].opcode
)
13539 *oplenp
= *argsp
= 0;
13542 #define OP_DEFN(op, len, args, binop) \
13543 case op: *oplenp = len; *argsp = args; break;
13549 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13554 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13560 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13562 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13570 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13572 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13577 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13581 /* Ada attributes ('Foo). */
13584 case OP_ATR_LENGTH
:
13588 case OP_ATR_MODULUS
:
13595 case UNOP_IN_RANGE
:
13597 /* XXX: gdb_sprint_host_address, type_sprint */
13598 fprintf_filtered (stream
, _("Type @"));
13599 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13600 fprintf_filtered (stream
, " (");
13601 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13602 fprintf_filtered (stream
, ")");
13604 case BINOP_IN_BOUNDS
:
13605 fprintf_filtered (stream
, " (%d)",
13606 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13608 case TERNOP_IN_RANGE
:
13613 case OP_DISCRETE_RANGE
:
13614 case OP_POSITIONAL
:
13621 char *name
= &exp
->elts
[elt
+ 2].string
;
13622 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13624 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13629 return dump_subexp_body_standard (exp
, stream
, elt
);
13633 for (i
= 0; i
< nargs
; i
+= 1)
13634 elt
= dump_subexp (exp
, stream
, elt
);
13639 /* The Ada extension of print_subexp (q.v.). */
13642 ada_print_subexp (struct expression
*exp
, int *pos
,
13643 struct ui_file
*stream
, enum precedence prec
)
13645 int oplen
, nargs
, i
;
13647 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13649 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13656 print_subexp_standard (exp
, pos
, stream
, prec
);
13660 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13663 case BINOP_IN_BOUNDS
:
13664 /* XXX: sprint_subexp */
13665 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13666 fputs_filtered (" in ", stream
);
13667 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13668 fputs_filtered ("'range", stream
);
13669 if (exp
->elts
[pc
+ 1].longconst
> 1)
13670 fprintf_filtered (stream
, "(%ld)",
13671 (long) exp
->elts
[pc
+ 1].longconst
);
13674 case TERNOP_IN_RANGE
:
13675 if (prec
>= PREC_EQUAL
)
13676 fputs_filtered ("(", stream
);
13677 /* XXX: sprint_subexp */
13678 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13679 fputs_filtered (" in ", stream
);
13680 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13681 fputs_filtered (" .. ", stream
);
13682 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13683 if (prec
>= PREC_EQUAL
)
13684 fputs_filtered (")", stream
);
13689 case OP_ATR_LENGTH
:
13693 case OP_ATR_MODULUS
:
13698 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13700 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13701 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13702 &type_print_raw_options
);
13706 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13707 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13712 for (tem
= 1; tem
< nargs
; tem
+= 1)
13714 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13715 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13717 fputs_filtered (")", stream
);
13722 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13723 fputs_filtered ("'(", stream
);
13724 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13725 fputs_filtered (")", stream
);
13728 case UNOP_IN_RANGE
:
13729 /* XXX: sprint_subexp */
13730 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13731 fputs_filtered (" in ", stream
);
13732 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13733 &type_print_raw_options
);
13736 case OP_DISCRETE_RANGE
:
13737 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13738 fputs_filtered ("..", stream
);
13739 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13743 fputs_filtered ("others => ", stream
);
13744 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13748 for (i
= 0; i
< nargs
-1; i
+= 1)
13751 fputs_filtered ("|", stream
);
13752 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13754 fputs_filtered (" => ", stream
);
13755 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13758 case OP_POSITIONAL
:
13759 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13763 fputs_filtered ("(", stream
);
13764 for (i
= 0; i
< nargs
; i
+= 1)
13767 fputs_filtered (", ", stream
);
13768 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13770 fputs_filtered (")", stream
);
13775 /* Table mapping opcodes into strings for printing operators
13776 and precedences of the operators. */
13778 static const struct op_print ada_op_print_tab
[] = {
13779 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13780 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13781 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13782 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13783 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13784 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13785 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13786 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13787 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13788 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13789 {">", BINOP_GTR
, PREC_ORDER
, 0},
13790 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13791 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13792 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13793 {"+", BINOP_ADD
, PREC_ADD
, 0},
13794 {"-", BINOP_SUB
, PREC_ADD
, 0},
13795 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13796 {"*", BINOP_MUL
, PREC_MUL
, 0},
13797 {"/", BINOP_DIV
, PREC_MUL
, 0},
13798 {"rem", BINOP_REM
, PREC_MUL
, 0},
13799 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13800 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13801 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13802 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13803 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13804 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13805 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13806 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13807 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13808 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13809 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13810 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13813 enum ada_primitive_types
{
13814 ada_primitive_type_int
,
13815 ada_primitive_type_long
,
13816 ada_primitive_type_short
,
13817 ada_primitive_type_char
,
13818 ada_primitive_type_float
,
13819 ada_primitive_type_double
,
13820 ada_primitive_type_void
,
13821 ada_primitive_type_long_long
,
13822 ada_primitive_type_long_double
,
13823 ada_primitive_type_natural
,
13824 ada_primitive_type_positive
,
13825 ada_primitive_type_system_address
,
13826 nr_ada_primitive_types
13830 ada_language_arch_info (struct gdbarch
*gdbarch
,
13831 struct language_arch_info
*lai
)
13833 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13835 lai
->primitive_type_vector
13836 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13839 lai
->primitive_type_vector
[ada_primitive_type_int
]
13840 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13842 lai
->primitive_type_vector
[ada_primitive_type_long
]
13843 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13844 0, "long_integer");
13845 lai
->primitive_type_vector
[ada_primitive_type_short
]
13846 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13847 0, "short_integer");
13848 lai
->string_char_type
13849 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13850 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13851 lai
->primitive_type_vector
[ada_primitive_type_float
]
13852 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13853 "float", gdbarch_float_format (gdbarch
));
13854 lai
->primitive_type_vector
[ada_primitive_type_double
]
13855 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13856 "long_float", gdbarch_double_format (gdbarch
));
13857 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13858 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13859 0, "long_long_integer");
13860 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13861 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13862 "long_long_float", gdbarch_long_double_format (gdbarch
));
13863 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13864 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13866 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13867 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13869 lai
->primitive_type_vector
[ada_primitive_type_void
]
13870 = builtin
->builtin_void
;
13872 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13873 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13874 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13875 = "system__address";
13877 lai
->bool_type_symbol
= NULL
;
13878 lai
->bool_type_default
= builtin
->builtin_bool
;
13881 /* Language vector */
13883 /* Not really used, but needed in the ada_language_defn. */
13886 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13888 ada_emit_char (c
, type
, stream
, quoter
, 1);
13892 parse (struct parser_state
*ps
)
13894 warnings_issued
= 0;
13895 return ada_parse (ps
);
13898 static const struct exp_descriptor ada_exp_descriptor
= {
13900 ada_operator_length
,
13901 ada_operator_check
,
13903 ada_dump_subexp_body
,
13904 ada_evaluate_subexp
13907 /* Implement the "la_get_symbol_name_cmp" language_defn method
13910 static symbol_name_cmp_ftype
13911 ada_get_symbol_name_cmp (const char *lookup_name
)
13913 if (should_use_wild_match (lookup_name
))
13916 return compare_names
;
13919 /* Implement the "la_read_var_value" language_defn method for Ada. */
13921 static struct value
*
13922 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
13923 struct frame_info
*frame
)
13925 const struct block
*frame_block
= NULL
;
13926 struct symbol
*renaming_sym
= NULL
;
13928 /* The only case where default_read_var_value is not sufficient
13929 is when VAR is a renaming... */
13931 frame_block
= get_frame_block (frame
, NULL
);
13933 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13934 if (renaming_sym
!= NULL
)
13935 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13937 /* This is a typical case where we expect the default_read_var_value
13938 function to work. */
13939 return default_read_var_value (var
, var_block
, frame
);
13942 static const char *ada_extensions
[] =
13944 ".adb", ".ads", ".a", ".ada", ".dg", NULL
13947 extern const struct language_defn ada_language_defn
= {
13948 "ada", /* Language name */
13952 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13953 that's not quite what this means. */
13955 macro_expansion_no
,
13957 &ada_exp_descriptor
,
13961 ada_printchar
, /* Print a character constant */
13962 ada_printstr
, /* Function to print string constant */
13963 emit_char
, /* Function to print single char (not used) */
13964 ada_print_type
, /* Print a type using appropriate syntax */
13965 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13966 ada_val_print
, /* Print a value using appropriate syntax */
13967 ada_value_print
, /* Print a top-level value */
13968 ada_read_var_value
, /* la_read_var_value */
13969 NULL
, /* Language specific skip_trampoline */
13970 NULL
, /* name_of_this */
13971 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13972 basic_lookup_transparent_type
, /* lookup_transparent_type */
13973 ada_la_decode
, /* Language specific symbol demangler */
13974 ada_sniff_from_mangled_name
,
13975 NULL
, /* Language specific
13976 class_name_from_physname */
13977 ada_op_print_tab
, /* expression operators for printing */
13978 0, /* c-style arrays */
13979 1, /* String lower bound */
13980 ada_get_gdb_completer_word_break_characters
,
13981 ada_collect_symbol_completion_matches
,
13982 ada_language_arch_info
,
13983 ada_print_array_index
,
13984 default_pass_by_reference
,
13986 c_watch_location_expression
,
13987 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13988 ada_iterate_over_symbols
,
13995 /* Provide a prototype to silence -Wmissing-prototypes. */
13996 extern initialize_file_ftype _initialize_ada_language
;
13998 /* Command-list for the "set/show ada" prefix command. */
13999 static struct cmd_list_element
*set_ada_list
;
14000 static struct cmd_list_element
*show_ada_list
;
14002 /* Implement the "set ada" prefix command. */
14005 set_ada_command (char *arg
, int from_tty
)
14007 printf_unfiltered (_(\
14008 "\"set ada\" must be followed by the name of a setting.\n"));
14009 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
14012 /* Implement the "show ada" prefix command. */
14015 show_ada_command (char *args
, int from_tty
)
14017 cmd_show_list (show_ada_list
, from_tty
, "");
14021 initialize_ada_catchpoint_ops (void)
14023 struct breakpoint_ops
*ops
;
14025 initialize_breakpoint_ops ();
14027 ops
= &catch_exception_breakpoint_ops
;
14028 *ops
= bkpt_breakpoint_ops
;
14029 ops
->allocate_location
= allocate_location_catch_exception
;
14030 ops
->re_set
= re_set_catch_exception
;
14031 ops
->check_status
= check_status_catch_exception
;
14032 ops
->print_it
= print_it_catch_exception
;
14033 ops
->print_one
= print_one_catch_exception
;
14034 ops
->print_mention
= print_mention_catch_exception
;
14035 ops
->print_recreate
= print_recreate_catch_exception
;
14037 ops
= &catch_exception_unhandled_breakpoint_ops
;
14038 *ops
= bkpt_breakpoint_ops
;
14039 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
14040 ops
->re_set
= re_set_catch_exception_unhandled
;
14041 ops
->check_status
= check_status_catch_exception_unhandled
;
14042 ops
->print_it
= print_it_catch_exception_unhandled
;
14043 ops
->print_one
= print_one_catch_exception_unhandled
;
14044 ops
->print_mention
= print_mention_catch_exception_unhandled
;
14045 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
14047 ops
= &catch_assert_breakpoint_ops
;
14048 *ops
= bkpt_breakpoint_ops
;
14049 ops
->allocate_location
= allocate_location_catch_assert
;
14050 ops
->re_set
= re_set_catch_assert
;
14051 ops
->check_status
= check_status_catch_assert
;
14052 ops
->print_it
= print_it_catch_assert
;
14053 ops
->print_one
= print_one_catch_assert
;
14054 ops
->print_mention
= print_mention_catch_assert
;
14055 ops
->print_recreate
= print_recreate_catch_assert
;
14058 /* This module's 'new_objfile' observer. */
14061 ada_new_objfile_observer (struct objfile
*objfile
)
14063 ada_clear_symbol_cache ();
14066 /* This module's 'free_objfile' observer. */
14069 ada_free_objfile_observer (struct objfile
*objfile
)
14071 ada_clear_symbol_cache ();
14075 _initialize_ada_language (void)
14077 initialize_ada_catchpoint_ops ();
14079 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14080 _("Prefix command for changing Ada-specfic settings"),
14081 &set_ada_list
, "set ada ", 0, &setlist
);
14083 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14084 _("Generic command for showing Ada-specific settings."),
14085 &show_ada_list
, "show ada ", 0, &showlist
);
14087 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14088 &trust_pad_over_xvs
, _("\
14089 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14090 Show whether an optimization trusting PAD types over XVS types is activated"),
14092 This is related to the encoding used by the GNAT compiler. The debugger\n\
14093 should normally trust the contents of PAD types, but certain older versions\n\
14094 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14095 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14096 work around this bug. It is always safe to turn this option \"off\", but\n\
14097 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14098 this option to \"off\" unless necessary."),
14099 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14101 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14102 &print_signatures
, _("\
14103 Enable or disable the output of formal and return types for functions in the \
14104 overloads selection menu"), _("\
14105 Show whether the output of formal and return types for functions in the \
14106 overloads selection menu is activated"),
14107 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14109 add_catch_command ("exception", _("\
14110 Catch Ada exceptions, when raised.\n\
14111 With an argument, catch only exceptions with the given name."),
14112 catch_ada_exception_command
,
14116 add_catch_command ("assert", _("\
14117 Catch failed Ada assertions, when raised.\n\
14118 With an argument, catch only exceptions with the given name."),
14119 catch_assert_command
,
14124 varsize_limit
= 65536;
14126 add_info ("exceptions", info_exceptions_command
,
14128 List all Ada exception names.\n\
14129 If a regular expression is passed as an argument, only those matching\n\
14130 the regular expression are listed."));
14132 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14133 _("Set Ada maintenance-related variables."),
14134 &maint_set_ada_cmdlist
, "maintenance set ada ",
14135 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14137 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14138 _("Show Ada maintenance-related variables"),
14139 &maint_show_ada_cmdlist
, "maintenance show ada ",
14140 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14142 add_setshow_boolean_cmd
14143 ("ignore-descriptive-types", class_maintenance
,
14144 &ada_ignore_descriptive_types_p
,
14145 _("Set whether descriptive types generated by GNAT should be ignored."),
14146 _("Show whether descriptive types generated by GNAT should be ignored."),
14148 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14149 DWARF attribute."),
14150 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14152 obstack_init (&symbol_list_obstack
);
14154 decoded_names_store
= htab_create_alloc
14155 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
14156 NULL
, xcalloc
, xfree
);
14158 /* The ada-lang observers. */
14159 observer_attach_new_objfile (ada_new_objfile_observer
);
14160 observer_attach_free_objfile (ada_free_objfile_observer
);
14161 observer_attach_inferior_exit (ada_inferior_exit
);
14163 /* Setup various context-specific data. */
14165 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
14166 ada_pspace_data_handle
14167 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);