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"
67 /* Define whether or not the C operator '/' truncates towards zero for
68 differently signed operands (truncation direction is undefined in C).
69 Copied from valarith.c. */
71 #ifndef TRUNCATION_TOWARDS_ZERO
72 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75 static struct type
*desc_base_type (struct type
*);
77 static struct type
*desc_bounds_type (struct type
*);
79 static struct value
*desc_bounds (struct value
*);
81 static int fat_pntr_bounds_bitpos (struct type
*);
83 static int fat_pntr_bounds_bitsize (struct type
*);
85 static struct type
*desc_data_target_type (struct type
*);
87 static struct value
*desc_data (struct value
*);
89 static int fat_pntr_data_bitpos (struct type
*);
91 static int fat_pntr_data_bitsize (struct type
*);
93 static struct value
*desc_one_bound (struct value
*, int, int);
95 static int desc_bound_bitpos (struct type
*, int, int);
97 static int desc_bound_bitsize (struct type
*, int, int);
99 static struct type
*desc_index_type (struct type
*, int);
101 static int desc_arity (struct type
*);
103 static int ada_type_match (struct type
*, struct type
*, int);
105 static int ada_args_match (struct symbol
*, struct value
**, int);
107 static struct value
*make_array_descriptor (struct type
*, struct value
*);
109 static void ada_add_block_symbols (struct obstack
*,
110 const struct block
*,
111 const lookup_name_info
&lookup_name
,
112 domain_enum
, struct objfile
*);
114 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
115 const lookup_name_info
&lookup_name
,
116 domain_enum
, int, int *);
118 static int is_nonfunction (struct block_symbol
*, int);
120 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 const struct block
*);
123 static int num_defns_collected (struct obstack
*);
125 static struct block_symbol
*defns_collected (struct obstack
*, int);
127 static struct value
*resolve_subexp (struct expression
**, int *, int,
130 static void replace_operator_with_call (struct expression
**, int, int, int,
131 struct symbol
*, const struct block
*);
133 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
135 static const char *ada_op_name (enum exp_opcode
);
137 static const char *ada_decoded_op_name (enum exp_opcode
);
139 static int numeric_type_p (struct type
*);
141 static int integer_type_p (struct type
*);
143 static int scalar_type_p (struct type
*);
145 static int discrete_type_p (struct type
*);
147 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
152 static struct symbol
*find_old_style_renaming_symbol (const char *,
153 const struct block
*);
155 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
158 static struct value
*evaluate_subexp_type (struct expression
*, int *);
160 static struct type
*ada_find_parallel_type_with_name (struct type
*,
163 static int is_dynamic_field (struct type
*, int);
165 static struct type
*to_fixed_variant_branch_type (struct type
*,
167 CORE_ADDR
, struct value
*);
169 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
171 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
173 static struct type
*to_static_fixed_type (struct type
*);
174 static struct type
*static_unwrap_type (struct type
*type
);
176 static struct value
*unwrap_value (struct value
*);
178 static struct type
*constrained_packed_array_type (struct type
*, long *);
180 static struct type
*decode_constrained_packed_array_type (struct type
*);
182 static long decode_packed_array_bitsize (struct type
*);
184 static struct value
*decode_constrained_packed_array (struct value
*);
186 static int ada_is_packed_array_type (struct type
*);
188 static int ada_is_unconstrained_packed_array_type (struct type
*);
190 static struct value
*value_subscript_packed (struct value
*, int,
193 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
195 static struct value
*coerce_unspec_val_to_type (struct value
*,
198 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
200 static int equiv_types (struct type
*, struct type
*);
202 static int is_name_suffix (const char *);
204 static int advance_wild_match (const char **, const char *, int);
206 static bool wild_match (const char *name
, const char *patn
);
208 static struct value
*ada_coerce_ref (struct value
*);
210 static LONGEST
pos_atr (struct value
*);
212 static struct value
*value_pos_atr (struct type
*, struct value
*);
214 static struct value
*value_val_atr (struct type
*, struct value
*);
216 static struct symbol
*standard_lookup (const char *, const struct block
*,
219 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
222 static struct value
*ada_value_primitive_field (struct value
*, int, int,
225 static int find_struct_field (const char *, struct type
*, int,
226 struct type
**, int *, int *, int *, int *);
228 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
231 static int ada_resolve_function (struct block_symbol
*, int,
232 struct value
**, int, const char *,
235 static int ada_is_direct_array_type (struct type
*);
237 static void ada_language_arch_info (struct gdbarch
*,
238 struct language_arch_info
*);
240 static struct value
*ada_index_struct_field (int, struct value
*, int,
243 static struct value
*assign_aggregate (struct value
*, struct value
*,
247 static void aggregate_assign_from_choices (struct value
*, struct value
*,
249 int *, LONGEST
*, int *,
250 int, LONGEST
, LONGEST
);
252 static void aggregate_assign_positional (struct value
*, struct value
*,
254 int *, LONGEST
*, int *, int,
258 static void aggregate_assign_others (struct value
*, struct value
*,
260 int *, LONGEST
*, int, LONGEST
, LONGEST
);
263 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
266 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
269 static void ada_forward_operator_length (struct expression
*, int, int *,
272 static struct type
*ada_find_any_type (const char *name
);
274 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
275 (const lookup_name_info
&lookup_name
);
279 /* The result of a symbol lookup to be stored in our symbol cache. */
283 /* The name used to perform the lookup. */
285 /* The namespace used during the lookup. */
287 /* The symbol returned by the lookup, or NULL if no matching symbol
290 /* The block where the symbol was found, or NULL if no matching
292 const struct block
*block
;
293 /* A pointer to the next entry with the same hash. */
294 struct cache_entry
*next
;
297 /* The Ada symbol cache, used to store the result of Ada-mode symbol
298 lookups in the course of executing the user's commands.
300 The cache is implemented using a simple, fixed-sized hash.
301 The size is fixed on the grounds that there are not likely to be
302 all that many symbols looked up during any given session, regardless
303 of the size of the symbol table. If we decide to go to a resizable
304 table, let's just use the stuff from libiberty instead. */
306 #define HASH_SIZE 1009
308 struct ada_symbol_cache
310 /* An obstack used to store the entries in our cache. */
311 struct obstack cache_space
;
313 /* The root of the hash table used to implement our symbol cache. */
314 struct cache_entry
*root
[HASH_SIZE
];
317 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
319 /* Maximum-sized dynamic type. */
320 static unsigned int varsize_limit
;
322 static const char ada_completer_word_break_characters
[] =
324 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
326 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
329 /* The name of the symbol to use to get the name of the main subprogram. */
330 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
331 = "__gnat_ada_main_program_name";
333 /* Limit on the number of warnings to raise per expression evaluation. */
334 static int warning_limit
= 2;
336 /* Number of warning messages issued; reset to 0 by cleanups after
337 expression evaluation. */
338 static int warnings_issued
= 0;
340 static const char *known_runtime_file_name_patterns
[] = {
341 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
344 static const char *known_auxiliary_function_name_patterns
[] = {
345 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
348 /* Space for allocating results of ada_lookup_symbol_list. */
349 static struct obstack symbol_list_obstack
;
351 /* Maintenance-related settings for this module. */
353 static struct cmd_list_element
*maint_set_ada_cmdlist
;
354 static struct cmd_list_element
*maint_show_ada_cmdlist
;
356 /* Implement the "maintenance set ada" (prefix) command. */
359 maint_set_ada_cmd (const char *args
, int from_tty
)
361 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", all_commands
,
365 /* Implement the "maintenance show ada" (prefix) command. */
368 maint_show_ada_cmd (const char *args
, int from_tty
)
370 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
373 /* The "maintenance ada set/show ignore-descriptive-type" value. */
375 static int ada_ignore_descriptive_types_p
= 0;
377 /* Inferior-specific data. */
379 /* Per-inferior data for this module. */
381 struct ada_inferior_data
383 /* The ada__tags__type_specific_data type, which is used when decoding
384 tagged types. With older versions of GNAT, this type was directly
385 accessible through a component ("tsd") in the object tag. But this
386 is no longer the case, so we cache it for each inferior. */
387 struct type
*tsd_type
;
389 /* The exception_support_info data. This data is used to determine
390 how to implement support for Ada exception catchpoints in a given
392 const struct exception_support_info
*exception_info
;
395 /* Our key to this module's inferior data. */
396 static const struct inferior_data
*ada_inferior_data
;
398 /* A cleanup routine for our inferior data. */
400 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
402 struct ada_inferior_data
*data
;
404 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
409 /* Return our inferior data for the given inferior (INF).
411 This function always returns a valid pointer to an allocated
412 ada_inferior_data structure. If INF's inferior data has not
413 been previously set, this functions creates a new one with all
414 fields set to zero, sets INF's inferior to it, and then returns
415 a pointer to that newly allocated ada_inferior_data. */
417 static struct ada_inferior_data
*
418 get_ada_inferior_data (struct inferior
*inf
)
420 struct ada_inferior_data
*data
;
422 data
= (struct ada_inferior_data
*) inferior_data (inf
, ada_inferior_data
);
425 data
= XCNEW (struct ada_inferior_data
);
426 set_inferior_data (inf
, ada_inferior_data
, data
);
432 /* Perform all necessary cleanups regarding our module's inferior data
433 that is required after the inferior INF just exited. */
436 ada_inferior_exit (struct inferior
*inf
)
438 ada_inferior_data_cleanup (inf
, NULL
);
439 set_inferior_data (inf
, ada_inferior_data
, NULL
);
443 /* program-space-specific data. */
445 /* This module's per-program-space data. */
446 struct ada_pspace_data
448 /* The Ada symbol cache. */
449 struct ada_symbol_cache
*sym_cache
;
452 /* Key to our per-program-space data. */
453 static const struct program_space_data
*ada_pspace_data_handle
;
455 /* Return this module's data for the given program space (PSPACE).
456 If not is found, add a zero'ed one now.
458 This function always returns a valid object. */
460 static struct ada_pspace_data
*
461 get_ada_pspace_data (struct program_space
*pspace
)
463 struct ada_pspace_data
*data
;
465 data
= ((struct ada_pspace_data
*)
466 program_space_data (pspace
, ada_pspace_data_handle
));
469 data
= XCNEW (struct ada_pspace_data
);
470 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
476 /* The cleanup callback for this module's per-program-space data. */
479 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
481 struct ada_pspace_data
*pspace_data
= (struct ada_pspace_data
*) data
;
483 if (pspace_data
->sym_cache
!= NULL
)
484 ada_free_symbol_cache (pspace_data
->sym_cache
);
490 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
491 all typedef layers have been peeled. Otherwise, return TYPE.
493 Normally, we really expect a typedef type to only have 1 typedef layer.
494 In other words, we really expect the target type of a typedef type to be
495 a non-typedef type. This is particularly true for Ada units, because
496 the language does not have a typedef vs not-typedef distinction.
497 In that respect, the Ada compiler has been trying to eliminate as many
498 typedef definitions in the debugging information, since they generally
499 do not bring any extra information (we still use typedef under certain
500 circumstances related mostly to the GNAT encoding).
502 Unfortunately, we have seen situations where the debugging information
503 generated by the compiler leads to such multiple typedef layers. For
504 instance, consider the following example with stabs:
506 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
507 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
509 This is an error in the debugging information which causes type
510 pck__float_array___XUP to be defined twice, and the second time,
511 it is defined as a typedef of a typedef.
513 This is on the fringe of legality as far as debugging information is
514 concerned, and certainly unexpected. But it is easy to handle these
515 situations correctly, so we can afford to be lenient in this case. */
518 ada_typedef_target_type (struct type
*type
)
520 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
521 type
= TYPE_TARGET_TYPE (type
);
525 /* Given DECODED_NAME a string holding a symbol name in its
526 decoded form (ie using the Ada dotted notation), returns
527 its unqualified name. */
530 ada_unqualified_name (const char *decoded_name
)
534 /* If the decoded name starts with '<', it means that the encoded
535 name does not follow standard naming conventions, and thus that
536 it is not your typical Ada symbol name. Trying to unqualify it
537 is therefore pointless and possibly erroneous. */
538 if (decoded_name
[0] == '<')
541 result
= strrchr (decoded_name
, '.');
543 result
++; /* Skip the dot... */
545 result
= decoded_name
;
550 /* Return a string starting with '<', followed by STR, and '>'.
551 The result is good until the next call. */
554 add_angle_brackets (const char *str
)
556 static char *result
= NULL
;
559 result
= xstrprintf ("<%s>", str
);
564 ada_get_gdb_completer_word_break_characters (void)
566 return ada_completer_word_break_characters
;
569 /* Print an array element index using the Ada syntax. */
572 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
573 const struct value_print_options
*options
)
575 LA_VALUE_PRINT (index_value
, stream
, options
);
576 fprintf_filtered (stream
, " => ");
579 /* Assuming VECT points to an array of *SIZE objects of size
580 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
581 updating *SIZE as necessary and returning the (new) array. */
584 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
586 if (*size
< min_size
)
589 if (*size
< min_size
)
591 vect
= xrealloc (vect
, *size
* element_size
);
596 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
597 suffix of FIELD_NAME beginning "___". */
600 field_name_match (const char *field_name
, const char *target
)
602 int len
= strlen (target
);
605 (strncmp (field_name
, target
, len
) == 0
606 && (field_name
[len
] == '\0'
607 || (startswith (field_name
+ len
, "___")
608 && strcmp (field_name
+ strlen (field_name
) - 6,
613 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
614 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
615 and return its index. This function also handles fields whose name
616 have ___ suffixes because the compiler sometimes alters their name
617 by adding such a suffix to represent fields with certain constraints.
618 If the field could not be found, return a negative number if
619 MAYBE_MISSING is set. Otherwise raise an error. */
622 ada_get_field_index (const struct type
*type
, const char *field_name
,
626 struct type
*struct_type
= check_typedef ((struct type
*) type
);
628 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
629 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
633 error (_("Unable to find field %s in struct %s. Aborting"),
634 field_name
, TYPE_NAME (struct_type
));
639 /* The length of the prefix of NAME prior to any "___" suffix. */
642 ada_name_prefix_len (const char *name
)
648 const char *p
= strstr (name
, "___");
651 return strlen (name
);
657 /* Return non-zero if SUFFIX is a suffix of STR.
658 Return zero if STR is null. */
661 is_suffix (const char *str
, const char *suffix
)
668 len2
= strlen (suffix
);
669 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
672 /* The contents of value VAL, treated as a value of type TYPE. The
673 result is an lval in memory if VAL is. */
675 static struct value
*
676 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
678 type
= ada_check_typedef (type
);
679 if (value_type (val
) == type
)
683 struct value
*result
;
685 /* Make sure that the object size is not unreasonable before
686 trying to allocate some memory for it. */
687 ada_ensure_varsize_limit (type
);
690 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
691 result
= allocate_value_lazy (type
);
694 result
= allocate_value (type
);
695 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
697 set_value_component_location (result
, val
);
698 set_value_bitsize (result
, value_bitsize (val
));
699 set_value_bitpos (result
, value_bitpos (val
));
700 set_value_address (result
, value_address (val
));
705 static const gdb_byte
*
706 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
711 return valaddr
+ offset
;
715 cond_offset_target (CORE_ADDR address
, long offset
)
720 return address
+ offset
;
723 /* Issue a warning (as for the definition of warning in utils.c, but
724 with exactly one argument rather than ...), unless the limit on the
725 number of warnings has passed during the evaluation of the current
728 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
729 provided by "complaint". */
730 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
733 lim_warning (const char *format
, ...)
737 va_start (args
, format
);
738 warnings_issued
+= 1;
739 if (warnings_issued
<= warning_limit
)
740 vwarning (format
, args
);
745 /* Issue an error if the size of an object of type T is unreasonable,
746 i.e. if it would be a bad idea to allocate a value of this type in
750 ada_ensure_varsize_limit (const struct type
*type
)
752 if (TYPE_LENGTH (type
) > varsize_limit
)
753 error (_("object size is larger than varsize-limit"));
756 /* Maximum value of a SIZE-byte signed integer type. */
758 max_of_size (int size
)
760 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
762 return top_bit
| (top_bit
- 1);
765 /* Minimum value of a SIZE-byte signed integer type. */
767 min_of_size (int size
)
769 return -max_of_size (size
) - 1;
772 /* Maximum value of a SIZE-byte unsigned integer type. */
774 umax_of_size (int size
)
776 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
778 return top_bit
| (top_bit
- 1);
781 /* Maximum value of integral type T, as a signed quantity. */
783 max_of_type (struct type
*t
)
785 if (TYPE_UNSIGNED (t
))
786 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
788 return max_of_size (TYPE_LENGTH (t
));
791 /* Minimum value of integral type T, as a signed quantity. */
793 min_of_type (struct type
*t
)
795 if (TYPE_UNSIGNED (t
))
798 return min_of_size (TYPE_LENGTH (t
));
801 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
803 ada_discrete_type_high_bound (struct type
*type
)
805 type
= resolve_dynamic_type (type
, NULL
, 0);
806 switch (TYPE_CODE (type
))
808 case TYPE_CODE_RANGE
:
809 return TYPE_HIGH_BOUND (type
);
811 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
816 return max_of_type (type
);
818 error (_("Unexpected type in ada_discrete_type_high_bound."));
822 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
824 ada_discrete_type_low_bound (struct type
*type
)
826 type
= resolve_dynamic_type (type
, NULL
, 0);
827 switch (TYPE_CODE (type
))
829 case TYPE_CODE_RANGE
:
830 return TYPE_LOW_BOUND (type
);
832 return TYPE_FIELD_ENUMVAL (type
, 0);
837 return min_of_type (type
);
839 error (_("Unexpected type in ada_discrete_type_low_bound."));
843 /* The identity on non-range types. For range types, the underlying
844 non-range scalar type. */
847 get_base_type (struct type
*type
)
849 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
851 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
853 type
= TYPE_TARGET_TYPE (type
);
858 /* Return a decoded version of the given VALUE. This means returning
859 a value whose type is obtained by applying all the GNAT-specific
860 encondings, making the resulting type a static but standard description
861 of the initial type. */
864 ada_get_decoded_value (struct value
*value
)
866 struct type
*type
= ada_check_typedef (value_type (value
));
868 if (ada_is_array_descriptor_type (type
)
869 || (ada_is_constrained_packed_array_type (type
)
870 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
872 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
873 value
= ada_coerce_to_simple_array_ptr (value
);
875 value
= ada_coerce_to_simple_array (value
);
878 value
= ada_to_fixed_value (value
);
883 /* Same as ada_get_decoded_value, but with the given TYPE.
884 Because there is no associated actual value for this type,
885 the resulting type might be a best-effort approximation in
886 the case of dynamic types. */
889 ada_get_decoded_type (struct type
*type
)
891 type
= to_static_fixed_type (type
);
892 if (ada_is_constrained_packed_array_type (type
))
893 type
= ada_coerce_to_simple_array_type (type
);
899 /* Language Selection */
901 /* If the main program is in Ada, return language_ada, otherwise return LANG
902 (the main program is in Ada iif the adainit symbol is found). */
905 ada_update_initial_language (enum language lang
)
907 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
908 (struct objfile
*) NULL
).minsym
!= NULL
)
914 /* If the main procedure is written in Ada, then return its name.
915 The result is good until the next call. Return NULL if the main
916 procedure doesn't appear to be in Ada. */
921 struct bound_minimal_symbol msym
;
922 static char *main_program_name
= NULL
;
924 /* For Ada, the name of the main procedure is stored in a specific
925 string constant, generated by the binder. Look for that symbol,
926 extract its address, and then read that string. If we didn't find
927 that string, then most probably the main procedure is not written
929 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
931 if (msym
.minsym
!= NULL
)
933 CORE_ADDR main_program_name_addr
;
936 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
937 if (main_program_name_addr
== 0)
938 error (_("Invalid address for Ada main program name."));
940 xfree (main_program_name
);
941 target_read_string (main_program_name_addr
, &main_program_name
,
946 return main_program_name
;
949 /* The main procedure doesn't seem to be in Ada. */
955 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
958 const struct ada_opname_map ada_opname_table
[] = {
959 {"Oadd", "\"+\"", BINOP_ADD
},
960 {"Osubtract", "\"-\"", BINOP_SUB
},
961 {"Omultiply", "\"*\"", BINOP_MUL
},
962 {"Odivide", "\"/\"", BINOP_DIV
},
963 {"Omod", "\"mod\"", BINOP_MOD
},
964 {"Orem", "\"rem\"", BINOP_REM
},
965 {"Oexpon", "\"**\"", BINOP_EXP
},
966 {"Olt", "\"<\"", BINOP_LESS
},
967 {"Ole", "\"<=\"", BINOP_LEQ
},
968 {"Ogt", "\">\"", BINOP_GTR
},
969 {"Oge", "\">=\"", BINOP_GEQ
},
970 {"Oeq", "\"=\"", BINOP_EQUAL
},
971 {"One", "\"/=\"", BINOP_NOTEQUAL
},
972 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
973 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
974 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
975 {"Oconcat", "\"&\"", BINOP_CONCAT
},
976 {"Oabs", "\"abs\"", UNOP_ABS
},
977 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
978 {"Oadd", "\"+\"", UNOP_PLUS
},
979 {"Osubtract", "\"-\"", UNOP_NEG
},
983 /* The "encoded" form of DECODED, according to GNAT conventions. The
984 result is valid until the next call to ada_encode. If
985 THROW_ERRORS, throw an error if invalid operator name is found.
986 Otherwise, return NULL in that case. */
989 ada_encode_1 (const char *decoded
, bool throw_errors
)
991 static char *encoding_buffer
= NULL
;
992 static size_t encoding_buffer_size
= 0;
999 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
1000 2 * strlen (decoded
) + 10);
1003 for (p
= decoded
; *p
!= '\0'; p
+= 1)
1007 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
1012 const struct ada_opname_map
*mapping
;
1014 for (mapping
= ada_opname_table
;
1015 mapping
->encoded
!= NULL
1016 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
1018 if (mapping
->encoded
== NULL
)
1021 error (_("invalid Ada operator name: %s"), p
);
1025 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1026 k
+= strlen (mapping
->encoded
);
1031 encoding_buffer
[k
] = *p
;
1036 encoding_buffer
[k
] = '\0';
1037 return encoding_buffer
;
1040 /* The "encoded" form of DECODED, according to GNAT conventions.
1041 The result is valid until the next call to ada_encode. */
1044 ada_encode (const char *decoded
)
1046 return ada_encode_1 (decoded
, true);
1049 /* Return NAME folded to lower case, or, if surrounded by single
1050 quotes, unfolded, but with the quotes stripped away. Result good
1054 ada_fold_name (const char *name
)
1056 static char *fold_buffer
= NULL
;
1057 static size_t fold_buffer_size
= 0;
1059 int len
= strlen (name
);
1060 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1062 if (name
[0] == '\'')
1064 strncpy (fold_buffer
, name
+ 1, len
- 2);
1065 fold_buffer
[len
- 2] = '\000';
1071 for (i
= 0; i
<= len
; i
+= 1)
1072 fold_buffer
[i
] = tolower (name
[i
]);
1078 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1081 is_lower_alphanum (const char c
)
1083 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1086 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1087 This function saves in LEN the length of that same symbol name but
1088 without either of these suffixes:
1094 These are suffixes introduced by the compiler for entities such as
1095 nested subprogram for instance, in order to avoid name clashes.
1096 They do not serve any purpose for the debugger. */
1099 ada_remove_trailing_digits (const char *encoded
, int *len
)
1101 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1105 while (i
> 0 && isdigit (encoded
[i
]))
1107 if (i
>= 0 && encoded
[i
] == '.')
1109 else if (i
>= 0 && encoded
[i
] == '$')
1111 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1113 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1118 /* Remove the suffix introduced by the compiler for protected object
1122 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1124 /* Remove trailing N. */
1126 /* Protected entry subprograms are broken into two
1127 separate subprograms: The first one is unprotected, and has
1128 a 'N' suffix; the second is the protected version, and has
1129 the 'P' suffix. The second calls the first one after handling
1130 the protection. Since the P subprograms are internally generated,
1131 we leave these names undecoded, giving the user a clue that this
1132 entity is internal. */
1135 && encoded
[*len
- 1] == 'N'
1136 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1140 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1143 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1147 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1150 if (encoded
[i
] != 'X')
1156 if (isalnum (encoded
[i
-1]))
1160 /* If ENCODED follows the GNAT entity encoding conventions, then return
1161 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1162 replaced by ENCODED.
1164 The resulting string is valid until the next call of ada_decode.
1165 If the string is unchanged by decoding, the original string pointer
1169 ada_decode (const char *encoded
)
1176 static char *decoding_buffer
= NULL
;
1177 static size_t decoding_buffer_size
= 0;
1179 /* The name of the Ada main procedure starts with "_ada_".
1180 This prefix is not part of the decoded name, so skip this part
1181 if we see this prefix. */
1182 if (startswith (encoded
, "_ada_"))
1185 /* If the name starts with '_', then it is not a properly encoded
1186 name, so do not attempt to decode it. Similarly, if the name
1187 starts with '<', the name should not be decoded. */
1188 if (encoded
[0] == '_' || encoded
[0] == '<')
1191 len0
= strlen (encoded
);
1193 ada_remove_trailing_digits (encoded
, &len0
);
1194 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1196 /* Remove the ___X.* suffix if present. Do not forget to verify that
1197 the suffix is located before the current "end" of ENCODED. We want
1198 to avoid re-matching parts of ENCODED that have previously been
1199 marked as discarded (by decrementing LEN0). */
1200 p
= strstr (encoded
, "___");
1201 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1209 /* Remove any trailing TKB suffix. It tells us that this symbol
1210 is for the body of a task, but that information does not actually
1211 appear in the decoded name. */
1213 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1216 /* Remove any trailing TB suffix. The TB suffix is slightly different
1217 from the TKB suffix because it is used for non-anonymous task
1220 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1223 /* Remove trailing "B" suffixes. */
1224 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1226 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1229 /* Make decoded big enough for possible expansion by operator name. */
1231 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1232 decoded
= decoding_buffer
;
1234 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1236 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1239 while ((i
>= 0 && isdigit (encoded
[i
]))
1240 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1242 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1244 else if (encoded
[i
] == '$')
1248 /* The first few characters that are not alphabetic are not part
1249 of any encoding we use, so we can copy them over verbatim. */
1251 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1252 decoded
[j
] = encoded
[i
];
1257 /* Is this a symbol function? */
1258 if (at_start_name
&& encoded
[i
] == 'O')
1262 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1264 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1265 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1267 && !isalnum (encoded
[i
+ op_len
]))
1269 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1272 j
+= strlen (ada_opname_table
[k
].decoded
);
1276 if (ada_opname_table
[k
].encoded
!= NULL
)
1281 /* Replace "TK__" with "__", which will eventually be translated
1282 into "." (just below). */
1284 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1287 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1288 be translated into "." (just below). These are internal names
1289 generated for anonymous blocks inside which our symbol is nested. */
1291 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1292 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1293 && isdigit (encoded
[i
+4]))
1297 while (k
< len0
&& isdigit (encoded
[k
]))
1298 k
++; /* Skip any extra digit. */
1300 /* Double-check that the "__B_{DIGITS}+" sequence we found
1301 is indeed followed by "__". */
1302 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1306 /* Remove _E{DIGITS}+[sb] */
1308 /* Just as for protected object subprograms, there are 2 categories
1309 of subprograms created by the compiler for each entry. The first
1310 one implements the actual entry code, and has a suffix following
1311 the convention above; the second one implements the barrier and
1312 uses the same convention as above, except that the 'E' is replaced
1315 Just as above, we do not decode the name of barrier functions
1316 to give the user a clue that the code he is debugging has been
1317 internally generated. */
1319 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1320 && isdigit (encoded
[i
+2]))
1324 while (k
< len0
&& isdigit (encoded
[k
]))
1328 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1331 /* Just as an extra precaution, make sure that if this
1332 suffix is followed by anything else, it is a '_'.
1333 Otherwise, we matched this sequence by accident. */
1335 || (k
< len0
&& encoded
[k
] == '_'))
1340 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1341 the GNAT front-end in protected object subprograms. */
1344 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1346 /* Backtrack a bit up until we reach either the begining of
1347 the encoded name, or "__". Make sure that we only find
1348 digits or lowercase characters. */
1349 const char *ptr
= encoded
+ i
- 1;
1351 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1354 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1358 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1360 /* This is a X[bn]* sequence not separated from the previous
1361 part of the name with a non-alpha-numeric character (in other
1362 words, immediately following an alpha-numeric character), then
1363 verify that it is placed at the end of the encoded name. If
1364 not, then the encoding is not valid and we should abort the
1365 decoding. Otherwise, just skip it, it is used in body-nested
1369 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1373 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1375 /* Replace '__' by '.'. */
1383 /* It's a character part of the decoded name, so just copy it
1385 decoded
[j
] = encoded
[i
];
1390 decoded
[j
] = '\000';
1392 /* Decoded names should never contain any uppercase character.
1393 Double-check this, and abort the decoding if we find one. */
1395 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1396 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1399 if (strcmp (decoded
, encoded
) == 0)
1405 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1406 decoded
= decoding_buffer
;
1407 if (encoded
[0] == '<')
1408 strcpy (decoded
, encoded
);
1410 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1415 /* Table for keeping permanent unique copies of decoded names. Once
1416 allocated, names in this table are never released. While this is a
1417 storage leak, it should not be significant unless there are massive
1418 changes in the set of decoded names in successive versions of a
1419 symbol table loaded during a single session. */
1420 static struct htab
*decoded_names_store
;
1422 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1423 in the language-specific part of GSYMBOL, if it has not been
1424 previously computed. Tries to save the decoded name in the same
1425 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1426 in any case, the decoded symbol has a lifetime at least that of
1428 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1429 const, but nevertheless modified to a semantically equivalent form
1430 when a decoded name is cached in it. */
1433 ada_decode_symbol (const struct general_symbol_info
*arg
)
1435 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1436 const char **resultp
=
1437 &gsymbol
->language_specific
.demangled_name
;
1439 if (!gsymbol
->ada_mangled
)
1441 const char *decoded
= ada_decode (gsymbol
->name
);
1442 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1444 gsymbol
->ada_mangled
= 1;
1446 if (obstack
!= NULL
)
1448 = (const char *) obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1451 /* Sometimes, we can't find a corresponding objfile, in
1452 which case, we put the result on the heap. Since we only
1453 decode when needed, we hope this usually does not cause a
1454 significant memory leak (FIXME). */
1456 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1460 *slot
= xstrdup (decoded
);
1469 ada_la_decode (const char *encoded
, int options
)
1471 return xstrdup (ada_decode (encoded
));
1474 /* Implement la_sniff_from_mangled_name for Ada. */
1477 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1479 const char *demangled
= ada_decode (mangled
);
1483 if (demangled
!= mangled
&& demangled
!= NULL
&& demangled
[0] != '<')
1485 /* Set the gsymbol language to Ada, but still return 0.
1486 Two reasons for that:
1488 1. For Ada, we prefer computing the symbol's decoded name
1489 on the fly rather than pre-compute it, in order to save
1490 memory (Ada projects are typically very large).
1492 2. There are some areas in the definition of the GNAT
1493 encoding where, with a bit of bad luck, we might be able
1494 to decode a non-Ada symbol, generating an incorrect
1495 demangled name (Eg: names ending with "TB" for instance
1496 are identified as task bodies and so stripped from
1497 the decoded name returned).
1499 Returning 1, here, but not setting *DEMANGLED, helps us get a
1500 little bit of the best of both worlds. Because we're last,
1501 we should not affect any of the other languages that were
1502 able to demangle the symbol before us; we get to correctly
1503 tag Ada symbols as such; and even if we incorrectly tagged a
1504 non-Ada symbol, which should be rare, any routing through the
1505 Ada language should be transparent (Ada tries to behave much
1506 like C/C++ with non-Ada symbols). */
1517 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1518 generated by the GNAT compiler to describe the index type used
1519 for each dimension of an array, check whether it follows the latest
1520 known encoding. If not, fix it up to conform to the latest encoding.
1521 Otherwise, do nothing. This function also does nothing if
1522 INDEX_DESC_TYPE is NULL.
1524 The GNAT encoding used to describle the array index type evolved a bit.
1525 Initially, the information would be provided through the name of each
1526 field of the structure type only, while the type of these fields was
1527 described as unspecified and irrelevant. The debugger was then expected
1528 to perform a global type lookup using the name of that field in order
1529 to get access to the full index type description. Because these global
1530 lookups can be very expensive, the encoding was later enhanced to make
1531 the global lookup unnecessary by defining the field type as being
1532 the full index type description.
1534 The purpose of this routine is to allow us to support older versions
1535 of the compiler by detecting the use of the older encoding, and by
1536 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1537 we essentially replace each field's meaningless type by the associated
1541 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1545 if (index_desc_type
== NULL
)
1547 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1549 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1550 to check one field only, no need to check them all). If not, return
1553 If our INDEX_DESC_TYPE was generated using the older encoding,
1554 the field type should be a meaningless integer type whose name
1555 is not equal to the field name. */
1556 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1557 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1558 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1561 /* Fixup each field of INDEX_DESC_TYPE. */
1562 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1564 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1565 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1568 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1572 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1574 static const char *bound_name
[] = {
1575 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1576 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1579 /* Maximum number of array dimensions we are prepared to handle. */
1581 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1584 /* The desc_* routines return primitive portions of array descriptors
1587 /* The descriptor or array type, if any, indicated by TYPE; removes
1588 level of indirection, if needed. */
1590 static struct type
*
1591 desc_base_type (struct type
*type
)
1595 type
= ada_check_typedef (type
);
1596 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1597 type
= ada_typedef_target_type (type
);
1600 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1601 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1602 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1607 /* True iff TYPE indicates a "thin" array pointer type. */
1610 is_thin_pntr (struct type
*type
)
1613 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1614 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1617 /* The descriptor type for thin pointer type TYPE. */
1619 static struct type
*
1620 thin_descriptor_type (struct type
*type
)
1622 struct type
*base_type
= desc_base_type (type
);
1624 if (base_type
== NULL
)
1626 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1630 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1632 if (alt_type
== NULL
)
1639 /* A pointer to the array data for thin-pointer value VAL. */
1641 static struct value
*
1642 thin_data_pntr (struct value
*val
)
1644 struct type
*type
= ada_check_typedef (value_type (val
));
1645 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1647 data_type
= lookup_pointer_type (data_type
);
1649 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1650 return value_cast (data_type
, value_copy (val
));
1652 return value_from_longest (data_type
, value_address (val
));
1655 /* True iff TYPE indicates a "thick" array pointer type. */
1658 is_thick_pntr (struct type
*type
)
1660 type
= desc_base_type (type
);
1661 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1662 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1665 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1666 pointer to one, the type of its bounds data; otherwise, NULL. */
1668 static struct type
*
1669 desc_bounds_type (struct type
*type
)
1673 type
= desc_base_type (type
);
1677 else if (is_thin_pntr (type
))
1679 type
= thin_descriptor_type (type
);
1682 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1684 return ada_check_typedef (r
);
1686 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1688 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1690 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1695 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1696 one, a pointer to its bounds data. Otherwise NULL. */
1698 static struct value
*
1699 desc_bounds (struct value
*arr
)
1701 struct type
*type
= ada_check_typedef (value_type (arr
));
1703 if (is_thin_pntr (type
))
1705 struct type
*bounds_type
=
1706 desc_bounds_type (thin_descriptor_type (type
));
1709 if (bounds_type
== NULL
)
1710 error (_("Bad GNAT array descriptor"));
1712 /* NOTE: The following calculation is not really kosher, but
1713 since desc_type is an XVE-encoded type (and shouldn't be),
1714 the correct calculation is a real pain. FIXME (and fix GCC). */
1715 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1716 addr
= value_as_long (arr
);
1718 addr
= value_address (arr
);
1721 value_from_longest (lookup_pointer_type (bounds_type
),
1722 addr
- TYPE_LENGTH (bounds_type
));
1725 else if (is_thick_pntr (type
))
1727 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1728 _("Bad GNAT array descriptor"));
1729 struct type
*p_bounds_type
= value_type (p_bounds
);
1732 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1734 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1736 if (TYPE_STUB (target_type
))
1737 p_bounds
= value_cast (lookup_pointer_type
1738 (ada_check_typedef (target_type
)),
1742 error (_("Bad GNAT array descriptor"));
1750 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1751 position of the field containing the address of the bounds data. */
1754 fat_pntr_bounds_bitpos (struct type
*type
)
1756 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1759 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1760 size of the field containing the address of the bounds data. */
1763 fat_pntr_bounds_bitsize (struct type
*type
)
1765 type
= desc_base_type (type
);
1767 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1768 return TYPE_FIELD_BITSIZE (type
, 1);
1770 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1773 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1774 pointer to one, the type of its array data (a array-with-no-bounds type);
1775 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1778 static struct type
*
1779 desc_data_target_type (struct type
*type
)
1781 type
= desc_base_type (type
);
1783 /* NOTE: The following is bogus; see comment in desc_bounds. */
1784 if (is_thin_pntr (type
))
1785 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1786 else if (is_thick_pntr (type
))
1788 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1791 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1792 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1798 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1801 static struct value
*
1802 desc_data (struct value
*arr
)
1804 struct type
*type
= value_type (arr
);
1806 if (is_thin_pntr (type
))
1807 return thin_data_pntr (arr
);
1808 else if (is_thick_pntr (type
))
1809 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1810 _("Bad GNAT array descriptor"));
1816 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1817 position of the field containing the address of the data. */
1820 fat_pntr_data_bitpos (struct type
*type
)
1822 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1825 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1826 size of the field containing the address of the data. */
1829 fat_pntr_data_bitsize (struct type
*type
)
1831 type
= desc_base_type (type
);
1833 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1834 return TYPE_FIELD_BITSIZE (type
, 0);
1836 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1839 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1840 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1841 bound, if WHICH is 1. The first bound is I=1. */
1843 static struct value
*
1844 desc_one_bound (struct value
*bounds
, int i
, int which
)
1846 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1847 _("Bad GNAT array descriptor bounds"));
1850 /* If BOUNDS is an array-bounds structure type, return the bit position
1851 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1852 bound, if WHICH is 1. The first bound is I=1. */
1855 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1857 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1860 /* If BOUNDS is an array-bounds structure type, return the bit field size
1861 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1862 bound, if WHICH is 1. The first bound is I=1. */
1865 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1867 type
= desc_base_type (type
);
1869 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1870 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1872 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1875 /* If TYPE is the type of an array-bounds structure, the type of its
1876 Ith bound (numbering from 1). Otherwise, NULL. */
1878 static struct type
*
1879 desc_index_type (struct type
*type
, int i
)
1881 type
= desc_base_type (type
);
1883 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1884 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1889 /* The number of index positions in the array-bounds type TYPE.
1890 Return 0 if TYPE is NULL. */
1893 desc_arity (struct type
*type
)
1895 type
= desc_base_type (type
);
1898 return TYPE_NFIELDS (type
) / 2;
1902 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1903 an array descriptor type (representing an unconstrained array
1907 ada_is_direct_array_type (struct type
*type
)
1911 type
= ada_check_typedef (type
);
1912 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1913 || ada_is_array_descriptor_type (type
));
1916 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1920 ada_is_array_type (struct type
*type
)
1923 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1924 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1925 type
= TYPE_TARGET_TYPE (type
);
1926 return ada_is_direct_array_type (type
);
1929 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1932 ada_is_simple_array_type (struct type
*type
)
1936 type
= ada_check_typedef (type
);
1937 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1938 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1939 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1940 == TYPE_CODE_ARRAY
));
1943 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1946 ada_is_array_descriptor_type (struct type
*type
)
1948 struct type
*data_type
= desc_data_target_type (type
);
1952 type
= ada_check_typedef (type
);
1953 return (data_type
!= NULL
1954 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1955 && desc_arity (desc_bounds_type (type
)) > 0);
1958 /* Non-zero iff type is a partially mal-formed GNAT array
1959 descriptor. FIXME: This is to compensate for some problems with
1960 debugging output from GNAT. Re-examine periodically to see if it
1964 ada_is_bogus_array_descriptor (struct type
*type
)
1968 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1969 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1970 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1971 && !ada_is_array_descriptor_type (type
);
1975 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1976 (fat pointer) returns the type of the array data described---specifically,
1977 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1978 in from the descriptor; otherwise, they are left unspecified. If
1979 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1980 returns NULL. The result is simply the type of ARR if ARR is not
1983 ada_type_of_array (struct value
*arr
, int bounds
)
1985 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1986 return decode_constrained_packed_array_type (value_type (arr
));
1988 if (!ada_is_array_descriptor_type (value_type (arr
)))
1989 return value_type (arr
);
1993 struct type
*array_type
=
1994 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1996 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1997 TYPE_FIELD_BITSIZE (array_type
, 0) =
1998 decode_packed_array_bitsize (value_type (arr
));
2004 struct type
*elt_type
;
2006 struct value
*descriptor
;
2008 elt_type
= ada_array_element_type (value_type (arr
), -1);
2009 arity
= ada_array_arity (value_type (arr
));
2011 if (elt_type
== NULL
|| arity
== 0)
2012 return ada_check_typedef (value_type (arr
));
2014 descriptor
= desc_bounds (arr
);
2015 if (value_as_long (descriptor
) == 0)
2019 struct type
*range_type
= alloc_type_copy (value_type (arr
));
2020 struct type
*array_type
= alloc_type_copy (value_type (arr
));
2021 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
2022 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
2025 create_static_range_type (range_type
, value_type (low
),
2026 longest_to_int (value_as_long (low
)),
2027 longest_to_int (value_as_long (high
)));
2028 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
2030 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
2032 /* We need to store the element packed bitsize, as well as
2033 recompute the array size, because it was previously
2034 computed based on the unpacked element size. */
2035 LONGEST lo
= value_as_long (low
);
2036 LONGEST hi
= value_as_long (high
);
2038 TYPE_FIELD_BITSIZE (elt_type
, 0) =
2039 decode_packed_array_bitsize (value_type (arr
));
2040 /* If the array has no element, then the size is already
2041 zero, and does not need to be recomputed. */
2045 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2047 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2052 return lookup_pointer_type (elt_type
);
2056 /* If ARR does not represent an array, returns ARR unchanged.
2057 Otherwise, returns either a standard GDB array with bounds set
2058 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2059 GDB array. Returns NULL if ARR is a null fat pointer. */
2062 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2064 if (ada_is_array_descriptor_type (value_type (arr
)))
2066 struct type
*arrType
= ada_type_of_array (arr
, 1);
2068 if (arrType
== NULL
)
2070 return value_cast (arrType
, value_copy (desc_data (arr
)));
2072 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2073 return decode_constrained_packed_array (arr
);
2078 /* If ARR does not represent an array, returns ARR unchanged.
2079 Otherwise, returns a standard GDB array describing ARR (which may
2080 be ARR itself if it already is in the proper form). */
2083 ada_coerce_to_simple_array (struct value
*arr
)
2085 if (ada_is_array_descriptor_type (value_type (arr
)))
2087 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2090 error (_("Bounds unavailable for null array pointer."));
2091 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2092 return value_ind (arrVal
);
2094 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2095 return decode_constrained_packed_array (arr
);
2100 /* If TYPE represents a GNAT array type, return it translated to an
2101 ordinary GDB array type (possibly with BITSIZE fields indicating
2102 packing). For other types, is the identity. */
2105 ada_coerce_to_simple_array_type (struct type
*type
)
2107 if (ada_is_constrained_packed_array_type (type
))
2108 return decode_constrained_packed_array_type (type
);
2110 if (ada_is_array_descriptor_type (type
))
2111 return ada_check_typedef (desc_data_target_type (type
));
2116 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2119 ada_is_packed_array_type (struct type
*type
)
2123 type
= desc_base_type (type
);
2124 type
= ada_check_typedef (type
);
2126 ada_type_name (type
) != NULL
2127 && strstr (ada_type_name (type
), "___XP") != NULL
;
2130 /* Non-zero iff TYPE represents a standard GNAT constrained
2131 packed-array type. */
2134 ada_is_constrained_packed_array_type (struct type
*type
)
2136 return ada_is_packed_array_type (type
)
2137 && !ada_is_array_descriptor_type (type
);
2140 /* Non-zero iff TYPE represents an array descriptor for a
2141 unconstrained packed-array type. */
2144 ada_is_unconstrained_packed_array_type (struct type
*type
)
2146 return ada_is_packed_array_type (type
)
2147 && ada_is_array_descriptor_type (type
);
2150 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2151 return the size of its elements in bits. */
2154 decode_packed_array_bitsize (struct type
*type
)
2156 const char *raw_name
;
2160 /* Access to arrays implemented as fat pointers are encoded as a typedef
2161 of the fat pointer type. We need the name of the fat pointer type
2162 to do the decoding, so strip the typedef layer. */
2163 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2164 type
= ada_typedef_target_type (type
);
2166 raw_name
= ada_type_name (ada_check_typedef (type
));
2168 raw_name
= ada_type_name (desc_base_type (type
));
2173 tail
= strstr (raw_name
, "___XP");
2174 gdb_assert (tail
!= NULL
);
2176 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2179 (_("could not understand bit size information on packed array"));
2186 /* Given that TYPE is a standard GDB array type with all bounds filled
2187 in, and that the element size of its ultimate scalar constituents
2188 (that is, either its elements, or, if it is an array of arrays, its
2189 elements' elements, etc.) is *ELT_BITS, return an identical type,
2190 but with the bit sizes of its elements (and those of any
2191 constituent arrays) recorded in the BITSIZE components of its
2192 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2195 Note that, for arrays whose index type has an XA encoding where
2196 a bound references a record discriminant, getting that discriminant,
2197 and therefore the actual value of that bound, is not possible
2198 because none of the given parameters gives us access to the record.
2199 This function assumes that it is OK in the context where it is being
2200 used to return an array whose bounds are still dynamic and where
2201 the length is arbitrary. */
2203 static struct type
*
2204 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2206 struct type
*new_elt_type
;
2207 struct type
*new_type
;
2208 struct type
*index_type_desc
;
2209 struct type
*index_type
;
2210 LONGEST low_bound
, high_bound
;
2212 type
= ada_check_typedef (type
);
2213 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2216 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2217 if (index_type_desc
)
2218 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2221 index_type
= TYPE_INDEX_TYPE (type
);
2223 new_type
= alloc_type_copy (type
);
2225 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2227 create_array_type (new_type
, new_elt_type
, index_type
);
2228 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2229 TYPE_NAME (new_type
) = ada_type_name (type
);
2231 if ((TYPE_CODE (check_typedef (index_type
)) == TYPE_CODE_RANGE
2232 && is_dynamic_type (check_typedef (index_type
)))
2233 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2234 low_bound
= high_bound
= 0;
2235 if (high_bound
< low_bound
)
2236 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2239 *elt_bits
*= (high_bound
- low_bound
+ 1);
2240 TYPE_LENGTH (new_type
) =
2241 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2244 TYPE_FIXED_INSTANCE (new_type
) = 1;
2248 /* The array type encoded by TYPE, where
2249 ada_is_constrained_packed_array_type (TYPE). */
2251 static struct type
*
2252 decode_constrained_packed_array_type (struct type
*type
)
2254 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2257 struct type
*shadow_type
;
2261 raw_name
= ada_type_name (desc_base_type (type
));
2266 name
= (char *) alloca (strlen (raw_name
) + 1);
2267 tail
= strstr (raw_name
, "___XP");
2268 type
= desc_base_type (type
);
2270 memcpy (name
, raw_name
, tail
- raw_name
);
2271 name
[tail
- raw_name
] = '\000';
2273 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2275 if (shadow_type
== NULL
)
2277 lim_warning (_("could not find bounds information on packed array"));
2280 shadow_type
= check_typedef (shadow_type
);
2282 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2284 lim_warning (_("could not understand bounds "
2285 "information on packed array"));
2289 bits
= decode_packed_array_bitsize (type
);
2290 return constrained_packed_array_type (shadow_type
, &bits
);
2293 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2294 array, returns a simple array that denotes that array. Its type is a
2295 standard GDB array type except that the BITSIZEs of the array
2296 target types are set to the number of bits in each element, and the
2297 type length is set appropriately. */
2299 static struct value
*
2300 decode_constrained_packed_array (struct value
*arr
)
2304 /* If our value is a pointer, then dereference it. Likewise if
2305 the value is a reference. Make sure that this operation does not
2306 cause the target type to be fixed, as this would indirectly cause
2307 this array to be decoded. The rest of the routine assumes that
2308 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2309 and "value_ind" routines to perform the dereferencing, as opposed
2310 to using "ada_coerce_ref" or "ada_value_ind". */
2311 arr
= coerce_ref (arr
);
2312 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2313 arr
= value_ind (arr
);
2315 type
= decode_constrained_packed_array_type (value_type (arr
));
2318 error (_("can't unpack array"));
2322 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2323 && ada_is_modular_type (value_type (arr
)))
2325 /* This is a (right-justified) modular type representing a packed
2326 array with no wrapper. In order to interpret the value through
2327 the (left-justified) packed array type we just built, we must
2328 first left-justify it. */
2329 int bit_size
, bit_pos
;
2332 mod
= ada_modulus (value_type (arr
)) - 1;
2339 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2340 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2341 bit_pos
/ HOST_CHAR_BIT
,
2342 bit_pos
% HOST_CHAR_BIT
,
2347 return coerce_unspec_val_to_type (arr
, type
);
2351 /* The value of the element of packed array ARR at the ARITY indices
2352 given in IND. ARR must be a simple array. */
2354 static struct value
*
2355 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2358 int bits
, elt_off
, bit_off
;
2359 long elt_total_bit_offset
;
2360 struct type
*elt_type
;
2364 elt_total_bit_offset
= 0;
2365 elt_type
= ada_check_typedef (value_type (arr
));
2366 for (i
= 0; i
< arity
; i
+= 1)
2368 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2369 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2371 (_("attempt to do packed indexing of "
2372 "something other than a packed array"));
2375 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2376 LONGEST lowerbound
, upperbound
;
2379 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2381 lim_warning (_("don't know bounds of array"));
2382 lowerbound
= upperbound
= 0;
2385 idx
= pos_atr (ind
[i
]);
2386 if (idx
< lowerbound
|| idx
> upperbound
)
2387 lim_warning (_("packed array index %ld out of bounds"),
2389 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2390 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2391 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2394 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2395 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2397 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2402 /* Non-zero iff TYPE includes negative integer values. */
2405 has_negatives (struct type
*type
)
2407 switch (TYPE_CODE (type
))
2412 return !TYPE_UNSIGNED (type
);
2413 case TYPE_CODE_RANGE
:
2414 return TYPE_LOW_BOUND (type
) < 0;
2418 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2419 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2420 the unpacked buffer.
2422 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2423 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2425 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2428 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2430 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2433 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2434 gdb_byte
*unpacked
, int unpacked_len
,
2435 int is_big_endian
, int is_signed_type
,
2438 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2439 int src_idx
; /* Index into the source area */
2440 int src_bytes_left
; /* Number of source bytes left to process. */
2441 int srcBitsLeft
; /* Number of source bits left to move */
2442 int unusedLS
; /* Number of bits in next significant
2443 byte of source that are unused */
2445 int unpacked_idx
; /* Index into the unpacked buffer */
2446 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2448 unsigned long accum
; /* Staging area for bits being transferred */
2449 int accumSize
; /* Number of meaningful bits in accum */
2452 /* Transmit bytes from least to most significant; delta is the direction
2453 the indices move. */
2454 int delta
= is_big_endian
? -1 : 1;
2456 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2458 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2459 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2460 bit_size
, unpacked_len
);
2462 srcBitsLeft
= bit_size
;
2463 src_bytes_left
= src_len
;
2464 unpacked_bytes_left
= unpacked_len
;
2469 src_idx
= src_len
- 1;
2471 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2475 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2481 unpacked_idx
= unpacked_len
- 1;
2485 /* Non-scalar values must be aligned at a byte boundary... */
2487 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2488 /* ... And are placed at the beginning (most-significant) bytes
2490 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2491 unpacked_bytes_left
= unpacked_idx
+ 1;
2496 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2498 src_idx
= unpacked_idx
= 0;
2499 unusedLS
= bit_offset
;
2502 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2507 while (src_bytes_left
> 0)
2509 /* Mask for removing bits of the next source byte that are not
2510 part of the value. */
2511 unsigned int unusedMSMask
=
2512 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2514 /* Sign-extend bits for this byte. */
2515 unsigned int signMask
= sign
& ~unusedMSMask
;
2518 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2519 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2520 if (accumSize
>= HOST_CHAR_BIT
)
2522 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2523 accumSize
-= HOST_CHAR_BIT
;
2524 accum
>>= HOST_CHAR_BIT
;
2525 unpacked_bytes_left
-= 1;
2526 unpacked_idx
+= delta
;
2528 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2530 src_bytes_left
-= 1;
2533 while (unpacked_bytes_left
> 0)
2535 accum
|= sign
<< accumSize
;
2536 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2537 accumSize
-= HOST_CHAR_BIT
;
2540 accum
>>= HOST_CHAR_BIT
;
2541 unpacked_bytes_left
-= 1;
2542 unpacked_idx
+= delta
;
2546 /* Create a new value of type TYPE from the contents of OBJ starting
2547 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2548 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2549 assigning through the result will set the field fetched from.
2550 VALADDR is ignored unless OBJ is NULL, in which case,
2551 VALADDR+OFFSET must address the start of storage containing the
2552 packed value. The value returned in this case is never an lval.
2553 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2556 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2557 long offset
, int bit_offset
, int bit_size
,
2561 const gdb_byte
*src
; /* First byte containing data to unpack */
2563 const int is_scalar
= is_scalar_type (type
);
2564 const int is_big_endian
= gdbarch_bits_big_endian (get_type_arch (type
));
2565 gdb::byte_vector staging
;
2567 type
= ada_check_typedef (type
);
2570 src
= valaddr
+ offset
;
2572 src
= value_contents (obj
) + offset
;
2574 if (is_dynamic_type (type
))
2576 /* The length of TYPE might by dynamic, so we need to resolve
2577 TYPE in order to know its actual size, which we then use
2578 to create the contents buffer of the value we return.
2579 The difficulty is that the data containing our object is
2580 packed, and therefore maybe not at a byte boundary. So, what
2581 we do, is unpack the data into a byte-aligned buffer, and then
2582 use that buffer as our object's value for resolving the type. */
2583 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2584 staging
.resize (staging_len
);
2586 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2587 staging
.data (), staging
.size (),
2588 is_big_endian
, has_negatives (type
),
2590 type
= resolve_dynamic_type (type
, staging
.data (), 0);
2591 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2593 /* This happens when the length of the object is dynamic,
2594 and is actually smaller than the space reserved for it.
2595 For instance, in an array of variant records, the bit_size
2596 we're given is the array stride, which is constant and
2597 normally equal to the maximum size of its element.
2598 But, in reality, each element only actually spans a portion
2600 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2606 v
= allocate_value (type
);
2607 src
= valaddr
+ offset
;
2609 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2611 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2614 v
= value_at (type
, value_address (obj
) + offset
);
2615 buf
= (gdb_byte
*) alloca (src_len
);
2616 read_memory (value_address (v
), buf
, src_len
);
2621 v
= allocate_value (type
);
2622 src
= value_contents (obj
) + offset
;
2627 long new_offset
= offset
;
2629 set_value_component_location (v
, obj
);
2630 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2631 set_value_bitsize (v
, bit_size
);
2632 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2635 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2637 set_value_offset (v
, new_offset
);
2639 /* Also set the parent value. This is needed when trying to
2640 assign a new value (in inferior memory). */
2641 set_value_parent (v
, obj
);
2644 set_value_bitsize (v
, bit_size
);
2645 unpacked
= value_contents_writeable (v
);
2649 memset (unpacked
, 0, TYPE_LENGTH (type
));
2653 if (staging
.size () == TYPE_LENGTH (type
))
2655 /* Small short-cut: If we've unpacked the data into a buffer
2656 of the same size as TYPE's length, then we can reuse that,
2657 instead of doing the unpacking again. */
2658 memcpy (unpacked
, staging
.data (), staging
.size ());
2661 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2662 unpacked
, TYPE_LENGTH (type
),
2663 is_big_endian
, has_negatives (type
), is_scalar
);
2668 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2669 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2672 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2673 int src_offset
, int n
, int bits_big_endian_p
)
2675 unsigned int accum
, mask
;
2676 int accum_bits
, chunk_size
;
2678 target
+= targ_offset
/ HOST_CHAR_BIT
;
2679 targ_offset
%= HOST_CHAR_BIT
;
2680 source
+= src_offset
/ HOST_CHAR_BIT
;
2681 src_offset
%= HOST_CHAR_BIT
;
2682 if (bits_big_endian_p
)
2684 accum
= (unsigned char) *source
;
2686 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2692 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2693 accum_bits
+= HOST_CHAR_BIT
;
2695 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2698 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2699 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2702 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2704 accum_bits
-= chunk_size
;
2711 accum
= (unsigned char) *source
>> src_offset
;
2713 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2717 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2718 accum_bits
+= HOST_CHAR_BIT
;
2720 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2723 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2724 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2726 accum_bits
-= chunk_size
;
2727 accum
>>= chunk_size
;
2734 /* Store the contents of FROMVAL into the location of TOVAL.
2735 Return a new value with the location of TOVAL and contents of
2736 FROMVAL. Handles assignment into packed fields that have
2737 floating-point or non-scalar types. */
2739 static struct value
*
2740 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2742 struct type
*type
= value_type (toval
);
2743 int bits
= value_bitsize (toval
);
2745 toval
= ada_coerce_ref (toval
);
2746 fromval
= ada_coerce_ref (fromval
);
2748 if (ada_is_direct_array_type (value_type (toval
)))
2749 toval
= ada_coerce_to_simple_array (toval
);
2750 if (ada_is_direct_array_type (value_type (fromval
)))
2751 fromval
= ada_coerce_to_simple_array (fromval
);
2753 if (!deprecated_value_modifiable (toval
))
2754 error (_("Left operand of assignment is not a modifiable lvalue."));
2756 if (VALUE_LVAL (toval
) == lval_memory
2758 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2759 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2761 int len
= (value_bitpos (toval
)
2762 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2764 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2766 CORE_ADDR to_addr
= value_address (toval
);
2768 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2769 fromval
= value_cast (type
, fromval
);
2771 read_memory (to_addr
, buffer
, len
);
2772 from_size
= value_bitsize (fromval
);
2774 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2775 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2776 move_bits (buffer
, value_bitpos (toval
),
2777 value_contents (fromval
), from_size
- bits
, bits
, 1);
2779 move_bits (buffer
, value_bitpos (toval
),
2780 value_contents (fromval
), 0, bits
, 0);
2781 write_memory_with_notification (to_addr
, buffer
, len
);
2783 val
= value_copy (toval
);
2784 memcpy (value_contents_raw (val
), value_contents (fromval
),
2785 TYPE_LENGTH (type
));
2786 deprecated_set_value_type (val
, type
);
2791 return value_assign (toval
, fromval
);
2795 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2796 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2797 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2798 COMPONENT, and not the inferior's memory. The current contents
2799 of COMPONENT are ignored.
2801 Although not part of the initial design, this function also works
2802 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2803 had a null address, and COMPONENT had an address which is equal to
2804 its offset inside CONTAINER. */
2807 value_assign_to_component (struct value
*container
, struct value
*component
,
2810 LONGEST offset_in_container
=
2811 (LONGEST
) (value_address (component
) - value_address (container
));
2812 int bit_offset_in_container
=
2813 value_bitpos (component
) - value_bitpos (container
);
2816 val
= value_cast (value_type (component
), val
);
2818 if (value_bitsize (component
) == 0)
2819 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2821 bits
= value_bitsize (component
);
2823 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2824 move_bits (value_contents_writeable (container
) + offset_in_container
,
2825 value_bitpos (container
) + bit_offset_in_container
,
2826 value_contents (val
),
2827 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2830 move_bits (value_contents_writeable (container
) + offset_in_container
,
2831 value_bitpos (container
) + bit_offset_in_container
,
2832 value_contents (val
), 0, bits
, 0);
2835 /* The value of the element of array ARR at the ARITY indices given in IND.
2836 ARR may be either a simple array, GNAT array descriptor, or pointer
2840 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2844 struct type
*elt_type
;
2846 elt
= ada_coerce_to_simple_array (arr
);
2848 elt_type
= ada_check_typedef (value_type (elt
));
2849 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2850 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2851 return value_subscript_packed (elt
, arity
, ind
);
2853 for (k
= 0; k
< arity
; k
+= 1)
2855 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2856 error (_("too many subscripts (%d expected)"), k
);
2857 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2862 /* Assuming ARR is a pointer to a GDB array, the value of the element
2863 of *ARR at the ARITY indices given in IND.
2864 Does not read the entire array into memory.
2866 Note: Unlike what one would expect, this function is used instead of
2867 ada_value_subscript for basically all non-packed array types. The reason
2868 for this is that a side effect of doing our own pointer arithmetics instead
2869 of relying on value_subscript is that there is no implicit typedef peeling.
2870 This is important for arrays of array accesses, where it allows us to
2871 preserve the fact that the array's element is an array access, where the
2872 access part os encoded in a typedef layer. */
2874 static struct value
*
2875 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2878 struct value
*array_ind
= ada_value_ind (arr
);
2880 = check_typedef (value_enclosing_type (array_ind
));
2882 if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
2883 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2884 return value_subscript_packed (array_ind
, arity
, ind
);
2886 for (k
= 0; k
< arity
; k
+= 1)
2889 struct value
*lwb_value
;
2891 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2892 error (_("too many subscripts (%d expected)"), k
);
2893 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2895 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2896 lwb_value
= value_from_longest (value_type(ind
[k
]), lwb
);
2897 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - pos_atr (lwb_value
));
2898 type
= TYPE_TARGET_TYPE (type
);
2901 return value_ind (arr
);
2904 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2905 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2906 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2907 this array is LOW, as per Ada rules. */
2908 static struct value
*
2909 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2912 struct type
*type0
= ada_check_typedef (type
);
2913 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2914 struct type
*index_type
2915 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2916 struct type
*slice_type
=
2917 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2918 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2919 LONGEST base_low_pos
, low_pos
;
2922 if (!discrete_position (base_index_type
, low
, &low_pos
)
2923 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2925 warning (_("unable to get positions in slice, use bounds instead"));
2927 base_low_pos
= base_low
;
2930 base
= value_as_address (array_ptr
)
2931 + ((low_pos
- base_low_pos
)
2932 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2933 return value_at_lazy (slice_type
, base
);
2937 static struct value
*
2938 ada_value_slice (struct value
*array
, int low
, int high
)
2940 struct type
*type
= ada_check_typedef (value_type (array
));
2941 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2942 struct type
*index_type
2943 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2944 struct type
*slice_type
=
2945 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2946 LONGEST low_pos
, high_pos
;
2948 if (!discrete_position (base_index_type
, low
, &low_pos
)
2949 || !discrete_position (base_index_type
, high
, &high_pos
))
2951 warning (_("unable to get positions in slice, use bounds instead"));
2956 return value_cast (slice_type
,
2957 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2960 /* If type is a record type in the form of a standard GNAT array
2961 descriptor, returns the number of dimensions for type. If arr is a
2962 simple array, returns the number of "array of"s that prefix its
2963 type designation. Otherwise, returns 0. */
2966 ada_array_arity (struct type
*type
)
2973 type
= desc_base_type (type
);
2976 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2977 return desc_arity (desc_bounds_type (type
));
2979 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2982 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2988 /* If TYPE is a record type in the form of a standard GNAT array
2989 descriptor or a simple array type, returns the element type for
2990 TYPE after indexing by NINDICES indices, or by all indices if
2991 NINDICES is -1. Otherwise, returns NULL. */
2994 ada_array_element_type (struct type
*type
, int nindices
)
2996 type
= desc_base_type (type
);
2998 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
3001 struct type
*p_array_type
;
3003 p_array_type
= desc_data_target_type (type
);
3005 k
= ada_array_arity (type
);
3009 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
3010 if (nindices
>= 0 && k
> nindices
)
3012 while (k
> 0 && p_array_type
!= NULL
)
3014 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
3017 return p_array_type
;
3019 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3021 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
3023 type
= TYPE_TARGET_TYPE (type
);
3032 /* The type of nth index in arrays of given type (n numbering from 1).
3033 Does not examine memory. Throws an error if N is invalid or TYPE
3034 is not an array type. NAME is the name of the Ada attribute being
3035 evaluated ('range, 'first, 'last, or 'length); it is used in building
3036 the error message. */
3038 static struct type
*
3039 ada_index_type (struct type
*type
, int n
, const char *name
)
3041 struct type
*result_type
;
3043 type
= desc_base_type (type
);
3045 if (n
< 0 || n
> ada_array_arity (type
))
3046 error (_("invalid dimension number to '%s"), name
);
3048 if (ada_is_simple_array_type (type
))
3052 for (i
= 1; i
< n
; i
+= 1)
3053 type
= TYPE_TARGET_TYPE (type
);
3054 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
3055 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3056 has a target type of TYPE_CODE_UNDEF. We compensate here, but
3057 perhaps stabsread.c would make more sense. */
3058 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
3063 result_type
= desc_index_type (desc_bounds_type (type
), n
);
3064 if (result_type
== NULL
)
3065 error (_("attempt to take bound of something that is not an array"));
3071 /* Given that arr is an array type, returns the lower bound of the
3072 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
3073 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
3074 array-descriptor type. It works for other arrays with bounds supplied
3075 by run-time quantities other than discriminants. */
3078 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
3080 struct type
*type
, *index_type_desc
, *index_type
;
3083 gdb_assert (which
== 0 || which
== 1);
3085 if (ada_is_constrained_packed_array_type (arr_type
))
3086 arr_type
= decode_constrained_packed_array_type (arr_type
);
3088 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
3089 return (LONGEST
) - which
;
3091 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
3092 type
= TYPE_TARGET_TYPE (arr_type
);
3096 if (TYPE_FIXED_INSTANCE (type
))
3098 /* The array has already been fixed, so we do not need to
3099 check the parallel ___XA type again. That encoding has
3100 already been applied, so ignore it now. */
3101 index_type_desc
= NULL
;
3105 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3106 ada_fixup_array_indexes_type (index_type_desc
);
3109 if (index_type_desc
!= NULL
)
3110 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3114 struct type
*elt_type
= check_typedef (type
);
3116 for (i
= 1; i
< n
; i
++)
3117 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3119 index_type
= TYPE_INDEX_TYPE (elt_type
);
3123 (LONGEST
) (which
== 0
3124 ? ada_discrete_type_low_bound (index_type
)
3125 : ada_discrete_type_high_bound (index_type
));
3128 /* Given that arr is an array value, returns the lower bound of the
3129 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3130 WHICH is 1. This routine will also work for arrays with bounds
3131 supplied by run-time quantities other than discriminants. */
3134 ada_array_bound (struct value
*arr
, int n
, int which
)
3136 struct type
*arr_type
;
3138 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3139 arr
= value_ind (arr
);
3140 arr_type
= value_enclosing_type (arr
);
3142 if (ada_is_constrained_packed_array_type (arr_type
))
3143 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3144 else if (ada_is_simple_array_type (arr_type
))
3145 return ada_array_bound_from_type (arr_type
, n
, which
);
3147 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3150 /* Given that arr is an array value, returns the length of the
3151 nth index. This routine will also work for arrays with bounds
3152 supplied by run-time quantities other than discriminants.
3153 Does not work for arrays indexed by enumeration types with representation
3154 clauses at the moment. */
3157 ada_array_length (struct value
*arr
, int n
)
3159 struct type
*arr_type
, *index_type
;
3162 if (TYPE_CODE (check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
3163 arr
= value_ind (arr
);
3164 arr_type
= value_enclosing_type (arr
);
3166 if (ada_is_constrained_packed_array_type (arr_type
))
3167 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3169 if (ada_is_simple_array_type (arr_type
))
3171 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3172 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3176 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3177 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3180 arr_type
= check_typedef (arr_type
);
3181 index_type
= TYPE_INDEX_TYPE (arr_type
);
3182 if (index_type
!= NULL
)
3184 struct type
*base_type
;
3185 if (TYPE_CODE (index_type
) == TYPE_CODE_RANGE
)
3186 base_type
= TYPE_TARGET_TYPE (index_type
);
3188 base_type
= index_type
;
3190 low
= pos_atr (value_from_longest (base_type
, low
));
3191 high
= pos_atr (value_from_longest (base_type
, high
));
3193 return high
- low
+ 1;
3196 /* An empty array whose type is that of ARR_TYPE (an array type),
3197 with bounds LOW to LOW-1. */
3199 static struct value
*
3200 empty_array (struct type
*arr_type
, int low
)
3202 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3203 struct type
*index_type
3204 = create_static_range_type
3205 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
3206 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3208 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3212 /* Name resolution */
3214 /* The "decoded" name for the user-definable Ada operator corresponding
3218 ada_decoded_op_name (enum exp_opcode op
)
3222 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3224 if (ada_opname_table
[i
].op
== op
)
3225 return ada_opname_table
[i
].decoded
;
3227 error (_("Could not find operator name for opcode"));
3231 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3232 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3233 undefined namespace) and converts operators that are
3234 user-defined into appropriate function calls. If CONTEXT_TYPE is
3235 non-null, it provides a preferred result type [at the moment, only
3236 type void has any effect---causing procedures to be preferred over
3237 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3238 return type is preferred. May change (expand) *EXP. */
3241 resolve (struct expression
**expp
, int void_context_p
)
3243 struct type
*context_type
= NULL
;
3247 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3249 resolve_subexp (expp
, &pc
, 1, context_type
);
3252 /* Resolve the operator of the subexpression beginning at
3253 position *POS of *EXPP. "Resolving" consists of replacing
3254 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3255 with their resolutions, replacing built-in operators with
3256 function calls to user-defined operators, where appropriate, and,
3257 when DEPROCEDURE_P is non-zero, converting function-valued variables
3258 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3259 are as in ada_resolve, above. */
3261 static struct value
*
3262 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3263 struct type
*context_type
)
3267 struct expression
*exp
; /* Convenience: == *expp. */
3268 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3269 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3270 int nargs
; /* Number of operands. */
3277 /* Pass one: resolve operands, saving their types and updating *pos,
3282 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3283 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3288 resolve_subexp (expp
, pos
, 0, NULL
);
3290 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3295 resolve_subexp (expp
, pos
, 0, NULL
);
3300 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3303 case OP_ATR_MODULUS
:
3313 case TERNOP_IN_RANGE
:
3314 case BINOP_IN_BOUNDS
:
3320 case OP_DISCRETE_RANGE
:
3322 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3331 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3333 resolve_subexp (expp
, pos
, 1, NULL
);
3335 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3352 case BINOP_LOGICAL_AND
:
3353 case BINOP_LOGICAL_OR
:
3354 case BINOP_BITWISE_AND
:
3355 case BINOP_BITWISE_IOR
:
3356 case BINOP_BITWISE_XOR
:
3359 case BINOP_NOTEQUAL
:
3366 case BINOP_SUBSCRIPT
:
3374 case UNOP_LOGICAL_NOT
:
3384 case OP_VAR_MSYM_VALUE
:
3391 case OP_INTERNALVAR
:
3401 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3404 case STRUCTOP_STRUCT
:
3405 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3418 error (_("Unexpected operator during name resolution"));
3421 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3422 for (i
= 0; i
< nargs
; i
+= 1)
3423 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3427 /* Pass two: perform any resolution on principal operator. */
3434 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3436 struct block_symbol
*candidates
;
3440 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3441 (exp
->elts
[pc
+ 2].symbol
),
3442 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3445 if (n_candidates
> 1)
3447 /* Types tend to get re-introduced locally, so if there
3448 are any local symbols that are not types, first filter
3451 for (j
= 0; j
< n_candidates
; j
+= 1)
3452 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3457 case LOC_REGPARM_ADDR
:
3465 if (j
< n_candidates
)
3468 while (j
< n_candidates
)
3470 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3472 candidates
[j
] = candidates
[n_candidates
- 1];
3481 if (n_candidates
== 0)
3482 error (_("No definition found for %s"),
3483 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3484 else if (n_candidates
== 1)
3486 else if (deprocedure_p
3487 && !is_nonfunction (candidates
, n_candidates
))
3489 i
= ada_resolve_function
3490 (candidates
, n_candidates
, NULL
, 0,
3491 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3494 error (_("Could not find a match for %s"),
3495 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3499 printf_filtered (_("Multiple matches for %s\n"),
3500 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3501 user_select_syms (candidates
, n_candidates
, 1);
3505 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3506 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3507 if (innermost_block
== NULL
3508 || contained_in (candidates
[i
].block
, innermost_block
))
3509 innermost_block
= candidates
[i
].block
;
3513 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3516 replace_operator_with_call (expp
, pc
, 0, 0,
3517 exp
->elts
[pc
+ 2].symbol
,
3518 exp
->elts
[pc
+ 1].block
);
3525 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3526 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3528 struct block_symbol
*candidates
;
3532 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3533 (exp
->elts
[pc
+ 5].symbol
),
3534 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3536 if (n_candidates
== 1)
3540 i
= ada_resolve_function
3541 (candidates
, n_candidates
,
3543 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3546 error (_("Could not find a match for %s"),
3547 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3550 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3551 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3552 if (innermost_block
== NULL
3553 || contained_in (candidates
[i
].block
, innermost_block
))
3554 innermost_block
= candidates
[i
].block
;
3565 case BINOP_BITWISE_AND
:
3566 case BINOP_BITWISE_IOR
:
3567 case BINOP_BITWISE_XOR
:
3569 case BINOP_NOTEQUAL
:
3577 case UNOP_LOGICAL_NOT
:
3579 if (possible_user_operator_p (op
, argvec
))
3581 struct block_symbol
*candidates
;
3585 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3586 (struct block
*) NULL
, VAR_DOMAIN
,
3588 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3589 ada_decoded_op_name (op
), NULL
);
3593 replace_operator_with_call (expp
, pc
, nargs
, 1,
3594 candidates
[i
].symbol
,
3595 candidates
[i
].block
);
3606 return evaluate_subexp_type (exp
, pos
);
3609 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3610 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3612 /* The term "match" here is rather loose. The match is heuristic and
3616 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3618 ftype
= ada_check_typedef (ftype
);
3619 atype
= ada_check_typedef (atype
);
3621 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3622 ftype
= TYPE_TARGET_TYPE (ftype
);
3623 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3624 atype
= TYPE_TARGET_TYPE (atype
);
3626 switch (TYPE_CODE (ftype
))
3629 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3631 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3632 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3633 TYPE_TARGET_TYPE (atype
), 0);
3636 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3638 case TYPE_CODE_ENUM
:
3639 case TYPE_CODE_RANGE
:
3640 switch (TYPE_CODE (atype
))
3643 case TYPE_CODE_ENUM
:
3644 case TYPE_CODE_RANGE
:
3650 case TYPE_CODE_ARRAY
:
3651 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3652 || ada_is_array_descriptor_type (atype
));
3654 case TYPE_CODE_STRUCT
:
3655 if (ada_is_array_descriptor_type (ftype
))
3656 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3657 || ada_is_array_descriptor_type (atype
));
3659 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3660 && !ada_is_array_descriptor_type (atype
));
3662 case TYPE_CODE_UNION
:
3664 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3668 /* Return non-zero if the formals of FUNC "sufficiently match" the
3669 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3670 may also be an enumeral, in which case it is treated as a 0-
3671 argument function. */
3674 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3677 struct type
*func_type
= SYMBOL_TYPE (func
);
3679 if (SYMBOL_CLASS (func
) == LOC_CONST
3680 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3681 return (n_actuals
== 0);
3682 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3685 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3688 for (i
= 0; i
< n_actuals
; i
+= 1)
3690 if (actuals
[i
] == NULL
)
3694 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3696 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3698 if (!ada_type_match (ftype
, atype
, 1))
3705 /* False iff function type FUNC_TYPE definitely does not produce a value
3706 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3707 FUNC_TYPE is not a valid function type with a non-null return type
3708 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3711 return_match (struct type
*func_type
, struct type
*context_type
)
3713 struct type
*return_type
;
3715 if (func_type
== NULL
)
3718 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3719 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3721 return_type
= get_base_type (func_type
);
3722 if (return_type
== NULL
)
3725 context_type
= get_base_type (context_type
);
3727 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3728 return context_type
== NULL
|| return_type
== context_type
;
3729 else if (context_type
== NULL
)
3730 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3732 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3736 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3737 function (if any) that matches the types of the NARGS arguments in
3738 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3739 that returns that type, then eliminate matches that don't. If
3740 CONTEXT_TYPE is void and there is at least one match that does not
3741 return void, eliminate all matches that do.
3743 Asks the user if there is more than one match remaining. Returns -1
3744 if there is no such symbol or none is selected. NAME is used
3745 solely for messages. May re-arrange and modify SYMS in
3746 the process; the index returned is for the modified vector. */
3749 ada_resolve_function (struct block_symbol syms
[],
3750 int nsyms
, struct value
**args
, int nargs
,
3751 const char *name
, struct type
*context_type
)
3755 int m
; /* Number of hits */
3758 /* In the first pass of the loop, we only accept functions matching
3759 context_type. If none are found, we add a second pass of the loop
3760 where every function is accepted. */
3761 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3763 for (k
= 0; k
< nsyms
; k
+= 1)
3765 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3767 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3768 && (fallback
|| return_match (type
, context_type
)))
3776 /* If we got multiple matches, ask the user which one to use. Don't do this
3777 interactive thing during completion, though, as the purpose of the
3778 completion is providing a list of all possible matches. Prompting the
3779 user to filter it down would be completely unexpected in this case. */
3782 else if (m
> 1 && !parse_completion
)
3784 printf_filtered (_("Multiple matches for %s\n"), name
);
3785 user_select_syms (syms
, m
, 1);
3791 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3792 in a listing of choices during disambiguation (see sort_choices, below).
3793 The idea is that overloadings of a subprogram name from the
3794 same package should sort in their source order. We settle for ordering
3795 such symbols by their trailing number (__N or $N). */
3798 encoded_ordered_before (const char *N0
, const char *N1
)
3802 else if (N0
== NULL
)
3808 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3810 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3812 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3813 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3818 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3821 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3823 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3824 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3826 return (strcmp (N0
, N1
) < 0);
3830 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3834 sort_choices (struct block_symbol syms
[], int nsyms
)
3838 for (i
= 1; i
< nsyms
; i
+= 1)
3840 struct block_symbol sym
= syms
[i
];
3843 for (j
= i
- 1; j
>= 0; j
-= 1)
3845 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
3846 SYMBOL_LINKAGE_NAME (sym
.symbol
)))
3848 syms
[j
+ 1] = syms
[j
];
3854 /* Whether GDB should display formals and return types for functions in the
3855 overloads selection menu. */
3856 static int print_signatures
= 1;
3858 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3859 all but functions, the signature is just the name of the symbol. For
3860 functions, this is the name of the function, the list of types for formals
3861 and the return type (if any). */
3864 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3865 const struct type_print_options
*flags
)
3867 struct type
*type
= SYMBOL_TYPE (sym
);
3869 fprintf_filtered (stream
, "%s", SYMBOL_PRINT_NAME (sym
));
3870 if (!print_signatures
3872 || TYPE_CODE (type
) != TYPE_CODE_FUNC
)
3875 if (TYPE_NFIELDS (type
) > 0)
3879 fprintf_filtered (stream
, " (");
3880 for (i
= 0; i
< TYPE_NFIELDS (type
); ++i
)
3883 fprintf_filtered (stream
, "; ");
3884 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3887 fprintf_filtered (stream
, ")");
3889 if (TYPE_TARGET_TYPE (type
) != NULL
3890 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) != TYPE_CODE_VOID
)
3892 fprintf_filtered (stream
, " return ");
3893 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3897 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3898 by asking the user (if necessary), returning the number selected,
3899 and setting the first elements of SYMS items. Error if no symbols
3902 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3903 to be re-integrated one of these days. */
3906 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3909 int *chosen
= XALLOCAVEC (int , nsyms
);
3911 int first_choice
= (max_results
== 1) ? 1 : 2;
3912 const char *select_mode
= multiple_symbols_select_mode ();
3914 if (max_results
< 1)
3915 error (_("Request to select 0 symbols!"));
3919 if (select_mode
== multiple_symbols_cancel
)
3921 canceled because the command is ambiguous\n\
3922 See set/show multiple-symbol."));
3924 /* If select_mode is "all", then return all possible symbols.
3925 Only do that if more than one symbol can be selected, of course.
3926 Otherwise, display the menu as usual. */
3927 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3930 printf_unfiltered (_("[0] cancel\n"));
3931 if (max_results
> 1)
3932 printf_unfiltered (_("[1] all\n"));
3934 sort_choices (syms
, nsyms
);
3936 for (i
= 0; i
< nsyms
; i
+= 1)
3938 if (syms
[i
].symbol
== NULL
)
3941 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3943 struct symtab_and_line sal
=
3944 find_function_start_sal (syms
[i
].symbol
, 1);
3946 printf_unfiltered ("[%d] ", i
+ first_choice
);
3947 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3948 &type_print_raw_options
);
3949 if (sal
.symtab
== NULL
)
3950 printf_unfiltered (_(" at <no source file available>:%d\n"),
3953 printf_unfiltered (_(" at %s:%d\n"),
3954 symtab_to_filename_for_display (sal
.symtab
),
3961 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3962 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3963 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) == TYPE_CODE_ENUM
);
3964 struct symtab
*symtab
= NULL
;
3966 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3967 symtab
= symbol_symtab (syms
[i
].symbol
);
3969 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3971 printf_unfiltered ("[%d] ", i
+ first_choice
);
3972 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3973 &type_print_raw_options
);
3974 printf_unfiltered (_(" at %s:%d\n"),
3975 symtab_to_filename_for_display (symtab
),
3976 SYMBOL_LINE (syms
[i
].symbol
));
3978 else if (is_enumeral
3979 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].symbol
)) != NULL
)
3981 printf_unfiltered (("[%d] "), i
+ first_choice
);
3982 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3983 gdb_stdout
, -1, 0, &type_print_raw_options
);
3984 printf_unfiltered (_("'(%s) (enumeral)\n"),
3985 SYMBOL_PRINT_NAME (syms
[i
].symbol
));
3989 printf_unfiltered ("[%d] ", i
+ first_choice
);
3990 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3991 &type_print_raw_options
);
3994 printf_unfiltered (is_enumeral
3995 ? _(" in %s (enumeral)\n")
3997 symtab_to_filename_for_display (symtab
));
3999 printf_unfiltered (is_enumeral
4000 ? _(" (enumeral)\n")
4006 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
4009 for (i
= 0; i
< n_chosen
; i
+= 1)
4010 syms
[i
] = syms
[chosen
[i
]];
4015 /* Read and validate a set of numeric choices from the user in the
4016 range 0 .. N_CHOICES-1. Place the results in increasing
4017 order in CHOICES[0 .. N-1], and return N.
4019 The user types choices as a sequence of numbers on one line
4020 separated by blanks, encoding them as follows:
4022 + A choice of 0 means to cancel the selection, throwing an error.
4023 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4024 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4026 The user is not allowed to choose more than MAX_RESULTS values.
4028 ANNOTATION_SUFFIX, if present, is used to annotate the input
4029 prompts (for use with the -f switch). */
4032 get_selections (int *choices
, int n_choices
, int max_results
,
4033 int is_all_choice
, const char *annotation_suffix
)
4038 int first_choice
= is_all_choice
? 2 : 1;
4040 prompt
= getenv ("PS2");
4044 args
= command_line_input (prompt
, 0, annotation_suffix
);
4047 error_no_arg (_("one or more choice numbers"));
4051 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4052 order, as given in args. Choices are validated. */
4058 args
= skip_spaces (args
);
4059 if (*args
== '\0' && n_chosen
== 0)
4060 error_no_arg (_("one or more choice numbers"));
4061 else if (*args
== '\0')
4064 choice
= strtol (args
, &args2
, 10);
4065 if (args
== args2
|| choice
< 0
4066 || choice
> n_choices
+ first_choice
- 1)
4067 error (_("Argument must be choice number"));
4071 error (_("cancelled"));
4073 if (choice
< first_choice
)
4075 n_chosen
= n_choices
;
4076 for (j
= 0; j
< n_choices
; j
+= 1)
4080 choice
-= first_choice
;
4082 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
4086 if (j
< 0 || choice
!= choices
[j
])
4090 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
4091 choices
[k
+ 1] = choices
[k
];
4092 choices
[j
+ 1] = choice
;
4097 if (n_chosen
> max_results
)
4098 error (_("Select no more than %d of the above"), max_results
);
4103 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4104 on the function identified by SYM and BLOCK, and taking NARGS
4105 arguments. Update *EXPP as needed to hold more space. */
4108 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
4109 int oplen
, struct symbol
*sym
,
4110 const struct block
*block
)
4112 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4113 symbol, -oplen for operator being replaced). */
4114 struct expression
*newexp
= (struct expression
*)
4115 xzalloc (sizeof (struct expression
)
4116 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4117 struct expression
*exp
= *expp
;
4119 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4120 newexp
->language_defn
= exp
->language_defn
;
4121 newexp
->gdbarch
= exp
->gdbarch
;
4122 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4123 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4124 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4126 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4127 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4129 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4130 newexp
->elts
[pc
+ 4].block
= block
;
4131 newexp
->elts
[pc
+ 5].symbol
= sym
;
4137 /* Type-class predicates */
4139 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4143 numeric_type_p (struct type
*type
)
4149 switch (TYPE_CODE (type
))
4154 case TYPE_CODE_RANGE
:
4155 return (type
== TYPE_TARGET_TYPE (type
)
4156 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4163 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4166 integer_type_p (struct type
*type
)
4172 switch (TYPE_CODE (type
))
4176 case TYPE_CODE_RANGE
:
4177 return (type
== TYPE_TARGET_TYPE (type
)
4178 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4185 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4188 scalar_type_p (struct type
*type
)
4194 switch (TYPE_CODE (type
))
4197 case TYPE_CODE_RANGE
:
4198 case TYPE_CODE_ENUM
:
4207 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4210 discrete_type_p (struct type
*type
)
4216 switch (TYPE_CODE (type
))
4219 case TYPE_CODE_RANGE
:
4220 case TYPE_CODE_ENUM
:
4221 case TYPE_CODE_BOOL
:
4229 /* Returns non-zero if OP with operands in the vector ARGS could be
4230 a user-defined function. Errs on the side of pre-defined operators
4231 (i.e., result 0). */
4234 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4236 struct type
*type0
=
4237 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4238 struct type
*type1
=
4239 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4253 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4257 case BINOP_BITWISE_AND
:
4258 case BINOP_BITWISE_IOR
:
4259 case BINOP_BITWISE_XOR
:
4260 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4263 case BINOP_NOTEQUAL
:
4268 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4271 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4274 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4278 case UNOP_LOGICAL_NOT
:
4280 return (!numeric_type_p (type0
));
4289 1. In the following, we assume that a renaming type's name may
4290 have an ___XD suffix. It would be nice if this went away at some
4292 2. We handle both the (old) purely type-based representation of
4293 renamings and the (new) variable-based encoding. At some point,
4294 it is devoutly to be hoped that the former goes away
4295 (FIXME: hilfinger-2007-07-09).
4296 3. Subprogram renamings are not implemented, although the XRS
4297 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4299 /* If SYM encodes a renaming,
4301 <renaming> renames <renamed entity>,
4303 sets *LEN to the length of the renamed entity's name,
4304 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4305 the string describing the subcomponent selected from the renamed
4306 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4307 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4308 are undefined). Otherwise, returns a value indicating the category
4309 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4310 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4311 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4312 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4313 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4314 may be NULL, in which case they are not assigned.
4316 [Currently, however, GCC does not generate subprogram renamings.] */
4318 enum ada_renaming_category
4319 ada_parse_renaming (struct symbol
*sym
,
4320 const char **renamed_entity
, int *len
,
4321 const char **renaming_expr
)
4323 enum ada_renaming_category kind
;
4328 return ADA_NOT_RENAMING
;
4329 switch (SYMBOL_CLASS (sym
))
4332 return ADA_NOT_RENAMING
;
4334 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4335 renamed_entity
, len
, renaming_expr
);
4339 case LOC_OPTIMIZED_OUT
:
4340 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4342 return ADA_NOT_RENAMING
;
4346 kind
= ADA_OBJECT_RENAMING
;
4350 kind
= ADA_EXCEPTION_RENAMING
;
4354 kind
= ADA_PACKAGE_RENAMING
;
4358 kind
= ADA_SUBPROGRAM_RENAMING
;
4362 return ADA_NOT_RENAMING
;
4366 if (renamed_entity
!= NULL
)
4367 *renamed_entity
= info
;
4368 suffix
= strstr (info
, "___XE");
4369 if (suffix
== NULL
|| suffix
== info
)
4370 return ADA_NOT_RENAMING
;
4372 *len
= strlen (info
) - strlen (suffix
);
4374 if (renaming_expr
!= NULL
)
4375 *renaming_expr
= suffix
;
4379 /* Assuming TYPE encodes a renaming according to the old encoding in
4380 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4381 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4382 ADA_NOT_RENAMING otherwise. */
4383 static enum ada_renaming_category
4384 parse_old_style_renaming (struct type
*type
,
4385 const char **renamed_entity
, int *len
,
4386 const char **renaming_expr
)
4388 enum ada_renaming_category kind
;
4393 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4394 || TYPE_NFIELDS (type
) != 1)
4395 return ADA_NOT_RENAMING
;
4397 name
= type_name_no_tag (type
);
4399 return ADA_NOT_RENAMING
;
4401 name
= strstr (name
, "___XR");
4403 return ADA_NOT_RENAMING
;
4408 kind
= ADA_OBJECT_RENAMING
;
4411 kind
= ADA_EXCEPTION_RENAMING
;
4414 kind
= ADA_PACKAGE_RENAMING
;
4417 kind
= ADA_SUBPROGRAM_RENAMING
;
4420 return ADA_NOT_RENAMING
;
4423 info
= TYPE_FIELD_NAME (type
, 0);
4425 return ADA_NOT_RENAMING
;
4426 if (renamed_entity
!= NULL
)
4427 *renamed_entity
= info
;
4428 suffix
= strstr (info
, "___XE");
4429 if (renaming_expr
!= NULL
)
4430 *renaming_expr
= suffix
+ 5;
4431 if (suffix
== NULL
|| suffix
== info
)
4432 return ADA_NOT_RENAMING
;
4434 *len
= suffix
- info
;
4438 /* Compute the value of the given RENAMING_SYM, which is expected to
4439 be a symbol encoding a renaming expression. BLOCK is the block
4440 used to evaluate the renaming. */
4442 static struct value
*
4443 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4444 const struct block
*block
)
4446 const char *sym_name
;
4448 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4449 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4450 return evaluate_expression (expr
.get ());
4454 /* Evaluation: Function Calls */
4456 /* Return an lvalue containing the value VAL. This is the identity on
4457 lvalues, and otherwise has the side-effect of allocating memory
4458 in the inferior where a copy of the value contents is copied. */
4460 static struct value
*
4461 ensure_lval (struct value
*val
)
4463 if (VALUE_LVAL (val
) == not_lval
4464 || VALUE_LVAL (val
) == lval_internalvar
)
4466 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4467 const CORE_ADDR addr
=
4468 value_as_long (value_allocate_space_in_inferior (len
));
4470 VALUE_LVAL (val
) = lval_memory
;
4471 set_value_address (val
, addr
);
4472 write_memory (addr
, value_contents (val
), len
);
4478 /* Return the value ACTUAL, converted to be an appropriate value for a
4479 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4480 allocating any necessary descriptors (fat pointers), or copies of
4481 values not residing in memory, updating it as needed. */
4484 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4486 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4487 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4488 struct type
*formal_target
=
4489 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4490 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4491 struct type
*actual_target
=
4492 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4493 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4495 if (ada_is_array_descriptor_type (formal_target
)
4496 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4497 return make_array_descriptor (formal_type
, actual
);
4498 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4499 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4501 struct value
*result
;
4503 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4504 && ada_is_array_descriptor_type (actual_target
))
4505 result
= desc_data (actual
);
4506 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4508 if (VALUE_LVAL (actual
) != lval_memory
)
4512 actual_type
= ada_check_typedef (value_type (actual
));
4513 val
= allocate_value (actual_type
);
4514 memcpy ((char *) value_contents_raw (val
),
4515 (char *) value_contents (actual
),
4516 TYPE_LENGTH (actual_type
));
4517 actual
= ensure_lval (val
);
4519 result
= value_addr (actual
);
4523 return value_cast_pointers (formal_type
, result
, 0);
4525 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4526 return ada_value_ind (actual
);
4527 else if (ada_is_aligner_type (formal_type
))
4529 /* We need to turn this parameter into an aligner type
4531 struct value
*aligner
= allocate_value (formal_type
);
4532 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4534 value_assign_to_component (aligner
, component
, actual
);
4541 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4542 type TYPE. This is usually an inefficient no-op except on some targets
4543 (such as AVR) where the representation of a pointer and an address
4547 value_pointer (struct value
*value
, struct type
*type
)
4549 struct gdbarch
*gdbarch
= get_type_arch (type
);
4550 unsigned len
= TYPE_LENGTH (type
);
4551 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4554 addr
= value_address (value
);
4555 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4556 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4561 /* Push a descriptor of type TYPE for array value ARR on the stack at
4562 *SP, updating *SP to reflect the new descriptor. Return either
4563 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4564 to-descriptor type rather than a descriptor type), a struct value *
4565 representing a pointer to this descriptor. */
4567 static struct value
*
4568 make_array_descriptor (struct type
*type
, struct value
*arr
)
4570 struct type
*bounds_type
= desc_bounds_type (type
);
4571 struct type
*desc_type
= desc_base_type (type
);
4572 struct value
*descriptor
= allocate_value (desc_type
);
4573 struct value
*bounds
= allocate_value (bounds_type
);
4576 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4579 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4580 ada_array_bound (arr
, i
, 0),
4581 desc_bound_bitpos (bounds_type
, i
, 0),
4582 desc_bound_bitsize (bounds_type
, i
, 0));
4583 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4584 ada_array_bound (arr
, i
, 1),
4585 desc_bound_bitpos (bounds_type
, i
, 1),
4586 desc_bound_bitsize (bounds_type
, i
, 1));
4589 bounds
= ensure_lval (bounds
);
4591 modify_field (value_type (descriptor
),
4592 value_contents_writeable (descriptor
),
4593 value_pointer (ensure_lval (arr
),
4594 TYPE_FIELD_TYPE (desc_type
, 0)),
4595 fat_pntr_data_bitpos (desc_type
),
4596 fat_pntr_data_bitsize (desc_type
));
4598 modify_field (value_type (descriptor
),
4599 value_contents_writeable (descriptor
),
4600 value_pointer (bounds
,
4601 TYPE_FIELD_TYPE (desc_type
, 1)),
4602 fat_pntr_bounds_bitpos (desc_type
),
4603 fat_pntr_bounds_bitsize (desc_type
));
4605 descriptor
= ensure_lval (descriptor
);
4607 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4608 return value_addr (descriptor
);
4613 /* Symbol Cache Module */
4615 /* Performance measurements made as of 2010-01-15 indicate that
4616 this cache does bring some noticeable improvements. Depending
4617 on the type of entity being printed, the cache can make it as much
4618 as an order of magnitude faster than without it.
4620 The descriptive type DWARF extension has significantly reduced
4621 the need for this cache, at least when DWARF is being used. However,
4622 even in this case, some expensive name-based symbol searches are still
4623 sometimes necessary - to find an XVZ variable, mostly. */
4625 /* Initialize the contents of SYM_CACHE. */
4628 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4630 obstack_init (&sym_cache
->cache_space
);
4631 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4634 /* Free the memory used by SYM_CACHE. */
4637 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4639 obstack_free (&sym_cache
->cache_space
, NULL
);
4643 /* Return the symbol cache associated to the given program space PSPACE.
4644 If not allocated for this PSPACE yet, allocate and initialize one. */
4646 static struct ada_symbol_cache
*
4647 ada_get_symbol_cache (struct program_space
*pspace
)
4649 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4651 if (pspace_data
->sym_cache
== NULL
)
4653 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4654 ada_init_symbol_cache (pspace_data
->sym_cache
);
4657 return pspace_data
->sym_cache
;
4660 /* Clear all entries from the symbol cache. */
4663 ada_clear_symbol_cache (void)
4665 struct ada_symbol_cache
*sym_cache
4666 = ada_get_symbol_cache (current_program_space
);
4668 obstack_free (&sym_cache
->cache_space
, NULL
);
4669 ada_init_symbol_cache (sym_cache
);
4672 /* Search our cache for an entry matching NAME and DOMAIN.
4673 Return it if found, or NULL otherwise. */
4675 static struct cache_entry
**
4676 find_entry (const char *name
, domain_enum domain
)
4678 struct ada_symbol_cache
*sym_cache
4679 = ada_get_symbol_cache (current_program_space
);
4680 int h
= msymbol_hash (name
) % HASH_SIZE
;
4681 struct cache_entry
**e
;
4683 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4685 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4691 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4692 Return 1 if found, 0 otherwise.
4694 If an entry was found and SYM is not NULL, set *SYM to the entry's
4695 SYM. Same principle for BLOCK if not NULL. */
4698 lookup_cached_symbol (const char *name
, domain_enum domain
,
4699 struct symbol
**sym
, const struct block
**block
)
4701 struct cache_entry
**e
= find_entry (name
, domain
);
4708 *block
= (*e
)->block
;
4712 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4713 in domain DOMAIN, save this result in our symbol cache. */
4716 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4717 const struct block
*block
)
4719 struct ada_symbol_cache
*sym_cache
4720 = ada_get_symbol_cache (current_program_space
);
4723 struct cache_entry
*e
;
4725 /* Symbols for builtin types don't have a block.
4726 For now don't cache such symbols. */
4727 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4730 /* If the symbol is a local symbol, then do not cache it, as a search
4731 for that symbol depends on the context. To determine whether
4732 the symbol is local or not, we check the block where we found it
4733 against the global and static blocks of its associated symtab. */
4735 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4736 GLOBAL_BLOCK
) != block
4737 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4738 STATIC_BLOCK
) != block
)
4741 h
= msymbol_hash (name
) % HASH_SIZE
;
4742 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4744 e
->next
= sym_cache
->root
[h
];
4745 sym_cache
->root
[h
] = e
;
4747 = (char *) obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4748 strcpy (copy
, name
);
4756 /* Return the symbol name match type that should be used used when
4757 searching for all symbols matching LOOKUP_NAME.
4759 LOOKUP_NAME is expected to be a symbol name after transformation
4760 for Ada lookups (see ada_name_for_lookup). */
4762 static symbol_name_match_type
4763 name_match_type_from_name (const char *lookup_name
)
4765 return (strstr (lookup_name
, "__") == NULL
4766 ? symbol_name_match_type::WILD
4767 : symbol_name_match_type::FULL
);
4770 /* Return the result of a standard (literal, C-like) lookup of NAME in
4771 given DOMAIN, visible from lexical block BLOCK. */
4773 static struct symbol
*
4774 standard_lookup (const char *name
, const struct block
*block
,
4777 /* Initialize it just to avoid a GCC false warning. */
4778 struct block_symbol sym
= {NULL
, NULL
};
4780 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4782 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4783 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4788 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4789 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4790 since they contend in overloading in the same way. */
4792 is_nonfunction (struct block_symbol syms
[], int n
)
4796 for (i
= 0; i
< n
; i
+= 1)
4797 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_FUNC
4798 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
4799 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4805 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4806 struct types. Otherwise, they may not. */
4809 equiv_types (struct type
*type0
, struct type
*type1
)
4813 if (type0
== NULL
|| type1
== NULL
4814 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4816 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4817 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4818 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4819 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4825 /* True iff SYM0 represents the same entity as SYM1, or one that is
4826 no more defined than that of SYM1. */
4829 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4833 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4834 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4837 switch (SYMBOL_CLASS (sym0
))
4843 struct type
*type0
= SYMBOL_TYPE (sym0
);
4844 struct type
*type1
= SYMBOL_TYPE (sym1
);
4845 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4846 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4847 int len0
= strlen (name0
);
4850 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4851 && (equiv_types (type0
, type1
)
4852 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4853 && startswith (name1
+ len0
, "___XV")));
4856 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4857 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4863 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4864 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4867 add_defn_to_vec (struct obstack
*obstackp
,
4869 const struct block
*block
)
4872 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4874 /* Do not try to complete stub types, as the debugger is probably
4875 already scanning all symbols matching a certain name at the
4876 time when this function is called. Trying to replace the stub
4877 type by its associated full type will cause us to restart a scan
4878 which may lead to an infinite recursion. Instead, the client
4879 collecting the matching symbols will end up collecting several
4880 matches, with at least one of them complete. It can then filter
4881 out the stub ones if needed. */
4883 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4885 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4887 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4889 prevDefns
[i
].symbol
= sym
;
4890 prevDefns
[i
].block
= block
;
4896 struct block_symbol info
;
4900 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4904 /* Number of block_symbol structures currently collected in current vector in
4908 num_defns_collected (struct obstack
*obstackp
)
4910 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4913 /* Vector of block_symbol structures currently collected in current vector in
4914 OBSTACKP. If FINISH, close off the vector and return its final address. */
4916 static struct block_symbol
*
4917 defns_collected (struct obstack
*obstackp
, int finish
)
4920 return (struct block_symbol
*) obstack_finish (obstackp
);
4922 return (struct block_symbol
*) obstack_base (obstackp
);
4925 /* Return a bound minimal symbol matching NAME according to Ada
4926 decoding rules. Returns an invalid symbol if there is no such
4927 minimal symbol. Names prefixed with "standard__" are handled
4928 specially: "standard__" is first stripped off, and only static and
4929 global symbols are searched. */
4931 struct bound_minimal_symbol
4932 ada_lookup_simple_minsym (const char *name
)
4934 struct bound_minimal_symbol result
;
4935 struct objfile
*objfile
;
4936 struct minimal_symbol
*msymbol
;
4938 memset (&result
, 0, sizeof (result
));
4940 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4941 lookup_name_info
lookup_name (name
, match_type
);
4943 symbol_name_matcher_ftype
*match_name
4944 = ada_get_symbol_name_matcher (lookup_name
);
4946 ALL_MSYMBOLS (objfile
, msymbol
)
4948 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), lookup_name
, NULL
)
4949 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4951 result
.minsym
= msymbol
;
4952 result
.objfile
= objfile
;
4960 /* For all subprograms that statically enclose the subprogram of the
4961 selected frame, add symbols matching identifier NAME in DOMAIN
4962 and their blocks to the list of data in OBSTACKP, as for
4963 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4964 with a wildcard prefix. */
4967 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4968 const lookup_name_info
&lookup_name
,
4973 /* True if TYPE is definitely an artificial type supplied to a symbol
4974 for which no debugging information was given in the symbol file. */
4977 is_nondebugging_type (struct type
*type
)
4979 const char *name
= ada_type_name (type
);
4981 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4984 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4985 that are deemed "identical" for practical purposes.
4987 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4988 types and that their number of enumerals is identical (in other
4989 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4992 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4996 /* The heuristic we use here is fairly conservative. We consider
4997 that 2 enumerate types are identical if they have the same
4998 number of enumerals and that all enumerals have the same
4999 underlying value and name. */
5001 /* All enums in the type should have an identical underlying value. */
5002 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5003 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
5006 /* All enumerals should also have the same name (modulo any numerical
5008 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
5010 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
5011 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
5012 int len_1
= strlen (name_1
);
5013 int len_2
= strlen (name_2
);
5015 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
5016 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
5018 || strncmp (TYPE_FIELD_NAME (type1
, i
),
5019 TYPE_FIELD_NAME (type2
, i
),
5027 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5028 that are deemed "identical" for practical purposes. Sometimes,
5029 enumerals are not strictly identical, but their types are so similar
5030 that they can be considered identical.
5032 For instance, consider the following code:
5034 type Color is (Black, Red, Green, Blue, White);
5035 type RGB_Color is new Color range Red .. Blue;
5037 Type RGB_Color is a subrange of an implicit type which is a copy
5038 of type Color. If we call that implicit type RGB_ColorB ("B" is
5039 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5040 As a result, when an expression references any of the enumeral
5041 by name (Eg. "print green"), the expression is technically
5042 ambiguous and the user should be asked to disambiguate. But
5043 doing so would only hinder the user, since it wouldn't matter
5044 what choice he makes, the outcome would always be the same.
5045 So, for practical purposes, we consider them as the same. */
5048 symbols_are_identical_enums (struct block_symbol
*syms
, int nsyms
)
5052 /* Before performing a thorough comparison check of each type,
5053 we perform a series of inexpensive checks. We expect that these
5054 checks will quickly fail in the vast majority of cases, and thus
5055 help prevent the unnecessary use of a more expensive comparison.
5056 Said comparison also expects us to make some of these checks
5057 (see ada_identical_enum_types_p). */
5059 /* Quick check: All symbols should have an enum type. */
5060 for (i
= 0; i
< nsyms
; i
++)
5061 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].symbol
)) != TYPE_CODE_ENUM
)
5064 /* Quick check: They should all have the same value. */
5065 for (i
= 1; i
< nsyms
; i
++)
5066 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5069 /* Quick check: They should all have the same number of enumerals. */
5070 for (i
= 1; i
< nsyms
; i
++)
5071 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].symbol
))
5072 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].symbol
)))
5075 /* All the sanity checks passed, so we might have a set of
5076 identical enumeration types. Perform a more complete
5077 comparison of the type of each symbol. */
5078 for (i
= 1; i
< nsyms
; i
++)
5079 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5080 SYMBOL_TYPE (syms
[0].symbol
)))
5086 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
5087 duplicate other symbols in the list (The only case I know of where
5088 this happens is when object files containing stabs-in-ecoff are
5089 linked with files containing ordinary ecoff debugging symbols (or no
5090 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5091 Returns the number of items in the modified list. */
5094 remove_extra_symbols (struct block_symbol
*syms
, int nsyms
)
5098 /* We should never be called with less than 2 symbols, as there
5099 cannot be any extra symbol in that case. But it's easy to
5100 handle, since we have nothing to do in that case. */
5109 /* If two symbols have the same name and one of them is a stub type,
5110 the get rid of the stub. */
5112 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].symbol
))
5113 && SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
)
5115 for (j
= 0; j
< nsyms
; j
++)
5118 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].symbol
))
5119 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5120 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5121 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0)
5126 /* Two symbols with the same name, same class and same address
5127 should be identical. */
5129 else if (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
) != NULL
5130 && SYMBOL_CLASS (syms
[i
].symbol
) == LOC_STATIC
5131 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].symbol
)))
5133 for (j
= 0; j
< nsyms
; j
+= 1)
5136 && SYMBOL_LINKAGE_NAME (syms
[j
].symbol
) != NULL
5137 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].symbol
),
5138 SYMBOL_LINKAGE_NAME (syms
[j
].symbol
)) == 0
5139 && SYMBOL_CLASS (syms
[i
].symbol
)
5140 == SYMBOL_CLASS (syms
[j
].symbol
)
5141 && SYMBOL_VALUE_ADDRESS (syms
[i
].symbol
)
5142 == SYMBOL_VALUE_ADDRESS (syms
[j
].symbol
))
5149 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5150 syms
[j
- 1] = syms
[j
];
5157 /* If all the remaining symbols are identical enumerals, then
5158 just keep the first one and discard the rest.
5160 Unlike what we did previously, we do not discard any entry
5161 unless they are ALL identical. This is because the symbol
5162 comparison is not a strict comparison, but rather a practical
5163 comparison. If all symbols are considered identical, then
5164 we can just go ahead and use the first one and discard the rest.
5165 But if we cannot reduce the list to a single element, we have
5166 to ask the user to disambiguate anyways. And if we have to
5167 present a multiple-choice menu, it's less confusing if the list
5168 isn't missing some choices that were identical and yet distinct. */
5169 if (symbols_are_identical_enums (syms
, nsyms
))
5175 /* Given a type that corresponds to a renaming entity, use the type name
5176 to extract the scope (package name or function name, fully qualified,
5177 and following the GNAT encoding convention) where this renaming has been
5178 defined. The string returned needs to be deallocated after use. */
5181 xget_renaming_scope (struct type
*renaming_type
)
5183 /* The renaming types adhere to the following convention:
5184 <scope>__<rename>___<XR extension>.
5185 So, to extract the scope, we search for the "___XR" extension,
5186 and then backtrack until we find the first "__". */
5188 const char *name
= type_name_no_tag (renaming_type
);
5189 const char *suffix
= strstr (name
, "___XR");
5194 /* Now, backtrack a bit until we find the first "__". Start looking
5195 at suffix - 3, as the <rename> part is at least one character long. */
5197 for (last
= suffix
- 3; last
> name
; last
--)
5198 if (last
[0] == '_' && last
[1] == '_')
5201 /* Make a copy of scope and return it. */
5203 scope_len
= last
- name
;
5204 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
5206 strncpy (scope
, name
, scope_len
);
5207 scope
[scope_len
] = '\0';
5212 /* Return nonzero if NAME corresponds to a package name. */
5215 is_package_name (const char *name
)
5217 /* Here, We take advantage of the fact that no symbols are generated
5218 for packages, while symbols are generated for each function.
5219 So the condition for NAME represent a package becomes equivalent
5220 to NAME not existing in our list of symbols. There is only one
5221 small complication with library-level functions (see below). */
5225 /* If it is a function that has not been defined at library level,
5226 then we should be able to look it up in the symbols. */
5227 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5230 /* Library-level function names start with "_ada_". See if function
5231 "_ada_" followed by NAME can be found. */
5233 /* Do a quick check that NAME does not contain "__", since library-level
5234 functions names cannot contain "__" in them. */
5235 if (strstr (name
, "__") != NULL
)
5238 fun_name
= xstrprintf ("_ada_%s", name
);
5240 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
5243 /* Return nonzero if SYM corresponds to a renaming entity that is
5244 not visible from FUNCTION_NAME. */
5247 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5250 struct cleanup
*old_chain
;
5252 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5255 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5256 old_chain
= make_cleanup (xfree
, scope
);
5258 /* If the rename has been defined in a package, then it is visible. */
5259 if (is_package_name (scope
))
5261 do_cleanups (old_chain
);
5265 /* Check that the rename is in the current function scope by checking
5266 that its name starts with SCOPE. */
5268 /* If the function name starts with "_ada_", it means that it is
5269 a library-level function. Strip this prefix before doing the
5270 comparison, as the encoding for the renaming does not contain
5272 if (startswith (function_name
, "_ada_"))
5276 int is_invisible
= !startswith (function_name
, scope
);
5278 do_cleanups (old_chain
);
5279 return is_invisible
;
5283 /* Remove entries from SYMS that corresponds to a renaming entity that
5284 is not visible from the function associated with CURRENT_BLOCK or
5285 that is superfluous due to the presence of more specific renaming
5286 information. Places surviving symbols in the initial entries of
5287 SYMS and returns the number of surviving symbols.
5290 First, in cases where an object renaming is implemented as a
5291 reference variable, GNAT may produce both the actual reference
5292 variable and the renaming encoding. In this case, we discard the
5295 Second, GNAT emits a type following a specified encoding for each renaming
5296 entity. Unfortunately, STABS currently does not support the definition
5297 of types that are local to a given lexical block, so all renamings types
5298 are emitted at library level. As a consequence, if an application
5299 contains two renaming entities using the same name, and a user tries to
5300 print the value of one of these entities, the result of the ada symbol
5301 lookup will also contain the wrong renaming type.
5303 This function partially covers for this limitation by attempting to
5304 remove from the SYMS list renaming symbols that should be visible
5305 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5306 method with the current information available. The implementation
5307 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5309 - When the user tries to print a rename in a function while there
5310 is another rename entity defined in a package: Normally, the
5311 rename in the function has precedence over the rename in the
5312 package, so the latter should be removed from the list. This is
5313 currently not the case.
5315 - This function will incorrectly remove valid renames if
5316 the CURRENT_BLOCK corresponds to a function which symbol name
5317 has been changed by an "Export" pragma. As a consequence,
5318 the user will be unable to print such rename entities. */
5321 remove_irrelevant_renamings (struct block_symbol
*syms
,
5322 int nsyms
, const struct block
*current_block
)
5324 struct symbol
*current_function
;
5325 const char *current_function_name
;
5327 int is_new_style_renaming
;
5329 /* If there is both a renaming foo___XR... encoded as a variable and
5330 a simple variable foo in the same block, discard the latter.
5331 First, zero out such symbols, then compress. */
5332 is_new_style_renaming
= 0;
5333 for (i
= 0; i
< nsyms
; i
+= 1)
5335 struct symbol
*sym
= syms
[i
].symbol
;
5336 const struct block
*block
= syms
[i
].block
;
5340 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5342 name
= SYMBOL_LINKAGE_NAME (sym
);
5343 suffix
= strstr (name
, "___XR");
5347 int name_len
= suffix
- name
;
5350 is_new_style_renaming
= 1;
5351 for (j
= 0; j
< nsyms
; j
+= 1)
5352 if (i
!= j
&& syms
[j
].symbol
!= NULL
5353 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].symbol
),
5355 && block
== syms
[j
].block
)
5356 syms
[j
].symbol
= NULL
;
5359 if (is_new_style_renaming
)
5363 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5364 if (syms
[j
].symbol
!= NULL
)
5372 /* Extract the function name associated to CURRENT_BLOCK.
5373 Abort if unable to do so. */
5375 if (current_block
== NULL
)
5378 current_function
= block_linkage_function (current_block
);
5379 if (current_function
== NULL
)
5382 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5383 if (current_function_name
== NULL
)
5386 /* Check each of the symbols, and remove it from the list if it is
5387 a type corresponding to a renaming that is out of the scope of
5388 the current block. */
5393 if (ada_parse_renaming (syms
[i
].symbol
, NULL
, NULL
, NULL
)
5394 == ADA_OBJECT_RENAMING
5395 && old_renaming_is_invisible (syms
[i
].symbol
, current_function_name
))
5399 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5400 syms
[j
- 1] = syms
[j
];
5410 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5411 whose name and domain match NAME and DOMAIN respectively.
5412 If no match was found, then extend the search to "enclosing"
5413 routines (in other words, if we're inside a nested function,
5414 search the symbols defined inside the enclosing functions).
5415 If WILD_MATCH_P is nonzero, perform the naming matching in
5416 "wild" mode (see function "wild_match" for more info).
5418 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5421 ada_add_local_symbols (struct obstack
*obstackp
,
5422 const lookup_name_info
&lookup_name
,
5423 const struct block
*block
, domain_enum domain
)
5425 int block_depth
= 0;
5427 while (block
!= NULL
)
5430 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5432 /* If we found a non-function match, assume that's the one. */
5433 if (is_nonfunction (defns_collected (obstackp
, 0),
5434 num_defns_collected (obstackp
)))
5437 block
= BLOCK_SUPERBLOCK (block
);
5440 /* If no luck so far, try to find NAME as a local symbol in some lexically
5441 enclosing subprogram. */
5442 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5443 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5446 /* An object of this type is used as the user_data argument when
5447 calling the map_matching_symbols method. */
5451 struct objfile
*objfile
;
5452 struct obstack
*obstackp
;
5453 struct symbol
*arg_sym
;
5457 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5458 to a list of symbols. DATA0 is a pointer to a struct match_data *
5459 containing the obstack that collects the symbol list, the file that SYM
5460 must come from, a flag indicating whether a non-argument symbol has
5461 been found in the current block, and the last argument symbol
5462 passed in SYM within the current block (if any). When SYM is null,
5463 marking the end of a block, the argument symbol is added if no
5464 other has been found. */
5467 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5469 struct match_data
*data
= (struct match_data
*) data0
;
5473 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5474 add_defn_to_vec (data
->obstackp
,
5475 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5477 data
->found_sym
= 0;
5478 data
->arg_sym
= NULL
;
5482 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5484 else if (SYMBOL_IS_ARGUMENT (sym
))
5485 data
->arg_sym
= sym
;
5488 data
->found_sym
= 1;
5489 add_defn_to_vec (data
->obstackp
,
5490 fixup_symbol_section (sym
, data
->objfile
),
5497 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5498 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5499 symbols to OBSTACKP. Return whether we found such symbols. */
5502 ada_add_block_renamings (struct obstack
*obstackp
,
5503 const struct block
*block
,
5504 const lookup_name_info
&lookup_name
,
5507 struct using_direct
*renaming
;
5508 int defns_mark
= num_defns_collected (obstackp
);
5510 symbol_name_matcher_ftype
*name_match
5511 = ada_get_symbol_name_matcher (lookup_name
);
5513 for (renaming
= block_using (block
);
5515 renaming
= renaming
->next
)
5519 /* Avoid infinite recursions: skip this renaming if we are actually
5520 already traversing it.
5522 Currently, symbol lookup in Ada don't use the namespace machinery from
5523 C++/Fortran support: skip namespace imports that use them. */
5524 if (renaming
->searched
5525 || (renaming
->import_src
!= NULL
5526 && renaming
->import_src
[0] != '\0')
5527 || (renaming
->import_dest
!= NULL
5528 && renaming
->import_dest
[0] != '\0'))
5530 renaming
->searched
= 1;
5532 /* TODO: here, we perform another name-based symbol lookup, which can
5533 pull its own multiple overloads. In theory, we should be able to do
5534 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5535 not a simple name. But in order to do this, we would need to enhance
5536 the DWARF reader to associate a symbol to this renaming, instead of a
5537 name. So, for now, we do something simpler: re-use the C++/Fortran
5538 namespace machinery. */
5539 r_name
= (renaming
->alias
!= NULL
5541 : renaming
->declaration
);
5542 if (name_match (r_name
, lookup_name
, NULL
))
5544 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5545 lookup_name
.match_type ());
5546 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5549 renaming
->searched
= 0;
5551 return num_defns_collected (obstackp
) != defns_mark
;
5554 /* Implements compare_names, but only applying the comparision using
5555 the given CASING. */
5558 compare_names_with_case (const char *string1
, const char *string2
,
5559 enum case_sensitivity casing
)
5561 while (*string1
!= '\0' && *string2
!= '\0')
5565 if (isspace (*string1
) || isspace (*string2
))
5566 return strcmp_iw_ordered (string1
, string2
);
5568 if (casing
== case_sensitive_off
)
5570 c1
= tolower (*string1
);
5571 c2
= tolower (*string2
);
5588 return strcmp_iw_ordered (string1
, string2
);
5590 if (*string2
== '\0')
5592 if (is_name_suffix (string1
))
5599 if (*string2
== '(')
5600 return strcmp_iw_ordered (string1
, string2
);
5603 if (casing
== case_sensitive_off
)
5604 return tolower (*string1
) - tolower (*string2
);
5606 return *string1
- *string2
;
5611 /* Compare STRING1 to STRING2, with results as for strcmp.
5612 Compatible with strcmp_iw_ordered in that...
5614 strcmp_iw_ordered (STRING1, STRING2) <= 0
5618 compare_names (STRING1, STRING2) <= 0
5620 (they may differ as to what symbols compare equal). */
5623 compare_names (const char *string1
, const char *string2
)
5627 /* Similar to what strcmp_iw_ordered does, we need to perform
5628 a case-insensitive comparison first, and only resort to
5629 a second, case-sensitive, comparison if the first one was
5630 not sufficient to differentiate the two strings. */
5632 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5634 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5639 /* Convenience function to get at the Ada encoded lookup name for
5640 LOOKUP_NAME, as a C string. */
5643 ada_lookup_name (const lookup_name_info
&lookup_name
)
5645 return lookup_name
.ada ().lookup_name ().c_str ();
5648 /* Add to OBSTACKP all non-local symbols whose name and domain match
5649 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5650 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5651 symbols otherwise. */
5654 add_nonlocal_symbols (struct obstack
*obstackp
,
5655 const lookup_name_info
&lookup_name
,
5656 domain_enum domain
, int global
)
5658 struct objfile
*objfile
;
5659 struct compunit_symtab
*cu
;
5660 struct match_data data
;
5662 memset (&data
, 0, sizeof data
);
5663 data
.obstackp
= obstackp
;
5665 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5667 ALL_OBJFILES (objfile
)
5669 data
.objfile
= objfile
;
5672 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
.name ().c_str (),
5674 aux_add_nonlocal_symbols
, &data
,
5675 symbol_name_match_type::WILD
,
5678 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
.name ().c_str (),
5680 aux_add_nonlocal_symbols
, &data
,
5681 symbol_name_match_type::FULL
,
5684 ALL_OBJFILE_COMPUNITS (objfile
, cu
)
5686 const struct block
*global_block
5687 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5689 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5695 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5697 const char *name
= ada_lookup_name (lookup_name
);
5698 std::string name1
= std::string ("<_ada_") + name
+ '>';
5700 ALL_OBJFILES (objfile
)
5702 data
.objfile
= objfile
;
5703 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
.c_str (),
5705 aux_add_nonlocal_symbols
,
5707 symbol_name_match_type::FULL
,
5713 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5714 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5715 returning the number of matches. Add these to OBSTACKP.
5717 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5718 symbol match within the nest of blocks whose innermost member is BLOCK,
5719 is the one match returned (no other matches in that or
5720 enclosing blocks is returned). If there are any matches in or
5721 surrounding BLOCK, then these alone are returned.
5723 Names prefixed with "standard__" are handled specially:
5724 "standard__" is first stripped off (by the lookup_name
5725 constructor), and only static and global symbols are searched.
5727 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5728 to lookup global symbols. */
5731 ada_add_all_symbols (struct obstack
*obstackp
,
5732 const struct block
*block
,
5733 const lookup_name_info
&lookup_name
,
5736 int *made_global_lookup_p
)
5740 if (made_global_lookup_p
)
5741 *made_global_lookup_p
= 0;
5743 /* Special case: If the user specifies a symbol name inside package
5744 Standard, do a non-wild matching of the symbol name without
5745 the "standard__" prefix. This was primarily introduced in order
5746 to allow the user to specifically access the standard exceptions
5747 using, for instance, Standard.Constraint_Error when Constraint_Error
5748 is ambiguous (due to the user defining its own Constraint_Error
5749 entity inside its program). */
5750 if (lookup_name
.ada ().standard_p ())
5753 /* Check the non-global symbols. If we have ANY match, then we're done. */
5758 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5761 /* In the !full_search case we're are being called by
5762 ada_iterate_over_symbols, and we don't want to search
5764 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5766 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5770 /* No non-global symbols found. Check our cache to see if we have
5771 already performed this search before. If we have, then return
5774 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5775 domain
, &sym
, &block
))
5778 add_defn_to_vec (obstackp
, sym
, block
);
5782 if (made_global_lookup_p
)
5783 *made_global_lookup_p
= 1;
5785 /* Search symbols from all global blocks. */
5787 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5789 /* Now add symbols from all per-file blocks if we've gotten no hits
5790 (not strictly correct, but perhaps better than an error). */
5792 if (num_defns_collected (obstackp
) == 0)
5793 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5796 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5797 is non-zero, enclosing scope and in global scopes, returning the number of
5799 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5800 indicating the symbols found and the blocks and symbol tables (if
5801 any) in which they were found. This vector is transient---good only to
5802 the next call of ada_lookup_symbol_list.
5804 When full_search is non-zero, any non-function/non-enumeral
5805 symbol match within the nest of blocks whose innermost member is BLOCK,
5806 is the one match returned (no other matches in that or
5807 enclosing blocks is returned). If there are any matches in or
5808 surrounding BLOCK, then these alone are returned.
5810 Names prefixed with "standard__" are handled specially: "standard__"
5811 is first stripped off, and only static and global symbols are searched. */
5814 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5815 const struct block
*block
,
5817 struct block_symbol
**results
,
5820 int syms_from_global_search
;
5823 obstack_free (&symbol_list_obstack
, NULL
);
5824 obstack_init (&symbol_list_obstack
);
5825 ada_add_all_symbols (&symbol_list_obstack
, block
, lookup_name
,
5826 domain
, full_search
, &syms_from_global_search
);
5828 ndefns
= num_defns_collected (&symbol_list_obstack
);
5829 *results
= defns_collected (&symbol_list_obstack
, 1);
5831 ndefns
= remove_extra_symbols (*results
, ndefns
);
5833 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5834 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5836 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5837 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5838 (*results
)[0].symbol
, (*results
)[0].block
);
5840 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block
);
5844 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5845 in global scopes, returning the number of matches, and setting *RESULTS
5846 to a vector of (SYM,BLOCK) tuples.
5847 See ada_lookup_symbol_list_worker for further details. */
5850 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5851 domain_enum domain
, struct block_symbol
**results
)
5853 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5854 lookup_name_info
lookup_name (name
, name_match_type
);
5856 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5859 /* Implementation of the la_iterate_over_symbols method. */
5862 ada_iterate_over_symbols
5863 (const struct block
*block
, const lookup_name_info
&name
,
5865 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5868 struct block_symbol
*results
;
5870 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5871 for (i
= 0; i
< ndefs
; ++i
)
5873 if (!callback (results
[i
].symbol
))
5878 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5879 to 1, but choosing the first symbol found if there are multiple
5882 The result is stored in *INFO, which must be non-NULL.
5883 If no match is found, INFO->SYM is set to NULL. */
5886 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5888 struct block_symbol
*info
)
5890 struct block_symbol
*candidates
;
5893 /* Since we already have an encoded name, wrap it in '<>' to force a
5894 verbatim match. Otherwise, if the name happens to not look like
5895 an encoded name (because it doesn't include a "__"),
5896 ada_lookup_name_info would re-encode/fold it again, and that
5897 would e.g., incorrectly lowercase object renaming names like
5898 "R28b" -> "r28b". */
5899 std::string verbatim
= std::string ("<") + name
+ '>';
5901 gdb_assert (info
!= NULL
);
5902 memset (info
, 0, sizeof (struct block_symbol
));
5904 n_candidates
= ada_lookup_symbol_list (verbatim
.c_str (), block
,
5905 domain
, &candidates
);
5906 if (n_candidates
== 0)
5909 *info
= candidates
[0];
5910 info
->symbol
= fixup_symbol_section (info
->symbol
, NULL
);
5913 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5914 scope and in global scopes, or NULL if none. NAME is folded and
5915 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5916 choosing the first symbol if there are multiple choices.
5917 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5920 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5921 domain_enum domain
, int *is_a_field_of_this
)
5923 struct block_symbol info
;
5925 if (is_a_field_of_this
!= NULL
)
5926 *is_a_field_of_this
= 0;
5928 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5929 block0
, domain
, &info
);
5933 static struct block_symbol
5934 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5936 const struct block
*block
,
5937 const domain_enum domain
)
5939 struct block_symbol sym
;
5941 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5942 if (sym
.symbol
!= NULL
)
5945 /* If we haven't found a match at this point, try the primitive
5946 types. In other languages, this search is performed before
5947 searching for global symbols in order to short-circuit that
5948 global-symbol search if it happens that the name corresponds
5949 to a primitive type. But we cannot do the same in Ada, because
5950 it is perfectly legitimate for a program to declare a type which
5951 has the same name as a standard type. If looking up a type in
5952 that situation, we have traditionally ignored the primitive type
5953 in favor of user-defined types. This is why, unlike most other
5954 languages, we search the primitive types this late and only after
5955 having searched the global symbols without success. */
5957 if (domain
== VAR_DOMAIN
)
5959 struct gdbarch
*gdbarch
;
5962 gdbarch
= target_gdbarch ();
5964 gdbarch
= block_gdbarch (block
);
5965 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5966 if (sym
.symbol
!= NULL
)
5970 return (struct block_symbol
) {NULL
, NULL
};
5974 /* True iff STR is a possible encoded suffix of a normal Ada name
5975 that is to be ignored for matching purposes. Suffixes of parallel
5976 names (e.g., XVE) are not included here. Currently, the possible suffixes
5977 are given by any of the regular expressions:
5979 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5980 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5981 TKB [subprogram suffix for task bodies]
5982 _E[0-9]+[bs]$ [protected object entry suffixes]
5983 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5985 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5986 match is performed. This sequence is used to differentiate homonyms,
5987 is an optional part of a valid name suffix. */
5990 is_name_suffix (const char *str
)
5993 const char *matching
;
5994 const int len
= strlen (str
);
5996 /* Skip optional leading __[0-9]+. */
5998 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
6001 while (isdigit (str
[0]))
6007 if (str
[0] == '.' || str
[0] == '$')
6010 while (isdigit (matching
[0]))
6012 if (matching
[0] == '\0')
6018 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
6021 while (isdigit (matching
[0]))
6023 if (matching
[0] == '\0')
6027 /* "TKB" suffixes are used for subprograms implementing task bodies. */
6029 if (strcmp (str
, "TKB") == 0)
6033 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
6034 with a N at the end. Unfortunately, the compiler uses the same
6035 convention for other internal types it creates. So treating
6036 all entity names that end with an "N" as a name suffix causes
6037 some regressions. For instance, consider the case of an enumerated
6038 type. To support the 'Image attribute, it creates an array whose
6040 Having a single character like this as a suffix carrying some
6041 information is a bit risky. Perhaps we should change the encoding
6042 to be something like "_N" instead. In the meantime, do not do
6043 the following check. */
6044 /* Protected Object Subprograms */
6045 if (len
== 1 && str
[0] == 'N')
6050 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
6053 while (isdigit (matching
[0]))
6055 if ((matching
[0] == 'b' || matching
[0] == 's')
6056 && matching
[1] == '\0')
6060 /* ??? We should not modify STR directly, as we are doing below. This
6061 is fine in this case, but may become problematic later if we find
6062 that this alternative did not work, and want to try matching
6063 another one from the begining of STR. Since we modified it, we
6064 won't be able to find the begining of the string anymore! */
6068 while (str
[0] != '_' && str
[0] != '\0')
6070 if (str
[0] != 'n' && str
[0] != 'b')
6076 if (str
[0] == '\000')
6081 if (str
[1] != '_' || str
[2] == '\000')
6085 if (strcmp (str
+ 3, "JM") == 0)
6087 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6088 the LJM suffix in favor of the JM one. But we will
6089 still accept LJM as a valid suffix for a reasonable
6090 amount of time, just to allow ourselves to debug programs
6091 compiled using an older version of GNAT. */
6092 if (strcmp (str
+ 3, "LJM") == 0)
6096 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6097 || str
[4] == 'U' || str
[4] == 'P')
6099 if (str
[4] == 'R' && str
[5] != 'T')
6103 if (!isdigit (str
[2]))
6105 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6106 if (!isdigit (str
[k
]) && str
[k
] != '_')
6110 if (str
[0] == '$' && isdigit (str
[1]))
6112 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6113 if (!isdigit (str
[k
]) && str
[k
] != '_')
6120 /* Return non-zero if the string starting at NAME and ending before
6121 NAME_END contains no capital letters. */
6124 is_valid_name_for_wild_match (const char *name0
)
6126 const char *decoded_name
= ada_decode (name0
);
6129 /* If the decoded name starts with an angle bracket, it means that
6130 NAME0 does not follow the GNAT encoding format. It should then
6131 not be allowed as a possible wild match. */
6132 if (decoded_name
[0] == '<')
6135 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6136 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6142 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6143 that could start a simple name. Assumes that *NAMEP points into
6144 the string beginning at NAME0. */
6147 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6149 const char *name
= *namep
;
6159 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6162 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6167 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6168 || name
[2] == target0
))
6176 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6186 /* Return true iff NAME encodes a name of the form prefix.PATN.
6187 Ignores any informational suffixes of NAME (i.e., for which
6188 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6192 wild_match (const char *name
, const char *patn
)
6195 const char *name0
= name
;
6199 const char *match
= name
;
6203 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6206 if (*p
== '\0' && is_name_suffix (name
))
6207 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6209 if (name
[-1] == '_')
6212 if (!advance_wild_match (&name
, name0
, *patn
))
6217 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6218 any trailing suffixes that encode debugging information or leading
6219 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6220 information that is ignored). */
6223 full_match (const char *sym_name
, const char *search_name
)
6225 size_t search_name_len
= strlen (search_name
);
6227 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6228 && is_name_suffix (sym_name
+ search_name_len
))
6231 if (startswith (sym_name
, "_ada_")
6232 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6233 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6239 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6240 *defn_symbols, updating the list of symbols in OBSTACKP (if
6241 necessary). OBJFILE is the section containing BLOCK. */
6244 ada_add_block_symbols (struct obstack
*obstackp
,
6245 const struct block
*block
,
6246 const lookup_name_info
&lookup_name
,
6247 domain_enum domain
, struct objfile
*objfile
)
6249 struct block_iterator iter
;
6250 /* A matching argument symbol, if any. */
6251 struct symbol
*arg_sym
;
6252 /* Set true when we find a matching non-argument symbol. */
6258 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6260 sym
= block_iter_match_next (lookup_name
, &iter
))
6262 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6263 SYMBOL_DOMAIN (sym
), domain
))
6265 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6267 if (SYMBOL_IS_ARGUMENT (sym
))
6272 add_defn_to_vec (obstackp
,
6273 fixup_symbol_section (sym
, objfile
),
6280 /* Handle renamings. */
6282 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6285 if (!found_sym
&& arg_sym
!= NULL
)
6287 add_defn_to_vec (obstackp
,
6288 fixup_symbol_section (arg_sym
, objfile
),
6292 if (!lookup_name
.ada ().wild_match_p ())
6296 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6297 const char *name
= ada_lookup_name
.c_str ();
6298 size_t name_len
= ada_lookup_name
.size ();
6300 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6302 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
6303 SYMBOL_DOMAIN (sym
), domain
))
6307 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
6310 cmp
= !startswith (SYMBOL_LINKAGE_NAME (sym
), "_ada_");
6312 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
6317 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
6319 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6321 if (SYMBOL_IS_ARGUMENT (sym
))
6326 add_defn_to_vec (obstackp
,
6327 fixup_symbol_section (sym
, objfile
),
6335 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6336 They aren't parameters, right? */
6337 if (!found_sym
&& arg_sym
!= NULL
)
6339 add_defn_to_vec (obstackp
,
6340 fixup_symbol_section (arg_sym
, objfile
),
6347 /* Symbol Completion */
6352 ada_lookup_name_info::matches
6353 (const char *sym_name
,
6354 symbol_name_match_type match_type
,
6355 completion_match
*comp_match
) const
6358 const char *text
= m_encoded_name
.c_str ();
6359 size_t text_len
= m_encoded_name
.size ();
6361 /* First, test against the fully qualified name of the symbol. */
6363 if (strncmp (sym_name
, text
, text_len
) == 0)
6366 if (match
&& !m_encoded_p
)
6368 /* One needed check before declaring a positive match is to verify
6369 that iff we are doing a verbatim match, the decoded version
6370 of the symbol name starts with '<'. Otherwise, this symbol name
6371 is not a suitable completion. */
6372 const char *sym_name_copy
= sym_name
;
6373 bool has_angle_bracket
;
6375 sym_name
= ada_decode (sym_name
);
6376 has_angle_bracket
= (sym_name
[0] == '<');
6377 match
= (has_angle_bracket
== m_verbatim_p
);
6378 sym_name
= sym_name_copy
;
6381 if (match
&& !m_verbatim_p
)
6383 /* When doing non-verbatim match, another check that needs to
6384 be done is to verify that the potentially matching symbol name
6385 does not include capital letters, because the ada-mode would
6386 not be able to understand these symbol names without the
6387 angle bracket notation. */
6390 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6395 /* Second: Try wild matching... */
6397 if (!match
&& m_wild_match_p
)
6399 /* Since we are doing wild matching, this means that TEXT
6400 may represent an unqualified symbol name. We therefore must
6401 also compare TEXT against the unqualified name of the symbol. */
6402 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6404 if (strncmp (sym_name
, text
, text_len
) == 0)
6408 /* Finally: If we found a match, prepare the result to return. */
6413 if (comp_match
!= NULL
)
6415 std::string
&match_str
= comp_match
->storage ();
6419 match_str
= ada_decode (sym_name
);
6420 comp_match
->set_match (match_str
.c_str ());
6425 match_str
= add_angle_brackets (sym_name
);
6427 match_str
= sym_name
;
6429 comp_match
->set_match (match_str
.c_str ());
6436 /* Add the list of possible symbol names completing TEXT to TRACKER.
6437 WORD is the entire command on which completion is made. */
6440 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6441 complete_symbol_mode mode
,
6442 symbol_name_match_type name_match_type
,
6443 const char *text
, const char *word
,
6444 enum type_code code
)
6447 struct compunit_symtab
*s
;
6448 struct minimal_symbol
*msymbol
;
6449 struct objfile
*objfile
;
6450 const struct block
*b
, *surrounding_static_block
= 0;
6452 struct block_iterator iter
;
6453 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6455 gdb_assert (code
== TYPE_CODE_UNDEF
);
6457 lookup_name_info
lookup_name (text
, name_match_type
, true);
6459 /* First, look at the partial symtab symbols. */
6460 expand_symtabs_matching (NULL
,
6466 /* At this point scan through the misc symbol vectors and add each
6467 symbol you find to the list. Eventually we want to ignore
6468 anything that isn't a text symbol (everything else will be
6469 handled by the psymtab code above). */
6471 ALL_MSYMBOLS (objfile
, msymbol
)
6475 completion_list_add_name (tracker
,
6476 MSYMBOL_LANGUAGE (msymbol
),
6477 MSYMBOL_LINKAGE_NAME (msymbol
),
6478 lookup_name
, text
, word
);
6481 /* Search upwards from currently selected frame (so that we can
6482 complete on local vars. */
6484 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6486 if (!BLOCK_SUPERBLOCK (b
))
6487 surrounding_static_block
= b
; /* For elmin of dups */
6489 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6491 completion_list_add_name (tracker
,
6492 SYMBOL_LANGUAGE (sym
),
6493 SYMBOL_LINKAGE_NAME (sym
),
6494 lookup_name
, text
, word
);
6498 /* Go through the symtabs and check the externs and statics for
6499 symbols which match. */
6501 ALL_COMPUNITS (objfile
, s
)
6504 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6505 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6507 completion_list_add_name (tracker
,
6508 SYMBOL_LANGUAGE (sym
),
6509 SYMBOL_LINKAGE_NAME (sym
),
6510 lookup_name
, text
, word
);
6514 ALL_COMPUNITS (objfile
, s
)
6517 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6518 /* Don't do this block twice. */
6519 if (b
== surrounding_static_block
)
6521 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6523 completion_list_add_name (tracker
,
6524 SYMBOL_LANGUAGE (sym
),
6525 SYMBOL_LINKAGE_NAME (sym
),
6526 lookup_name
, text
, word
);
6530 do_cleanups (old_chain
);
6535 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6536 for tagged types. */
6539 ada_is_dispatch_table_ptr_type (struct type
*type
)
6543 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6546 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6550 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6553 /* Return non-zero if TYPE is an interface tag. */
6556 ada_is_interface_tag (struct type
*type
)
6558 const char *name
= TYPE_NAME (type
);
6563 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6566 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6567 to be invisible to users. */
6570 ada_is_ignored_field (struct type
*type
, int field_num
)
6572 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6575 /* Check the name of that field. */
6577 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6579 /* Anonymous field names should not be printed.
6580 brobecker/2007-02-20: I don't think this can actually happen
6581 but we don't want to print the value of annonymous fields anyway. */
6585 /* Normally, fields whose name start with an underscore ("_")
6586 are fields that have been internally generated by the compiler,
6587 and thus should not be printed. The "_parent" field is special,
6588 however: This is a field internally generated by the compiler
6589 for tagged types, and it contains the components inherited from
6590 the parent type. This field should not be printed as is, but
6591 should not be ignored either. */
6592 if (name
[0] == '_' && !startswith (name
, "_parent"))
6596 /* If this is the dispatch table of a tagged type or an interface tag,
6598 if (ada_is_tagged_type (type
, 1)
6599 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6600 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6603 /* Not a special field, so it should not be ignored. */
6607 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6608 pointer or reference type whose ultimate target has a tag field. */
6611 ada_is_tagged_type (struct type
*type
, int refok
)
6613 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6616 /* True iff TYPE represents the type of X'Tag */
6619 ada_is_tag_type (struct type
*type
)
6621 type
= ada_check_typedef (type
);
6623 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6627 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6629 return (name
!= NULL
6630 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6634 /* The type of the tag on VAL. */
6637 ada_tag_type (struct value
*val
)
6639 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6642 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6643 retired at Ada 05). */
6646 is_ada95_tag (struct value
*tag
)
6648 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6651 /* The value of the tag on VAL. */
6654 ada_value_tag (struct value
*val
)
6656 return ada_value_struct_elt (val
, "_tag", 0);
6659 /* The value of the tag on the object of type TYPE whose contents are
6660 saved at VALADDR, if it is non-null, or is at memory address
6663 static struct value
*
6664 value_tag_from_contents_and_address (struct type
*type
,
6665 const gdb_byte
*valaddr
,
6668 int tag_byte_offset
;
6669 struct type
*tag_type
;
6671 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6674 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6676 : valaddr
+ tag_byte_offset
);
6677 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6679 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6684 static struct type
*
6685 type_from_tag (struct value
*tag
)
6687 const char *type_name
= ada_tag_name (tag
);
6689 if (type_name
!= NULL
)
6690 return ada_find_any_type (ada_encode (type_name
));
6694 /* Given a value OBJ of a tagged type, return a value of this
6695 type at the base address of the object. The base address, as
6696 defined in Ada.Tags, it is the address of the primary tag of
6697 the object, and therefore where the field values of its full
6698 view can be fetched. */
6701 ada_tag_value_at_base_address (struct value
*obj
)
6704 LONGEST offset_to_top
= 0;
6705 struct type
*ptr_type
, *obj_type
;
6707 CORE_ADDR base_address
;
6709 obj_type
= value_type (obj
);
6711 /* It is the responsability of the caller to deref pointers. */
6713 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6714 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6717 tag
= ada_value_tag (obj
);
6721 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6723 if (is_ada95_tag (tag
))
6726 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6727 ptr_type
= lookup_pointer_type (ptr_type
);
6728 val
= value_cast (ptr_type
, tag
);
6732 /* It is perfectly possible that an exception be raised while
6733 trying to determine the base address, just like for the tag;
6734 see ada_tag_name for more details. We do not print the error
6735 message for the same reason. */
6739 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6742 CATCH (e
, RETURN_MASK_ERROR
)
6748 /* If offset is null, nothing to do. */
6750 if (offset_to_top
== 0)
6753 /* -1 is a special case in Ada.Tags; however, what should be done
6754 is not quite clear from the documentation. So do nothing for
6757 if (offset_to_top
== -1)
6760 base_address
= value_address (obj
) - offset_to_top
;
6761 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6763 /* Make sure that we have a proper tag at the new address.
6764 Otherwise, offset_to_top is bogus (which can happen when
6765 the object is not initialized yet). */
6770 obj_type
= type_from_tag (tag
);
6775 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6778 /* Return the "ada__tags__type_specific_data" type. */
6780 static struct type
*
6781 ada_get_tsd_type (struct inferior
*inf
)
6783 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6785 if (data
->tsd_type
== 0)
6786 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6787 return data
->tsd_type
;
6790 /* Return the TSD (type-specific data) associated to the given TAG.
6791 TAG is assumed to be the tag of a tagged-type entity.
6793 May return NULL if we are unable to get the TSD. */
6795 static struct value
*
6796 ada_get_tsd_from_tag (struct value
*tag
)
6801 /* First option: The TSD is simply stored as a field of our TAG.
6802 Only older versions of GNAT would use this format, but we have
6803 to test it first, because there are no visible markers for
6804 the current approach except the absence of that field. */
6806 val
= ada_value_struct_elt (tag
, "tsd", 1);
6810 /* Try the second representation for the dispatch table (in which
6811 there is no explicit 'tsd' field in the referent of the tag pointer,
6812 and instead the tsd pointer is stored just before the dispatch
6815 type
= ada_get_tsd_type (current_inferior());
6818 type
= lookup_pointer_type (lookup_pointer_type (type
));
6819 val
= value_cast (type
, tag
);
6822 return value_ind (value_ptradd (val
, -1));
6825 /* Given the TSD of a tag (type-specific data), return a string
6826 containing the name of the associated type.
6828 The returned value is good until the next call. May return NULL
6829 if we are unable to determine the tag name. */
6832 ada_tag_name_from_tsd (struct value
*tsd
)
6834 static char name
[1024];
6838 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6841 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6842 for (p
= name
; *p
!= '\0'; p
+= 1)
6848 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6851 Return NULL if the TAG is not an Ada tag, or if we were unable to
6852 determine the name of that tag. The result is good until the next
6856 ada_tag_name (struct value
*tag
)
6860 if (!ada_is_tag_type (value_type (tag
)))
6863 /* It is perfectly possible that an exception be raised while trying
6864 to determine the TAG's name, even under normal circumstances:
6865 The associated variable may be uninitialized or corrupted, for
6866 instance. We do not let any exception propagate past this point.
6867 instead we return NULL.
6869 We also do not print the error message either (which often is very
6870 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6871 the caller print a more meaningful message if necessary. */
6874 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6877 name
= ada_tag_name_from_tsd (tsd
);
6879 CATCH (e
, RETURN_MASK_ERROR
)
6887 /* The parent type of TYPE, or NULL if none. */
6890 ada_parent_type (struct type
*type
)
6894 type
= ada_check_typedef (type
);
6896 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6899 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6900 if (ada_is_parent_field (type
, i
))
6902 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6904 /* If the _parent field is a pointer, then dereference it. */
6905 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6906 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6907 /* If there is a parallel XVS type, get the actual base type. */
6908 parent_type
= ada_get_base_type (parent_type
);
6910 return ada_check_typedef (parent_type
);
6916 /* True iff field number FIELD_NUM of structure type TYPE contains the
6917 parent-type (inherited) fields of a derived type. Assumes TYPE is
6918 a structure type with at least FIELD_NUM+1 fields. */
6921 ada_is_parent_field (struct type
*type
, int field_num
)
6923 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6925 return (name
!= NULL
6926 && (startswith (name
, "PARENT")
6927 || startswith (name
, "_parent")));
6930 /* True iff field number FIELD_NUM of structure type TYPE is a
6931 transparent wrapper field (which should be silently traversed when doing
6932 field selection and flattened when printing). Assumes TYPE is a
6933 structure type with at least FIELD_NUM+1 fields. Such fields are always
6937 ada_is_wrapper_field (struct type
*type
, int field_num
)
6939 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6941 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6943 /* This happens in functions with "out" or "in out" parameters
6944 which are passed by copy. For such functions, GNAT describes
6945 the function's return type as being a struct where the return
6946 value is in a field called RETVAL, and where the other "out"
6947 or "in out" parameters are fields of that struct. This is not
6952 return (name
!= NULL
6953 && (startswith (name
, "PARENT")
6954 || strcmp (name
, "REP") == 0
6955 || startswith (name
, "_parent")
6956 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6959 /* True iff field number FIELD_NUM of structure or union type TYPE
6960 is a variant wrapper. Assumes TYPE is a structure type with at least
6961 FIELD_NUM+1 fields. */
6964 ada_is_variant_part (struct type
*type
, int field_num
)
6966 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6968 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6969 || (is_dynamic_field (type
, field_num
)
6970 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6971 == TYPE_CODE_UNION
)));
6974 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6975 whose discriminants are contained in the record type OUTER_TYPE,
6976 returns the type of the controlling discriminant for the variant.
6977 May return NULL if the type could not be found. */
6980 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6982 const char *name
= ada_variant_discrim_name (var_type
);
6984 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6987 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6988 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6989 represents a 'when others' clause; otherwise 0. */
6992 ada_is_others_clause (struct type
*type
, int field_num
)
6994 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6996 return (name
!= NULL
&& name
[0] == 'O');
6999 /* Assuming that TYPE0 is the type of the variant part of a record,
7000 returns the name of the discriminant controlling the variant.
7001 The value is valid until the next call to ada_variant_discrim_name. */
7004 ada_variant_discrim_name (struct type
*type0
)
7006 static char *result
= NULL
;
7007 static size_t result_len
= 0;
7010 const char *discrim_end
;
7011 const char *discrim_start
;
7013 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
7014 type
= TYPE_TARGET_TYPE (type0
);
7018 name
= ada_type_name (type
);
7020 if (name
== NULL
|| name
[0] == '\000')
7023 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7026 if (startswith (discrim_end
, "___XVN"))
7029 if (discrim_end
== name
)
7032 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7035 if (discrim_start
== name
+ 1)
7037 if ((discrim_start
> name
+ 3
7038 && startswith (discrim_start
- 3, "___"))
7039 || discrim_start
[-1] == '.')
7043 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7044 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7045 result
[discrim_end
- discrim_start
] = '\0';
7049 /* Scan STR for a subtype-encoded number, beginning at position K.
7050 Put the position of the character just past the number scanned in
7051 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7052 Return 1 if there was a valid number at the given position, and 0
7053 otherwise. A "subtype-encoded" number consists of the absolute value
7054 in decimal, followed by the letter 'm' to indicate a negative number.
7055 Assumes 0m does not occur. */
7058 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7062 if (!isdigit (str
[k
]))
7065 /* Do it the hard way so as not to make any assumption about
7066 the relationship of unsigned long (%lu scan format code) and
7069 while (isdigit (str
[k
]))
7071 RU
= RU
* 10 + (str
[k
] - '0');
7078 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7084 /* NOTE on the above: Technically, C does not say what the results of
7085 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7086 number representable as a LONGEST (although either would probably work
7087 in most implementations). When RU>0, the locution in the then branch
7088 above is always equivalent to the negative of RU. */
7095 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7096 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7097 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7100 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7102 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7116 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7126 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7127 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7129 if (val
>= L
&& val
<= U
)
7141 /* FIXME: Lots of redundancy below. Try to consolidate. */
7143 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7144 ARG_TYPE, extract and return the value of one of its (non-static)
7145 fields. FIELDNO says which field. Differs from value_primitive_field
7146 only in that it can handle packed values of arbitrary type. */
7148 static struct value
*
7149 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7150 struct type
*arg_type
)
7154 arg_type
= ada_check_typedef (arg_type
);
7155 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7157 /* Handle packed fields. */
7159 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
7161 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7162 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7164 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7165 offset
+ bit_pos
/ 8,
7166 bit_pos
% 8, bit_size
, type
);
7169 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7172 /* Find field with name NAME in object of type TYPE. If found,
7173 set the following for each argument that is non-null:
7174 - *FIELD_TYPE_P to the field's type;
7175 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7176 an object of that type;
7177 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7178 - *BIT_SIZE_P to its size in bits if the field is packed, and
7180 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7181 fields up to but not including the desired field, or by the total
7182 number of fields if not found. A NULL value of NAME never
7183 matches; the function just counts visible fields in this case.
7185 Returns 1 if found, 0 otherwise. */
7188 find_struct_field (const char *name
, struct type
*type
, int offset
,
7189 struct type
**field_type_p
,
7190 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7195 type
= ada_check_typedef (type
);
7197 if (field_type_p
!= NULL
)
7198 *field_type_p
= NULL
;
7199 if (byte_offset_p
!= NULL
)
7201 if (bit_offset_p
!= NULL
)
7203 if (bit_size_p
!= NULL
)
7206 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7208 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7209 int fld_offset
= offset
+ bit_pos
/ 8;
7210 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7212 if (t_field_name
== NULL
)
7215 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7217 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7219 if (field_type_p
!= NULL
)
7220 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7221 if (byte_offset_p
!= NULL
)
7222 *byte_offset_p
= fld_offset
;
7223 if (bit_offset_p
!= NULL
)
7224 *bit_offset_p
= bit_pos
% 8;
7225 if (bit_size_p
!= NULL
)
7226 *bit_size_p
= bit_size
;
7229 else if (ada_is_wrapper_field (type
, i
))
7231 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7232 field_type_p
, byte_offset_p
, bit_offset_p
,
7233 bit_size_p
, index_p
))
7236 else if (ada_is_variant_part (type
, i
))
7238 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7241 struct type
*field_type
7242 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7244 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7246 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7248 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7249 field_type_p
, byte_offset_p
,
7250 bit_offset_p
, bit_size_p
, index_p
))
7254 else if (index_p
!= NULL
)
7260 /* Number of user-visible fields in record type TYPE. */
7263 num_visible_fields (struct type
*type
)
7268 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7272 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7273 and search in it assuming it has (class) type TYPE.
7274 If found, return value, else return NULL.
7276 Searches recursively through wrapper fields (e.g., '_parent'). */
7278 static struct value
*
7279 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7284 type
= ada_check_typedef (type
);
7285 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7287 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7289 if (t_field_name
== NULL
)
7292 else if (field_name_match (t_field_name
, name
))
7293 return ada_value_primitive_field (arg
, offset
, i
, type
);
7295 else if (ada_is_wrapper_field (type
, i
))
7297 struct value
*v
= /* Do not let indent join lines here. */
7298 ada_search_struct_field (name
, arg
,
7299 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7300 TYPE_FIELD_TYPE (type
, i
));
7306 else if (ada_is_variant_part (type
, i
))
7308 /* PNH: Do we ever get here? See find_struct_field. */
7310 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7312 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7314 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7316 struct value
*v
= ada_search_struct_field
/* Force line
7319 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7320 TYPE_FIELD_TYPE (field_type
, j
));
7330 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7331 int, struct type
*);
7334 /* Return field #INDEX in ARG, where the index is that returned by
7335 * find_struct_field through its INDEX_P argument. Adjust the address
7336 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7337 * If found, return value, else return NULL. */
7339 static struct value
*
7340 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7343 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7347 /* Auxiliary function for ada_index_struct_field. Like
7348 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7351 static struct value
*
7352 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7356 type
= ada_check_typedef (type
);
7358 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7360 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7362 else if (ada_is_wrapper_field (type
, i
))
7364 struct value
*v
= /* Do not let indent join lines here. */
7365 ada_index_struct_field_1 (index_p
, arg
,
7366 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7367 TYPE_FIELD_TYPE (type
, i
));
7373 else if (ada_is_variant_part (type
, i
))
7375 /* PNH: Do we ever get here? See ada_search_struct_field,
7376 find_struct_field. */
7377 error (_("Cannot assign this kind of variant record"));
7379 else if (*index_p
== 0)
7380 return ada_value_primitive_field (arg
, offset
, i
, type
);
7387 /* Given ARG, a value of type (pointer or reference to a)*
7388 structure/union, extract the component named NAME from the ultimate
7389 target structure/union and return it as a value with its
7392 The routine searches for NAME among all members of the structure itself
7393 and (recursively) among all members of any wrapper members
7396 If NO_ERR, then simply return NULL in case of error, rather than
7400 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
7402 struct type
*t
, *t1
;
7406 t1
= t
= ada_check_typedef (value_type (arg
));
7407 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7409 t1
= TYPE_TARGET_TYPE (t
);
7412 t1
= ada_check_typedef (t1
);
7413 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7415 arg
= coerce_ref (arg
);
7420 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7422 t1
= TYPE_TARGET_TYPE (t
);
7425 t1
= ada_check_typedef (t1
);
7426 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7428 arg
= value_ind (arg
);
7435 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7439 v
= ada_search_struct_field (name
, arg
, 0, t
);
7442 int bit_offset
, bit_size
, byte_offset
;
7443 struct type
*field_type
;
7446 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7447 address
= value_address (ada_value_ind (arg
));
7449 address
= value_address (ada_coerce_ref (arg
));
7451 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7452 if (find_struct_field (name
, t1
, 0,
7453 &field_type
, &byte_offset
, &bit_offset
,
7458 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7459 arg
= ada_coerce_ref (arg
);
7461 arg
= ada_value_ind (arg
);
7462 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7463 bit_offset
, bit_size
,
7467 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7471 if (v
!= NULL
|| no_err
)
7474 error (_("There is no member named %s."), name
);
7480 error (_("Attempt to extract a component of "
7481 "a value that is not a record."));
7484 /* Return a string representation of type TYPE. */
7487 type_as_string (struct type
*type
)
7489 string_file tmp_stream
;
7491 type_print (type
, "", &tmp_stream
, -1);
7493 return std::move (tmp_stream
.string ());
7496 /* Given a type TYPE, look up the type of the component of type named NAME.
7497 If DISPP is non-null, add its byte displacement from the beginning of a
7498 structure (pointed to by a value) of type TYPE to *DISPP (does not
7499 work for packed fields).
7501 Matches any field whose name has NAME as a prefix, possibly
7504 TYPE can be either a struct or union. If REFOK, TYPE may also
7505 be a (pointer or reference)+ to a struct or union, and the
7506 ultimate target type will be searched.
7508 Looks recursively into variant clauses and parent types.
7510 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7511 TYPE is not a type of the right kind. */
7513 static struct type
*
7514 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7522 if (refok
&& type
!= NULL
)
7525 type
= ada_check_typedef (type
);
7526 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7527 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7529 type
= TYPE_TARGET_TYPE (type
);
7533 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7534 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7539 error (_("Type %s is not a structure or union type"),
7540 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7543 type
= to_static_fixed_type (type
);
7545 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7547 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7550 if (t_field_name
== NULL
)
7553 else if (field_name_match (t_field_name
, name
))
7554 return TYPE_FIELD_TYPE (type
, i
);
7556 else if (ada_is_wrapper_field (type
, i
))
7558 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7564 else if (ada_is_variant_part (type
, i
))
7567 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7570 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7572 /* FIXME pnh 2008/01/26: We check for a field that is
7573 NOT wrapped in a struct, since the compiler sometimes
7574 generates these for unchecked variant types. Revisit
7575 if the compiler changes this practice. */
7576 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7578 if (v_field_name
!= NULL
7579 && field_name_match (v_field_name
, name
))
7580 t
= TYPE_FIELD_TYPE (field_type
, j
);
7582 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7596 const char *name_str
= name
!= NULL
? name
: _("<null>");
7598 error (_("Type %s has no component named %s"),
7599 type_as_string (type
).c_str (), name_str
);
7605 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7606 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7607 represents an unchecked union (that is, the variant part of a
7608 record that is named in an Unchecked_Union pragma). */
7611 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7613 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7615 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7619 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7620 within a value of type OUTER_TYPE that is stored in GDB at
7621 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7622 numbering from 0) is applicable. Returns -1 if none are. */
7625 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7626 const gdb_byte
*outer_valaddr
)
7630 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7631 struct value
*outer
;
7632 struct value
*discrim
;
7633 LONGEST discrim_val
;
7635 /* Using plain value_from_contents_and_address here causes problems
7636 because we will end up trying to resolve a type that is currently
7637 being constructed. */
7638 outer
= value_from_contents_and_address_unresolved (outer_type
,
7640 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7641 if (discrim
== NULL
)
7643 discrim_val
= value_as_long (discrim
);
7646 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7648 if (ada_is_others_clause (var_type
, i
))
7650 else if (ada_in_variant (discrim_val
, var_type
, i
))
7654 return others_clause
;
7659 /* Dynamic-Sized Records */
7661 /* Strategy: The type ostensibly attached to a value with dynamic size
7662 (i.e., a size that is not statically recorded in the debugging
7663 data) does not accurately reflect the size or layout of the value.
7664 Our strategy is to convert these values to values with accurate,
7665 conventional types that are constructed on the fly. */
7667 /* There is a subtle and tricky problem here. In general, we cannot
7668 determine the size of dynamic records without its data. However,
7669 the 'struct value' data structure, which GDB uses to represent
7670 quantities in the inferior process (the target), requires the size
7671 of the type at the time of its allocation in order to reserve space
7672 for GDB's internal copy of the data. That's why the
7673 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7674 rather than struct value*s.
7676 However, GDB's internal history variables ($1, $2, etc.) are
7677 struct value*s containing internal copies of the data that are not, in
7678 general, the same as the data at their corresponding addresses in
7679 the target. Fortunately, the types we give to these values are all
7680 conventional, fixed-size types (as per the strategy described
7681 above), so that we don't usually have to perform the
7682 'to_fixed_xxx_type' conversions to look at their values.
7683 Unfortunately, there is one exception: if one of the internal
7684 history variables is an array whose elements are unconstrained
7685 records, then we will need to create distinct fixed types for each
7686 element selected. */
7688 /* The upshot of all of this is that many routines take a (type, host
7689 address, target address) triple as arguments to represent a value.
7690 The host address, if non-null, is supposed to contain an internal
7691 copy of the relevant data; otherwise, the program is to consult the
7692 target at the target address. */
7694 /* Assuming that VAL0 represents a pointer value, the result of
7695 dereferencing it. Differs from value_ind in its treatment of
7696 dynamic-sized types. */
7699 ada_value_ind (struct value
*val0
)
7701 struct value
*val
= value_ind (val0
);
7703 if (ada_is_tagged_type (value_type (val
), 0))
7704 val
= ada_tag_value_at_base_address (val
);
7706 return ada_to_fixed_value (val
);
7709 /* The value resulting from dereferencing any "reference to"
7710 qualifiers on VAL0. */
7712 static struct value
*
7713 ada_coerce_ref (struct value
*val0
)
7715 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7717 struct value
*val
= val0
;
7719 val
= coerce_ref (val
);
7721 if (ada_is_tagged_type (value_type (val
), 0))
7722 val
= ada_tag_value_at_base_address (val
);
7724 return ada_to_fixed_value (val
);
7730 /* Return OFF rounded upward if necessary to a multiple of
7731 ALIGNMENT (a power of 2). */
7734 align_value (unsigned int off
, unsigned int alignment
)
7736 return (off
+ alignment
- 1) & ~(alignment
- 1);
7739 /* Return the bit alignment required for field #F of template type TYPE. */
7742 field_alignment (struct type
*type
, int f
)
7744 const char *name
= TYPE_FIELD_NAME (type
, f
);
7748 /* The field name should never be null, unless the debugging information
7749 is somehow malformed. In this case, we assume the field does not
7750 require any alignment. */
7754 len
= strlen (name
);
7756 if (!isdigit (name
[len
- 1]))
7759 if (isdigit (name
[len
- 2]))
7760 align_offset
= len
- 2;
7762 align_offset
= len
- 1;
7764 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7765 return TARGET_CHAR_BIT
;
7767 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7770 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7772 static struct symbol
*
7773 ada_find_any_type_symbol (const char *name
)
7777 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7778 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7781 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7785 /* Find a type named NAME. Ignores ambiguity. This routine will look
7786 solely for types defined by debug info, it will not search the GDB
7789 static struct type
*
7790 ada_find_any_type (const char *name
)
7792 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7795 return SYMBOL_TYPE (sym
);
7800 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7801 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7802 symbol, in which case it is returned. Otherwise, this looks for
7803 symbols whose name is that of NAME_SYM suffixed with "___XR".
7804 Return symbol if found, and NULL otherwise. */
7807 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7809 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7812 if (strstr (name
, "___XR") != NULL
)
7815 sym
= find_old_style_renaming_symbol (name
, block
);
7820 /* Not right yet. FIXME pnh 7/20/2007. */
7821 sym
= ada_find_any_type_symbol (name
);
7822 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7828 static struct symbol
*
7829 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7831 const struct symbol
*function_sym
= block_linkage_function (block
);
7834 if (function_sym
!= NULL
)
7836 /* If the symbol is defined inside a function, NAME is not fully
7837 qualified. This means we need to prepend the function name
7838 as well as adding the ``___XR'' suffix to build the name of
7839 the associated renaming symbol. */
7840 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7841 /* Function names sometimes contain suffixes used
7842 for instance to qualify nested subprograms. When building
7843 the XR type name, we need to make sure that this suffix is
7844 not included. So do not include any suffix in the function
7845 name length below. */
7846 int function_name_len
= ada_name_prefix_len (function_name
);
7847 const int rename_len
= function_name_len
+ 2 /* "__" */
7848 + strlen (name
) + 6 /* "___XR\0" */ ;
7850 /* Strip the suffix if necessary. */
7851 ada_remove_trailing_digits (function_name
, &function_name_len
);
7852 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7853 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7855 /* Library-level functions are a special case, as GNAT adds
7856 a ``_ada_'' prefix to the function name to avoid namespace
7857 pollution. However, the renaming symbols themselves do not
7858 have this prefix, so we need to skip this prefix if present. */
7859 if (function_name_len
> 5 /* "_ada_" */
7860 && strstr (function_name
, "_ada_") == function_name
)
7863 function_name_len
-= 5;
7866 rename
= (char *) alloca (rename_len
* sizeof (char));
7867 strncpy (rename
, function_name
, function_name_len
);
7868 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7873 const int rename_len
= strlen (name
) + 6;
7875 rename
= (char *) alloca (rename_len
* sizeof (char));
7876 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7879 return ada_find_any_type_symbol (rename
);
7882 /* Because of GNAT encoding conventions, several GDB symbols may match a
7883 given type name. If the type denoted by TYPE0 is to be preferred to
7884 that of TYPE1 for purposes of type printing, return non-zero;
7885 otherwise return 0. */
7888 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7892 else if (type0
== NULL
)
7894 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7896 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7898 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7900 else if (ada_is_constrained_packed_array_type (type0
))
7902 else if (ada_is_array_descriptor_type (type0
)
7903 && !ada_is_array_descriptor_type (type1
))
7907 const char *type0_name
= type_name_no_tag (type0
);
7908 const char *type1_name
= type_name_no_tag (type1
);
7910 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7911 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7917 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7918 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7921 ada_type_name (struct type
*type
)
7925 else if (TYPE_NAME (type
) != NULL
)
7926 return TYPE_NAME (type
);
7928 return TYPE_TAG_NAME (type
);
7931 /* Search the list of "descriptive" types associated to TYPE for a type
7932 whose name is NAME. */
7934 static struct type
*
7935 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7937 struct type
*result
, *tmp
;
7939 if (ada_ignore_descriptive_types_p
)
7942 /* If there no descriptive-type info, then there is no parallel type
7944 if (!HAVE_GNAT_AUX_INFO (type
))
7947 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7948 while (result
!= NULL
)
7950 const char *result_name
= ada_type_name (result
);
7952 if (result_name
== NULL
)
7954 warning (_("unexpected null name on descriptive type"));
7958 /* If the names match, stop. */
7959 if (strcmp (result_name
, name
) == 0)
7962 /* Otherwise, look at the next item on the list, if any. */
7963 if (HAVE_GNAT_AUX_INFO (result
))
7964 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7968 /* If not found either, try after having resolved the typedef. */
7973 result
= check_typedef (result
);
7974 if (HAVE_GNAT_AUX_INFO (result
))
7975 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7981 /* If we didn't find a match, see whether this is a packed array. With
7982 older compilers, the descriptive type information is either absent or
7983 irrelevant when it comes to packed arrays so the above lookup fails.
7984 Fall back to using a parallel lookup by name in this case. */
7985 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7986 return ada_find_any_type (name
);
7991 /* Find a parallel type to TYPE with the specified NAME, using the
7992 descriptive type taken from the debugging information, if available,
7993 and otherwise using the (slower) name-based method. */
7995 static struct type
*
7996 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7998 struct type
*result
= NULL
;
8000 if (HAVE_GNAT_AUX_INFO (type
))
8001 result
= find_parallel_type_by_descriptive_type (type
, name
);
8003 result
= ada_find_any_type (name
);
8008 /* Same as above, but specify the name of the parallel type by appending
8009 SUFFIX to the name of TYPE. */
8012 ada_find_parallel_type (struct type
*type
, const char *suffix
)
8015 const char *type_name
= ada_type_name (type
);
8018 if (type_name
== NULL
)
8021 len
= strlen (type_name
);
8023 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
8025 strcpy (name
, type_name
);
8026 strcpy (name
+ len
, suffix
);
8028 return ada_find_parallel_type_with_name (type
, name
);
8031 /* If TYPE is a variable-size record type, return the corresponding template
8032 type describing its fields. Otherwise, return NULL. */
8034 static struct type
*
8035 dynamic_template_type (struct type
*type
)
8037 type
= ada_check_typedef (type
);
8039 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
8040 || ada_type_name (type
) == NULL
)
8044 int len
= strlen (ada_type_name (type
));
8046 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
8049 return ada_find_parallel_type (type
, "___XVE");
8053 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8054 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8057 is_dynamic_field (struct type
*templ_type
, int field_num
)
8059 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
8062 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
8063 && strstr (name
, "___XVL") != NULL
;
8066 /* The index of the variant field of TYPE, or -1 if TYPE does not
8067 represent a variant record type. */
8070 variant_field_index (struct type
*type
)
8074 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
8077 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
8079 if (ada_is_variant_part (type
, f
))
8085 /* A record type with no fields. */
8087 static struct type
*
8088 empty_record (struct type
*templ
)
8090 struct type
*type
= alloc_type_copy (templ
);
8092 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
8093 TYPE_NFIELDS (type
) = 0;
8094 TYPE_FIELDS (type
) = NULL
;
8095 INIT_CPLUS_SPECIFIC (type
);
8096 TYPE_NAME (type
) = "<empty>";
8097 TYPE_TAG_NAME (type
) = NULL
;
8098 TYPE_LENGTH (type
) = 0;
8102 /* An ordinary record type (with fixed-length fields) that describes
8103 the value of type TYPE at VALADDR or ADDRESS (see comments at
8104 the beginning of this section) VAL according to GNAT conventions.
8105 DVAL0 should describe the (portion of a) record that contains any
8106 necessary discriminants. It should be NULL if value_type (VAL) is
8107 an outer-level type (i.e., as opposed to a branch of a variant.) A
8108 variant field (unless unchecked) is replaced by a particular branch
8111 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8112 length are not statically known are discarded. As a consequence,
8113 VALADDR, ADDRESS and DVAL0 are ignored.
8115 NOTE: Limitations: For now, we assume that dynamic fields and
8116 variants occupy whole numbers of bytes. However, they need not be
8120 ada_template_to_fixed_record_type_1 (struct type
*type
,
8121 const gdb_byte
*valaddr
,
8122 CORE_ADDR address
, struct value
*dval0
,
8123 int keep_dynamic_fields
)
8125 struct value
*mark
= value_mark ();
8128 int nfields
, bit_len
;
8134 /* Compute the number of fields in this record type that are going
8135 to be processed: unless keep_dynamic_fields, this includes only
8136 fields whose position and length are static will be processed. */
8137 if (keep_dynamic_fields
)
8138 nfields
= TYPE_NFIELDS (type
);
8142 while (nfields
< TYPE_NFIELDS (type
)
8143 && !ada_is_variant_part (type
, nfields
)
8144 && !is_dynamic_field (type
, nfields
))
8148 rtype
= alloc_type_copy (type
);
8149 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8150 INIT_CPLUS_SPECIFIC (rtype
);
8151 TYPE_NFIELDS (rtype
) = nfields
;
8152 TYPE_FIELDS (rtype
) = (struct field
*)
8153 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8154 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
8155 TYPE_NAME (rtype
) = ada_type_name (type
);
8156 TYPE_TAG_NAME (rtype
) = NULL
;
8157 TYPE_FIXED_INSTANCE (rtype
) = 1;
8163 for (f
= 0; f
< nfields
; f
+= 1)
8165 off
= align_value (off
, field_alignment (type
, f
))
8166 + TYPE_FIELD_BITPOS (type
, f
);
8167 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
8168 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8170 if (ada_is_variant_part (type
, f
))
8175 else if (is_dynamic_field (type
, f
))
8177 const gdb_byte
*field_valaddr
= valaddr
;
8178 CORE_ADDR field_address
= address
;
8179 struct type
*field_type
=
8180 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8184 /* rtype's length is computed based on the run-time
8185 value of discriminants. If the discriminants are not
8186 initialized, the type size may be completely bogus and
8187 GDB may fail to allocate a value for it. So check the
8188 size first before creating the value. */
8189 ada_ensure_varsize_limit (rtype
);
8190 /* Using plain value_from_contents_and_address here
8191 causes problems because we will end up trying to
8192 resolve a type that is currently being
8194 dval
= value_from_contents_and_address_unresolved (rtype
,
8197 rtype
= value_type (dval
);
8202 /* If the type referenced by this field is an aligner type, we need
8203 to unwrap that aligner type, because its size might not be set.
8204 Keeping the aligner type would cause us to compute the wrong
8205 size for this field, impacting the offset of the all the fields
8206 that follow this one. */
8207 if (ada_is_aligner_type (field_type
))
8209 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8211 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8212 field_address
= cond_offset_target (field_address
, field_offset
);
8213 field_type
= ada_aligned_type (field_type
);
8216 field_valaddr
= cond_offset_host (field_valaddr
,
8217 off
/ TARGET_CHAR_BIT
);
8218 field_address
= cond_offset_target (field_address
,
8219 off
/ TARGET_CHAR_BIT
);
8221 /* Get the fixed type of the field. Note that, in this case,
8222 we do not want to get the real type out of the tag: if
8223 the current field is the parent part of a tagged record,
8224 we will get the tag of the object. Clearly wrong: the real
8225 type of the parent is not the real type of the child. We
8226 would end up in an infinite loop. */
8227 field_type
= ada_get_base_type (field_type
);
8228 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8229 field_address
, dval
, 0);
8230 /* If the field size is already larger than the maximum
8231 object size, then the record itself will necessarily
8232 be larger than the maximum object size. We need to make
8233 this check now, because the size might be so ridiculously
8234 large (due to an uninitialized variable in the inferior)
8235 that it would cause an overflow when adding it to the
8237 ada_ensure_varsize_limit (field_type
);
8239 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8240 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8241 /* The multiplication can potentially overflow. But because
8242 the field length has been size-checked just above, and
8243 assuming that the maximum size is a reasonable value,
8244 an overflow should not happen in practice. So rather than
8245 adding overflow recovery code to this already complex code,
8246 we just assume that it's not going to happen. */
8248 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8252 /* Note: If this field's type is a typedef, it is important
8253 to preserve the typedef layer.
8255 Otherwise, we might be transforming a typedef to a fat
8256 pointer (encoding a pointer to an unconstrained array),
8257 into a basic fat pointer (encoding an unconstrained
8258 array). As both types are implemented using the same
8259 structure, the typedef is the only clue which allows us
8260 to distinguish between the two options. Stripping it
8261 would prevent us from printing this field appropriately. */
8262 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8263 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8264 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8266 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8269 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8271 /* We need to be careful of typedefs when computing
8272 the length of our field. If this is a typedef,
8273 get the length of the target type, not the length
8275 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8276 field_type
= ada_typedef_target_type (field_type
);
8279 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8282 if (off
+ fld_bit_len
> bit_len
)
8283 bit_len
= off
+ fld_bit_len
;
8285 TYPE_LENGTH (rtype
) =
8286 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8289 /* We handle the variant part, if any, at the end because of certain
8290 odd cases in which it is re-ordered so as NOT to be the last field of
8291 the record. This can happen in the presence of representation
8293 if (variant_field
>= 0)
8295 struct type
*branch_type
;
8297 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8301 /* Using plain value_from_contents_and_address here causes
8302 problems because we will end up trying to resolve a type
8303 that is currently being constructed. */
8304 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8306 rtype
= value_type (dval
);
8312 to_fixed_variant_branch_type
8313 (TYPE_FIELD_TYPE (type
, variant_field
),
8314 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8315 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8316 if (branch_type
== NULL
)
8318 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8319 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8320 TYPE_NFIELDS (rtype
) -= 1;
8324 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8325 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8327 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8329 if (off
+ fld_bit_len
> bit_len
)
8330 bit_len
= off
+ fld_bit_len
;
8331 TYPE_LENGTH (rtype
) =
8332 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8336 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8337 should contain the alignment of that record, which should be a strictly
8338 positive value. If null or negative, then something is wrong, most
8339 probably in the debug info. In that case, we don't round up the size
8340 of the resulting type. If this record is not part of another structure,
8341 the current RTYPE length might be good enough for our purposes. */
8342 if (TYPE_LENGTH (type
) <= 0)
8344 if (TYPE_NAME (rtype
))
8345 warning (_("Invalid type size for `%s' detected: %d."),
8346 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8348 warning (_("Invalid type size for <unnamed> detected: %d."),
8349 TYPE_LENGTH (type
));
8353 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8354 TYPE_LENGTH (type
));
8357 value_free_to_mark (mark
);
8358 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8359 error (_("record type with dynamic size is larger than varsize-limit"));
8363 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8366 static struct type
*
8367 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8368 CORE_ADDR address
, struct value
*dval0
)
8370 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8374 /* An ordinary record type in which ___XVL-convention fields and
8375 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8376 static approximations, containing all possible fields. Uses
8377 no runtime values. Useless for use in values, but that's OK,
8378 since the results are used only for type determinations. Works on both
8379 structs and unions. Representation note: to save space, we memorize
8380 the result of this function in the TYPE_TARGET_TYPE of the
8383 static struct type
*
8384 template_to_static_fixed_type (struct type
*type0
)
8390 /* No need no do anything if the input type is already fixed. */
8391 if (TYPE_FIXED_INSTANCE (type0
))
8394 /* Likewise if we already have computed the static approximation. */
8395 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8396 return TYPE_TARGET_TYPE (type0
);
8398 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8400 nfields
= TYPE_NFIELDS (type0
);
8402 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8403 recompute all over next time. */
8404 TYPE_TARGET_TYPE (type0
) = type
;
8406 for (f
= 0; f
< nfields
; f
+= 1)
8408 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8409 struct type
*new_type
;
8411 if (is_dynamic_field (type0
, f
))
8413 field_type
= ada_check_typedef (field_type
);
8414 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8417 new_type
= static_unwrap_type (field_type
);
8419 if (new_type
!= field_type
)
8421 /* Clone TYPE0 only the first time we get a new field type. */
8424 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8425 TYPE_CODE (type
) = TYPE_CODE (type0
);
8426 INIT_CPLUS_SPECIFIC (type
);
8427 TYPE_NFIELDS (type
) = nfields
;
8428 TYPE_FIELDS (type
) = (struct field
*)
8429 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8430 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8431 sizeof (struct field
) * nfields
);
8432 TYPE_NAME (type
) = ada_type_name (type0
);
8433 TYPE_TAG_NAME (type
) = NULL
;
8434 TYPE_FIXED_INSTANCE (type
) = 1;
8435 TYPE_LENGTH (type
) = 0;
8437 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8438 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8445 /* Given an object of type TYPE whose contents are at VALADDR and
8446 whose address in memory is ADDRESS, returns a revision of TYPE,
8447 which should be a non-dynamic-sized record, in which the variant
8448 part, if any, is replaced with the appropriate branch. Looks
8449 for discriminant values in DVAL0, which can be NULL if the record
8450 contains the necessary discriminant values. */
8452 static struct type
*
8453 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8454 CORE_ADDR address
, struct value
*dval0
)
8456 struct value
*mark
= value_mark ();
8459 struct type
*branch_type
;
8460 int nfields
= TYPE_NFIELDS (type
);
8461 int variant_field
= variant_field_index (type
);
8463 if (variant_field
== -1)
8468 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8469 type
= value_type (dval
);
8474 rtype
= alloc_type_copy (type
);
8475 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8476 INIT_CPLUS_SPECIFIC (rtype
);
8477 TYPE_NFIELDS (rtype
) = nfields
;
8478 TYPE_FIELDS (rtype
) =
8479 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8480 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8481 sizeof (struct field
) * nfields
);
8482 TYPE_NAME (rtype
) = ada_type_name (type
);
8483 TYPE_TAG_NAME (rtype
) = NULL
;
8484 TYPE_FIXED_INSTANCE (rtype
) = 1;
8485 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8487 branch_type
= to_fixed_variant_branch_type
8488 (TYPE_FIELD_TYPE (type
, variant_field
),
8489 cond_offset_host (valaddr
,
8490 TYPE_FIELD_BITPOS (type
, variant_field
)
8492 cond_offset_target (address
,
8493 TYPE_FIELD_BITPOS (type
, variant_field
)
8494 / TARGET_CHAR_BIT
), dval
);
8495 if (branch_type
== NULL
)
8499 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8500 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8501 TYPE_NFIELDS (rtype
) -= 1;
8505 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8506 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8507 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8508 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8510 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8512 value_free_to_mark (mark
);
8516 /* An ordinary record type (with fixed-length fields) that describes
8517 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8518 beginning of this section]. Any necessary discriminants' values
8519 should be in DVAL, a record value; it may be NULL if the object
8520 at ADDR itself contains any necessary discriminant values.
8521 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8522 values from the record are needed. Except in the case that DVAL,
8523 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8524 unchecked) is replaced by a particular branch of the variant.
8526 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8527 is questionable and may be removed. It can arise during the
8528 processing of an unconstrained-array-of-record type where all the
8529 variant branches have exactly the same size. This is because in
8530 such cases, the compiler does not bother to use the XVS convention
8531 when encoding the record. I am currently dubious of this
8532 shortcut and suspect the compiler should be altered. FIXME. */
8534 static struct type
*
8535 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8536 CORE_ADDR address
, struct value
*dval
)
8538 struct type
*templ_type
;
8540 if (TYPE_FIXED_INSTANCE (type0
))
8543 templ_type
= dynamic_template_type (type0
);
8545 if (templ_type
!= NULL
)
8546 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8547 else if (variant_field_index (type0
) >= 0)
8549 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8551 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8556 TYPE_FIXED_INSTANCE (type0
) = 1;
8562 /* An ordinary record type (with fixed-length fields) that describes
8563 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8564 union type. Any necessary discriminants' values should be in DVAL,
8565 a record value. That is, this routine selects the appropriate
8566 branch of the union at ADDR according to the discriminant value
8567 indicated in the union's type name. Returns VAR_TYPE0 itself if
8568 it represents a variant subject to a pragma Unchecked_Union. */
8570 static struct type
*
8571 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8572 CORE_ADDR address
, struct value
*dval
)
8575 struct type
*templ_type
;
8576 struct type
*var_type
;
8578 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8579 var_type
= TYPE_TARGET_TYPE (var_type0
);
8581 var_type
= var_type0
;
8583 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8585 if (templ_type
!= NULL
)
8586 var_type
= templ_type
;
8588 if (is_unchecked_variant (var_type
, value_type (dval
)))
8591 ada_which_variant_applies (var_type
,
8592 value_type (dval
), value_contents (dval
));
8595 return empty_record (var_type
);
8596 else if (is_dynamic_field (var_type
, which
))
8597 return to_fixed_record_type
8598 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8599 valaddr
, address
, dval
);
8600 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8602 to_fixed_record_type
8603 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8605 return TYPE_FIELD_TYPE (var_type
, which
);
8608 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8609 ENCODING_TYPE, a type following the GNAT conventions for discrete
8610 type encodings, only carries redundant information. */
8613 ada_is_redundant_range_encoding (struct type
*range_type
,
8614 struct type
*encoding_type
)
8616 struct type
*fixed_range_type
;
8617 const char *bounds_str
;
8621 gdb_assert (TYPE_CODE (range_type
) == TYPE_CODE_RANGE
);
8623 if (TYPE_CODE (get_base_type (range_type
))
8624 != TYPE_CODE (get_base_type (encoding_type
)))
8626 /* The compiler probably used a simple base type to describe
8627 the range type instead of the range's actual base type,
8628 expecting us to get the real base type from the encoding
8629 anyway. In this situation, the encoding cannot be ignored
8634 if (is_dynamic_type (range_type
))
8637 if (TYPE_NAME (encoding_type
) == NULL
)
8640 bounds_str
= strstr (TYPE_NAME (encoding_type
), "___XDLU_");
8641 if (bounds_str
== NULL
)
8644 n
= 8; /* Skip "___XDLU_". */
8645 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8647 if (TYPE_LOW_BOUND (range_type
) != lo
)
8650 n
+= 2; /* Skip the "__" separator between the two bounds. */
8651 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8653 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8659 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8660 a type following the GNAT encoding for describing array type
8661 indices, only carries redundant information. */
8664 ada_is_redundant_index_type_desc (struct type
*array_type
,
8665 struct type
*desc_type
)
8667 struct type
*this_layer
= check_typedef (array_type
);
8670 for (i
= 0; i
< TYPE_NFIELDS (desc_type
); i
++)
8672 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8673 TYPE_FIELD_TYPE (desc_type
, i
)))
8675 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8681 /* Assuming that TYPE0 is an array type describing the type of a value
8682 at ADDR, and that DVAL describes a record containing any
8683 discriminants used in TYPE0, returns a type for the value that
8684 contains no dynamic components (that is, no components whose sizes
8685 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8686 true, gives an error message if the resulting type's size is over
8689 static struct type
*
8690 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8693 struct type
*index_type_desc
;
8694 struct type
*result
;
8695 int constrained_packed_array_p
;
8696 static const char *xa_suffix
= "___XA";
8698 type0
= ada_check_typedef (type0
);
8699 if (TYPE_FIXED_INSTANCE (type0
))
8702 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8703 if (constrained_packed_array_p
)
8704 type0
= decode_constrained_packed_array_type (type0
);
8706 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8708 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8709 encoding suffixed with 'P' may still be generated. If so,
8710 it should be used to find the XA type. */
8712 if (index_type_desc
== NULL
)
8714 const char *type_name
= ada_type_name (type0
);
8716 if (type_name
!= NULL
)
8718 const int len
= strlen (type_name
);
8719 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8721 if (type_name
[len
- 1] == 'P')
8723 strcpy (name
, type_name
);
8724 strcpy (name
+ len
- 1, xa_suffix
);
8725 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8730 ada_fixup_array_indexes_type (index_type_desc
);
8731 if (index_type_desc
!= NULL
8732 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8734 /* Ignore this ___XA parallel type, as it does not bring any
8735 useful information. This allows us to avoid creating fixed
8736 versions of the array's index types, which would be identical
8737 to the original ones. This, in turn, can also help avoid
8738 the creation of fixed versions of the array itself. */
8739 index_type_desc
= NULL
;
8742 if (index_type_desc
== NULL
)
8744 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8746 /* NOTE: elt_type---the fixed version of elt_type0---should never
8747 depend on the contents of the array in properly constructed
8749 /* Create a fixed version of the array element type.
8750 We're not providing the address of an element here,
8751 and thus the actual object value cannot be inspected to do
8752 the conversion. This should not be a problem, since arrays of
8753 unconstrained objects are not allowed. In particular, all
8754 the elements of an array of a tagged type should all be of
8755 the same type specified in the debugging info. No need to
8756 consult the object tag. */
8757 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8759 /* Make sure we always create a new array type when dealing with
8760 packed array types, since we're going to fix-up the array
8761 type length and element bitsize a little further down. */
8762 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8765 result
= create_array_type (alloc_type_copy (type0
),
8766 elt_type
, TYPE_INDEX_TYPE (type0
));
8771 struct type
*elt_type0
;
8774 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8775 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8777 /* NOTE: result---the fixed version of elt_type0---should never
8778 depend on the contents of the array in properly constructed
8780 /* Create a fixed version of the array element type.
8781 We're not providing the address of an element here,
8782 and thus the actual object value cannot be inspected to do
8783 the conversion. This should not be a problem, since arrays of
8784 unconstrained objects are not allowed. In particular, all
8785 the elements of an array of a tagged type should all be of
8786 the same type specified in the debugging info. No need to
8787 consult the object tag. */
8789 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8792 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8794 struct type
*range_type
=
8795 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8797 result
= create_array_type (alloc_type_copy (elt_type0
),
8798 result
, range_type
);
8799 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8801 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8802 error (_("array type with dynamic size is larger than varsize-limit"));
8805 /* We want to preserve the type name. This can be useful when
8806 trying to get the type name of a value that has already been
8807 printed (for instance, if the user did "print VAR; whatis $". */
8808 TYPE_NAME (result
) = TYPE_NAME (type0
);
8810 if (constrained_packed_array_p
)
8812 /* So far, the resulting type has been created as if the original
8813 type was a regular (non-packed) array type. As a result, the
8814 bitsize of the array elements needs to be set again, and the array
8815 length needs to be recomputed based on that bitsize. */
8816 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8817 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8819 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8820 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8821 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8822 TYPE_LENGTH (result
)++;
8825 TYPE_FIXED_INSTANCE (result
) = 1;
8830 /* A standard type (containing no dynamically sized components)
8831 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8832 DVAL describes a record containing any discriminants used in TYPE0,
8833 and may be NULL if there are none, or if the object of type TYPE at
8834 ADDRESS or in VALADDR contains these discriminants.
8836 If CHECK_TAG is not null, in the case of tagged types, this function
8837 attempts to locate the object's tag and use it to compute the actual
8838 type. However, when ADDRESS is null, we cannot use it to determine the
8839 location of the tag, and therefore compute the tagged type's actual type.
8840 So we return the tagged type without consulting the tag. */
8842 static struct type
*
8843 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8844 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8846 type
= ada_check_typedef (type
);
8847 switch (TYPE_CODE (type
))
8851 case TYPE_CODE_STRUCT
:
8853 struct type
*static_type
= to_static_fixed_type (type
);
8854 struct type
*fixed_record_type
=
8855 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8857 /* If STATIC_TYPE is a tagged type and we know the object's address,
8858 then we can determine its tag, and compute the object's actual
8859 type from there. Note that we have to use the fixed record
8860 type (the parent part of the record may have dynamic fields
8861 and the way the location of _tag is expressed may depend on
8864 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8867 value_tag_from_contents_and_address
8871 struct type
*real_type
= type_from_tag (tag
);
8873 value_from_contents_and_address (fixed_record_type
,
8876 fixed_record_type
= value_type (obj
);
8877 if (real_type
!= NULL
)
8878 return to_fixed_record_type
8880 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8883 /* Check to see if there is a parallel ___XVZ variable.
8884 If there is, then it provides the actual size of our type. */
8885 else if (ada_type_name (fixed_record_type
) != NULL
)
8887 const char *name
= ada_type_name (fixed_record_type
);
8889 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8892 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8893 if (get_int_var_value (xvz_name
, size
)
8894 && TYPE_LENGTH (fixed_record_type
) != size
)
8896 fixed_record_type
= copy_type (fixed_record_type
);
8897 TYPE_LENGTH (fixed_record_type
) = size
;
8899 /* The FIXED_RECORD_TYPE may have be a stub. We have
8900 observed this when the debugging info is STABS, and
8901 apparently it is something that is hard to fix.
8903 In practice, we don't need the actual type definition
8904 at all, because the presence of the XVZ variable allows us
8905 to assume that there must be a XVS type as well, which we
8906 should be able to use later, when we need the actual type
8909 In the meantime, pretend that the "fixed" type we are
8910 returning is NOT a stub, because this can cause trouble
8911 when using this type to create new types targeting it.
8912 Indeed, the associated creation routines often check
8913 whether the target type is a stub and will try to replace
8914 it, thus using a type with the wrong size. This, in turn,
8915 might cause the new type to have the wrong size too.
8916 Consider the case of an array, for instance, where the size
8917 of the array is computed from the number of elements in
8918 our array multiplied by the size of its element. */
8919 TYPE_STUB (fixed_record_type
) = 0;
8922 return fixed_record_type
;
8924 case TYPE_CODE_ARRAY
:
8925 return to_fixed_array_type (type
, dval
, 1);
8926 case TYPE_CODE_UNION
:
8930 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8934 /* The same as ada_to_fixed_type_1, except that it preserves the type
8935 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8937 The typedef layer needs be preserved in order to differentiate between
8938 arrays and array pointers when both types are implemented using the same
8939 fat pointer. In the array pointer case, the pointer is encoded as
8940 a typedef of the pointer type. For instance, considering:
8942 type String_Access is access String;
8943 S1 : String_Access := null;
8945 To the debugger, S1 is defined as a typedef of type String. But
8946 to the user, it is a pointer. So if the user tries to print S1,
8947 we should not dereference the array, but print the array address
8950 If we didn't preserve the typedef layer, we would lose the fact that
8951 the type is to be presented as a pointer (needs de-reference before
8952 being printed). And we would also use the source-level type name. */
8955 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8956 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8959 struct type
*fixed_type
=
8960 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8962 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8963 then preserve the typedef layer.
8965 Implementation note: We can only check the main-type portion of
8966 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8967 from TYPE now returns a type that has the same instance flags
8968 as TYPE. For instance, if TYPE is a "typedef const", and its
8969 target type is a "struct", then the typedef elimination will return
8970 a "const" version of the target type. See check_typedef for more
8971 details about how the typedef layer elimination is done.
8973 brobecker/2010-11-19: It seems to me that the only case where it is
8974 useful to preserve the typedef layer is when dealing with fat pointers.
8975 Perhaps, we could add a check for that and preserve the typedef layer
8976 only in that situation. But this seems unecessary so far, probably
8977 because we call check_typedef/ada_check_typedef pretty much everywhere.
8979 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8980 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8981 == TYPE_MAIN_TYPE (fixed_type
)))
8987 /* A standard (static-sized) type corresponding as well as possible to
8988 TYPE0, but based on no runtime data. */
8990 static struct type
*
8991 to_static_fixed_type (struct type
*type0
)
8998 if (TYPE_FIXED_INSTANCE (type0
))
9001 type0
= ada_check_typedef (type0
);
9003 switch (TYPE_CODE (type0
))
9007 case TYPE_CODE_STRUCT
:
9008 type
= dynamic_template_type (type0
);
9010 return template_to_static_fixed_type (type
);
9012 return template_to_static_fixed_type (type0
);
9013 case TYPE_CODE_UNION
:
9014 type
= ada_find_parallel_type (type0
, "___XVU");
9016 return template_to_static_fixed_type (type
);
9018 return template_to_static_fixed_type (type0
);
9022 /* A static approximation of TYPE with all type wrappers removed. */
9024 static struct type
*
9025 static_unwrap_type (struct type
*type
)
9027 if (ada_is_aligner_type (type
))
9029 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
9030 if (ada_type_name (type1
) == NULL
)
9031 TYPE_NAME (type1
) = ada_type_name (type
);
9033 return static_unwrap_type (type1
);
9037 struct type
*raw_real_type
= ada_get_base_type (type
);
9039 if (raw_real_type
== type
)
9042 return to_static_fixed_type (raw_real_type
);
9046 /* In some cases, incomplete and private types require
9047 cross-references that are not resolved as records (for example,
9049 type FooP is access Foo;
9051 type Foo is array ...;
9052 ). In these cases, since there is no mechanism for producing
9053 cross-references to such types, we instead substitute for FooP a
9054 stub enumeration type that is nowhere resolved, and whose tag is
9055 the name of the actual type. Call these types "non-record stubs". */
9057 /* A type equivalent to TYPE that is not a non-record stub, if one
9058 exists, otherwise TYPE. */
9061 ada_check_typedef (struct type
*type
)
9066 /* If our type is a typedef type of a fat pointer, then we're done.
9067 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9068 what allows us to distinguish between fat pointers that represent
9069 array types, and fat pointers that represent array access types
9070 (in both cases, the compiler implements them as fat pointers). */
9071 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
9072 && is_thick_pntr (ada_typedef_target_type (type
)))
9075 type
= check_typedef (type
);
9076 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
9077 || !TYPE_STUB (type
)
9078 || TYPE_TAG_NAME (type
) == NULL
)
9082 const char *name
= TYPE_TAG_NAME (type
);
9083 struct type
*type1
= ada_find_any_type (name
);
9088 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9089 stubs pointing to arrays, as we don't create symbols for array
9090 types, only for the typedef-to-array types). If that's the case,
9091 strip the typedef layer. */
9092 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
9093 type1
= ada_check_typedef (type1
);
9099 /* A value representing the data at VALADDR/ADDRESS as described by
9100 type TYPE0, but with a standard (static-sized) type that correctly
9101 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9102 type, then return VAL0 [this feature is simply to avoid redundant
9103 creation of struct values]. */
9105 static struct value
*
9106 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9109 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9111 if (type
== type0
&& val0
!= NULL
)
9114 return value_from_contents_and_address (type
, 0, address
);
9117 /* A value representing VAL, but with a standard (static-sized) type
9118 that correctly describes it. Does not necessarily create a new
9122 ada_to_fixed_value (struct value
*val
)
9124 val
= unwrap_value (val
);
9125 val
= ada_to_fixed_value_create (value_type (val
),
9126 value_address (val
),
9134 /* Table mapping attribute numbers to names.
9135 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9137 static const char *attribute_names
[] = {
9155 ada_attribute_name (enum exp_opcode n
)
9157 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9158 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9160 return attribute_names
[0];
9163 /* Evaluate the 'POS attribute applied to ARG. */
9166 pos_atr (struct value
*arg
)
9168 struct value
*val
= coerce_ref (arg
);
9169 struct type
*type
= value_type (val
);
9172 if (!discrete_type_p (type
))
9173 error (_("'POS only defined on discrete types"));
9175 if (!discrete_position (type
, value_as_long (val
), &result
))
9176 error (_("enumeration value is invalid: can't find 'POS"));
9181 static struct value
*
9182 value_pos_atr (struct type
*type
, struct value
*arg
)
9184 return value_from_longest (type
, pos_atr (arg
));
9187 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9189 static struct value
*
9190 value_val_atr (struct type
*type
, struct value
*arg
)
9192 if (!discrete_type_p (type
))
9193 error (_("'VAL only defined on discrete types"));
9194 if (!integer_type_p (value_type (arg
)))
9195 error (_("'VAL requires integral argument"));
9197 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
9199 long pos
= value_as_long (arg
);
9201 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
9202 error (_("argument to 'VAL out of range"));
9203 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
9206 return value_from_longest (type
, value_as_long (arg
));
9212 /* True if TYPE appears to be an Ada character type.
9213 [At the moment, this is true only for Character and Wide_Character;
9214 It is a heuristic test that could stand improvement]. */
9217 ada_is_character_type (struct type
*type
)
9221 /* If the type code says it's a character, then assume it really is,
9222 and don't check any further. */
9223 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
9226 /* Otherwise, assume it's a character type iff it is a discrete type
9227 with a known character type name. */
9228 name
= ada_type_name (type
);
9229 return (name
!= NULL
9230 && (TYPE_CODE (type
) == TYPE_CODE_INT
9231 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9232 && (strcmp (name
, "character") == 0
9233 || strcmp (name
, "wide_character") == 0
9234 || strcmp (name
, "wide_wide_character") == 0
9235 || strcmp (name
, "unsigned char") == 0));
9238 /* True if TYPE appears to be an Ada string type. */
9241 ada_is_string_type (struct type
*type
)
9243 type
= ada_check_typedef (type
);
9245 && TYPE_CODE (type
) != TYPE_CODE_PTR
9246 && (ada_is_simple_array_type (type
)
9247 || ada_is_array_descriptor_type (type
))
9248 && ada_array_arity (type
) == 1)
9250 struct type
*elttype
= ada_array_element_type (type
, 1);
9252 return ada_is_character_type (elttype
);
9258 /* The compiler sometimes provides a parallel XVS type for a given
9259 PAD type. Normally, it is safe to follow the PAD type directly,
9260 but older versions of the compiler have a bug that causes the offset
9261 of its "F" field to be wrong. Following that field in that case
9262 would lead to incorrect results, but this can be worked around
9263 by ignoring the PAD type and using the associated XVS type instead.
9265 Set to True if the debugger should trust the contents of PAD types.
9266 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9267 static int trust_pad_over_xvs
= 1;
9269 /* True if TYPE is a struct type introduced by the compiler to force the
9270 alignment of a value. Such types have a single field with a
9271 distinctive name. */
9274 ada_is_aligner_type (struct type
*type
)
9276 type
= ada_check_typedef (type
);
9278 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9281 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
9282 && TYPE_NFIELDS (type
) == 1
9283 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9286 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9287 the parallel type. */
9290 ada_get_base_type (struct type
*raw_type
)
9292 struct type
*real_type_namer
;
9293 struct type
*raw_real_type
;
9295 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
9298 if (ada_is_aligner_type (raw_type
))
9299 /* The encoding specifies that we should always use the aligner type.
9300 So, even if this aligner type has an associated XVS type, we should
9303 According to the compiler gurus, an XVS type parallel to an aligner
9304 type may exist because of a stabs limitation. In stabs, aligner
9305 types are empty because the field has a variable-sized type, and
9306 thus cannot actually be used as an aligner type. As a result,
9307 we need the associated parallel XVS type to decode the type.
9308 Since the policy in the compiler is to not change the internal
9309 representation based on the debugging info format, we sometimes
9310 end up having a redundant XVS type parallel to the aligner type. */
9313 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9314 if (real_type_namer
== NULL
9315 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
9316 || TYPE_NFIELDS (real_type_namer
) != 1)
9319 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
9321 /* This is an older encoding form where the base type needs to be
9322 looked up by name. We prefer the newer enconding because it is
9324 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9325 if (raw_real_type
== NULL
)
9328 return raw_real_type
;
9331 /* The field in our XVS type is a reference to the base type. */
9332 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9335 /* The type of value designated by TYPE, with all aligners removed. */
9338 ada_aligned_type (struct type
*type
)
9340 if (ada_is_aligner_type (type
))
9341 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9343 return ada_get_base_type (type
);
9347 /* The address of the aligned value in an object at address VALADDR
9348 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9351 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9353 if (ada_is_aligner_type (type
))
9354 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9356 TYPE_FIELD_BITPOS (type
,
9357 0) / TARGET_CHAR_BIT
);
9364 /* The printed representation of an enumeration literal with encoded
9365 name NAME. The value is good to the next call of ada_enum_name. */
9367 ada_enum_name (const char *name
)
9369 static char *result
;
9370 static size_t result_len
= 0;
9373 /* First, unqualify the enumeration name:
9374 1. Search for the last '.' character. If we find one, then skip
9375 all the preceding characters, the unqualified name starts
9376 right after that dot.
9377 2. Otherwise, we may be debugging on a target where the compiler
9378 translates dots into "__". Search forward for double underscores,
9379 but stop searching when we hit an overloading suffix, which is
9380 of the form "__" followed by digits. */
9382 tmp
= strrchr (name
, '.');
9387 while ((tmp
= strstr (name
, "__")) != NULL
)
9389 if (isdigit (tmp
[2]))
9400 if (name
[1] == 'U' || name
[1] == 'W')
9402 if (sscanf (name
+ 2, "%x", &v
) != 1)
9408 GROW_VECT (result
, result_len
, 16);
9409 if (isascii (v
) && isprint (v
))
9410 xsnprintf (result
, result_len
, "'%c'", v
);
9411 else if (name
[1] == 'U')
9412 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9414 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9420 tmp
= strstr (name
, "__");
9422 tmp
= strstr (name
, "$");
9425 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9426 strncpy (result
, name
, tmp
- name
);
9427 result
[tmp
- name
] = '\0';
9435 /* Evaluate the subexpression of EXP starting at *POS as for
9436 evaluate_type, updating *POS to point just past the evaluated
9439 static struct value
*
9440 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9442 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9445 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9448 static struct value
*
9449 unwrap_value (struct value
*val
)
9451 struct type
*type
= ada_check_typedef (value_type (val
));
9453 if (ada_is_aligner_type (type
))
9455 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9456 struct type
*val_type
= ada_check_typedef (value_type (v
));
9458 if (ada_type_name (val_type
) == NULL
)
9459 TYPE_NAME (val_type
) = ada_type_name (type
);
9461 return unwrap_value (v
);
9465 struct type
*raw_real_type
=
9466 ada_check_typedef (ada_get_base_type (type
));
9468 /* If there is no parallel XVS or XVE type, then the value is
9469 already unwrapped. Return it without further modification. */
9470 if ((type
== raw_real_type
)
9471 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9475 coerce_unspec_val_to_type
9476 (val
, ada_to_fixed_type (raw_real_type
, 0,
9477 value_address (val
),
9482 static struct value
*
9483 cast_from_fixed (struct type
*type
, struct value
*arg
)
9485 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9486 arg
= value_cast (value_type (scale
), arg
);
9488 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9489 return value_cast (type
, arg
);
9492 static struct value
*
9493 cast_to_fixed (struct type
*type
, struct value
*arg
)
9495 if (type
== value_type (arg
))
9498 struct value
*scale
= ada_scaling_factor (type
);
9499 if (ada_is_fixed_point_type (value_type (arg
)))
9500 arg
= cast_from_fixed (value_type (scale
), arg
);
9502 arg
= value_cast (value_type (scale
), arg
);
9504 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9505 return value_cast (type
, arg
);
9508 /* Given two array types T1 and T2, return nonzero iff both arrays
9509 contain the same number of elements. */
9512 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9514 LONGEST lo1
, hi1
, lo2
, hi2
;
9516 /* Get the array bounds in order to verify that the size of
9517 the two arrays match. */
9518 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9519 || !get_array_bounds (t2
, &lo2
, &hi2
))
9520 error (_("unable to determine array bounds"));
9522 /* To make things easier for size comparison, normalize a bit
9523 the case of empty arrays by making sure that the difference
9524 between upper bound and lower bound is always -1. */
9530 return (hi1
- lo1
== hi2
- lo2
);
9533 /* Assuming that VAL is an array of integrals, and TYPE represents
9534 an array with the same number of elements, but with wider integral
9535 elements, return an array "casted" to TYPE. In practice, this
9536 means that the returned array is built by casting each element
9537 of the original array into TYPE's (wider) element type. */
9539 static struct value
*
9540 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9542 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9547 /* Verify that both val and type are arrays of scalars, and
9548 that the size of val's elements is smaller than the size
9549 of type's element. */
9550 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9551 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9552 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9553 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9554 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9555 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9557 if (!get_array_bounds (type
, &lo
, &hi
))
9558 error (_("unable to determine array bounds"));
9560 res
= allocate_value (type
);
9562 /* Promote each array element. */
9563 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9565 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9567 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9568 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9574 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9575 return the converted value. */
9577 static struct value
*
9578 coerce_for_assign (struct type
*type
, struct value
*val
)
9580 struct type
*type2
= value_type (val
);
9585 type2
= ada_check_typedef (type2
);
9586 type
= ada_check_typedef (type
);
9588 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9589 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9591 val
= ada_value_ind (val
);
9592 type2
= value_type (val
);
9595 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9596 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9598 if (!ada_same_array_size_p (type
, type2
))
9599 error (_("cannot assign arrays of different length"));
9601 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9602 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9603 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9604 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9606 /* Allow implicit promotion of the array elements to
9608 return ada_promote_array_of_integrals (type
, val
);
9611 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9612 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9613 error (_("Incompatible types in assignment"));
9614 deprecated_set_value_type (val
, type
);
9619 static struct value
*
9620 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9623 struct type
*type1
, *type2
;
9626 arg1
= coerce_ref (arg1
);
9627 arg2
= coerce_ref (arg2
);
9628 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9629 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9631 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9632 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9633 return value_binop (arg1
, arg2
, op
);
9642 return value_binop (arg1
, arg2
, op
);
9645 v2
= value_as_long (arg2
);
9647 error (_("second operand of %s must not be zero."), op_string (op
));
9649 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9650 return value_binop (arg1
, arg2
, op
);
9652 v1
= value_as_long (arg1
);
9657 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9658 v
+= v
> 0 ? -1 : 1;
9666 /* Should not reach this point. */
9670 val
= allocate_value (type1
);
9671 store_unsigned_integer (value_contents_raw (val
),
9672 TYPE_LENGTH (value_type (val
)),
9673 gdbarch_byte_order (get_type_arch (type1
)), v
);
9678 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9680 if (ada_is_direct_array_type (value_type (arg1
))
9681 || ada_is_direct_array_type (value_type (arg2
)))
9683 /* Automatically dereference any array reference before
9684 we attempt to perform the comparison. */
9685 arg1
= ada_coerce_ref (arg1
);
9686 arg2
= ada_coerce_ref (arg2
);
9688 arg1
= ada_coerce_to_simple_array (arg1
);
9689 arg2
= ada_coerce_to_simple_array (arg2
);
9690 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9691 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9692 error (_("Attempt to compare array with non-array"));
9693 /* FIXME: The following works only for types whose
9694 representations use all bits (no padding or undefined bits)
9695 and do not have user-defined equality. */
9697 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9698 && memcmp (value_contents (arg1
), value_contents (arg2
),
9699 TYPE_LENGTH (value_type (arg1
))) == 0;
9701 return value_equal (arg1
, arg2
);
9704 /* Total number of component associations in the aggregate starting at
9705 index PC in EXP. Assumes that index PC is the start of an
9709 num_component_specs (struct expression
*exp
, int pc
)
9713 m
= exp
->elts
[pc
+ 1].longconst
;
9716 for (i
= 0; i
< m
; i
+= 1)
9718 switch (exp
->elts
[pc
].opcode
)
9724 n
+= exp
->elts
[pc
+ 1].longconst
;
9727 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9732 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9733 component of LHS (a simple array or a record), updating *POS past
9734 the expression, assuming that LHS is contained in CONTAINER. Does
9735 not modify the inferior's memory, nor does it modify LHS (unless
9736 LHS == CONTAINER). */
9739 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9740 struct expression
*exp
, int *pos
)
9742 struct value
*mark
= value_mark ();
9745 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9747 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9748 struct value
*index_val
= value_from_longest (index_type
, index
);
9750 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9754 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9755 elt
= ada_to_fixed_value (elt
);
9758 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9759 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9761 value_assign_to_component (container
, elt
,
9762 ada_evaluate_subexp (NULL
, exp
, pos
,
9765 value_free_to_mark (mark
);
9768 /* Assuming that LHS represents an lvalue having a record or array
9769 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9770 of that aggregate's value to LHS, advancing *POS past the
9771 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9772 lvalue containing LHS (possibly LHS itself). Does not modify
9773 the inferior's memory, nor does it modify the contents of
9774 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9776 static struct value
*
9777 assign_aggregate (struct value
*container
,
9778 struct value
*lhs
, struct expression
*exp
,
9779 int *pos
, enum noside noside
)
9781 struct type
*lhs_type
;
9782 int n
= exp
->elts
[*pos
+1].longconst
;
9783 LONGEST low_index
, high_index
;
9786 int max_indices
, num_indices
;
9790 if (noside
!= EVAL_NORMAL
)
9792 for (i
= 0; i
< n
; i
+= 1)
9793 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9797 container
= ada_coerce_ref (container
);
9798 if (ada_is_direct_array_type (value_type (container
)))
9799 container
= ada_coerce_to_simple_array (container
);
9800 lhs
= ada_coerce_ref (lhs
);
9801 if (!deprecated_value_modifiable (lhs
))
9802 error (_("Left operand of assignment is not a modifiable lvalue."));
9804 lhs_type
= value_type (lhs
);
9805 if (ada_is_direct_array_type (lhs_type
))
9807 lhs
= ada_coerce_to_simple_array (lhs
);
9808 lhs_type
= value_type (lhs
);
9809 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9810 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9812 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9815 high_index
= num_visible_fields (lhs_type
) - 1;
9818 error (_("Left-hand side must be array or record."));
9820 num_specs
= num_component_specs (exp
, *pos
- 3);
9821 max_indices
= 4 * num_specs
+ 4;
9822 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9823 indices
[0] = indices
[1] = low_index
- 1;
9824 indices
[2] = indices
[3] = high_index
+ 1;
9827 for (i
= 0; i
< n
; i
+= 1)
9829 switch (exp
->elts
[*pos
].opcode
)
9832 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9833 &num_indices
, max_indices
,
9834 low_index
, high_index
);
9837 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9838 &num_indices
, max_indices
,
9839 low_index
, high_index
);
9843 error (_("Misplaced 'others' clause"));
9844 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9845 num_indices
, low_index
, high_index
);
9848 error (_("Internal error: bad aggregate clause"));
9855 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9856 construct at *POS, updating *POS past the construct, given that
9857 the positions are relative to lower bound LOW, where HIGH is the
9858 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9859 updating *NUM_INDICES as needed. CONTAINER is as for
9860 assign_aggregate. */
9862 aggregate_assign_positional (struct value
*container
,
9863 struct value
*lhs
, struct expression
*exp
,
9864 int *pos
, LONGEST
*indices
, int *num_indices
,
9865 int max_indices
, LONGEST low
, LONGEST high
)
9867 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9869 if (ind
- 1 == high
)
9870 warning (_("Extra components in aggregate ignored."));
9873 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9875 assign_component (container
, lhs
, ind
, exp
, pos
);
9878 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9881 /* Assign into the components of LHS indexed by the OP_CHOICES
9882 construct at *POS, updating *POS past the construct, given that
9883 the allowable indices are LOW..HIGH. Record the indices assigned
9884 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9885 needed. CONTAINER is as for assign_aggregate. */
9887 aggregate_assign_from_choices (struct value
*container
,
9888 struct value
*lhs
, struct expression
*exp
,
9889 int *pos
, LONGEST
*indices
, int *num_indices
,
9890 int max_indices
, LONGEST low
, LONGEST high
)
9893 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9894 int choice_pos
, expr_pc
;
9895 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9897 choice_pos
= *pos
+= 3;
9899 for (j
= 0; j
< n_choices
; j
+= 1)
9900 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9902 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9904 for (j
= 0; j
< n_choices
; j
+= 1)
9906 LONGEST lower
, upper
;
9907 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9909 if (op
== OP_DISCRETE_RANGE
)
9912 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9914 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9919 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9931 name
= &exp
->elts
[choice_pos
+ 2].string
;
9934 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9937 error (_("Invalid record component association."));
9939 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9941 if (! find_struct_field (name
, value_type (lhs
), 0,
9942 NULL
, NULL
, NULL
, NULL
, &ind
))
9943 error (_("Unknown component name: %s."), name
);
9944 lower
= upper
= ind
;
9947 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9948 error (_("Index in component association out of bounds."));
9950 add_component_interval (lower
, upper
, indices
, num_indices
,
9952 while (lower
<= upper
)
9957 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9963 /* Assign the value of the expression in the OP_OTHERS construct in
9964 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9965 have not been previously assigned. The index intervals already assigned
9966 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9967 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9969 aggregate_assign_others (struct value
*container
,
9970 struct value
*lhs
, struct expression
*exp
,
9971 int *pos
, LONGEST
*indices
, int num_indices
,
9972 LONGEST low
, LONGEST high
)
9975 int expr_pc
= *pos
+ 1;
9977 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9981 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9986 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9989 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9992 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9993 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9994 modifying *SIZE as needed. It is an error if *SIZE exceeds
9995 MAX_SIZE. The resulting intervals do not overlap. */
9997 add_component_interval (LONGEST low
, LONGEST high
,
9998 LONGEST
* indices
, int *size
, int max_size
)
10002 for (i
= 0; i
< *size
; i
+= 2) {
10003 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
10007 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
10008 if (high
< indices
[kh
])
10010 if (low
< indices
[i
])
10012 indices
[i
+ 1] = indices
[kh
- 1];
10013 if (high
> indices
[i
+ 1])
10014 indices
[i
+ 1] = high
;
10015 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
10016 *size
-= kh
- i
- 2;
10019 else if (high
< indices
[i
])
10023 if (*size
== max_size
)
10024 error (_("Internal error: miscounted aggregate components."));
10026 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10027 indices
[j
] = indices
[j
- 2];
10029 indices
[i
+ 1] = high
;
10032 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10035 static struct value
*
10036 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
10038 if (type
== ada_check_typedef (value_type (arg2
)))
10041 if (ada_is_fixed_point_type (type
))
10042 return (cast_to_fixed (type
, arg2
));
10044 if (ada_is_fixed_point_type (value_type (arg2
)))
10045 return cast_from_fixed (type
, arg2
);
10047 return value_cast (type
, arg2
);
10050 /* Evaluating Ada expressions, and printing their result.
10051 ------------------------------------------------------
10056 We usually evaluate an Ada expression in order to print its value.
10057 We also evaluate an expression in order to print its type, which
10058 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10059 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10060 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10061 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10064 Evaluating expressions is a little more complicated for Ada entities
10065 than it is for entities in languages such as C. The main reason for
10066 this is that Ada provides types whose definition might be dynamic.
10067 One example of such types is variant records. Or another example
10068 would be an array whose bounds can only be known at run time.
10070 The following description is a general guide as to what should be
10071 done (and what should NOT be done) in order to evaluate an expression
10072 involving such types, and when. This does not cover how the semantic
10073 information is encoded by GNAT as this is covered separatly. For the
10074 document used as the reference for the GNAT encoding, see exp_dbug.ads
10075 in the GNAT sources.
10077 Ideally, we should embed each part of this description next to its
10078 associated code. Unfortunately, the amount of code is so vast right
10079 now that it's hard to see whether the code handling a particular
10080 situation might be duplicated or not. One day, when the code is
10081 cleaned up, this guide might become redundant with the comments
10082 inserted in the code, and we might want to remove it.
10084 2. ``Fixing'' an Entity, the Simple Case:
10085 -----------------------------------------
10087 When evaluating Ada expressions, the tricky issue is that they may
10088 reference entities whose type contents and size are not statically
10089 known. Consider for instance a variant record:
10091 type Rec (Empty : Boolean := True) is record
10094 when False => Value : Integer;
10097 Yes : Rec := (Empty => False, Value => 1);
10098 No : Rec := (empty => True);
10100 The size and contents of that record depends on the value of the
10101 descriminant (Rec.Empty). At this point, neither the debugging
10102 information nor the associated type structure in GDB are able to
10103 express such dynamic types. So what the debugger does is to create
10104 "fixed" versions of the type that applies to the specific object.
10105 We also informally refer to this opperation as "fixing" an object,
10106 which means creating its associated fixed type.
10108 Example: when printing the value of variable "Yes" above, its fixed
10109 type would look like this:
10116 On the other hand, if we printed the value of "No", its fixed type
10123 Things become a little more complicated when trying to fix an entity
10124 with a dynamic type that directly contains another dynamic type,
10125 such as an array of variant records, for instance. There are
10126 two possible cases: Arrays, and records.
10128 3. ``Fixing'' Arrays:
10129 ---------------------
10131 The type structure in GDB describes an array in terms of its bounds,
10132 and the type of its elements. By design, all elements in the array
10133 have the same type and we cannot represent an array of variant elements
10134 using the current type structure in GDB. When fixing an array,
10135 we cannot fix the array element, as we would potentially need one
10136 fixed type per element of the array. As a result, the best we can do
10137 when fixing an array is to produce an array whose bounds and size
10138 are correct (allowing us to read it from memory), but without having
10139 touched its element type. Fixing each element will be done later,
10140 when (if) necessary.
10142 Arrays are a little simpler to handle than records, because the same
10143 amount of memory is allocated for each element of the array, even if
10144 the amount of space actually used by each element differs from element
10145 to element. Consider for instance the following array of type Rec:
10147 type Rec_Array is array (1 .. 2) of Rec;
10149 The actual amount of memory occupied by each element might be different
10150 from element to element, depending on the value of their discriminant.
10151 But the amount of space reserved for each element in the array remains
10152 fixed regardless. So we simply need to compute that size using
10153 the debugging information available, from which we can then determine
10154 the array size (we multiply the number of elements of the array by
10155 the size of each element).
10157 The simplest case is when we have an array of a constrained element
10158 type. For instance, consider the following type declarations:
10160 type Bounded_String (Max_Size : Integer) is
10162 Buffer : String (1 .. Max_Size);
10164 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10166 In this case, the compiler describes the array as an array of
10167 variable-size elements (identified by its XVS suffix) for which
10168 the size can be read in the parallel XVZ variable.
10170 In the case of an array of an unconstrained element type, the compiler
10171 wraps the array element inside a private PAD type. This type should not
10172 be shown to the user, and must be "unwrap"'ed before printing. Note
10173 that we also use the adjective "aligner" in our code to designate
10174 these wrapper types.
10176 In some cases, the size allocated for each element is statically
10177 known. In that case, the PAD type already has the correct size,
10178 and the array element should remain unfixed.
10180 But there are cases when this size is not statically known.
10181 For instance, assuming that "Five" is an integer variable:
10183 type Dynamic is array (1 .. Five) of Integer;
10184 type Wrapper (Has_Length : Boolean := False) is record
10187 when True => Length : Integer;
10188 when False => null;
10191 type Wrapper_Array is array (1 .. 2) of Wrapper;
10193 Hello : Wrapper_Array := (others => (Has_Length => True,
10194 Data => (others => 17),
10198 The debugging info would describe variable Hello as being an
10199 array of a PAD type. The size of that PAD type is not statically
10200 known, but can be determined using a parallel XVZ variable.
10201 In that case, a copy of the PAD type with the correct size should
10202 be used for the fixed array.
10204 3. ``Fixing'' record type objects:
10205 ----------------------------------
10207 Things are slightly different from arrays in the case of dynamic
10208 record types. In this case, in order to compute the associated
10209 fixed type, we need to determine the size and offset of each of
10210 its components. This, in turn, requires us to compute the fixed
10211 type of each of these components.
10213 Consider for instance the example:
10215 type Bounded_String (Max_Size : Natural) is record
10216 Str : String (1 .. Max_Size);
10219 My_String : Bounded_String (Max_Size => 10);
10221 In that case, the position of field "Length" depends on the size
10222 of field Str, which itself depends on the value of the Max_Size
10223 discriminant. In order to fix the type of variable My_String,
10224 we need to fix the type of field Str. Therefore, fixing a variant
10225 record requires us to fix each of its components.
10227 However, if a component does not have a dynamic size, the component
10228 should not be fixed. In particular, fields that use a PAD type
10229 should not fixed. Here is an example where this might happen
10230 (assuming type Rec above):
10232 type Container (Big : Boolean) is record
10236 when True => Another : Integer;
10237 when False => null;
10240 My_Container : Container := (Big => False,
10241 First => (Empty => True),
10244 In that example, the compiler creates a PAD type for component First,
10245 whose size is constant, and then positions the component After just
10246 right after it. The offset of component After is therefore constant
10249 The debugger computes the position of each field based on an algorithm
10250 that uses, among other things, the actual position and size of the field
10251 preceding it. Let's now imagine that the user is trying to print
10252 the value of My_Container. If the type fixing was recursive, we would
10253 end up computing the offset of field After based on the size of the
10254 fixed version of field First. And since in our example First has
10255 only one actual field, the size of the fixed type is actually smaller
10256 than the amount of space allocated to that field, and thus we would
10257 compute the wrong offset of field After.
10259 To make things more complicated, we need to watch out for dynamic
10260 components of variant records (identified by the ___XVL suffix in
10261 the component name). Even if the target type is a PAD type, the size
10262 of that type might not be statically known. So the PAD type needs
10263 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10264 we might end up with the wrong size for our component. This can be
10265 observed with the following type declarations:
10267 type Octal is new Integer range 0 .. 7;
10268 type Octal_Array is array (Positive range <>) of Octal;
10269 pragma Pack (Octal_Array);
10271 type Octal_Buffer (Size : Positive) is record
10272 Buffer : Octal_Array (1 .. Size);
10276 In that case, Buffer is a PAD type whose size is unset and needs
10277 to be computed by fixing the unwrapped type.
10279 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10280 ----------------------------------------------------------
10282 Lastly, when should the sub-elements of an entity that remained unfixed
10283 thus far, be actually fixed?
10285 The answer is: Only when referencing that element. For instance
10286 when selecting one component of a record, this specific component
10287 should be fixed at that point in time. Or when printing the value
10288 of a record, each component should be fixed before its value gets
10289 printed. Similarly for arrays, the element of the array should be
10290 fixed when printing each element of the array, or when extracting
10291 one element out of that array. On the other hand, fixing should
10292 not be performed on the elements when taking a slice of an array!
10294 Note that one of the side-effects of miscomputing the offset and
10295 size of each field is that we end up also miscomputing the size
10296 of the containing type. This can have adverse results when computing
10297 the value of an entity. GDB fetches the value of an entity based
10298 on the size of its type, and thus a wrong size causes GDB to fetch
10299 the wrong amount of memory. In the case where the computed size is
10300 too small, GDB fetches too little data to print the value of our
10301 entiry. Results in this case as unpredicatble, as we usually read
10302 past the buffer containing the data =:-o. */
10304 /* Implement the evaluate_exp routine in the exp_descriptor structure
10305 for the Ada language. */
10307 static struct value
*
10308 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10309 int *pos
, enum noside noside
)
10311 enum exp_opcode op
;
10315 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10318 struct value
**argvec
;
10322 op
= exp
->elts
[pc
].opcode
;
10328 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10330 if (noside
== EVAL_NORMAL
)
10331 arg1
= unwrap_value (arg1
);
10333 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10334 then we need to perform the conversion manually, because
10335 evaluate_subexp_standard doesn't do it. This conversion is
10336 necessary in Ada because the different kinds of float/fixed
10337 types in Ada have different representations.
10339 Similarly, we need to perform the conversion from OP_LONG
10341 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10342 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
10348 struct value
*result
;
10351 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10352 /* The result type will have code OP_STRING, bashed there from
10353 OP_ARRAY. Bash it back. */
10354 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
10355 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
10361 type
= exp
->elts
[pc
+ 1].type
;
10362 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
10363 if (noside
== EVAL_SKIP
)
10365 arg1
= ada_value_cast (type
, arg1
, noside
);
10370 type
= exp
->elts
[pc
+ 1].type
;
10371 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10374 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10375 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10377 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10378 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10380 return ada_value_assign (arg1
, arg1
);
10382 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10383 except if the lhs of our assignment is a convenience variable.
10384 In the case of assigning to a convenience variable, the lhs
10385 should be exactly the result of the evaluation of the rhs. */
10386 type
= value_type (arg1
);
10387 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10389 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10390 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10392 if (ada_is_fixed_point_type (value_type (arg1
)))
10393 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10394 else if (ada_is_fixed_point_type (value_type (arg2
)))
10396 (_("Fixed-point values must be assigned to fixed-point variables"));
10398 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10399 return ada_value_assign (arg1
, arg2
);
10402 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10403 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10404 if (noside
== EVAL_SKIP
)
10406 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10407 return (value_from_longest
10408 (value_type (arg1
),
10409 value_as_long (arg1
) + value_as_long (arg2
)));
10410 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10411 return (value_from_longest
10412 (value_type (arg2
),
10413 value_as_long (arg1
) + value_as_long (arg2
)));
10414 if ((ada_is_fixed_point_type (value_type (arg1
))
10415 || ada_is_fixed_point_type (value_type (arg2
)))
10416 && value_type (arg1
) != value_type (arg2
))
10417 error (_("Operands of fixed-point addition must have the same type"));
10418 /* Do the addition, and cast the result to the type of the first
10419 argument. We cannot cast the result to a reference type, so if
10420 ARG1 is a reference type, find its underlying type. */
10421 type
= value_type (arg1
);
10422 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10423 type
= TYPE_TARGET_TYPE (type
);
10424 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10425 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10428 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10429 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10430 if (noside
== EVAL_SKIP
)
10432 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10433 return (value_from_longest
10434 (value_type (arg1
),
10435 value_as_long (arg1
) - value_as_long (arg2
)));
10436 if (TYPE_CODE (value_type (arg2
)) == TYPE_CODE_PTR
)
10437 return (value_from_longest
10438 (value_type (arg2
),
10439 value_as_long (arg1
) - value_as_long (arg2
)));
10440 if ((ada_is_fixed_point_type (value_type (arg1
))
10441 || ada_is_fixed_point_type (value_type (arg2
)))
10442 && value_type (arg1
) != value_type (arg2
))
10443 error (_("Operands of fixed-point subtraction "
10444 "must have the same type"));
10445 /* Do the substraction, and cast the result to the type of the first
10446 argument. We cannot cast the result to a reference type, so if
10447 ARG1 is a reference type, find its underlying type. */
10448 type
= value_type (arg1
);
10449 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10450 type
= TYPE_TARGET_TYPE (type
);
10451 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10452 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10458 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10459 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10460 if (noside
== EVAL_SKIP
)
10462 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10464 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10465 return value_zero (value_type (arg1
), not_lval
);
10469 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10470 if (ada_is_fixed_point_type (value_type (arg1
)))
10471 arg1
= cast_from_fixed (type
, arg1
);
10472 if (ada_is_fixed_point_type (value_type (arg2
)))
10473 arg2
= cast_from_fixed (type
, arg2
);
10474 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10475 return ada_value_binop (arg1
, arg2
, op
);
10479 case BINOP_NOTEQUAL
:
10480 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10481 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10482 if (noside
== EVAL_SKIP
)
10484 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10488 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10489 tem
= ada_value_equal (arg1
, arg2
);
10491 if (op
== BINOP_NOTEQUAL
)
10493 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10494 return value_from_longest (type
, (LONGEST
) tem
);
10497 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10498 if (noside
== EVAL_SKIP
)
10500 else if (ada_is_fixed_point_type (value_type (arg1
)))
10501 return value_cast (value_type (arg1
), value_neg (arg1
));
10504 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10505 return value_neg (arg1
);
10508 case BINOP_LOGICAL_AND
:
10509 case BINOP_LOGICAL_OR
:
10510 case UNOP_LOGICAL_NOT
:
10515 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10516 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10517 return value_cast (type
, val
);
10520 case BINOP_BITWISE_AND
:
10521 case BINOP_BITWISE_IOR
:
10522 case BINOP_BITWISE_XOR
:
10526 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10528 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10530 return value_cast (value_type (arg1
), val
);
10536 if (noside
== EVAL_SKIP
)
10542 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10543 /* Only encountered when an unresolved symbol occurs in a
10544 context other than a function call, in which case, it is
10546 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10547 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10549 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10551 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10552 /* Check to see if this is a tagged type. We also need to handle
10553 the case where the type is a reference to a tagged type, but
10554 we have to be careful to exclude pointers to tagged types.
10555 The latter should be shown as usual (as a pointer), whereas
10556 a reference should mostly be transparent to the user. */
10557 if (ada_is_tagged_type (type
, 0)
10558 || (TYPE_CODE (type
) == TYPE_CODE_REF
10559 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10561 /* Tagged types are a little special in the fact that the real
10562 type is dynamic and can only be determined by inspecting the
10563 object's tag. This means that we need to get the object's
10564 value first (EVAL_NORMAL) and then extract the actual object
10567 Note that we cannot skip the final step where we extract
10568 the object type from its tag, because the EVAL_NORMAL phase
10569 results in dynamic components being resolved into fixed ones.
10570 This can cause problems when trying to print the type
10571 description of tagged types whose parent has a dynamic size:
10572 We use the type name of the "_parent" component in order
10573 to print the name of the ancestor type in the type description.
10574 If that component had a dynamic size, the resolution into
10575 a fixed type would result in the loss of that type name,
10576 thus preventing us from printing the name of the ancestor
10577 type in the type description. */
10578 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10580 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10582 struct type
*actual_type
;
10584 actual_type
= type_from_tag (ada_value_tag (arg1
));
10585 if (actual_type
== NULL
)
10586 /* If, for some reason, we were unable to determine
10587 the actual type from the tag, then use the static
10588 approximation that we just computed as a fallback.
10589 This can happen if the debugging information is
10590 incomplete, for instance. */
10591 actual_type
= type
;
10592 return value_zero (actual_type
, not_lval
);
10596 /* In the case of a ref, ada_coerce_ref takes care
10597 of determining the actual type. But the evaluation
10598 should return a ref as it should be valid to ask
10599 for its address; so rebuild a ref after coerce. */
10600 arg1
= ada_coerce_ref (arg1
);
10601 return value_ref (arg1
, TYPE_CODE_REF
);
10605 /* Records and unions for which GNAT encodings have been
10606 generated need to be statically fixed as well.
10607 Otherwise, non-static fixing produces a type where
10608 all dynamic properties are removed, which prevents "ptype"
10609 from being able to completely describe the type.
10610 For instance, a case statement in a variant record would be
10611 replaced by the relevant components based on the actual
10612 value of the discriminants. */
10613 if ((TYPE_CODE (type
) == TYPE_CODE_STRUCT
10614 && dynamic_template_type (type
) != NULL
)
10615 || (TYPE_CODE (type
) == TYPE_CODE_UNION
10616 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10619 return value_zero (to_static_fixed_type (type
), not_lval
);
10623 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10624 return ada_to_fixed_value (arg1
);
10629 /* Allocate arg vector, including space for the function to be
10630 called in argvec[0] and a terminating NULL. */
10631 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10632 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10634 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10635 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10636 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10637 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10640 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10641 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10644 if (noside
== EVAL_SKIP
)
10648 if (ada_is_constrained_packed_array_type
10649 (desc_base_type (value_type (argvec
[0]))))
10650 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10651 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10652 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10653 /* This is a packed array that has already been fixed, and
10654 therefore already coerced to a simple array. Nothing further
10657 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
)
10659 /* Make sure we dereference references so that all the code below
10660 feels like it's really handling the referenced value. Wrapping
10661 types (for alignment) may be there, so make sure we strip them as
10663 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10665 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10666 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10667 argvec
[0] = value_addr (argvec
[0]);
10669 type
= ada_check_typedef (value_type (argvec
[0]));
10671 /* Ada allows us to implicitly dereference arrays when subscripting
10672 them. So, if this is an array typedef (encoding use for array
10673 access types encoded as fat pointers), strip it now. */
10674 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10675 type
= ada_typedef_target_type (type
);
10677 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10679 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10681 case TYPE_CODE_FUNC
:
10682 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10684 case TYPE_CODE_ARRAY
:
10686 case TYPE_CODE_STRUCT
:
10687 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10688 argvec
[0] = ada_value_ind (argvec
[0]);
10689 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10692 error (_("cannot subscript or call something of type `%s'"),
10693 ada_type_name (value_type (argvec
[0])));
10698 switch (TYPE_CODE (type
))
10700 case TYPE_CODE_FUNC
:
10701 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10703 if (TYPE_TARGET_TYPE (type
) == NULL
)
10704 error_call_unknown_return_type (NULL
);
10705 return allocate_value (TYPE_TARGET_TYPE (type
));
10707 return call_function_by_hand (argvec
[0], NULL
, nargs
, argvec
+ 1);
10708 case TYPE_CODE_INTERNAL_FUNCTION
:
10709 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10710 /* We don't know anything about what the internal
10711 function might return, but we have to return
10713 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10716 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10717 argvec
[0], nargs
, argvec
+ 1);
10719 case TYPE_CODE_STRUCT
:
10723 arity
= ada_array_arity (type
);
10724 type
= ada_array_element_type (type
, nargs
);
10726 error (_("cannot subscript or call a record"));
10727 if (arity
!= nargs
)
10728 error (_("wrong number of subscripts; expecting %d"), arity
);
10729 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10730 return value_zero (ada_aligned_type (type
), lval_memory
);
10732 unwrap_value (ada_value_subscript
10733 (argvec
[0], nargs
, argvec
+ 1));
10735 case TYPE_CODE_ARRAY
:
10736 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10738 type
= ada_array_element_type (type
, nargs
);
10740 error (_("element type of array unknown"));
10742 return value_zero (ada_aligned_type (type
), lval_memory
);
10745 unwrap_value (ada_value_subscript
10746 (ada_coerce_to_simple_array (argvec
[0]),
10747 nargs
, argvec
+ 1));
10748 case TYPE_CODE_PTR
: /* Pointer to array */
10749 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10751 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10752 type
= ada_array_element_type (type
, nargs
);
10754 error (_("element type of array unknown"));
10756 return value_zero (ada_aligned_type (type
), lval_memory
);
10759 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10760 nargs
, argvec
+ 1));
10763 error (_("Attempt to index or call something other than an "
10764 "array or function"));
10769 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10770 struct value
*low_bound_val
=
10771 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10772 struct value
*high_bound_val
=
10773 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10775 LONGEST high_bound
;
10777 low_bound_val
= coerce_ref (low_bound_val
);
10778 high_bound_val
= coerce_ref (high_bound_val
);
10779 low_bound
= value_as_long (low_bound_val
);
10780 high_bound
= value_as_long (high_bound_val
);
10782 if (noside
== EVAL_SKIP
)
10785 /* If this is a reference to an aligner type, then remove all
10787 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10788 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10789 TYPE_TARGET_TYPE (value_type (array
)) =
10790 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10792 if (ada_is_constrained_packed_array_type (value_type (array
)))
10793 error (_("cannot slice a packed array"));
10795 /* If this is a reference to an array or an array lvalue,
10796 convert to a pointer. */
10797 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10798 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10799 && VALUE_LVAL (array
) == lval_memory
))
10800 array
= value_addr (array
);
10802 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10803 && ada_is_array_descriptor_type (ada_check_typedef
10804 (value_type (array
))))
10805 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10807 array
= ada_coerce_to_simple_array_ptr (array
);
10809 /* If we have more than one level of pointer indirection,
10810 dereference the value until we get only one level. */
10811 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10812 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10814 array
= value_ind (array
);
10816 /* Make sure we really do have an array type before going further,
10817 to avoid a SEGV when trying to get the index type or the target
10818 type later down the road if the debug info generated by
10819 the compiler is incorrect or incomplete. */
10820 if (!ada_is_simple_array_type (value_type (array
)))
10821 error (_("cannot take slice of non-array"));
10823 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10826 struct type
*type0
= ada_check_typedef (value_type (array
));
10828 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10829 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10832 struct type
*arr_type0
=
10833 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10835 return ada_value_slice_from_ptr (array
, arr_type0
,
10836 longest_to_int (low_bound
),
10837 longest_to_int (high_bound
));
10840 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10842 else if (high_bound
< low_bound
)
10843 return empty_array (value_type (array
), low_bound
);
10845 return ada_value_slice (array
, longest_to_int (low_bound
),
10846 longest_to_int (high_bound
));
10849 case UNOP_IN_RANGE
:
10851 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10852 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10854 if (noside
== EVAL_SKIP
)
10857 switch (TYPE_CODE (type
))
10860 lim_warning (_("Membership test incompletely implemented; "
10861 "always returns true"));
10862 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10863 return value_from_longest (type
, (LONGEST
) 1);
10865 case TYPE_CODE_RANGE
:
10866 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10867 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10868 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10869 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10870 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10872 value_from_longest (type
,
10873 (value_less (arg1
, arg3
)
10874 || value_equal (arg1
, arg3
))
10875 && (value_less (arg2
, arg1
)
10876 || value_equal (arg2
, arg1
)));
10879 case BINOP_IN_BOUNDS
:
10881 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10882 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10884 if (noside
== EVAL_SKIP
)
10887 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10889 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10890 return value_zero (type
, not_lval
);
10893 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10895 type
= ada_index_type (value_type (arg2
), tem
, "range");
10897 type
= value_type (arg1
);
10899 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10900 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10902 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10903 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10904 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10906 value_from_longest (type
,
10907 (value_less (arg1
, arg3
)
10908 || value_equal (arg1
, arg3
))
10909 && (value_less (arg2
, arg1
)
10910 || value_equal (arg2
, arg1
)));
10912 case TERNOP_IN_RANGE
:
10913 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10914 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10915 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10917 if (noside
== EVAL_SKIP
)
10920 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10921 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10922 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10924 value_from_longest (type
,
10925 (value_less (arg1
, arg3
)
10926 || value_equal (arg1
, arg3
))
10927 && (value_less (arg2
, arg1
)
10928 || value_equal (arg2
, arg1
)));
10932 case OP_ATR_LENGTH
:
10934 struct type
*type_arg
;
10936 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10938 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10940 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10944 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10948 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10949 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10950 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10953 if (noside
== EVAL_SKIP
)
10956 if (type_arg
== NULL
)
10958 arg1
= ada_coerce_ref (arg1
);
10960 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10961 arg1
= ada_coerce_to_simple_array (arg1
);
10963 if (op
== OP_ATR_LENGTH
)
10964 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10967 type
= ada_index_type (value_type (arg1
), tem
,
10968 ada_attribute_name (op
));
10970 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10973 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10974 return allocate_value (type
);
10978 default: /* Should never happen. */
10979 error (_("unexpected attribute encountered"));
10981 return value_from_longest
10982 (type
, ada_array_bound (arg1
, tem
, 0));
10984 return value_from_longest
10985 (type
, ada_array_bound (arg1
, tem
, 1));
10986 case OP_ATR_LENGTH
:
10987 return value_from_longest
10988 (type
, ada_array_length (arg1
, tem
));
10991 else if (discrete_type_p (type_arg
))
10993 struct type
*range_type
;
10994 const char *name
= ada_type_name (type_arg
);
10997 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10998 range_type
= to_fixed_range_type (type_arg
, NULL
);
10999 if (range_type
== NULL
)
11000 range_type
= type_arg
;
11004 error (_("unexpected attribute encountered"));
11006 return value_from_longest
11007 (range_type
, ada_discrete_type_low_bound (range_type
));
11009 return value_from_longest
11010 (range_type
, ada_discrete_type_high_bound (range_type
));
11011 case OP_ATR_LENGTH
:
11012 error (_("the 'length attribute applies only to array types"));
11015 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
11016 error (_("unimplemented type attribute"));
11021 if (ada_is_constrained_packed_array_type (type_arg
))
11022 type_arg
= decode_constrained_packed_array_type (type_arg
);
11024 if (op
== OP_ATR_LENGTH
)
11025 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11028 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11030 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11033 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11034 return allocate_value (type
);
11039 error (_("unexpected attribute encountered"));
11041 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11042 return value_from_longest (type
, low
);
11044 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11045 return value_from_longest (type
, high
);
11046 case OP_ATR_LENGTH
:
11047 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11048 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11049 return value_from_longest (type
, high
- low
+ 1);
11055 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11056 if (noside
== EVAL_SKIP
)
11059 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11060 return value_zero (ada_tag_type (arg1
), not_lval
);
11062 return ada_value_tag (arg1
);
11066 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11067 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11068 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11069 if (noside
== EVAL_SKIP
)
11071 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11072 return value_zero (value_type (arg1
), not_lval
);
11075 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11076 return value_binop (arg1
, arg2
,
11077 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11080 case OP_ATR_MODULUS
:
11082 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11084 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11085 if (noside
== EVAL_SKIP
)
11088 if (!ada_is_modular_type (type_arg
))
11089 error (_("'modulus must be applied to modular type"));
11091 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11092 ada_modulus (type_arg
));
11097 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11098 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11099 if (noside
== EVAL_SKIP
)
11101 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11102 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11103 return value_zero (type
, not_lval
);
11105 return value_pos_atr (type
, arg1
);
11108 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11109 type
= value_type (arg1
);
11111 /* If the argument is a reference, then dereference its type, since
11112 the user is really asking for the size of the actual object,
11113 not the size of the pointer. */
11114 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
11115 type
= TYPE_TARGET_TYPE (type
);
11117 if (noside
== EVAL_SKIP
)
11119 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11120 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11122 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11123 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11126 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11127 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11128 type
= exp
->elts
[pc
+ 2].type
;
11129 if (noside
== EVAL_SKIP
)
11131 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11132 return value_zero (type
, not_lval
);
11134 return value_val_atr (type
, arg1
);
11137 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11138 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11139 if (noside
== EVAL_SKIP
)
11141 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11142 return value_zero (value_type (arg1
), not_lval
);
11145 /* For integer exponentiation operations,
11146 only promote the first argument. */
11147 if (is_integral_type (value_type (arg2
)))
11148 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11150 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11152 return value_binop (arg1
, arg2
, op
);
11156 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11157 if (noside
== EVAL_SKIP
)
11163 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11164 if (noside
== EVAL_SKIP
)
11166 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11167 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11168 return value_neg (arg1
);
11173 preeval_pos
= *pos
;
11174 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11175 if (noside
== EVAL_SKIP
)
11177 type
= ada_check_typedef (value_type (arg1
));
11178 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11180 if (ada_is_array_descriptor_type (type
))
11181 /* GDB allows dereferencing GNAT array descriptors. */
11183 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11185 if (arrType
== NULL
)
11186 error (_("Attempt to dereference null array pointer."));
11187 return value_at_lazy (arrType
, 0);
11189 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
11190 || TYPE_CODE (type
) == TYPE_CODE_REF
11191 /* In C you can dereference an array to get the 1st elt. */
11192 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
11194 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11195 only be determined by inspecting the object's tag.
11196 This means that we need to evaluate completely the
11197 expression in order to get its type. */
11199 if ((TYPE_CODE (type
) == TYPE_CODE_REF
11200 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
11201 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11203 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11205 type
= value_type (ada_value_ind (arg1
));
11209 type
= to_static_fixed_type
11211 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11213 ada_ensure_varsize_limit (type
);
11214 return value_zero (type
, lval_memory
);
11216 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11218 /* GDB allows dereferencing an int. */
11219 if (expect_type
== NULL
)
11220 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11225 to_static_fixed_type (ada_aligned_type (expect_type
));
11226 return value_zero (expect_type
, lval_memory
);
11230 error (_("Attempt to take contents of a non-pointer value."));
11232 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11233 type
= ada_check_typedef (value_type (arg1
));
11235 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
11236 /* GDB allows dereferencing an int. If we were given
11237 the expect_type, then use that as the target type.
11238 Otherwise, assume that the target type is an int. */
11240 if (expect_type
!= NULL
)
11241 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11244 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11245 (CORE_ADDR
) value_as_address (arg1
));
11248 if (ada_is_array_descriptor_type (type
))
11249 /* GDB allows dereferencing GNAT array descriptors. */
11250 return ada_coerce_to_simple_array (arg1
);
11252 return ada_value_ind (arg1
);
11254 case STRUCTOP_STRUCT
:
11255 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11256 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11257 preeval_pos
= *pos
;
11258 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11259 if (noside
== EVAL_SKIP
)
11261 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11263 struct type
*type1
= value_type (arg1
);
11265 if (ada_is_tagged_type (type1
, 1))
11267 type
= ada_lookup_struct_elt_type (type1
,
11268 &exp
->elts
[pc
+ 2].string
,
11271 /* If the field is not found, check if it exists in the
11272 extension of this object's type. This means that we
11273 need to evaluate completely the expression. */
11277 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11279 arg1
= ada_value_struct_elt (arg1
,
11280 &exp
->elts
[pc
+ 2].string
,
11282 arg1
= unwrap_value (arg1
);
11283 type
= value_type (ada_to_fixed_value (arg1
));
11288 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11291 return value_zero (ada_aligned_type (type
), lval_memory
);
11295 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11296 arg1
= unwrap_value (arg1
);
11297 return ada_to_fixed_value (arg1
);
11301 /* The value is not supposed to be used. This is here to make it
11302 easier to accommodate expressions that contain types. */
11304 if (noside
== EVAL_SKIP
)
11306 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11307 return allocate_value (exp
->elts
[pc
+ 1].type
);
11309 error (_("Attempt to use a type name as an expression"));
11314 case OP_DISCRETE_RANGE
:
11315 case OP_POSITIONAL
:
11317 if (noside
== EVAL_NORMAL
)
11321 error (_("Undefined name, ambiguous name, or renaming used in "
11322 "component association: %s."), &exp
->elts
[pc
+2].string
);
11324 error (_("Aggregates only allowed on the right of an assignment"));
11326 internal_error (__FILE__
, __LINE__
,
11327 _("aggregate apparently mangled"));
11330 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11332 for (tem
= 0; tem
< nargs
; tem
+= 1)
11333 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11338 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
11344 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11345 type name that encodes the 'small and 'delta information.
11346 Otherwise, return NULL. */
11348 static const char *
11349 fixed_type_info (struct type
*type
)
11351 const char *name
= ada_type_name (type
);
11352 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
11354 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11356 const char *tail
= strstr (name
, "___XF_");
11363 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11364 return fixed_type_info (TYPE_TARGET_TYPE (type
));
11369 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11372 ada_is_fixed_point_type (struct type
*type
)
11374 return fixed_type_info (type
) != NULL
;
11377 /* Return non-zero iff TYPE represents a System.Address type. */
11380 ada_is_system_address_type (struct type
*type
)
11382 return (TYPE_NAME (type
)
11383 && strcmp (TYPE_NAME (type
), "system__address") == 0);
11386 /* Assuming that TYPE is the representation of an Ada fixed-point
11387 type, return the target floating-point type to be used to represent
11388 of this type during internal computation. */
11390 static struct type
*
11391 ada_scaling_type (struct type
*type
)
11393 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11396 /* Assuming that TYPE is the representation of an Ada fixed-point
11397 type, return its delta, or NULL if the type is malformed and the
11398 delta cannot be determined. */
11401 ada_delta (struct type
*type
)
11403 const char *encoding
= fixed_type_info (type
);
11404 struct type
*scale_type
= ada_scaling_type (type
);
11406 long long num
, den
;
11408 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11411 return value_binop (value_from_longest (scale_type
, num
),
11412 value_from_longest (scale_type
, den
), BINOP_DIV
);
11415 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11416 factor ('SMALL value) associated with the type. */
11419 ada_scaling_factor (struct type
*type
)
11421 const char *encoding
= fixed_type_info (type
);
11422 struct type
*scale_type
= ada_scaling_type (type
);
11424 long long num0
, den0
, num1
, den1
;
11427 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11428 &num0
, &den0
, &num1
, &den1
);
11431 return value_from_longest (scale_type
, 1);
11433 return value_binop (value_from_longest (scale_type
, num1
),
11434 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11436 return value_binop (value_from_longest (scale_type
, num0
),
11437 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11444 /* Scan STR beginning at position K for a discriminant name, and
11445 return the value of that discriminant field of DVAL in *PX. If
11446 PNEW_K is not null, put the position of the character beyond the
11447 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11448 not alter *PX and *PNEW_K if unsuccessful. */
11451 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11454 static char *bound_buffer
= NULL
;
11455 static size_t bound_buffer_len
= 0;
11456 const char *pstart
, *pend
, *bound
;
11457 struct value
*bound_val
;
11459 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11463 pend
= strstr (pstart
, "__");
11467 k
+= strlen (bound
);
11471 int len
= pend
- pstart
;
11473 /* Strip __ and beyond. */
11474 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11475 strncpy (bound_buffer
, pstart
, len
);
11476 bound_buffer
[len
] = '\0';
11478 bound
= bound_buffer
;
11482 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11483 if (bound_val
== NULL
)
11486 *px
= value_as_long (bound_val
);
11487 if (pnew_k
!= NULL
)
11492 /* Value of variable named NAME in the current environment. If
11493 no such variable found, then if ERR_MSG is null, returns 0, and
11494 otherwise causes an error with message ERR_MSG. */
11496 static struct value
*
11497 get_var_value (const char *name
, const char *err_msg
)
11499 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11501 struct block_symbol
*syms
;
11502 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11503 get_selected_block (0),
11504 VAR_DOMAIN
, &syms
, 1);
11508 if (err_msg
== NULL
)
11511 error (("%s"), err_msg
);
11514 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11517 /* Value of integer variable named NAME in the current environment.
11518 If no such variable is found, returns false. Otherwise, sets VALUE
11519 to the variable's value and returns true. */
11522 get_int_var_value (const char *name
, LONGEST
&value
)
11524 struct value
*var_val
= get_var_value (name
, 0);
11529 value
= value_as_long (var_val
);
11534 /* Return a range type whose base type is that of the range type named
11535 NAME in the current environment, and whose bounds are calculated
11536 from NAME according to the GNAT range encoding conventions.
11537 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11538 corresponding range type from debug information; fall back to using it
11539 if symbol lookup fails. If a new type must be created, allocate it
11540 like ORIG_TYPE was. The bounds information, in general, is encoded
11541 in NAME, the base type given in the named range type. */
11543 static struct type
*
11544 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11547 struct type
*base_type
;
11548 const char *subtype_info
;
11550 gdb_assert (raw_type
!= NULL
);
11551 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11553 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11554 base_type
= TYPE_TARGET_TYPE (raw_type
);
11556 base_type
= raw_type
;
11558 name
= TYPE_NAME (raw_type
);
11559 subtype_info
= strstr (name
, "___XD");
11560 if (subtype_info
== NULL
)
11562 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11563 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11565 if (L
< INT_MIN
|| U
> INT_MAX
)
11568 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11573 static char *name_buf
= NULL
;
11574 static size_t name_len
= 0;
11575 int prefix_len
= subtype_info
- name
;
11578 const char *bounds_str
;
11581 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11582 strncpy (name_buf
, name
, prefix_len
);
11583 name_buf
[prefix_len
] = '\0';
11586 bounds_str
= strchr (subtype_info
, '_');
11589 if (*subtype_info
== 'L')
11591 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11592 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11594 if (bounds_str
[n
] == '_')
11596 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11602 strcpy (name_buf
+ prefix_len
, "___L");
11603 if (!get_int_var_value (name_buf
, L
))
11605 lim_warning (_("Unknown lower bound, using 1."));
11610 if (*subtype_info
== 'U')
11612 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11613 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11618 strcpy (name_buf
+ prefix_len
, "___U");
11619 if (!get_int_var_value (name_buf
, U
))
11621 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11626 type
= create_static_range_type (alloc_type_copy (raw_type
),
11628 TYPE_NAME (type
) = name
;
11633 /* True iff NAME is the name of a range type. */
11636 ada_is_range_type_name (const char *name
)
11638 return (name
!= NULL
&& strstr (name
, "___XD"));
11642 /* Modular types */
11644 /* True iff TYPE is an Ada modular type. */
11647 ada_is_modular_type (struct type
*type
)
11649 struct type
*subranged_type
= get_base_type (type
);
11651 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11652 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11653 && TYPE_UNSIGNED (subranged_type
));
11656 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11659 ada_modulus (struct type
*type
)
11661 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11665 /* Ada exception catchpoint support:
11666 ---------------------------------
11668 We support 3 kinds of exception catchpoints:
11669 . catchpoints on Ada exceptions
11670 . catchpoints on unhandled Ada exceptions
11671 . catchpoints on failed assertions
11673 Exceptions raised during failed assertions, or unhandled exceptions
11674 could perfectly be caught with the general catchpoint on Ada exceptions.
11675 However, we can easily differentiate these two special cases, and having
11676 the option to distinguish these two cases from the rest can be useful
11677 to zero-in on certain situations.
11679 Exception catchpoints are a specialized form of breakpoint,
11680 since they rely on inserting breakpoints inside known routines
11681 of the GNAT runtime. The implementation therefore uses a standard
11682 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11685 Support in the runtime for exception catchpoints have been changed
11686 a few times already, and these changes affect the implementation
11687 of these catchpoints. In order to be able to support several
11688 variants of the runtime, we use a sniffer that will determine
11689 the runtime variant used by the program being debugged. */
11691 /* Ada's standard exceptions.
11693 The Ada 83 standard also defined Numeric_Error. But there so many
11694 situations where it was unclear from the Ada 83 Reference Manual
11695 (RM) whether Constraint_Error or Numeric_Error should be raised,
11696 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11697 Interpretation saying that anytime the RM says that Numeric_Error
11698 should be raised, the implementation may raise Constraint_Error.
11699 Ada 95 went one step further and pretty much removed Numeric_Error
11700 from the list of standard exceptions (it made it a renaming of
11701 Constraint_Error, to help preserve compatibility when compiling
11702 an Ada83 compiler). As such, we do not include Numeric_Error from
11703 this list of standard exceptions. */
11705 static const char *standard_exc
[] = {
11706 "constraint_error",
11712 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11714 /* A structure that describes how to support exception catchpoints
11715 for a given executable. */
11717 struct exception_support_info
11719 /* The name of the symbol to break on in order to insert
11720 a catchpoint on exceptions. */
11721 const char *catch_exception_sym
;
11723 /* The name of the symbol to break on in order to insert
11724 a catchpoint on unhandled exceptions. */
11725 const char *catch_exception_unhandled_sym
;
11727 /* The name of the symbol to break on in order to insert
11728 a catchpoint on failed assertions. */
11729 const char *catch_assert_sym
;
11731 /* Assuming that the inferior just triggered an unhandled exception
11732 catchpoint, this function is responsible for returning the address
11733 in inferior memory where the name of that exception is stored.
11734 Return zero if the address could not be computed. */
11735 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11738 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11739 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11741 /* The following exception support info structure describes how to
11742 implement exception catchpoints with the latest version of the
11743 Ada runtime (as of 2007-03-06). */
11745 static const struct exception_support_info default_exception_support_info
=
11747 "__gnat_debug_raise_exception", /* catch_exception_sym */
11748 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11749 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11750 ada_unhandled_exception_name_addr
11753 /* The following exception support info structure describes how to
11754 implement exception catchpoints with a slightly older version
11755 of the Ada runtime. */
11757 static const struct exception_support_info exception_support_info_fallback
=
11759 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11760 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11761 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11762 ada_unhandled_exception_name_addr_from_raise
11765 /* Return nonzero if we can detect the exception support routines
11766 described in EINFO.
11768 This function errors out if an abnormal situation is detected
11769 (for instance, if we find the exception support routines, but
11770 that support is found to be incomplete). */
11773 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11775 struct symbol
*sym
;
11777 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11778 that should be compiled with debugging information. As a result, we
11779 expect to find that symbol in the symtabs. */
11781 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11784 /* Perhaps we did not find our symbol because the Ada runtime was
11785 compiled without debugging info, or simply stripped of it.
11786 It happens on some GNU/Linux distributions for instance, where
11787 users have to install a separate debug package in order to get
11788 the runtime's debugging info. In that situation, let the user
11789 know why we cannot insert an Ada exception catchpoint.
11791 Note: Just for the purpose of inserting our Ada exception
11792 catchpoint, we could rely purely on the associated minimal symbol.
11793 But we would be operating in degraded mode anyway, since we are
11794 still lacking the debugging info needed later on to extract
11795 the name of the exception being raised (this name is printed in
11796 the catchpoint message, and is also used when trying to catch
11797 a specific exception). We do not handle this case for now. */
11798 struct bound_minimal_symbol msym
11799 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11801 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11802 error (_("Your Ada runtime appears to be missing some debugging "
11803 "information.\nCannot insert Ada exception catchpoint "
11804 "in this configuration."));
11809 /* Make sure that the symbol we found corresponds to a function. */
11811 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11812 error (_("Symbol \"%s\" is not a function (class = %d)"),
11813 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11818 /* Inspect the Ada runtime and determine which exception info structure
11819 should be used to provide support for exception catchpoints.
11821 This function will always set the per-inferior exception_info,
11822 or raise an error. */
11825 ada_exception_support_info_sniffer (void)
11827 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11829 /* If the exception info is already known, then no need to recompute it. */
11830 if (data
->exception_info
!= NULL
)
11833 /* Check the latest (default) exception support info. */
11834 if (ada_has_this_exception_support (&default_exception_support_info
))
11836 data
->exception_info
= &default_exception_support_info
;
11840 /* Try our fallback exception suport info. */
11841 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11843 data
->exception_info
= &exception_support_info_fallback
;
11847 /* Sometimes, it is normal for us to not be able to find the routine
11848 we are looking for. This happens when the program is linked with
11849 the shared version of the GNAT runtime, and the program has not been
11850 started yet. Inform the user of these two possible causes if
11853 if (ada_update_initial_language (language_unknown
) != language_ada
)
11854 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11856 /* If the symbol does not exist, then check that the program is
11857 already started, to make sure that shared libraries have been
11858 loaded. If it is not started, this may mean that the symbol is
11859 in a shared library. */
11861 if (ptid_get_pid (inferior_ptid
) == 0)
11862 error (_("Unable to insert catchpoint. Try to start the program first."));
11864 /* At this point, we know that we are debugging an Ada program and
11865 that the inferior has been started, but we still are not able to
11866 find the run-time symbols. That can mean that we are in
11867 configurable run time mode, or that a-except as been optimized
11868 out by the linker... In any case, at this point it is not worth
11869 supporting this feature. */
11871 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11874 /* True iff FRAME is very likely to be that of a function that is
11875 part of the runtime system. This is all very heuristic, but is
11876 intended to be used as advice as to what frames are uninteresting
11880 is_known_support_routine (struct frame_info
*frame
)
11882 enum language func_lang
;
11884 const char *fullname
;
11886 /* If this code does not have any debugging information (no symtab),
11887 This cannot be any user code. */
11889 symtab_and_line sal
= find_frame_sal (frame
);
11890 if (sal
.symtab
== NULL
)
11893 /* If there is a symtab, but the associated source file cannot be
11894 located, then assume this is not user code: Selecting a frame
11895 for which we cannot display the code would not be very helpful
11896 for the user. This should also take care of case such as VxWorks
11897 where the kernel has some debugging info provided for a few units. */
11899 fullname
= symtab_to_fullname (sal
.symtab
);
11900 if (access (fullname
, R_OK
) != 0)
11903 /* Check the unit filename againt the Ada runtime file naming.
11904 We also check the name of the objfile against the name of some
11905 known system libraries that sometimes come with debugging info
11908 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11910 re_comp (known_runtime_file_name_patterns
[i
]);
11911 if (re_exec (lbasename (sal
.symtab
->filename
)))
11913 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
11914 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
11918 /* Check whether the function is a GNAT-generated entity. */
11920 gdb::unique_xmalloc_ptr
<char> func_name
11921 = find_frame_funname (frame
, &func_lang
, NULL
);
11922 if (func_name
== NULL
)
11925 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11927 re_comp (known_auxiliary_function_name_patterns
[i
]);
11928 if (re_exec (func_name
.get ()))
11935 /* Find the first frame that contains debugging information and that is not
11936 part of the Ada run-time, starting from FI and moving upward. */
11939 ada_find_printable_frame (struct frame_info
*fi
)
11941 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11943 if (!is_known_support_routine (fi
))
11952 /* Assuming that the inferior just triggered an unhandled exception
11953 catchpoint, return the address in inferior memory where the name
11954 of the exception is stored.
11956 Return zero if the address could not be computed. */
11959 ada_unhandled_exception_name_addr (void)
11961 return parse_and_eval_address ("e.full_name");
11964 /* Same as ada_unhandled_exception_name_addr, except that this function
11965 should be used when the inferior uses an older version of the runtime,
11966 where the exception name needs to be extracted from a specific frame
11967 several frames up in the callstack. */
11970 ada_unhandled_exception_name_addr_from_raise (void)
11973 struct frame_info
*fi
;
11974 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11976 /* To determine the name of this exception, we need to select
11977 the frame corresponding to RAISE_SYM_NAME. This frame is
11978 at least 3 levels up, so we simply skip the first 3 frames
11979 without checking the name of their associated function. */
11980 fi
= get_current_frame ();
11981 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11983 fi
= get_prev_frame (fi
);
11987 enum language func_lang
;
11989 gdb::unique_xmalloc_ptr
<char> func_name
11990 = find_frame_funname (fi
, &func_lang
, NULL
);
11991 if (func_name
!= NULL
)
11993 if (strcmp (func_name
.get (),
11994 data
->exception_info
->catch_exception_sym
) == 0)
11995 break; /* We found the frame we were looking for... */
11996 fi
= get_prev_frame (fi
);
12004 return parse_and_eval_address ("id.full_name");
12007 /* Assuming the inferior just triggered an Ada exception catchpoint
12008 (of any type), return the address in inferior memory where the name
12009 of the exception is stored, if applicable.
12011 Assumes the selected frame is the current frame.
12013 Return zero if the address could not be computed, or if not relevant. */
12016 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12017 struct breakpoint
*b
)
12019 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12023 case ada_catch_exception
:
12024 return (parse_and_eval_address ("e.full_name"));
12027 case ada_catch_exception_unhandled
:
12028 return data
->exception_info
->unhandled_exception_name_addr ();
12031 case ada_catch_assert
:
12032 return 0; /* Exception name is not relevant in this case. */
12036 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12040 return 0; /* Should never be reached. */
12043 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12044 any error that ada_exception_name_addr_1 might cause to be thrown.
12045 When an error is intercepted, a warning with the error message is printed,
12046 and zero is returned. */
12049 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12050 struct breakpoint
*b
)
12052 CORE_ADDR result
= 0;
12056 result
= ada_exception_name_addr_1 (ex
, b
);
12059 CATCH (e
, RETURN_MASK_ERROR
)
12061 warning (_("failed to get exception name: %s"), e
.message
);
12069 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
12071 /* Ada catchpoints.
12073 In the case of catchpoints on Ada exceptions, the catchpoint will
12074 stop the target on every exception the program throws. When a user
12075 specifies the name of a specific exception, we translate this
12076 request into a condition expression (in text form), and then parse
12077 it into an expression stored in each of the catchpoint's locations.
12078 We then use this condition to check whether the exception that was
12079 raised is the one the user is interested in. If not, then the
12080 target is resumed again. We store the name of the requested
12081 exception, in order to be able to re-set the condition expression
12082 when symbols change. */
12084 /* An instance of this type is used to represent an Ada catchpoint
12085 breakpoint location. */
12087 class ada_catchpoint_location
: public bp_location
12090 ada_catchpoint_location (const bp_location_ops
*ops
, breakpoint
*owner
)
12091 : bp_location (ops
, owner
)
12094 /* The condition that checks whether the exception that was raised
12095 is the specific exception the user specified on catchpoint
12097 expression_up excep_cond_expr
;
12100 /* Implement the DTOR method in the bp_location_ops structure for all
12101 Ada exception catchpoint kinds. */
12104 ada_catchpoint_location_dtor (struct bp_location
*bl
)
12106 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
12108 al
->excep_cond_expr
.reset ();
12111 /* The vtable to be used in Ada catchpoint locations. */
12113 static const struct bp_location_ops ada_catchpoint_location_ops
=
12115 ada_catchpoint_location_dtor
12118 /* An instance of this type is used to represent an Ada catchpoint. */
12120 struct ada_catchpoint
: public breakpoint
12122 ~ada_catchpoint () override
;
12124 /* The name of the specific exception the user specified. */
12125 char *excep_string
;
12128 /* Parse the exception condition string in the context of each of the
12129 catchpoint's locations, and store them for later evaluation. */
12132 create_excep_cond_exprs (struct ada_catchpoint
*c
)
12134 struct cleanup
*old_chain
;
12135 struct bp_location
*bl
;
12138 /* Nothing to do if there's no specific exception to catch. */
12139 if (c
->excep_string
== NULL
)
12142 /* Same if there are no locations... */
12143 if (c
->loc
== NULL
)
12146 /* Compute the condition expression in text form, from the specific
12147 expection we want to catch. */
12148 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
12149 old_chain
= make_cleanup (xfree
, cond_string
);
12151 /* Iterate over all the catchpoint's locations, and parse an
12152 expression for each. */
12153 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12155 struct ada_catchpoint_location
*ada_loc
12156 = (struct ada_catchpoint_location
*) bl
;
12159 if (!bl
->shlib_disabled
)
12166 exp
= parse_exp_1 (&s
, bl
->address
,
12167 block_for_pc (bl
->address
),
12170 CATCH (e
, RETURN_MASK_ERROR
)
12172 warning (_("failed to reevaluate internal exception condition "
12173 "for catchpoint %d: %s"),
12174 c
->number
, e
.message
);
12179 ada_loc
->excep_cond_expr
= std::move (exp
);
12182 do_cleanups (old_chain
);
12185 /* ada_catchpoint destructor. */
12187 ada_catchpoint::~ada_catchpoint ()
12189 xfree (this->excep_string
);
12192 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12193 structure for all exception catchpoint kinds. */
12195 static struct bp_location
*
12196 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
12197 struct breakpoint
*self
)
12199 return new ada_catchpoint_location (&ada_catchpoint_location_ops
, self
);
12202 /* Implement the RE_SET method in the breakpoint_ops structure for all
12203 exception catchpoint kinds. */
12206 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
12208 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12210 /* Call the base class's method. This updates the catchpoint's
12212 bkpt_breakpoint_ops
.re_set (b
);
12214 /* Reparse the exception conditional expressions. One for each
12216 create_excep_cond_exprs (c
);
12219 /* Returns true if we should stop for this breakpoint hit. If the
12220 user specified a specific exception, we only want to cause a stop
12221 if the program thrown that exception. */
12224 should_stop_exception (const struct bp_location
*bl
)
12226 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12227 const struct ada_catchpoint_location
*ada_loc
12228 = (const struct ada_catchpoint_location
*) bl
;
12231 /* With no specific exception, should always stop. */
12232 if (c
->excep_string
== NULL
)
12235 if (ada_loc
->excep_cond_expr
== NULL
)
12237 /* We will have a NULL expression if back when we were creating
12238 the expressions, this location's had failed to parse. */
12245 struct value
*mark
;
12247 mark
= value_mark ();
12248 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12249 value_free_to_mark (mark
);
12251 CATCH (ex
, RETURN_MASK_ALL
)
12253 exception_fprintf (gdb_stderr
, ex
,
12254 _("Error in testing exception condition:\n"));
12261 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12262 for all exception catchpoint kinds. */
12265 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12267 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12270 /* Implement the PRINT_IT method in the breakpoint_ops structure
12271 for all exception catchpoint kinds. */
12273 static enum print_stop_action
12274 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
12276 struct ui_out
*uiout
= current_uiout
;
12277 struct breakpoint
*b
= bs
->breakpoint_at
;
12279 annotate_catchpoint (b
->number
);
12281 if (uiout
->is_mi_like_p ())
12283 uiout
->field_string ("reason",
12284 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12285 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12288 uiout
->text (b
->disposition
== disp_del
12289 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12290 uiout
->field_int ("bkptno", b
->number
);
12291 uiout
->text (", ");
12293 /* ada_exception_name_addr relies on the selected frame being the
12294 current frame. Need to do this here because this function may be
12295 called more than once when printing a stop, and below, we'll
12296 select the first frame past the Ada run-time (see
12297 ada_find_printable_frame). */
12298 select_frame (get_current_frame ());
12302 case ada_catch_exception
:
12303 case ada_catch_exception_unhandled
:
12305 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
12306 char exception_name
[256];
12310 read_memory (addr
, (gdb_byte
*) exception_name
,
12311 sizeof (exception_name
) - 1);
12312 exception_name
[sizeof (exception_name
) - 1] = '\0';
12316 /* For some reason, we were unable to read the exception
12317 name. This could happen if the Runtime was compiled
12318 without debugging info, for instance. In that case,
12319 just replace the exception name by the generic string
12320 "exception" - it will read as "an exception" in the
12321 notification we are about to print. */
12322 memcpy (exception_name
, "exception", sizeof ("exception"));
12324 /* In the case of unhandled exception breakpoints, we print
12325 the exception name as "unhandled EXCEPTION_NAME", to make
12326 it clearer to the user which kind of catchpoint just got
12327 hit. We used ui_out_text to make sure that this extra
12328 info does not pollute the exception name in the MI case. */
12329 if (ex
== ada_catch_exception_unhandled
)
12330 uiout
->text ("unhandled ");
12331 uiout
->field_string ("exception-name", exception_name
);
12334 case ada_catch_assert
:
12335 /* In this case, the name of the exception is not really
12336 important. Just print "failed assertion" to make it clearer
12337 that his program just hit an assertion-failure catchpoint.
12338 We used ui_out_text because this info does not belong in
12340 uiout
->text ("failed assertion");
12343 uiout
->text (" at ");
12344 ada_find_printable_frame (get_current_frame ());
12346 return PRINT_SRC_AND_LOC
;
12349 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12350 for all exception catchpoint kinds. */
12353 print_one_exception (enum ada_exception_catchpoint_kind ex
,
12354 struct breakpoint
*b
, struct bp_location
**last_loc
)
12356 struct ui_out
*uiout
= current_uiout
;
12357 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12358 struct value_print_options opts
;
12360 get_user_print_options (&opts
);
12361 if (opts
.addressprint
)
12363 annotate_field (4);
12364 uiout
->field_core_addr ("addr", b
->loc
->gdbarch
, b
->loc
->address
);
12367 annotate_field (5);
12368 *last_loc
= b
->loc
;
12371 case ada_catch_exception
:
12372 if (c
->excep_string
!= NULL
)
12374 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12376 uiout
->field_string ("what", msg
);
12380 uiout
->field_string ("what", "all Ada exceptions");
12384 case ada_catch_exception_unhandled
:
12385 uiout
->field_string ("what", "unhandled Ada exceptions");
12388 case ada_catch_assert
:
12389 uiout
->field_string ("what", "failed Ada assertions");
12393 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12398 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12399 for all exception catchpoint kinds. */
12402 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12403 struct breakpoint
*b
)
12405 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12406 struct ui_out
*uiout
= current_uiout
;
12408 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12409 : _("Catchpoint "));
12410 uiout
->field_int ("bkptno", b
->number
);
12411 uiout
->text (": ");
12415 case ada_catch_exception
:
12416 if (c
->excep_string
!= NULL
)
12418 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12419 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12421 uiout
->text (info
);
12422 do_cleanups (old_chain
);
12425 uiout
->text (_("all Ada exceptions"));
12428 case ada_catch_exception_unhandled
:
12429 uiout
->text (_("unhandled Ada exceptions"));
12432 case ada_catch_assert
:
12433 uiout
->text (_("failed Ada assertions"));
12437 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12442 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12443 for all exception catchpoint kinds. */
12446 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12447 struct breakpoint
*b
, struct ui_file
*fp
)
12449 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12453 case ada_catch_exception
:
12454 fprintf_filtered (fp
, "catch exception");
12455 if (c
->excep_string
!= NULL
)
12456 fprintf_filtered (fp
, " %s", c
->excep_string
);
12459 case ada_catch_exception_unhandled
:
12460 fprintf_filtered (fp
, "catch exception unhandled");
12463 case ada_catch_assert
:
12464 fprintf_filtered (fp
, "catch assert");
12468 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12470 print_recreate_thread (b
, fp
);
12473 /* Virtual table for "catch exception" breakpoints. */
12475 static struct bp_location
*
12476 allocate_location_catch_exception (struct breakpoint
*self
)
12478 return allocate_location_exception (ada_catch_exception
, self
);
12482 re_set_catch_exception (struct breakpoint
*b
)
12484 re_set_exception (ada_catch_exception
, b
);
12488 check_status_catch_exception (bpstat bs
)
12490 check_status_exception (ada_catch_exception
, bs
);
12493 static enum print_stop_action
12494 print_it_catch_exception (bpstat bs
)
12496 return print_it_exception (ada_catch_exception
, bs
);
12500 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12502 print_one_exception (ada_catch_exception
, b
, last_loc
);
12506 print_mention_catch_exception (struct breakpoint
*b
)
12508 print_mention_exception (ada_catch_exception
, b
);
12512 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12514 print_recreate_exception (ada_catch_exception
, b
, fp
);
12517 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12519 /* Virtual table for "catch exception unhandled" breakpoints. */
12521 static struct bp_location
*
12522 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12524 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12528 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12530 re_set_exception (ada_catch_exception_unhandled
, b
);
12534 check_status_catch_exception_unhandled (bpstat bs
)
12536 check_status_exception (ada_catch_exception_unhandled
, bs
);
12539 static enum print_stop_action
12540 print_it_catch_exception_unhandled (bpstat bs
)
12542 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12546 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12547 struct bp_location
**last_loc
)
12549 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12553 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12555 print_mention_exception (ada_catch_exception_unhandled
, b
);
12559 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12560 struct ui_file
*fp
)
12562 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12565 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12567 /* Virtual table for "catch assert" breakpoints. */
12569 static struct bp_location
*
12570 allocate_location_catch_assert (struct breakpoint
*self
)
12572 return allocate_location_exception (ada_catch_assert
, self
);
12576 re_set_catch_assert (struct breakpoint
*b
)
12578 re_set_exception (ada_catch_assert
, b
);
12582 check_status_catch_assert (bpstat bs
)
12584 check_status_exception (ada_catch_assert
, bs
);
12587 static enum print_stop_action
12588 print_it_catch_assert (bpstat bs
)
12590 return print_it_exception (ada_catch_assert
, bs
);
12594 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12596 print_one_exception (ada_catch_assert
, b
, last_loc
);
12600 print_mention_catch_assert (struct breakpoint
*b
)
12602 print_mention_exception (ada_catch_assert
, b
);
12606 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12608 print_recreate_exception (ada_catch_assert
, b
, fp
);
12611 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12613 /* Return a newly allocated copy of the first space-separated token
12614 in ARGSP, and then adjust ARGSP to point immediately after that
12617 Return NULL if ARGPS does not contain any more tokens. */
12620 ada_get_next_arg (const char **argsp
)
12622 const char *args
= *argsp
;
12626 args
= skip_spaces (args
);
12627 if (args
[0] == '\0')
12628 return NULL
; /* No more arguments. */
12630 /* Find the end of the current argument. */
12632 end
= skip_to_space (args
);
12634 /* Adjust ARGSP to point to the start of the next argument. */
12638 /* Make a copy of the current argument and return it. */
12640 result
= (char *) xmalloc (end
- args
+ 1);
12641 strncpy (result
, args
, end
- args
);
12642 result
[end
- args
] = '\0';
12647 /* Split the arguments specified in a "catch exception" command.
12648 Set EX to the appropriate catchpoint type.
12649 Set EXCEP_STRING to the name of the specific exception if
12650 specified by the user.
12651 If a condition is found at the end of the arguments, the condition
12652 expression is stored in COND_STRING (memory must be deallocated
12653 after use). Otherwise COND_STRING is set to NULL. */
12656 catch_ada_exception_command_split (const char *args
,
12657 enum ada_exception_catchpoint_kind
*ex
,
12658 char **excep_string
,
12659 char **cond_string
)
12661 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12662 char *exception_name
;
12665 exception_name
= ada_get_next_arg (&args
);
12666 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12668 /* This is not an exception name; this is the start of a condition
12669 expression for a catchpoint on all exceptions. So, "un-get"
12670 this token, and set exception_name to NULL. */
12671 xfree (exception_name
);
12672 exception_name
= NULL
;
12675 make_cleanup (xfree
, exception_name
);
12677 /* Check to see if we have a condition. */
12679 args
= skip_spaces (args
);
12680 if (startswith (args
, "if")
12681 && (isspace (args
[2]) || args
[2] == '\0'))
12684 args
= skip_spaces (args
);
12686 if (args
[0] == '\0')
12687 error (_("Condition missing after `if' keyword"));
12688 cond
= xstrdup (args
);
12689 make_cleanup (xfree
, cond
);
12691 args
+= strlen (args
);
12694 /* Check that we do not have any more arguments. Anything else
12697 if (args
[0] != '\0')
12698 error (_("Junk at end of expression"));
12700 discard_cleanups (old_chain
);
12702 if (exception_name
== NULL
)
12704 /* Catch all exceptions. */
12705 *ex
= ada_catch_exception
;
12706 *excep_string
= NULL
;
12708 else if (strcmp (exception_name
, "unhandled") == 0)
12710 /* Catch unhandled exceptions. */
12711 *ex
= ada_catch_exception_unhandled
;
12712 *excep_string
= NULL
;
12716 /* Catch a specific exception. */
12717 *ex
= ada_catch_exception
;
12718 *excep_string
= exception_name
;
12720 *cond_string
= cond
;
12723 /* Return the name of the symbol on which we should break in order to
12724 implement a catchpoint of the EX kind. */
12726 static const char *
12727 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12729 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12731 gdb_assert (data
->exception_info
!= NULL
);
12735 case ada_catch_exception
:
12736 return (data
->exception_info
->catch_exception_sym
);
12738 case ada_catch_exception_unhandled
:
12739 return (data
->exception_info
->catch_exception_unhandled_sym
);
12741 case ada_catch_assert
:
12742 return (data
->exception_info
->catch_assert_sym
);
12745 internal_error (__FILE__
, __LINE__
,
12746 _("unexpected catchpoint kind (%d)"), ex
);
12750 /* Return the breakpoint ops "virtual table" used for catchpoints
12753 static const struct breakpoint_ops
*
12754 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12758 case ada_catch_exception
:
12759 return (&catch_exception_breakpoint_ops
);
12761 case ada_catch_exception_unhandled
:
12762 return (&catch_exception_unhandled_breakpoint_ops
);
12764 case ada_catch_assert
:
12765 return (&catch_assert_breakpoint_ops
);
12768 internal_error (__FILE__
, __LINE__
,
12769 _("unexpected catchpoint kind (%d)"), ex
);
12773 /* Return the condition that will be used to match the current exception
12774 being raised with the exception that the user wants to catch. This
12775 assumes that this condition is used when the inferior just triggered
12776 an exception catchpoint.
12778 The string returned is a newly allocated string that needs to be
12779 deallocated later. */
12782 ada_exception_catchpoint_cond_string (const char *excep_string
)
12786 /* The standard exceptions are a special case. They are defined in
12787 runtime units that have been compiled without debugging info; if
12788 EXCEP_STRING is the not-fully-qualified name of a standard
12789 exception (e.g. "constraint_error") then, during the evaluation
12790 of the condition expression, the symbol lookup on this name would
12791 *not* return this standard exception. The catchpoint condition
12792 may then be set only on user-defined exceptions which have the
12793 same not-fully-qualified name (e.g. my_package.constraint_error).
12795 To avoid this unexcepted behavior, these standard exceptions are
12796 systematically prefixed by "standard". This means that "catch
12797 exception constraint_error" is rewritten into "catch exception
12798 standard.constraint_error".
12800 If an exception named contraint_error is defined in another package of
12801 the inferior program, then the only way to specify this exception as a
12802 breakpoint condition is to use its fully-qualified named:
12803 e.g. my_package.constraint_error. */
12805 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12807 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12809 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12813 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12816 /* Return the symtab_and_line that should be used to insert an exception
12817 catchpoint of the TYPE kind.
12819 EXCEP_STRING should contain the name of a specific exception that
12820 the catchpoint should catch, or NULL otherwise.
12822 ADDR_STRING returns the name of the function where the real
12823 breakpoint that implements the catchpoints is set, depending on the
12824 type of catchpoint we need to create. */
12826 static struct symtab_and_line
12827 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12828 const char **addr_string
, const struct breakpoint_ops
**ops
)
12830 const char *sym_name
;
12831 struct symbol
*sym
;
12833 /* First, find out which exception support info to use. */
12834 ada_exception_support_info_sniffer ();
12836 /* Then lookup the function on which we will break in order to catch
12837 the Ada exceptions requested by the user. */
12838 sym_name
= ada_exception_sym_name (ex
);
12839 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12841 /* We can assume that SYM is not NULL at this stage. If the symbol
12842 did not exist, ada_exception_support_info_sniffer would have
12843 raised an exception.
12845 Also, ada_exception_support_info_sniffer should have already
12846 verified that SYM is a function symbol. */
12847 gdb_assert (sym
!= NULL
);
12848 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12850 /* Set ADDR_STRING. */
12851 *addr_string
= xstrdup (sym_name
);
12854 *ops
= ada_exception_breakpoint_ops (ex
);
12856 return find_function_start_sal (sym
, 1);
12859 /* Create an Ada exception catchpoint.
12861 EX_KIND is the kind of exception catchpoint to be created.
12863 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12864 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12865 of the exception to which this catchpoint applies. When not NULL,
12866 the string must be allocated on the heap, and its deallocation
12867 is no longer the responsibility of the caller.
12869 COND_STRING, if not NULL, is the catchpoint condition. This string
12870 must be allocated on the heap, and its deallocation is no longer
12871 the responsibility of the caller.
12873 TEMPFLAG, if nonzero, means that the underlying breakpoint
12874 should be temporary.
12876 FROM_TTY is the usual argument passed to all commands implementations. */
12879 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12880 enum ada_exception_catchpoint_kind ex_kind
,
12881 char *excep_string
,
12887 const char *addr_string
= NULL
;
12888 const struct breakpoint_ops
*ops
= NULL
;
12889 struct symtab_and_line sal
12890 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12892 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint ());
12893 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
,
12894 ops
, tempflag
, disabled
, from_tty
);
12895 c
->excep_string
= excep_string
;
12896 create_excep_cond_exprs (c
.get ());
12897 if (cond_string
!= NULL
)
12898 set_breakpoint_condition (c
.get (), cond_string
, from_tty
);
12899 install_breakpoint (0, std::move (c
), 1);
12902 /* Implement the "catch exception" command. */
12905 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12906 struct cmd_list_element
*command
)
12908 const char *arg
= arg_entry
;
12909 struct gdbarch
*gdbarch
= get_current_arch ();
12911 enum ada_exception_catchpoint_kind ex_kind
;
12912 char *excep_string
= NULL
;
12913 char *cond_string
= NULL
;
12915 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12919 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12921 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12922 excep_string
, cond_string
,
12923 tempflag
, 1 /* enabled */,
12927 /* Split the arguments specified in a "catch assert" command.
12929 ARGS contains the command's arguments (or the empty string if
12930 no arguments were passed).
12932 If ARGS contains a condition, set COND_STRING to that condition
12933 (the memory needs to be deallocated after use). */
12936 catch_ada_assert_command_split (const char *args
, char **cond_string
)
12938 args
= skip_spaces (args
);
12940 /* Check whether a condition was provided. */
12941 if (startswith (args
, "if")
12942 && (isspace (args
[2]) || args
[2] == '\0'))
12945 args
= skip_spaces (args
);
12946 if (args
[0] == '\0')
12947 error (_("condition missing after `if' keyword"));
12948 *cond_string
= xstrdup (args
);
12951 /* Otherwise, there should be no other argument at the end of
12953 else if (args
[0] != '\0')
12954 error (_("Junk at end of arguments."));
12957 /* Implement the "catch assert" command. */
12960 catch_assert_command (const char *arg_entry
, int from_tty
,
12961 struct cmd_list_element
*command
)
12963 const char *arg
= arg_entry
;
12964 struct gdbarch
*gdbarch
= get_current_arch ();
12966 char *cond_string
= NULL
;
12968 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12972 catch_ada_assert_command_split (arg
, &cond_string
);
12973 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12975 tempflag
, 1 /* enabled */,
12979 /* Return non-zero if the symbol SYM is an Ada exception object. */
12982 ada_is_exception_sym (struct symbol
*sym
)
12984 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12986 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12987 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12988 && SYMBOL_CLASS (sym
) != LOC_CONST
12989 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12990 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12993 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12994 Ada exception object. This matches all exceptions except the ones
12995 defined by the Ada language. */
12998 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13002 if (!ada_is_exception_sym (sym
))
13005 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13006 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
13007 return 0; /* A standard exception. */
13009 /* Numeric_Error is also a standard exception, so exclude it.
13010 See the STANDARD_EXC description for more details as to why
13011 this exception is not listed in that array. */
13012 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
13018 /* A helper function for std::sort, comparing two struct ada_exc_info
13021 The comparison is determined first by exception name, and then
13022 by exception address. */
13025 ada_exc_info::operator< (const ada_exc_info
&other
) const
13029 result
= strcmp (name
, other
.name
);
13032 if (result
== 0 && addr
< other
.addr
)
13038 ada_exc_info::operator== (const ada_exc_info
&other
) const
13040 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13043 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13044 routine, but keeping the first SKIP elements untouched.
13046 All duplicates are also removed. */
13049 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13052 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13053 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13054 exceptions
->end ());
13057 /* Add all exceptions defined by the Ada standard whose name match
13058 a regular expression.
13060 If PREG is not NULL, then this regexp_t object is used to
13061 perform the symbol name matching. Otherwise, no name-based
13062 filtering is performed.
13064 EXCEPTIONS is a vector of exceptions to which matching exceptions
13068 ada_add_standard_exceptions (compiled_regex
*preg
,
13069 std::vector
<ada_exc_info
> *exceptions
)
13073 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13076 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13078 struct bound_minimal_symbol msymbol
13079 = ada_lookup_simple_minsym (standard_exc
[i
]);
13081 if (msymbol
.minsym
!= NULL
)
13083 struct ada_exc_info info
13084 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13086 exceptions
->push_back (info
);
13092 /* Add all Ada exceptions defined locally and accessible from the given
13095 If PREG is not NULL, then this regexp_t object is used to
13096 perform the symbol name matching. Otherwise, no name-based
13097 filtering is performed.
13099 EXCEPTIONS is a vector of exceptions to which matching exceptions
13103 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13104 struct frame_info
*frame
,
13105 std::vector
<ada_exc_info
> *exceptions
)
13107 const struct block
*block
= get_frame_block (frame
, 0);
13111 struct block_iterator iter
;
13112 struct symbol
*sym
;
13114 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13116 switch (SYMBOL_CLASS (sym
))
13123 if (ada_is_exception_sym (sym
))
13125 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
13126 SYMBOL_VALUE_ADDRESS (sym
)};
13128 exceptions
->push_back (info
);
13132 if (BLOCK_FUNCTION (block
) != NULL
)
13134 block
= BLOCK_SUPERBLOCK (block
);
13138 /* Return true if NAME matches PREG or if PREG is NULL. */
13141 name_matches_regex (const char *name
, compiled_regex
*preg
)
13143 return (preg
== NULL
13144 || preg
->exec (ada_decode (name
), 0, NULL
, 0) == 0);
13147 /* Add all exceptions defined globally whose name name match
13148 a regular expression, excluding standard exceptions.
13150 The reason we exclude standard exceptions is that they need
13151 to be handled separately: Standard exceptions are defined inside
13152 a runtime unit which is normally not compiled with debugging info,
13153 and thus usually do not show up in our symbol search. However,
13154 if the unit was in fact built with debugging info, we need to
13155 exclude them because they would duplicate the entry we found
13156 during the special loop that specifically searches for those
13157 standard exceptions.
13159 If PREG is not NULL, then this regexp_t object is used to
13160 perform the symbol name matching. Otherwise, no name-based
13161 filtering is performed.
13163 EXCEPTIONS is a vector of exceptions to which matching exceptions
13167 ada_add_global_exceptions (compiled_regex
*preg
,
13168 std::vector
<ada_exc_info
> *exceptions
)
13170 struct objfile
*objfile
;
13171 struct compunit_symtab
*s
;
13173 /* In Ada, the symbol "search name" is a linkage name, whereas the
13174 regular expression used to do the matching refers to the natural
13175 name. So match against the decoded name. */
13176 expand_symtabs_matching (NULL
,
13177 lookup_name_info::match_any (),
13178 [&] (const char *search_name
)
13180 const char *decoded
= ada_decode (search_name
);
13181 return name_matches_regex (decoded
, preg
);
13186 ALL_COMPUNITS (objfile
, s
)
13188 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13191 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13193 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13194 struct block_iterator iter
;
13195 struct symbol
*sym
;
13197 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13198 if (ada_is_non_standard_exception_sym (sym
)
13199 && name_matches_regex (SYMBOL_NATURAL_NAME (sym
), preg
))
13201 struct ada_exc_info info
13202 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
13204 exceptions
->push_back (info
);
13210 /* Implements ada_exceptions_list with the regular expression passed
13211 as a regex_t, rather than a string.
13213 If not NULL, PREG is used to filter out exceptions whose names
13214 do not match. Otherwise, all exceptions are listed. */
13216 static std::vector
<ada_exc_info
>
13217 ada_exceptions_list_1 (compiled_regex
*preg
)
13219 std::vector
<ada_exc_info
> result
;
13222 /* First, list the known standard exceptions. These exceptions
13223 need to be handled separately, as they are usually defined in
13224 runtime units that have been compiled without debugging info. */
13226 ada_add_standard_exceptions (preg
, &result
);
13228 /* Next, find all exceptions whose scope is local and accessible
13229 from the currently selected frame. */
13231 if (has_stack_frames ())
13233 prev_len
= result
.size ();
13234 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13236 if (result
.size () > prev_len
)
13237 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13240 /* Add all exceptions whose scope is global. */
13242 prev_len
= result
.size ();
13243 ada_add_global_exceptions (preg
, &result
);
13244 if (result
.size () > prev_len
)
13245 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13250 /* Return a vector of ada_exc_info.
13252 If REGEXP is NULL, all exceptions are included in the result.
13253 Otherwise, it should contain a valid regular expression,
13254 and only the exceptions whose names match that regular expression
13255 are included in the result.
13257 The exceptions are sorted in the following order:
13258 - Standard exceptions (defined by the Ada language), in
13259 alphabetical order;
13260 - Exceptions only visible from the current frame, in
13261 alphabetical order;
13262 - Exceptions whose scope is global, in alphabetical order. */
13264 std::vector
<ada_exc_info
>
13265 ada_exceptions_list (const char *regexp
)
13267 if (regexp
== NULL
)
13268 return ada_exceptions_list_1 (NULL
);
13270 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13271 return ada_exceptions_list_1 (®
);
13274 /* Implement the "info exceptions" command. */
13277 info_exceptions_command (const char *regexp
, int from_tty
)
13279 struct gdbarch
*gdbarch
= get_current_arch ();
13281 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13283 if (regexp
!= NULL
)
13285 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13287 printf_filtered (_("All defined Ada exceptions:\n"));
13289 for (const ada_exc_info
&info
: exceptions
)
13290 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13294 /* Information about operators given special treatment in functions
13296 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13298 #define ADA_OPERATORS \
13299 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13300 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13301 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13302 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13303 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13304 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13305 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13306 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13307 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13308 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13309 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13310 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13311 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13312 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13313 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13314 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13315 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13316 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13317 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13320 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13323 switch (exp
->elts
[pc
- 1].opcode
)
13326 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13329 #define OP_DEFN(op, len, args, binop) \
13330 case op: *oplenp = len; *argsp = args; break;
13336 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13341 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13346 /* Implementation of the exp_descriptor method operator_check. */
13349 ada_operator_check (struct expression
*exp
, int pos
,
13350 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13353 const union exp_element
*const elts
= exp
->elts
;
13354 struct type
*type
= NULL
;
13356 switch (elts
[pos
].opcode
)
13358 case UNOP_IN_RANGE
:
13360 type
= elts
[pos
+ 1].type
;
13364 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13367 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13369 if (type
&& TYPE_OBJFILE (type
)
13370 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13376 static const char *
13377 ada_op_name (enum exp_opcode opcode
)
13382 return op_name_standard (opcode
);
13384 #define OP_DEFN(op, len, args, binop) case op: return #op;
13389 return "OP_AGGREGATE";
13391 return "OP_CHOICES";
13397 /* As for operator_length, but assumes PC is pointing at the first
13398 element of the operator, and gives meaningful results only for the
13399 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13402 ada_forward_operator_length (struct expression
*exp
, int pc
,
13403 int *oplenp
, int *argsp
)
13405 switch (exp
->elts
[pc
].opcode
)
13408 *oplenp
= *argsp
= 0;
13411 #define OP_DEFN(op, len, args, binop) \
13412 case op: *oplenp = len; *argsp = args; break;
13418 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13423 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13429 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13431 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13439 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13441 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13446 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13450 /* Ada attributes ('Foo). */
13453 case OP_ATR_LENGTH
:
13457 case OP_ATR_MODULUS
:
13464 case UNOP_IN_RANGE
:
13466 /* XXX: gdb_sprint_host_address, type_sprint */
13467 fprintf_filtered (stream
, _("Type @"));
13468 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13469 fprintf_filtered (stream
, " (");
13470 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13471 fprintf_filtered (stream
, ")");
13473 case BINOP_IN_BOUNDS
:
13474 fprintf_filtered (stream
, " (%d)",
13475 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13477 case TERNOP_IN_RANGE
:
13482 case OP_DISCRETE_RANGE
:
13483 case OP_POSITIONAL
:
13490 char *name
= &exp
->elts
[elt
+ 2].string
;
13491 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13493 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13498 return dump_subexp_body_standard (exp
, stream
, elt
);
13502 for (i
= 0; i
< nargs
; i
+= 1)
13503 elt
= dump_subexp (exp
, stream
, elt
);
13508 /* The Ada extension of print_subexp (q.v.). */
13511 ada_print_subexp (struct expression
*exp
, int *pos
,
13512 struct ui_file
*stream
, enum precedence prec
)
13514 int oplen
, nargs
, i
;
13516 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13518 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13525 print_subexp_standard (exp
, pos
, stream
, prec
);
13529 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13532 case BINOP_IN_BOUNDS
:
13533 /* XXX: sprint_subexp */
13534 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13535 fputs_filtered (" in ", stream
);
13536 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13537 fputs_filtered ("'range", stream
);
13538 if (exp
->elts
[pc
+ 1].longconst
> 1)
13539 fprintf_filtered (stream
, "(%ld)",
13540 (long) exp
->elts
[pc
+ 1].longconst
);
13543 case TERNOP_IN_RANGE
:
13544 if (prec
>= PREC_EQUAL
)
13545 fputs_filtered ("(", stream
);
13546 /* XXX: sprint_subexp */
13547 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13548 fputs_filtered (" in ", stream
);
13549 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13550 fputs_filtered (" .. ", stream
);
13551 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13552 if (prec
>= PREC_EQUAL
)
13553 fputs_filtered (")", stream
);
13558 case OP_ATR_LENGTH
:
13562 case OP_ATR_MODULUS
:
13567 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13569 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13570 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13571 &type_print_raw_options
);
13575 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13576 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13581 for (tem
= 1; tem
< nargs
; tem
+= 1)
13583 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13584 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13586 fputs_filtered (")", stream
);
13591 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13592 fputs_filtered ("'(", stream
);
13593 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13594 fputs_filtered (")", stream
);
13597 case UNOP_IN_RANGE
:
13598 /* XXX: sprint_subexp */
13599 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13600 fputs_filtered (" in ", stream
);
13601 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13602 &type_print_raw_options
);
13605 case OP_DISCRETE_RANGE
:
13606 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13607 fputs_filtered ("..", stream
);
13608 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13612 fputs_filtered ("others => ", stream
);
13613 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13617 for (i
= 0; i
< nargs
-1; i
+= 1)
13620 fputs_filtered ("|", stream
);
13621 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13623 fputs_filtered (" => ", stream
);
13624 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13627 case OP_POSITIONAL
:
13628 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13632 fputs_filtered ("(", stream
);
13633 for (i
= 0; i
< nargs
; i
+= 1)
13636 fputs_filtered (", ", stream
);
13637 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13639 fputs_filtered (")", stream
);
13644 /* Table mapping opcodes into strings for printing operators
13645 and precedences of the operators. */
13647 static const struct op_print ada_op_print_tab
[] = {
13648 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13649 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13650 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13651 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13652 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13653 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13654 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13655 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13656 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13657 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13658 {">", BINOP_GTR
, PREC_ORDER
, 0},
13659 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13660 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13661 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13662 {"+", BINOP_ADD
, PREC_ADD
, 0},
13663 {"-", BINOP_SUB
, PREC_ADD
, 0},
13664 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13665 {"*", BINOP_MUL
, PREC_MUL
, 0},
13666 {"/", BINOP_DIV
, PREC_MUL
, 0},
13667 {"rem", BINOP_REM
, PREC_MUL
, 0},
13668 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13669 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13670 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13671 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13672 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13673 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13674 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13675 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13676 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13677 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13678 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13679 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13682 enum ada_primitive_types
{
13683 ada_primitive_type_int
,
13684 ada_primitive_type_long
,
13685 ada_primitive_type_short
,
13686 ada_primitive_type_char
,
13687 ada_primitive_type_float
,
13688 ada_primitive_type_double
,
13689 ada_primitive_type_void
,
13690 ada_primitive_type_long_long
,
13691 ada_primitive_type_long_double
,
13692 ada_primitive_type_natural
,
13693 ada_primitive_type_positive
,
13694 ada_primitive_type_system_address
,
13695 nr_ada_primitive_types
13699 ada_language_arch_info (struct gdbarch
*gdbarch
,
13700 struct language_arch_info
*lai
)
13702 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13704 lai
->primitive_type_vector
13705 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13708 lai
->primitive_type_vector
[ada_primitive_type_int
]
13709 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13711 lai
->primitive_type_vector
[ada_primitive_type_long
]
13712 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13713 0, "long_integer");
13714 lai
->primitive_type_vector
[ada_primitive_type_short
]
13715 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13716 0, "short_integer");
13717 lai
->string_char_type
13718 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13719 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13720 lai
->primitive_type_vector
[ada_primitive_type_float
]
13721 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13722 "float", gdbarch_float_format (gdbarch
));
13723 lai
->primitive_type_vector
[ada_primitive_type_double
]
13724 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13725 "long_float", gdbarch_double_format (gdbarch
));
13726 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13727 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13728 0, "long_long_integer");
13729 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13730 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13731 "long_long_float", gdbarch_long_double_format (gdbarch
));
13732 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13733 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13735 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13736 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13738 lai
->primitive_type_vector
[ada_primitive_type_void
]
13739 = builtin
->builtin_void
;
13741 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13742 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13744 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13745 = "system__address";
13747 lai
->bool_type_symbol
= NULL
;
13748 lai
->bool_type_default
= builtin
->builtin_bool
;
13751 /* Language vector */
13753 /* Not really used, but needed in the ada_language_defn. */
13756 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13758 ada_emit_char (c
, type
, stream
, quoter
, 1);
13762 parse (struct parser_state
*ps
)
13764 warnings_issued
= 0;
13765 return ada_parse (ps
);
13768 static const struct exp_descriptor ada_exp_descriptor
= {
13770 ada_operator_length
,
13771 ada_operator_check
,
13773 ada_dump_subexp_body
,
13774 ada_evaluate_subexp
13777 /* symbol_name_matcher_ftype adapter for wild_match. */
13780 do_wild_match (const char *symbol_search_name
,
13781 const lookup_name_info
&lookup_name
,
13782 completion_match
*match
)
13784 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13787 /* symbol_name_matcher_ftype adapter for full_match. */
13790 do_full_match (const char *symbol_search_name
,
13791 const lookup_name_info
&lookup_name
,
13792 completion_match
*match
)
13794 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13797 /* Build the Ada lookup name for LOOKUP_NAME. */
13799 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13801 const std::string
&user_name
= lookup_name
.name ();
13803 if (user_name
[0] == '<')
13805 if (user_name
.back () == '>')
13806 m_encoded_name
= user_name
.substr (1, user_name
.size () - 2);
13808 m_encoded_name
= user_name
.substr (1, user_name
.size () - 1);
13809 m_encoded_p
= true;
13810 m_verbatim_p
= true;
13811 m_wild_match_p
= false;
13812 m_standard_p
= false;
13816 m_verbatim_p
= false;
13818 m_encoded_p
= user_name
.find ("__") != std::string::npos
;
13822 const char *folded
= ada_fold_name (user_name
.c_str ());
13823 const char *encoded
= ada_encode_1 (folded
, false);
13824 if (encoded
!= NULL
)
13825 m_encoded_name
= encoded
;
13827 m_encoded_name
= user_name
;
13830 m_encoded_name
= user_name
;
13832 /* Handle the 'package Standard' special case. See description
13833 of m_standard_p. */
13834 if (startswith (m_encoded_name
.c_str (), "standard__"))
13836 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13837 m_standard_p
= true;
13840 m_standard_p
= false;
13842 /* If the name contains a ".", then the user is entering a fully
13843 qualified entity name, and the match must not be done in wild
13844 mode. Similarly, if the user wants to complete what looks
13845 like an encoded name, the match must not be done in wild
13846 mode. Also, in the standard__ special case always do
13847 non-wild matching. */
13849 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13852 && user_name
.find ('.') == std::string::npos
);
13856 /* symbol_name_matcher_ftype method for Ada. This only handles
13857 completion mode. */
13860 ada_symbol_name_matches (const char *symbol_search_name
,
13861 const lookup_name_info
&lookup_name
,
13862 completion_match
*match
)
13864 return lookup_name
.ada ().matches (symbol_search_name
,
13865 lookup_name
.match_type (),
13869 /* Implement the "la_get_symbol_name_matcher" language_defn method for
13872 static symbol_name_matcher_ftype
*
13873 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
13875 if (lookup_name
.completion_mode ())
13876 return ada_symbol_name_matches
;
13879 if (lookup_name
.ada ().wild_match_p ())
13880 return do_wild_match
;
13882 return do_full_match
;
13886 /* Implement the "la_read_var_value" language_defn method for Ada. */
13888 static struct value
*
13889 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
13890 struct frame_info
*frame
)
13892 const struct block
*frame_block
= NULL
;
13893 struct symbol
*renaming_sym
= NULL
;
13895 /* The only case where default_read_var_value is not sufficient
13896 is when VAR is a renaming... */
13898 frame_block
= get_frame_block (frame
, NULL
);
13900 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13901 if (renaming_sym
!= NULL
)
13902 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13904 /* This is a typical case where we expect the default_read_var_value
13905 function to work. */
13906 return default_read_var_value (var
, var_block
, frame
);
13909 static const char *ada_extensions
[] =
13911 ".adb", ".ads", ".a", ".ada", ".dg", NULL
13914 extern const struct language_defn ada_language_defn
= {
13915 "ada", /* Language name */
13919 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13920 that's not quite what this means. */
13922 macro_expansion_no
,
13924 &ada_exp_descriptor
,
13928 ada_printchar
, /* Print a character constant */
13929 ada_printstr
, /* Function to print string constant */
13930 emit_char
, /* Function to print single char (not used) */
13931 ada_print_type
, /* Print a type using appropriate syntax */
13932 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13933 ada_val_print
, /* Print a value using appropriate syntax */
13934 ada_value_print
, /* Print a top-level value */
13935 ada_read_var_value
, /* la_read_var_value */
13936 NULL
, /* Language specific skip_trampoline */
13937 NULL
, /* name_of_this */
13938 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13939 basic_lookup_transparent_type
, /* lookup_transparent_type */
13940 ada_la_decode
, /* Language specific symbol demangler */
13941 ada_sniff_from_mangled_name
,
13942 NULL
, /* Language specific
13943 class_name_from_physname */
13944 ada_op_print_tab
, /* expression operators for printing */
13945 0, /* c-style arrays */
13946 1, /* String lower bound */
13947 ada_get_gdb_completer_word_break_characters
,
13948 ada_collect_symbol_completion_matches
,
13949 ada_language_arch_info
,
13950 ada_print_array_index
,
13951 default_pass_by_reference
,
13953 c_watch_location_expression
,
13954 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
13955 ada_iterate_over_symbols
,
13956 default_search_name_hash
,
13963 /* Command-list for the "set/show ada" prefix command. */
13964 static struct cmd_list_element
*set_ada_list
;
13965 static struct cmd_list_element
*show_ada_list
;
13967 /* Implement the "set ada" prefix command. */
13970 set_ada_command (const char *arg
, int from_tty
)
13972 printf_unfiltered (_(\
13973 "\"set ada\" must be followed by the name of a setting.\n"));
13974 help_list (set_ada_list
, "set ada ", all_commands
, gdb_stdout
);
13977 /* Implement the "show ada" prefix command. */
13980 show_ada_command (const char *args
, int from_tty
)
13982 cmd_show_list (show_ada_list
, from_tty
, "");
13986 initialize_ada_catchpoint_ops (void)
13988 struct breakpoint_ops
*ops
;
13990 initialize_breakpoint_ops ();
13992 ops
= &catch_exception_breakpoint_ops
;
13993 *ops
= bkpt_breakpoint_ops
;
13994 ops
->allocate_location
= allocate_location_catch_exception
;
13995 ops
->re_set
= re_set_catch_exception
;
13996 ops
->check_status
= check_status_catch_exception
;
13997 ops
->print_it
= print_it_catch_exception
;
13998 ops
->print_one
= print_one_catch_exception
;
13999 ops
->print_mention
= print_mention_catch_exception
;
14000 ops
->print_recreate
= print_recreate_catch_exception
;
14002 ops
= &catch_exception_unhandled_breakpoint_ops
;
14003 *ops
= bkpt_breakpoint_ops
;
14004 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
14005 ops
->re_set
= re_set_catch_exception_unhandled
;
14006 ops
->check_status
= check_status_catch_exception_unhandled
;
14007 ops
->print_it
= print_it_catch_exception_unhandled
;
14008 ops
->print_one
= print_one_catch_exception_unhandled
;
14009 ops
->print_mention
= print_mention_catch_exception_unhandled
;
14010 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
14012 ops
= &catch_assert_breakpoint_ops
;
14013 *ops
= bkpt_breakpoint_ops
;
14014 ops
->allocate_location
= allocate_location_catch_assert
;
14015 ops
->re_set
= re_set_catch_assert
;
14016 ops
->check_status
= check_status_catch_assert
;
14017 ops
->print_it
= print_it_catch_assert
;
14018 ops
->print_one
= print_one_catch_assert
;
14019 ops
->print_mention
= print_mention_catch_assert
;
14020 ops
->print_recreate
= print_recreate_catch_assert
;
14023 /* This module's 'new_objfile' observer. */
14026 ada_new_objfile_observer (struct objfile
*objfile
)
14028 ada_clear_symbol_cache ();
14031 /* This module's 'free_objfile' observer. */
14034 ada_free_objfile_observer (struct objfile
*objfile
)
14036 ada_clear_symbol_cache ();
14040 _initialize_ada_language (void)
14042 initialize_ada_catchpoint_ops ();
14044 add_prefix_cmd ("ada", no_class
, set_ada_command
,
14045 _("Prefix command for changing Ada-specfic settings"),
14046 &set_ada_list
, "set ada ", 0, &setlist
);
14048 add_prefix_cmd ("ada", no_class
, show_ada_command
,
14049 _("Generic command for showing Ada-specific settings."),
14050 &show_ada_list
, "show ada ", 0, &showlist
);
14052 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14053 &trust_pad_over_xvs
, _("\
14054 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14055 Show whether an optimization trusting PAD types over XVS types is activated"),
14057 This is related to the encoding used by the GNAT compiler. The debugger\n\
14058 should normally trust the contents of PAD types, but certain older versions\n\
14059 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14060 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14061 work around this bug. It is always safe to turn this option \"off\", but\n\
14062 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14063 this option to \"off\" unless necessary."),
14064 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14066 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14067 &print_signatures
, _("\
14068 Enable or disable the output of formal and return types for functions in the \
14069 overloads selection menu"), _("\
14070 Show whether the output of formal and return types for functions in the \
14071 overloads selection menu is activated"),
14072 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14074 add_catch_command ("exception", _("\
14075 Catch Ada exceptions, when raised.\n\
14076 With an argument, catch only exceptions with the given name."),
14077 catch_ada_exception_command
,
14081 add_catch_command ("assert", _("\
14082 Catch failed Ada assertions, when raised.\n\
14083 With an argument, catch only exceptions with the given name."),
14084 catch_assert_command
,
14089 varsize_limit
= 65536;
14091 add_info ("exceptions", info_exceptions_command
,
14093 List all Ada exception names.\n\
14094 If a regular expression is passed as an argument, only those matching\n\
14095 the regular expression are listed."));
14097 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
14098 _("Set Ada maintenance-related variables."),
14099 &maint_set_ada_cmdlist
, "maintenance set ada ",
14100 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14102 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
14103 _("Show Ada maintenance-related variables"),
14104 &maint_show_ada_cmdlist
, "maintenance show ada ",
14105 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14107 add_setshow_boolean_cmd
14108 ("ignore-descriptive-types", class_maintenance
,
14109 &ada_ignore_descriptive_types_p
,
14110 _("Set whether descriptive types generated by GNAT should be ignored."),
14111 _("Show whether descriptive types generated by GNAT should be ignored."),
14113 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14114 DWARF attribute."),
14115 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14117 obstack_init (&symbol_list_obstack
);
14119 decoded_names_store
= htab_create_alloc
14120 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
14121 NULL
, xcalloc
, xfree
);
14123 /* The ada-lang observers. */
14124 observer_attach_new_objfile (ada_new_objfile_observer
);
14125 observer_attach_free_objfile (ada_free_objfile_observer
);
14126 observer_attach_inferior_exit (ada_inferior_exit
);
14128 /* Setup various context-specific data. */
14130 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
14131 ada_pspace_data_handle
14132 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);