1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2018 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"
51 #include "observable.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 (expression_up *, int *, int,
130 static void replace_operator_with_call (expression_up *, 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 int ada_resolve_function (struct block_symbol *, int,
229 struct value **, int, const char *,
232 static int ada_is_direct_array_type (struct type *);
234 static void ada_language_arch_info (struct gdbarch *,
235 struct language_arch_info *);
237 static struct value *ada_index_struct_field (int, struct value *, int,
240 static struct value *assign_aggregate (struct value *, struct value *,
244 static void aggregate_assign_from_choices (struct value *, struct value *,
246 int *, LONGEST *, int *,
247 int, LONGEST, LONGEST);
249 static void aggregate_assign_positional (struct value *, struct value *,
251 int *, LONGEST *, int *, int,
255 static void aggregate_assign_others (struct value *, struct value *,
257 int *, LONGEST *, int, LONGEST, LONGEST);
260 static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
263 static struct value *ada_evaluate_subexp (struct type *, struct expression *,
266 static void ada_forward_operator_length (struct expression *, int, int *,
269 static struct type *ada_find_any_type (const char *name);
271 static symbol_name_matcher_ftype *ada_get_symbol_name_matcher
272 (const lookup_name_info &lookup_name);
276 /* The result of a symbol lookup to be stored in our symbol cache. */
280 /* The name used to perform the lookup. */
282 /* The namespace used during the lookup. */
284 /* The symbol returned by the lookup, or NULL if no matching symbol
287 /* The block where the symbol was found, or NULL if no matching
289 const struct block *block;
290 /* A pointer to the next entry with the same hash. */
291 struct cache_entry *next;
294 /* The Ada symbol cache, used to store the result of Ada-mode symbol
295 lookups in the course of executing the user's commands.
297 The cache is implemented using a simple, fixed-sized hash.
298 The size is fixed on the grounds that there are not likely to be
299 all that many symbols looked up during any given session, regardless
300 of the size of the symbol table. If we decide to go to a resizable
301 table, let's just use the stuff from libiberty instead. */
303 #define HASH_SIZE 1009
305 struct ada_symbol_cache
307 /* An obstack used to store the entries in our cache. */
308 struct obstack cache_space;
310 /* The root of the hash table used to implement our symbol cache. */
311 struct cache_entry *root[HASH_SIZE];
314 static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache);
316 /* Maximum-sized dynamic type. */
317 static unsigned int varsize_limit;
319 static const char ada_completer_word_break_characters[] =
321 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
323 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
326 /* The name of the symbol to use to get the name of the main subprogram. */
327 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
328 = "__gnat_ada_main_program_name";
330 /* Limit on the number of warnings to raise per expression evaluation. */
331 static int warning_limit = 2;
333 /* Number of warning messages issued; reset to 0 by cleanups after
334 expression evaluation. */
335 static int warnings_issued = 0;
337 static const char *known_runtime_file_name_patterns[] = {
338 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
341 static const char *known_auxiliary_function_name_patterns[] = {
342 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
345 /* Maintenance-related settings for this module. */
347 static struct cmd_list_element *maint_set_ada_cmdlist;
348 static struct cmd_list_element *maint_show_ada_cmdlist;
350 /* Implement the "maintenance set ada" (prefix) command. */
353 maint_set_ada_cmd (const char *args, int from_tty)
355 help_list (maint_set_ada_cmdlist, "maintenance set ada ", all_commands,
359 /* Implement the "maintenance show ada" (prefix) command. */
362 maint_show_ada_cmd (const char *args, int from_tty)
364 cmd_show_list (maint_show_ada_cmdlist, from_tty, "");
367 /* The "maintenance ada set/show ignore-descriptive-type" value. */
369 static int ada_ignore_descriptive_types_p = 0;
371 /* Inferior-specific data. */
373 /* Per-inferior data for this module. */
375 struct ada_inferior_data
377 /* The ada__tags__type_specific_data type, which is used when decoding
378 tagged types. With older versions of GNAT, this type was directly
379 accessible through a component ("tsd") in the object tag. But this
380 is no longer the case, so we cache it for each inferior. */
381 struct type *tsd_type;
383 /* The exception_support_info data. This data is used to determine
384 how to implement support for Ada exception catchpoints in a given
386 const struct exception_support_info *exception_info;
389 /* Our key to this module's inferior data. */
390 static const struct inferior_data *ada_inferior_data;
392 /* A cleanup routine for our inferior data. */
394 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
396 struct ada_inferior_data *data;
398 data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data);
403 /* Return our inferior data for the given inferior (INF).
405 This function always returns a valid pointer to an allocated
406 ada_inferior_data structure. If INF's inferior data has not
407 been previously set, this functions creates a new one with all
408 fields set to zero, sets INF's inferior to it, and then returns
409 a pointer to that newly allocated ada_inferior_data. */
411 static struct ada_inferior_data *
412 get_ada_inferior_data (struct inferior *inf)
414 struct ada_inferior_data *data;
416 data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data);
419 data = XCNEW (struct ada_inferior_data);
420 set_inferior_data (inf, ada_inferior_data, data);
426 /* Perform all necessary cleanups regarding our module's inferior data
427 that is required after the inferior INF just exited. */
430 ada_inferior_exit (struct inferior *inf)
432 ada_inferior_data_cleanup (inf, NULL);
433 set_inferior_data (inf, ada_inferior_data, NULL);
437 /* program-space-specific data. */
439 /* This module's per-program-space data. */
440 struct ada_pspace_data
442 /* The Ada symbol cache. */
443 struct ada_symbol_cache *sym_cache;
446 /* Key to our per-program-space data. */
447 static const struct program_space_data *ada_pspace_data_handle;
449 /* Return this module's data for the given program space (PSPACE).
450 If not is found, add a zero'ed one now.
452 This function always returns a valid object. */
454 static struct ada_pspace_data *
455 get_ada_pspace_data (struct program_space *pspace)
457 struct ada_pspace_data *data;
459 data = ((struct ada_pspace_data *)
460 program_space_data (pspace, ada_pspace_data_handle));
463 data = XCNEW (struct ada_pspace_data);
464 set_program_space_data (pspace, ada_pspace_data_handle, data);
470 /* The cleanup callback for this module's per-program-space data. */
473 ada_pspace_data_cleanup (struct program_space *pspace, void *data)
475 struct ada_pspace_data *pspace_data = (struct ada_pspace_data *) data;
477 if (pspace_data->sym_cache != NULL)
478 ada_free_symbol_cache (pspace_data->sym_cache);
484 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
485 all typedef layers have been peeled. Otherwise, return TYPE.
487 Normally, we really expect a typedef type to only have 1 typedef layer.
488 In other words, we really expect the target type of a typedef type to be
489 a non-typedef type. This is particularly true for Ada units, because
490 the language does not have a typedef vs not-typedef distinction.
491 In that respect, the Ada compiler has been trying to eliminate as many
492 typedef definitions in the debugging information, since they generally
493 do not bring any extra information (we still use typedef under certain
494 circumstances related mostly to the GNAT encoding).
496 Unfortunately, we have seen situations where the debugging information
497 generated by the compiler leads to such multiple typedef layers. For
498 instance, consider the following example with stabs:
500 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
501 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
503 This is an error in the debugging information which causes type
504 pck__float_array___XUP to be defined twice, and the second time,
505 it is defined as a typedef of a typedef.
507 This is on the fringe of legality as far as debugging information is
508 concerned, and certainly unexpected. But it is easy to handle these
509 situations correctly, so we can afford to be lenient in this case. */
512 ada_typedef_target_type (struct type *type)
514 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
515 type = TYPE_TARGET_TYPE (type);
519 /* Given DECODED_NAME a string holding a symbol name in its
520 decoded form (ie using the Ada dotted notation), returns
521 its unqualified name. */
524 ada_unqualified_name (const char *decoded_name)
528 /* If the decoded name starts with '<', it means that the encoded
529 name does not follow standard naming conventions, and thus that
530 it is not your typical Ada symbol name. Trying to unqualify it
531 is therefore pointless and possibly erroneous. */
532 if (decoded_name[0] == '<')
535 result = strrchr (decoded_name, '.');
537 result++; /* Skip the dot... */
539 result = decoded_name;
544 /* Return a string starting with '<', followed by STR, and '>'. */
547 add_angle_brackets (const char *str)
549 return string_printf ("<%s>", str);
553 ada_get_gdb_completer_word_break_characters (void)
555 return ada_completer_word_break_characters;
558 /* Print an array element index using the Ada syntax. */
561 ada_print_array_index (struct value *index_value, struct ui_file *stream,
562 const struct value_print_options *options)
564 LA_VALUE_PRINT (index_value, stream, options);
565 fprintf_filtered (stream, " => ");
568 /* Assuming VECT points to an array of *SIZE objects of size
569 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
570 updating *SIZE as necessary and returning the (new) array. */
573 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
575 if (*size < min_size)
578 if (*size < min_size)
580 vect = xrealloc (vect, *size * element_size);
585 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
586 suffix of FIELD_NAME beginning "___". */
589 field_name_match (const char *field_name, const char *target)
591 int len = strlen (target);
594 (strncmp (field_name, target, len) == 0
595 && (field_name[len] == '\0'
596 || (startswith (field_name + len, "___")
597 && strcmp (field_name + strlen (field_name) - 6,
602 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
603 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
604 and return its index. This function also handles fields whose name
605 have ___ suffixes because the compiler sometimes alters their name
606 by adding such a suffix to represent fields with certain constraints.
607 If the field could not be found, return a negative number if
608 MAYBE_MISSING is set. Otherwise raise an error. */
611 ada_get_field_index (const struct type *type, const char *field_name,
615 struct type *struct_type = check_typedef ((struct type *) type);
617 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
618 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
622 error (_("Unable to find field %s in struct %s. Aborting"),
623 field_name, TYPE_NAME (struct_type));
628 /* The length of the prefix of NAME prior to any "___" suffix. */
631 ada_name_prefix_len (const char *name)
637 const char *p = strstr (name, "___");
640 return strlen (name);
646 /* Return non-zero if SUFFIX is a suffix of STR.
647 Return zero if STR is null. */
650 is_suffix (const char *str, const char *suffix)
657 len2 = strlen (suffix);
658 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
661 /* The contents of value VAL, treated as a value of type TYPE. The
662 result is an lval in memory if VAL is. */
664 static struct value *
665 coerce_unspec_val_to_type (struct value *val, struct type *type)
667 type = ada_check_typedef (type);
668 if (value_type (val) == type)
672 struct value *result;
674 /* Make sure that the object size is not unreasonable before
675 trying to allocate some memory for it. */
676 ada_ensure_varsize_limit (type);
679 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
680 result = allocate_value_lazy (type);
683 result = allocate_value (type);
684 value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type));
686 set_value_component_location (result, val);
687 set_value_bitsize (result, value_bitsize (val));
688 set_value_bitpos (result, value_bitpos (val));
689 set_value_address (result, value_address (val));
694 static const gdb_byte *
695 cond_offset_host (const gdb_byte *valaddr, long offset)
700 return valaddr + offset;
704 cond_offset_target (CORE_ADDR address, long offset)
709 return address + offset;
712 /* Issue a warning (as for the definition of warning in utils.c, but
713 with exactly one argument rather than ...), unless the limit on the
714 number of warnings has passed during the evaluation of the current
717 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
718 provided by "complaint". */
719 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
722 lim_warning (const char *format, ...)
726 va_start (args, format);
727 warnings_issued += 1;
728 if (warnings_issued <= warning_limit)
729 vwarning (format, args);
734 /* Issue an error if the size of an object of type T is unreasonable,
735 i.e. if it would be a bad idea to allocate a value of this type in
739 ada_ensure_varsize_limit (const struct type *type)
741 if (TYPE_LENGTH (type) > varsize_limit)
742 error (_("object size is larger than varsize-limit"));
745 /* Maximum value of a SIZE-byte signed integer type. */
747 max_of_size (int size)
749 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
751 return top_bit | (top_bit - 1);
754 /* Minimum value of a SIZE-byte signed integer type. */
756 min_of_size (int size)
758 return -max_of_size (size) - 1;
761 /* Maximum value of a SIZE-byte unsigned integer type. */
763 umax_of_size (int size)
765 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
767 return top_bit | (top_bit - 1);
770 /* Maximum value of integral type T, as a signed quantity. */
772 max_of_type (struct type *t)
774 if (TYPE_UNSIGNED (t))
775 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
777 return max_of_size (TYPE_LENGTH (t));
780 /* Minimum value of integral type T, as a signed quantity. */
782 min_of_type (struct type *t)
784 if (TYPE_UNSIGNED (t))
787 return min_of_size (TYPE_LENGTH (t));
790 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
792 ada_discrete_type_high_bound (struct type *type)
794 type = resolve_dynamic_type (type, NULL, 0);
795 switch (TYPE_CODE (type))
797 case TYPE_CODE_RANGE:
798 return TYPE_HIGH_BOUND (type);
800 return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1);
805 return max_of_type (type);
807 error (_("Unexpected type in ada_discrete_type_high_bound."));
811 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
813 ada_discrete_type_low_bound (struct type *type)
815 type = resolve_dynamic_type (type, NULL, 0);
816 switch (TYPE_CODE (type))
818 case TYPE_CODE_RANGE:
819 return TYPE_LOW_BOUND (type);
821 return TYPE_FIELD_ENUMVAL (type, 0);
826 return min_of_type (type);
828 error (_("Unexpected type in ada_discrete_type_low_bound."));
832 /* The identity on non-range types. For range types, the underlying
833 non-range scalar type. */
836 get_base_type (struct type *type)
838 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
840 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
842 type = TYPE_TARGET_TYPE (type);
847 /* Return a decoded version of the given VALUE. This means returning
848 a value whose type is obtained by applying all the GNAT-specific
849 encondings, making the resulting type a static but standard description
850 of the initial type. */
853 ada_get_decoded_value (struct value *value)
855 struct type *type = ada_check_typedef (value_type (value));
857 if (ada_is_array_descriptor_type (type)
858 || (ada_is_constrained_packed_array_type (type)
859 && TYPE_CODE (type) != TYPE_CODE_PTR))
861 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */
862 value = ada_coerce_to_simple_array_ptr (value);
864 value = ada_coerce_to_simple_array (value);
867 value = ada_to_fixed_value (value);
872 /* Same as ada_get_decoded_value, but with the given TYPE.
873 Because there is no associated actual value for this type,
874 the resulting type might be a best-effort approximation in
875 the case of dynamic types. */
878 ada_get_decoded_type (struct type *type)
880 type = to_static_fixed_type (type);
881 if (ada_is_constrained_packed_array_type (type))
882 type = ada_coerce_to_simple_array_type (type);
888 /* Language Selection */
890 /* If the main program is in Ada, return language_ada, otherwise return LANG
891 (the main program is in Ada iif the adainit symbol is found). */
894 ada_update_initial_language (enum language lang)
896 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
897 (struct objfile *) NULL).minsym != NULL)
903 /* If the main procedure is written in Ada, then return its name.
904 The result is good until the next call. Return NULL if the main
905 procedure doesn't appear to be in Ada. */
910 struct bound_minimal_symbol msym;
911 static gdb::unique_xmalloc_ptr<char> main_program_name;
913 /* For Ada, the name of the main procedure is stored in a specific
914 string constant, generated by the binder. Look for that symbol,
915 extract its address, and then read that string. If we didn't find
916 that string, then most probably the main procedure is not written
918 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
920 if (msym.minsym != NULL)
922 CORE_ADDR main_program_name_addr;
925 main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym);
926 if (main_program_name_addr == 0)
927 error (_("Invalid address for Ada main program name."));
929 target_read_string (main_program_name_addr, &main_program_name,
934 return main_program_name.get ();
937 /* The main procedure doesn't seem to be in Ada. */
943 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
946 const struct ada_opname_map ada_opname_table[] = {
947 {"Oadd", "\"+\"", BINOP_ADD},
948 {"Osubtract", "\"-\"", BINOP_SUB},
949 {"Omultiply", "\"*\"", BINOP_MUL},
950 {"Odivide", "\"/\"", BINOP_DIV},
951 {"Omod", "\"mod\"", BINOP_MOD},
952 {"Orem", "\"rem\"", BINOP_REM},
953 {"Oexpon", "\"**\"", BINOP_EXP},
954 {"Olt", "\"<\"", BINOP_LESS},
955 {"Ole", "\"<=\"", BINOP_LEQ},
956 {"Ogt", "\">\"", BINOP_GTR},
957 {"Oge", "\">=\"", BINOP_GEQ},
958 {"Oeq", "\"=\"", BINOP_EQUAL},
959 {"One", "\"/=\"", BINOP_NOTEQUAL},
960 {"Oand", "\"and\"", BINOP_BITWISE_AND},
961 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
962 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
963 {"Oconcat", "\"&\"", BINOP_CONCAT},
964 {"Oabs", "\"abs\"", UNOP_ABS},
965 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
966 {"Oadd", "\"+\"", UNOP_PLUS},
967 {"Osubtract", "\"-\"", UNOP_NEG},
971 /* The "encoded" form of DECODED, according to GNAT conventions. The
972 result is valid until the next call to ada_encode. If
973 THROW_ERRORS, throw an error if invalid operator name is found.
974 Otherwise, return NULL in that case. */
977 ada_encode_1 (const char *decoded, bool throw_errors)
979 static char *encoding_buffer = NULL;
980 static size_t encoding_buffer_size = 0;
987 GROW_VECT (encoding_buffer, encoding_buffer_size,
988 2 * strlen (decoded) + 10);
991 for (p = decoded; *p != '\0'; p += 1)
995 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
1000 const struct ada_opname_map *mapping;
1002 for (mapping = ada_opname_table;
1003 mapping->encoded != NULL
1004 && !startswith (p, mapping->decoded); mapping += 1)
1006 if (mapping->encoded == NULL)
1009 error (_("invalid Ada operator name: %s"), p);
1013 strcpy (encoding_buffer + k, mapping->encoded);
1014 k += strlen (mapping->encoded);
1019 encoding_buffer[k] = *p;
1024 encoding_buffer[k] = '\0';
1025 return encoding_buffer;
1028 /* The "encoded" form of DECODED, according to GNAT conventions.
1029 The result is valid until the next call to ada_encode. */
1032 ada_encode (const char *decoded)
1034 return ada_encode_1 (decoded, true);
1037 /* Return NAME folded to lower case, or, if surrounded by single
1038 quotes, unfolded, but with the quotes stripped away. Result good
1042 ada_fold_name (const char *name)
1044 static char *fold_buffer = NULL;
1045 static size_t fold_buffer_size = 0;
1047 int len = strlen (name);
1048 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
1050 if (name[0] == '\'')
1052 strncpy (fold_buffer, name + 1, len - 2);
1053 fold_buffer[len - 2] = '\000';
1059 for (i = 0; i <= len; i += 1)
1060 fold_buffer[i] = tolower (name[i]);
1066 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1069 is_lower_alphanum (const char c)
1071 return (isdigit (c) || (isalpha (c) && islower (c)));
1074 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1075 This function saves in LEN the length of that same symbol name but
1076 without either of these suffixes:
1082 These are suffixes introduced by the compiler for entities such as
1083 nested subprogram for instance, in order to avoid name clashes.
1084 They do not serve any purpose for the debugger. */
1087 ada_remove_trailing_digits (const char *encoded, int *len)
1089 if (*len > 1 && isdigit (encoded[*len - 1]))
1093 while (i > 0 && isdigit (encoded[i]))
1095 if (i >= 0 && encoded[i] == '.')
1097 else if (i >= 0 && encoded[i] == '$')
1099 else if (i >= 2 && startswith (encoded + i - 2, "___"))
1101 else if (i >= 1 && startswith (encoded + i - 1, "__"))
1106 /* Remove the suffix introduced by the compiler for protected object
1110 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
1112 /* Remove trailing N. */
1114 /* Protected entry subprograms are broken into two
1115 separate subprograms: The first one is unprotected, and has
1116 a 'N' suffix; the second is the protected version, and has
1117 the 'P' suffix. The second calls the first one after handling
1118 the protection. Since the P subprograms are internally generated,
1119 we leave these names undecoded, giving the user a clue that this
1120 entity is internal. */
1123 && encoded[*len - 1] == 'N'
1124 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
1128 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1131 ada_remove_Xbn_suffix (const char *encoded, int *len)
1135 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
1138 if (encoded[i] != 'X')
1144 if (isalnum (encoded[i-1]))
1148 /* If ENCODED follows the GNAT entity encoding conventions, then return
1149 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1150 replaced by ENCODED.
1152 The resulting string is valid until the next call of ada_decode.
1153 If the string is unchanged by decoding, the original string pointer
1157 ada_decode (const char *encoded)
1164 static char *decoding_buffer = NULL;
1165 static size_t decoding_buffer_size = 0;
1167 /* With function descriptors on PPC64, the value of a symbol named
1168 ".FN", if it exists, is the entry point of the function "FN". */
1169 if (encoded[0] == '.')
1172 /* The name of the Ada main procedure starts with "_ada_".
1173 This prefix is not part of the decoded name, so skip this part
1174 if we see this prefix. */
1175 if (startswith (encoded, "_ada_"))
1178 /* If the name starts with '_', then it is not a properly encoded
1179 name, so do not attempt to decode it. Similarly, if the name
1180 starts with '<', the name should not be decoded. */
1181 if (encoded[0] == '_' || encoded[0] == '<')
1184 len0 = strlen (encoded);
1186 ada_remove_trailing_digits (encoded, &len0);
1187 ada_remove_po_subprogram_suffix (encoded, &len0);
1189 /* Remove the ___X.* suffix if present. Do not forget to verify that
1190 the suffix is located before the current "end" of ENCODED. We want
1191 to avoid re-matching parts of ENCODED that have previously been
1192 marked as discarded (by decrementing LEN0). */
1193 p = strstr (encoded, "___");
1194 if (p != NULL && p - encoded < len0 - 3)
1202 /* Remove any trailing TKB suffix. It tells us that this symbol
1203 is for the body of a task, but that information does not actually
1204 appear in the decoded name. */
1206 if (len0 > 3 && startswith (encoded + len0 - 3, "TKB"))
1209 /* Remove any trailing TB suffix. The TB suffix is slightly different
1210 from the TKB suffix because it is used for non-anonymous task
1213 if (len0 > 2 && startswith (encoded + len0 - 2, "TB"))
1216 /* Remove trailing "B" suffixes. */
1217 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1219 if (len0 > 1 && startswith (encoded + len0 - 1, "B"))
1222 /* Make decoded big enough for possible expansion by operator name. */
1224 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1225 decoded = decoding_buffer;
1227 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1229 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1232 while ((i >= 0 && isdigit (encoded[i]))
1233 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1235 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1237 else if (encoded[i] == '$')
1241 /* The first few characters that are not alphabetic are not part
1242 of any encoding we use, so we can copy them over verbatim. */
1244 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1245 decoded[j] = encoded[i];
1250 /* Is this a symbol function? */
1251 if (at_start_name && encoded[i] == 'O')
1255 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1257 int op_len = strlen (ada_opname_table[k].encoded);
1258 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1260 && !isalnum (encoded[i + op_len]))
1262 strcpy (decoded + j, ada_opname_table[k].decoded);
1265 j += strlen (ada_opname_table[k].decoded);
1269 if (ada_opname_table[k].encoded != NULL)
1274 /* Replace "TK__" with "__", which will eventually be translated
1275 into "." (just below). */
1277 if (i < len0 - 4 && startswith (encoded + i, "TK__"))
1280 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1281 be translated into "." (just below). These are internal names
1282 generated for anonymous blocks inside which our symbol is nested. */
1284 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1285 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1286 && isdigit (encoded [i+4]))
1290 while (k < len0 && isdigit (encoded[k]))
1291 k++; /* Skip any extra digit. */
1293 /* Double-check that the "__B_{DIGITS}+" sequence we found
1294 is indeed followed by "__". */
1295 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1299 /* Remove _E{DIGITS}+[sb] */
1301 /* Just as for protected object subprograms, there are 2 categories
1302 of subprograms created by the compiler for each entry. The first
1303 one implements the actual entry code, and has a suffix following
1304 the convention above; the second one implements the barrier and
1305 uses the same convention as above, except that the 'E' is replaced
1308 Just as above, we do not decode the name of barrier functions
1309 to give the user a clue that the code he is debugging has been
1310 internally generated. */
1312 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1313 && isdigit (encoded[i+2]))
1317 while (k < len0 && isdigit (encoded[k]))
1321 && (encoded[k] == 'b' || encoded[k] == 's'))
1324 /* Just as an extra precaution, make sure that if this
1325 suffix is followed by anything else, it is a '_'.
1326 Otherwise, we matched this sequence by accident. */
1328 || (k < len0 && encoded[k] == '_'))
1333 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1334 the GNAT front-end in protected object subprograms. */
1337 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1339 /* Backtrack a bit up until we reach either the begining of
1340 the encoded name, or "__". Make sure that we only find
1341 digits or lowercase characters. */
1342 const char *ptr = encoded + i - 1;
1344 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1347 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1351 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1353 /* This is a X[bn]* sequence not separated from the previous
1354 part of the name with a non-alpha-numeric character (in other
1355 words, immediately following an alpha-numeric character), then
1356 verify that it is placed at the end of the encoded name. If
1357 not, then the encoding is not valid and we should abort the
1358 decoding. Otherwise, just skip it, it is used in body-nested
1362 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1366 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1368 /* Replace '__' by '.'. */
1376 /* It's a character part of the decoded name, so just copy it
1378 decoded[j] = encoded[i];
1383 decoded[j] = '\000';
1385 /* Decoded names should never contain any uppercase character.
1386 Double-check this, and abort the decoding if we find one. */
1388 for (i = 0; decoded[i] != '\0'; i += 1)
1389 if (isupper (decoded[i]) || decoded[i] == ' ')
1392 if (strcmp (decoded, encoded) == 0)
1398 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1399 decoded = decoding_buffer;
1400 if (encoded[0] == '<')
1401 strcpy (decoded, encoded);
1403 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1408 /* Table for keeping permanent unique copies of decoded names. Once
1409 allocated, names in this table are never released. While this is a
1410 storage leak, it should not be significant unless there are massive
1411 changes in the set of decoded names in successive versions of a
1412 symbol table loaded during a single session. */
1413 static struct htab *decoded_names_store;
1415 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1416 in the language-specific part of GSYMBOL, if it has not been
1417 previously computed. Tries to save the decoded name in the same
1418 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1419 in any case, the decoded symbol has a lifetime at least that of
1421 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1422 const, but nevertheless modified to a semantically equivalent form
1423 when a decoded name is cached in it. */
1426 ada_decode_symbol (const struct general_symbol_info *arg)
1428 struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg;
1429 const char **resultp =
1430 &gsymbol->language_specific.demangled_name;
1432 if (!gsymbol->ada_mangled)
1434 const char *decoded = ada_decode (gsymbol->name);
1435 struct obstack *obstack = gsymbol->language_specific.obstack;
1437 gsymbol->ada_mangled = 1;
1439 if (obstack != NULL)
1441 = (const char *) obstack_copy0 (obstack, decoded, strlen (decoded));
1444 /* Sometimes, we can't find a corresponding objfile, in
1445 which case, we put the result on the heap. Since we only
1446 decode when needed, we hope this usually does not cause a
1447 significant memory leak (FIXME). */
1449 char **slot = (char **) htab_find_slot (decoded_names_store,
1453 *slot = xstrdup (decoded);
1462 ada_la_decode (const char *encoded, int options)
1464 return xstrdup (ada_decode (encoded));
1467 /* Implement la_sniff_from_mangled_name for Ada. */
1470 ada_sniff_from_mangled_name (const char *mangled, char **out)
1472 const char *demangled = ada_decode (mangled);
1476 if (demangled != mangled && demangled != NULL && demangled[0] != '<')
1478 /* Set the gsymbol language to Ada, but still return 0.
1479 Two reasons for that:
1481 1. For Ada, we prefer computing the symbol's decoded name
1482 on the fly rather than pre-compute it, in order to save
1483 memory (Ada projects are typically very large).
1485 2. There are some areas in the definition of the GNAT
1486 encoding where, with a bit of bad luck, we might be able
1487 to decode a non-Ada symbol, generating an incorrect
1488 demangled name (Eg: names ending with "TB" for instance
1489 are identified as task bodies and so stripped from
1490 the decoded name returned).
1492 Returning 1, here, but not setting *DEMANGLED, helps us get a
1493 little bit of the best of both worlds. Because we're last,
1494 we should not affect any of the other languages that were
1495 able to demangle the symbol before us; we get to correctly
1496 tag Ada symbols as such; and even if we incorrectly tagged a
1497 non-Ada symbol, which should be rare, any routing through the
1498 Ada language should be transparent (Ada tries to behave much
1499 like C/C++ with non-Ada symbols). */
1510 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1511 generated by the GNAT compiler to describe the index type used
1512 for each dimension of an array, check whether it follows the latest
1513 known encoding. If not, fix it up to conform to the latest encoding.
1514 Otherwise, do nothing. This function also does nothing if
1515 INDEX_DESC_TYPE is NULL.
1517 The GNAT encoding used to describle the array index type evolved a bit.
1518 Initially, the information would be provided through the name of each
1519 field of the structure type only, while the type of these fields was
1520 described as unspecified and irrelevant. The debugger was then expected
1521 to perform a global type lookup using the name of that field in order
1522 to get access to the full index type description. Because these global
1523 lookups can be very expensive, the encoding was later enhanced to make
1524 the global lookup unnecessary by defining the field type as being
1525 the full index type description.
1527 The purpose of this routine is to allow us to support older versions
1528 of the compiler by detecting the use of the older encoding, and by
1529 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1530 we essentially replace each field's meaningless type by the associated
1534 ada_fixup_array_indexes_type (struct type *index_desc_type)
1538 if (index_desc_type == NULL)
1540 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1542 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1543 to check one field only, no need to check them all). If not, return
1546 If our INDEX_DESC_TYPE was generated using the older encoding,
1547 the field type should be a meaningless integer type whose name
1548 is not equal to the field name. */
1549 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1550 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1551 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1554 /* Fixup each field of INDEX_DESC_TYPE. */
1555 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1557 const char *name = TYPE_FIELD_NAME (index_desc_type, i);
1558 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1561 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1565 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1567 static const char *bound_name[] = {
1568 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1569 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1572 /* Maximum number of array dimensions we are prepared to handle. */
1574 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1577 /* The desc_* routines return primitive portions of array descriptors
1580 /* The descriptor or array type, if any, indicated by TYPE; removes
1581 level of indirection, if needed. */
1583 static struct type *
1584 desc_base_type (struct type *type)
1588 type = ada_check_typedef (type);
1589 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1590 type = ada_typedef_target_type (type);
1593 && (TYPE_CODE (type) == TYPE_CODE_PTR
1594 || TYPE_CODE (type) == TYPE_CODE_REF))
1595 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1600 /* True iff TYPE indicates a "thin" array pointer type. */
1603 is_thin_pntr (struct type *type)
1606 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1607 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1610 /* The descriptor type for thin pointer type TYPE. */
1612 static struct type *
1613 thin_descriptor_type (struct type *type)
1615 struct type *base_type = desc_base_type (type);
1617 if (base_type == NULL)
1619 if (is_suffix (ada_type_name (base_type), "___XVE"))
1623 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1625 if (alt_type == NULL)
1632 /* A pointer to the array data for thin-pointer value VAL. */
1634 static struct value *
1635 thin_data_pntr (struct value *val)
1637 struct type *type = ada_check_typedef (value_type (val));
1638 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1640 data_type = lookup_pointer_type (data_type);
1642 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1643 return value_cast (data_type, value_copy (val));
1645 return value_from_longest (data_type, value_address (val));
1648 /* True iff TYPE indicates a "thick" array pointer type. */
1651 is_thick_pntr (struct type *type)
1653 type = desc_base_type (type);
1654 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1655 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1658 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1659 pointer to one, the type of its bounds data; otherwise, NULL. */
1661 static struct type *
1662 desc_bounds_type (struct type *type)
1666 type = desc_base_type (type);
1670 else if (is_thin_pntr (type))
1672 type = thin_descriptor_type (type);
1675 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1677 return ada_check_typedef (r);
1679 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1681 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1683 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1688 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1689 one, a pointer to its bounds data. Otherwise NULL. */
1691 static struct value *
1692 desc_bounds (struct value *arr)
1694 struct type *type = ada_check_typedef (value_type (arr));
1696 if (is_thin_pntr (type))
1698 struct type *bounds_type =
1699 desc_bounds_type (thin_descriptor_type (type));
1702 if (bounds_type == NULL)
1703 error (_("Bad GNAT array descriptor"));
1705 /* NOTE: The following calculation is not really kosher, but
1706 since desc_type is an XVE-encoded type (and shouldn't be),
1707 the correct calculation is a real pain. FIXME (and fix GCC). */
1708 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1709 addr = value_as_long (arr);
1711 addr = value_address (arr);
1714 value_from_longest (lookup_pointer_type (bounds_type),
1715 addr - TYPE_LENGTH (bounds_type));
1718 else if (is_thick_pntr (type))
1720 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1721 _("Bad GNAT array descriptor"));
1722 struct type *p_bounds_type = value_type (p_bounds);
1725 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1727 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1729 if (TYPE_STUB (target_type))
1730 p_bounds = value_cast (lookup_pointer_type
1731 (ada_check_typedef (target_type)),
1735 error (_("Bad GNAT array descriptor"));
1743 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1744 position of the field containing the address of the bounds data. */
1747 fat_pntr_bounds_bitpos (struct type *type)
1749 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1752 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1753 size of the field containing the address of the bounds data. */
1756 fat_pntr_bounds_bitsize (struct type *type)
1758 type = desc_base_type (type);
1760 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1761 return TYPE_FIELD_BITSIZE (type, 1);
1763 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1766 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1767 pointer to one, the type of its array data (a array-with-no-bounds type);
1768 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1771 static struct type *
1772 desc_data_target_type (struct type *type)
1774 type = desc_base_type (type);
1776 /* NOTE: The following is bogus; see comment in desc_bounds. */
1777 if (is_thin_pntr (type))
1778 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1779 else if (is_thick_pntr (type))
1781 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1784 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1785 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1791 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1794 static struct value *
1795 desc_data (struct value *arr)
1797 struct type *type = value_type (arr);
1799 if (is_thin_pntr (type))
1800 return thin_data_pntr (arr);
1801 else if (is_thick_pntr (type))
1802 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1803 _("Bad GNAT array descriptor"));
1809 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1810 position of the field containing the address of the data. */
1813 fat_pntr_data_bitpos (struct type *type)
1815 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1818 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1819 size of the field containing the address of the data. */
1822 fat_pntr_data_bitsize (struct type *type)
1824 type = desc_base_type (type);
1826 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1827 return TYPE_FIELD_BITSIZE (type, 0);
1829 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1832 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1833 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1834 bound, if WHICH is 1. The first bound is I=1. */
1836 static struct value *
1837 desc_one_bound (struct value *bounds, int i, int which)
1839 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1840 _("Bad GNAT array descriptor bounds"));
1843 /* If BOUNDS is an array-bounds structure type, return the bit position
1844 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1845 bound, if WHICH is 1. The first bound is I=1. */
1848 desc_bound_bitpos (struct type *type, int i, int which)
1850 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1853 /* If BOUNDS is an array-bounds structure type, return the bit field size
1854 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1855 bound, if WHICH is 1. The first bound is I=1. */
1858 desc_bound_bitsize (struct type *type, int i, int which)
1860 type = desc_base_type (type);
1862 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1863 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1865 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1868 /* If TYPE is the type of an array-bounds structure, the type of its
1869 Ith bound (numbering from 1). Otherwise, NULL. */
1871 static struct type *
1872 desc_index_type (struct type *type, int i)
1874 type = desc_base_type (type);
1876 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1877 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1882 /* The number of index positions in the array-bounds type TYPE.
1883 Return 0 if TYPE is NULL. */
1886 desc_arity (struct type *type)
1888 type = desc_base_type (type);
1891 return TYPE_NFIELDS (type) / 2;
1895 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1896 an array descriptor type (representing an unconstrained array
1900 ada_is_direct_array_type (struct type *type)
1904 type = ada_check_typedef (type);
1905 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1906 || ada_is_array_descriptor_type (type));
1909 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1913 ada_is_array_type (struct type *type)
1916 && (TYPE_CODE (type) == TYPE_CODE_PTR
1917 || TYPE_CODE (type) == TYPE_CODE_REF))
1918 type = TYPE_TARGET_TYPE (type);
1919 return ada_is_direct_array_type (type);
1922 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1925 ada_is_simple_array_type (struct type *type)
1929 type = ada_check_typedef (type);
1930 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1931 || (TYPE_CODE (type) == TYPE_CODE_PTR
1932 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1933 == TYPE_CODE_ARRAY));
1936 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1939 ada_is_array_descriptor_type (struct type *type)
1941 struct type *data_type = desc_data_target_type (type);
1945 type = ada_check_typedef (type);
1946 return (data_type != NULL
1947 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1948 && desc_arity (desc_bounds_type (type)) > 0);
1951 /* Non-zero iff type is a partially mal-formed GNAT array
1952 descriptor. FIXME: This is to compensate for some problems with
1953 debugging output from GNAT. Re-examine periodically to see if it
1957 ada_is_bogus_array_descriptor (struct type *type)
1961 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1962 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1963 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1964 && !ada_is_array_descriptor_type (type);
1968 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1969 (fat pointer) returns the type of the array data described---specifically,
1970 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1971 in from the descriptor; otherwise, they are left unspecified. If
1972 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1973 returns NULL. The result is simply the type of ARR if ARR is not
1976 ada_type_of_array (struct value *arr, int bounds)
1978 if (ada_is_constrained_packed_array_type (value_type (arr)))
1979 return decode_constrained_packed_array_type (value_type (arr));
1981 if (!ada_is_array_descriptor_type (value_type (arr)))
1982 return value_type (arr);
1986 struct type *array_type =
1987 ada_check_typedef (desc_data_target_type (value_type (arr)));
1989 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1990 TYPE_FIELD_BITSIZE (array_type, 0) =
1991 decode_packed_array_bitsize (value_type (arr));
1997 struct type *elt_type;
1999 struct value *descriptor;
2001 elt_type = ada_array_element_type (value_type (arr), -1);
2002 arity = ada_array_arity (value_type (arr));
2004 if (elt_type == NULL || arity == 0)
2005 return ada_check_typedef (value_type (arr));
2007 descriptor = desc_bounds (arr);
2008 if (value_as_long (descriptor) == 0)
2012 struct type *range_type = alloc_type_copy (value_type (arr));
2013 struct type *array_type = alloc_type_copy (value_type (arr));
2014 struct value *low = desc_one_bound (descriptor, arity, 0);
2015 struct value *high = desc_one_bound (descriptor, arity, 1);
2018 create_static_range_type (range_type, value_type (low),
2019 longest_to_int (value_as_long (low)),
2020 longest_to_int (value_as_long (high)));
2021 elt_type = create_array_type (array_type, elt_type, range_type);
2023 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
2025 /* We need to store the element packed bitsize, as well as
2026 recompute the array size, because it was previously
2027 computed based on the unpacked element size. */
2028 LONGEST lo = value_as_long (low);
2029 LONGEST hi = value_as_long (high);
2031 TYPE_FIELD_BITSIZE (elt_type, 0) =
2032 decode_packed_array_bitsize (value_type (arr));
2033 /* If the array has no element, then the size is already
2034 zero, and does not need to be recomputed. */
2038 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
2040 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
2045 return lookup_pointer_type (elt_type);
2049 /* If ARR does not represent an array, returns ARR unchanged.
2050 Otherwise, returns either a standard GDB array with bounds set
2051 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2052 GDB array. Returns NULL if ARR is a null fat pointer. */
2055 ada_coerce_to_simple_array_ptr (struct value *arr)
2057 if (ada_is_array_descriptor_type (value_type (arr)))
2059 struct type *arrType = ada_type_of_array (arr, 1);
2061 if (arrType == NULL)
2063 return value_cast (arrType, value_copy (desc_data (arr)));
2065 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2066 return decode_constrained_packed_array (arr);
2071 /* If ARR does not represent an array, returns ARR unchanged.
2072 Otherwise, returns a standard GDB array describing ARR (which may
2073 be ARR itself if it already is in the proper form). */
2076 ada_coerce_to_simple_array (struct value *arr)
2078 if (ada_is_array_descriptor_type (value_type (arr)))
2080 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
2083 error (_("Bounds unavailable for null array pointer."));
2084 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal)));
2085 return value_ind (arrVal);
2087 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2088 return decode_constrained_packed_array (arr);
2093 /* If TYPE represents a GNAT array type, return it translated to an
2094 ordinary GDB array type (possibly with BITSIZE fields indicating
2095 packing). For other types, is the identity. */
2098 ada_coerce_to_simple_array_type (struct type *type)
2100 if (ada_is_constrained_packed_array_type (type))
2101 return decode_constrained_packed_array_type (type);
2103 if (ada_is_array_descriptor_type (type))
2104 return ada_check_typedef (desc_data_target_type (type));
2109 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2112 ada_is_packed_array_type (struct type *type)
2116 type = desc_base_type (type);
2117 type = ada_check_typedef (type);
2119 ada_type_name (type) != NULL
2120 && strstr (ada_type_name (type), "___XP") != NULL;
2123 /* Non-zero iff TYPE represents a standard GNAT constrained
2124 packed-array type. */
2127 ada_is_constrained_packed_array_type (struct type *type)
2129 return ada_is_packed_array_type (type)
2130 && !ada_is_array_descriptor_type (type);
2133 /* Non-zero iff TYPE represents an array descriptor for a
2134 unconstrained packed-array type. */
2137 ada_is_unconstrained_packed_array_type (struct type *type)
2139 return ada_is_packed_array_type (type)
2140 && ada_is_array_descriptor_type (type);
2143 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2144 return the size of its elements in bits. */
2147 decode_packed_array_bitsize (struct type *type)
2149 const char *raw_name;
2153 /* Access to arrays implemented as fat pointers are encoded as a typedef
2154 of the fat pointer type. We need the name of the fat pointer type
2155 to do the decoding, so strip the typedef layer. */
2156 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
2157 type = ada_typedef_target_type (type);
2159 raw_name = ada_type_name (ada_check_typedef (type));
2161 raw_name = ada_type_name (desc_base_type (type));
2166 tail = strstr (raw_name, "___XP");
2167 gdb_assert (tail != NULL);
2169 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
2172 (_("could not understand bit size information on packed array"));
2179 /* Given that TYPE is a standard GDB array type with all bounds filled
2180 in, and that the element size of its ultimate scalar constituents
2181 (that is, either its elements, or, if it is an array of arrays, its
2182 elements' elements, etc.) is *ELT_BITS, return an identical type,
2183 but with the bit sizes of its elements (and those of any
2184 constituent arrays) recorded in the BITSIZE components of its
2185 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2188 Note that, for arrays whose index type has an XA encoding where
2189 a bound references a record discriminant, getting that discriminant,
2190 and therefore the actual value of that bound, is not possible
2191 because none of the given parameters gives us access to the record.
2192 This function assumes that it is OK in the context where it is being
2193 used to return an array whose bounds are still dynamic and where
2194 the length is arbitrary. */
2196 static struct type *
2197 constrained_packed_array_type (struct type *type, long *elt_bits)
2199 struct type *new_elt_type;
2200 struct type *new_type;
2201 struct type *index_type_desc;
2202 struct type *index_type;
2203 LONGEST low_bound, high_bound;
2205 type = ada_check_typedef (type);
2206 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2209 index_type_desc = ada_find_parallel_type (type, "___XA");
2210 if (index_type_desc)
2211 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0),
2214 index_type = TYPE_INDEX_TYPE (type);
2216 new_type = alloc_type_copy (type);
2218 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2220 create_array_type (new_type, new_elt_type, index_type);
2221 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2222 TYPE_NAME (new_type) = ada_type_name (type);
2224 if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE
2225 && is_dynamic_type (check_typedef (index_type)))
2226 || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0)
2227 low_bound = high_bound = 0;
2228 if (high_bound < low_bound)
2229 *elt_bits = TYPE_LENGTH (new_type) = 0;
2232 *elt_bits *= (high_bound - low_bound + 1);
2233 TYPE_LENGTH (new_type) =
2234 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2237 TYPE_FIXED_INSTANCE (new_type) = 1;
2241 /* The array type encoded by TYPE, where
2242 ada_is_constrained_packed_array_type (TYPE). */
2244 static struct type *
2245 decode_constrained_packed_array_type (struct type *type)
2247 const char *raw_name = ada_type_name (ada_check_typedef (type));
2250 struct type *shadow_type;
2254 raw_name = ada_type_name (desc_base_type (type));
2259 name = (char *) alloca (strlen (raw_name) + 1);
2260 tail = strstr (raw_name, "___XP");
2261 type = desc_base_type (type);
2263 memcpy (name, raw_name, tail - raw_name);
2264 name[tail - raw_name] = '\000';
2266 shadow_type = ada_find_parallel_type_with_name (type, name);
2268 if (shadow_type == NULL)
2270 lim_warning (_("could not find bounds information on packed array"));
2273 shadow_type = check_typedef (shadow_type);
2275 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2277 lim_warning (_("could not understand bounds "
2278 "information on packed array"));
2282 bits = decode_packed_array_bitsize (type);
2283 return constrained_packed_array_type (shadow_type, &bits);
2286 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2287 array, returns a simple array that denotes that array. Its type is a
2288 standard GDB array type except that the BITSIZEs of the array
2289 target types are set to the number of bits in each element, and the
2290 type length is set appropriately. */
2292 static struct value *
2293 decode_constrained_packed_array (struct value *arr)
2297 /* If our value is a pointer, then dereference it. Likewise if
2298 the value is a reference. Make sure that this operation does not
2299 cause the target type to be fixed, as this would indirectly cause
2300 this array to be decoded. The rest of the routine assumes that
2301 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2302 and "value_ind" routines to perform the dereferencing, as opposed
2303 to using "ada_coerce_ref" or "ada_value_ind". */
2304 arr = coerce_ref (arr);
2305 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2306 arr = value_ind (arr);
2308 type = decode_constrained_packed_array_type (value_type (arr));
2311 error (_("can't unpack array"));
2315 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2316 && ada_is_modular_type (value_type (arr)))
2318 /* This is a (right-justified) modular type representing a packed
2319 array with no wrapper. In order to interpret the value through
2320 the (left-justified) packed array type we just built, we must
2321 first left-justify it. */
2322 int bit_size, bit_pos;
2325 mod = ada_modulus (value_type (arr)) - 1;
2332 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2333 arr = ada_value_primitive_packed_val (arr, NULL,
2334 bit_pos / HOST_CHAR_BIT,
2335 bit_pos % HOST_CHAR_BIT,
2340 return coerce_unspec_val_to_type (arr, type);
2344 /* The value of the element of packed array ARR at the ARITY indices
2345 given in IND. ARR must be a simple array. */
2347 static struct value *
2348 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2351 int bits, elt_off, bit_off;
2352 long elt_total_bit_offset;
2353 struct type *elt_type;
2357 elt_total_bit_offset = 0;
2358 elt_type = ada_check_typedef (value_type (arr));
2359 for (i = 0; i < arity; i += 1)
2361 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2362 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2364 (_("attempt to do packed indexing of "
2365 "something other than a packed array"));
2368 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2369 LONGEST lowerbound, upperbound;
2372 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2374 lim_warning (_("don't know bounds of array"));
2375 lowerbound = upperbound = 0;
2378 idx = pos_atr (ind[i]);
2379 if (idx < lowerbound || idx > upperbound)
2380 lim_warning (_("packed array index %ld out of bounds"),
2382 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2383 elt_total_bit_offset += (idx - lowerbound) * bits;
2384 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2387 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2388 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2390 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2395 /* Non-zero iff TYPE includes negative integer values. */
2398 has_negatives (struct type *type)
2400 switch (TYPE_CODE (type))
2405 return !TYPE_UNSIGNED (type);
2406 case TYPE_CODE_RANGE:
2407 return TYPE_LOW_BOUND (type) < 0;
2411 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2412 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2413 the unpacked buffer.
2415 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2416 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2418 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2421 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2423 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2426 ada_unpack_from_contents (const gdb_byte *src, int bit_offset, int bit_size,
2427 gdb_byte *unpacked, int unpacked_len,
2428 int is_big_endian, int is_signed_type,
2431 int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2432 int src_idx; /* Index into the source area */
2433 int src_bytes_left; /* Number of source bytes left to process. */
2434 int srcBitsLeft; /* Number of source bits left to move */
2435 int unusedLS; /* Number of bits in next significant
2436 byte of source that are unused */
2438 int unpacked_idx; /* Index into the unpacked buffer */
2439 int unpacked_bytes_left; /* Number of bytes left to set in unpacked. */
2441 unsigned long accum; /* Staging area for bits being transferred */
2442 int accumSize; /* Number of meaningful bits in accum */
2445 /* Transmit bytes from least to most significant; delta is the direction
2446 the indices move. */
2447 int delta = is_big_endian ? -1 : 1;
2449 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2451 if ((bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT > unpacked_len)
2452 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2453 bit_size, unpacked_len);
2455 srcBitsLeft = bit_size;
2456 src_bytes_left = src_len;
2457 unpacked_bytes_left = unpacked_len;
2462 src_idx = src_len - 1;
2464 && ((src[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2468 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2474 unpacked_idx = unpacked_len - 1;
2478 /* Non-scalar values must be aligned at a byte boundary... */
2480 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2481 /* ... And are placed at the beginning (most-significant) bytes
2483 unpacked_idx = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2484 unpacked_bytes_left = unpacked_idx + 1;
2489 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2491 src_idx = unpacked_idx = 0;
2492 unusedLS = bit_offset;
2495 if (is_signed_type && (src[src_len - 1] & (1 << sign_bit_offset)))
2500 while (src_bytes_left > 0)
2502 /* Mask for removing bits of the next source byte that are not
2503 part of the value. */
2504 unsigned int unusedMSMask =
2505 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2507 /* Sign-extend bits for this byte. */
2508 unsigned int signMask = sign & ~unusedMSMask;
2511 (((src[src_idx] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2512 accumSize += HOST_CHAR_BIT - unusedLS;
2513 if (accumSize >= HOST_CHAR_BIT)
2515 unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT);
2516 accumSize -= HOST_CHAR_BIT;
2517 accum >>= HOST_CHAR_BIT;
2518 unpacked_bytes_left -= 1;
2519 unpacked_idx += delta;
2521 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2523 src_bytes_left -= 1;
2526 while (unpacked_bytes_left > 0)
2528 accum |= sign << accumSize;
2529 unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT);
2530 accumSize -= HOST_CHAR_BIT;
2533 accum >>= HOST_CHAR_BIT;
2534 unpacked_bytes_left -= 1;
2535 unpacked_idx += delta;
2539 /* Create a new value of type TYPE from the contents of OBJ starting
2540 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2541 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2542 assigning through the result will set the field fetched from.
2543 VALADDR is ignored unless OBJ is NULL, in which case,
2544 VALADDR+OFFSET must address the start of storage containing the
2545 packed value. The value returned in this case is never an lval.
2546 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2549 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2550 long offset, int bit_offset, int bit_size,
2554 const gdb_byte *src; /* First byte containing data to unpack */
2556 const int is_scalar = is_scalar_type (type);
2557 const int is_big_endian = gdbarch_bits_big_endian (get_type_arch (type));
2558 gdb::byte_vector staging;
2560 type = ada_check_typedef (type);
2563 src = valaddr + offset;
2565 src = value_contents (obj) + offset;
2567 if (is_dynamic_type (type))
2569 /* The length of TYPE might by dynamic, so we need to resolve
2570 TYPE in order to know its actual size, which we then use
2571 to create the contents buffer of the value we return.
2572 The difficulty is that the data containing our object is
2573 packed, and therefore maybe not at a byte boundary. So, what
2574 we do, is unpack the data into a byte-aligned buffer, and then
2575 use that buffer as our object's value for resolving the type. */
2576 int staging_len = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2577 staging.resize (staging_len);
2579 ada_unpack_from_contents (src, bit_offset, bit_size,
2580 staging.data (), staging.size (),
2581 is_big_endian, has_negatives (type),
2583 type = resolve_dynamic_type (type, staging.data (), 0);
2584 if (TYPE_LENGTH (type) < (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT)
2586 /* This happens when the length of the object is dynamic,
2587 and is actually smaller than the space reserved for it.
2588 For instance, in an array of variant records, the bit_size
2589 we're given is the array stride, which is constant and
2590 normally equal to the maximum size of its element.
2591 But, in reality, each element only actually spans a portion
2593 bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT;
2599 v = allocate_value (type);
2600 src = valaddr + offset;
2602 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2604 int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2607 v = value_at (type, value_address (obj) + offset);
2608 buf = (gdb_byte *) alloca (src_len);
2609 read_memory (value_address (v), buf, src_len);
2614 v = allocate_value (type);
2615 src = value_contents (obj) + offset;
2620 long new_offset = offset;
2622 set_value_component_location (v, obj);
2623 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2624 set_value_bitsize (v, bit_size);
2625 if (value_bitpos (v) >= HOST_CHAR_BIT)
2628 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2630 set_value_offset (v, new_offset);
2632 /* Also set the parent value. This is needed when trying to
2633 assign a new value (in inferior memory). */
2634 set_value_parent (v, obj);
2637 set_value_bitsize (v, bit_size);
2638 unpacked = value_contents_writeable (v);
2642 memset (unpacked, 0, TYPE_LENGTH (type));
2646 if (staging.size () == TYPE_LENGTH (type))
2648 /* Small short-cut: If we've unpacked the data into a buffer
2649 of the same size as TYPE's length, then we can reuse that,
2650 instead of doing the unpacking again. */
2651 memcpy (unpacked, staging.data (), staging.size ());
2654 ada_unpack_from_contents (src, bit_offset, bit_size,
2655 unpacked, TYPE_LENGTH (type),
2656 is_big_endian, has_negatives (type), is_scalar);
2661 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2662 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2665 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2666 int src_offset, int n, int bits_big_endian_p)
2668 unsigned int accum, mask;
2669 int accum_bits, chunk_size;
2671 target += targ_offset / HOST_CHAR_BIT;
2672 targ_offset %= HOST_CHAR_BIT;
2673 source += src_offset / HOST_CHAR_BIT;
2674 src_offset %= HOST_CHAR_BIT;
2675 if (bits_big_endian_p)
2677 accum = (unsigned char) *source;
2679 accum_bits = HOST_CHAR_BIT - src_offset;
2685 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2686 accum_bits += HOST_CHAR_BIT;
2688 chunk_size = HOST_CHAR_BIT - targ_offset;
2691 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2692 mask = ((1 << chunk_size) - 1) << unused_right;
2695 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2697 accum_bits -= chunk_size;
2704 accum = (unsigned char) *source >> src_offset;
2706 accum_bits = HOST_CHAR_BIT - src_offset;
2710 accum = accum + ((unsigned char) *source << accum_bits);
2711 accum_bits += HOST_CHAR_BIT;
2713 chunk_size = HOST_CHAR_BIT - targ_offset;
2716 mask = ((1 << chunk_size) - 1) << targ_offset;
2717 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2719 accum_bits -= chunk_size;
2720 accum >>= chunk_size;
2727 /* Store the contents of FROMVAL into the location of TOVAL.
2728 Return a new value with the location of TOVAL and contents of
2729 FROMVAL. Handles assignment into packed fields that have
2730 floating-point or non-scalar types. */
2732 static struct value *
2733 ada_value_assign (struct value *toval, struct value *fromval)
2735 struct type *type = value_type (toval);
2736 int bits = value_bitsize (toval);
2738 toval = ada_coerce_ref (toval);
2739 fromval = ada_coerce_ref (fromval);
2741 if (ada_is_direct_array_type (value_type (toval)))
2742 toval = ada_coerce_to_simple_array (toval);
2743 if (ada_is_direct_array_type (value_type (fromval)))
2744 fromval = ada_coerce_to_simple_array (fromval);
2746 if (!deprecated_value_modifiable (toval))
2747 error (_("Left operand of assignment is not a modifiable lvalue."));
2749 if (VALUE_LVAL (toval) == lval_memory
2751 && (TYPE_CODE (type) == TYPE_CODE_FLT
2752 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2754 int len = (value_bitpos (toval)
2755 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2757 gdb_byte *buffer = (gdb_byte *) alloca (len);
2759 CORE_ADDR to_addr = value_address (toval);
2761 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2762 fromval = value_cast (type, fromval);
2764 read_memory (to_addr, buffer, len);
2765 from_size = value_bitsize (fromval);
2767 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2768 if (gdbarch_bits_big_endian (get_type_arch (type)))
2769 move_bits (buffer, value_bitpos (toval),
2770 value_contents (fromval), from_size - bits, bits, 1);
2772 move_bits (buffer, value_bitpos (toval),
2773 value_contents (fromval), 0, bits, 0);
2774 write_memory_with_notification (to_addr, buffer, len);
2776 val = value_copy (toval);
2777 memcpy (value_contents_raw (val), value_contents (fromval),
2778 TYPE_LENGTH (type));
2779 deprecated_set_value_type (val, type);
2784 return value_assign (toval, fromval);
2788 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2789 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2790 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2791 COMPONENT, and not the inferior's memory. The current contents
2792 of COMPONENT are ignored.
2794 Although not part of the initial design, this function also works
2795 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2796 had a null address, and COMPONENT had an address which is equal to
2797 its offset inside CONTAINER. */
2800 value_assign_to_component (struct value *container, struct value *component,
2803 LONGEST offset_in_container =
2804 (LONGEST) (value_address (component) - value_address (container));
2805 int bit_offset_in_container =
2806 value_bitpos (component) - value_bitpos (container);
2809 val = value_cast (value_type (component), val);
2811 if (value_bitsize (component) == 0)
2812 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2814 bits = value_bitsize (component);
2816 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2820 if (is_scalar_type (check_typedef (value_type (component))))
2822 = TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits;
2825 move_bits (value_contents_writeable (container) + offset_in_container,
2826 value_bitpos (container) + bit_offset_in_container,
2827 value_contents (val), src_offset, bits, 1);
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 /* Determine if TYPE is an access to an unconstrained array. */
2838 ada_is_access_to_unconstrained_array (struct type *type)
2840 return (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
2841 && is_thick_pntr (ada_typedef_target_type (type)));
2844 /* The value of the element of array ARR at the ARITY indices given in IND.
2845 ARR may be either a simple array, GNAT array descriptor, or pointer
2849 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2853 struct type *elt_type;
2855 elt = ada_coerce_to_simple_array (arr);
2857 elt_type = ada_check_typedef (value_type (elt));
2858 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2859 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2860 return value_subscript_packed (elt, arity, ind);
2862 for (k = 0; k < arity; k += 1)
2864 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2865 error (_("too many subscripts (%d expected)"), k);
2866 elt = value_subscript (elt, pos_atr (ind[k]));
2871 /* Assuming ARR is a pointer to a GDB array, the value of the element
2872 of *ARR at the ARITY indices given in IND.
2873 Does not read the entire array into memory.
2875 Note: Unlike what one would expect, this function is used instead of
2876 ada_value_subscript for basically all non-packed array types. The reason
2877 for this is that a side effect of doing our own pointer arithmetics instead
2878 of relying on value_subscript is that there is no implicit typedef peeling.
2879 This is important for arrays of array accesses, where it allows us to
2880 preserve the fact that the array's element is an array access, where the
2881 access part os encoded in a typedef layer. */
2883 static struct value *
2884 ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind)
2887 struct value *array_ind = ada_value_ind (arr);
2889 = check_typedef (value_enclosing_type (array_ind));
2891 if (TYPE_CODE (type) == TYPE_CODE_ARRAY
2892 && TYPE_FIELD_BITSIZE (type, 0) > 0)
2893 return value_subscript_packed (array_ind, arity, ind);
2895 for (k = 0; k < arity; k += 1)
2898 struct value *lwb_value;
2900 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2901 error (_("too many subscripts (%d expected)"), k);
2902 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2904 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2905 lwb_value = value_from_longest (value_type(ind[k]), lwb);
2906 arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value));
2907 type = TYPE_TARGET_TYPE (type);
2910 return value_ind (arr);
2913 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2914 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2915 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2916 this array is LOW, as per Ada rules. */
2917 static struct value *
2918 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2921 struct type *type0 = ada_check_typedef (type);
2922 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0));
2923 struct type *index_type
2924 = create_static_range_type (NULL, base_index_type, low, high);
2925 struct type *slice_type = create_array_type_with_stride
2926 (NULL, TYPE_TARGET_TYPE (type0), index_type,
2927 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type0),
2928 TYPE_FIELD_BITSIZE (type0, 0));
2929 int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0));
2930 LONGEST base_low_pos, low_pos;
2933 if (!discrete_position (base_index_type, low, &low_pos)
2934 || !discrete_position (base_index_type, base_low, &base_low_pos))
2936 warning (_("unable to get positions in slice, use bounds instead"));
2938 base_low_pos = base_low;
2941 base = value_as_address (array_ptr)
2942 + ((low_pos - base_low_pos)
2943 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2944 return value_at_lazy (slice_type, base);
2948 static struct value *
2949 ada_value_slice (struct value *array, int low, int high)
2951 struct type *type = ada_check_typedef (value_type (array));
2952 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2953 struct type *index_type
2954 = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2955 struct type *slice_type = create_array_type_with_stride
2956 (NULL, TYPE_TARGET_TYPE (type), index_type,
2957 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type),
2958 TYPE_FIELD_BITSIZE (type, 0));
2959 LONGEST low_pos, high_pos;
2961 if (!discrete_position (base_index_type, low, &low_pos)
2962 || !discrete_position (base_index_type, high, &high_pos))
2964 warning (_("unable to get positions in slice, use bounds instead"));
2969 return value_cast (slice_type,
2970 value_slice (array, low, high_pos - low_pos + 1));
2973 /* If type is a record type in the form of a standard GNAT array
2974 descriptor, returns the number of dimensions for type. If arr is a
2975 simple array, returns the number of "array of"s that prefix its
2976 type designation. Otherwise, returns 0. */
2979 ada_array_arity (struct type *type)
2986 type = desc_base_type (type);
2989 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2990 return desc_arity (desc_bounds_type (type));
2992 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2995 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
3001 /* If TYPE is a record type in the form of a standard GNAT array
3002 descriptor or a simple array type, returns the element type for
3003 TYPE after indexing by NINDICES indices, or by all indices if
3004 NINDICES is -1. Otherwise, returns NULL. */
3007 ada_array_element_type (struct type *type, int nindices)
3009 type = desc_base_type (type);
3011 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
3014 struct type *p_array_type;
3016 p_array_type = desc_data_target_type (type);
3018 k = ada_array_arity (type);
3022 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
3023 if (nindices >= 0 && k > nindices)
3025 while (k > 0 && p_array_type != NULL)
3027 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
3030 return p_array_type;
3032 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
3034 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
3036 type = TYPE_TARGET_TYPE (type);
3045 /* The type of nth index in arrays of given type (n numbering from 1).
3046 Does not examine memory. Throws an error if N is invalid or TYPE
3047 is not an array type. NAME is the name of the Ada attribute being
3048 evaluated ('range, 'first, 'last, or 'length); it is used in building
3049 the error message. */
3051 static struct type *
3052 ada_index_type (struct type *type, int n, const char *name)
3054 struct type *result_type;
3056 type = desc_base_type (type);
3058 if (n < 0 || n > ada_array_arity (type))
3059 error (_("invalid dimension number to '%s"), name);
3061 if (ada_is_simple_array_type (type))
3065 for (i = 1; i < n; i += 1)
3066 type = TYPE_TARGET_TYPE (type);
3067 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
3068 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3069 has a target type of TYPE_CODE_UNDEF. We compensate here, but
3070 perhaps stabsread.c would make more sense. */
3071 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
3076 result_type = desc_index_type (desc_bounds_type (type), n);
3077 if (result_type == NULL)
3078 error (_("attempt to take bound of something that is not an array"));
3084 /* Given that arr is an array type, returns the lower bound of the
3085 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
3086 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
3087 array-descriptor type. It works for other arrays with bounds supplied
3088 by run-time quantities other than discriminants. */
3091 ada_array_bound_from_type (struct type *arr_type, int n, int which)
3093 struct type *type, *index_type_desc, *index_type;
3096 gdb_assert (which == 0 || which == 1);
3098 if (ada_is_constrained_packed_array_type (arr_type))
3099 arr_type = decode_constrained_packed_array_type (arr_type);
3101 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
3102 return (LONGEST) - which;
3104 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
3105 type = TYPE_TARGET_TYPE (arr_type);
3109 if (TYPE_FIXED_INSTANCE (type))
3111 /* The array has already been fixed, so we do not need to
3112 check the parallel ___XA type again. That encoding has
3113 already been applied, so ignore it now. */
3114 index_type_desc = NULL;
3118 index_type_desc = ada_find_parallel_type (type, "___XA");
3119 ada_fixup_array_indexes_type (index_type_desc);
3122 if (index_type_desc != NULL)
3123 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
3127 struct type *elt_type = check_typedef (type);
3129 for (i = 1; i < n; i++)
3130 elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type));
3132 index_type = TYPE_INDEX_TYPE (elt_type);
3136 (LONGEST) (which == 0
3137 ? ada_discrete_type_low_bound (index_type)
3138 : ada_discrete_type_high_bound (index_type));
3141 /* Given that arr is an array value, returns the lower bound of the
3142 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3143 WHICH is 1. This routine will also work for arrays with bounds
3144 supplied by run-time quantities other than discriminants. */
3147 ada_array_bound (struct value *arr, int n, int which)
3149 struct type *arr_type;
3151 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3152 arr = value_ind (arr);
3153 arr_type = value_enclosing_type (arr);
3155 if (ada_is_constrained_packed_array_type (arr_type))
3156 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
3157 else if (ada_is_simple_array_type (arr_type))
3158 return ada_array_bound_from_type (arr_type, n, which);
3160 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
3163 /* Given that arr is an array value, returns the length of the
3164 nth index. This routine will also work for arrays with bounds
3165 supplied by run-time quantities other than discriminants.
3166 Does not work for arrays indexed by enumeration types with representation
3167 clauses at the moment. */
3170 ada_array_length (struct value *arr, int n)
3172 struct type *arr_type, *index_type;
3175 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3176 arr = value_ind (arr);
3177 arr_type = value_enclosing_type (arr);
3179 if (ada_is_constrained_packed_array_type (arr_type))
3180 return ada_array_length (decode_constrained_packed_array (arr), n);
3182 if (ada_is_simple_array_type (arr_type))
3184 low = ada_array_bound_from_type (arr_type, n, 0);
3185 high = ada_array_bound_from_type (arr_type, n, 1);
3189 low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0));
3190 high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1));
3193 arr_type = check_typedef (arr_type);
3194 index_type = ada_index_type (arr_type, n, "length");
3195 if (index_type != NULL)
3197 struct type *base_type;
3198 if (TYPE_CODE (index_type) == TYPE_CODE_RANGE)
3199 base_type = TYPE_TARGET_TYPE (index_type);
3201 base_type = index_type;
3203 low = pos_atr (value_from_longest (base_type, low));
3204 high = pos_atr (value_from_longest (base_type, high));
3206 return high - low + 1;
3209 /* An empty array whose type is that of ARR_TYPE (an array type),
3210 with bounds LOW to LOW-1. */
3212 static struct value *
3213 empty_array (struct type *arr_type, int low)
3215 struct type *arr_type0 = ada_check_typedef (arr_type);
3216 struct type *index_type
3217 = create_static_range_type
3218 (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1);
3219 struct type *elt_type = ada_array_element_type (arr_type0, 1);
3221 return allocate_value (create_array_type (NULL, elt_type, index_type));
3225 /* Name resolution */
3227 /* The "decoded" name for the user-definable Ada operator corresponding
3231 ada_decoded_op_name (enum exp_opcode op)
3235 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
3237 if (ada_opname_table[i].op == op)
3238 return ada_opname_table[i].decoded;
3240 error (_("Could not find operator name for opcode"));
3244 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3245 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3246 undefined namespace) and converts operators that are
3247 user-defined into appropriate function calls. If CONTEXT_TYPE is
3248 non-null, it provides a preferred result type [at the moment, only
3249 type void has any effect---causing procedures to be preferred over
3250 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3251 return type is preferred. May change (expand) *EXP. */
3254 resolve (expression_up *expp, int void_context_p)
3256 struct type *context_type = NULL;
3260 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
3262 resolve_subexp (expp, &pc, 1, context_type);
3265 /* Resolve the operator of the subexpression beginning at
3266 position *POS of *EXPP. "Resolving" consists of replacing
3267 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3268 with their resolutions, replacing built-in operators with
3269 function calls to user-defined operators, where appropriate, and,
3270 when DEPROCEDURE_P is non-zero, converting function-valued variables
3271 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3272 are as in ada_resolve, above. */
3274 static struct value *
3275 resolve_subexp (expression_up *expp, int *pos, int deprocedure_p,
3276 struct type *context_type)
3280 struct expression *exp; /* Convenience: == *expp. */
3281 enum exp_opcode op = (*expp)->elts[pc].opcode;
3282 struct value **argvec; /* Vector of operand types (alloca'ed). */
3283 int nargs; /* Number of operands. */
3290 /* Pass one: resolve operands, saving their types and updating *pos,
3295 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3296 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3301 resolve_subexp (expp, pos, 0, NULL);
3303 nargs = longest_to_int (exp->elts[pc + 1].longconst);
3308 resolve_subexp (expp, pos, 0, NULL);
3313 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
3316 case OP_ATR_MODULUS:
3326 case TERNOP_IN_RANGE:
3327 case BINOP_IN_BOUNDS:
3333 case OP_DISCRETE_RANGE:
3335 ada_forward_operator_length (exp, pc, &oplen, &nargs);
3344 arg1 = resolve_subexp (expp, pos, 0, NULL);
3346 resolve_subexp (expp, pos, 1, NULL);
3348 resolve_subexp (expp, pos, 1, value_type (arg1));
3365 case BINOP_LOGICAL_AND:
3366 case BINOP_LOGICAL_OR:
3367 case BINOP_BITWISE_AND:
3368 case BINOP_BITWISE_IOR:
3369 case BINOP_BITWISE_XOR:
3372 case BINOP_NOTEQUAL:
3379 case BINOP_SUBSCRIPT:
3387 case UNOP_LOGICAL_NOT:
3397 case OP_VAR_MSYM_VALUE:
3404 case OP_INTERNALVAR:
3414 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3417 case STRUCTOP_STRUCT:
3418 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3431 error (_("Unexpected operator during name resolution"));
3434 argvec = XALLOCAVEC (struct value *, nargs + 1);
3435 for (i = 0; i < nargs; i += 1)
3436 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3440 /* Pass two: perform any resolution on principal operator. */
3447 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3449 std::vector<struct block_symbol> candidates;
3453 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3454 (exp->elts[pc + 2].symbol),
3455 exp->elts[pc + 1].block, VAR_DOMAIN,
3458 if (n_candidates > 1)
3460 /* Types tend to get re-introduced locally, so if there
3461 are any local symbols that are not types, first filter
3464 for (j = 0; j < n_candidates; j += 1)
3465 switch (SYMBOL_CLASS (candidates[j].symbol))
3470 case LOC_REGPARM_ADDR:
3478 if (j < n_candidates)
3481 while (j < n_candidates)
3483 if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF)
3485 candidates[j] = candidates[n_candidates - 1];
3494 if (n_candidates == 0)
3495 error (_("No definition found for %s"),
3496 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3497 else if (n_candidates == 1)
3499 else if (deprocedure_p
3500 && !is_nonfunction (candidates.data (), n_candidates))
3502 i = ada_resolve_function
3503 (candidates.data (), n_candidates, NULL, 0,
3504 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3507 error (_("Could not find a match for %s"),
3508 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3512 printf_filtered (_("Multiple matches for %s\n"),
3513 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3514 user_select_syms (candidates.data (), n_candidates, 1);
3518 exp->elts[pc + 1].block = candidates[i].block;
3519 exp->elts[pc + 2].symbol = candidates[i].symbol;
3520 innermost_block.update (candidates[i]);
3524 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3527 replace_operator_with_call (expp, pc, 0, 4,
3528 exp->elts[pc + 2].symbol,
3529 exp->elts[pc + 1].block);
3536 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3537 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3539 std::vector<struct block_symbol> candidates;
3543 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3544 (exp->elts[pc + 5].symbol),
3545 exp->elts[pc + 4].block, VAR_DOMAIN,
3548 if (n_candidates == 1)
3552 i = ada_resolve_function
3553 (candidates.data (), n_candidates,
3555 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3558 error (_("Could not find a match for %s"),
3559 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3562 exp->elts[pc + 4].block = candidates[i].block;
3563 exp->elts[pc + 5].symbol = candidates[i].symbol;
3564 innermost_block.update (candidates[i]);
3575 case BINOP_BITWISE_AND:
3576 case BINOP_BITWISE_IOR:
3577 case BINOP_BITWISE_XOR:
3579 case BINOP_NOTEQUAL:
3587 case UNOP_LOGICAL_NOT:
3589 if (possible_user_operator_p (op, argvec))
3591 std::vector<struct block_symbol> candidates;
3595 ada_lookup_symbol_list (ada_decoded_op_name (op),
3596 (struct block *) NULL, VAR_DOMAIN,
3599 i = ada_resolve_function (candidates.data (), n_candidates, argvec,
3600 nargs, ada_decoded_op_name (op), NULL);
3604 replace_operator_with_call (expp, pc, nargs, 1,
3605 candidates[i].symbol,
3606 candidates[i].block);
3617 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
3618 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS,
3619 exp->elts[pc + 1].objfile,
3620 exp->elts[pc + 2].msymbol);
3622 return evaluate_subexp_type (exp, pos);
3625 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3626 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3628 /* The term "match" here is rather loose. The match is heuristic and
3632 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3634 ftype = ada_check_typedef (ftype);
3635 atype = ada_check_typedef (atype);
3637 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3638 ftype = TYPE_TARGET_TYPE (ftype);
3639 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3640 atype = TYPE_TARGET_TYPE (atype);
3642 switch (TYPE_CODE (ftype))
3645 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3647 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3648 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3649 TYPE_TARGET_TYPE (atype), 0);
3652 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3654 case TYPE_CODE_ENUM:
3655 case TYPE_CODE_RANGE:
3656 switch (TYPE_CODE (atype))
3659 case TYPE_CODE_ENUM:
3660 case TYPE_CODE_RANGE:
3666 case TYPE_CODE_ARRAY:
3667 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3668 || ada_is_array_descriptor_type (atype));
3670 case TYPE_CODE_STRUCT:
3671 if (ada_is_array_descriptor_type (ftype))
3672 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3673 || ada_is_array_descriptor_type (atype));
3675 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3676 && !ada_is_array_descriptor_type (atype));
3678 case TYPE_CODE_UNION:
3680 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3684 /* Return non-zero if the formals of FUNC "sufficiently match" the
3685 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3686 may also be an enumeral, in which case it is treated as a 0-
3687 argument function. */
3690 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3693 struct type *func_type = SYMBOL_TYPE (func);
3695 if (SYMBOL_CLASS (func) == LOC_CONST
3696 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3697 return (n_actuals == 0);
3698 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3701 if (TYPE_NFIELDS (func_type) != n_actuals)
3704 for (i = 0; i < n_actuals; i += 1)
3706 if (actuals[i] == NULL)
3710 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3712 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3714 if (!ada_type_match (ftype, atype, 1))
3721 /* False iff function type FUNC_TYPE definitely does not produce a value
3722 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3723 FUNC_TYPE is not a valid function type with a non-null return type
3724 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3727 return_match (struct type *func_type, struct type *context_type)
3729 struct type *return_type;
3731 if (func_type == NULL)
3734 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3735 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
3737 return_type = get_base_type (func_type);
3738 if (return_type == NULL)
3741 context_type = get_base_type (context_type);
3743 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3744 return context_type == NULL || return_type == context_type;
3745 else if (context_type == NULL)
3746 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3748 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3752 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3753 function (if any) that matches the types of the NARGS arguments in
3754 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3755 that returns that type, then eliminate matches that don't. If
3756 CONTEXT_TYPE is void and there is at least one match that does not
3757 return void, eliminate all matches that do.
3759 Asks the user if there is more than one match remaining. Returns -1
3760 if there is no such symbol or none is selected. NAME is used
3761 solely for messages. May re-arrange and modify SYMS in
3762 the process; the index returned is for the modified vector. */
3765 ada_resolve_function (struct block_symbol syms[],
3766 int nsyms, struct value **args, int nargs,
3767 const char *name, struct type *context_type)
3771 int m; /* Number of hits */
3774 /* In the first pass of the loop, we only accept functions matching
3775 context_type. If none are found, we add a second pass of the loop
3776 where every function is accepted. */
3777 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3779 for (k = 0; k < nsyms; k += 1)
3781 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol));
3783 if (ada_args_match (syms[k].symbol, args, nargs)
3784 && (fallback || return_match (type, context_type)))
3792 /* If we got multiple matches, ask the user which one to use. Don't do this
3793 interactive thing during completion, though, as the purpose of the
3794 completion is providing a list of all possible matches. Prompting the
3795 user to filter it down would be completely unexpected in this case. */
3798 else if (m > 1 && !parse_completion)
3800 printf_filtered (_("Multiple matches for %s\n"), name);
3801 user_select_syms (syms, m, 1);
3807 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3808 in a listing of choices during disambiguation (see sort_choices, below).
3809 The idea is that overloadings of a subprogram name from the
3810 same package should sort in their source order. We settle for ordering
3811 such symbols by their trailing number (__N or $N). */
3814 encoded_ordered_before (const char *N0, const char *N1)
3818 else if (N0 == NULL)
3824 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3826 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3828 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3829 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3834 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3837 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3839 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3840 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3842 return (strcmp (N0, N1) < 0);
3846 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3850 sort_choices (struct block_symbol syms[], int nsyms)
3854 for (i = 1; i < nsyms; i += 1)
3856 struct block_symbol sym = syms[i];
3859 for (j = i - 1; j >= 0; j -= 1)
3861 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol),
3862 SYMBOL_LINKAGE_NAME (sym.symbol)))
3864 syms[j + 1] = syms[j];
3870 /* Whether GDB should display formals and return types for functions in the
3871 overloads selection menu. */
3872 static int print_signatures = 1;
3874 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3875 all but functions, the signature is just the name of the symbol. For
3876 functions, this is the name of the function, the list of types for formals
3877 and the return type (if any). */
3880 ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym,
3881 const struct type_print_options *flags)
3883 struct type *type = SYMBOL_TYPE (sym);
3885 fprintf_filtered (stream, "%s", SYMBOL_PRINT_NAME (sym));
3886 if (!print_signatures
3888 || TYPE_CODE (type) != TYPE_CODE_FUNC)
3891 if (TYPE_NFIELDS (type) > 0)
3895 fprintf_filtered (stream, " (");
3896 for (i = 0; i < TYPE_NFIELDS (type); ++i)
3899 fprintf_filtered (stream, "; ");
3900 ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0,
3903 fprintf_filtered (stream, ")");
3905 if (TYPE_TARGET_TYPE (type) != NULL
3906 && TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID)
3908 fprintf_filtered (stream, " return ");
3909 ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags);
3913 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3914 by asking the user (if necessary), returning the number selected,
3915 and setting the first elements of SYMS items. Error if no symbols
3918 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3919 to be re-integrated one of these days. */
3922 user_select_syms (struct block_symbol *syms, int nsyms, int max_results)
3925 int *chosen = XALLOCAVEC (int , nsyms);
3927 int first_choice = (max_results == 1) ? 1 : 2;
3928 const char *select_mode = multiple_symbols_select_mode ();
3930 if (max_results < 1)
3931 error (_("Request to select 0 symbols!"));
3935 if (select_mode == multiple_symbols_cancel)
3937 canceled because the command is ambiguous\n\
3938 See set/show multiple-symbol."));
3940 /* If select_mode is "all", then return all possible symbols.
3941 Only do that if more than one symbol can be selected, of course.
3942 Otherwise, display the menu as usual. */
3943 if (select_mode == multiple_symbols_all && max_results > 1)
3946 printf_unfiltered (_("[0] cancel\n"));
3947 if (max_results > 1)
3948 printf_unfiltered (_("[1] all\n"));
3950 sort_choices (syms, nsyms);
3952 for (i = 0; i < nsyms; i += 1)
3954 if (syms[i].symbol == NULL)
3957 if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK)
3959 struct symtab_and_line sal =
3960 find_function_start_sal (syms[i].symbol, 1);
3962 printf_unfiltered ("[%d] ", i + first_choice);
3963 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3964 &type_print_raw_options);
3965 if (sal.symtab == NULL)
3966 printf_unfiltered (_(" at <no source file available>:%d\n"),
3969 printf_unfiltered (_(" at %s:%d\n"),
3970 symtab_to_filename_for_display (sal.symtab),
3977 (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST
3978 && SYMBOL_TYPE (syms[i].symbol) != NULL
3979 && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM);
3980 struct symtab *symtab = NULL;
3982 if (SYMBOL_OBJFILE_OWNED (syms[i].symbol))
3983 symtab = symbol_symtab (syms[i].symbol);
3985 if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL)
3987 printf_unfiltered ("[%d] ", i + first_choice);
3988 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3989 &type_print_raw_options);
3990 printf_unfiltered (_(" at %s:%d\n"),
3991 symtab_to_filename_for_display (symtab),
3992 SYMBOL_LINE (syms[i].symbol));
3994 else if (is_enumeral
3995 && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL)
3997 printf_unfiltered (("[%d] "), i + first_choice);
3998 ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL,
3999 gdb_stdout, -1, 0, &type_print_raw_options);
4000 printf_unfiltered (_("'(%s) (enumeral)\n"),
4001 SYMBOL_PRINT_NAME (syms[i].symbol));
4005 printf_unfiltered ("[%d] ", i + first_choice);
4006 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
4007 &type_print_raw_options);
4010 printf_unfiltered (is_enumeral
4011 ? _(" in %s (enumeral)\n")
4013 symtab_to_filename_for_display (symtab));
4015 printf_unfiltered (is_enumeral
4016 ? _(" (enumeral)\n")
4022 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
4025 for (i = 0; i < n_chosen; i += 1)
4026 syms[i] = syms[chosen[i]];
4031 /* Read and validate a set of numeric choices from the user in the
4032 range 0 .. N_CHOICES-1. Place the results in increasing
4033 order in CHOICES[0 .. N-1], and return N.
4035 The user types choices as a sequence of numbers on one line
4036 separated by blanks, encoding them as follows:
4038 + A choice of 0 means to cancel the selection, throwing an error.
4039 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4040 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4042 The user is not allowed to choose more than MAX_RESULTS values.
4044 ANNOTATION_SUFFIX, if present, is used to annotate the input
4045 prompts (for use with the -f switch). */
4048 get_selections (int *choices, int n_choices, int max_results,
4049 int is_all_choice, const char *annotation_suffix)
4054 int first_choice = is_all_choice ? 2 : 1;
4056 prompt = getenv ("PS2");
4060 args = command_line_input (prompt, annotation_suffix);
4063 error_no_arg (_("one or more choice numbers"));
4067 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4068 order, as given in args. Choices are validated. */
4074 args = skip_spaces (args);
4075 if (*args == '\0' && n_chosen == 0)
4076 error_no_arg (_("one or more choice numbers"));
4077 else if (*args == '\0')
4080 choice = strtol (args, &args2, 10);
4081 if (args == args2 || choice < 0
4082 || choice > n_choices + first_choice - 1)
4083 error (_("Argument must be choice number"));
4087 error (_("cancelled"));
4089 if (choice < first_choice)
4091 n_chosen = n_choices;
4092 for (j = 0; j < n_choices; j += 1)
4096 choice -= first_choice;
4098 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
4102 if (j < 0 || choice != choices[j])
4106 for (k = n_chosen - 1; k > j; k -= 1)
4107 choices[k + 1] = choices[k];
4108 choices[j + 1] = choice;
4113 if (n_chosen > max_results)
4114 error (_("Select no more than %d of the above"), max_results);
4119 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4120 on the function identified by SYM and BLOCK, and taking NARGS
4121 arguments. Update *EXPP as needed to hold more space. */
4124 replace_operator_with_call (expression_up *expp, int pc, int nargs,
4125 int oplen, struct symbol *sym,
4126 const struct block *block)
4128 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4129 symbol, -oplen for operator being replaced). */
4130 struct expression *newexp = (struct expression *)
4131 xzalloc (sizeof (struct expression)
4132 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
4133 struct expression *exp = expp->get ();
4135 newexp->nelts = exp->nelts + 7 - oplen;
4136 newexp->language_defn = exp->language_defn;
4137 newexp->gdbarch = exp->gdbarch;
4138 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
4139 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
4140 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
4142 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
4143 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
4145 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
4146 newexp->elts[pc + 4].block = block;
4147 newexp->elts[pc + 5].symbol = sym;
4149 expp->reset (newexp);
4152 /* Type-class predicates */
4154 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4158 numeric_type_p (struct type *type)
4164 switch (TYPE_CODE (type))
4169 case TYPE_CODE_RANGE:
4170 return (type == TYPE_TARGET_TYPE (type)
4171 || numeric_type_p (TYPE_TARGET_TYPE (type)));
4178 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4181 integer_type_p (struct type *type)
4187 switch (TYPE_CODE (type))
4191 case TYPE_CODE_RANGE:
4192 return (type == TYPE_TARGET_TYPE (type)
4193 || integer_type_p (TYPE_TARGET_TYPE (type)));
4200 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4203 scalar_type_p (struct type *type)
4209 switch (TYPE_CODE (type))
4212 case TYPE_CODE_RANGE:
4213 case TYPE_CODE_ENUM:
4222 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4225 discrete_type_p (struct type *type)
4231 switch (TYPE_CODE (type))
4234 case TYPE_CODE_RANGE:
4235 case TYPE_CODE_ENUM:
4236 case TYPE_CODE_BOOL:
4244 /* Returns non-zero if OP with operands in the vector ARGS could be
4245 a user-defined function. Errs on the side of pre-defined operators
4246 (i.e., result 0). */
4249 possible_user_operator_p (enum exp_opcode op, struct value *args[])
4251 struct type *type0 =
4252 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
4253 struct type *type1 =
4254 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
4268 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
4272 case BINOP_BITWISE_AND:
4273 case BINOP_BITWISE_IOR:
4274 case BINOP_BITWISE_XOR:
4275 return (!(integer_type_p (type0) && integer_type_p (type1)));
4278 case BINOP_NOTEQUAL:
4283 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
4286 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
4289 return (!(numeric_type_p (type0) && integer_type_p (type1)));
4293 case UNOP_LOGICAL_NOT:
4295 return (!numeric_type_p (type0));
4304 1. In the following, we assume that a renaming type's name may
4305 have an ___XD suffix. It would be nice if this went away at some
4307 2. We handle both the (old) purely type-based representation of
4308 renamings and the (new) variable-based encoding. At some point,
4309 it is devoutly to be hoped that the former goes away
4310 (FIXME: hilfinger-2007-07-09).
4311 3. Subprogram renamings are not implemented, although the XRS
4312 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4314 /* If SYM encodes a renaming,
4316 <renaming> renames <renamed entity>,
4318 sets *LEN to the length of the renamed entity's name,
4319 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4320 the string describing the subcomponent selected from the renamed
4321 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4322 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4323 are undefined). Otherwise, returns a value indicating the category
4324 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4325 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4326 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4327 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4328 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4329 may be NULL, in which case they are not assigned.
4331 [Currently, however, GCC does not generate subprogram renamings.] */
4333 enum ada_renaming_category
4334 ada_parse_renaming (struct symbol *sym,
4335 const char **renamed_entity, int *len,
4336 const char **renaming_expr)
4338 enum ada_renaming_category kind;
4343 return ADA_NOT_RENAMING;
4344 switch (SYMBOL_CLASS (sym))
4347 return ADA_NOT_RENAMING;
4349 return parse_old_style_renaming (SYMBOL_TYPE (sym),
4350 renamed_entity, len, renaming_expr);
4354 case LOC_OPTIMIZED_OUT:
4355 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
4357 return ADA_NOT_RENAMING;
4361 kind = ADA_OBJECT_RENAMING;
4365 kind = ADA_EXCEPTION_RENAMING;
4369 kind = ADA_PACKAGE_RENAMING;
4373 kind = ADA_SUBPROGRAM_RENAMING;
4377 return ADA_NOT_RENAMING;
4381 if (renamed_entity != NULL)
4382 *renamed_entity = info;
4383 suffix = strstr (info, "___XE");
4384 if (suffix == NULL || suffix == info)
4385 return ADA_NOT_RENAMING;
4387 *len = strlen (info) - strlen (suffix);
4389 if (renaming_expr != NULL)
4390 *renaming_expr = suffix;
4394 /* Assuming TYPE encodes a renaming according to the old encoding in
4395 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4396 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4397 ADA_NOT_RENAMING otherwise. */
4398 static enum ada_renaming_category
4399 parse_old_style_renaming (struct type *type,
4400 const char **renamed_entity, int *len,
4401 const char **renaming_expr)
4403 enum ada_renaming_category kind;
4408 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4409 || TYPE_NFIELDS (type) != 1)
4410 return ADA_NOT_RENAMING;
4412 name = TYPE_NAME (type);
4414 return ADA_NOT_RENAMING;
4416 name = strstr (name, "___XR");
4418 return ADA_NOT_RENAMING;
4423 kind = ADA_OBJECT_RENAMING;
4426 kind = ADA_EXCEPTION_RENAMING;
4429 kind = ADA_PACKAGE_RENAMING;
4432 kind = ADA_SUBPROGRAM_RENAMING;
4435 return ADA_NOT_RENAMING;
4438 info = TYPE_FIELD_NAME (type, 0);
4440 return ADA_NOT_RENAMING;
4441 if (renamed_entity != NULL)
4442 *renamed_entity = info;
4443 suffix = strstr (info, "___XE");
4444 if (renaming_expr != NULL)
4445 *renaming_expr = suffix + 5;
4446 if (suffix == NULL || suffix == info)
4447 return ADA_NOT_RENAMING;
4449 *len = suffix - info;
4453 /* Compute the value of the given RENAMING_SYM, which is expected to
4454 be a symbol encoding a renaming expression. BLOCK is the block
4455 used to evaluate the renaming. */
4457 static struct value *
4458 ada_read_renaming_var_value (struct symbol *renaming_sym,
4459 const struct block *block)
4461 const char *sym_name;
4463 sym_name = SYMBOL_LINKAGE_NAME (renaming_sym);
4464 expression_up expr = parse_exp_1 (&sym_name, 0, block, 0);
4465 return evaluate_expression (expr.get ());
4469 /* Evaluation: Function Calls */
4471 /* Return an lvalue containing the value VAL. This is the identity on
4472 lvalues, and otherwise has the side-effect of allocating memory
4473 in the inferior where a copy of the value contents is copied. */
4475 static struct value *
4476 ensure_lval (struct value *val)
4478 if (VALUE_LVAL (val) == not_lval
4479 || VALUE_LVAL (val) == lval_internalvar)
4481 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4482 const CORE_ADDR addr =
4483 value_as_long (value_allocate_space_in_inferior (len));
4485 VALUE_LVAL (val) = lval_memory;
4486 set_value_address (val, addr);
4487 write_memory (addr, value_contents (val), len);
4493 /* Return the value ACTUAL, converted to be an appropriate value for a
4494 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4495 allocating any necessary descriptors (fat pointers), or copies of
4496 values not residing in memory, updating it as needed. */
4499 ada_convert_actual (struct value *actual, struct type *formal_type0)
4501 struct type *actual_type = ada_check_typedef (value_type (actual));
4502 struct type *formal_type = ada_check_typedef (formal_type0);
4503 struct type *formal_target =
4504 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4505 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4506 struct type *actual_target =
4507 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4508 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4510 if (ada_is_array_descriptor_type (formal_target)
4511 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4512 return make_array_descriptor (formal_type, actual);
4513 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4514 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4516 struct value *result;
4518 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4519 && ada_is_array_descriptor_type (actual_target))
4520 result = desc_data (actual);
4521 else if (TYPE_CODE (formal_type) != TYPE_CODE_PTR)
4523 if (VALUE_LVAL (actual) != lval_memory)
4527 actual_type = ada_check_typedef (value_type (actual));
4528 val = allocate_value (actual_type);
4529 memcpy ((char *) value_contents_raw (val),
4530 (char *) value_contents (actual),
4531 TYPE_LENGTH (actual_type));
4532 actual = ensure_lval (val);
4534 result = value_addr (actual);
4538 return value_cast_pointers (formal_type, result, 0);
4540 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4541 return ada_value_ind (actual);
4542 else if (ada_is_aligner_type (formal_type))
4544 /* We need to turn this parameter into an aligner type
4546 struct value *aligner = allocate_value (formal_type);
4547 struct value *component = ada_value_struct_elt (aligner, "F", 0);
4549 value_assign_to_component (aligner, component, actual);
4556 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4557 type TYPE. This is usually an inefficient no-op except on some targets
4558 (such as AVR) where the representation of a pointer and an address
4562 value_pointer (struct value *value, struct type *type)
4564 struct gdbarch *gdbarch = get_type_arch (type);
4565 unsigned len = TYPE_LENGTH (type);
4566 gdb_byte *buf = (gdb_byte *) alloca (len);
4569 addr = value_address (value);
4570 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4571 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4576 /* Push a descriptor of type TYPE for array value ARR on the stack at
4577 *SP, updating *SP to reflect the new descriptor. Return either
4578 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4579 to-descriptor type rather than a descriptor type), a struct value *
4580 representing a pointer to this descriptor. */
4582 static struct value *
4583 make_array_descriptor (struct type *type, struct value *arr)
4585 struct type *bounds_type = desc_bounds_type (type);
4586 struct type *desc_type = desc_base_type (type);
4587 struct value *descriptor = allocate_value (desc_type);
4588 struct value *bounds = allocate_value (bounds_type);
4591 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4594 modify_field (value_type (bounds), value_contents_writeable (bounds),
4595 ada_array_bound (arr, i, 0),
4596 desc_bound_bitpos (bounds_type, i, 0),
4597 desc_bound_bitsize (bounds_type, i, 0));
4598 modify_field (value_type (bounds), value_contents_writeable (bounds),
4599 ada_array_bound (arr, i, 1),
4600 desc_bound_bitpos (bounds_type, i, 1),
4601 desc_bound_bitsize (bounds_type, i, 1));
4604 bounds = ensure_lval (bounds);
4606 modify_field (value_type (descriptor),
4607 value_contents_writeable (descriptor),
4608 value_pointer (ensure_lval (arr),
4609 TYPE_FIELD_TYPE (desc_type, 0)),
4610 fat_pntr_data_bitpos (desc_type),
4611 fat_pntr_data_bitsize (desc_type));
4613 modify_field (value_type (descriptor),
4614 value_contents_writeable (descriptor),
4615 value_pointer (bounds,
4616 TYPE_FIELD_TYPE (desc_type, 1)),
4617 fat_pntr_bounds_bitpos (desc_type),
4618 fat_pntr_bounds_bitsize (desc_type));
4620 descriptor = ensure_lval (descriptor);
4622 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4623 return value_addr (descriptor);
4628 /* Symbol Cache Module */
4630 /* Performance measurements made as of 2010-01-15 indicate that
4631 this cache does bring some noticeable improvements. Depending
4632 on the type of entity being printed, the cache can make it as much
4633 as an order of magnitude faster than without it.
4635 The descriptive type DWARF extension has significantly reduced
4636 the need for this cache, at least when DWARF is being used. However,
4637 even in this case, some expensive name-based symbol searches are still
4638 sometimes necessary - to find an XVZ variable, mostly. */
4640 /* Initialize the contents of SYM_CACHE. */
4643 ada_init_symbol_cache (struct ada_symbol_cache *sym_cache)
4645 obstack_init (&sym_cache->cache_space);
4646 memset (sym_cache->root, '\000', sizeof (sym_cache->root));
4649 /* Free the memory used by SYM_CACHE. */
4652 ada_free_symbol_cache (struct ada_symbol_cache *sym_cache)
4654 obstack_free (&sym_cache->cache_space, NULL);
4658 /* Return the symbol cache associated to the given program space PSPACE.
4659 If not allocated for this PSPACE yet, allocate and initialize one. */
4661 static struct ada_symbol_cache *
4662 ada_get_symbol_cache (struct program_space *pspace)
4664 struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace);
4666 if (pspace_data->sym_cache == NULL)
4668 pspace_data->sym_cache = XCNEW (struct ada_symbol_cache);
4669 ada_init_symbol_cache (pspace_data->sym_cache);
4672 return pspace_data->sym_cache;
4675 /* Clear all entries from the symbol cache. */
4678 ada_clear_symbol_cache (void)
4680 struct ada_symbol_cache *sym_cache
4681 = ada_get_symbol_cache (current_program_space);
4683 obstack_free (&sym_cache->cache_space, NULL);
4684 ada_init_symbol_cache (sym_cache);
4687 /* Search our cache for an entry matching NAME and DOMAIN.
4688 Return it if found, or NULL otherwise. */
4690 static struct cache_entry **
4691 find_entry (const char *name, domain_enum domain)
4693 struct ada_symbol_cache *sym_cache
4694 = ada_get_symbol_cache (current_program_space);
4695 int h = msymbol_hash (name) % HASH_SIZE;
4696 struct cache_entry **e;
4698 for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next)
4700 if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0)
4706 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4707 Return 1 if found, 0 otherwise.
4709 If an entry was found and SYM is not NULL, set *SYM to the entry's
4710 SYM. Same principle for BLOCK if not NULL. */
4713 lookup_cached_symbol (const char *name, domain_enum domain,
4714 struct symbol **sym, const struct block **block)
4716 struct cache_entry **e = find_entry (name, domain);
4723 *block = (*e)->block;
4727 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4728 in domain DOMAIN, save this result in our symbol cache. */
4731 cache_symbol (const char *name, domain_enum domain, struct symbol *sym,
4732 const struct block *block)
4734 struct ada_symbol_cache *sym_cache
4735 = ada_get_symbol_cache (current_program_space);
4738 struct cache_entry *e;
4740 /* Symbols for builtin types don't have a block.
4741 For now don't cache such symbols. */
4742 if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym))
4745 /* If the symbol is a local symbol, then do not cache it, as a search
4746 for that symbol depends on the context. To determine whether
4747 the symbol is local or not, we check the block where we found it
4748 against the global and static blocks of its associated symtab. */
4750 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
4751 GLOBAL_BLOCK) != block
4752 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
4753 STATIC_BLOCK) != block)
4756 h = msymbol_hash (name) % HASH_SIZE;
4757 e = XOBNEW (&sym_cache->cache_space, cache_entry);
4758 e->next = sym_cache->root[h];
4759 sym_cache->root[h] = e;
4761 = (char *) obstack_alloc (&sym_cache->cache_space, strlen (name) + 1);
4762 strcpy (copy, name);
4770 /* Return the symbol name match type that should be used used when
4771 searching for all symbols matching LOOKUP_NAME.
4773 LOOKUP_NAME is expected to be a symbol name after transformation
4776 static symbol_name_match_type
4777 name_match_type_from_name (const char *lookup_name)
4779 return (strstr (lookup_name, "__") == NULL
4780 ? symbol_name_match_type::WILD
4781 : symbol_name_match_type::FULL);
4784 /* Return the result of a standard (literal, C-like) lookup of NAME in
4785 given DOMAIN, visible from lexical block BLOCK. */
4787 static struct symbol *
4788 standard_lookup (const char *name, const struct block *block,
4791 /* Initialize it just to avoid a GCC false warning. */
4792 struct block_symbol sym = {NULL, NULL};
4794 if (lookup_cached_symbol (name, domain, &sym.symbol, NULL))
4796 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4797 cache_symbol (name, domain, sym.symbol, sym.block);
4802 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4803 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4804 since they contend in overloading in the same way. */
4806 is_nonfunction (struct block_symbol syms[], int n)
4810 for (i = 0; i < n; i += 1)
4811 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC
4812 && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM
4813 || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST))
4819 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4820 struct types. Otherwise, they may not. */
4823 equiv_types (struct type *type0, struct type *type1)
4827 if (type0 == NULL || type1 == NULL
4828 || TYPE_CODE (type0) != TYPE_CODE (type1))
4830 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4831 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4832 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4833 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4839 /* True iff SYM0 represents the same entity as SYM1, or one that is
4840 no more defined than that of SYM1. */
4843 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4847 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4848 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4851 switch (SYMBOL_CLASS (sym0))
4857 struct type *type0 = SYMBOL_TYPE (sym0);
4858 struct type *type1 = SYMBOL_TYPE (sym1);
4859 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4860 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4861 int len0 = strlen (name0);
4864 TYPE_CODE (type0) == TYPE_CODE (type1)
4865 && (equiv_types (type0, type1)
4866 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4867 && startswith (name1 + len0, "___XV")));
4870 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4871 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4877 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4878 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4881 add_defn_to_vec (struct obstack *obstackp,
4883 const struct block *block)
4886 struct block_symbol *prevDefns = defns_collected (obstackp, 0);
4888 /* Do not try to complete stub types, as the debugger is probably
4889 already scanning all symbols matching a certain name at the
4890 time when this function is called. Trying to replace the stub
4891 type by its associated full type will cause us to restart a scan
4892 which may lead to an infinite recursion. Instead, the client
4893 collecting the matching symbols will end up collecting several
4894 matches, with at least one of them complete. It can then filter
4895 out the stub ones if needed. */
4897 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4899 if (lesseq_defined_than (sym, prevDefns[i].symbol))
4901 else if (lesseq_defined_than (prevDefns[i].symbol, sym))
4903 prevDefns[i].symbol = sym;
4904 prevDefns[i].block = block;
4910 struct block_symbol info;
4914 obstack_grow (obstackp, &info, sizeof (struct block_symbol));
4918 /* Number of block_symbol structures currently collected in current vector in
4922 num_defns_collected (struct obstack *obstackp)
4924 return obstack_object_size (obstackp) / sizeof (struct block_symbol);
4927 /* Vector of block_symbol structures currently collected in current vector in
4928 OBSTACKP. If FINISH, close off the vector and return its final address. */
4930 static struct block_symbol *
4931 defns_collected (struct obstack *obstackp, int finish)
4934 return (struct block_symbol *) obstack_finish (obstackp);
4936 return (struct block_symbol *) obstack_base (obstackp);
4939 /* Return a bound minimal symbol matching NAME according to Ada
4940 decoding rules. Returns an invalid symbol if there is no such
4941 minimal symbol. Names prefixed with "standard__" are handled
4942 specially: "standard__" is first stripped off, and only static and
4943 global symbols are searched. */
4945 struct bound_minimal_symbol
4946 ada_lookup_simple_minsym (const char *name)
4948 struct bound_minimal_symbol result;
4949 struct objfile *objfile;
4950 struct minimal_symbol *msymbol;
4952 memset (&result, 0, sizeof (result));
4954 symbol_name_match_type match_type = name_match_type_from_name (name);
4955 lookup_name_info lookup_name (name, match_type);
4957 symbol_name_matcher_ftype *match_name
4958 = ada_get_symbol_name_matcher (lookup_name);
4960 ALL_MSYMBOLS (objfile, msymbol)
4962 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), lookup_name, NULL)
4963 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4965 result.minsym = msymbol;
4966 result.objfile = objfile;
4974 /* For all subprograms that statically enclose the subprogram of the
4975 selected frame, add symbols matching identifier NAME in DOMAIN
4976 and their blocks to the list of data in OBSTACKP, as for
4977 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4978 with a wildcard prefix. */
4981 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4982 const lookup_name_info &lookup_name,
4987 /* True if TYPE is definitely an artificial type supplied to a symbol
4988 for which no debugging information was given in the symbol file. */
4991 is_nondebugging_type (struct type *type)
4993 const char *name = ada_type_name (type);
4995 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4998 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4999 that are deemed "identical" for practical purposes.
5001 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
5002 types and that their number of enumerals is identical (in other
5003 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
5006 ada_identical_enum_types_p (struct type *type1, struct type *type2)
5010 /* The heuristic we use here is fairly conservative. We consider
5011 that 2 enumerate types are identical if they have the same
5012 number of enumerals and that all enumerals have the same
5013 underlying value and name. */
5015 /* All enums in the type should have an identical underlying value. */
5016 for (i = 0; i < TYPE_NFIELDS (type1); i++)
5017 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
5020 /* All enumerals should also have the same name (modulo any numerical
5022 for (i = 0; i < TYPE_NFIELDS (type1); i++)
5024 const char *name_1 = TYPE_FIELD_NAME (type1, i);
5025 const char *name_2 = TYPE_FIELD_NAME (type2, i);
5026 int len_1 = strlen (name_1);
5027 int len_2 = strlen (name_2);
5029 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
5030 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
5032 || strncmp (TYPE_FIELD_NAME (type1, i),
5033 TYPE_FIELD_NAME (type2, i),
5041 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5042 that are deemed "identical" for practical purposes. Sometimes,
5043 enumerals are not strictly identical, but their types are so similar
5044 that they can be considered identical.
5046 For instance, consider the following code:
5048 type Color is (Black, Red, Green, Blue, White);
5049 type RGB_Color is new Color range Red .. Blue;
5051 Type RGB_Color is a subrange of an implicit type which is a copy
5052 of type Color. If we call that implicit type RGB_ColorB ("B" is
5053 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5054 As a result, when an expression references any of the enumeral
5055 by name (Eg. "print green"), the expression is technically
5056 ambiguous and the user should be asked to disambiguate. But
5057 doing so would only hinder the user, since it wouldn't matter
5058 what choice he makes, the outcome would always be the same.
5059 So, for practical purposes, we consider them as the same. */
5062 symbols_are_identical_enums (const std::vector<struct block_symbol> &syms)
5066 /* Before performing a thorough comparison check of each type,
5067 we perform a series of inexpensive checks. We expect that these
5068 checks will quickly fail in the vast majority of cases, and thus
5069 help prevent the unnecessary use of a more expensive comparison.
5070 Said comparison also expects us to make some of these checks
5071 (see ada_identical_enum_types_p). */
5073 /* Quick check: All symbols should have an enum type. */
5074 for (i = 0; i < syms.size (); i++)
5075 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM)
5078 /* Quick check: They should all have the same value. */
5079 for (i = 1; i < syms.size (); i++)
5080 if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol))
5083 /* Quick check: They should all have the same number of enumerals. */
5084 for (i = 1; i < syms.size (); i++)
5085 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol))
5086 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol)))
5089 /* All the sanity checks passed, so we might have a set of
5090 identical enumeration types. Perform a more complete
5091 comparison of the type of each symbol. */
5092 for (i = 1; i < syms.size (); i++)
5093 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol),
5094 SYMBOL_TYPE (syms[0].symbol)))
5100 /* Remove any non-debugging symbols in SYMS that definitely
5101 duplicate other symbols in the list (The only case I know of where
5102 this happens is when object files containing stabs-in-ecoff are
5103 linked with files containing ordinary ecoff debugging symbols (or no
5104 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5105 Returns the number of items in the modified list. */
5108 remove_extra_symbols (std::vector<struct block_symbol> *syms)
5112 /* We should never be called with less than 2 symbols, as there
5113 cannot be any extra symbol in that case. But it's easy to
5114 handle, since we have nothing to do in that case. */
5115 if (syms->size () < 2)
5116 return syms->size ();
5119 while (i < syms->size ())
5123 /* If two symbols have the same name and one of them is a stub type,
5124 the get rid of the stub. */
5126 if (TYPE_STUB (SYMBOL_TYPE ((*syms)[i].symbol))
5127 && SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL)
5129 for (j = 0; j < syms->size (); j++)
5132 && !TYPE_STUB (SYMBOL_TYPE ((*syms)[j].symbol))
5133 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5134 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5135 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0)
5140 /* Two symbols with the same name, same class and same address
5141 should be identical. */
5143 else if (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL
5144 && SYMBOL_CLASS ((*syms)[i].symbol) == LOC_STATIC
5145 && is_nondebugging_type (SYMBOL_TYPE ((*syms)[i].symbol)))
5147 for (j = 0; j < syms->size (); j += 1)
5150 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5151 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5152 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0
5153 && SYMBOL_CLASS ((*syms)[i].symbol)
5154 == SYMBOL_CLASS ((*syms)[j].symbol)
5155 && SYMBOL_VALUE_ADDRESS ((*syms)[i].symbol)
5156 == SYMBOL_VALUE_ADDRESS ((*syms)[j].symbol))
5162 syms->erase (syms->begin () + i);
5167 /* If all the remaining symbols are identical enumerals, then
5168 just keep the first one and discard the rest.
5170 Unlike what we did previously, we do not discard any entry
5171 unless they are ALL identical. This is because the symbol
5172 comparison is not a strict comparison, but rather a practical
5173 comparison. If all symbols are considered identical, then
5174 we can just go ahead and use the first one and discard the rest.
5175 But if we cannot reduce the list to a single element, we have
5176 to ask the user to disambiguate anyways. And if we have to
5177 present a multiple-choice menu, it's less confusing if the list
5178 isn't missing some choices that were identical and yet distinct. */
5179 if (symbols_are_identical_enums (*syms))
5182 return syms->size ();
5185 /* Given a type that corresponds to a renaming entity, use the type name
5186 to extract the scope (package name or function name, fully qualified,
5187 and following the GNAT encoding convention) where this renaming has been
5191 xget_renaming_scope (struct type *renaming_type)
5193 /* The renaming types adhere to the following convention:
5194 <scope>__<rename>___<XR extension>.
5195 So, to extract the scope, we search for the "___XR" extension,
5196 and then backtrack until we find the first "__". */
5198 const char *name = TYPE_NAME (renaming_type);
5199 const char *suffix = strstr (name, "___XR");
5202 /* Now, backtrack a bit until we find the first "__". Start looking
5203 at suffix - 3, as the <rename> part is at least one character long. */
5205 for (last = suffix - 3; last > name; last--)
5206 if (last[0] == '_' && last[1] == '_')
5209 /* Make a copy of scope and return it. */
5210 return std::string (name, last);
5213 /* Return nonzero if NAME corresponds to a package name. */
5216 is_package_name (const char *name)
5218 /* Here, We take advantage of the fact that no symbols are generated
5219 for packages, while symbols are generated for each function.
5220 So the condition for NAME represent a package becomes equivalent
5221 to NAME not existing in our list of symbols. There is only one
5222 small complication with library-level functions (see below). */
5224 /* If it is a function that has not been defined at library level,
5225 then we should be able to look it up in the symbols. */
5226 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
5229 /* Library-level function names start with "_ada_". See if function
5230 "_ada_" followed by NAME can be found. */
5232 /* Do a quick check that NAME does not contain "__", since library-level
5233 functions names cannot contain "__" in them. */
5234 if (strstr (name, "__") != NULL)
5237 std::string fun_name = string_printf ("_ada_%s", name);
5239 return (standard_lookup (fun_name.c_str (), NULL, VAR_DOMAIN) == NULL);
5242 /* Return nonzero if SYM corresponds to a renaming entity that is
5243 not visible from FUNCTION_NAME. */
5246 old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
5248 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
5251 std::string scope = xget_renaming_scope (SYMBOL_TYPE (sym));
5253 /* If the rename has been defined in a package, then it is visible. */
5254 if (is_package_name (scope.c_str ()))
5257 /* Check that the rename is in the current function scope by checking
5258 that its name starts with SCOPE. */
5260 /* If the function name starts with "_ada_", it means that it is
5261 a library-level function. Strip this prefix before doing the
5262 comparison, as the encoding for the renaming does not contain
5264 if (startswith (function_name, "_ada_"))
5267 return !startswith (function_name, scope.c_str ());
5270 /* Remove entries from SYMS that corresponds to a renaming entity that
5271 is not visible from the function associated with CURRENT_BLOCK or
5272 that is superfluous due to the presence of more specific renaming
5273 information. Places surviving symbols in the initial entries of
5274 SYMS and returns the number of surviving symbols.
5277 First, in cases where an object renaming is implemented as a
5278 reference variable, GNAT may produce both the actual reference
5279 variable and the renaming encoding. In this case, we discard the
5282 Second, GNAT emits a type following a specified encoding for each renaming
5283 entity. Unfortunately, STABS currently does not support the definition
5284 of types that are local to a given lexical block, so all renamings types
5285 are emitted at library level. As a consequence, if an application
5286 contains two renaming entities using the same name, and a user tries to
5287 print the value of one of these entities, the result of the ada symbol
5288 lookup will also contain the wrong renaming type.
5290 This function partially covers for this limitation by attempting to
5291 remove from the SYMS list renaming symbols that should be visible
5292 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5293 method with the current information available. The implementation
5294 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5296 - When the user tries to print a rename in a function while there
5297 is another rename entity defined in a package: Normally, the
5298 rename in the function has precedence over the rename in the
5299 package, so the latter should be removed from the list. This is
5300 currently not the case.
5302 - This function will incorrectly remove valid renames if
5303 the CURRENT_BLOCK corresponds to a function which symbol name
5304 has been changed by an "Export" pragma. As a consequence,
5305 the user will be unable to print such rename entities. */
5308 remove_irrelevant_renamings (std::vector<struct block_symbol> *syms,
5309 const struct block *current_block)
5311 struct symbol *current_function;
5312 const char *current_function_name;
5314 int is_new_style_renaming;
5316 /* If there is both a renaming foo___XR... encoded as a variable and
5317 a simple variable foo in the same block, discard the latter.
5318 First, zero out such symbols, then compress. */
5319 is_new_style_renaming = 0;
5320 for (i = 0; i < syms->size (); i += 1)
5322 struct symbol *sym = (*syms)[i].symbol;
5323 const struct block *block = (*syms)[i].block;
5327 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
5329 name = SYMBOL_LINKAGE_NAME (sym);
5330 suffix = strstr (name, "___XR");
5334 int name_len = suffix - name;
5337 is_new_style_renaming = 1;
5338 for (j = 0; j < syms->size (); j += 1)
5339 if (i != j && (*syms)[j].symbol != NULL
5340 && strncmp (name, SYMBOL_LINKAGE_NAME ((*syms)[j].symbol),
5342 && block == (*syms)[j].block)
5343 (*syms)[j].symbol = NULL;
5346 if (is_new_style_renaming)
5350 for (j = k = 0; j < syms->size (); j += 1)
5351 if ((*syms)[j].symbol != NULL)
5353 (*syms)[k] = (*syms)[j];
5359 /* Extract the function name associated to CURRENT_BLOCK.
5360 Abort if unable to do so. */
5362 if (current_block == NULL)
5363 return syms->size ();
5365 current_function = block_linkage_function (current_block);
5366 if (current_function == NULL)
5367 return syms->size ();
5369 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
5370 if (current_function_name == NULL)
5371 return syms->size ();
5373 /* Check each of the symbols, and remove it from the list if it is
5374 a type corresponding to a renaming that is out of the scope of
5375 the current block. */
5378 while (i < syms->size ())
5380 if (ada_parse_renaming ((*syms)[i].symbol, NULL, NULL, NULL)
5381 == ADA_OBJECT_RENAMING
5382 && old_renaming_is_invisible ((*syms)[i].symbol,
5383 current_function_name))
5384 syms->erase (syms->begin () + i);
5389 return syms->size ();
5392 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5393 whose name and domain match NAME and DOMAIN respectively.
5394 If no match was found, then extend the search to "enclosing"
5395 routines (in other words, if we're inside a nested function,
5396 search the symbols defined inside the enclosing functions).
5397 If WILD_MATCH_P is nonzero, perform the naming matching in
5398 "wild" mode (see function "wild_match" for more info).
5400 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5403 ada_add_local_symbols (struct obstack *obstackp,
5404 const lookup_name_info &lookup_name,
5405 const struct block *block, domain_enum domain)
5407 int block_depth = 0;
5409 while (block != NULL)
5412 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
5414 /* If we found a non-function match, assume that's the one. */
5415 if (is_nonfunction (defns_collected (obstackp, 0),
5416 num_defns_collected (obstackp)))
5419 block = BLOCK_SUPERBLOCK (block);
5422 /* If no luck so far, try to find NAME as a local symbol in some lexically
5423 enclosing subprogram. */
5424 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
5425 add_symbols_from_enclosing_procs (obstackp, lookup_name, domain);
5428 /* An object of this type is used as the user_data argument when
5429 calling the map_matching_symbols method. */
5433 struct objfile *objfile;
5434 struct obstack *obstackp;
5435 struct symbol *arg_sym;
5439 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5440 to a list of symbols. DATA0 is a pointer to a struct match_data *
5441 containing the obstack that collects the symbol list, the file that SYM
5442 must come from, a flag indicating whether a non-argument symbol has
5443 been found in the current block, and the last argument symbol
5444 passed in SYM within the current block (if any). When SYM is null,
5445 marking the end of a block, the argument symbol is added if no
5446 other has been found. */
5449 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
5451 struct match_data *data = (struct match_data *) data0;
5455 if (!data->found_sym && data->arg_sym != NULL)
5456 add_defn_to_vec (data->obstackp,
5457 fixup_symbol_section (data->arg_sym, data->objfile),
5459 data->found_sym = 0;
5460 data->arg_sym = NULL;
5464 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5466 else if (SYMBOL_IS_ARGUMENT (sym))
5467 data->arg_sym = sym;
5470 data->found_sym = 1;
5471 add_defn_to_vec (data->obstackp,
5472 fixup_symbol_section (sym, data->objfile),
5479 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5480 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5481 symbols to OBSTACKP. Return whether we found such symbols. */
5484 ada_add_block_renamings (struct obstack *obstackp,
5485 const struct block *block,
5486 const lookup_name_info &lookup_name,
5489 struct using_direct *renaming;
5490 int defns_mark = num_defns_collected (obstackp);
5492 symbol_name_matcher_ftype *name_match
5493 = ada_get_symbol_name_matcher (lookup_name);
5495 for (renaming = block_using (block);
5497 renaming = renaming->next)
5501 /* Avoid infinite recursions: skip this renaming if we are actually
5502 already traversing it.
5504 Currently, symbol lookup in Ada don't use the namespace machinery from
5505 C++/Fortran support: skip namespace imports that use them. */
5506 if (renaming->searched
5507 || (renaming->import_src != NULL
5508 && renaming->import_src[0] != '\0')
5509 || (renaming->import_dest != NULL
5510 && renaming->import_dest[0] != '\0'))
5512 renaming->searched = 1;
5514 /* TODO: here, we perform another name-based symbol lookup, which can
5515 pull its own multiple overloads. In theory, we should be able to do
5516 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5517 not a simple name. But in order to do this, we would need to enhance
5518 the DWARF reader to associate a symbol to this renaming, instead of a
5519 name. So, for now, we do something simpler: re-use the C++/Fortran
5520 namespace machinery. */
5521 r_name = (renaming->alias != NULL
5523 : renaming->declaration);
5524 if (name_match (r_name, lookup_name, NULL))
5526 lookup_name_info decl_lookup_name (renaming->declaration,
5527 lookup_name.match_type ());
5528 ada_add_all_symbols (obstackp, block, decl_lookup_name, domain,
5531 renaming->searched = 0;
5533 return num_defns_collected (obstackp) != defns_mark;
5536 /* Implements compare_names, but only applying the comparision using
5537 the given CASING. */
5540 compare_names_with_case (const char *string1, const char *string2,
5541 enum case_sensitivity casing)
5543 while (*string1 != '\0' && *string2 != '\0')
5547 if (isspace (*string1) || isspace (*string2))
5548 return strcmp_iw_ordered (string1, string2);
5550 if (casing == case_sensitive_off)
5552 c1 = tolower (*string1);
5553 c2 = tolower (*string2);
5570 return strcmp_iw_ordered (string1, string2);
5572 if (*string2 == '\0')
5574 if (is_name_suffix (string1))
5581 if (*string2 == '(')
5582 return strcmp_iw_ordered (string1, string2);
5585 if (casing == case_sensitive_off)
5586 return tolower (*string1) - tolower (*string2);
5588 return *string1 - *string2;
5593 /* Compare STRING1 to STRING2, with results as for strcmp.
5594 Compatible with strcmp_iw_ordered in that...
5596 strcmp_iw_ordered (STRING1, STRING2) <= 0
5600 compare_names (STRING1, STRING2) <= 0
5602 (they may differ as to what symbols compare equal). */
5605 compare_names (const char *string1, const char *string2)
5609 /* Similar to what strcmp_iw_ordered does, we need to perform
5610 a case-insensitive comparison first, and only resort to
5611 a second, case-sensitive, comparison if the first one was
5612 not sufficient to differentiate the two strings. */
5614 result = compare_names_with_case (string1, string2, case_sensitive_off);
5616 result = compare_names_with_case (string1, string2, case_sensitive_on);
5621 /* Convenience function to get at the Ada encoded lookup name for
5622 LOOKUP_NAME, as a C string. */
5625 ada_lookup_name (const lookup_name_info &lookup_name)
5627 return lookup_name.ada ().lookup_name ().c_str ();
5630 /* Add to OBSTACKP all non-local symbols whose name and domain match
5631 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5632 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5633 symbols otherwise. */
5636 add_nonlocal_symbols (struct obstack *obstackp,
5637 const lookup_name_info &lookup_name,
5638 domain_enum domain, int global)
5640 struct objfile *objfile;
5641 struct compunit_symtab *cu;
5642 struct match_data data;
5644 memset (&data, 0, sizeof data);
5645 data.obstackp = obstackp;
5647 bool is_wild_match = lookup_name.ada ().wild_match_p ();
5649 ALL_OBJFILES (objfile)
5651 data.objfile = objfile;
5654 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5656 aux_add_nonlocal_symbols, &data,
5657 symbol_name_match_type::WILD,
5660 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5662 aux_add_nonlocal_symbols, &data,
5663 symbol_name_match_type::FULL,
5666 ALL_OBJFILE_COMPUNITS (objfile, cu)
5668 const struct block *global_block
5669 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK);
5671 if (ada_add_block_renamings (obstackp, global_block, lookup_name,
5677 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5679 const char *name = ada_lookup_name (lookup_name);
5680 std::string name1 = std::string ("<_ada_") + name + '>';
5682 ALL_OBJFILES (objfile)
5684 data.objfile = objfile;
5685 objfile->sf->qf->map_matching_symbols (objfile, name1.c_str (),
5687 aux_add_nonlocal_symbols,
5689 symbol_name_match_type::FULL,
5695 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5696 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5697 returning the number of matches. Add these to OBSTACKP.
5699 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5700 symbol match within the nest of blocks whose innermost member is BLOCK,
5701 is the one match returned (no other matches in that or
5702 enclosing blocks is returned). If there are any matches in or
5703 surrounding BLOCK, then these alone are returned.
5705 Names prefixed with "standard__" are handled specially:
5706 "standard__" is first stripped off (by the lookup_name
5707 constructor), and only static and global symbols are searched.
5709 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5710 to lookup global symbols. */
5713 ada_add_all_symbols (struct obstack *obstackp,
5714 const struct block *block,
5715 const lookup_name_info &lookup_name,
5718 int *made_global_lookup_p)
5722 if (made_global_lookup_p)
5723 *made_global_lookup_p = 0;
5725 /* Special case: If the user specifies a symbol name inside package
5726 Standard, do a non-wild matching of the symbol name without
5727 the "standard__" prefix. This was primarily introduced in order
5728 to allow the user to specifically access the standard exceptions
5729 using, for instance, Standard.Constraint_Error when Constraint_Error
5730 is ambiguous (due to the user defining its own Constraint_Error
5731 entity inside its program). */
5732 if (lookup_name.ada ().standard_p ())
5735 /* Check the non-global symbols. If we have ANY match, then we're done. */
5740 ada_add_local_symbols (obstackp, lookup_name, block, domain);
5743 /* In the !full_search case we're are being called by
5744 ada_iterate_over_symbols, and we don't want to search
5746 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
5748 if (num_defns_collected (obstackp) > 0 || !full_search)
5752 /* No non-global symbols found. Check our cache to see if we have
5753 already performed this search before. If we have, then return
5756 if (lookup_cached_symbol (ada_lookup_name (lookup_name),
5757 domain, &sym, &block))
5760 add_defn_to_vec (obstackp, sym, block);
5764 if (made_global_lookup_p)
5765 *made_global_lookup_p = 1;
5767 /* Search symbols from all global blocks. */
5769 add_nonlocal_symbols (obstackp, lookup_name, domain, 1);
5771 /* Now add symbols from all per-file blocks if we've gotten no hits
5772 (not strictly correct, but perhaps better than an error). */
5774 if (num_defns_collected (obstackp) == 0)
5775 add_nonlocal_symbols (obstackp, lookup_name, domain, 0);
5778 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5779 is non-zero, enclosing scope and in global scopes, returning the number of
5781 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5782 found and the blocks and symbol tables (if any) in which they were
5785 When full_search is non-zero, any non-function/non-enumeral
5786 symbol match within the nest of blocks whose innermost member is BLOCK,
5787 is the one match returned (no other matches in that or
5788 enclosing blocks is returned). If there are any matches in or
5789 surrounding BLOCK, then these alone are returned.
5791 Names prefixed with "standard__" are handled specially: "standard__"
5792 is first stripped off, and only static and global symbols are searched. */
5795 ada_lookup_symbol_list_worker (const lookup_name_info &lookup_name,
5796 const struct block *block,
5798 std::vector<struct block_symbol> *results,
5801 int syms_from_global_search;
5803 auto_obstack obstack;
5805 ada_add_all_symbols (&obstack, block, lookup_name,
5806 domain, full_search, &syms_from_global_search);
5808 ndefns = num_defns_collected (&obstack);
5810 struct block_symbol *base = defns_collected (&obstack, 1);
5811 for (int i = 0; i < ndefns; ++i)
5812 results->push_back (base[i]);
5814 ndefns = remove_extra_symbols (results);
5816 if (ndefns == 0 && full_search && syms_from_global_search)
5817 cache_symbol (ada_lookup_name (lookup_name), domain, NULL, NULL);
5819 if (ndefns == 1 && full_search && syms_from_global_search)
5820 cache_symbol (ada_lookup_name (lookup_name), domain,
5821 (*results)[0].symbol, (*results)[0].block);
5823 ndefns = remove_irrelevant_renamings (results, block);
5828 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5829 in global scopes, returning the number of matches, and filling *RESULTS
5830 with (SYM,BLOCK) tuples.
5832 See ada_lookup_symbol_list_worker for further details. */
5835 ada_lookup_symbol_list (const char *name, const struct block *block,
5837 std::vector<struct block_symbol> *results)
5839 symbol_name_match_type name_match_type = name_match_type_from_name (name);
5840 lookup_name_info lookup_name (name, name_match_type);
5842 return ada_lookup_symbol_list_worker (lookup_name, block, domain, results, 1);
5845 /* Implementation of the la_iterate_over_symbols method. */
5848 ada_iterate_over_symbols
5849 (const struct block *block, const lookup_name_info &name,
5851 gdb::function_view<symbol_found_callback_ftype> callback)
5854 std::vector<struct block_symbol> results;
5856 ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0);
5858 for (i = 0; i < ndefs; ++i)
5860 if (!callback (&results[i]))
5865 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5866 to 1, but choosing the first symbol found if there are multiple
5869 The result is stored in *INFO, which must be non-NULL.
5870 If no match is found, INFO->SYM is set to NULL. */
5873 ada_lookup_encoded_symbol (const char *name, const struct block *block,
5875 struct block_symbol *info)
5877 /* Since we already have an encoded name, wrap it in '<>' to force a
5878 verbatim match. Otherwise, if the name happens to not look like
5879 an encoded name (because it doesn't include a "__"),
5880 ada_lookup_name_info would re-encode/fold it again, and that
5881 would e.g., incorrectly lowercase object renaming names like
5882 "R28b" -> "r28b". */
5883 std::string verbatim = std::string ("<") + name + '>';
5885 gdb_assert (info != NULL);
5886 *info = ada_lookup_symbol (verbatim.c_str (), block, domain, NULL);
5889 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5890 scope and in global scopes, or NULL if none. NAME is folded and
5891 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5892 choosing the first symbol if there are multiple choices.
5893 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5896 ada_lookup_symbol (const char *name, const struct block *block0,
5897 domain_enum domain, int *is_a_field_of_this)
5899 if (is_a_field_of_this != NULL)
5900 *is_a_field_of_this = 0;
5902 std::vector<struct block_symbol> candidates;
5905 n_candidates = ada_lookup_symbol_list (name, block0, domain, &candidates);
5907 if (n_candidates == 0)
5910 block_symbol info = candidates[0];
5911 info.symbol = fixup_symbol_section (info.symbol, NULL);
5915 static struct block_symbol
5916 ada_lookup_symbol_nonlocal (const struct language_defn *langdef,
5918 const struct block *block,
5919 const domain_enum domain)
5921 struct block_symbol sym;
5923 sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5924 if (sym.symbol != NULL)
5927 /* If we haven't found a match at this point, try the primitive
5928 types. In other languages, this search is performed before
5929 searching for global symbols in order to short-circuit that
5930 global-symbol search if it happens that the name corresponds
5931 to a primitive type. But we cannot do the same in Ada, because
5932 it is perfectly legitimate for a program to declare a type which
5933 has the same name as a standard type. If looking up a type in
5934 that situation, we have traditionally ignored the primitive type
5935 in favor of user-defined types. This is why, unlike most other
5936 languages, we search the primitive types this late and only after
5937 having searched the global symbols without success. */
5939 if (domain == VAR_DOMAIN)
5941 struct gdbarch *gdbarch;
5944 gdbarch = target_gdbarch ();
5946 gdbarch = block_gdbarch (block);
5947 sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name);
5948 if (sym.symbol != NULL)
5952 return (struct block_symbol) {NULL, NULL};
5956 /* True iff STR is a possible encoded suffix of a normal Ada name
5957 that is to be ignored for matching purposes. Suffixes of parallel
5958 names (e.g., XVE) are not included here. Currently, the possible suffixes
5959 are given by any of the regular expressions:
5961 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5962 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5963 TKB [subprogram suffix for task bodies]
5964 _E[0-9]+[bs]$ [protected object entry suffixes]
5965 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5967 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5968 match is performed. This sequence is used to differentiate homonyms,
5969 is an optional part of a valid name suffix. */
5972 is_name_suffix (const char *str)
5975 const char *matching;
5976 const int len = strlen (str);
5978 /* Skip optional leading __[0-9]+. */
5980 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5983 while (isdigit (str[0]))
5989 if (str[0] == '.' || str[0] == '$')
5992 while (isdigit (matching[0]))
5994 if (matching[0] == '\0')
6000 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
6003 while (isdigit (matching[0]))
6005 if (matching[0] == '\0')
6009 /* "TKB" suffixes are used for subprograms implementing task bodies. */
6011 if (strcmp (str, "TKB") == 0)
6015 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
6016 with a N at the end. Unfortunately, the compiler uses the same
6017 convention for other internal types it creates. So treating
6018 all entity names that end with an "N" as a name suffix causes
6019 some regressions. For instance, consider the case of an enumerated
6020 type. To support the 'Image attribute, it creates an array whose
6022 Having a single character like this as a suffix carrying some
6023 information is a bit risky. Perhaps we should change the encoding
6024 to be something like "_N" instead. In the meantime, do not do
6025 the following check. */
6026 /* Protected Object Subprograms */
6027 if (len == 1 && str [0] == 'N')
6032 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
6035 while (isdigit (matching[0]))
6037 if ((matching[0] == 'b' || matching[0] == 's')
6038 && matching [1] == '\0')
6042 /* ??? We should not modify STR directly, as we are doing below. This
6043 is fine in this case, but may become problematic later if we find
6044 that this alternative did not work, and want to try matching
6045 another one from the begining of STR. Since we modified it, we
6046 won't be able to find the begining of the string anymore! */
6050 while (str[0] != '_' && str[0] != '\0')
6052 if (str[0] != 'n' && str[0] != 'b')
6058 if (str[0] == '\000')
6063 if (str[1] != '_' || str[2] == '\000')
6067 if (strcmp (str + 3, "JM") == 0)
6069 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6070 the LJM suffix in favor of the JM one. But we will
6071 still accept LJM as a valid suffix for a reasonable
6072 amount of time, just to allow ourselves to debug programs
6073 compiled using an older version of GNAT. */
6074 if (strcmp (str + 3, "LJM") == 0)
6078 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
6079 || str[4] == 'U' || str[4] == 'P')
6081 if (str[4] == 'R' && str[5] != 'T')
6085 if (!isdigit (str[2]))
6087 for (k = 3; str[k] != '\0'; k += 1)
6088 if (!isdigit (str[k]) && str[k] != '_')
6092 if (str[0] == '$' && isdigit (str[1]))
6094 for (k = 2; str[k] != '\0'; k += 1)
6095 if (!isdigit (str[k]) && str[k] != '_')
6102 /* Return non-zero if the string starting at NAME and ending before
6103 NAME_END contains no capital letters. */
6106 is_valid_name_for_wild_match (const char *name0)
6108 const char *decoded_name = ada_decode (name0);
6111 /* If the decoded name starts with an angle bracket, it means that
6112 NAME0 does not follow the GNAT encoding format. It should then
6113 not be allowed as a possible wild match. */
6114 if (decoded_name[0] == '<')
6117 for (i=0; decoded_name[i] != '\0'; i++)
6118 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
6124 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6125 that could start a simple name. Assumes that *NAMEP points into
6126 the string beginning at NAME0. */
6129 advance_wild_match (const char **namep, const char *name0, int target0)
6131 const char *name = *namep;
6141 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
6144 if (name == name0 + 5 && startswith (name0, "_ada"))
6149 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
6150 || name[2] == target0))
6158 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
6168 /* Return true iff NAME encodes a name of the form prefix.PATN.
6169 Ignores any informational suffixes of NAME (i.e., for which
6170 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6174 wild_match (const char *name, const char *patn)
6177 const char *name0 = name;
6181 const char *match = name;
6185 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
6188 if (*p == '\0' && is_name_suffix (name))
6189 return match == name0 || is_valid_name_for_wild_match (name0);
6191 if (name[-1] == '_')
6194 if (!advance_wild_match (&name, name0, *patn))
6199 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6200 any trailing suffixes that encode debugging information or leading
6201 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6202 information that is ignored). */
6205 full_match (const char *sym_name, const char *search_name)
6207 size_t search_name_len = strlen (search_name);
6209 if (strncmp (sym_name, search_name, search_name_len) == 0
6210 && is_name_suffix (sym_name + search_name_len))
6213 if (startswith (sym_name, "_ada_")
6214 && strncmp (sym_name + 5, search_name, search_name_len) == 0
6215 && is_name_suffix (sym_name + search_name_len + 5))
6221 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6222 *defn_symbols, updating the list of symbols in OBSTACKP (if
6223 necessary). OBJFILE is the section containing BLOCK. */
6226 ada_add_block_symbols (struct obstack *obstackp,
6227 const struct block *block,
6228 const lookup_name_info &lookup_name,
6229 domain_enum domain, struct objfile *objfile)
6231 struct block_iterator iter;
6232 /* A matching argument symbol, if any. */
6233 struct symbol *arg_sym;
6234 /* Set true when we find a matching non-argument symbol. */
6240 for (sym = block_iter_match_first (block, lookup_name, &iter);
6242 sym = block_iter_match_next (lookup_name, &iter))
6244 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6245 SYMBOL_DOMAIN (sym), domain))
6247 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6249 if (SYMBOL_IS_ARGUMENT (sym))
6254 add_defn_to_vec (obstackp,
6255 fixup_symbol_section (sym, objfile),
6262 /* Handle renamings. */
6264 if (ada_add_block_renamings (obstackp, block, lookup_name, domain))
6267 if (!found_sym && arg_sym != NULL)
6269 add_defn_to_vec (obstackp,
6270 fixup_symbol_section (arg_sym, objfile),
6274 if (!lookup_name.ada ().wild_match_p ())
6278 const std::string &ada_lookup_name = lookup_name.ada ().lookup_name ();
6279 const char *name = ada_lookup_name.c_str ();
6280 size_t name_len = ada_lookup_name.size ();
6282 ALL_BLOCK_SYMBOLS (block, iter, sym)
6284 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6285 SYMBOL_DOMAIN (sym), domain))
6289 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
6292 cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_");
6294 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
6299 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
6301 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6303 if (SYMBOL_IS_ARGUMENT (sym))
6308 add_defn_to_vec (obstackp,
6309 fixup_symbol_section (sym, objfile),
6317 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6318 They aren't parameters, right? */
6319 if (!found_sym && arg_sym != NULL)
6321 add_defn_to_vec (obstackp,
6322 fixup_symbol_section (arg_sym, objfile),
6329 /* Symbol Completion */
6334 ada_lookup_name_info::matches
6335 (const char *sym_name,
6336 symbol_name_match_type match_type,
6337 completion_match_result *comp_match_res) const
6340 const char *text = m_encoded_name.c_str ();
6341 size_t text_len = m_encoded_name.size ();
6343 /* First, test against the fully qualified name of the symbol. */
6345 if (strncmp (sym_name, text, text_len) == 0)
6348 if (match && !m_encoded_p)
6350 /* One needed check before declaring a positive match is to verify
6351 that iff we are doing a verbatim match, the decoded version
6352 of the symbol name starts with '<'. Otherwise, this symbol name
6353 is not a suitable completion. */
6354 const char *sym_name_copy = sym_name;
6355 bool has_angle_bracket;
6357 sym_name = ada_decode (sym_name);
6358 has_angle_bracket = (sym_name[0] == '<');
6359 match = (has_angle_bracket == m_verbatim_p);
6360 sym_name = sym_name_copy;
6363 if (match && !m_verbatim_p)
6365 /* When doing non-verbatim match, another check that needs to
6366 be done is to verify that the potentially matching symbol name
6367 does not include capital letters, because the ada-mode would
6368 not be able to understand these symbol names without the
6369 angle bracket notation. */
6372 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
6377 /* Second: Try wild matching... */
6379 if (!match && m_wild_match_p)
6381 /* Since we are doing wild matching, this means that TEXT
6382 may represent an unqualified symbol name. We therefore must
6383 also compare TEXT against the unqualified name of the symbol. */
6384 sym_name = ada_unqualified_name (ada_decode (sym_name));
6386 if (strncmp (sym_name, text, text_len) == 0)
6390 /* Finally: If we found a match, prepare the result to return. */
6395 if (comp_match_res != NULL)
6397 std::string &match_str = comp_match_res->match.storage ();
6400 match_str = ada_decode (sym_name);
6404 match_str = add_angle_brackets (sym_name);
6406 match_str = sym_name;
6410 comp_match_res->set_match (match_str.c_str ());
6416 /* Add the list of possible symbol names completing TEXT to TRACKER.
6417 WORD is the entire command on which completion is made. */
6420 ada_collect_symbol_completion_matches (completion_tracker &tracker,
6421 complete_symbol_mode mode,
6422 symbol_name_match_type name_match_type,
6423 const char *text, const char *word,
6424 enum type_code code)
6427 struct compunit_symtab *s;
6428 struct minimal_symbol *msymbol;
6429 struct objfile *objfile;
6430 const struct block *b, *surrounding_static_block = 0;
6431 struct block_iterator iter;
6433 gdb_assert (code == TYPE_CODE_UNDEF);
6435 lookup_name_info lookup_name (text, name_match_type, true);
6437 /* First, look at the partial symtab symbols. */
6438 expand_symtabs_matching (NULL,
6444 /* At this point scan through the misc symbol vectors and add each
6445 symbol you find to the list. Eventually we want to ignore
6446 anything that isn't a text symbol (everything else will be
6447 handled by the psymtab code above). */
6449 ALL_MSYMBOLS (objfile, msymbol)
6453 if (completion_skip_symbol (mode, msymbol))
6456 language symbol_language = MSYMBOL_LANGUAGE (msymbol);
6458 /* Ada minimal symbols won't have their language set to Ada. If
6459 we let completion_list_add_name compare using the
6460 default/C-like matcher, then when completing e.g., symbols in a
6461 package named "pck", we'd match internal Ada symbols like
6462 "pckS", which are invalid in an Ada expression, unless you wrap
6463 them in '<' '>' to request a verbatim match.
6465 Unfortunately, some Ada encoded names successfully demangle as
6466 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6467 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6468 with the wrong language set. Paper over that issue here. */
6469 if (symbol_language == language_auto
6470 || symbol_language == language_cplus)
6471 symbol_language = language_ada;
6473 completion_list_add_name (tracker,
6475 MSYMBOL_LINKAGE_NAME (msymbol),
6476 lookup_name, text, word);
6479 /* Search upwards from currently selected frame (so that we can
6480 complete on local vars. */
6482 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
6484 if (!BLOCK_SUPERBLOCK (b))
6485 surrounding_static_block = b; /* For elmin of dups */
6487 ALL_BLOCK_SYMBOLS (b, iter, sym)
6489 if (completion_skip_symbol (mode, sym))
6492 completion_list_add_name (tracker,
6493 SYMBOL_LANGUAGE (sym),
6494 SYMBOL_LINKAGE_NAME (sym),
6495 lookup_name, text, word);
6499 /* Go through the symtabs and check the externs and statics for
6500 symbols which match. */
6502 ALL_COMPUNITS (objfile, s)
6505 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK);
6506 ALL_BLOCK_SYMBOLS (b, iter, sym)
6508 if (completion_skip_symbol (mode, sym))
6511 completion_list_add_name (tracker,
6512 SYMBOL_LANGUAGE (sym),
6513 SYMBOL_LINKAGE_NAME (sym),
6514 lookup_name, text, word);
6518 ALL_COMPUNITS (objfile, s)
6521 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK);
6522 /* Don't do this block twice. */
6523 if (b == surrounding_static_block)
6525 ALL_BLOCK_SYMBOLS (b, iter, sym)
6527 if (completion_skip_symbol (mode, sym))
6530 completion_list_add_name (tracker,
6531 SYMBOL_LANGUAGE (sym),
6532 SYMBOL_LINKAGE_NAME (sym),
6533 lookup_name, text, word);
6540 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6541 for tagged types. */
6544 ada_is_dispatch_table_ptr_type (struct type *type)
6548 if (TYPE_CODE (type) != TYPE_CODE_PTR)
6551 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
6555 return (strcmp (name, "ada__tags__dispatch_table") == 0);
6558 /* Return non-zero if TYPE is an interface tag. */
6561 ada_is_interface_tag (struct type *type)
6563 const char *name = TYPE_NAME (type);
6568 return (strcmp (name, "ada__tags__interface_tag") == 0);
6571 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6572 to be invisible to users. */
6575 ada_is_ignored_field (struct type *type, int field_num)
6577 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
6580 /* Check the name of that field. */
6582 const char *name = TYPE_FIELD_NAME (type, field_num);
6584 /* Anonymous field names should not be printed.
6585 brobecker/2007-02-20: I don't think this can actually happen
6586 but we don't want to print the value of annonymous fields anyway. */
6590 /* Normally, fields whose name start with an underscore ("_")
6591 are fields that have been internally generated by the compiler,
6592 and thus should not be printed. The "_parent" field is special,
6593 however: This is a field internally generated by the compiler
6594 for tagged types, and it contains the components inherited from
6595 the parent type. This field should not be printed as is, but
6596 should not be ignored either. */
6597 if (name[0] == '_' && !startswith (name, "_parent"))
6601 /* If this is the dispatch table of a tagged type or an interface tag,
6603 if (ada_is_tagged_type (type, 1)
6604 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num))
6605 || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num))))
6608 /* Not a special field, so it should not be ignored. */
6612 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6613 pointer or reference type whose ultimate target has a tag field. */
6616 ada_is_tagged_type (struct type *type, int refok)
6618 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1) != NULL);
6621 /* True iff TYPE represents the type of X'Tag */
6624 ada_is_tag_type (struct type *type)
6626 type = ada_check_typedef (type);
6628 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
6632 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
6634 return (name != NULL
6635 && strcmp (name, "ada__tags__dispatch_table") == 0);
6639 /* The type of the tag on VAL. */
6642 ada_tag_type (struct value *val)
6644 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0);
6647 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6648 retired at Ada 05). */
6651 is_ada95_tag (struct value *tag)
6653 return ada_value_struct_elt (tag, "tsd", 1) != NULL;
6656 /* The value of the tag on VAL. */
6659 ada_value_tag (struct value *val)
6661 return ada_value_struct_elt (val, "_tag", 0);
6664 /* The value of the tag on the object of type TYPE whose contents are
6665 saved at VALADDR, if it is non-null, or is at memory address
6668 static struct value *
6669 value_tag_from_contents_and_address (struct type *type,
6670 const gdb_byte *valaddr,
6673 int tag_byte_offset;
6674 struct type *tag_type;
6676 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
6679 const gdb_byte *valaddr1 = ((valaddr == NULL)
6681 : valaddr + tag_byte_offset);
6682 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
6684 return value_from_contents_and_address (tag_type, valaddr1, address1);
6689 static struct type *
6690 type_from_tag (struct value *tag)
6692 const char *type_name = ada_tag_name (tag);
6694 if (type_name != NULL)
6695 return ada_find_any_type (ada_encode (type_name));
6699 /* Given a value OBJ of a tagged type, return a value of this
6700 type at the base address of the object. The base address, as
6701 defined in Ada.Tags, it is the address of the primary tag of
6702 the object, and therefore where the field values of its full
6703 view can be fetched. */
6706 ada_tag_value_at_base_address (struct value *obj)
6709 LONGEST offset_to_top = 0;
6710 struct type *ptr_type, *obj_type;
6712 CORE_ADDR base_address;
6714 obj_type = value_type (obj);
6716 /* It is the responsability of the caller to deref pointers. */
6718 if (TYPE_CODE (obj_type) == TYPE_CODE_PTR
6719 || TYPE_CODE (obj_type) == TYPE_CODE_REF)
6722 tag = ada_value_tag (obj);
6726 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6728 if (is_ada95_tag (tag))
6731 ptr_type = language_lookup_primitive_type
6732 (language_def (language_ada), target_gdbarch(), "storage_offset");
6733 ptr_type = lookup_pointer_type (ptr_type);
6734 val = value_cast (ptr_type, tag);
6738 /* It is perfectly possible that an exception be raised while
6739 trying to determine the base address, just like for the tag;
6740 see ada_tag_name for more details. We do not print the error
6741 message for the same reason. */
6745 offset_to_top = value_as_long (value_ind (value_ptradd (val, -2)));
6748 CATCH (e, RETURN_MASK_ERROR)
6754 /* If offset is null, nothing to do. */
6756 if (offset_to_top == 0)
6759 /* -1 is a special case in Ada.Tags; however, what should be done
6760 is not quite clear from the documentation. So do nothing for
6763 if (offset_to_top == -1)
6766 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6767 from the base address. This was however incompatible with
6768 C++ dispatch table: C++ uses a *negative* value to *add*
6769 to the base address. Ada's convention has therefore been
6770 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6771 use the same convention. Here, we support both cases by
6772 checking the sign of OFFSET_TO_TOP. */
6774 if (offset_to_top > 0)
6775 offset_to_top = -offset_to_top;
6777 base_address = value_address (obj) + offset_to_top;
6778 tag = value_tag_from_contents_and_address (obj_type, NULL, base_address);
6780 /* Make sure that we have a proper tag at the new address.
6781 Otherwise, offset_to_top is bogus (which can happen when
6782 the object is not initialized yet). */
6787 obj_type = type_from_tag (tag);
6792 return value_from_contents_and_address (obj_type, NULL, base_address);
6795 /* Return the "ada__tags__type_specific_data" type. */
6797 static struct type *
6798 ada_get_tsd_type (struct inferior *inf)
6800 struct ada_inferior_data *data = get_ada_inferior_data (inf);
6802 if (data->tsd_type == 0)
6803 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6804 return data->tsd_type;
6807 /* Return the TSD (type-specific data) associated to the given TAG.
6808 TAG is assumed to be the tag of a tagged-type entity.
6810 May return NULL if we are unable to get the TSD. */
6812 static struct value *
6813 ada_get_tsd_from_tag (struct value *tag)
6818 /* First option: The TSD is simply stored as a field of our TAG.
6819 Only older versions of GNAT would use this format, but we have
6820 to test it first, because there are no visible markers for
6821 the current approach except the absence of that field. */
6823 val = ada_value_struct_elt (tag, "tsd", 1);
6827 /* Try the second representation for the dispatch table (in which
6828 there is no explicit 'tsd' field in the referent of the tag pointer,
6829 and instead the tsd pointer is stored just before the dispatch
6832 type = ada_get_tsd_type (current_inferior());
6835 type = lookup_pointer_type (lookup_pointer_type (type));
6836 val = value_cast (type, tag);
6839 return value_ind (value_ptradd (val, -1));
6842 /* Given the TSD of a tag (type-specific data), return a string
6843 containing the name of the associated type.
6845 The returned value is good until the next call. May return NULL
6846 if we are unable to determine the tag name. */
6849 ada_tag_name_from_tsd (struct value *tsd)
6851 static char name[1024];
6855 val = ada_value_struct_elt (tsd, "expanded_name", 1);
6858 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6859 for (p = name; *p != '\0'; p += 1)
6865 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6868 Return NULL if the TAG is not an Ada tag, or if we were unable to
6869 determine the name of that tag. The result is good until the next
6873 ada_tag_name (struct value *tag)
6877 if (!ada_is_tag_type (value_type (tag)))
6880 /* It is perfectly possible that an exception be raised while trying
6881 to determine the TAG's name, even under normal circumstances:
6882 The associated variable may be uninitialized or corrupted, for
6883 instance. We do not let any exception propagate past this point.
6884 instead we return NULL.
6886 We also do not print the error message either (which often is very
6887 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6888 the caller print a more meaningful message if necessary. */
6891 struct value *tsd = ada_get_tsd_from_tag (tag);
6894 name = ada_tag_name_from_tsd (tsd);
6896 CATCH (e, RETURN_MASK_ERROR)
6904 /* The parent type of TYPE, or NULL if none. */
6907 ada_parent_type (struct type *type)
6911 type = ada_check_typedef (type);
6913 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6916 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6917 if (ada_is_parent_field (type, i))
6919 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6921 /* If the _parent field is a pointer, then dereference it. */
6922 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6923 parent_type = TYPE_TARGET_TYPE (parent_type);
6924 /* If there is a parallel XVS type, get the actual base type. */
6925 parent_type = ada_get_base_type (parent_type);
6927 return ada_check_typedef (parent_type);
6933 /* True iff field number FIELD_NUM of structure type TYPE contains the
6934 parent-type (inherited) fields of a derived type. Assumes TYPE is
6935 a structure type with at least FIELD_NUM+1 fields. */
6938 ada_is_parent_field (struct type *type, int field_num)
6940 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6942 return (name != NULL
6943 && (startswith (name, "PARENT")
6944 || startswith (name, "_parent")));
6947 /* True iff field number FIELD_NUM of structure type TYPE is a
6948 transparent wrapper field (which should be silently traversed when doing
6949 field selection and flattened when printing). Assumes TYPE is a
6950 structure type with at least FIELD_NUM+1 fields. Such fields are always
6954 ada_is_wrapper_field (struct type *type, int field_num)
6956 const char *name = TYPE_FIELD_NAME (type, field_num);
6958 if (name != NULL && strcmp (name, "RETVAL") == 0)
6960 /* This happens in functions with "out" or "in out" parameters
6961 which are passed by copy. For such functions, GNAT describes
6962 the function's return type as being a struct where the return
6963 value is in a field called RETVAL, and where the other "out"
6964 or "in out" parameters are fields of that struct. This is not
6969 return (name != NULL
6970 && (startswith (name, "PARENT")
6971 || strcmp (name, "REP") == 0
6972 || startswith (name, "_parent")
6973 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6976 /* True iff field number FIELD_NUM of structure or union type TYPE
6977 is a variant wrapper. Assumes TYPE is a structure type with at least
6978 FIELD_NUM+1 fields. */
6981 ada_is_variant_part (struct type *type, int field_num)
6983 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6985 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6986 || (is_dynamic_field (type, field_num)
6987 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6988 == TYPE_CODE_UNION)));
6991 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6992 whose discriminants are contained in the record type OUTER_TYPE,
6993 returns the type of the controlling discriminant for the variant.
6994 May return NULL if the type could not be found. */
6997 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6999 const char *name = ada_variant_discrim_name (var_type);
7001 return ada_lookup_struct_elt_type (outer_type, name, 1, 1);
7004 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
7005 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
7006 represents a 'when others' clause; otherwise 0. */
7009 ada_is_others_clause (struct type *type, int field_num)
7011 const char *name = TYPE_FIELD_NAME (type, field_num);
7013 return (name != NULL && name[0] == 'O');
7016 /* Assuming that TYPE0 is the type of the variant part of a record,
7017 returns the name of the discriminant controlling the variant.
7018 The value is valid until the next call to ada_variant_discrim_name. */
7021 ada_variant_discrim_name (struct type *type0)
7023 static char *result = NULL;
7024 static size_t result_len = 0;
7027 const char *discrim_end;
7028 const char *discrim_start;
7030 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
7031 type = TYPE_TARGET_TYPE (type0);
7035 name = ada_type_name (type);
7037 if (name == NULL || name[0] == '\000')
7040 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
7043 if (startswith (discrim_end, "___XVN"))
7046 if (discrim_end == name)
7049 for (discrim_start = discrim_end; discrim_start != name + 3;
7052 if (discrim_start == name + 1)
7054 if ((discrim_start > name + 3
7055 && startswith (discrim_start - 3, "___"))
7056 || discrim_start[-1] == '.')
7060 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
7061 strncpy (result, discrim_start, discrim_end - discrim_start);
7062 result[discrim_end - discrim_start] = '\0';
7066 /* Scan STR for a subtype-encoded number, beginning at position K.
7067 Put the position of the character just past the number scanned in
7068 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7069 Return 1 if there was a valid number at the given position, and 0
7070 otherwise. A "subtype-encoded" number consists of the absolute value
7071 in decimal, followed by the letter 'm' to indicate a negative number.
7072 Assumes 0m does not occur. */
7075 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
7079 if (!isdigit (str[k]))
7082 /* Do it the hard way so as not to make any assumption about
7083 the relationship of unsigned long (%lu scan format code) and
7086 while (isdigit (str[k]))
7088 RU = RU * 10 + (str[k] - '0');
7095 *R = (-(LONGEST) (RU - 1)) - 1;
7101 /* NOTE on the above: Technically, C does not say what the results of
7102 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7103 number representable as a LONGEST (although either would probably work
7104 in most implementations). When RU>0, the locution in the then branch
7105 above is always equivalent to the negative of RU. */
7112 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7113 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7114 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7117 ada_in_variant (LONGEST val, struct type *type, int field_num)
7119 const char *name = TYPE_FIELD_NAME (type, field_num);
7133 if (!ada_scan_number (name, p + 1, &W, &p))
7143 if (!ada_scan_number (name, p + 1, &L, &p)
7144 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
7146 if (val >= L && val <= U)
7158 /* FIXME: Lots of redundancy below. Try to consolidate. */
7160 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7161 ARG_TYPE, extract and return the value of one of its (non-static)
7162 fields. FIELDNO says which field. Differs from value_primitive_field
7163 only in that it can handle packed values of arbitrary type. */
7165 static struct value *
7166 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
7167 struct type *arg_type)
7171 arg_type = ada_check_typedef (arg_type);
7172 type = TYPE_FIELD_TYPE (arg_type, fieldno);
7174 /* Handle packed fields. */
7176 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
7178 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
7179 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
7181 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
7182 offset + bit_pos / 8,
7183 bit_pos % 8, bit_size, type);
7186 return value_primitive_field (arg1, offset, fieldno, arg_type);
7189 /* Find field with name NAME in object of type TYPE. If found,
7190 set the following for each argument that is non-null:
7191 - *FIELD_TYPE_P to the field's type;
7192 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7193 an object of that type;
7194 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7195 - *BIT_SIZE_P to its size in bits if the field is packed, and
7197 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7198 fields up to but not including the desired field, or by the total
7199 number of fields if not found. A NULL value of NAME never
7200 matches; the function just counts visible fields in this case.
7202 Notice that we need to handle when a tagged record hierarchy
7203 has some components with the same name, like in this scenario:
7205 type Top_T is tagged record
7211 type Middle_T is new Top.Top_T with record
7212 N : Character := 'a';
7216 type Bottom_T is new Middle.Middle_T with record
7218 C : Character := '5';
7220 A : Character := 'J';
7223 Let's say we now have a variable declared and initialized as follow:
7225 TC : Top_A := new Bottom_T;
7227 And then we use this variable to call this function
7229 procedure Assign (Obj: in out Top_T; TV : Integer);
7233 Assign (Top_T (B), 12);
7235 Now, we're in the debugger, and we're inside that procedure
7236 then and we want to print the value of obj.c:
7238 Usually, the tagged record or one of the parent type owns the
7239 component to print and there's no issue but in this particular
7240 case, what does it mean to ask for Obj.C? Since the actual
7241 type for object is type Bottom_T, it could mean two things: type
7242 component C from the Middle_T view, but also component C from
7243 Bottom_T. So in that "undefined" case, when the component is
7244 not found in the non-resolved type (which includes all the
7245 components of the parent type), then resolve it and see if we
7246 get better luck once expanded.
7248 In the case of homonyms in the derived tagged type, we don't
7249 guaranty anything, and pick the one that's easiest for us
7252 Returns 1 if found, 0 otherwise. */
7255 find_struct_field (const char *name, struct type *type, int offset,
7256 struct type **field_type_p,
7257 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
7261 int parent_offset = -1;
7263 type = ada_check_typedef (type);
7265 if (field_type_p != NULL)
7266 *field_type_p = NULL;
7267 if (byte_offset_p != NULL)
7269 if (bit_offset_p != NULL)
7271 if (bit_size_p != NULL)
7274 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7276 int bit_pos = TYPE_FIELD_BITPOS (type, i);
7277 int fld_offset = offset + bit_pos / 8;
7278 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7280 if (t_field_name == NULL)
7283 else if (ada_is_parent_field (type, i))
7285 /* This is a field pointing us to the parent type of a tagged
7286 type. As hinted in this function's documentation, we give
7287 preference to fields in the current record first, so what
7288 we do here is just record the index of this field before
7289 we skip it. If it turns out we couldn't find our field
7290 in the current record, then we'll get back to it and search
7291 inside it whether the field might exist in the parent. */
7297 else if (name != NULL && field_name_match (t_field_name, name))
7299 int bit_size = TYPE_FIELD_BITSIZE (type, i);
7301 if (field_type_p != NULL)
7302 *field_type_p = TYPE_FIELD_TYPE (type, i);
7303 if (byte_offset_p != NULL)
7304 *byte_offset_p = fld_offset;
7305 if (bit_offset_p != NULL)
7306 *bit_offset_p = bit_pos % 8;
7307 if (bit_size_p != NULL)
7308 *bit_size_p = bit_size;
7311 else if (ada_is_wrapper_field (type, i))
7313 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
7314 field_type_p, byte_offset_p, bit_offset_p,
7315 bit_size_p, index_p))
7318 else if (ada_is_variant_part (type, i))
7320 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7323 struct type *field_type
7324 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
7326 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
7328 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
7330 + TYPE_FIELD_BITPOS (field_type, j) / 8,
7331 field_type_p, byte_offset_p,
7332 bit_offset_p, bit_size_p, index_p))
7336 else if (index_p != NULL)
7340 /* Field not found so far. If this is a tagged type which
7341 has a parent, try finding that field in the parent now. */
7343 if (parent_offset != -1)
7345 int bit_pos = TYPE_FIELD_BITPOS (type, parent_offset);
7346 int fld_offset = offset + bit_pos / 8;
7348 if (find_struct_field (name, TYPE_FIELD_TYPE (type, parent_offset),
7349 fld_offset, field_type_p, byte_offset_p,
7350 bit_offset_p, bit_size_p, index_p))
7357 /* Number of user-visible fields in record type TYPE. */
7360 num_visible_fields (struct type *type)
7365 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
7369 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7370 and search in it assuming it has (class) type TYPE.
7371 If found, return value, else return NULL.
7373 Searches recursively through wrapper fields (e.g., '_parent').
7375 In the case of homonyms in the tagged types, please refer to the
7376 long explanation in find_struct_field's function documentation. */
7378 static struct value *
7379 ada_search_struct_field (const char *name, struct value *arg, int offset,
7383 int parent_offset = -1;
7385 type = ada_check_typedef (type);
7386 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7388 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7390 if (t_field_name == NULL)
7393 else if (ada_is_parent_field (type, i))
7395 /* This is a field pointing us to the parent type of a tagged
7396 type. As hinted in this function's documentation, we give
7397 preference to fields in the current record first, so what
7398 we do here is just record the index of this field before
7399 we skip it. If it turns out we couldn't find our field
7400 in the current record, then we'll get back to it and search
7401 inside it whether the field might exist in the parent. */
7407 else if (field_name_match (t_field_name, name))
7408 return ada_value_primitive_field (arg, offset, i, type);
7410 else if (ada_is_wrapper_field (type, i))
7412 struct value *v = /* Do not let indent join lines here. */
7413 ada_search_struct_field (name, arg,
7414 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7415 TYPE_FIELD_TYPE (type, i));
7421 else if (ada_is_variant_part (type, i))
7423 /* PNH: Do we ever get here? See find_struct_field. */
7425 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7427 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
7429 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
7431 struct value *v = ada_search_struct_field /* Force line
7434 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
7435 TYPE_FIELD_TYPE (field_type, j));
7443 /* Field not found so far. If this is a tagged type which
7444 has a parent, try finding that field in the parent now. */
7446 if (parent_offset != -1)
7448 struct value *v = ada_search_struct_field (
7449 name, arg, offset + TYPE_FIELD_BITPOS (type, parent_offset) / 8,
7450 TYPE_FIELD_TYPE (type, parent_offset));
7459 static struct value *ada_index_struct_field_1 (int *, struct value *,
7460 int, struct type *);
7463 /* Return field #INDEX in ARG, where the index is that returned by
7464 * find_struct_field through its INDEX_P argument. Adjust the address
7465 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7466 * If found, return value, else return NULL. */
7468 static struct value *
7469 ada_index_struct_field (int index, struct value *arg, int offset,
7472 return ada_index_struct_field_1 (&index, arg, offset, type);
7476 /* Auxiliary function for ada_index_struct_field. Like
7477 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7480 static struct value *
7481 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
7485 type = ada_check_typedef (type);
7487 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7489 if (TYPE_FIELD_NAME (type, i) == NULL)
7491 else if (ada_is_wrapper_field (type, i))
7493 struct value *v = /* Do not let indent join lines here. */
7494 ada_index_struct_field_1 (index_p, arg,
7495 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7496 TYPE_FIELD_TYPE (type, i));
7502 else if (ada_is_variant_part (type, i))
7504 /* PNH: Do we ever get here? See ada_search_struct_field,
7505 find_struct_field. */
7506 error (_("Cannot assign this kind of variant record"));
7508 else if (*index_p == 0)
7509 return ada_value_primitive_field (arg, offset, i, type);
7516 /* Given ARG, a value of type (pointer or reference to a)*
7517 structure/union, extract the component named NAME from the ultimate
7518 target structure/union and return it as a value with its
7521 The routine searches for NAME among all members of the structure itself
7522 and (recursively) among all members of any wrapper members
7525 If NO_ERR, then simply return NULL in case of error, rather than
7529 ada_value_struct_elt (struct value *arg, const char *name, int no_err)
7531 struct type *t, *t1;
7535 t1 = t = ada_check_typedef (value_type (arg));
7536 if (TYPE_CODE (t) == TYPE_CODE_REF)
7538 t1 = TYPE_TARGET_TYPE (t);
7541 t1 = ada_check_typedef (t1);
7542 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7544 arg = coerce_ref (arg);
7549 while (TYPE_CODE (t) == TYPE_CODE_PTR)
7551 t1 = TYPE_TARGET_TYPE (t);
7554 t1 = ada_check_typedef (t1);
7555 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7557 arg = value_ind (arg);
7564 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
7568 v = ada_search_struct_field (name, arg, 0, t);
7571 int bit_offset, bit_size, byte_offset;
7572 struct type *field_type;
7575 if (TYPE_CODE (t) == TYPE_CODE_PTR)
7576 address = value_address (ada_value_ind (arg));
7578 address = value_address (ada_coerce_ref (arg));
7580 /* Check to see if this is a tagged type. We also need to handle
7581 the case where the type is a reference to a tagged type, but
7582 we have to be careful to exclude pointers to tagged types.
7583 The latter should be shown as usual (as a pointer), whereas
7584 a reference should mostly be transparent to the user. */
7586 if (ada_is_tagged_type (t1, 0)
7587 || (TYPE_CODE (t1) == TYPE_CODE_REF
7588 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1), 0)))
7590 /* We first try to find the searched field in the current type.
7591 If not found then let's look in the fixed type. */
7593 if (!find_struct_field (name, t1, 0,
7594 &field_type, &byte_offset, &bit_offset,
7596 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL,
7600 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL,
7603 if (find_struct_field (name, t1, 0,
7604 &field_type, &byte_offset, &bit_offset,
7609 if (TYPE_CODE (t) == TYPE_CODE_REF)
7610 arg = ada_coerce_ref (arg);
7612 arg = ada_value_ind (arg);
7613 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
7614 bit_offset, bit_size,
7618 v = value_at_lazy (field_type, address + byte_offset);
7622 if (v != NULL || no_err)
7625 error (_("There is no member named %s."), name);
7631 error (_("Attempt to extract a component of "
7632 "a value that is not a record."));
7635 /* Return a string representation of type TYPE. */
7638 type_as_string (struct type *type)
7640 string_file tmp_stream;
7642 type_print (type, "", &tmp_stream, -1);
7644 return std::move (tmp_stream.string ());
7647 /* Given a type TYPE, look up the type of the component of type named NAME.
7648 If DISPP is non-null, add its byte displacement from the beginning of a
7649 structure (pointed to by a value) of type TYPE to *DISPP (does not
7650 work for packed fields).
7652 Matches any field whose name has NAME as a prefix, possibly
7655 TYPE can be either a struct or union. If REFOK, TYPE may also
7656 be a (pointer or reference)+ to a struct or union, and the
7657 ultimate target type will be searched.
7659 Looks recursively into variant clauses and parent types.
7661 In the case of homonyms in the tagged types, please refer to the
7662 long explanation in find_struct_field's function documentation.
7664 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7665 TYPE is not a type of the right kind. */
7667 static struct type *
7668 ada_lookup_struct_elt_type (struct type *type, const char *name, int refok,
7672 int parent_offset = -1;
7677 if (refok && type != NULL)
7680 type = ada_check_typedef (type);
7681 if (TYPE_CODE (type) != TYPE_CODE_PTR
7682 && TYPE_CODE (type) != TYPE_CODE_REF)
7684 type = TYPE_TARGET_TYPE (type);
7688 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
7689 && TYPE_CODE (type) != TYPE_CODE_UNION))
7694 error (_("Type %s is not a structure or union type"),
7695 type != NULL ? type_as_string (type).c_str () : _("(null)"));
7698 type = to_static_fixed_type (type);
7700 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7702 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7705 if (t_field_name == NULL)
7708 else if (ada_is_parent_field (type, i))
7710 /* This is a field pointing us to the parent type of a tagged
7711 type. As hinted in this function's documentation, we give
7712 preference to fields in the current record first, so what
7713 we do here is just record the index of this field before
7714 we skip it. If it turns out we couldn't find our field
7715 in the current record, then we'll get back to it and search
7716 inside it whether the field might exist in the parent. */
7722 else if (field_name_match (t_field_name, name))
7723 return TYPE_FIELD_TYPE (type, i);
7725 else if (ada_is_wrapper_field (type, i))
7727 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
7733 else if (ada_is_variant_part (type, i))
7736 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7739 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
7741 /* FIXME pnh 2008/01/26: We check for a field that is
7742 NOT wrapped in a struct, since the compiler sometimes
7743 generates these for unchecked variant types. Revisit
7744 if the compiler changes this practice. */
7745 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
7747 if (v_field_name != NULL
7748 && field_name_match (v_field_name, name))
7749 t = TYPE_FIELD_TYPE (field_type, j);
7751 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
7762 /* Field not found so far. If this is a tagged type which
7763 has a parent, try finding that field in the parent now. */
7765 if (parent_offset != -1)
7769 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, parent_offset),
7778 const char *name_str = name != NULL ? name : _("<null>");
7780 error (_("Type %s has no component named %s"),
7781 type_as_string (type).c_str (), name_str);
7787 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7788 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7789 represents an unchecked union (that is, the variant part of a
7790 record that is named in an Unchecked_Union pragma). */
7793 is_unchecked_variant (struct type *var_type, struct type *outer_type)
7795 const char *discrim_name = ada_variant_discrim_name (var_type);
7797 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1) == NULL);
7801 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7802 within a value of type OUTER_TYPE that is stored in GDB at
7803 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7804 numbering from 0) is applicable. Returns -1 if none are. */
7807 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
7808 const gdb_byte *outer_valaddr)
7812 const char *discrim_name = ada_variant_discrim_name (var_type);
7813 struct value *outer;
7814 struct value *discrim;
7815 LONGEST discrim_val;
7817 /* Using plain value_from_contents_and_address here causes problems
7818 because we will end up trying to resolve a type that is currently
7819 being constructed. */
7820 outer = value_from_contents_and_address_unresolved (outer_type,
7822 discrim = ada_value_struct_elt (outer, discrim_name, 1);
7823 if (discrim == NULL)
7825 discrim_val = value_as_long (discrim);
7828 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
7830 if (ada_is_others_clause (var_type, i))
7832 else if (ada_in_variant (discrim_val, var_type, i))
7836 return others_clause;
7841 /* Dynamic-Sized Records */
7843 /* Strategy: The type ostensibly attached to a value with dynamic size
7844 (i.e., a size that is not statically recorded in the debugging
7845 data) does not accurately reflect the size or layout of the value.
7846 Our strategy is to convert these values to values with accurate,
7847 conventional types that are constructed on the fly. */
7849 /* There is a subtle and tricky problem here. In general, we cannot
7850 determine the size of dynamic records without its data. However,
7851 the 'struct value' data structure, which GDB uses to represent
7852 quantities in the inferior process (the target), requires the size
7853 of the type at the time of its allocation in order to reserve space
7854 for GDB's internal copy of the data. That's why the
7855 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7856 rather than struct value*s.
7858 However, GDB's internal history variables ($1, $2, etc.) are
7859 struct value*s containing internal copies of the data that are not, in
7860 general, the same as the data at their corresponding addresses in
7861 the target. Fortunately, the types we give to these values are all
7862 conventional, fixed-size types (as per the strategy described
7863 above), so that we don't usually have to perform the
7864 'to_fixed_xxx_type' conversions to look at their values.
7865 Unfortunately, there is one exception: if one of the internal
7866 history variables is an array whose elements are unconstrained
7867 records, then we will need to create distinct fixed types for each
7868 element selected. */
7870 /* The upshot of all of this is that many routines take a (type, host
7871 address, target address) triple as arguments to represent a value.
7872 The host address, if non-null, is supposed to contain an internal
7873 copy of the relevant data; otherwise, the program is to consult the
7874 target at the target address. */
7876 /* Assuming that VAL0 represents a pointer value, the result of
7877 dereferencing it. Differs from value_ind in its treatment of
7878 dynamic-sized types. */
7881 ada_value_ind (struct value *val0)
7883 struct value *val = value_ind (val0);
7885 if (ada_is_tagged_type (value_type (val), 0))
7886 val = ada_tag_value_at_base_address (val);
7888 return ada_to_fixed_value (val);
7891 /* The value resulting from dereferencing any "reference to"
7892 qualifiers on VAL0. */
7894 static struct value *
7895 ada_coerce_ref (struct value *val0)
7897 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
7899 struct value *val = val0;
7901 val = coerce_ref (val);
7903 if (ada_is_tagged_type (value_type (val), 0))
7904 val = ada_tag_value_at_base_address (val);
7906 return ada_to_fixed_value (val);
7912 /* Return OFF rounded upward if necessary to a multiple of
7913 ALIGNMENT (a power of 2). */
7916 align_value (unsigned int off, unsigned int alignment)
7918 return (off + alignment - 1) & ~(alignment - 1);
7921 /* Return the bit alignment required for field #F of template type TYPE. */
7924 field_alignment (struct type *type, int f)
7926 const char *name = TYPE_FIELD_NAME (type, f);
7930 /* The field name should never be null, unless the debugging information
7931 is somehow malformed. In this case, we assume the field does not
7932 require any alignment. */
7936 len = strlen (name);
7938 if (!isdigit (name[len - 1]))
7941 if (isdigit (name[len - 2]))
7942 align_offset = len - 2;
7944 align_offset = len - 1;
7946 if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV"))
7947 return TARGET_CHAR_BIT;
7949 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7952 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7954 static struct symbol *
7955 ada_find_any_type_symbol (const char *name)
7959 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
7960 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
7963 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7967 /* Find a type named NAME. Ignores ambiguity. This routine will look
7968 solely for types defined by debug info, it will not search the GDB
7971 static struct type *
7972 ada_find_any_type (const char *name)
7974 struct symbol *sym = ada_find_any_type_symbol (name);
7977 return SYMBOL_TYPE (sym);
7982 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7983 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7984 symbol, in which case it is returned. Otherwise, this looks for
7985 symbols whose name is that of NAME_SYM suffixed with "___XR".
7986 Return symbol if found, and NULL otherwise. */
7989 ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block)
7991 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
7994 if (strstr (name, "___XR") != NULL)
7997 sym = find_old_style_renaming_symbol (name, block);
8002 /* Not right yet. FIXME pnh 7/20/2007. */
8003 sym = ada_find_any_type_symbol (name);
8004 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
8010 static struct symbol *
8011 find_old_style_renaming_symbol (const char *name, const struct block *block)
8013 const struct symbol *function_sym = block_linkage_function (block);
8016 if (function_sym != NULL)
8018 /* If the symbol is defined inside a function, NAME is not fully
8019 qualified. This means we need to prepend the function name
8020 as well as adding the ``___XR'' suffix to build the name of
8021 the associated renaming symbol. */
8022 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
8023 /* Function names sometimes contain suffixes used
8024 for instance to qualify nested subprograms. When building
8025 the XR type name, we need to make sure that this suffix is
8026 not included. So do not include any suffix in the function
8027 name length below. */
8028 int function_name_len = ada_name_prefix_len (function_name);
8029 const int rename_len = function_name_len + 2 /* "__" */
8030 + strlen (name) + 6 /* "___XR\0" */ ;
8032 /* Strip the suffix if necessary. */
8033 ada_remove_trailing_digits (function_name, &function_name_len);
8034 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
8035 ada_remove_Xbn_suffix (function_name, &function_name_len);
8037 /* Library-level functions are a special case, as GNAT adds
8038 a ``_ada_'' prefix to the function name to avoid namespace
8039 pollution. However, the renaming symbols themselves do not
8040 have this prefix, so we need to skip this prefix if present. */
8041 if (function_name_len > 5 /* "_ada_" */
8042 && strstr (function_name, "_ada_") == function_name)
8045 function_name_len -= 5;
8048 rename = (char *) alloca (rename_len * sizeof (char));
8049 strncpy (rename, function_name, function_name_len);
8050 xsnprintf (rename + function_name_len, rename_len - function_name_len,
8055 const int rename_len = strlen (name) + 6;
8057 rename = (char *) alloca (rename_len * sizeof (char));
8058 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
8061 return ada_find_any_type_symbol (rename);
8064 /* Because of GNAT encoding conventions, several GDB symbols may match a
8065 given type name. If the type denoted by TYPE0 is to be preferred to
8066 that of TYPE1 for purposes of type printing, return non-zero;
8067 otherwise return 0. */
8070 ada_prefer_type (struct type *type0, struct type *type1)
8074 else if (type0 == NULL)
8076 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
8078 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
8080 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
8082 else if (ada_is_constrained_packed_array_type (type0))
8084 else if (ada_is_array_descriptor_type (type0)
8085 && !ada_is_array_descriptor_type (type1))
8089 const char *type0_name = TYPE_NAME (type0);
8090 const char *type1_name = TYPE_NAME (type1);
8092 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
8093 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
8099 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
8103 ada_type_name (struct type *type)
8107 return TYPE_NAME (type);
8110 /* Search the list of "descriptive" types associated to TYPE for a type
8111 whose name is NAME. */
8113 static struct type *
8114 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
8116 struct type *result, *tmp;
8118 if (ada_ignore_descriptive_types_p)
8121 /* If there no descriptive-type info, then there is no parallel type
8123 if (!HAVE_GNAT_AUX_INFO (type))
8126 result = TYPE_DESCRIPTIVE_TYPE (type);
8127 while (result != NULL)
8129 const char *result_name = ada_type_name (result);
8131 if (result_name == NULL)
8133 warning (_("unexpected null name on descriptive type"));
8137 /* If the names match, stop. */
8138 if (strcmp (result_name, name) == 0)
8141 /* Otherwise, look at the next item on the list, if any. */
8142 if (HAVE_GNAT_AUX_INFO (result))
8143 tmp = TYPE_DESCRIPTIVE_TYPE (result);
8147 /* If not found either, try after having resolved the typedef. */
8152 result = check_typedef (result);
8153 if (HAVE_GNAT_AUX_INFO (result))
8154 result = TYPE_DESCRIPTIVE_TYPE (result);
8160 /* If we didn't find a match, see whether this is a packed array. With
8161 older compilers, the descriptive type information is either absent or
8162 irrelevant when it comes to packed arrays so the above lookup fails.
8163 Fall back to using a parallel lookup by name in this case. */
8164 if (result == NULL && ada_is_constrained_packed_array_type (type))
8165 return ada_find_any_type (name);
8170 /* Find a parallel type to TYPE with the specified NAME, using the
8171 descriptive type taken from the debugging information, if available,
8172 and otherwise using the (slower) name-based method. */
8174 static struct type *
8175 ada_find_parallel_type_with_name (struct type *type, const char *name)
8177 struct type *result = NULL;
8179 if (HAVE_GNAT_AUX_INFO (type))
8180 result = find_parallel_type_by_descriptive_type (type, name);
8182 result = ada_find_any_type (name);
8187 /* Same as above, but specify the name of the parallel type by appending
8188 SUFFIX to the name of TYPE. */
8191 ada_find_parallel_type (struct type *type, const char *suffix)
8194 const char *type_name = ada_type_name (type);
8197 if (type_name == NULL)
8200 len = strlen (type_name);
8202 name = (char *) alloca (len + strlen (suffix) + 1);
8204 strcpy (name, type_name);
8205 strcpy (name + len, suffix);
8207 return ada_find_parallel_type_with_name (type, name);
8210 /* If TYPE is a variable-size record type, return the corresponding template
8211 type describing its fields. Otherwise, return NULL. */
8213 static struct type *
8214 dynamic_template_type (struct type *type)
8216 type = ada_check_typedef (type);
8218 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
8219 || ada_type_name (type) == NULL)
8223 int len = strlen (ada_type_name (type));
8225 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
8228 return ada_find_parallel_type (type, "___XVE");
8232 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8233 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8236 is_dynamic_field (struct type *templ_type, int field_num)
8238 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
8241 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
8242 && strstr (name, "___XVL") != NULL;
8245 /* The index of the variant field of TYPE, or -1 if TYPE does not
8246 represent a variant record type. */
8249 variant_field_index (struct type *type)
8253 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
8256 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
8258 if (ada_is_variant_part (type, f))
8264 /* A record type with no fields. */
8266 static struct type *
8267 empty_record (struct type *templ)
8269 struct type *type = alloc_type_copy (templ);
8271 TYPE_CODE (type) = TYPE_CODE_STRUCT;
8272 TYPE_NFIELDS (type) = 0;
8273 TYPE_FIELDS (type) = NULL;
8274 INIT_CPLUS_SPECIFIC (type);
8275 TYPE_NAME (type) = "<empty>";
8276 TYPE_LENGTH (type) = 0;
8280 /* An ordinary record type (with fixed-length fields) that describes
8281 the value of type TYPE at VALADDR or ADDRESS (see comments at
8282 the beginning of this section) VAL according to GNAT conventions.
8283 DVAL0 should describe the (portion of a) record that contains any
8284 necessary discriminants. It should be NULL if value_type (VAL) is
8285 an outer-level type (i.e., as opposed to a branch of a variant.) A
8286 variant field (unless unchecked) is replaced by a particular branch
8289 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8290 length are not statically known are discarded. As a consequence,
8291 VALADDR, ADDRESS and DVAL0 are ignored.
8293 NOTE: Limitations: For now, we assume that dynamic fields and
8294 variants occupy whole numbers of bytes. However, they need not be
8298 ada_template_to_fixed_record_type_1 (struct type *type,
8299 const gdb_byte *valaddr,
8300 CORE_ADDR address, struct value *dval0,
8301 int keep_dynamic_fields)
8303 struct value *mark = value_mark ();
8306 int nfields, bit_len;
8312 /* Compute the number of fields in this record type that are going
8313 to be processed: unless keep_dynamic_fields, this includes only
8314 fields whose position and length are static will be processed. */
8315 if (keep_dynamic_fields)
8316 nfields = TYPE_NFIELDS (type);
8320 while (nfields < TYPE_NFIELDS (type)
8321 && !ada_is_variant_part (type, nfields)
8322 && !is_dynamic_field (type, nfields))
8326 rtype = alloc_type_copy (type);
8327 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8328 INIT_CPLUS_SPECIFIC (rtype);
8329 TYPE_NFIELDS (rtype) = nfields;
8330 TYPE_FIELDS (rtype) = (struct field *)
8331 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8332 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
8333 TYPE_NAME (rtype) = ada_type_name (type);
8334 TYPE_FIXED_INSTANCE (rtype) = 1;
8340 for (f = 0; f < nfields; f += 1)
8342 off = align_value (off, field_alignment (type, f))
8343 + TYPE_FIELD_BITPOS (type, f);
8344 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
8345 TYPE_FIELD_BITSIZE (rtype, f) = 0;
8347 if (ada_is_variant_part (type, f))
8352 else if (is_dynamic_field (type, f))
8354 const gdb_byte *field_valaddr = valaddr;
8355 CORE_ADDR field_address = address;
8356 struct type *field_type =
8357 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
8361 /* rtype's length is computed based on the run-time
8362 value of discriminants. If the discriminants are not
8363 initialized, the type size may be completely bogus and
8364 GDB may fail to allocate a value for it. So check the
8365 size first before creating the value. */
8366 ada_ensure_varsize_limit (rtype);
8367 /* Using plain value_from_contents_and_address here
8368 causes problems because we will end up trying to
8369 resolve a type that is currently being
8371 dval = value_from_contents_and_address_unresolved (rtype,
8374 rtype = value_type (dval);
8379 /* If the type referenced by this field is an aligner type, we need
8380 to unwrap that aligner type, because its size might not be set.
8381 Keeping the aligner type would cause us to compute the wrong
8382 size for this field, impacting the offset of the all the fields
8383 that follow this one. */
8384 if (ada_is_aligner_type (field_type))
8386 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
8388 field_valaddr = cond_offset_host (field_valaddr, field_offset);
8389 field_address = cond_offset_target (field_address, field_offset);
8390 field_type = ada_aligned_type (field_type);
8393 field_valaddr = cond_offset_host (field_valaddr,
8394 off / TARGET_CHAR_BIT);
8395 field_address = cond_offset_target (field_address,
8396 off / TARGET_CHAR_BIT);
8398 /* Get the fixed type of the field. Note that, in this case,
8399 we do not want to get the real type out of the tag: if
8400 the current field is the parent part of a tagged record,
8401 we will get the tag of the object. Clearly wrong: the real
8402 type of the parent is not the real type of the child. We
8403 would end up in an infinite loop. */
8404 field_type = ada_get_base_type (field_type);
8405 field_type = ada_to_fixed_type (field_type, field_valaddr,
8406 field_address, dval, 0);
8407 /* If the field size is already larger than the maximum
8408 object size, then the record itself will necessarily
8409 be larger than the maximum object size. We need to make
8410 this check now, because the size might be so ridiculously
8411 large (due to an uninitialized variable in the inferior)
8412 that it would cause an overflow when adding it to the
8414 ada_ensure_varsize_limit (field_type);
8416 TYPE_FIELD_TYPE (rtype, f) = field_type;
8417 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
8418 /* The multiplication can potentially overflow. But because
8419 the field length has been size-checked just above, and
8420 assuming that the maximum size is a reasonable value,
8421 an overflow should not happen in practice. So rather than
8422 adding overflow recovery code to this already complex code,
8423 we just assume that it's not going to happen. */
8425 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
8429 /* Note: If this field's type is a typedef, it is important
8430 to preserve the typedef layer.
8432 Otherwise, we might be transforming a typedef to a fat
8433 pointer (encoding a pointer to an unconstrained array),
8434 into a basic fat pointer (encoding an unconstrained
8435 array). As both types are implemented using the same
8436 structure, the typedef is the only clue which allows us
8437 to distinguish between the two options. Stripping it
8438 would prevent us from printing this field appropriately. */
8439 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
8440 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
8441 if (TYPE_FIELD_BITSIZE (type, f) > 0)
8443 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
8446 struct type *field_type = TYPE_FIELD_TYPE (type, f);
8448 /* We need to be careful of typedefs when computing
8449 the length of our field. If this is a typedef,
8450 get the length of the target type, not the length
8452 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
8453 field_type = ada_typedef_target_type (field_type);
8456 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
8459 if (off + fld_bit_len > bit_len)
8460 bit_len = off + fld_bit_len;
8462 TYPE_LENGTH (rtype) =
8463 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8466 /* We handle the variant part, if any, at the end because of certain
8467 odd cases in which it is re-ordered so as NOT to be the last field of
8468 the record. This can happen in the presence of representation
8470 if (variant_field >= 0)
8472 struct type *branch_type;
8474 off = TYPE_FIELD_BITPOS (rtype, variant_field);
8478 /* Using plain value_from_contents_and_address here causes
8479 problems because we will end up trying to resolve a type
8480 that is currently being constructed. */
8481 dval = value_from_contents_and_address_unresolved (rtype, valaddr,
8483 rtype = value_type (dval);
8489 to_fixed_variant_branch_type
8490 (TYPE_FIELD_TYPE (type, variant_field),
8491 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
8492 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
8493 if (branch_type == NULL)
8495 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
8496 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8497 TYPE_NFIELDS (rtype) -= 1;
8501 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8502 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8504 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
8506 if (off + fld_bit_len > bit_len)
8507 bit_len = off + fld_bit_len;
8508 TYPE_LENGTH (rtype) =
8509 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8513 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8514 should contain the alignment of that record, which should be a strictly
8515 positive value. If null or negative, then something is wrong, most
8516 probably in the debug info. In that case, we don't round up the size
8517 of the resulting type. If this record is not part of another structure,
8518 the current RTYPE length might be good enough for our purposes. */
8519 if (TYPE_LENGTH (type) <= 0)
8521 if (TYPE_NAME (rtype))
8522 warning (_("Invalid type size for `%s' detected: %d."),
8523 TYPE_NAME (rtype), TYPE_LENGTH (type));
8525 warning (_("Invalid type size for <unnamed> detected: %d."),
8526 TYPE_LENGTH (type));
8530 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
8531 TYPE_LENGTH (type));
8534 value_free_to_mark (mark);
8535 if (TYPE_LENGTH (rtype) > varsize_limit)
8536 error (_("record type with dynamic size is larger than varsize-limit"));
8540 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8543 static struct type *
8544 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
8545 CORE_ADDR address, struct value *dval0)
8547 return ada_template_to_fixed_record_type_1 (type, valaddr,
8551 /* An ordinary record type in which ___XVL-convention fields and
8552 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8553 static approximations, containing all possible fields. Uses
8554 no runtime values. Useless for use in values, but that's OK,
8555 since the results are used only for type determinations. Works on both
8556 structs and unions. Representation note: to save space, we memorize
8557 the result of this function in the TYPE_TARGET_TYPE of the
8560 static struct type *
8561 template_to_static_fixed_type (struct type *type0)
8567 /* No need no do anything if the input type is already fixed. */
8568 if (TYPE_FIXED_INSTANCE (type0))
8571 /* Likewise if we already have computed the static approximation. */
8572 if (TYPE_TARGET_TYPE (type0) != NULL)
8573 return TYPE_TARGET_TYPE (type0);
8575 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8577 nfields = TYPE_NFIELDS (type0);
8579 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8580 recompute all over next time. */
8581 TYPE_TARGET_TYPE (type0) = type;
8583 for (f = 0; f < nfields; f += 1)
8585 struct type *field_type = TYPE_FIELD_TYPE (type0, f);
8586 struct type *new_type;
8588 if (is_dynamic_field (type0, f))
8590 field_type = ada_check_typedef (field_type);
8591 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
8594 new_type = static_unwrap_type (field_type);
8596 if (new_type != field_type)
8598 /* Clone TYPE0 only the first time we get a new field type. */
8601 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
8602 TYPE_CODE (type) = TYPE_CODE (type0);
8603 INIT_CPLUS_SPECIFIC (type);
8604 TYPE_NFIELDS (type) = nfields;
8605 TYPE_FIELDS (type) = (struct field *)
8606 TYPE_ALLOC (type, nfields * sizeof (struct field));
8607 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
8608 sizeof (struct field) * nfields);
8609 TYPE_NAME (type) = ada_type_name (type0);
8610 TYPE_FIXED_INSTANCE (type) = 1;
8611 TYPE_LENGTH (type) = 0;
8613 TYPE_FIELD_TYPE (type, f) = new_type;
8614 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
8621 /* Given an object of type TYPE whose contents are at VALADDR and
8622 whose address in memory is ADDRESS, returns a revision of TYPE,
8623 which should be a non-dynamic-sized record, in which the variant
8624 part, if any, is replaced with the appropriate branch. Looks
8625 for discriminant values in DVAL0, which can be NULL if the record
8626 contains the necessary discriminant values. */
8628 static struct type *
8629 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
8630 CORE_ADDR address, struct value *dval0)
8632 struct value *mark = value_mark ();
8635 struct type *branch_type;
8636 int nfields = TYPE_NFIELDS (type);
8637 int variant_field = variant_field_index (type);
8639 if (variant_field == -1)
8644 dval = value_from_contents_and_address (type, valaddr, address);
8645 type = value_type (dval);
8650 rtype = alloc_type_copy (type);
8651 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8652 INIT_CPLUS_SPECIFIC (rtype);
8653 TYPE_NFIELDS (rtype) = nfields;
8654 TYPE_FIELDS (rtype) =
8655 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8656 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
8657 sizeof (struct field) * nfields);
8658 TYPE_NAME (rtype) = ada_type_name (type);
8659 TYPE_FIXED_INSTANCE (rtype) = 1;
8660 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
8662 branch_type = to_fixed_variant_branch_type
8663 (TYPE_FIELD_TYPE (type, variant_field),
8664 cond_offset_host (valaddr,
8665 TYPE_FIELD_BITPOS (type, variant_field)
8667 cond_offset_target (address,
8668 TYPE_FIELD_BITPOS (type, variant_field)
8669 / TARGET_CHAR_BIT), dval);
8670 if (branch_type == NULL)
8674 for (f = variant_field + 1; f < nfields; f += 1)
8675 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8676 TYPE_NFIELDS (rtype) -= 1;
8680 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8681 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8682 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
8683 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
8685 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
8687 value_free_to_mark (mark);
8691 /* An ordinary record type (with fixed-length fields) that describes
8692 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8693 beginning of this section]. Any necessary discriminants' values
8694 should be in DVAL, a record value; it may be NULL if the object
8695 at ADDR itself contains any necessary discriminant values.
8696 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8697 values from the record are needed. Except in the case that DVAL,
8698 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8699 unchecked) is replaced by a particular branch of the variant.
8701 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8702 is questionable and may be removed. It can arise during the
8703 processing of an unconstrained-array-of-record type where all the
8704 variant branches have exactly the same size. This is because in
8705 such cases, the compiler does not bother to use the XVS convention
8706 when encoding the record. I am currently dubious of this
8707 shortcut and suspect the compiler should be altered. FIXME. */
8709 static struct type *
8710 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
8711 CORE_ADDR address, struct value *dval)
8713 struct type *templ_type;
8715 if (TYPE_FIXED_INSTANCE (type0))
8718 templ_type = dynamic_template_type (type0);
8720 if (templ_type != NULL)
8721 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
8722 else if (variant_field_index (type0) >= 0)
8724 if (dval == NULL && valaddr == NULL && address == 0)
8726 return to_record_with_fixed_variant_part (type0, valaddr, address,
8731 TYPE_FIXED_INSTANCE (type0) = 1;
8737 /* An ordinary record type (with fixed-length fields) that describes
8738 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8739 union type. Any necessary discriminants' values should be in DVAL,
8740 a record value. That is, this routine selects the appropriate
8741 branch of the union at ADDR according to the discriminant value
8742 indicated in the union's type name. Returns VAR_TYPE0 itself if
8743 it represents a variant subject to a pragma Unchecked_Union. */
8745 static struct type *
8746 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
8747 CORE_ADDR address, struct value *dval)
8750 struct type *templ_type;
8751 struct type *var_type;
8753 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
8754 var_type = TYPE_TARGET_TYPE (var_type0);
8756 var_type = var_type0;
8758 templ_type = ada_find_parallel_type (var_type, "___XVU");
8760 if (templ_type != NULL)
8761 var_type = templ_type;
8763 if (is_unchecked_variant (var_type, value_type (dval)))
8766 ada_which_variant_applies (var_type,
8767 value_type (dval), value_contents (dval));
8770 return empty_record (var_type);
8771 else if (is_dynamic_field (var_type, which))
8772 return to_fixed_record_type
8773 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
8774 valaddr, address, dval);
8775 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
8777 to_fixed_record_type
8778 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
8780 return TYPE_FIELD_TYPE (var_type, which);
8783 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8784 ENCODING_TYPE, a type following the GNAT conventions for discrete
8785 type encodings, only carries redundant information. */
8788 ada_is_redundant_range_encoding (struct type *range_type,
8789 struct type *encoding_type)
8791 const char *bounds_str;
8795 gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE);
8797 if (TYPE_CODE (get_base_type (range_type))
8798 != TYPE_CODE (get_base_type (encoding_type)))
8800 /* The compiler probably used a simple base type to describe
8801 the range type instead of the range's actual base type,
8802 expecting us to get the real base type from the encoding
8803 anyway. In this situation, the encoding cannot be ignored
8808 if (is_dynamic_type (range_type))
8811 if (TYPE_NAME (encoding_type) == NULL)
8814 bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_");
8815 if (bounds_str == NULL)
8818 n = 8; /* Skip "___XDLU_". */
8819 if (!ada_scan_number (bounds_str, n, &lo, &n))
8821 if (TYPE_LOW_BOUND (range_type) != lo)
8824 n += 2; /* Skip the "__" separator between the two bounds. */
8825 if (!ada_scan_number (bounds_str, n, &hi, &n))
8827 if (TYPE_HIGH_BOUND (range_type) != hi)
8833 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8834 a type following the GNAT encoding for describing array type
8835 indices, only carries redundant information. */
8838 ada_is_redundant_index_type_desc (struct type *array_type,
8839 struct type *desc_type)
8841 struct type *this_layer = check_typedef (array_type);
8844 for (i = 0; i < TYPE_NFIELDS (desc_type); i++)
8846 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer),
8847 TYPE_FIELD_TYPE (desc_type, i)))
8849 this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer));
8855 /* Assuming that TYPE0 is an array type describing the type of a value
8856 at ADDR, and that DVAL describes a record containing any
8857 discriminants used in TYPE0, returns a type for the value that
8858 contains no dynamic components (that is, no components whose sizes
8859 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8860 true, gives an error message if the resulting type's size is over
8863 static struct type *
8864 to_fixed_array_type (struct type *type0, struct value *dval,
8867 struct type *index_type_desc;
8868 struct type *result;
8869 int constrained_packed_array_p;
8870 static const char *xa_suffix = "___XA";
8872 type0 = ada_check_typedef (type0);
8873 if (TYPE_FIXED_INSTANCE (type0))
8876 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
8877 if (constrained_packed_array_p)
8878 type0 = decode_constrained_packed_array_type (type0);
8880 index_type_desc = ada_find_parallel_type (type0, xa_suffix);
8882 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8883 encoding suffixed with 'P' may still be generated. If so,
8884 it should be used to find the XA type. */
8886 if (index_type_desc == NULL)
8888 const char *type_name = ada_type_name (type0);
8890 if (type_name != NULL)
8892 const int len = strlen (type_name);
8893 char *name = (char *) alloca (len + strlen (xa_suffix));
8895 if (type_name[len - 1] == 'P')
8897 strcpy (name, type_name);
8898 strcpy (name + len - 1, xa_suffix);
8899 index_type_desc = ada_find_parallel_type_with_name (type0, name);
8904 ada_fixup_array_indexes_type (index_type_desc);
8905 if (index_type_desc != NULL
8906 && ada_is_redundant_index_type_desc (type0, index_type_desc))
8908 /* Ignore this ___XA parallel type, as it does not bring any
8909 useful information. This allows us to avoid creating fixed
8910 versions of the array's index types, which would be identical
8911 to the original ones. This, in turn, can also help avoid
8912 the creation of fixed versions of the array itself. */
8913 index_type_desc = NULL;
8916 if (index_type_desc == NULL)
8918 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
8920 /* NOTE: elt_type---the fixed version of elt_type0---should never
8921 depend on the contents of the array in properly constructed
8923 /* Create a fixed version of the array element type.
8924 We're not providing the address of an element here,
8925 and thus the actual object value cannot be inspected to do
8926 the conversion. This should not be a problem, since arrays of
8927 unconstrained objects are not allowed. In particular, all
8928 the elements of an array of a tagged type should all be of
8929 the same type specified in the debugging info. No need to
8930 consult the object tag. */
8931 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
8933 /* Make sure we always create a new array type when dealing with
8934 packed array types, since we're going to fix-up the array
8935 type length and element bitsize a little further down. */
8936 if (elt_type0 == elt_type && !constrained_packed_array_p)
8939 result = create_array_type (alloc_type_copy (type0),
8940 elt_type, TYPE_INDEX_TYPE (type0));
8945 struct type *elt_type0;
8948 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
8949 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8951 /* NOTE: result---the fixed version of elt_type0---should never
8952 depend on the contents of the array in properly constructed
8954 /* Create a fixed version of the array element type.
8955 We're not providing the address of an element here,
8956 and thus the actual object value cannot be inspected to do
8957 the conversion. This should not be a problem, since arrays of
8958 unconstrained objects are not allowed. In particular, all
8959 the elements of an array of a tagged type should all be of
8960 the same type specified in the debugging info. No need to
8961 consult the object tag. */
8963 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
8966 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
8968 struct type *range_type =
8969 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
8971 result = create_array_type (alloc_type_copy (elt_type0),
8972 result, range_type);
8973 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8975 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
8976 error (_("array type with dynamic size is larger than varsize-limit"));
8979 /* We want to preserve the type name. This can be useful when
8980 trying to get the type name of a value that has already been
8981 printed (for instance, if the user did "print VAR; whatis $". */
8982 TYPE_NAME (result) = TYPE_NAME (type0);
8984 if (constrained_packed_array_p)
8986 /* So far, the resulting type has been created as if the original
8987 type was a regular (non-packed) array type. As a result, the
8988 bitsize of the array elements needs to be set again, and the array
8989 length needs to be recomputed based on that bitsize. */
8990 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
8991 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
8993 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
8994 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
8995 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
8996 TYPE_LENGTH (result)++;
8999 TYPE_FIXED_INSTANCE (result) = 1;
9004 /* A standard type (containing no dynamically sized components)
9005 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
9006 DVAL describes a record containing any discriminants used in TYPE0,
9007 and may be NULL if there are none, or if the object of type TYPE at
9008 ADDRESS or in VALADDR contains these discriminants.
9010 If CHECK_TAG is not null, in the case of tagged types, this function
9011 attempts to locate the object's tag and use it to compute the actual
9012 type. However, when ADDRESS is null, we cannot use it to determine the
9013 location of the tag, and therefore compute the tagged type's actual type.
9014 So we return the tagged type without consulting the tag. */
9016 static struct type *
9017 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
9018 CORE_ADDR address, struct value *dval, int check_tag)
9020 type = ada_check_typedef (type);
9021 switch (TYPE_CODE (type))
9025 case TYPE_CODE_STRUCT:
9027 struct type *static_type = to_static_fixed_type (type);
9028 struct type *fixed_record_type =
9029 to_fixed_record_type (type, valaddr, address, NULL);
9031 /* If STATIC_TYPE is a tagged type and we know the object's address,
9032 then we can determine its tag, and compute the object's actual
9033 type from there. Note that we have to use the fixed record
9034 type (the parent part of the record may have dynamic fields
9035 and the way the location of _tag is expressed may depend on
9038 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
9041 value_tag_from_contents_and_address
9045 struct type *real_type = type_from_tag (tag);
9047 value_from_contents_and_address (fixed_record_type,
9050 fixed_record_type = value_type (obj);
9051 if (real_type != NULL)
9052 return to_fixed_record_type
9054 value_address (ada_tag_value_at_base_address (obj)), NULL);
9057 /* Check to see if there is a parallel ___XVZ variable.
9058 If there is, then it provides the actual size of our type. */
9059 else if (ada_type_name (fixed_record_type) != NULL)
9061 const char *name = ada_type_name (fixed_record_type);
9063 = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */);
9064 bool xvz_found = false;
9067 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
9070 xvz_found = get_int_var_value (xvz_name, size);
9072 CATCH (except, RETURN_MASK_ERROR)
9074 /* We found the variable, but somehow failed to read
9075 its value. Rethrow the same error, but with a little
9076 bit more information, to help the user understand
9077 what went wrong (Eg: the variable might have been
9079 throw_error (except.error,
9080 _("unable to read value of %s (%s)"),
9081 xvz_name, except.message);
9085 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
9087 fixed_record_type = copy_type (fixed_record_type);
9088 TYPE_LENGTH (fixed_record_type) = size;
9090 /* The FIXED_RECORD_TYPE may have be a stub. We have
9091 observed this when the debugging info is STABS, and
9092 apparently it is something that is hard to fix.
9094 In practice, we don't need the actual type definition
9095 at all, because the presence of the XVZ variable allows us
9096 to assume that there must be a XVS type as well, which we
9097 should be able to use later, when we need the actual type
9100 In the meantime, pretend that the "fixed" type we are
9101 returning is NOT a stub, because this can cause trouble
9102 when using this type to create new types targeting it.
9103 Indeed, the associated creation routines often check
9104 whether the target type is a stub and will try to replace
9105 it, thus using a type with the wrong size. This, in turn,
9106 might cause the new type to have the wrong size too.
9107 Consider the case of an array, for instance, where the size
9108 of the array is computed from the number of elements in
9109 our array multiplied by the size of its element. */
9110 TYPE_STUB (fixed_record_type) = 0;
9113 return fixed_record_type;
9115 case TYPE_CODE_ARRAY:
9116 return to_fixed_array_type (type, dval, 1);
9117 case TYPE_CODE_UNION:
9121 return to_fixed_variant_branch_type (type, valaddr, address, dval);
9125 /* The same as ada_to_fixed_type_1, except that it preserves the type
9126 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
9128 The typedef layer needs be preserved in order to differentiate between
9129 arrays and array pointers when both types are implemented using the same
9130 fat pointer. In the array pointer case, the pointer is encoded as
9131 a typedef of the pointer type. For instance, considering:
9133 type String_Access is access String;
9134 S1 : String_Access := null;
9136 To the debugger, S1 is defined as a typedef of type String. But
9137 to the user, it is a pointer. So if the user tries to print S1,
9138 we should not dereference the array, but print the array address
9141 If we didn't preserve the typedef layer, we would lose the fact that
9142 the type is to be presented as a pointer (needs de-reference before
9143 being printed). And we would also use the source-level type name. */
9146 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
9147 CORE_ADDR address, struct value *dval, int check_tag)
9150 struct type *fixed_type =
9151 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
9153 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
9154 then preserve the typedef layer.
9156 Implementation note: We can only check the main-type portion of
9157 the TYPE and FIXED_TYPE, because eliminating the typedef layer
9158 from TYPE now returns a type that has the same instance flags
9159 as TYPE. For instance, if TYPE is a "typedef const", and its
9160 target type is a "struct", then the typedef elimination will return
9161 a "const" version of the target type. See check_typedef for more
9162 details about how the typedef layer elimination is done.
9164 brobecker/2010-11-19: It seems to me that the only case where it is
9165 useful to preserve the typedef layer is when dealing with fat pointers.
9166 Perhaps, we could add a check for that and preserve the typedef layer
9167 only in that situation. But this seems unecessary so far, probably
9168 because we call check_typedef/ada_check_typedef pretty much everywhere.
9170 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
9171 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
9172 == TYPE_MAIN_TYPE (fixed_type)))
9178 /* A standard (static-sized) type corresponding as well as possible to
9179 TYPE0, but based on no runtime data. */
9181 static struct type *
9182 to_static_fixed_type (struct type *type0)
9189 if (TYPE_FIXED_INSTANCE (type0))
9192 type0 = ada_check_typedef (type0);
9194 switch (TYPE_CODE (type0))
9198 case TYPE_CODE_STRUCT:
9199 type = dynamic_template_type (type0);
9201 return template_to_static_fixed_type (type);
9203 return template_to_static_fixed_type (type0);
9204 case TYPE_CODE_UNION:
9205 type = ada_find_parallel_type (type0, "___XVU");
9207 return template_to_static_fixed_type (type);
9209 return template_to_static_fixed_type (type0);
9213 /* A static approximation of TYPE with all type wrappers removed. */
9215 static struct type *
9216 static_unwrap_type (struct type *type)
9218 if (ada_is_aligner_type (type))
9220 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
9221 if (ada_type_name (type1) == NULL)
9222 TYPE_NAME (type1) = ada_type_name (type);
9224 return static_unwrap_type (type1);
9228 struct type *raw_real_type = ada_get_base_type (type);
9230 if (raw_real_type == type)
9233 return to_static_fixed_type (raw_real_type);
9237 /* In some cases, incomplete and private types require
9238 cross-references that are not resolved as records (for example,
9240 type FooP is access Foo;
9242 type Foo is array ...;
9243 ). In these cases, since there is no mechanism for producing
9244 cross-references to such types, we instead substitute for FooP a
9245 stub enumeration type that is nowhere resolved, and whose tag is
9246 the name of the actual type. Call these types "non-record stubs". */
9248 /* A type equivalent to TYPE that is not a non-record stub, if one
9249 exists, otherwise TYPE. */
9252 ada_check_typedef (struct type *type)
9257 /* If our type is an access to an unconstrained array, which is encoded
9258 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9259 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9260 what allows us to distinguish between fat pointers that represent
9261 array types, and fat pointers that represent array access types
9262 (in both cases, the compiler implements them as fat pointers). */
9263 if (ada_is_access_to_unconstrained_array (type))
9266 type = check_typedef (type);
9267 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
9268 || !TYPE_STUB (type)
9269 || TYPE_NAME (type) == NULL)
9273 const char *name = TYPE_NAME (type);
9274 struct type *type1 = ada_find_any_type (name);
9279 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9280 stubs pointing to arrays, as we don't create symbols for array
9281 types, only for the typedef-to-array types). If that's the case,
9282 strip the typedef layer. */
9283 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
9284 type1 = ada_check_typedef (type1);
9290 /* A value representing the data at VALADDR/ADDRESS as described by
9291 type TYPE0, but with a standard (static-sized) type that correctly
9292 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9293 type, then return VAL0 [this feature is simply to avoid redundant
9294 creation of struct values]. */
9296 static struct value *
9297 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
9300 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
9302 if (type == type0 && val0 != NULL)
9305 if (VALUE_LVAL (val0) != lval_memory)
9307 /* Our value does not live in memory; it could be a convenience
9308 variable, for instance. Create a not_lval value using val0's
9310 return value_from_contents (type, value_contents (val0));
9313 return value_from_contents_and_address (type, 0, address);
9316 /* A value representing VAL, but with a standard (static-sized) type
9317 that correctly describes it. Does not necessarily create a new
9321 ada_to_fixed_value (struct value *val)
9323 val = unwrap_value (val);
9324 val = ada_to_fixed_value_create (value_type (val), value_address (val), val);
9331 /* Table mapping attribute numbers to names.
9332 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9334 static const char *attribute_names[] = {
9352 ada_attribute_name (enum exp_opcode n)
9354 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
9355 return attribute_names[n - OP_ATR_FIRST + 1];
9357 return attribute_names[0];
9360 /* Evaluate the 'POS attribute applied to ARG. */
9363 pos_atr (struct value *arg)
9365 struct value *val = coerce_ref (arg);
9366 struct type *type = value_type (val);
9369 if (!discrete_type_p (type))
9370 error (_("'POS only defined on discrete types"));
9372 if (!discrete_position (type, value_as_long (val), &result))
9373 error (_("enumeration value is invalid: can't find 'POS"));
9378 static struct value *
9379 value_pos_atr (struct type *type, struct value *arg)
9381 return value_from_longest (type, pos_atr (arg));
9384 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9386 static struct value *
9387 value_val_atr (struct type *type, struct value *arg)
9389 if (!discrete_type_p (type))
9390 error (_("'VAL only defined on discrete types"));
9391 if (!integer_type_p (value_type (arg)))
9392 error (_("'VAL requires integral argument"));
9394 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
9396 long pos = value_as_long (arg);
9398 if (pos < 0 || pos >= TYPE_NFIELDS (type))
9399 error (_("argument to 'VAL out of range"));
9400 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
9403 return value_from_longest (type, value_as_long (arg));
9409 /* True if TYPE appears to be an Ada character type.
9410 [At the moment, this is true only for Character and Wide_Character;
9411 It is a heuristic test that could stand improvement]. */
9414 ada_is_character_type (struct type *type)
9418 /* If the type code says it's a character, then assume it really is,
9419 and don't check any further. */
9420 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
9423 /* Otherwise, assume it's a character type iff it is a discrete type
9424 with a known character type name. */
9425 name = ada_type_name (type);
9426 return (name != NULL
9427 && (TYPE_CODE (type) == TYPE_CODE_INT
9428 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9429 && (strcmp (name, "character") == 0
9430 || strcmp (name, "wide_character") == 0
9431 || strcmp (name, "wide_wide_character") == 0
9432 || strcmp (name, "unsigned char") == 0));
9435 /* True if TYPE appears to be an Ada string type. */
9438 ada_is_string_type (struct type *type)
9440 type = ada_check_typedef (type);
9442 && TYPE_CODE (type) != TYPE_CODE_PTR
9443 && (ada_is_simple_array_type (type)
9444 || ada_is_array_descriptor_type (type))
9445 && ada_array_arity (type) == 1)
9447 struct type *elttype = ada_array_element_type (type, 1);
9449 return ada_is_character_type (elttype);
9455 /* The compiler sometimes provides a parallel XVS type for a given
9456 PAD type. Normally, it is safe to follow the PAD type directly,
9457 but older versions of the compiler have a bug that causes the offset
9458 of its "F" field to be wrong. Following that field in that case
9459 would lead to incorrect results, but this can be worked around
9460 by ignoring the PAD type and using the associated XVS type instead.
9462 Set to True if the debugger should trust the contents of PAD types.
9463 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9464 static int trust_pad_over_xvs = 1;
9466 /* True if TYPE is a struct type introduced by the compiler to force the
9467 alignment of a value. Such types have a single field with a
9468 distinctive name. */
9471 ada_is_aligner_type (struct type *type)
9473 type = ada_check_typedef (type);
9475 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
9478 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
9479 && TYPE_NFIELDS (type) == 1
9480 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
9483 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9484 the parallel type. */
9487 ada_get_base_type (struct type *raw_type)
9489 struct type *real_type_namer;
9490 struct type *raw_real_type;
9492 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
9495 if (ada_is_aligner_type (raw_type))
9496 /* The encoding specifies that we should always use the aligner type.
9497 So, even if this aligner type has an associated XVS type, we should
9500 According to the compiler gurus, an XVS type parallel to an aligner
9501 type may exist because of a stabs limitation. In stabs, aligner
9502 types are empty because the field has a variable-sized type, and
9503 thus cannot actually be used as an aligner type. As a result,
9504 we need the associated parallel XVS type to decode the type.
9505 Since the policy in the compiler is to not change the internal
9506 representation based on the debugging info format, we sometimes
9507 end up having a redundant XVS type parallel to the aligner type. */
9510 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
9511 if (real_type_namer == NULL
9512 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
9513 || TYPE_NFIELDS (real_type_namer) != 1)
9516 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
9518 /* This is an older encoding form where the base type needs to be
9519 looked up by name. We prefer the newer enconding because it is
9521 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
9522 if (raw_real_type == NULL)
9525 return raw_real_type;
9528 /* The field in our XVS type is a reference to the base type. */
9529 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
9532 /* The type of value designated by TYPE, with all aligners removed. */
9535 ada_aligned_type (struct type *type)
9537 if (ada_is_aligner_type (type))
9538 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
9540 return ada_get_base_type (type);
9544 /* The address of the aligned value in an object at address VALADDR
9545 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9548 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
9550 if (ada_is_aligner_type (type))
9551 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
9553 TYPE_FIELD_BITPOS (type,
9554 0) / TARGET_CHAR_BIT);
9561 /* The printed representation of an enumeration literal with encoded
9562 name NAME. The value is good to the next call of ada_enum_name. */
9564 ada_enum_name (const char *name)
9566 static char *result;
9567 static size_t result_len = 0;
9570 /* First, unqualify the enumeration name:
9571 1. Search for the last '.' character. If we find one, then skip
9572 all the preceding characters, the unqualified name starts
9573 right after that dot.
9574 2. Otherwise, we may be debugging on a target where the compiler
9575 translates dots into "__". Search forward for double underscores,
9576 but stop searching when we hit an overloading suffix, which is
9577 of the form "__" followed by digits. */
9579 tmp = strrchr (name, '.');
9584 while ((tmp = strstr (name, "__")) != NULL)
9586 if (isdigit (tmp[2]))
9597 if (name[1] == 'U' || name[1] == 'W')
9599 if (sscanf (name + 2, "%x", &v) != 1)
9605 GROW_VECT (result, result_len, 16);
9606 if (isascii (v) && isprint (v))
9607 xsnprintf (result, result_len, "'%c'", v);
9608 else if (name[1] == 'U')
9609 xsnprintf (result, result_len, "[\"%02x\"]", v);
9611 xsnprintf (result, result_len, "[\"%04x\"]", v);
9617 tmp = strstr (name, "__");
9619 tmp = strstr (name, "$");
9622 GROW_VECT (result, result_len, tmp - name + 1);
9623 strncpy (result, name, tmp - name);
9624 result[tmp - name] = '\0';
9632 /* Evaluate the subexpression of EXP starting at *POS as for
9633 evaluate_type, updating *POS to point just past the evaluated
9636 static struct value *
9637 evaluate_subexp_type (struct expression *exp, int *pos)
9639 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9642 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9645 static struct value *
9646 unwrap_value (struct value *val)
9648 struct type *type = ada_check_typedef (value_type (val));
9650 if (ada_is_aligner_type (type))
9652 struct value *v = ada_value_struct_elt (val, "F", 0);
9653 struct type *val_type = ada_check_typedef (value_type (v));
9655 if (ada_type_name (val_type) == NULL)
9656 TYPE_NAME (val_type) = ada_type_name (type);
9658 return unwrap_value (v);
9662 struct type *raw_real_type =
9663 ada_check_typedef (ada_get_base_type (type));
9665 /* If there is no parallel XVS or XVE type, then the value is
9666 already unwrapped. Return it without further modification. */
9667 if ((type == raw_real_type)
9668 && ada_find_parallel_type (type, "___XVE") == NULL)
9672 coerce_unspec_val_to_type
9673 (val, ada_to_fixed_type (raw_real_type, 0,
9674 value_address (val),
9679 static struct value *
9680 cast_from_fixed (struct type *type, struct value *arg)
9682 struct value *scale = ada_scaling_factor (value_type (arg));
9683 arg = value_cast (value_type (scale), arg);
9685 arg = value_binop (arg, scale, BINOP_MUL);
9686 return value_cast (type, arg);
9689 static struct value *
9690 cast_to_fixed (struct type *type, struct value *arg)
9692 if (type == value_type (arg))
9695 struct value *scale = ada_scaling_factor (type);
9696 if (ada_is_fixed_point_type (value_type (arg)))
9697 arg = cast_from_fixed (value_type (scale), arg);
9699 arg = value_cast (value_type (scale), arg);
9701 arg = value_binop (arg, scale, BINOP_DIV);
9702 return value_cast (type, arg);
9705 /* Given two array types T1 and T2, return nonzero iff both arrays
9706 contain the same number of elements. */
9709 ada_same_array_size_p (struct type *t1, struct type *t2)
9711 LONGEST lo1, hi1, lo2, hi2;
9713 /* Get the array bounds in order to verify that the size of
9714 the two arrays match. */
9715 if (!get_array_bounds (t1, &lo1, &hi1)
9716 || !get_array_bounds (t2, &lo2, &hi2))
9717 error (_("unable to determine array bounds"));
9719 /* To make things easier for size comparison, normalize a bit
9720 the case of empty arrays by making sure that the difference
9721 between upper bound and lower bound is always -1. */
9727 return (hi1 - lo1 == hi2 - lo2);
9730 /* Assuming that VAL is an array of integrals, and TYPE represents
9731 an array with the same number of elements, but with wider integral
9732 elements, return an array "casted" to TYPE. In practice, this
9733 means that the returned array is built by casting each element
9734 of the original array into TYPE's (wider) element type. */
9736 static struct value *
9737 ada_promote_array_of_integrals (struct type *type, struct value *val)
9739 struct type *elt_type = TYPE_TARGET_TYPE (type);
9744 /* Verify that both val and type are arrays of scalars, and
9745 that the size of val's elements is smaller than the size
9746 of type's element. */
9747 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
9748 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
9749 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
9750 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
9751 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
9752 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
9754 if (!get_array_bounds (type, &lo, &hi))
9755 error (_("unable to determine array bounds"));
9757 res = allocate_value (type);
9759 /* Promote each array element. */
9760 for (i = 0; i < hi - lo + 1; i++)
9762 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
9764 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
9765 value_contents_all (elt), TYPE_LENGTH (elt_type));
9771 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9772 return the converted value. */
9774 static struct value *
9775 coerce_for_assign (struct type *type, struct value *val)
9777 struct type *type2 = value_type (val);
9782 type2 = ada_check_typedef (type2);
9783 type = ada_check_typedef (type);
9785 if (TYPE_CODE (type2) == TYPE_CODE_PTR
9786 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9788 val = ada_value_ind (val);
9789 type2 = value_type (val);
9792 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
9793 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9795 if (!ada_same_array_size_p (type, type2))
9796 error (_("cannot assign arrays of different length"));
9798 if (is_integral_type (TYPE_TARGET_TYPE (type))
9799 && is_integral_type (TYPE_TARGET_TYPE (type2))
9800 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9801 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9803 /* Allow implicit promotion of the array elements to
9805 return ada_promote_array_of_integrals (type, val);
9808 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9809 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9810 error (_("Incompatible types in assignment"));
9811 deprecated_set_value_type (val, type);
9816 static struct value *
9817 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
9820 struct type *type1, *type2;
9823 arg1 = coerce_ref (arg1);
9824 arg2 = coerce_ref (arg2);
9825 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
9826 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
9828 if (TYPE_CODE (type1) != TYPE_CODE_INT
9829 || TYPE_CODE (type2) != TYPE_CODE_INT)
9830 return value_binop (arg1, arg2, op);
9839 return value_binop (arg1, arg2, op);
9842 v2 = value_as_long (arg2);
9844 error (_("second operand of %s must not be zero."), op_string (op));
9846 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
9847 return value_binop (arg1, arg2, op);
9849 v1 = value_as_long (arg1);
9854 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
9855 v += v > 0 ? -1 : 1;
9863 /* Should not reach this point. */
9867 val = allocate_value (type1);
9868 store_unsigned_integer (value_contents_raw (val),
9869 TYPE_LENGTH (value_type (val)),
9870 gdbarch_byte_order (get_type_arch (type1)), v);
9875 ada_value_equal (struct value *arg1, struct value *arg2)
9877 if (ada_is_direct_array_type (value_type (arg1))
9878 || ada_is_direct_array_type (value_type (arg2)))
9880 struct type *arg1_type, *arg2_type;
9882 /* Automatically dereference any array reference before
9883 we attempt to perform the comparison. */
9884 arg1 = ada_coerce_ref (arg1);
9885 arg2 = ada_coerce_ref (arg2);
9887 arg1 = ada_coerce_to_simple_array (arg1);
9888 arg2 = ada_coerce_to_simple_array (arg2);
9890 arg1_type = ada_check_typedef (value_type (arg1));
9891 arg2_type = ada_check_typedef (value_type (arg2));
9893 if (TYPE_CODE (arg1_type) != TYPE_CODE_ARRAY
9894 || TYPE_CODE (arg2_type) != TYPE_CODE_ARRAY)
9895 error (_("Attempt to compare array with non-array"));
9896 /* FIXME: The following works only for types whose
9897 representations use all bits (no padding or undefined bits)
9898 and do not have user-defined equality. */
9899 return (TYPE_LENGTH (arg1_type) == TYPE_LENGTH (arg2_type)
9900 && memcmp (value_contents (arg1), value_contents (arg2),
9901 TYPE_LENGTH (arg1_type)) == 0);
9903 return value_equal (arg1, arg2);
9906 /* Total number of component associations in the aggregate starting at
9907 index PC in EXP. Assumes that index PC is the start of an
9911 num_component_specs (struct expression *exp, int pc)
9915 m = exp->elts[pc + 1].longconst;
9918 for (i = 0; i < m; i += 1)
9920 switch (exp->elts[pc].opcode)
9926 n += exp->elts[pc + 1].longconst;
9929 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
9934 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9935 component of LHS (a simple array or a record), updating *POS past
9936 the expression, assuming that LHS is contained in CONTAINER. Does
9937 not modify the inferior's memory, nor does it modify LHS (unless
9938 LHS == CONTAINER). */
9941 assign_component (struct value *container, struct value *lhs, LONGEST index,
9942 struct expression *exp, int *pos)
9944 struct value *mark = value_mark ();
9946 struct type *lhs_type = check_typedef (value_type (lhs));
9948 if (TYPE_CODE (lhs_type) == TYPE_CODE_ARRAY)
9950 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
9951 struct value *index_val = value_from_longest (index_type, index);
9953 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
9957 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
9958 elt = ada_to_fixed_value (elt);
9961 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9962 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
9964 value_assign_to_component (container, elt,
9965 ada_evaluate_subexp (NULL, exp, pos,
9968 value_free_to_mark (mark);
9971 /* Assuming that LHS represents an lvalue having a record or array
9972 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9973 of that aggregate's value to LHS, advancing *POS past the
9974 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9975 lvalue containing LHS (possibly LHS itself). Does not modify
9976 the inferior's memory, nor does it modify the contents of
9977 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9979 static struct value *
9980 assign_aggregate (struct value *container,
9981 struct value *lhs, struct expression *exp,
9982 int *pos, enum noside noside)
9984 struct type *lhs_type;
9985 int n = exp->elts[*pos+1].longconst;
9986 LONGEST low_index, high_index;
9989 int max_indices, num_indices;
9993 if (noside != EVAL_NORMAL)
9995 for (i = 0; i < n; i += 1)
9996 ada_evaluate_subexp (NULL, exp, pos, noside);
10000 container = ada_coerce_ref (container);
10001 if (ada_is_direct_array_type (value_type (container)))
10002 container = ada_coerce_to_simple_array (container);
10003 lhs = ada_coerce_ref (lhs);
10004 if (!deprecated_value_modifiable (lhs))
10005 error (_("Left operand of assignment is not a modifiable lvalue."));
10007 lhs_type = check_typedef (value_type (lhs));
10008 if (ada_is_direct_array_type (lhs_type))
10010 lhs = ada_coerce_to_simple_array (lhs);
10011 lhs_type = check_typedef (value_type (lhs));
10012 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
10013 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
10015 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
10018 high_index = num_visible_fields (lhs_type) - 1;
10021 error (_("Left-hand side must be array or record."));
10023 num_specs = num_component_specs (exp, *pos - 3);
10024 max_indices = 4 * num_specs + 4;
10025 indices = XALLOCAVEC (LONGEST, max_indices);
10026 indices[0] = indices[1] = low_index - 1;
10027 indices[2] = indices[3] = high_index + 1;
10030 for (i = 0; i < n; i += 1)
10032 switch (exp->elts[*pos].opcode)
10035 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
10036 &num_indices, max_indices,
10037 low_index, high_index);
10039 case OP_POSITIONAL:
10040 aggregate_assign_positional (container, lhs, exp, pos, indices,
10041 &num_indices, max_indices,
10042 low_index, high_index);
10046 error (_("Misplaced 'others' clause"));
10047 aggregate_assign_others (container, lhs, exp, pos, indices,
10048 num_indices, low_index, high_index);
10051 error (_("Internal error: bad aggregate clause"));
10058 /* Assign into the component of LHS indexed by the OP_POSITIONAL
10059 construct at *POS, updating *POS past the construct, given that
10060 the positions are relative to lower bound LOW, where HIGH is the
10061 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
10062 updating *NUM_INDICES as needed. CONTAINER is as for
10063 assign_aggregate. */
10065 aggregate_assign_positional (struct value *container,
10066 struct value *lhs, struct expression *exp,
10067 int *pos, LONGEST *indices, int *num_indices,
10068 int max_indices, LONGEST low, LONGEST high)
10070 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
10072 if (ind - 1 == high)
10073 warning (_("Extra components in aggregate ignored."));
10076 add_component_interval (ind, ind, indices, num_indices, max_indices);
10078 assign_component (container, lhs, ind, exp, pos);
10081 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10084 /* Assign into the components of LHS indexed by the OP_CHOICES
10085 construct at *POS, updating *POS past the construct, given that
10086 the allowable indices are LOW..HIGH. Record the indices assigned
10087 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
10088 needed. CONTAINER is as for assign_aggregate. */
10090 aggregate_assign_from_choices (struct value *container,
10091 struct value *lhs, struct expression *exp,
10092 int *pos, LONGEST *indices, int *num_indices,
10093 int max_indices, LONGEST low, LONGEST high)
10096 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
10097 int choice_pos, expr_pc;
10098 int is_array = ada_is_direct_array_type (value_type (lhs));
10100 choice_pos = *pos += 3;
10102 for (j = 0; j < n_choices; j += 1)
10103 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10105 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10107 for (j = 0; j < n_choices; j += 1)
10109 LONGEST lower, upper;
10110 enum exp_opcode op = exp->elts[choice_pos].opcode;
10112 if (op == OP_DISCRETE_RANGE)
10115 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10117 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10122 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
10134 name = &exp->elts[choice_pos + 2].string;
10137 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
10140 error (_("Invalid record component association."));
10142 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
10144 if (! find_struct_field (name, value_type (lhs), 0,
10145 NULL, NULL, NULL, NULL, &ind))
10146 error (_("Unknown component name: %s."), name);
10147 lower = upper = ind;
10150 if (lower <= upper && (lower < low || upper > high))
10151 error (_("Index in component association out of bounds."));
10153 add_component_interval (lower, upper, indices, num_indices,
10155 while (lower <= upper)
10160 assign_component (container, lhs, lower, exp, &pos1);
10166 /* Assign the value of the expression in the OP_OTHERS construct in
10167 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
10168 have not been previously assigned. The index intervals already assigned
10169 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
10170 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
10172 aggregate_assign_others (struct value *container,
10173 struct value *lhs, struct expression *exp,
10174 int *pos, LONGEST *indices, int num_indices,
10175 LONGEST low, LONGEST high)
10178 int expr_pc = *pos + 1;
10180 for (i = 0; i < num_indices - 2; i += 2)
10184 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
10188 localpos = expr_pc;
10189 assign_component (container, lhs, ind, exp, &localpos);
10192 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10195 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
10196 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10197 modifying *SIZE as needed. It is an error if *SIZE exceeds
10198 MAX_SIZE. The resulting intervals do not overlap. */
10200 add_component_interval (LONGEST low, LONGEST high,
10201 LONGEST* indices, int *size, int max_size)
10205 for (i = 0; i < *size; i += 2) {
10206 if (high >= indices[i] && low <= indices[i + 1])
10210 for (kh = i + 2; kh < *size; kh += 2)
10211 if (high < indices[kh])
10213 if (low < indices[i])
10215 indices[i + 1] = indices[kh - 1];
10216 if (high > indices[i + 1])
10217 indices[i + 1] = high;
10218 memcpy (indices + i + 2, indices + kh, *size - kh);
10219 *size -= kh - i - 2;
10222 else if (high < indices[i])
10226 if (*size == max_size)
10227 error (_("Internal error: miscounted aggregate components."));
10229 for (j = *size-1; j >= i+2; j -= 1)
10230 indices[j] = indices[j - 2];
10232 indices[i + 1] = high;
10235 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10238 static struct value *
10239 ada_value_cast (struct type *type, struct value *arg2)
10241 if (type == ada_check_typedef (value_type (arg2)))
10244 if (ada_is_fixed_point_type (type))
10245 return cast_to_fixed (type, arg2);
10247 if (ada_is_fixed_point_type (value_type (arg2)))
10248 return cast_from_fixed (type, arg2);
10250 return value_cast (type, arg2);
10253 /* Evaluating Ada expressions, and printing their result.
10254 ------------------------------------------------------
10259 We usually evaluate an Ada expression in order to print its value.
10260 We also evaluate an expression in order to print its type, which
10261 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10262 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10263 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10264 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10267 Evaluating expressions is a little more complicated for Ada entities
10268 than it is for entities in languages such as C. The main reason for
10269 this is that Ada provides types whose definition might be dynamic.
10270 One example of such types is variant records. Or another example
10271 would be an array whose bounds can only be known at run time.
10273 The following description is a general guide as to what should be
10274 done (and what should NOT be done) in order to evaluate an expression
10275 involving such types, and when. This does not cover how the semantic
10276 information is encoded by GNAT as this is covered separatly. For the
10277 document used as the reference for the GNAT encoding, see exp_dbug.ads
10278 in the GNAT sources.
10280 Ideally, we should embed each part of this description next to its
10281 associated code. Unfortunately, the amount of code is so vast right
10282 now that it's hard to see whether the code handling a particular
10283 situation might be duplicated or not. One day, when the code is
10284 cleaned up, this guide might become redundant with the comments
10285 inserted in the code, and we might want to remove it.
10287 2. ``Fixing'' an Entity, the Simple Case:
10288 -----------------------------------------
10290 When evaluating Ada expressions, the tricky issue is that they may
10291 reference entities whose type contents and size are not statically
10292 known. Consider for instance a variant record:
10294 type Rec (Empty : Boolean := True) is record
10297 when False => Value : Integer;
10300 Yes : Rec := (Empty => False, Value => 1);
10301 No : Rec := (empty => True);
10303 The size and contents of that record depends on the value of the
10304 descriminant (Rec.Empty). At this point, neither the debugging
10305 information nor the associated type structure in GDB are able to
10306 express such dynamic types. So what the debugger does is to create
10307 "fixed" versions of the type that applies to the specific object.
10308 We also informally refer to this opperation as "fixing" an object,
10309 which means creating its associated fixed type.
10311 Example: when printing the value of variable "Yes" above, its fixed
10312 type would look like this:
10319 On the other hand, if we printed the value of "No", its fixed type
10326 Things become a little more complicated when trying to fix an entity
10327 with a dynamic type that directly contains another dynamic type,
10328 such as an array of variant records, for instance. There are
10329 two possible cases: Arrays, and records.
10331 3. ``Fixing'' Arrays:
10332 ---------------------
10334 The type structure in GDB describes an array in terms of its bounds,
10335 and the type of its elements. By design, all elements in the array
10336 have the same type and we cannot represent an array of variant elements
10337 using the current type structure in GDB. When fixing an array,
10338 we cannot fix the array element, as we would potentially need one
10339 fixed type per element of the array. As a result, the best we can do
10340 when fixing an array is to produce an array whose bounds and size
10341 are correct (allowing us to read it from memory), but without having
10342 touched its element type. Fixing each element will be done later,
10343 when (if) necessary.
10345 Arrays are a little simpler to handle than records, because the same
10346 amount of memory is allocated for each element of the array, even if
10347 the amount of space actually used by each element differs from element
10348 to element. Consider for instance the following array of type Rec:
10350 type Rec_Array is array (1 .. 2) of Rec;
10352 The actual amount of memory occupied by each element might be different
10353 from element to element, depending on the value of their discriminant.
10354 But the amount of space reserved for each element in the array remains
10355 fixed regardless. So we simply need to compute that size using
10356 the debugging information available, from which we can then determine
10357 the array size (we multiply the number of elements of the array by
10358 the size of each element).
10360 The simplest case is when we have an array of a constrained element
10361 type. For instance, consider the following type declarations:
10363 type Bounded_String (Max_Size : Integer) is
10365 Buffer : String (1 .. Max_Size);
10367 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10369 In this case, the compiler describes the array as an array of
10370 variable-size elements (identified by its XVS suffix) for which
10371 the size can be read in the parallel XVZ variable.
10373 In the case of an array of an unconstrained element type, the compiler
10374 wraps the array element inside a private PAD type. This type should not
10375 be shown to the user, and must be "unwrap"'ed before printing. Note
10376 that we also use the adjective "aligner" in our code to designate
10377 these wrapper types.
10379 In some cases, the size allocated for each element is statically
10380 known. In that case, the PAD type already has the correct size,
10381 and the array element should remain unfixed.
10383 But there are cases when this size is not statically known.
10384 For instance, assuming that "Five" is an integer variable:
10386 type Dynamic is array (1 .. Five) of Integer;
10387 type Wrapper (Has_Length : Boolean := False) is record
10390 when True => Length : Integer;
10391 when False => null;
10394 type Wrapper_Array is array (1 .. 2) of Wrapper;
10396 Hello : Wrapper_Array := (others => (Has_Length => True,
10397 Data => (others => 17),
10401 The debugging info would describe variable Hello as being an
10402 array of a PAD type. The size of that PAD type is not statically
10403 known, but can be determined using a parallel XVZ variable.
10404 In that case, a copy of the PAD type with the correct size should
10405 be used for the fixed array.
10407 3. ``Fixing'' record type objects:
10408 ----------------------------------
10410 Things are slightly different from arrays in the case of dynamic
10411 record types. In this case, in order to compute the associated
10412 fixed type, we need to determine the size and offset of each of
10413 its components. This, in turn, requires us to compute the fixed
10414 type of each of these components.
10416 Consider for instance the example:
10418 type Bounded_String (Max_Size : Natural) is record
10419 Str : String (1 .. Max_Size);
10422 My_String : Bounded_String (Max_Size => 10);
10424 In that case, the position of field "Length" depends on the size
10425 of field Str, which itself depends on the value of the Max_Size
10426 discriminant. In order to fix the type of variable My_String,
10427 we need to fix the type of field Str. Therefore, fixing a variant
10428 record requires us to fix each of its components.
10430 However, if a component does not have a dynamic size, the component
10431 should not be fixed. In particular, fields that use a PAD type
10432 should not fixed. Here is an example where this might happen
10433 (assuming type Rec above):
10435 type Container (Big : Boolean) is record
10439 when True => Another : Integer;
10440 when False => null;
10443 My_Container : Container := (Big => False,
10444 First => (Empty => True),
10447 In that example, the compiler creates a PAD type for component First,
10448 whose size is constant, and then positions the component After just
10449 right after it. The offset of component After is therefore constant
10452 The debugger computes the position of each field based on an algorithm
10453 that uses, among other things, the actual position and size of the field
10454 preceding it. Let's now imagine that the user is trying to print
10455 the value of My_Container. If the type fixing was recursive, we would
10456 end up computing the offset of field After based on the size of the
10457 fixed version of field First. And since in our example First has
10458 only one actual field, the size of the fixed type is actually smaller
10459 than the amount of space allocated to that field, and thus we would
10460 compute the wrong offset of field After.
10462 To make things more complicated, we need to watch out for dynamic
10463 components of variant records (identified by the ___XVL suffix in
10464 the component name). Even if the target type is a PAD type, the size
10465 of that type might not be statically known. So the PAD type needs
10466 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10467 we might end up with the wrong size for our component. This can be
10468 observed with the following type declarations:
10470 type Octal is new Integer range 0 .. 7;
10471 type Octal_Array is array (Positive range <>) of Octal;
10472 pragma Pack (Octal_Array);
10474 type Octal_Buffer (Size : Positive) is record
10475 Buffer : Octal_Array (1 .. Size);
10479 In that case, Buffer is a PAD type whose size is unset and needs
10480 to be computed by fixing the unwrapped type.
10482 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10483 ----------------------------------------------------------
10485 Lastly, when should the sub-elements of an entity that remained unfixed
10486 thus far, be actually fixed?
10488 The answer is: Only when referencing that element. For instance
10489 when selecting one component of a record, this specific component
10490 should be fixed at that point in time. Or when printing the value
10491 of a record, each component should be fixed before its value gets
10492 printed. Similarly for arrays, the element of the array should be
10493 fixed when printing each element of the array, or when extracting
10494 one element out of that array. On the other hand, fixing should
10495 not be performed on the elements when taking a slice of an array!
10497 Note that one of the side effects of miscomputing the offset and
10498 size of each field is that we end up also miscomputing the size
10499 of the containing type. This can have adverse results when computing
10500 the value of an entity. GDB fetches the value of an entity based
10501 on the size of its type, and thus a wrong size causes GDB to fetch
10502 the wrong amount of memory. In the case where the computed size is
10503 too small, GDB fetches too little data to print the value of our
10504 entity. Results in this case are unpredictable, as we usually read
10505 past the buffer containing the data =:-o. */
10507 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10508 for that subexpression cast to TO_TYPE. Advance *POS over the
10512 ada_evaluate_subexp_for_cast (expression *exp, int *pos,
10513 enum noside noside, struct type *to_type)
10517 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE
10518 || exp->elts[pc].opcode == OP_VAR_VALUE)
10523 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
10525 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10526 return value_zero (to_type, not_lval);
10528 val = evaluate_var_msym_value (noside,
10529 exp->elts[pc + 1].objfile,
10530 exp->elts[pc + 2].msymbol);
10533 val = evaluate_var_value (noside,
10534 exp->elts[pc + 1].block,
10535 exp->elts[pc + 2].symbol);
10537 if (noside == EVAL_SKIP)
10538 return eval_skip_value (exp);
10540 val = ada_value_cast (to_type, val);
10542 /* Follow the Ada language semantics that do not allow taking
10543 an address of the result of a cast (view conversion in Ada). */
10544 if (VALUE_LVAL (val) == lval_memory)
10546 if (value_lazy (val))
10547 value_fetch_lazy (val);
10548 VALUE_LVAL (val) = not_lval;
10553 value *val = evaluate_subexp (to_type, exp, pos, noside);
10554 if (noside == EVAL_SKIP)
10555 return eval_skip_value (exp);
10556 return ada_value_cast (to_type, val);
10559 /* Implement the evaluate_exp routine in the exp_descriptor structure
10560 for the Ada language. */
10562 static struct value *
10563 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
10564 int *pos, enum noside noside)
10566 enum exp_opcode op;
10570 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
10573 struct value **argvec;
10577 op = exp->elts[pc].opcode;
10583 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10585 if (noside == EVAL_NORMAL)
10586 arg1 = unwrap_value (arg1);
10588 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10589 then we need to perform the conversion manually, because
10590 evaluate_subexp_standard doesn't do it. This conversion is
10591 necessary in Ada because the different kinds of float/fixed
10592 types in Ada have different representations.
10594 Similarly, we need to perform the conversion from OP_LONG
10596 if ((op == OP_FLOAT || op == OP_LONG) && expect_type != NULL)
10597 arg1 = ada_value_cast (expect_type, arg1);
10603 struct value *result;
10606 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
10607 /* The result type will have code OP_STRING, bashed there from
10608 OP_ARRAY. Bash it back. */
10609 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
10610 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
10616 type = exp->elts[pc + 1].type;
10617 return ada_evaluate_subexp_for_cast (exp, pos, noside, type);
10621 type = exp->elts[pc + 1].type;
10622 return ada_evaluate_subexp (type, exp, pos, noside);
10625 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10626 if (exp->elts[*pos].opcode == OP_AGGREGATE)
10628 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
10629 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10631 return ada_value_assign (arg1, arg1);
10633 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10634 except if the lhs of our assignment is a convenience variable.
10635 In the case of assigning to a convenience variable, the lhs
10636 should be exactly the result of the evaluation of the rhs. */
10637 type = value_type (arg1);
10638 if (VALUE_LVAL (arg1) == lval_internalvar)
10640 arg2 = evaluate_subexp (type, exp, pos, noside);
10641 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10643 if (ada_is_fixed_point_type (value_type (arg1)))
10644 arg2 = cast_to_fixed (value_type (arg1), arg2);
10645 else if (ada_is_fixed_point_type (value_type (arg2)))
10647 (_("Fixed-point values must be assigned to fixed-point variables"));
10649 arg2 = coerce_for_assign (value_type (arg1), arg2);
10650 return ada_value_assign (arg1, arg2);
10653 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10654 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10655 if (noside == EVAL_SKIP)
10657 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10658 return (value_from_longest
10659 (value_type (arg1),
10660 value_as_long (arg1) + value_as_long (arg2)));
10661 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10662 return (value_from_longest
10663 (value_type (arg2),
10664 value_as_long (arg1) + value_as_long (arg2)));
10665 if ((ada_is_fixed_point_type (value_type (arg1))
10666 || ada_is_fixed_point_type (value_type (arg2)))
10667 && value_type (arg1) != value_type (arg2))
10668 error (_("Operands of fixed-point addition must have the same type"));
10669 /* Do the addition, and cast the result to the type of the first
10670 argument. We cannot cast the result to a reference type, so if
10671 ARG1 is a reference type, find its underlying type. */
10672 type = value_type (arg1);
10673 while (TYPE_CODE (type) == TYPE_CODE_REF)
10674 type = TYPE_TARGET_TYPE (type);
10675 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10676 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
10679 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10680 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10681 if (noside == EVAL_SKIP)
10683 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10684 return (value_from_longest
10685 (value_type (arg1),
10686 value_as_long (arg1) - value_as_long (arg2)));
10687 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10688 return (value_from_longest
10689 (value_type (arg2),
10690 value_as_long (arg1) - value_as_long (arg2)));
10691 if ((ada_is_fixed_point_type (value_type (arg1))
10692 || ada_is_fixed_point_type (value_type (arg2)))
10693 && value_type (arg1) != value_type (arg2))
10694 error (_("Operands of fixed-point subtraction "
10695 "must have the same type"));
10696 /* Do the substraction, and cast the result to the type of the first
10697 argument. We cannot cast the result to a reference type, so if
10698 ARG1 is a reference type, find its underlying type. */
10699 type = value_type (arg1);
10700 while (TYPE_CODE (type) == TYPE_CODE_REF)
10701 type = TYPE_TARGET_TYPE (type);
10702 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10703 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
10709 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10710 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10711 if (noside == EVAL_SKIP)
10713 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10715 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10716 return value_zero (value_type (arg1), not_lval);
10720 type = builtin_type (exp->gdbarch)->builtin_double;
10721 if (ada_is_fixed_point_type (value_type (arg1)))
10722 arg1 = cast_from_fixed (type, arg1);
10723 if (ada_is_fixed_point_type (value_type (arg2)))
10724 arg2 = cast_from_fixed (type, arg2);
10725 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10726 return ada_value_binop (arg1, arg2, op);
10730 case BINOP_NOTEQUAL:
10731 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10732 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
10733 if (noside == EVAL_SKIP)
10735 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10739 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10740 tem = ada_value_equal (arg1, arg2);
10742 if (op == BINOP_NOTEQUAL)
10744 type = language_bool_type (exp->language_defn, exp->gdbarch);
10745 return value_from_longest (type, (LONGEST) tem);
10748 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10749 if (noside == EVAL_SKIP)
10751 else if (ada_is_fixed_point_type (value_type (arg1)))
10752 return value_cast (value_type (arg1), value_neg (arg1));
10755 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10756 return value_neg (arg1);
10759 case BINOP_LOGICAL_AND:
10760 case BINOP_LOGICAL_OR:
10761 case UNOP_LOGICAL_NOT:
10766 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10767 type = language_bool_type (exp->language_defn, exp->gdbarch);
10768 return value_cast (type, val);
10771 case BINOP_BITWISE_AND:
10772 case BINOP_BITWISE_IOR:
10773 case BINOP_BITWISE_XOR:
10777 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
10779 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10781 return value_cast (value_type (arg1), val);
10787 if (noside == EVAL_SKIP)
10793 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
10794 /* Only encountered when an unresolved symbol occurs in a
10795 context other than a function call, in which case, it is
10797 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10798 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
10800 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10802 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
10803 /* Check to see if this is a tagged type. We also need to handle
10804 the case where the type is a reference to a tagged type, but
10805 we have to be careful to exclude pointers to tagged types.
10806 The latter should be shown as usual (as a pointer), whereas
10807 a reference should mostly be transparent to the user. */
10808 if (ada_is_tagged_type (type, 0)
10809 || (TYPE_CODE (type) == TYPE_CODE_REF
10810 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
10812 /* Tagged types are a little special in the fact that the real
10813 type is dynamic and can only be determined by inspecting the
10814 object's tag. This means that we need to get the object's
10815 value first (EVAL_NORMAL) and then extract the actual object
10818 Note that we cannot skip the final step where we extract
10819 the object type from its tag, because the EVAL_NORMAL phase
10820 results in dynamic components being resolved into fixed ones.
10821 This can cause problems when trying to print the type
10822 description of tagged types whose parent has a dynamic size:
10823 We use the type name of the "_parent" component in order
10824 to print the name of the ancestor type in the type description.
10825 If that component had a dynamic size, the resolution into
10826 a fixed type would result in the loss of that type name,
10827 thus preventing us from printing the name of the ancestor
10828 type in the type description. */
10829 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
10831 if (TYPE_CODE (type) != TYPE_CODE_REF)
10833 struct type *actual_type;
10835 actual_type = type_from_tag (ada_value_tag (arg1));
10836 if (actual_type == NULL)
10837 /* If, for some reason, we were unable to determine
10838 the actual type from the tag, then use the static
10839 approximation that we just computed as a fallback.
10840 This can happen if the debugging information is
10841 incomplete, for instance. */
10842 actual_type = type;
10843 return value_zero (actual_type, not_lval);
10847 /* In the case of a ref, ada_coerce_ref takes care
10848 of determining the actual type. But the evaluation
10849 should return a ref as it should be valid to ask
10850 for its address; so rebuild a ref after coerce. */
10851 arg1 = ada_coerce_ref (arg1);
10852 return value_ref (arg1, TYPE_CODE_REF);
10856 /* Records and unions for which GNAT encodings have been
10857 generated need to be statically fixed as well.
10858 Otherwise, non-static fixing produces a type where
10859 all dynamic properties are removed, which prevents "ptype"
10860 from being able to completely describe the type.
10861 For instance, a case statement in a variant record would be
10862 replaced by the relevant components based on the actual
10863 value of the discriminants. */
10864 if ((TYPE_CODE (type) == TYPE_CODE_STRUCT
10865 && dynamic_template_type (type) != NULL)
10866 || (TYPE_CODE (type) == TYPE_CODE_UNION
10867 && ada_find_parallel_type (type, "___XVU") != NULL))
10870 return value_zero (to_static_fixed_type (type), not_lval);
10874 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10875 return ada_to_fixed_value (arg1);
10880 /* Allocate arg vector, including space for the function to be
10881 called in argvec[0] and a terminating NULL. */
10882 nargs = longest_to_int (exp->elts[pc + 1].longconst);
10883 argvec = XALLOCAVEC (struct value *, nargs + 2);
10885 if (exp->elts[*pos].opcode == OP_VAR_VALUE
10886 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
10887 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10888 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
10891 for (tem = 0; tem <= nargs; tem += 1)
10892 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10895 if (noside == EVAL_SKIP)
10899 if (ada_is_constrained_packed_array_type
10900 (desc_base_type (value_type (argvec[0]))))
10901 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
10902 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10903 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
10904 /* This is a packed array that has already been fixed, and
10905 therefore already coerced to a simple array. Nothing further
10908 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF)
10910 /* Make sure we dereference references so that all the code below
10911 feels like it's really handling the referenced value. Wrapping
10912 types (for alignment) may be there, so make sure we strip them as
10914 argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0]));
10916 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10917 && VALUE_LVAL (argvec[0]) == lval_memory)
10918 argvec[0] = value_addr (argvec[0]);
10920 type = ada_check_typedef (value_type (argvec[0]));
10922 /* Ada allows us to implicitly dereference arrays when subscripting
10923 them. So, if this is an array typedef (encoding use for array
10924 access types encoded as fat pointers), strip it now. */
10925 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
10926 type = ada_typedef_target_type (type);
10928 if (TYPE_CODE (type) == TYPE_CODE_PTR)
10930 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
10932 case TYPE_CODE_FUNC:
10933 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10935 case TYPE_CODE_ARRAY:
10937 case TYPE_CODE_STRUCT:
10938 if (noside != EVAL_AVOID_SIDE_EFFECTS)
10939 argvec[0] = ada_value_ind (argvec[0]);
10940 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10943 error (_("cannot subscript or call something of type `%s'"),
10944 ada_type_name (value_type (argvec[0])));
10949 switch (TYPE_CODE (type))
10951 case TYPE_CODE_FUNC:
10952 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10954 if (TYPE_TARGET_TYPE (type) == NULL)
10955 error_call_unknown_return_type (NULL);
10956 return allocate_value (TYPE_TARGET_TYPE (type));
10958 return call_function_by_hand (argvec[0], NULL, nargs, argvec + 1);
10959 case TYPE_CODE_INTERNAL_FUNCTION:
10960 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10961 /* We don't know anything about what the internal
10962 function might return, but we have to return
10964 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10967 return call_internal_function (exp->gdbarch, exp->language_defn,
10968 argvec[0], nargs, argvec + 1);
10970 case TYPE_CODE_STRUCT:
10974 arity = ada_array_arity (type);
10975 type = ada_array_element_type (type, nargs);
10977 error (_("cannot subscript or call a record"));
10978 if (arity != nargs)
10979 error (_("wrong number of subscripts; expecting %d"), arity);
10980 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10981 return value_zero (ada_aligned_type (type), lval_memory);
10983 unwrap_value (ada_value_subscript
10984 (argvec[0], nargs, argvec + 1));
10986 case TYPE_CODE_ARRAY:
10987 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10989 type = ada_array_element_type (type, nargs);
10991 error (_("element type of array unknown"));
10993 return value_zero (ada_aligned_type (type), lval_memory);
10996 unwrap_value (ada_value_subscript
10997 (ada_coerce_to_simple_array (argvec[0]),
10998 nargs, argvec + 1));
10999 case TYPE_CODE_PTR: /* Pointer to array */
11000 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11002 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
11003 type = ada_array_element_type (type, nargs);
11005 error (_("element type of array unknown"));
11007 return value_zero (ada_aligned_type (type), lval_memory);
11010 unwrap_value (ada_value_ptr_subscript (argvec[0],
11011 nargs, argvec + 1));
11014 error (_("Attempt to index or call something other than an "
11015 "array or function"));
11020 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11021 struct value *low_bound_val =
11022 evaluate_subexp (NULL_TYPE, exp, pos, noside);
11023 struct value *high_bound_val =
11024 evaluate_subexp (NULL_TYPE, exp, pos, noside);
11026 LONGEST high_bound;
11028 low_bound_val = coerce_ref (low_bound_val);
11029 high_bound_val = coerce_ref (high_bound_val);
11030 low_bound = value_as_long (low_bound_val);
11031 high_bound = value_as_long (high_bound_val);
11033 if (noside == EVAL_SKIP)
11036 /* If this is a reference to an aligner type, then remove all
11038 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11039 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
11040 TYPE_TARGET_TYPE (value_type (array)) =
11041 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
11043 if (ada_is_constrained_packed_array_type (value_type (array)))
11044 error (_("cannot slice a packed array"));
11046 /* If this is a reference to an array or an array lvalue,
11047 convert to a pointer. */
11048 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11049 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
11050 && VALUE_LVAL (array) == lval_memory))
11051 array = value_addr (array);
11053 if (noside == EVAL_AVOID_SIDE_EFFECTS
11054 && ada_is_array_descriptor_type (ada_check_typedef
11055 (value_type (array))))
11056 return empty_array (ada_type_of_array (array, 0), low_bound);
11058 array = ada_coerce_to_simple_array_ptr (array);
11060 /* If we have more than one level of pointer indirection,
11061 dereference the value until we get only one level. */
11062 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
11063 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
11065 array = value_ind (array);
11067 /* Make sure we really do have an array type before going further,
11068 to avoid a SEGV when trying to get the index type or the target
11069 type later down the road if the debug info generated by
11070 the compiler is incorrect or incomplete. */
11071 if (!ada_is_simple_array_type (value_type (array)))
11072 error (_("cannot take slice of non-array"));
11074 if (TYPE_CODE (ada_check_typedef (value_type (array)))
11077 struct type *type0 = ada_check_typedef (value_type (array));
11079 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
11080 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
11083 struct type *arr_type0 =
11084 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
11086 return ada_value_slice_from_ptr (array, arr_type0,
11087 longest_to_int (low_bound),
11088 longest_to_int (high_bound));
11091 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11093 else if (high_bound < low_bound)
11094 return empty_array (value_type (array), low_bound);
11096 return ada_value_slice (array, longest_to_int (low_bound),
11097 longest_to_int (high_bound));
11100 case UNOP_IN_RANGE:
11102 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11103 type = check_typedef (exp->elts[pc + 1].type);
11105 if (noside == EVAL_SKIP)
11108 switch (TYPE_CODE (type))
11111 lim_warning (_("Membership test incompletely implemented; "
11112 "always returns true"));
11113 type = language_bool_type (exp->language_defn, exp->gdbarch);
11114 return value_from_longest (type, (LONGEST) 1);
11116 case TYPE_CODE_RANGE:
11117 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
11118 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
11119 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11120 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11121 type = language_bool_type (exp->language_defn, exp->gdbarch);
11123 value_from_longest (type,
11124 (value_less (arg1, arg3)
11125 || value_equal (arg1, arg3))
11126 && (value_less (arg2, arg1)
11127 || value_equal (arg2, arg1)));
11130 case BINOP_IN_BOUNDS:
11132 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11133 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11135 if (noside == EVAL_SKIP)
11138 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11140 type = language_bool_type (exp->language_defn, exp->gdbarch);
11141 return value_zero (type, not_lval);
11144 tem = longest_to_int (exp->elts[pc + 1].longconst);
11146 type = ada_index_type (value_type (arg2), tem, "range");
11148 type = value_type (arg1);
11150 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
11151 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
11153 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11154 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11155 type = language_bool_type (exp->language_defn, exp->gdbarch);
11157 value_from_longest (type,
11158 (value_less (arg1, arg3)
11159 || value_equal (arg1, arg3))
11160 && (value_less (arg2, arg1)
11161 || value_equal (arg2, arg1)));
11163 case TERNOP_IN_RANGE:
11164 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11165 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11166 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11168 if (noside == EVAL_SKIP)
11171 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11172 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11173 type = language_bool_type (exp->language_defn, exp->gdbarch);
11175 value_from_longest (type,
11176 (value_less (arg1, arg3)
11177 || value_equal (arg1, arg3))
11178 && (value_less (arg2, arg1)
11179 || value_equal (arg2, arg1)));
11183 case OP_ATR_LENGTH:
11185 struct type *type_arg;
11187 if (exp->elts[*pos].opcode == OP_TYPE)
11189 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11191 type_arg = check_typedef (exp->elts[pc + 2].type);
11195 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11199 if (exp->elts[*pos].opcode != OP_LONG)
11200 error (_("Invalid operand to '%s"), ada_attribute_name (op));
11201 tem = longest_to_int (exp->elts[*pos + 2].longconst);
11204 if (noside == EVAL_SKIP)
11207 if (type_arg == NULL)
11209 arg1 = ada_coerce_ref (arg1);
11211 if (ada_is_constrained_packed_array_type (value_type (arg1)))
11212 arg1 = ada_coerce_to_simple_array (arg1);
11214 if (op == OP_ATR_LENGTH)
11215 type = builtin_type (exp->gdbarch)->builtin_int;
11218 type = ada_index_type (value_type (arg1), tem,
11219 ada_attribute_name (op));
11221 type = builtin_type (exp->gdbarch)->builtin_int;
11224 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11225 return allocate_value (type);
11229 default: /* Should never happen. */
11230 error (_("unexpected attribute encountered"));
11232 return value_from_longest
11233 (type, ada_array_bound (arg1, tem, 0));
11235 return value_from_longest
11236 (type, ada_array_bound (arg1, tem, 1));
11237 case OP_ATR_LENGTH:
11238 return value_from_longest
11239 (type, ada_array_length (arg1, tem));
11242 else if (discrete_type_p (type_arg))
11244 struct type *range_type;
11245 const char *name = ada_type_name (type_arg);
11248 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
11249 range_type = to_fixed_range_type (type_arg, NULL);
11250 if (range_type == NULL)
11251 range_type = type_arg;
11255 error (_("unexpected attribute encountered"));
11257 return value_from_longest
11258 (range_type, ada_discrete_type_low_bound (range_type));
11260 return value_from_longest
11261 (range_type, ada_discrete_type_high_bound (range_type));
11262 case OP_ATR_LENGTH:
11263 error (_("the 'length attribute applies only to array types"));
11266 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
11267 error (_("unimplemented type attribute"));
11272 if (ada_is_constrained_packed_array_type (type_arg))
11273 type_arg = decode_constrained_packed_array_type (type_arg);
11275 if (op == OP_ATR_LENGTH)
11276 type = builtin_type (exp->gdbarch)->builtin_int;
11279 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
11281 type = builtin_type (exp->gdbarch)->builtin_int;
11284 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11285 return allocate_value (type);
11290 error (_("unexpected attribute encountered"));
11292 low = ada_array_bound_from_type (type_arg, tem, 0);
11293 return value_from_longest (type, low);
11295 high = ada_array_bound_from_type (type_arg, tem, 1);
11296 return value_from_longest (type, high);
11297 case OP_ATR_LENGTH:
11298 low = ada_array_bound_from_type (type_arg, tem, 0);
11299 high = ada_array_bound_from_type (type_arg, tem, 1);
11300 return value_from_longest (type, high - low + 1);
11306 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11307 if (noside == EVAL_SKIP)
11310 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11311 return value_zero (ada_tag_type (arg1), not_lval);
11313 return ada_value_tag (arg1);
11317 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11318 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11319 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11320 if (noside == EVAL_SKIP)
11322 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11323 return value_zero (value_type (arg1), not_lval);
11326 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11327 return value_binop (arg1, arg2,
11328 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
11331 case OP_ATR_MODULUS:
11333 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
11335 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11336 if (noside == EVAL_SKIP)
11339 if (!ada_is_modular_type (type_arg))
11340 error (_("'modulus must be applied to modular type"));
11342 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
11343 ada_modulus (type_arg));
11348 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11349 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11350 if (noside == EVAL_SKIP)
11352 type = builtin_type (exp->gdbarch)->builtin_int;
11353 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11354 return value_zero (type, not_lval);
11356 return value_pos_atr (type, arg1);
11359 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11360 type = value_type (arg1);
11362 /* If the argument is a reference, then dereference its type, since
11363 the user is really asking for the size of the actual object,
11364 not the size of the pointer. */
11365 if (TYPE_CODE (type) == TYPE_CODE_REF)
11366 type = TYPE_TARGET_TYPE (type);
11368 if (noside == EVAL_SKIP)
11370 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11371 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
11373 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
11374 TARGET_CHAR_BIT * TYPE_LENGTH (type));
11377 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11378 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11379 type = exp->elts[pc + 2].type;
11380 if (noside == EVAL_SKIP)
11382 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11383 return value_zero (type, not_lval);
11385 return value_val_atr (type, arg1);
11388 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11389 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11390 if (noside == EVAL_SKIP)
11392 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11393 return value_zero (value_type (arg1), not_lval);
11396 /* For integer exponentiation operations,
11397 only promote the first argument. */
11398 if (is_integral_type (value_type (arg2)))
11399 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
11401 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11403 return value_binop (arg1, arg2, op);
11407 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11408 if (noside == EVAL_SKIP)
11414 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11415 if (noside == EVAL_SKIP)
11417 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
11418 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
11419 return value_neg (arg1);
11424 preeval_pos = *pos;
11425 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11426 if (noside == EVAL_SKIP)
11428 type = ada_check_typedef (value_type (arg1));
11429 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11431 if (ada_is_array_descriptor_type (type))
11432 /* GDB allows dereferencing GNAT array descriptors. */
11434 struct type *arrType = ada_type_of_array (arg1, 0);
11436 if (arrType == NULL)
11437 error (_("Attempt to dereference null array pointer."));
11438 return value_at_lazy (arrType, 0);
11440 else if (TYPE_CODE (type) == TYPE_CODE_PTR
11441 || TYPE_CODE (type) == TYPE_CODE_REF
11442 /* In C you can dereference an array to get the 1st elt. */
11443 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
11445 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11446 only be determined by inspecting the object's tag.
11447 This means that we need to evaluate completely the
11448 expression in order to get its type. */
11450 if ((TYPE_CODE (type) == TYPE_CODE_REF
11451 || TYPE_CODE (type) == TYPE_CODE_PTR)
11452 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))
11454 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11456 type = value_type (ada_value_ind (arg1));
11460 type = to_static_fixed_type
11462 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
11464 ada_ensure_varsize_limit (type);
11465 return value_zero (type, lval_memory);
11467 else if (TYPE_CODE (type) == TYPE_CODE_INT)
11469 /* GDB allows dereferencing an int. */
11470 if (expect_type == NULL)
11471 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
11476 to_static_fixed_type (ada_aligned_type (expect_type));
11477 return value_zero (expect_type, lval_memory);
11481 error (_("Attempt to take contents of a non-pointer value."));
11483 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
11484 type = ada_check_typedef (value_type (arg1));
11486 if (TYPE_CODE (type) == TYPE_CODE_INT)
11487 /* GDB allows dereferencing an int. If we were given
11488 the expect_type, then use that as the target type.
11489 Otherwise, assume that the target type is an int. */
11491 if (expect_type != NULL)
11492 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
11495 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
11496 (CORE_ADDR) value_as_address (arg1));
11499 if (ada_is_array_descriptor_type (type))
11500 /* GDB allows dereferencing GNAT array descriptors. */
11501 return ada_coerce_to_simple_array (arg1);
11503 return ada_value_ind (arg1);
11505 case STRUCTOP_STRUCT:
11506 tem = longest_to_int (exp->elts[pc + 1].longconst);
11507 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
11508 preeval_pos = *pos;
11509 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11510 if (noside == EVAL_SKIP)
11512 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11514 struct type *type1 = value_type (arg1);
11516 if (ada_is_tagged_type (type1, 1))
11518 type = ada_lookup_struct_elt_type (type1,
11519 &exp->elts[pc + 2].string,
11522 /* If the field is not found, check if it exists in the
11523 extension of this object's type. This means that we
11524 need to evaluate completely the expression. */
11528 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11530 arg1 = ada_value_struct_elt (arg1,
11531 &exp->elts[pc + 2].string,
11533 arg1 = unwrap_value (arg1);
11534 type = value_type (ada_to_fixed_value (arg1));
11539 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
11542 return value_zero (ada_aligned_type (type), lval_memory);
11546 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
11547 arg1 = unwrap_value (arg1);
11548 return ada_to_fixed_value (arg1);
11552 /* The value is not supposed to be used. This is here to make it
11553 easier to accommodate expressions that contain types. */
11555 if (noside == EVAL_SKIP)
11557 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11558 return allocate_value (exp->elts[pc + 1].type);
11560 error (_("Attempt to use a type name as an expression"));
11565 case OP_DISCRETE_RANGE:
11566 case OP_POSITIONAL:
11568 if (noside == EVAL_NORMAL)
11572 error (_("Undefined name, ambiguous name, or renaming used in "
11573 "component association: %s."), &exp->elts[pc+2].string);
11575 error (_("Aggregates only allowed on the right of an assignment"));
11577 internal_error (__FILE__, __LINE__,
11578 _("aggregate apparently mangled"));
11581 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11583 for (tem = 0; tem < nargs; tem += 1)
11584 ada_evaluate_subexp (NULL, exp, pos, noside);
11589 return eval_skip_value (exp);
11595 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11596 type name that encodes the 'small and 'delta information.
11597 Otherwise, return NULL. */
11599 static const char *
11600 fixed_type_info (struct type *type)
11602 const char *name = ada_type_name (type);
11603 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
11605 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
11607 const char *tail = strstr (name, "___XF_");
11614 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
11615 return fixed_type_info (TYPE_TARGET_TYPE (type));
11620 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11623 ada_is_fixed_point_type (struct type *type)
11625 return fixed_type_info (type) != NULL;
11628 /* Return non-zero iff TYPE represents a System.Address type. */
11631 ada_is_system_address_type (struct type *type)
11633 return (TYPE_NAME (type)
11634 && strcmp (TYPE_NAME (type), "system__address") == 0);
11637 /* Assuming that TYPE is the representation of an Ada fixed-point
11638 type, return the target floating-point type to be used to represent
11639 of this type during internal computation. */
11641 static struct type *
11642 ada_scaling_type (struct type *type)
11644 return builtin_type (get_type_arch (type))->builtin_long_double;
11647 /* Assuming that TYPE is the representation of an Ada fixed-point
11648 type, return its delta, or NULL if the type is malformed and the
11649 delta cannot be determined. */
11652 ada_delta (struct type *type)
11654 const char *encoding = fixed_type_info (type);
11655 struct type *scale_type = ada_scaling_type (type);
11657 long long num, den;
11659 if (sscanf (encoding, "_%lld_%lld", &num, &den) < 2)
11662 return value_binop (value_from_longest (scale_type, num),
11663 value_from_longest (scale_type, den), BINOP_DIV);
11666 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11667 factor ('SMALL value) associated with the type. */
11670 ada_scaling_factor (struct type *type)
11672 const char *encoding = fixed_type_info (type);
11673 struct type *scale_type = ada_scaling_type (type);
11675 long long num0, den0, num1, den1;
11678 n = sscanf (encoding, "_%lld_%lld_%lld_%lld",
11679 &num0, &den0, &num1, &den1);
11682 return value_from_longest (scale_type, 1);
11684 return value_binop (value_from_longest (scale_type, num1),
11685 value_from_longest (scale_type, den1), BINOP_DIV);
11687 return value_binop (value_from_longest (scale_type, num0),
11688 value_from_longest (scale_type, den0), BINOP_DIV);
11695 /* Scan STR beginning at position K for a discriminant name, and
11696 return the value of that discriminant field of DVAL in *PX. If
11697 PNEW_K is not null, put the position of the character beyond the
11698 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11699 not alter *PX and *PNEW_K if unsuccessful. */
11702 scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px,
11705 static char *bound_buffer = NULL;
11706 static size_t bound_buffer_len = 0;
11707 const char *pstart, *pend, *bound;
11708 struct value *bound_val;
11710 if (dval == NULL || str == NULL || str[k] == '\0')
11714 pend = strstr (pstart, "__");
11718 k += strlen (bound);
11722 int len = pend - pstart;
11724 /* Strip __ and beyond. */
11725 GROW_VECT (bound_buffer, bound_buffer_len, len + 1);
11726 strncpy (bound_buffer, pstart, len);
11727 bound_buffer[len] = '\0';
11729 bound = bound_buffer;
11733 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
11734 if (bound_val == NULL)
11737 *px = value_as_long (bound_val);
11738 if (pnew_k != NULL)
11743 /* Value of variable named NAME in the current environment. If
11744 no such variable found, then if ERR_MSG is null, returns 0, and
11745 otherwise causes an error with message ERR_MSG. */
11747 static struct value *
11748 get_var_value (const char *name, const char *err_msg)
11750 lookup_name_info lookup_name (name, symbol_name_match_type::FULL);
11752 std::vector<struct block_symbol> syms;
11753 int nsyms = ada_lookup_symbol_list_worker (lookup_name,
11754 get_selected_block (0),
11755 VAR_DOMAIN, &syms, 1);
11759 if (err_msg == NULL)
11762 error (("%s"), err_msg);
11765 return value_of_variable (syms[0].symbol, syms[0].block);
11768 /* Value of integer variable named NAME in the current environment.
11769 If no such variable is found, returns false. Otherwise, sets VALUE
11770 to the variable's value and returns true. */
11773 get_int_var_value (const char *name, LONGEST &value)
11775 struct value *var_val = get_var_value (name, 0);
11780 value = value_as_long (var_val);
11785 /* Return a range type whose base type is that of the range type named
11786 NAME in the current environment, and whose bounds are calculated
11787 from NAME according to the GNAT range encoding conventions.
11788 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11789 corresponding range type from debug information; fall back to using it
11790 if symbol lookup fails. If a new type must be created, allocate it
11791 like ORIG_TYPE was. The bounds information, in general, is encoded
11792 in NAME, the base type given in the named range type. */
11794 static struct type *
11795 to_fixed_range_type (struct type *raw_type, struct value *dval)
11798 struct type *base_type;
11799 const char *subtype_info;
11801 gdb_assert (raw_type != NULL);
11802 gdb_assert (TYPE_NAME (raw_type) != NULL);
11804 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
11805 base_type = TYPE_TARGET_TYPE (raw_type);
11807 base_type = raw_type;
11809 name = TYPE_NAME (raw_type);
11810 subtype_info = strstr (name, "___XD");
11811 if (subtype_info == NULL)
11813 LONGEST L = ada_discrete_type_low_bound (raw_type);
11814 LONGEST U = ada_discrete_type_high_bound (raw_type);
11816 if (L < INT_MIN || U > INT_MAX)
11819 return create_static_range_type (alloc_type_copy (raw_type), raw_type,
11824 static char *name_buf = NULL;
11825 static size_t name_len = 0;
11826 int prefix_len = subtype_info - name;
11829 const char *bounds_str;
11832 GROW_VECT (name_buf, name_len, prefix_len + 5);
11833 strncpy (name_buf, name, prefix_len);
11834 name_buf[prefix_len] = '\0';
11837 bounds_str = strchr (subtype_info, '_');
11840 if (*subtype_info == 'L')
11842 if (!ada_scan_number (bounds_str, n, &L, &n)
11843 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
11845 if (bounds_str[n] == '_')
11847 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
11853 strcpy (name_buf + prefix_len, "___L");
11854 if (!get_int_var_value (name_buf, L))
11856 lim_warning (_("Unknown lower bound, using 1."));
11861 if (*subtype_info == 'U')
11863 if (!ada_scan_number (bounds_str, n, &U, &n)
11864 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
11869 strcpy (name_buf + prefix_len, "___U");
11870 if (!get_int_var_value (name_buf, U))
11872 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
11877 type = create_static_range_type (alloc_type_copy (raw_type),
11879 /* create_static_range_type alters the resulting type's length
11880 to match the size of the base_type, which is not what we want.
11881 Set it back to the original range type's length. */
11882 TYPE_LENGTH (type) = TYPE_LENGTH (raw_type);
11883 TYPE_NAME (type) = name;
11888 /* True iff NAME is the name of a range type. */
11891 ada_is_range_type_name (const char *name)
11893 return (name != NULL && strstr (name, "___XD"));
11897 /* Modular types */
11899 /* True iff TYPE is an Ada modular type. */
11902 ada_is_modular_type (struct type *type)
11904 struct type *subranged_type = get_base_type (type);
11906 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
11907 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
11908 && TYPE_UNSIGNED (subranged_type));
11911 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11914 ada_modulus (struct type *type)
11916 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
11920 /* Ada exception catchpoint support:
11921 ---------------------------------
11923 We support 3 kinds of exception catchpoints:
11924 . catchpoints on Ada exceptions
11925 . catchpoints on unhandled Ada exceptions
11926 . catchpoints on failed assertions
11928 Exceptions raised during failed assertions, or unhandled exceptions
11929 could perfectly be caught with the general catchpoint on Ada exceptions.
11930 However, we can easily differentiate these two special cases, and having
11931 the option to distinguish these two cases from the rest can be useful
11932 to zero-in on certain situations.
11934 Exception catchpoints are a specialized form of breakpoint,
11935 since they rely on inserting breakpoints inside known routines
11936 of the GNAT runtime. The implementation therefore uses a standard
11937 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11940 Support in the runtime for exception catchpoints have been changed
11941 a few times already, and these changes affect the implementation
11942 of these catchpoints. In order to be able to support several
11943 variants of the runtime, we use a sniffer that will determine
11944 the runtime variant used by the program being debugged. */
11946 /* Ada's standard exceptions.
11948 The Ada 83 standard also defined Numeric_Error. But there so many
11949 situations where it was unclear from the Ada 83 Reference Manual
11950 (RM) whether Constraint_Error or Numeric_Error should be raised,
11951 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11952 Interpretation saying that anytime the RM says that Numeric_Error
11953 should be raised, the implementation may raise Constraint_Error.
11954 Ada 95 went one step further and pretty much removed Numeric_Error
11955 from the list of standard exceptions (it made it a renaming of
11956 Constraint_Error, to help preserve compatibility when compiling
11957 an Ada83 compiler). As such, we do not include Numeric_Error from
11958 this list of standard exceptions. */
11960 static const char *standard_exc[] = {
11961 "constraint_error",
11967 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
11969 /* A structure that describes how to support exception catchpoints
11970 for a given executable. */
11972 struct exception_support_info
11974 /* The name of the symbol to break on in order to insert
11975 a catchpoint on exceptions. */
11976 const char *catch_exception_sym;
11978 /* The name of the symbol to break on in order to insert
11979 a catchpoint on unhandled exceptions. */
11980 const char *catch_exception_unhandled_sym;
11982 /* The name of the symbol to break on in order to insert
11983 a catchpoint on failed assertions. */
11984 const char *catch_assert_sym;
11986 /* The name of the symbol to break on in order to insert
11987 a catchpoint on exception handling. */
11988 const char *catch_handlers_sym;
11990 /* Assuming that the inferior just triggered an unhandled exception
11991 catchpoint, this function is responsible for returning the address
11992 in inferior memory where the name of that exception is stored.
11993 Return zero if the address could not be computed. */
11994 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
11997 static CORE_ADDR ada_unhandled_exception_name_addr (void);
11998 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
12000 /* The following exception support info structure describes how to
12001 implement exception catchpoints with the latest version of the
12002 Ada runtime (as of 2007-03-06). */
12004 static const struct exception_support_info default_exception_support_info =
12006 "__gnat_debug_raise_exception", /* catch_exception_sym */
12007 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12008 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
12009 "__gnat_begin_handler", /* catch_handlers_sym */
12010 ada_unhandled_exception_name_addr
12013 /* The following exception support info structure describes how to
12014 implement exception catchpoints with a slightly older version
12015 of the Ada runtime. */
12017 static const struct exception_support_info exception_support_info_fallback =
12019 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
12020 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12021 "system__assertions__raise_assert_failure", /* catch_assert_sym */
12022 "__gnat_begin_handler", /* catch_handlers_sym */
12023 ada_unhandled_exception_name_addr_from_raise
12026 /* Return nonzero if we can detect the exception support routines
12027 described in EINFO.
12029 This function errors out if an abnormal situation is detected
12030 (for instance, if we find the exception support routines, but
12031 that support is found to be incomplete). */
12034 ada_has_this_exception_support (const struct exception_support_info *einfo)
12036 struct symbol *sym;
12038 /* The symbol we're looking up is provided by a unit in the GNAT runtime
12039 that should be compiled with debugging information. As a result, we
12040 expect to find that symbol in the symtabs. */
12042 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
12045 /* Perhaps we did not find our symbol because the Ada runtime was
12046 compiled without debugging info, or simply stripped of it.
12047 It happens on some GNU/Linux distributions for instance, where
12048 users have to install a separate debug package in order to get
12049 the runtime's debugging info. In that situation, let the user
12050 know why we cannot insert an Ada exception catchpoint.
12052 Note: Just for the purpose of inserting our Ada exception
12053 catchpoint, we could rely purely on the associated minimal symbol.
12054 But we would be operating in degraded mode anyway, since we are
12055 still lacking the debugging info needed later on to extract
12056 the name of the exception being raised (this name is printed in
12057 the catchpoint message, and is also used when trying to catch
12058 a specific exception). We do not handle this case for now. */
12059 struct bound_minimal_symbol msym
12060 = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL);
12062 if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline)
12063 error (_("Your Ada runtime appears to be missing some debugging "
12064 "information.\nCannot insert Ada exception catchpoint "
12065 "in this configuration."));
12070 /* Make sure that the symbol we found corresponds to a function. */
12072 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
12073 error (_("Symbol \"%s\" is not a function (class = %d)"),
12074 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
12079 /* Inspect the Ada runtime and determine which exception info structure
12080 should be used to provide support for exception catchpoints.
12082 This function will always set the per-inferior exception_info,
12083 or raise an error. */
12086 ada_exception_support_info_sniffer (void)
12088 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12090 /* If the exception info is already known, then no need to recompute it. */
12091 if (data->exception_info != NULL)
12094 /* Check the latest (default) exception support info. */
12095 if (ada_has_this_exception_support (&default_exception_support_info))
12097 data->exception_info = &default_exception_support_info;
12101 /* Try our fallback exception suport info. */
12102 if (ada_has_this_exception_support (&exception_support_info_fallback))
12104 data->exception_info = &exception_support_info_fallback;
12108 /* Sometimes, it is normal for us to not be able to find the routine
12109 we are looking for. This happens when the program is linked with
12110 the shared version of the GNAT runtime, and the program has not been
12111 started yet. Inform the user of these two possible causes if
12114 if (ada_update_initial_language (language_unknown) != language_ada)
12115 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
12117 /* If the symbol does not exist, then check that the program is
12118 already started, to make sure that shared libraries have been
12119 loaded. If it is not started, this may mean that the symbol is
12120 in a shared library. */
12122 if (inferior_ptid.pid () == 0)
12123 error (_("Unable to insert catchpoint. Try to start the program first."));
12125 /* At this point, we know that we are debugging an Ada program and
12126 that the inferior has been started, but we still are not able to
12127 find the run-time symbols. That can mean that we are in
12128 configurable run time mode, or that a-except as been optimized
12129 out by the linker... In any case, at this point it is not worth
12130 supporting this feature. */
12132 error (_("Cannot insert Ada exception catchpoints in this configuration."));
12135 /* True iff FRAME is very likely to be that of a function that is
12136 part of the runtime system. This is all very heuristic, but is
12137 intended to be used as advice as to what frames are uninteresting
12141 is_known_support_routine (struct frame_info *frame)
12143 enum language func_lang;
12145 const char *fullname;
12147 /* If this code does not have any debugging information (no symtab),
12148 This cannot be any user code. */
12150 symtab_and_line sal = find_frame_sal (frame);
12151 if (sal.symtab == NULL)
12154 /* If there is a symtab, but the associated source file cannot be
12155 located, then assume this is not user code: Selecting a frame
12156 for which we cannot display the code would not be very helpful
12157 for the user. This should also take care of case such as VxWorks
12158 where the kernel has some debugging info provided for a few units. */
12160 fullname = symtab_to_fullname (sal.symtab);
12161 if (access (fullname, R_OK) != 0)
12164 /* Check the unit filename againt the Ada runtime file naming.
12165 We also check the name of the objfile against the name of some
12166 known system libraries that sometimes come with debugging info
12169 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
12171 re_comp (known_runtime_file_name_patterns[i]);
12172 if (re_exec (lbasename (sal.symtab->filename)))
12174 if (SYMTAB_OBJFILE (sal.symtab) != NULL
12175 && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab))))
12179 /* Check whether the function is a GNAT-generated entity. */
12181 gdb::unique_xmalloc_ptr<char> func_name
12182 = find_frame_funname (frame, &func_lang, NULL);
12183 if (func_name == NULL)
12186 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
12188 re_comp (known_auxiliary_function_name_patterns[i]);
12189 if (re_exec (func_name.get ()))
12196 /* Find the first frame that contains debugging information and that is not
12197 part of the Ada run-time, starting from FI and moving upward. */
12200 ada_find_printable_frame (struct frame_info *fi)
12202 for (; fi != NULL; fi = get_prev_frame (fi))
12204 if (!is_known_support_routine (fi))
12213 /* Assuming that the inferior just triggered an unhandled exception
12214 catchpoint, return the address in inferior memory where the name
12215 of the exception is stored.
12217 Return zero if the address could not be computed. */
12220 ada_unhandled_exception_name_addr (void)
12222 return parse_and_eval_address ("e.full_name");
12225 /* Same as ada_unhandled_exception_name_addr, except that this function
12226 should be used when the inferior uses an older version of the runtime,
12227 where the exception name needs to be extracted from a specific frame
12228 several frames up in the callstack. */
12231 ada_unhandled_exception_name_addr_from_raise (void)
12234 struct frame_info *fi;
12235 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12237 /* To determine the name of this exception, we need to select
12238 the frame corresponding to RAISE_SYM_NAME. This frame is
12239 at least 3 levels up, so we simply skip the first 3 frames
12240 without checking the name of their associated function. */
12241 fi = get_current_frame ();
12242 for (frame_level = 0; frame_level < 3; frame_level += 1)
12244 fi = get_prev_frame (fi);
12248 enum language func_lang;
12250 gdb::unique_xmalloc_ptr<char> func_name
12251 = find_frame_funname (fi, &func_lang, NULL);
12252 if (func_name != NULL)
12254 if (strcmp (func_name.get (),
12255 data->exception_info->catch_exception_sym) == 0)
12256 break; /* We found the frame we were looking for... */
12258 fi = get_prev_frame (fi);
12265 return parse_and_eval_address ("id.full_name");
12268 /* Assuming the inferior just triggered an Ada exception catchpoint
12269 (of any type), return the address in inferior memory where the name
12270 of the exception is stored, if applicable.
12272 Assumes the selected frame is the current frame.
12274 Return zero if the address could not be computed, or if not relevant. */
12277 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex,
12278 struct breakpoint *b)
12280 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12284 case ada_catch_exception:
12285 return (parse_and_eval_address ("e.full_name"));
12288 case ada_catch_exception_unhandled:
12289 return data->exception_info->unhandled_exception_name_addr ();
12292 case ada_catch_handlers:
12293 return 0; /* The runtimes does not provide access to the exception
12297 case ada_catch_assert:
12298 return 0; /* Exception name is not relevant in this case. */
12302 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12306 return 0; /* Should never be reached. */
12309 /* Assuming the inferior is stopped at an exception catchpoint,
12310 return the message which was associated to the exception, if
12311 available. Return NULL if the message could not be retrieved.
12313 Note: The exception message can be associated to an exception
12314 either through the use of the Raise_Exception function, or
12315 more simply (Ada 2005 and later), via:
12317 raise Exception_Name with "exception message";
12321 static gdb::unique_xmalloc_ptr<char>
12322 ada_exception_message_1 (void)
12324 struct value *e_msg_val;
12327 /* For runtimes that support this feature, the exception message
12328 is passed as an unbounded string argument called "message". */
12329 e_msg_val = parse_and_eval ("message");
12330 if (e_msg_val == NULL)
12331 return NULL; /* Exception message not supported. */
12333 e_msg_val = ada_coerce_to_simple_array (e_msg_val);
12334 gdb_assert (e_msg_val != NULL);
12335 e_msg_len = TYPE_LENGTH (value_type (e_msg_val));
12337 /* If the message string is empty, then treat it as if there was
12338 no exception message. */
12339 if (e_msg_len <= 0)
12342 gdb::unique_xmalloc_ptr<char> e_msg ((char *) xmalloc (e_msg_len + 1));
12343 read_memory_string (value_address (e_msg_val), e_msg.get (), e_msg_len + 1);
12344 e_msg.get ()[e_msg_len] = '\0';
12349 /* Same as ada_exception_message_1, except that all exceptions are
12350 contained here (returning NULL instead). */
12352 static gdb::unique_xmalloc_ptr<char>
12353 ada_exception_message (void)
12355 gdb::unique_xmalloc_ptr<char> e_msg;
12359 e_msg = ada_exception_message_1 ();
12361 CATCH (e, RETURN_MASK_ERROR)
12363 e_msg.reset (nullptr);
12370 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12371 any error that ada_exception_name_addr_1 might cause to be thrown.
12372 When an error is intercepted, a warning with the error message is printed,
12373 and zero is returned. */
12376 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex,
12377 struct breakpoint *b)
12379 CORE_ADDR result = 0;
12383 result = ada_exception_name_addr_1 (ex, b);
12386 CATCH (e, RETURN_MASK_ERROR)
12388 warning (_("failed to get exception name: %s"), e.message);
12396 static std::string ada_exception_catchpoint_cond_string
12397 (const char *excep_string,
12398 enum ada_exception_catchpoint_kind ex);
12400 /* Ada catchpoints.
12402 In the case of catchpoints on Ada exceptions, the catchpoint will
12403 stop the target on every exception the program throws. When a user
12404 specifies the name of a specific exception, we translate this
12405 request into a condition expression (in text form), and then parse
12406 it into an expression stored in each of the catchpoint's locations.
12407 We then use this condition to check whether the exception that was
12408 raised is the one the user is interested in. If not, then the
12409 target is resumed again. We store the name of the requested
12410 exception, in order to be able to re-set the condition expression
12411 when symbols change. */
12413 /* An instance of this type is used to represent an Ada catchpoint
12414 breakpoint location. */
12416 class ada_catchpoint_location : public bp_location
12419 ada_catchpoint_location (const bp_location_ops *ops, breakpoint *owner)
12420 : bp_location (ops, owner)
12423 /* The condition that checks whether the exception that was raised
12424 is the specific exception the user specified on catchpoint
12426 expression_up excep_cond_expr;
12429 /* Implement the DTOR method in the bp_location_ops structure for all
12430 Ada exception catchpoint kinds. */
12433 ada_catchpoint_location_dtor (struct bp_location *bl)
12435 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
12437 al->excep_cond_expr.reset ();
12440 /* The vtable to be used in Ada catchpoint locations. */
12442 static const struct bp_location_ops ada_catchpoint_location_ops =
12444 ada_catchpoint_location_dtor
12447 /* An instance of this type is used to represent an Ada catchpoint. */
12449 struct ada_catchpoint : public breakpoint
12451 /* The name of the specific exception the user specified. */
12452 std::string excep_string;
12455 /* Parse the exception condition string in the context of each of the
12456 catchpoint's locations, and store them for later evaluation. */
12459 create_excep_cond_exprs (struct ada_catchpoint *c,
12460 enum ada_exception_catchpoint_kind ex)
12462 struct bp_location *bl;
12464 /* Nothing to do if there's no specific exception to catch. */
12465 if (c->excep_string.empty ())
12468 /* Same if there are no locations... */
12469 if (c->loc == NULL)
12472 /* Compute the condition expression in text form, from the specific
12473 expection we want to catch. */
12474 std::string cond_string
12475 = ada_exception_catchpoint_cond_string (c->excep_string.c_str (), ex);
12477 /* Iterate over all the catchpoint's locations, and parse an
12478 expression for each. */
12479 for (bl = c->loc; bl != NULL; bl = bl->next)
12481 struct ada_catchpoint_location *ada_loc
12482 = (struct ada_catchpoint_location *) bl;
12485 if (!bl->shlib_disabled)
12489 s = cond_string.c_str ();
12492 exp = parse_exp_1 (&s, bl->address,
12493 block_for_pc (bl->address),
12496 CATCH (e, RETURN_MASK_ERROR)
12498 warning (_("failed to reevaluate internal exception condition "
12499 "for catchpoint %d: %s"),
12500 c->number, e.message);
12505 ada_loc->excep_cond_expr = std::move (exp);
12509 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12510 structure for all exception catchpoint kinds. */
12512 static struct bp_location *
12513 allocate_location_exception (enum ada_exception_catchpoint_kind ex,
12514 struct breakpoint *self)
12516 return new ada_catchpoint_location (&ada_catchpoint_location_ops, self);
12519 /* Implement the RE_SET method in the breakpoint_ops structure for all
12520 exception catchpoint kinds. */
12523 re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
12525 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12527 /* Call the base class's method. This updates the catchpoint's
12529 bkpt_breakpoint_ops.re_set (b);
12531 /* Reparse the exception conditional expressions. One for each
12533 create_excep_cond_exprs (c, ex);
12536 /* Returns true if we should stop for this breakpoint hit. If the
12537 user specified a specific exception, we only want to cause a stop
12538 if the program thrown that exception. */
12541 should_stop_exception (const struct bp_location *bl)
12543 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
12544 const struct ada_catchpoint_location *ada_loc
12545 = (const struct ada_catchpoint_location *) bl;
12548 /* With no specific exception, should always stop. */
12549 if (c->excep_string.empty ())
12552 if (ada_loc->excep_cond_expr == NULL)
12554 /* We will have a NULL expression if back when we were creating
12555 the expressions, this location's had failed to parse. */
12562 struct value *mark;
12564 mark = value_mark ();
12565 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr.get ()));
12566 value_free_to_mark (mark);
12568 CATCH (ex, RETURN_MASK_ALL)
12570 exception_fprintf (gdb_stderr, ex,
12571 _("Error in testing exception condition:\n"));
12578 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12579 for all exception catchpoint kinds. */
12582 check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
12584 bs->stop = should_stop_exception (bs->bp_location_at);
12587 /* Implement the PRINT_IT method in the breakpoint_ops structure
12588 for all exception catchpoint kinds. */
12590 static enum print_stop_action
12591 print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
12593 struct ui_out *uiout = current_uiout;
12594 struct breakpoint *b = bs->breakpoint_at;
12596 annotate_catchpoint (b->number);
12598 if (uiout->is_mi_like_p ())
12600 uiout->field_string ("reason",
12601 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
12602 uiout->field_string ("disp", bpdisp_text (b->disposition));
12605 uiout->text (b->disposition == disp_del
12606 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12607 uiout->field_int ("bkptno", b->number);
12608 uiout->text (", ");
12610 /* ada_exception_name_addr relies on the selected frame being the
12611 current frame. Need to do this here because this function may be
12612 called more than once when printing a stop, and below, we'll
12613 select the first frame past the Ada run-time (see
12614 ada_find_printable_frame). */
12615 select_frame (get_current_frame ());
12619 case ada_catch_exception:
12620 case ada_catch_exception_unhandled:
12621 case ada_catch_handlers:
12623 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
12624 char exception_name[256];
12628 read_memory (addr, (gdb_byte *) exception_name,
12629 sizeof (exception_name) - 1);
12630 exception_name [sizeof (exception_name) - 1] = '\0';
12634 /* For some reason, we were unable to read the exception
12635 name. This could happen if the Runtime was compiled
12636 without debugging info, for instance. In that case,
12637 just replace the exception name by the generic string
12638 "exception" - it will read as "an exception" in the
12639 notification we are about to print. */
12640 memcpy (exception_name, "exception", sizeof ("exception"));
12642 /* In the case of unhandled exception breakpoints, we print
12643 the exception name as "unhandled EXCEPTION_NAME", to make
12644 it clearer to the user which kind of catchpoint just got
12645 hit. We used ui_out_text to make sure that this extra
12646 info does not pollute the exception name in the MI case. */
12647 if (ex == ada_catch_exception_unhandled)
12648 uiout->text ("unhandled ");
12649 uiout->field_string ("exception-name", exception_name);
12652 case ada_catch_assert:
12653 /* In this case, the name of the exception is not really
12654 important. Just print "failed assertion" to make it clearer
12655 that his program just hit an assertion-failure catchpoint.
12656 We used ui_out_text because this info does not belong in
12658 uiout->text ("failed assertion");
12662 gdb::unique_xmalloc_ptr<char> exception_message = ada_exception_message ();
12663 if (exception_message != NULL)
12665 uiout->text (" (");
12666 uiout->field_string ("exception-message", exception_message.get ());
12670 uiout->text (" at ");
12671 ada_find_printable_frame (get_current_frame ());
12673 return PRINT_SRC_AND_LOC;
12676 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12677 for all exception catchpoint kinds. */
12680 print_one_exception (enum ada_exception_catchpoint_kind ex,
12681 struct breakpoint *b, struct bp_location **last_loc)
12683 struct ui_out *uiout = current_uiout;
12684 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12685 struct value_print_options opts;
12687 get_user_print_options (&opts);
12688 if (opts.addressprint)
12690 annotate_field (4);
12691 uiout->field_core_addr ("addr", b->loc->gdbarch, b->loc->address);
12694 annotate_field (5);
12695 *last_loc = b->loc;
12698 case ada_catch_exception:
12699 if (!c->excep_string.empty ())
12701 std::string msg = string_printf (_("`%s' Ada exception"),
12702 c->excep_string.c_str ());
12704 uiout->field_string ("what", msg);
12707 uiout->field_string ("what", "all Ada exceptions");
12711 case ada_catch_exception_unhandled:
12712 uiout->field_string ("what", "unhandled Ada exceptions");
12715 case ada_catch_handlers:
12716 if (!c->excep_string.empty ())
12718 uiout->field_fmt ("what",
12719 _("`%s' Ada exception handlers"),
12720 c->excep_string.c_str ());
12723 uiout->field_string ("what", "all Ada exceptions handlers");
12726 case ada_catch_assert:
12727 uiout->field_string ("what", "failed Ada assertions");
12731 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12736 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12737 for all exception catchpoint kinds. */
12740 print_mention_exception (enum ada_exception_catchpoint_kind ex,
12741 struct breakpoint *b)
12743 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12744 struct ui_out *uiout = current_uiout;
12746 uiout->text (b->disposition == disp_del ? _("Temporary catchpoint ")
12747 : _("Catchpoint "));
12748 uiout->field_int ("bkptno", b->number);
12749 uiout->text (": ");
12753 case ada_catch_exception:
12754 if (!c->excep_string.empty ())
12756 std::string info = string_printf (_("`%s' Ada exception"),
12757 c->excep_string.c_str ());
12758 uiout->text (info.c_str ());
12761 uiout->text (_("all Ada exceptions"));
12764 case ada_catch_exception_unhandled:
12765 uiout->text (_("unhandled Ada exceptions"));
12768 case ada_catch_handlers:
12769 if (!c->excep_string.empty ())
12772 = string_printf (_("`%s' Ada exception handlers"),
12773 c->excep_string.c_str ());
12774 uiout->text (info.c_str ());
12777 uiout->text (_("all Ada exceptions handlers"));
12780 case ada_catch_assert:
12781 uiout->text (_("failed Ada assertions"));
12785 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12790 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12791 for all exception catchpoint kinds. */
12794 print_recreate_exception (enum ada_exception_catchpoint_kind ex,
12795 struct breakpoint *b, struct ui_file *fp)
12797 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12801 case ada_catch_exception:
12802 fprintf_filtered (fp, "catch exception");
12803 if (!c->excep_string.empty ())
12804 fprintf_filtered (fp, " %s", c->excep_string.c_str ());
12807 case ada_catch_exception_unhandled:
12808 fprintf_filtered (fp, "catch exception unhandled");
12811 case ada_catch_handlers:
12812 fprintf_filtered (fp, "catch handlers");
12815 case ada_catch_assert:
12816 fprintf_filtered (fp, "catch assert");
12820 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12822 print_recreate_thread (b, fp);
12825 /* Virtual table for "catch exception" breakpoints. */
12827 static struct bp_location *
12828 allocate_location_catch_exception (struct breakpoint *self)
12830 return allocate_location_exception (ada_catch_exception, self);
12834 re_set_catch_exception (struct breakpoint *b)
12836 re_set_exception (ada_catch_exception, b);
12840 check_status_catch_exception (bpstat bs)
12842 check_status_exception (ada_catch_exception, bs);
12845 static enum print_stop_action
12846 print_it_catch_exception (bpstat bs)
12848 return print_it_exception (ada_catch_exception, bs);
12852 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
12854 print_one_exception (ada_catch_exception, b, last_loc);
12858 print_mention_catch_exception (struct breakpoint *b)
12860 print_mention_exception (ada_catch_exception, b);
12864 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
12866 print_recreate_exception (ada_catch_exception, b, fp);
12869 static struct breakpoint_ops catch_exception_breakpoint_ops;
12871 /* Virtual table for "catch exception unhandled" breakpoints. */
12873 static struct bp_location *
12874 allocate_location_catch_exception_unhandled (struct breakpoint *self)
12876 return allocate_location_exception (ada_catch_exception_unhandled, self);
12880 re_set_catch_exception_unhandled (struct breakpoint *b)
12882 re_set_exception (ada_catch_exception_unhandled, b);
12886 check_status_catch_exception_unhandled (bpstat bs)
12888 check_status_exception (ada_catch_exception_unhandled, bs);
12891 static enum print_stop_action
12892 print_it_catch_exception_unhandled (bpstat bs)
12894 return print_it_exception (ada_catch_exception_unhandled, bs);
12898 print_one_catch_exception_unhandled (struct breakpoint *b,
12899 struct bp_location **last_loc)
12901 print_one_exception (ada_catch_exception_unhandled, b, last_loc);
12905 print_mention_catch_exception_unhandled (struct breakpoint *b)
12907 print_mention_exception (ada_catch_exception_unhandled, b);
12911 print_recreate_catch_exception_unhandled (struct breakpoint *b,
12912 struct ui_file *fp)
12914 print_recreate_exception (ada_catch_exception_unhandled, b, fp);
12917 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
12919 /* Virtual table for "catch assert" breakpoints. */
12921 static struct bp_location *
12922 allocate_location_catch_assert (struct breakpoint *self)
12924 return allocate_location_exception (ada_catch_assert, self);
12928 re_set_catch_assert (struct breakpoint *b)
12930 re_set_exception (ada_catch_assert, b);
12934 check_status_catch_assert (bpstat bs)
12936 check_status_exception (ada_catch_assert, bs);
12939 static enum print_stop_action
12940 print_it_catch_assert (bpstat bs)
12942 return print_it_exception (ada_catch_assert, bs);
12946 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
12948 print_one_exception (ada_catch_assert, b, last_loc);
12952 print_mention_catch_assert (struct breakpoint *b)
12954 print_mention_exception (ada_catch_assert, b);
12958 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
12960 print_recreate_exception (ada_catch_assert, b, fp);
12963 static struct breakpoint_ops catch_assert_breakpoint_ops;
12965 /* Virtual table for "catch handlers" breakpoints. */
12967 static struct bp_location *
12968 allocate_location_catch_handlers (struct breakpoint *self)
12970 return allocate_location_exception (ada_catch_handlers, self);
12974 re_set_catch_handlers (struct breakpoint *b)
12976 re_set_exception (ada_catch_handlers, b);
12980 check_status_catch_handlers (bpstat bs)
12982 check_status_exception (ada_catch_handlers, bs);
12985 static enum print_stop_action
12986 print_it_catch_handlers (bpstat bs)
12988 return print_it_exception (ada_catch_handlers, bs);
12992 print_one_catch_handlers (struct breakpoint *b,
12993 struct bp_location **last_loc)
12995 print_one_exception (ada_catch_handlers, b, last_loc);
12999 print_mention_catch_handlers (struct breakpoint *b)
13001 print_mention_exception (ada_catch_handlers, b);
13005 print_recreate_catch_handlers (struct breakpoint *b,
13006 struct ui_file *fp)
13008 print_recreate_exception (ada_catch_handlers, b, fp);
13011 static struct breakpoint_ops catch_handlers_breakpoint_ops;
13013 /* Split the arguments specified in a "catch exception" command.
13014 Set EX to the appropriate catchpoint type.
13015 Set EXCEP_STRING to the name of the specific exception if
13016 specified by the user.
13017 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
13018 "catch handlers" command. False otherwise.
13019 If a condition is found at the end of the arguments, the condition
13020 expression is stored in COND_STRING (memory must be deallocated
13021 after use). Otherwise COND_STRING is set to NULL. */
13024 catch_ada_exception_command_split (const char *args,
13025 bool is_catch_handlers_cmd,
13026 enum ada_exception_catchpoint_kind *ex,
13027 std::string *excep_string,
13028 std::string *cond_string)
13030 std::string exception_name;
13032 exception_name = extract_arg (&args);
13033 if (exception_name == "if")
13035 /* This is not an exception name; this is the start of a condition
13036 expression for a catchpoint on all exceptions. So, "un-get"
13037 this token, and set exception_name to NULL. */
13038 exception_name.clear ();
13042 /* Check to see if we have a condition. */
13044 args = skip_spaces (args);
13045 if (startswith (args, "if")
13046 && (isspace (args[2]) || args[2] == '\0'))
13049 args = skip_spaces (args);
13051 if (args[0] == '\0')
13052 error (_("Condition missing after `if' keyword"));
13053 *cond_string = args;
13055 args += strlen (args);
13058 /* Check that we do not have any more arguments. Anything else
13061 if (args[0] != '\0')
13062 error (_("Junk at end of expression"));
13064 if (is_catch_handlers_cmd)
13066 /* Catch handling of exceptions. */
13067 *ex = ada_catch_handlers;
13068 *excep_string = exception_name;
13070 else if (exception_name.empty ())
13072 /* Catch all exceptions. */
13073 *ex = ada_catch_exception;
13074 excep_string->clear ();
13076 else if (exception_name == "unhandled")
13078 /* Catch unhandled exceptions. */
13079 *ex = ada_catch_exception_unhandled;
13080 excep_string->clear ();
13084 /* Catch a specific exception. */
13085 *ex = ada_catch_exception;
13086 *excep_string = exception_name;
13090 /* Return the name of the symbol on which we should break in order to
13091 implement a catchpoint of the EX kind. */
13093 static const char *
13094 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex)
13096 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
13098 gdb_assert (data->exception_info != NULL);
13102 case ada_catch_exception:
13103 return (data->exception_info->catch_exception_sym);
13105 case ada_catch_exception_unhandled:
13106 return (data->exception_info->catch_exception_unhandled_sym);
13108 case ada_catch_assert:
13109 return (data->exception_info->catch_assert_sym);
13111 case ada_catch_handlers:
13112 return (data->exception_info->catch_handlers_sym);
13115 internal_error (__FILE__, __LINE__,
13116 _("unexpected catchpoint kind (%d)"), ex);
13120 /* Return the breakpoint ops "virtual table" used for catchpoints
13123 static const struct breakpoint_ops *
13124 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex)
13128 case ada_catch_exception:
13129 return (&catch_exception_breakpoint_ops);
13131 case ada_catch_exception_unhandled:
13132 return (&catch_exception_unhandled_breakpoint_ops);
13134 case ada_catch_assert:
13135 return (&catch_assert_breakpoint_ops);
13137 case ada_catch_handlers:
13138 return (&catch_handlers_breakpoint_ops);
13141 internal_error (__FILE__, __LINE__,
13142 _("unexpected catchpoint kind (%d)"), ex);
13146 /* Return the condition that will be used to match the current exception
13147 being raised with the exception that the user wants to catch. This
13148 assumes that this condition is used when the inferior just triggered
13149 an exception catchpoint.
13150 EX: the type of catchpoints used for catching Ada exceptions. */
13153 ada_exception_catchpoint_cond_string (const char *excep_string,
13154 enum ada_exception_catchpoint_kind ex)
13157 bool is_standard_exc = false;
13158 std::string result;
13160 if (ex == ada_catch_handlers)
13162 /* For exception handlers catchpoints, the condition string does
13163 not use the same parameter as for the other exceptions. */
13164 result = ("long_integer (GNAT_GCC_exception_Access"
13165 "(gcc_exception).all.occurrence.id)");
13168 result = "long_integer (e)";
13170 /* The standard exceptions are a special case. They are defined in
13171 runtime units that have been compiled without debugging info; if
13172 EXCEP_STRING is the not-fully-qualified name of a standard
13173 exception (e.g. "constraint_error") then, during the evaluation
13174 of the condition expression, the symbol lookup on this name would
13175 *not* return this standard exception. The catchpoint condition
13176 may then be set only on user-defined exceptions which have the
13177 same not-fully-qualified name (e.g. my_package.constraint_error).
13179 To avoid this unexcepted behavior, these standard exceptions are
13180 systematically prefixed by "standard". This means that "catch
13181 exception constraint_error" is rewritten into "catch exception
13182 standard.constraint_error".
13184 If an exception named contraint_error is defined in another package of
13185 the inferior program, then the only way to specify this exception as a
13186 breakpoint condition is to use its fully-qualified named:
13187 e.g. my_package.constraint_error. */
13189 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
13191 if (strcmp (standard_exc [i], excep_string) == 0)
13193 is_standard_exc = true;
13200 if (is_standard_exc)
13201 string_appendf (result, "long_integer (&standard.%s)", excep_string);
13203 string_appendf (result, "long_integer (&%s)", excep_string);
13208 /* Return the symtab_and_line that should be used to insert an exception
13209 catchpoint of the TYPE kind.
13211 ADDR_STRING returns the name of the function where the real
13212 breakpoint that implements the catchpoints is set, depending on the
13213 type of catchpoint we need to create. */
13215 static struct symtab_and_line
13216 ada_exception_sal (enum ada_exception_catchpoint_kind ex,
13217 const char **addr_string, const struct breakpoint_ops **ops)
13219 const char *sym_name;
13220 struct symbol *sym;
13222 /* First, find out which exception support info to use. */
13223 ada_exception_support_info_sniffer ();
13225 /* Then lookup the function on which we will break in order to catch
13226 the Ada exceptions requested by the user. */
13227 sym_name = ada_exception_sym_name (ex);
13228 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
13231 error (_("Catchpoint symbol not found: %s"), sym_name);
13233 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
13234 error (_("Unable to insert catchpoint. %s is not a function."), sym_name);
13236 /* Set ADDR_STRING. */
13237 *addr_string = xstrdup (sym_name);
13240 *ops = ada_exception_breakpoint_ops (ex);
13242 return find_function_start_sal (sym, 1);
13245 /* Create an Ada exception catchpoint.
13247 EX_KIND is the kind of exception catchpoint to be created.
13249 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
13250 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
13251 of the exception to which this catchpoint applies.
13253 COND_STRING, if not empty, is the catchpoint condition.
13255 TEMPFLAG, if nonzero, means that the underlying breakpoint
13256 should be temporary.
13258 FROM_TTY is the usual argument passed to all commands implementations. */
13261 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
13262 enum ada_exception_catchpoint_kind ex_kind,
13263 const std::string &excep_string,
13264 const std::string &cond_string,
13269 const char *addr_string = NULL;
13270 const struct breakpoint_ops *ops = NULL;
13271 struct symtab_and_line sal = ada_exception_sal (ex_kind, &addr_string, &ops);
13273 std::unique_ptr<ada_catchpoint> c (new ada_catchpoint ());
13274 init_ada_exception_breakpoint (c.get (), gdbarch, sal, addr_string,
13275 ops, tempflag, disabled, from_tty);
13276 c->excep_string = excep_string;
13277 create_excep_cond_exprs (c.get (), ex_kind);
13278 if (!cond_string.empty ())
13279 set_breakpoint_condition (c.get (), cond_string.c_str (), from_tty);
13280 install_breakpoint (0, std::move (c), 1);
13283 /* Implement the "catch exception" command. */
13286 catch_ada_exception_command (const char *arg_entry, int from_tty,
13287 struct cmd_list_element *command)
13289 const char *arg = arg_entry;
13290 struct gdbarch *gdbarch = get_current_arch ();
13292 enum ada_exception_catchpoint_kind ex_kind;
13293 std::string excep_string;
13294 std::string cond_string;
13296 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13300 catch_ada_exception_command_split (arg, false, &ex_kind, &excep_string,
13302 create_ada_exception_catchpoint (gdbarch, ex_kind,
13303 excep_string, cond_string,
13304 tempflag, 1 /* enabled */,
13308 /* Implement the "catch handlers" command. */
13311 catch_ada_handlers_command (const char *arg_entry, int from_tty,
13312 struct cmd_list_element *command)
13314 const char *arg = arg_entry;
13315 struct gdbarch *gdbarch = get_current_arch ();
13317 enum ada_exception_catchpoint_kind ex_kind;
13318 std::string excep_string;
13319 std::string cond_string;
13321 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13325 catch_ada_exception_command_split (arg, true, &ex_kind, &excep_string,
13327 create_ada_exception_catchpoint (gdbarch, ex_kind,
13328 excep_string, cond_string,
13329 tempflag, 1 /* enabled */,
13333 /* Split the arguments specified in a "catch assert" command.
13335 ARGS contains the command's arguments (or the empty string if
13336 no arguments were passed).
13338 If ARGS contains a condition, set COND_STRING to that condition
13339 (the memory needs to be deallocated after use). */
13342 catch_ada_assert_command_split (const char *args, std::string &cond_string)
13344 args = skip_spaces (args);
13346 /* Check whether a condition was provided. */
13347 if (startswith (args, "if")
13348 && (isspace (args[2]) || args[2] == '\0'))
13351 args = skip_spaces (args);
13352 if (args[0] == '\0')
13353 error (_("condition missing after `if' keyword"));
13354 cond_string.assign (args);
13357 /* Otherwise, there should be no other argument at the end of
13359 else if (args[0] != '\0')
13360 error (_("Junk at end of arguments."));
13363 /* Implement the "catch assert" command. */
13366 catch_assert_command (const char *arg_entry, int from_tty,
13367 struct cmd_list_element *command)
13369 const char *arg = arg_entry;
13370 struct gdbarch *gdbarch = get_current_arch ();
13372 std::string cond_string;
13374 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13378 catch_ada_assert_command_split (arg, cond_string);
13379 create_ada_exception_catchpoint (gdbarch, ada_catch_assert,
13381 tempflag, 1 /* enabled */,
13385 /* Return non-zero if the symbol SYM is an Ada exception object. */
13388 ada_is_exception_sym (struct symbol *sym)
13390 const char *type_name = TYPE_NAME (SYMBOL_TYPE (sym));
13392 return (SYMBOL_CLASS (sym) != LOC_TYPEDEF
13393 && SYMBOL_CLASS (sym) != LOC_BLOCK
13394 && SYMBOL_CLASS (sym) != LOC_CONST
13395 && SYMBOL_CLASS (sym) != LOC_UNRESOLVED
13396 && type_name != NULL && strcmp (type_name, "exception") == 0);
13399 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13400 Ada exception object. This matches all exceptions except the ones
13401 defined by the Ada language. */
13404 ada_is_non_standard_exception_sym (struct symbol *sym)
13408 if (!ada_is_exception_sym (sym))
13411 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13412 if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0)
13413 return 0; /* A standard exception. */
13415 /* Numeric_Error is also a standard exception, so exclude it.
13416 See the STANDARD_EXC description for more details as to why
13417 this exception is not listed in that array. */
13418 if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0)
13424 /* A helper function for std::sort, comparing two struct ada_exc_info
13427 The comparison is determined first by exception name, and then
13428 by exception address. */
13431 ada_exc_info::operator< (const ada_exc_info &other) const
13435 result = strcmp (name, other.name);
13438 if (result == 0 && addr < other.addr)
13444 ada_exc_info::operator== (const ada_exc_info &other) const
13446 return addr == other.addr && strcmp (name, other.name) == 0;
13449 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13450 routine, but keeping the first SKIP elements untouched.
13452 All duplicates are also removed. */
13455 sort_remove_dups_ada_exceptions_list (std::vector<ada_exc_info> *exceptions,
13458 std::sort (exceptions->begin () + skip, exceptions->end ());
13459 exceptions->erase (std::unique (exceptions->begin () + skip, exceptions->end ()),
13460 exceptions->end ());
13463 /* Add all exceptions defined by the Ada standard whose name match
13464 a regular expression.
13466 If PREG is not NULL, then this regexp_t object is used to
13467 perform the symbol name matching. Otherwise, no name-based
13468 filtering is performed.
13470 EXCEPTIONS is a vector of exceptions to which matching exceptions
13474 ada_add_standard_exceptions (compiled_regex *preg,
13475 std::vector<ada_exc_info> *exceptions)
13479 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13482 || preg->exec (standard_exc[i], 0, NULL, 0) == 0)
13484 struct bound_minimal_symbol msymbol
13485 = ada_lookup_simple_minsym (standard_exc[i]);
13487 if (msymbol.minsym != NULL)
13489 struct ada_exc_info info
13490 = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)};
13492 exceptions->push_back (info);
13498 /* Add all Ada exceptions defined locally and accessible from the given
13501 If PREG is not NULL, then this regexp_t object is used to
13502 perform the symbol name matching. Otherwise, no name-based
13503 filtering is performed.
13505 EXCEPTIONS is a vector of exceptions to which matching exceptions
13509 ada_add_exceptions_from_frame (compiled_regex *preg,
13510 struct frame_info *frame,
13511 std::vector<ada_exc_info> *exceptions)
13513 const struct block *block = get_frame_block (frame, 0);
13517 struct block_iterator iter;
13518 struct symbol *sym;
13520 ALL_BLOCK_SYMBOLS (block, iter, sym)
13522 switch (SYMBOL_CLASS (sym))
13529 if (ada_is_exception_sym (sym))
13531 struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym),
13532 SYMBOL_VALUE_ADDRESS (sym)};
13534 exceptions->push_back (info);
13538 if (BLOCK_FUNCTION (block) != NULL)
13540 block = BLOCK_SUPERBLOCK (block);
13544 /* Return true if NAME matches PREG or if PREG is NULL. */
13547 name_matches_regex (const char *name, compiled_regex *preg)
13549 return (preg == NULL
13550 || preg->exec (ada_decode (name), 0, NULL, 0) == 0);
13553 /* Add all exceptions defined globally whose name name match
13554 a regular expression, excluding standard exceptions.
13556 The reason we exclude standard exceptions is that they need
13557 to be handled separately: Standard exceptions are defined inside
13558 a runtime unit which is normally not compiled with debugging info,
13559 and thus usually do not show up in our symbol search. However,
13560 if the unit was in fact built with debugging info, we need to
13561 exclude them because they would duplicate the entry we found
13562 during the special loop that specifically searches for those
13563 standard exceptions.
13565 If PREG is not NULL, then this regexp_t object is used to
13566 perform the symbol name matching. Otherwise, no name-based
13567 filtering is performed.
13569 EXCEPTIONS is a vector of exceptions to which matching exceptions
13573 ada_add_global_exceptions (compiled_regex *preg,
13574 std::vector<ada_exc_info> *exceptions)
13576 struct objfile *objfile;
13577 struct compunit_symtab *s;
13579 /* In Ada, the symbol "search name" is a linkage name, whereas the
13580 regular expression used to do the matching refers to the natural
13581 name. So match against the decoded name. */
13582 expand_symtabs_matching (NULL,
13583 lookup_name_info::match_any (),
13584 [&] (const char *search_name)
13586 const char *decoded = ada_decode (search_name);
13587 return name_matches_regex (decoded, preg);
13592 ALL_COMPUNITS (objfile, s)
13594 const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s);
13597 for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++)
13599 struct block *b = BLOCKVECTOR_BLOCK (bv, i);
13600 struct block_iterator iter;
13601 struct symbol *sym;
13603 ALL_BLOCK_SYMBOLS (b, iter, sym)
13604 if (ada_is_non_standard_exception_sym (sym)
13605 && name_matches_regex (SYMBOL_NATURAL_NAME (sym), preg))
13607 struct ada_exc_info info
13608 = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)};
13610 exceptions->push_back (info);
13616 /* Implements ada_exceptions_list with the regular expression passed
13617 as a regex_t, rather than a string.
13619 If not NULL, PREG is used to filter out exceptions whose names
13620 do not match. Otherwise, all exceptions are listed. */
13622 static std::vector<ada_exc_info>
13623 ada_exceptions_list_1 (compiled_regex *preg)
13625 std::vector<ada_exc_info> result;
13628 /* First, list the known standard exceptions. These exceptions
13629 need to be handled separately, as they are usually defined in
13630 runtime units that have been compiled without debugging info. */
13632 ada_add_standard_exceptions (preg, &result);
13634 /* Next, find all exceptions whose scope is local and accessible
13635 from the currently selected frame. */
13637 if (has_stack_frames ())
13639 prev_len = result.size ();
13640 ada_add_exceptions_from_frame (preg, get_selected_frame (NULL),
13642 if (result.size () > prev_len)
13643 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13646 /* Add all exceptions whose scope is global. */
13648 prev_len = result.size ();
13649 ada_add_global_exceptions (preg, &result);
13650 if (result.size () > prev_len)
13651 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13656 /* Return a vector of ada_exc_info.
13658 If REGEXP is NULL, all exceptions are included in the result.
13659 Otherwise, it should contain a valid regular expression,
13660 and only the exceptions whose names match that regular expression
13661 are included in the result.
13663 The exceptions are sorted in the following order:
13664 - Standard exceptions (defined by the Ada language), in
13665 alphabetical order;
13666 - Exceptions only visible from the current frame, in
13667 alphabetical order;
13668 - Exceptions whose scope is global, in alphabetical order. */
13670 std::vector<ada_exc_info>
13671 ada_exceptions_list (const char *regexp)
13673 if (regexp == NULL)
13674 return ada_exceptions_list_1 (NULL);
13676 compiled_regex reg (regexp, REG_NOSUB, _("invalid regular expression"));
13677 return ada_exceptions_list_1 (®);
13680 /* Implement the "info exceptions" command. */
13683 info_exceptions_command (const char *regexp, int from_tty)
13685 struct gdbarch *gdbarch = get_current_arch ();
13687 std::vector<ada_exc_info> exceptions = ada_exceptions_list (regexp);
13689 if (regexp != NULL)
13691 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp);
13693 printf_filtered (_("All defined Ada exceptions:\n"));
13695 for (const ada_exc_info &info : exceptions)
13696 printf_filtered ("%s: %s\n", info.name, paddress (gdbarch, info.addr));
13700 /* Information about operators given special treatment in functions
13702 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13704 #define ADA_OPERATORS \
13705 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13706 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13707 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13708 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13709 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13710 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13711 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13712 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13713 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13714 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13715 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13716 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13717 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13718 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13719 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13720 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13721 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13722 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13723 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13726 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
13729 switch (exp->elts[pc - 1].opcode)
13732 operator_length_standard (exp, pc, oplenp, argsp);
13735 #define OP_DEFN(op, len, args, binop) \
13736 case op: *oplenp = len; *argsp = args; break;
13742 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
13747 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
13752 /* Implementation of the exp_descriptor method operator_check. */
13755 ada_operator_check (struct expression *exp, int pos,
13756 int (*objfile_func) (struct objfile *objfile, void *data),
13759 const union exp_element *const elts = exp->elts;
13760 struct type *type = NULL;
13762 switch (elts[pos].opcode)
13764 case UNOP_IN_RANGE:
13766 type = elts[pos + 1].type;
13770 return operator_check_standard (exp, pos, objfile_func, data);
13773 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13775 if (type && TYPE_OBJFILE (type)
13776 && (*objfile_func) (TYPE_OBJFILE (type), data))
13782 static const char *
13783 ada_op_name (enum exp_opcode opcode)
13788 return op_name_standard (opcode);
13790 #define OP_DEFN(op, len, args, binop) case op: return #op;
13795 return "OP_AGGREGATE";
13797 return "OP_CHOICES";
13803 /* As for operator_length, but assumes PC is pointing at the first
13804 element of the operator, and gives meaningful results only for the
13805 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13808 ada_forward_operator_length (struct expression *exp, int pc,
13809 int *oplenp, int *argsp)
13811 switch (exp->elts[pc].opcode)
13814 *oplenp = *argsp = 0;
13817 #define OP_DEFN(op, len, args, binop) \
13818 case op: *oplenp = len; *argsp = args; break;
13824 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
13829 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
13835 int len = longest_to_int (exp->elts[pc + 1].longconst);
13837 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
13845 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
13847 enum exp_opcode op = exp->elts[elt].opcode;
13852 ada_forward_operator_length (exp, elt, &oplen, &nargs);
13856 /* Ada attributes ('Foo). */
13859 case OP_ATR_LENGTH:
13863 case OP_ATR_MODULUS:
13870 case UNOP_IN_RANGE:
13872 /* XXX: gdb_sprint_host_address, type_sprint */
13873 fprintf_filtered (stream, _("Type @"));
13874 gdb_print_host_address (exp->elts[pc + 1].type, stream);
13875 fprintf_filtered (stream, " (");
13876 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
13877 fprintf_filtered (stream, ")");
13879 case BINOP_IN_BOUNDS:
13880 fprintf_filtered (stream, " (%d)",
13881 longest_to_int (exp->elts[pc + 2].longconst));
13883 case TERNOP_IN_RANGE:
13888 case OP_DISCRETE_RANGE:
13889 case OP_POSITIONAL:
13896 char *name = &exp->elts[elt + 2].string;
13897 int len = longest_to_int (exp->elts[elt + 1].longconst);
13899 fprintf_filtered (stream, "Text: `%.*s'", len, name);
13904 return dump_subexp_body_standard (exp, stream, elt);
13908 for (i = 0; i < nargs; i += 1)
13909 elt = dump_subexp (exp, stream, elt);
13914 /* The Ada extension of print_subexp (q.v.). */
13917 ada_print_subexp (struct expression *exp, int *pos,
13918 struct ui_file *stream, enum precedence prec)
13920 int oplen, nargs, i;
13922 enum exp_opcode op = exp->elts[pc].opcode;
13924 ada_forward_operator_length (exp, pc, &oplen, &nargs);
13931 print_subexp_standard (exp, pos, stream, prec);
13935 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
13938 case BINOP_IN_BOUNDS:
13939 /* XXX: sprint_subexp */
13940 print_subexp (exp, pos, stream, PREC_SUFFIX);
13941 fputs_filtered (" in ", stream);
13942 print_subexp (exp, pos, stream, PREC_SUFFIX);
13943 fputs_filtered ("'range", stream);
13944 if (exp->elts[pc + 1].longconst > 1)
13945 fprintf_filtered (stream, "(%ld)",
13946 (long) exp->elts[pc + 1].longconst);
13949 case TERNOP_IN_RANGE:
13950 if (prec >= PREC_EQUAL)
13951 fputs_filtered ("(", stream);
13952 /* XXX: sprint_subexp */
13953 print_subexp (exp, pos, stream, PREC_SUFFIX);
13954 fputs_filtered (" in ", stream);
13955 print_subexp (exp, pos, stream, PREC_EQUAL);
13956 fputs_filtered (" .. ", stream);
13957 print_subexp (exp, pos, stream, PREC_EQUAL);
13958 if (prec >= PREC_EQUAL)
13959 fputs_filtered (")", stream);
13964 case OP_ATR_LENGTH:
13968 case OP_ATR_MODULUS:
13973 if (exp->elts[*pos].opcode == OP_TYPE)
13975 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
13976 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0,
13977 &type_print_raw_options);
13981 print_subexp (exp, pos, stream, PREC_SUFFIX);
13982 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
13987 for (tem = 1; tem < nargs; tem += 1)
13989 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
13990 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
13992 fputs_filtered (")", stream);
13997 type_print (exp->elts[pc + 1].type, "", stream, 0);
13998 fputs_filtered ("'(", stream);
13999 print_subexp (exp, pos, stream, PREC_PREFIX);
14000 fputs_filtered (")", stream);
14003 case UNOP_IN_RANGE:
14004 /* XXX: sprint_subexp */
14005 print_subexp (exp, pos, stream, PREC_SUFFIX);
14006 fputs_filtered (" in ", stream);
14007 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0,
14008 &type_print_raw_options);
14011 case OP_DISCRETE_RANGE:
14012 print_subexp (exp, pos, stream, PREC_SUFFIX);
14013 fputs_filtered ("..", stream);
14014 print_subexp (exp, pos, stream, PREC_SUFFIX);
14018 fputs_filtered ("others => ", stream);
14019 print_subexp (exp, pos, stream, PREC_SUFFIX);
14023 for (i = 0; i < nargs-1; i += 1)
14026 fputs_filtered ("|", stream);
14027 print_subexp (exp, pos, stream, PREC_SUFFIX);
14029 fputs_filtered (" => ", stream);
14030 print_subexp (exp, pos, stream, PREC_SUFFIX);
14033 case OP_POSITIONAL:
14034 print_subexp (exp, pos, stream, PREC_SUFFIX);
14038 fputs_filtered ("(", stream);
14039 for (i = 0; i < nargs; i += 1)
14042 fputs_filtered (", ", stream);
14043 print_subexp (exp, pos, stream, PREC_SUFFIX);
14045 fputs_filtered (")", stream);
14050 /* Table mapping opcodes into strings for printing operators
14051 and precedences of the operators. */
14053 static const struct op_print ada_op_print_tab[] = {
14054 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
14055 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
14056 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
14057 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
14058 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
14059 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
14060 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
14061 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
14062 {"<=", BINOP_LEQ, PREC_ORDER, 0},
14063 {">=", BINOP_GEQ, PREC_ORDER, 0},
14064 {">", BINOP_GTR, PREC_ORDER, 0},
14065 {"<", BINOP_LESS, PREC_ORDER, 0},
14066 {">>", BINOP_RSH, PREC_SHIFT, 0},
14067 {"<<", BINOP_LSH, PREC_SHIFT, 0},
14068 {"+", BINOP_ADD, PREC_ADD, 0},
14069 {"-", BINOP_SUB, PREC_ADD, 0},
14070 {"&", BINOP_CONCAT, PREC_ADD, 0},
14071 {"*", BINOP_MUL, PREC_MUL, 0},
14072 {"/", BINOP_DIV, PREC_MUL, 0},
14073 {"rem", BINOP_REM, PREC_MUL, 0},
14074 {"mod", BINOP_MOD, PREC_MUL, 0},
14075 {"**", BINOP_EXP, PREC_REPEAT, 0},
14076 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
14077 {"-", UNOP_NEG, PREC_PREFIX, 0},
14078 {"+", UNOP_PLUS, PREC_PREFIX, 0},
14079 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
14080 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
14081 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
14082 {".all", UNOP_IND, PREC_SUFFIX, 1},
14083 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
14084 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
14085 {NULL, OP_NULL, PREC_SUFFIX, 0}
14088 enum ada_primitive_types {
14089 ada_primitive_type_int,
14090 ada_primitive_type_long,
14091 ada_primitive_type_short,
14092 ada_primitive_type_char,
14093 ada_primitive_type_float,
14094 ada_primitive_type_double,
14095 ada_primitive_type_void,
14096 ada_primitive_type_long_long,
14097 ada_primitive_type_long_double,
14098 ada_primitive_type_natural,
14099 ada_primitive_type_positive,
14100 ada_primitive_type_system_address,
14101 ada_primitive_type_storage_offset,
14102 nr_ada_primitive_types
14106 ada_language_arch_info (struct gdbarch *gdbarch,
14107 struct language_arch_info *lai)
14109 const struct builtin_type *builtin = builtin_type (gdbarch);
14111 lai->primitive_type_vector
14112 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
14115 lai->primitive_type_vector [ada_primitive_type_int]
14116 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14118 lai->primitive_type_vector [ada_primitive_type_long]
14119 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
14120 0, "long_integer");
14121 lai->primitive_type_vector [ada_primitive_type_short]
14122 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
14123 0, "short_integer");
14124 lai->string_char_type
14125 = lai->primitive_type_vector [ada_primitive_type_char]
14126 = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
14127 lai->primitive_type_vector [ada_primitive_type_float]
14128 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
14129 "float", gdbarch_float_format (gdbarch));
14130 lai->primitive_type_vector [ada_primitive_type_double]
14131 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
14132 "long_float", gdbarch_double_format (gdbarch));
14133 lai->primitive_type_vector [ada_primitive_type_long_long]
14134 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
14135 0, "long_long_integer");
14136 lai->primitive_type_vector [ada_primitive_type_long_double]
14137 = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch),
14138 "long_long_float", gdbarch_long_double_format (gdbarch));
14139 lai->primitive_type_vector [ada_primitive_type_natural]
14140 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14142 lai->primitive_type_vector [ada_primitive_type_positive]
14143 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14145 lai->primitive_type_vector [ada_primitive_type_void]
14146 = builtin->builtin_void;
14148 lai->primitive_type_vector [ada_primitive_type_system_address]
14149 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT,
14151 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
14152 = "system__address";
14154 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
14155 type. This is a signed integral type whose size is the same as
14156 the size of addresses. */
14158 unsigned int addr_length = TYPE_LENGTH
14159 (lai->primitive_type_vector [ada_primitive_type_system_address]);
14161 lai->primitive_type_vector [ada_primitive_type_storage_offset]
14162 = arch_integer_type (gdbarch, addr_length * HOST_CHAR_BIT, 0,
14166 lai->bool_type_symbol = NULL;
14167 lai->bool_type_default = builtin->builtin_bool;
14170 /* Language vector */
14172 /* Not really used, but needed in the ada_language_defn. */
14175 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
14177 ada_emit_char (c, type, stream, quoter, 1);
14181 parse (struct parser_state *ps)
14183 warnings_issued = 0;
14184 return ada_parse (ps);
14187 static const struct exp_descriptor ada_exp_descriptor = {
14189 ada_operator_length,
14190 ada_operator_check,
14192 ada_dump_subexp_body,
14193 ada_evaluate_subexp
14196 /* symbol_name_matcher_ftype adapter for wild_match. */
14199 do_wild_match (const char *symbol_search_name,
14200 const lookup_name_info &lookup_name,
14201 completion_match_result *comp_match_res)
14203 return wild_match (symbol_search_name, ada_lookup_name (lookup_name));
14206 /* symbol_name_matcher_ftype adapter for full_match. */
14209 do_full_match (const char *symbol_search_name,
14210 const lookup_name_info &lookup_name,
14211 completion_match_result *comp_match_res)
14213 return full_match (symbol_search_name, ada_lookup_name (lookup_name));
14216 /* Build the Ada lookup name for LOOKUP_NAME. */
14218 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info &lookup_name)
14220 const std::string &user_name = lookup_name.name ();
14222 if (user_name[0] == '<')
14224 if (user_name.back () == '>')
14225 m_encoded_name = user_name.substr (1, user_name.size () - 2);
14227 m_encoded_name = user_name.substr (1, user_name.size () - 1);
14228 m_encoded_p = true;
14229 m_verbatim_p = true;
14230 m_wild_match_p = false;
14231 m_standard_p = false;
14235 m_verbatim_p = false;
14237 m_encoded_p = user_name.find ("__") != std::string::npos;
14241 const char *folded = ada_fold_name (user_name.c_str ());
14242 const char *encoded = ada_encode_1 (folded, false);
14243 if (encoded != NULL)
14244 m_encoded_name = encoded;
14246 m_encoded_name = user_name;
14249 m_encoded_name = user_name;
14251 /* Handle the 'package Standard' special case. See description
14252 of m_standard_p. */
14253 if (startswith (m_encoded_name.c_str (), "standard__"))
14255 m_encoded_name = m_encoded_name.substr (sizeof ("standard__") - 1);
14256 m_standard_p = true;
14259 m_standard_p = false;
14261 /* If the name contains a ".", then the user is entering a fully
14262 qualified entity name, and the match must not be done in wild
14263 mode. Similarly, if the user wants to complete what looks
14264 like an encoded name, the match must not be done in wild
14265 mode. Also, in the standard__ special case always do
14266 non-wild matching. */
14268 = (lookup_name.match_type () != symbol_name_match_type::FULL
14271 && user_name.find ('.') == std::string::npos);
14275 /* symbol_name_matcher_ftype method for Ada. This only handles
14276 completion mode. */
14279 ada_symbol_name_matches (const char *symbol_search_name,
14280 const lookup_name_info &lookup_name,
14281 completion_match_result *comp_match_res)
14283 return lookup_name.ada ().matches (symbol_search_name,
14284 lookup_name.match_type (),
14288 /* A name matcher that matches the symbol name exactly, with
14292 literal_symbol_name_matcher (const char *symbol_search_name,
14293 const lookup_name_info &lookup_name,
14294 completion_match_result *comp_match_res)
14296 const std::string &name = lookup_name.name ();
14298 int cmp = (lookup_name.completion_mode ()
14299 ? strncmp (symbol_search_name, name.c_str (), name.size ())
14300 : strcmp (symbol_search_name, name.c_str ()));
14303 if (comp_match_res != NULL)
14304 comp_match_res->set_match (symbol_search_name);
14311 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14314 static symbol_name_matcher_ftype *
14315 ada_get_symbol_name_matcher (const lookup_name_info &lookup_name)
14317 if (lookup_name.match_type () == symbol_name_match_type::SEARCH_NAME)
14318 return literal_symbol_name_matcher;
14320 if (lookup_name.completion_mode ())
14321 return ada_symbol_name_matches;
14324 if (lookup_name.ada ().wild_match_p ())
14325 return do_wild_match;
14327 return do_full_match;
14331 /* Implement the "la_read_var_value" language_defn method for Ada. */
14333 static struct value *
14334 ada_read_var_value (struct symbol *var, const struct block *var_block,
14335 struct frame_info *frame)
14337 const struct block *frame_block = NULL;
14338 struct symbol *renaming_sym = NULL;
14340 /* The only case where default_read_var_value is not sufficient
14341 is when VAR is a renaming... */
14343 frame_block = get_frame_block (frame, NULL);
14345 renaming_sym = ada_find_renaming_symbol (var, frame_block);
14346 if (renaming_sym != NULL)
14347 return ada_read_renaming_var_value (renaming_sym, frame_block);
14349 /* This is a typical case where we expect the default_read_var_value
14350 function to work. */
14351 return default_read_var_value (var, var_block, frame);
14354 static const char *ada_extensions[] =
14356 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14359 extern const struct language_defn ada_language_defn = {
14360 "ada", /* Language name */
14364 case_sensitive_on, /* Yes, Ada is case-insensitive, but
14365 that's not quite what this means. */
14367 macro_expansion_no,
14369 &ada_exp_descriptor,
14372 ada_printchar, /* Print a character constant */
14373 ada_printstr, /* Function to print string constant */
14374 emit_char, /* Function to print single char (not used) */
14375 ada_print_type, /* Print a type using appropriate syntax */
14376 ada_print_typedef, /* Print a typedef using appropriate syntax */
14377 ada_val_print, /* Print a value using appropriate syntax */
14378 ada_value_print, /* Print a top-level value */
14379 ada_read_var_value, /* la_read_var_value */
14380 NULL, /* Language specific skip_trampoline */
14381 NULL, /* name_of_this */
14382 true, /* la_store_sym_names_in_linkage_form_p */
14383 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
14384 basic_lookup_transparent_type, /* lookup_transparent_type */
14385 ada_la_decode, /* Language specific symbol demangler */
14386 ada_sniff_from_mangled_name,
14387 NULL, /* Language specific
14388 class_name_from_physname */
14389 ada_op_print_tab, /* expression operators for printing */
14390 0, /* c-style arrays */
14391 1, /* String lower bound */
14392 ada_get_gdb_completer_word_break_characters,
14393 ada_collect_symbol_completion_matches,
14394 ada_language_arch_info,
14395 ada_print_array_index,
14396 default_pass_by_reference,
14398 c_watch_location_expression,
14399 ada_get_symbol_name_matcher, /* la_get_symbol_name_matcher */
14400 ada_iterate_over_symbols,
14401 default_search_name_hash,
14408 /* Command-list for the "set/show ada" prefix command. */
14409 static struct cmd_list_element *set_ada_list;
14410 static struct cmd_list_element *show_ada_list;
14412 /* Implement the "set ada" prefix command. */
14415 set_ada_command (const char *arg, int from_tty)
14417 printf_unfiltered (_(\
14418 "\"set ada\" must be followed by the name of a setting.\n"));
14419 help_list (set_ada_list, "set ada ", all_commands, gdb_stdout);
14422 /* Implement the "show ada" prefix command. */
14425 show_ada_command (const char *args, int from_tty)
14427 cmd_show_list (show_ada_list, from_tty, "");
14431 initialize_ada_catchpoint_ops (void)
14433 struct breakpoint_ops *ops;
14435 initialize_breakpoint_ops ();
14437 ops = &catch_exception_breakpoint_ops;
14438 *ops = bkpt_breakpoint_ops;
14439 ops->allocate_location = allocate_location_catch_exception;
14440 ops->re_set = re_set_catch_exception;
14441 ops->check_status = check_status_catch_exception;
14442 ops->print_it = print_it_catch_exception;
14443 ops->print_one = print_one_catch_exception;
14444 ops->print_mention = print_mention_catch_exception;
14445 ops->print_recreate = print_recreate_catch_exception;
14447 ops = &catch_exception_unhandled_breakpoint_ops;
14448 *ops = bkpt_breakpoint_ops;
14449 ops->allocate_location = allocate_location_catch_exception_unhandled;
14450 ops->re_set = re_set_catch_exception_unhandled;
14451 ops->check_status = check_status_catch_exception_unhandled;
14452 ops->print_it = print_it_catch_exception_unhandled;
14453 ops->print_one = print_one_catch_exception_unhandled;
14454 ops->print_mention = print_mention_catch_exception_unhandled;
14455 ops->print_recreate = print_recreate_catch_exception_unhandled;
14457 ops = &catch_assert_breakpoint_ops;
14458 *ops = bkpt_breakpoint_ops;
14459 ops->allocate_location = allocate_location_catch_assert;
14460 ops->re_set = re_set_catch_assert;
14461 ops->check_status = check_status_catch_assert;
14462 ops->print_it = print_it_catch_assert;
14463 ops->print_one = print_one_catch_assert;
14464 ops->print_mention = print_mention_catch_assert;
14465 ops->print_recreate = print_recreate_catch_assert;
14467 ops = &catch_handlers_breakpoint_ops;
14468 *ops = bkpt_breakpoint_ops;
14469 ops->allocate_location = allocate_location_catch_handlers;
14470 ops->re_set = re_set_catch_handlers;
14471 ops->check_status = check_status_catch_handlers;
14472 ops->print_it = print_it_catch_handlers;
14473 ops->print_one = print_one_catch_handlers;
14474 ops->print_mention = print_mention_catch_handlers;
14475 ops->print_recreate = print_recreate_catch_handlers;
14478 /* This module's 'new_objfile' observer. */
14481 ada_new_objfile_observer (struct objfile *objfile)
14483 ada_clear_symbol_cache ();
14486 /* This module's 'free_objfile' observer. */
14489 ada_free_objfile_observer (struct objfile *objfile)
14491 ada_clear_symbol_cache ();
14495 _initialize_ada_language (void)
14497 initialize_ada_catchpoint_ops ();
14499 add_prefix_cmd ("ada", no_class, set_ada_command,
14500 _("Prefix command for changing Ada-specfic settings"),
14501 &set_ada_list, "set ada ", 0, &setlist);
14503 add_prefix_cmd ("ada", no_class, show_ada_command,
14504 _("Generic command for showing Ada-specific settings."),
14505 &show_ada_list, "show ada ", 0, &showlist);
14507 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
14508 &trust_pad_over_xvs, _("\
14509 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14510 Show whether an optimization trusting PAD types over XVS types is activated"),
14512 This is related to the encoding used by the GNAT compiler. The debugger\n\
14513 should normally trust the contents of PAD types, but certain older versions\n\
14514 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14515 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14516 work around this bug. It is always safe to turn this option \"off\", but\n\
14517 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14518 this option to \"off\" unless necessary."),
14519 NULL, NULL, &set_ada_list, &show_ada_list);
14521 add_setshow_boolean_cmd ("print-signatures", class_vars,
14522 &print_signatures, _("\
14523 Enable or disable the output of formal and return types for functions in the \
14524 overloads selection menu"), _("\
14525 Show whether the output of formal and return types for functions in the \
14526 overloads selection menu is activated"),
14527 NULL, NULL, NULL, &set_ada_list, &show_ada_list);
14529 add_catch_command ("exception", _("\
14530 Catch Ada exceptions, when raised.\n\
14531 With an argument, catch only exceptions with the given name."),
14532 catch_ada_exception_command,
14537 add_catch_command ("handlers", _("\
14538 Catch Ada exceptions, when handled.\n\
14539 With an argument, catch only exceptions with the given name."),
14540 catch_ada_handlers_command,
14544 add_catch_command ("assert", _("\
14545 Catch failed Ada assertions, when raised.\n\
14546 With an argument, catch only exceptions with the given name."),
14547 catch_assert_command,
14552 varsize_limit = 65536;
14553 add_setshow_uinteger_cmd ("varsize-limit", class_support,
14554 &varsize_limit, _("\
14555 Set the maximum number of bytes allowed in a variable-size object."), _("\
14556 Show the maximum number of bytes allowed in a variable-size object."), _("\
14557 Attempts to access an object whose size is not a compile-time constant\n\
14558 and exceeds this limit will cause an error."),
14559 NULL, NULL, &setlist, &showlist);
14561 add_info ("exceptions", info_exceptions_command,
14563 List all Ada exception names.\n\
14564 If a regular expression is passed as an argument, only those matching\n\
14565 the regular expression are listed."));
14567 add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd,
14568 _("Set Ada maintenance-related variables."),
14569 &maint_set_ada_cmdlist, "maintenance set ada ",
14570 0/*allow-unknown*/, &maintenance_set_cmdlist);
14572 add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd,
14573 _("Show Ada maintenance-related variables"),
14574 &maint_show_ada_cmdlist, "maintenance show ada ",
14575 0/*allow-unknown*/, &maintenance_show_cmdlist);
14577 add_setshow_boolean_cmd
14578 ("ignore-descriptive-types", class_maintenance,
14579 &ada_ignore_descriptive_types_p,
14580 _("Set whether descriptive types generated by GNAT should be ignored."),
14581 _("Show whether descriptive types generated by GNAT should be ignored."),
14583 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14584 DWARF attribute."),
14585 NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist);
14587 decoded_names_store = htab_create_alloc (256, htab_hash_string, streq_hash,
14588 NULL, xcalloc, xfree);
14590 /* The ada-lang observers. */
14591 gdb::observers::new_objfile.attach (ada_new_objfile_observer);
14592 gdb::observers::free_objfile.attach (ada_free_objfile_observer);
14593 gdb::observers::inferior_exit.attach (ada_inferior_exit);
14595 /* Setup various context-specific data. */
14597 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);
14598 ada_pspace_data_handle
14599 = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup);