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 /* The value of the element of array ARR at the ARITY indices given in IND.
2836 ARR may be either a simple array, GNAT array descriptor, or pointer
2840 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2844 struct type *elt_type;
2846 elt = ada_coerce_to_simple_array (arr);
2848 elt_type = ada_check_typedef (value_type (elt));
2849 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2850 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2851 return value_subscript_packed (elt, arity, ind);
2853 for (k = 0; k < arity; k += 1)
2855 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2856 error (_("too many subscripts (%d expected)"), k);
2857 elt = value_subscript (elt, pos_atr (ind[k]));
2862 /* Assuming ARR is a pointer to a GDB array, the value of the element
2863 of *ARR at the ARITY indices given in IND.
2864 Does not read the entire array into memory.
2866 Note: Unlike what one would expect, this function is used instead of
2867 ada_value_subscript for basically all non-packed array types. The reason
2868 for this is that a side effect of doing our own pointer arithmetics instead
2869 of relying on value_subscript is that there is no implicit typedef peeling.
2870 This is important for arrays of array accesses, where it allows us to
2871 preserve the fact that the array's element is an array access, where the
2872 access part os encoded in a typedef layer. */
2874 static struct value *
2875 ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind)
2878 struct value *array_ind = ada_value_ind (arr);
2880 = check_typedef (value_enclosing_type (array_ind));
2882 if (TYPE_CODE (type) == TYPE_CODE_ARRAY
2883 && TYPE_FIELD_BITSIZE (type, 0) > 0)
2884 return value_subscript_packed (array_ind, arity, ind);
2886 for (k = 0; k < arity; k += 1)
2889 struct value *lwb_value;
2891 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2892 error (_("too many subscripts (%d expected)"), k);
2893 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2895 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2896 lwb_value = value_from_longest (value_type(ind[k]), lwb);
2897 arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value));
2898 type = TYPE_TARGET_TYPE (type);
2901 return value_ind (arr);
2904 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2905 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2906 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2907 this array is LOW, as per Ada rules. */
2908 static struct value *
2909 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2912 struct type *type0 = ada_check_typedef (type);
2913 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0));
2914 struct type *index_type
2915 = create_static_range_type (NULL, base_index_type, low, high);
2916 struct type *slice_type = create_array_type_with_stride
2917 (NULL, TYPE_TARGET_TYPE (type0), index_type,
2918 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type0),
2919 TYPE_FIELD_BITSIZE (type0, 0));
2920 int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0));
2921 LONGEST base_low_pos, low_pos;
2924 if (!discrete_position (base_index_type, low, &low_pos)
2925 || !discrete_position (base_index_type, base_low, &base_low_pos))
2927 warning (_("unable to get positions in slice, use bounds instead"));
2929 base_low_pos = base_low;
2932 base = value_as_address (array_ptr)
2933 + ((low_pos - base_low_pos)
2934 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2935 return value_at_lazy (slice_type, base);
2939 static struct value *
2940 ada_value_slice (struct value *array, int low, int high)
2942 struct type *type = ada_check_typedef (value_type (array));
2943 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2944 struct type *index_type
2945 = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2946 struct type *slice_type = create_array_type_with_stride
2947 (NULL, TYPE_TARGET_TYPE (type), index_type,
2948 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type),
2949 TYPE_FIELD_BITSIZE (type, 0));
2950 LONGEST low_pos, high_pos;
2952 if (!discrete_position (base_index_type, low, &low_pos)
2953 || !discrete_position (base_index_type, high, &high_pos))
2955 warning (_("unable to get positions in slice, use bounds instead"));
2960 return value_cast (slice_type,
2961 value_slice (array, low, high_pos - low_pos + 1));
2964 /* If type is a record type in the form of a standard GNAT array
2965 descriptor, returns the number of dimensions for type. If arr is a
2966 simple array, returns the number of "array of"s that prefix its
2967 type designation. Otherwise, returns 0. */
2970 ada_array_arity (struct type *type)
2977 type = desc_base_type (type);
2980 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2981 return desc_arity (desc_bounds_type (type));
2983 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2986 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2992 /* If TYPE is a record type in the form of a standard GNAT array
2993 descriptor or a simple array type, returns the element type for
2994 TYPE after indexing by NINDICES indices, or by all indices if
2995 NINDICES is -1. Otherwise, returns NULL. */
2998 ada_array_element_type (struct type *type, int nindices)
3000 type = desc_base_type (type);
3002 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
3005 struct type *p_array_type;
3007 p_array_type = desc_data_target_type (type);
3009 k = ada_array_arity (type);
3013 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
3014 if (nindices >= 0 && k > nindices)
3016 while (k > 0 && p_array_type != NULL)
3018 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
3021 return p_array_type;
3023 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
3025 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
3027 type = TYPE_TARGET_TYPE (type);
3036 /* The type of nth index in arrays of given type (n numbering from 1).
3037 Does not examine memory. Throws an error if N is invalid or TYPE
3038 is not an array type. NAME is the name of the Ada attribute being
3039 evaluated ('range, 'first, 'last, or 'length); it is used in building
3040 the error message. */
3042 static struct type *
3043 ada_index_type (struct type *type, int n, const char *name)
3045 struct type *result_type;
3047 type = desc_base_type (type);
3049 if (n < 0 || n > ada_array_arity (type))
3050 error (_("invalid dimension number to '%s"), name);
3052 if (ada_is_simple_array_type (type))
3056 for (i = 1; i < n; i += 1)
3057 type = TYPE_TARGET_TYPE (type);
3058 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
3059 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3060 has a target type of TYPE_CODE_UNDEF. We compensate here, but
3061 perhaps stabsread.c would make more sense. */
3062 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
3067 result_type = desc_index_type (desc_bounds_type (type), n);
3068 if (result_type == NULL)
3069 error (_("attempt to take bound of something that is not an array"));
3075 /* Given that arr is an array type, returns the lower bound of the
3076 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
3077 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
3078 array-descriptor type. It works for other arrays with bounds supplied
3079 by run-time quantities other than discriminants. */
3082 ada_array_bound_from_type (struct type *arr_type, int n, int which)
3084 struct type *type, *index_type_desc, *index_type;
3087 gdb_assert (which == 0 || which == 1);
3089 if (ada_is_constrained_packed_array_type (arr_type))
3090 arr_type = decode_constrained_packed_array_type (arr_type);
3092 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
3093 return (LONGEST) - which;
3095 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
3096 type = TYPE_TARGET_TYPE (arr_type);
3100 if (TYPE_FIXED_INSTANCE (type))
3102 /* The array has already been fixed, so we do not need to
3103 check the parallel ___XA type again. That encoding has
3104 already been applied, so ignore it now. */
3105 index_type_desc = NULL;
3109 index_type_desc = ada_find_parallel_type (type, "___XA");
3110 ada_fixup_array_indexes_type (index_type_desc);
3113 if (index_type_desc != NULL)
3114 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
3118 struct type *elt_type = check_typedef (type);
3120 for (i = 1; i < n; i++)
3121 elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type));
3123 index_type = TYPE_INDEX_TYPE (elt_type);
3127 (LONGEST) (which == 0
3128 ? ada_discrete_type_low_bound (index_type)
3129 : ada_discrete_type_high_bound (index_type));
3132 /* Given that arr is an array value, returns the lower bound of the
3133 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3134 WHICH is 1. This routine will also work for arrays with bounds
3135 supplied by run-time quantities other than discriminants. */
3138 ada_array_bound (struct value *arr, int n, int which)
3140 struct type *arr_type;
3142 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3143 arr = value_ind (arr);
3144 arr_type = value_enclosing_type (arr);
3146 if (ada_is_constrained_packed_array_type (arr_type))
3147 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
3148 else if (ada_is_simple_array_type (arr_type))
3149 return ada_array_bound_from_type (arr_type, n, which);
3151 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
3154 /* Given that arr is an array value, returns the length of the
3155 nth index. This routine will also work for arrays with bounds
3156 supplied by run-time quantities other than discriminants.
3157 Does not work for arrays indexed by enumeration types with representation
3158 clauses at the moment. */
3161 ada_array_length (struct value *arr, int n)
3163 struct type *arr_type, *index_type;
3166 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3167 arr = value_ind (arr);
3168 arr_type = value_enclosing_type (arr);
3170 if (ada_is_constrained_packed_array_type (arr_type))
3171 return ada_array_length (decode_constrained_packed_array (arr), n);
3173 if (ada_is_simple_array_type (arr_type))
3175 low = ada_array_bound_from_type (arr_type, n, 0);
3176 high = ada_array_bound_from_type (arr_type, n, 1);
3180 low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0));
3181 high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1));
3184 arr_type = check_typedef (arr_type);
3185 index_type = ada_index_type (arr_type, n, "length");
3186 if (index_type != NULL)
3188 struct type *base_type;
3189 if (TYPE_CODE (index_type) == TYPE_CODE_RANGE)
3190 base_type = TYPE_TARGET_TYPE (index_type);
3192 base_type = index_type;
3194 low = pos_atr (value_from_longest (base_type, low));
3195 high = pos_atr (value_from_longest (base_type, high));
3197 return high - low + 1;
3200 /* An empty array whose type is that of ARR_TYPE (an array type),
3201 with bounds LOW to LOW-1. */
3203 static struct value *
3204 empty_array (struct type *arr_type, int low)
3206 struct type *arr_type0 = ada_check_typedef (arr_type);
3207 struct type *index_type
3208 = create_static_range_type
3209 (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1);
3210 struct type *elt_type = ada_array_element_type (arr_type0, 1);
3212 return allocate_value (create_array_type (NULL, elt_type, index_type));
3216 /* Name resolution */
3218 /* The "decoded" name for the user-definable Ada operator corresponding
3222 ada_decoded_op_name (enum exp_opcode op)
3226 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
3228 if (ada_opname_table[i].op == op)
3229 return ada_opname_table[i].decoded;
3231 error (_("Could not find operator name for opcode"));
3235 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3236 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3237 undefined namespace) and converts operators that are
3238 user-defined into appropriate function calls. If CONTEXT_TYPE is
3239 non-null, it provides a preferred result type [at the moment, only
3240 type void has any effect---causing procedures to be preferred over
3241 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3242 return type is preferred. May change (expand) *EXP. */
3245 resolve (expression_up *expp, int void_context_p)
3247 struct type *context_type = NULL;
3251 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
3253 resolve_subexp (expp, &pc, 1, context_type);
3256 /* Resolve the operator of the subexpression beginning at
3257 position *POS of *EXPP. "Resolving" consists of replacing
3258 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3259 with their resolutions, replacing built-in operators with
3260 function calls to user-defined operators, where appropriate, and,
3261 when DEPROCEDURE_P is non-zero, converting function-valued variables
3262 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3263 are as in ada_resolve, above. */
3265 static struct value *
3266 resolve_subexp (expression_up *expp, int *pos, int deprocedure_p,
3267 struct type *context_type)
3271 struct expression *exp; /* Convenience: == *expp. */
3272 enum exp_opcode op = (*expp)->elts[pc].opcode;
3273 struct value **argvec; /* Vector of operand types (alloca'ed). */
3274 int nargs; /* Number of operands. */
3281 /* Pass one: resolve operands, saving their types and updating *pos,
3286 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3287 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3292 resolve_subexp (expp, pos, 0, NULL);
3294 nargs = longest_to_int (exp->elts[pc + 1].longconst);
3299 resolve_subexp (expp, pos, 0, NULL);
3304 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
3307 case OP_ATR_MODULUS:
3317 case TERNOP_IN_RANGE:
3318 case BINOP_IN_BOUNDS:
3324 case OP_DISCRETE_RANGE:
3326 ada_forward_operator_length (exp, pc, &oplen, &nargs);
3335 arg1 = resolve_subexp (expp, pos, 0, NULL);
3337 resolve_subexp (expp, pos, 1, NULL);
3339 resolve_subexp (expp, pos, 1, value_type (arg1));
3356 case BINOP_LOGICAL_AND:
3357 case BINOP_LOGICAL_OR:
3358 case BINOP_BITWISE_AND:
3359 case BINOP_BITWISE_IOR:
3360 case BINOP_BITWISE_XOR:
3363 case BINOP_NOTEQUAL:
3370 case BINOP_SUBSCRIPT:
3378 case UNOP_LOGICAL_NOT:
3388 case OP_VAR_MSYM_VALUE:
3395 case OP_INTERNALVAR:
3405 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3408 case STRUCTOP_STRUCT:
3409 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3422 error (_("Unexpected operator during name resolution"));
3425 argvec = XALLOCAVEC (struct value *, nargs + 1);
3426 for (i = 0; i < nargs; i += 1)
3427 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3431 /* Pass two: perform any resolution on principal operator. */
3438 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3440 std::vector<struct block_symbol> candidates;
3444 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3445 (exp->elts[pc + 2].symbol),
3446 exp->elts[pc + 1].block, VAR_DOMAIN,
3449 if (n_candidates > 1)
3451 /* Types tend to get re-introduced locally, so if there
3452 are any local symbols that are not types, first filter
3455 for (j = 0; j < n_candidates; j += 1)
3456 switch (SYMBOL_CLASS (candidates[j].symbol))
3461 case LOC_REGPARM_ADDR:
3469 if (j < n_candidates)
3472 while (j < n_candidates)
3474 if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF)
3476 candidates[j] = candidates[n_candidates - 1];
3485 if (n_candidates == 0)
3486 error (_("No definition found for %s"),
3487 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3488 else if (n_candidates == 1)
3490 else if (deprocedure_p
3491 && !is_nonfunction (candidates.data (), n_candidates))
3493 i = ada_resolve_function
3494 (candidates.data (), n_candidates, NULL, 0,
3495 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3498 error (_("Could not find a match for %s"),
3499 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3503 printf_filtered (_("Multiple matches for %s\n"),
3504 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3505 user_select_syms (candidates.data (), n_candidates, 1);
3509 exp->elts[pc + 1].block = candidates[i].block;
3510 exp->elts[pc + 2].symbol = candidates[i].symbol;
3511 innermost_block.update (candidates[i]);
3515 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3518 replace_operator_with_call (expp, pc, 0, 0,
3519 exp->elts[pc + 2].symbol,
3520 exp->elts[pc + 1].block);
3527 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3528 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3530 std::vector<struct block_symbol> candidates;
3534 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3535 (exp->elts[pc + 5].symbol),
3536 exp->elts[pc + 4].block, VAR_DOMAIN,
3539 if (n_candidates == 1)
3543 i = ada_resolve_function
3544 (candidates.data (), n_candidates,
3546 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3549 error (_("Could not find a match for %s"),
3550 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3553 exp->elts[pc + 4].block = candidates[i].block;
3554 exp->elts[pc + 5].symbol = candidates[i].symbol;
3555 innermost_block.update (candidates[i]);
3566 case BINOP_BITWISE_AND:
3567 case BINOP_BITWISE_IOR:
3568 case BINOP_BITWISE_XOR:
3570 case BINOP_NOTEQUAL:
3578 case UNOP_LOGICAL_NOT:
3580 if (possible_user_operator_p (op, argvec))
3582 std::vector<struct block_symbol> candidates;
3586 ada_lookup_symbol_list (ada_decoded_op_name (op),
3587 (struct block *) NULL, VAR_DOMAIN,
3590 i = ada_resolve_function (candidates.data (), n_candidates, argvec,
3591 nargs, ada_decoded_op_name (op), NULL);
3595 replace_operator_with_call (expp, pc, nargs, 1,
3596 candidates[i].symbol,
3597 candidates[i].block);
3608 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
3609 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS,
3610 exp->elts[pc + 1].objfile,
3611 exp->elts[pc + 2].msymbol);
3613 return evaluate_subexp_type (exp, pos);
3616 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3617 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3619 /* The term "match" here is rather loose. The match is heuristic and
3623 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3625 ftype = ada_check_typedef (ftype);
3626 atype = ada_check_typedef (atype);
3628 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3629 ftype = TYPE_TARGET_TYPE (ftype);
3630 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3631 atype = TYPE_TARGET_TYPE (atype);
3633 switch (TYPE_CODE (ftype))
3636 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3638 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3639 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3640 TYPE_TARGET_TYPE (atype), 0);
3643 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3645 case TYPE_CODE_ENUM:
3646 case TYPE_CODE_RANGE:
3647 switch (TYPE_CODE (atype))
3650 case TYPE_CODE_ENUM:
3651 case TYPE_CODE_RANGE:
3657 case TYPE_CODE_ARRAY:
3658 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3659 || ada_is_array_descriptor_type (atype));
3661 case TYPE_CODE_STRUCT:
3662 if (ada_is_array_descriptor_type (ftype))
3663 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3664 || ada_is_array_descriptor_type (atype));
3666 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3667 && !ada_is_array_descriptor_type (atype));
3669 case TYPE_CODE_UNION:
3671 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3675 /* Return non-zero if the formals of FUNC "sufficiently match" the
3676 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3677 may also be an enumeral, in which case it is treated as a 0-
3678 argument function. */
3681 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3684 struct type *func_type = SYMBOL_TYPE (func);
3686 if (SYMBOL_CLASS (func) == LOC_CONST
3687 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3688 return (n_actuals == 0);
3689 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3692 if (TYPE_NFIELDS (func_type) != n_actuals)
3695 for (i = 0; i < n_actuals; i += 1)
3697 if (actuals[i] == NULL)
3701 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3703 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3705 if (!ada_type_match (ftype, atype, 1))
3712 /* False iff function type FUNC_TYPE definitely does not produce a value
3713 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3714 FUNC_TYPE is not a valid function type with a non-null return type
3715 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3718 return_match (struct type *func_type, struct type *context_type)
3720 struct type *return_type;
3722 if (func_type == NULL)
3725 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3726 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
3728 return_type = get_base_type (func_type);
3729 if (return_type == NULL)
3732 context_type = get_base_type (context_type);
3734 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3735 return context_type == NULL || return_type == context_type;
3736 else if (context_type == NULL)
3737 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3739 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3743 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3744 function (if any) that matches the types of the NARGS arguments in
3745 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3746 that returns that type, then eliminate matches that don't. If
3747 CONTEXT_TYPE is void and there is at least one match that does not
3748 return void, eliminate all matches that do.
3750 Asks the user if there is more than one match remaining. Returns -1
3751 if there is no such symbol or none is selected. NAME is used
3752 solely for messages. May re-arrange and modify SYMS in
3753 the process; the index returned is for the modified vector. */
3756 ada_resolve_function (struct block_symbol syms[],
3757 int nsyms, struct value **args, int nargs,
3758 const char *name, struct type *context_type)
3762 int m; /* Number of hits */
3765 /* In the first pass of the loop, we only accept functions matching
3766 context_type. If none are found, we add a second pass of the loop
3767 where every function is accepted. */
3768 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3770 for (k = 0; k < nsyms; k += 1)
3772 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol));
3774 if (ada_args_match (syms[k].symbol, args, nargs)
3775 && (fallback || return_match (type, context_type)))
3783 /* If we got multiple matches, ask the user which one to use. Don't do this
3784 interactive thing during completion, though, as the purpose of the
3785 completion is providing a list of all possible matches. Prompting the
3786 user to filter it down would be completely unexpected in this case. */
3789 else if (m > 1 && !parse_completion)
3791 printf_filtered (_("Multiple matches for %s\n"), name);
3792 user_select_syms (syms, m, 1);
3798 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3799 in a listing of choices during disambiguation (see sort_choices, below).
3800 The idea is that overloadings of a subprogram name from the
3801 same package should sort in their source order. We settle for ordering
3802 such symbols by their trailing number (__N or $N). */
3805 encoded_ordered_before (const char *N0, const char *N1)
3809 else if (N0 == NULL)
3815 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3817 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3819 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3820 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3825 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3828 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3830 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3831 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3833 return (strcmp (N0, N1) < 0);
3837 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3841 sort_choices (struct block_symbol syms[], int nsyms)
3845 for (i = 1; i < nsyms; i += 1)
3847 struct block_symbol sym = syms[i];
3850 for (j = i - 1; j >= 0; j -= 1)
3852 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol),
3853 SYMBOL_LINKAGE_NAME (sym.symbol)))
3855 syms[j + 1] = syms[j];
3861 /* Whether GDB should display formals and return types for functions in the
3862 overloads selection menu. */
3863 static int print_signatures = 1;
3865 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3866 all but functions, the signature is just the name of the symbol. For
3867 functions, this is the name of the function, the list of types for formals
3868 and the return type (if any). */
3871 ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym,
3872 const struct type_print_options *flags)
3874 struct type *type = SYMBOL_TYPE (sym);
3876 fprintf_filtered (stream, "%s", SYMBOL_PRINT_NAME (sym));
3877 if (!print_signatures
3879 || TYPE_CODE (type) != TYPE_CODE_FUNC)
3882 if (TYPE_NFIELDS (type) > 0)
3886 fprintf_filtered (stream, " (");
3887 for (i = 0; i < TYPE_NFIELDS (type); ++i)
3890 fprintf_filtered (stream, "; ");
3891 ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0,
3894 fprintf_filtered (stream, ")");
3896 if (TYPE_TARGET_TYPE (type) != NULL
3897 && TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID)
3899 fprintf_filtered (stream, " return ");
3900 ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags);
3904 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3905 by asking the user (if necessary), returning the number selected,
3906 and setting the first elements of SYMS items. Error if no symbols
3909 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3910 to be re-integrated one of these days. */
3913 user_select_syms (struct block_symbol *syms, int nsyms, int max_results)
3916 int *chosen = XALLOCAVEC (int , nsyms);
3918 int first_choice = (max_results == 1) ? 1 : 2;
3919 const char *select_mode = multiple_symbols_select_mode ();
3921 if (max_results < 1)
3922 error (_("Request to select 0 symbols!"));
3926 if (select_mode == multiple_symbols_cancel)
3928 canceled because the command is ambiguous\n\
3929 See set/show multiple-symbol."));
3931 /* If select_mode is "all", then return all possible symbols.
3932 Only do that if more than one symbol can be selected, of course.
3933 Otherwise, display the menu as usual. */
3934 if (select_mode == multiple_symbols_all && max_results > 1)
3937 printf_unfiltered (_("[0] cancel\n"));
3938 if (max_results > 1)
3939 printf_unfiltered (_("[1] all\n"));
3941 sort_choices (syms, nsyms);
3943 for (i = 0; i < nsyms; i += 1)
3945 if (syms[i].symbol == NULL)
3948 if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK)
3950 struct symtab_and_line sal =
3951 find_function_start_sal (syms[i].symbol, 1);
3953 printf_unfiltered ("[%d] ", i + first_choice);
3954 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3955 &type_print_raw_options);
3956 if (sal.symtab == NULL)
3957 printf_unfiltered (_(" at <no source file available>:%d\n"),
3960 printf_unfiltered (_(" at %s:%d\n"),
3961 symtab_to_filename_for_display (sal.symtab),
3968 (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST
3969 && SYMBOL_TYPE (syms[i].symbol) != NULL
3970 && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM);
3971 struct symtab *symtab = NULL;
3973 if (SYMBOL_OBJFILE_OWNED (syms[i].symbol))
3974 symtab = symbol_symtab (syms[i].symbol);
3976 if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL)
3978 printf_unfiltered ("[%d] ", i + first_choice);
3979 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3980 &type_print_raw_options);
3981 printf_unfiltered (_(" at %s:%d\n"),
3982 symtab_to_filename_for_display (symtab),
3983 SYMBOL_LINE (syms[i].symbol));
3985 else if (is_enumeral
3986 && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL)
3988 printf_unfiltered (("[%d] "), i + first_choice);
3989 ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL,
3990 gdb_stdout, -1, 0, &type_print_raw_options);
3991 printf_unfiltered (_("'(%s) (enumeral)\n"),
3992 SYMBOL_PRINT_NAME (syms[i].symbol));
3996 printf_unfiltered ("[%d] ", i + first_choice);
3997 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3998 &type_print_raw_options);
4001 printf_unfiltered (is_enumeral
4002 ? _(" in %s (enumeral)\n")
4004 symtab_to_filename_for_display (symtab));
4006 printf_unfiltered (is_enumeral
4007 ? _(" (enumeral)\n")
4013 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
4016 for (i = 0; i < n_chosen; i += 1)
4017 syms[i] = syms[chosen[i]];
4022 /* Read and validate a set of numeric choices from the user in the
4023 range 0 .. N_CHOICES-1. Place the results in increasing
4024 order in CHOICES[0 .. N-1], and return N.
4026 The user types choices as a sequence of numbers on one line
4027 separated by blanks, encoding them as follows:
4029 + A choice of 0 means to cancel the selection, throwing an error.
4030 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4031 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4033 The user is not allowed to choose more than MAX_RESULTS values.
4035 ANNOTATION_SUFFIX, if present, is used to annotate the input
4036 prompts (for use with the -f switch). */
4039 get_selections (int *choices, int n_choices, int max_results,
4040 int is_all_choice, const char *annotation_suffix)
4045 int first_choice = is_all_choice ? 2 : 1;
4047 prompt = getenv ("PS2");
4051 args = command_line_input (prompt, annotation_suffix);
4054 error_no_arg (_("one or more choice numbers"));
4058 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4059 order, as given in args. Choices are validated. */
4065 args = skip_spaces (args);
4066 if (*args == '\0' && n_chosen == 0)
4067 error_no_arg (_("one or more choice numbers"));
4068 else if (*args == '\0')
4071 choice = strtol (args, &args2, 10);
4072 if (args == args2 || choice < 0
4073 || choice > n_choices + first_choice - 1)
4074 error (_("Argument must be choice number"));
4078 error (_("cancelled"));
4080 if (choice < first_choice)
4082 n_chosen = n_choices;
4083 for (j = 0; j < n_choices; j += 1)
4087 choice -= first_choice;
4089 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
4093 if (j < 0 || choice != choices[j])
4097 for (k = n_chosen - 1; k > j; k -= 1)
4098 choices[k + 1] = choices[k];
4099 choices[j + 1] = choice;
4104 if (n_chosen > max_results)
4105 error (_("Select no more than %d of the above"), max_results);
4110 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4111 on the function identified by SYM and BLOCK, and taking NARGS
4112 arguments. Update *EXPP as needed to hold more space. */
4115 replace_operator_with_call (expression_up *expp, int pc, int nargs,
4116 int oplen, struct symbol *sym,
4117 const struct block *block)
4119 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4120 symbol, -oplen for operator being replaced). */
4121 struct expression *newexp = (struct expression *)
4122 xzalloc (sizeof (struct expression)
4123 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
4124 struct expression *exp = expp->get ();
4126 newexp->nelts = exp->nelts + 7 - oplen;
4127 newexp->language_defn = exp->language_defn;
4128 newexp->gdbarch = exp->gdbarch;
4129 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
4130 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
4131 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
4133 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
4134 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
4136 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
4137 newexp->elts[pc + 4].block = block;
4138 newexp->elts[pc + 5].symbol = sym;
4140 expp->reset (newexp);
4143 /* Type-class predicates */
4145 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4149 numeric_type_p (struct type *type)
4155 switch (TYPE_CODE (type))
4160 case TYPE_CODE_RANGE:
4161 return (type == TYPE_TARGET_TYPE (type)
4162 || numeric_type_p (TYPE_TARGET_TYPE (type)));
4169 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4172 integer_type_p (struct type *type)
4178 switch (TYPE_CODE (type))
4182 case TYPE_CODE_RANGE:
4183 return (type == TYPE_TARGET_TYPE (type)
4184 || integer_type_p (TYPE_TARGET_TYPE (type)));
4191 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4194 scalar_type_p (struct type *type)
4200 switch (TYPE_CODE (type))
4203 case TYPE_CODE_RANGE:
4204 case TYPE_CODE_ENUM:
4213 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4216 discrete_type_p (struct type *type)
4222 switch (TYPE_CODE (type))
4225 case TYPE_CODE_RANGE:
4226 case TYPE_CODE_ENUM:
4227 case TYPE_CODE_BOOL:
4235 /* Returns non-zero if OP with operands in the vector ARGS could be
4236 a user-defined function. Errs on the side of pre-defined operators
4237 (i.e., result 0). */
4240 possible_user_operator_p (enum exp_opcode op, struct value *args[])
4242 struct type *type0 =
4243 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
4244 struct type *type1 =
4245 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
4259 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
4263 case BINOP_BITWISE_AND:
4264 case BINOP_BITWISE_IOR:
4265 case BINOP_BITWISE_XOR:
4266 return (!(integer_type_p (type0) && integer_type_p (type1)));
4269 case BINOP_NOTEQUAL:
4274 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
4277 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
4280 return (!(numeric_type_p (type0) && integer_type_p (type1)));
4284 case UNOP_LOGICAL_NOT:
4286 return (!numeric_type_p (type0));
4295 1. In the following, we assume that a renaming type's name may
4296 have an ___XD suffix. It would be nice if this went away at some
4298 2. We handle both the (old) purely type-based representation of
4299 renamings and the (new) variable-based encoding. At some point,
4300 it is devoutly to be hoped that the former goes away
4301 (FIXME: hilfinger-2007-07-09).
4302 3. Subprogram renamings are not implemented, although the XRS
4303 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4305 /* If SYM encodes a renaming,
4307 <renaming> renames <renamed entity>,
4309 sets *LEN to the length of the renamed entity's name,
4310 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4311 the string describing the subcomponent selected from the renamed
4312 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4313 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4314 are undefined). Otherwise, returns a value indicating the category
4315 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4316 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4317 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4318 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4319 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4320 may be NULL, in which case they are not assigned.
4322 [Currently, however, GCC does not generate subprogram renamings.] */
4324 enum ada_renaming_category
4325 ada_parse_renaming (struct symbol *sym,
4326 const char **renamed_entity, int *len,
4327 const char **renaming_expr)
4329 enum ada_renaming_category kind;
4334 return ADA_NOT_RENAMING;
4335 switch (SYMBOL_CLASS (sym))
4338 return ADA_NOT_RENAMING;
4340 return parse_old_style_renaming (SYMBOL_TYPE (sym),
4341 renamed_entity, len, renaming_expr);
4345 case LOC_OPTIMIZED_OUT:
4346 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
4348 return ADA_NOT_RENAMING;
4352 kind = ADA_OBJECT_RENAMING;
4356 kind = ADA_EXCEPTION_RENAMING;
4360 kind = ADA_PACKAGE_RENAMING;
4364 kind = ADA_SUBPROGRAM_RENAMING;
4368 return ADA_NOT_RENAMING;
4372 if (renamed_entity != NULL)
4373 *renamed_entity = info;
4374 suffix = strstr (info, "___XE");
4375 if (suffix == NULL || suffix == info)
4376 return ADA_NOT_RENAMING;
4378 *len = strlen (info) - strlen (suffix);
4380 if (renaming_expr != NULL)
4381 *renaming_expr = suffix;
4385 /* Assuming TYPE encodes a renaming according to the old encoding in
4386 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4387 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4388 ADA_NOT_RENAMING otherwise. */
4389 static enum ada_renaming_category
4390 parse_old_style_renaming (struct type *type,
4391 const char **renamed_entity, int *len,
4392 const char **renaming_expr)
4394 enum ada_renaming_category kind;
4399 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4400 || TYPE_NFIELDS (type) != 1)
4401 return ADA_NOT_RENAMING;
4403 name = TYPE_NAME (type);
4405 return ADA_NOT_RENAMING;
4407 name = strstr (name, "___XR");
4409 return ADA_NOT_RENAMING;
4414 kind = ADA_OBJECT_RENAMING;
4417 kind = ADA_EXCEPTION_RENAMING;
4420 kind = ADA_PACKAGE_RENAMING;
4423 kind = ADA_SUBPROGRAM_RENAMING;
4426 return ADA_NOT_RENAMING;
4429 info = TYPE_FIELD_NAME (type, 0);
4431 return ADA_NOT_RENAMING;
4432 if (renamed_entity != NULL)
4433 *renamed_entity = info;
4434 suffix = strstr (info, "___XE");
4435 if (renaming_expr != NULL)
4436 *renaming_expr = suffix + 5;
4437 if (suffix == NULL || suffix == info)
4438 return ADA_NOT_RENAMING;
4440 *len = suffix - info;
4444 /* Compute the value of the given RENAMING_SYM, which is expected to
4445 be a symbol encoding a renaming expression. BLOCK is the block
4446 used to evaluate the renaming. */
4448 static struct value *
4449 ada_read_renaming_var_value (struct symbol *renaming_sym,
4450 const struct block *block)
4452 const char *sym_name;
4454 sym_name = SYMBOL_LINKAGE_NAME (renaming_sym);
4455 expression_up expr = parse_exp_1 (&sym_name, 0, block, 0);
4456 return evaluate_expression (expr.get ());
4460 /* Evaluation: Function Calls */
4462 /* Return an lvalue containing the value VAL. This is the identity on
4463 lvalues, and otherwise has the side-effect of allocating memory
4464 in the inferior where a copy of the value contents is copied. */
4466 static struct value *
4467 ensure_lval (struct value *val)
4469 if (VALUE_LVAL (val) == not_lval
4470 || VALUE_LVAL (val) == lval_internalvar)
4472 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4473 const CORE_ADDR addr =
4474 value_as_long (value_allocate_space_in_inferior (len));
4476 VALUE_LVAL (val) = lval_memory;
4477 set_value_address (val, addr);
4478 write_memory (addr, value_contents (val), len);
4484 /* Return the value ACTUAL, converted to be an appropriate value for a
4485 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4486 allocating any necessary descriptors (fat pointers), or copies of
4487 values not residing in memory, updating it as needed. */
4490 ada_convert_actual (struct value *actual, struct type *formal_type0)
4492 struct type *actual_type = ada_check_typedef (value_type (actual));
4493 struct type *formal_type = ada_check_typedef (formal_type0);
4494 struct type *formal_target =
4495 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4496 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4497 struct type *actual_target =
4498 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4499 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4501 if (ada_is_array_descriptor_type (formal_target)
4502 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4503 return make_array_descriptor (formal_type, actual);
4504 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4505 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4507 struct value *result;
4509 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4510 && ada_is_array_descriptor_type (actual_target))
4511 result = desc_data (actual);
4512 else if (TYPE_CODE (formal_type) != TYPE_CODE_PTR)
4514 if (VALUE_LVAL (actual) != lval_memory)
4518 actual_type = ada_check_typedef (value_type (actual));
4519 val = allocate_value (actual_type);
4520 memcpy ((char *) value_contents_raw (val),
4521 (char *) value_contents (actual),
4522 TYPE_LENGTH (actual_type));
4523 actual = ensure_lval (val);
4525 result = value_addr (actual);
4529 return value_cast_pointers (formal_type, result, 0);
4531 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4532 return ada_value_ind (actual);
4533 else if (ada_is_aligner_type (formal_type))
4535 /* We need to turn this parameter into an aligner type
4537 struct value *aligner = allocate_value (formal_type);
4538 struct value *component = ada_value_struct_elt (aligner, "F", 0);
4540 value_assign_to_component (aligner, component, actual);
4547 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4548 type TYPE. This is usually an inefficient no-op except on some targets
4549 (such as AVR) where the representation of a pointer and an address
4553 value_pointer (struct value *value, struct type *type)
4555 struct gdbarch *gdbarch = get_type_arch (type);
4556 unsigned len = TYPE_LENGTH (type);
4557 gdb_byte *buf = (gdb_byte *) alloca (len);
4560 addr = value_address (value);
4561 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4562 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4567 /* Push a descriptor of type TYPE for array value ARR on the stack at
4568 *SP, updating *SP to reflect the new descriptor. Return either
4569 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4570 to-descriptor type rather than a descriptor type), a struct value *
4571 representing a pointer to this descriptor. */
4573 static struct value *
4574 make_array_descriptor (struct type *type, struct value *arr)
4576 struct type *bounds_type = desc_bounds_type (type);
4577 struct type *desc_type = desc_base_type (type);
4578 struct value *descriptor = allocate_value (desc_type);
4579 struct value *bounds = allocate_value (bounds_type);
4582 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4585 modify_field (value_type (bounds), value_contents_writeable (bounds),
4586 ada_array_bound (arr, i, 0),
4587 desc_bound_bitpos (bounds_type, i, 0),
4588 desc_bound_bitsize (bounds_type, i, 0));
4589 modify_field (value_type (bounds), value_contents_writeable (bounds),
4590 ada_array_bound (arr, i, 1),
4591 desc_bound_bitpos (bounds_type, i, 1),
4592 desc_bound_bitsize (bounds_type, i, 1));
4595 bounds = ensure_lval (bounds);
4597 modify_field (value_type (descriptor),
4598 value_contents_writeable (descriptor),
4599 value_pointer (ensure_lval (arr),
4600 TYPE_FIELD_TYPE (desc_type, 0)),
4601 fat_pntr_data_bitpos (desc_type),
4602 fat_pntr_data_bitsize (desc_type));
4604 modify_field (value_type (descriptor),
4605 value_contents_writeable (descriptor),
4606 value_pointer (bounds,
4607 TYPE_FIELD_TYPE (desc_type, 1)),
4608 fat_pntr_bounds_bitpos (desc_type),
4609 fat_pntr_bounds_bitsize (desc_type));
4611 descriptor = ensure_lval (descriptor);
4613 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4614 return value_addr (descriptor);
4619 /* Symbol Cache Module */
4621 /* Performance measurements made as of 2010-01-15 indicate that
4622 this cache does bring some noticeable improvements. Depending
4623 on the type of entity being printed, the cache can make it as much
4624 as an order of magnitude faster than without it.
4626 The descriptive type DWARF extension has significantly reduced
4627 the need for this cache, at least when DWARF is being used. However,
4628 even in this case, some expensive name-based symbol searches are still
4629 sometimes necessary - to find an XVZ variable, mostly. */
4631 /* Initialize the contents of SYM_CACHE. */
4634 ada_init_symbol_cache (struct ada_symbol_cache *sym_cache)
4636 obstack_init (&sym_cache->cache_space);
4637 memset (sym_cache->root, '\000', sizeof (sym_cache->root));
4640 /* Free the memory used by SYM_CACHE. */
4643 ada_free_symbol_cache (struct ada_symbol_cache *sym_cache)
4645 obstack_free (&sym_cache->cache_space, NULL);
4649 /* Return the symbol cache associated to the given program space PSPACE.
4650 If not allocated for this PSPACE yet, allocate and initialize one. */
4652 static struct ada_symbol_cache *
4653 ada_get_symbol_cache (struct program_space *pspace)
4655 struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace);
4657 if (pspace_data->sym_cache == NULL)
4659 pspace_data->sym_cache = XCNEW (struct ada_symbol_cache);
4660 ada_init_symbol_cache (pspace_data->sym_cache);
4663 return pspace_data->sym_cache;
4666 /* Clear all entries from the symbol cache. */
4669 ada_clear_symbol_cache (void)
4671 struct ada_symbol_cache *sym_cache
4672 = ada_get_symbol_cache (current_program_space);
4674 obstack_free (&sym_cache->cache_space, NULL);
4675 ada_init_symbol_cache (sym_cache);
4678 /* Search our cache for an entry matching NAME and DOMAIN.
4679 Return it if found, or NULL otherwise. */
4681 static struct cache_entry **
4682 find_entry (const char *name, domain_enum domain)
4684 struct ada_symbol_cache *sym_cache
4685 = ada_get_symbol_cache (current_program_space);
4686 int h = msymbol_hash (name) % HASH_SIZE;
4687 struct cache_entry **e;
4689 for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next)
4691 if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0)
4697 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4698 Return 1 if found, 0 otherwise.
4700 If an entry was found and SYM is not NULL, set *SYM to the entry's
4701 SYM. Same principle for BLOCK if not NULL. */
4704 lookup_cached_symbol (const char *name, domain_enum domain,
4705 struct symbol **sym, const struct block **block)
4707 struct cache_entry **e = find_entry (name, domain);
4714 *block = (*e)->block;
4718 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4719 in domain DOMAIN, save this result in our symbol cache. */
4722 cache_symbol (const char *name, domain_enum domain, struct symbol *sym,
4723 const struct block *block)
4725 struct ada_symbol_cache *sym_cache
4726 = ada_get_symbol_cache (current_program_space);
4729 struct cache_entry *e;
4731 /* Symbols for builtin types don't have a block.
4732 For now don't cache such symbols. */
4733 if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym))
4736 /* If the symbol is a local symbol, then do not cache it, as a search
4737 for that symbol depends on the context. To determine whether
4738 the symbol is local or not, we check the block where we found it
4739 against the global and static blocks of its associated symtab. */
4741 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
4742 GLOBAL_BLOCK) != block
4743 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
4744 STATIC_BLOCK) != block)
4747 h = msymbol_hash (name) % HASH_SIZE;
4748 e = XOBNEW (&sym_cache->cache_space, cache_entry);
4749 e->next = sym_cache->root[h];
4750 sym_cache->root[h] = e;
4752 = (char *) obstack_alloc (&sym_cache->cache_space, strlen (name) + 1);
4753 strcpy (copy, name);
4761 /* Return the symbol name match type that should be used used when
4762 searching for all symbols matching LOOKUP_NAME.
4764 LOOKUP_NAME is expected to be a symbol name after transformation
4767 static symbol_name_match_type
4768 name_match_type_from_name (const char *lookup_name)
4770 return (strstr (lookup_name, "__") == NULL
4771 ? symbol_name_match_type::WILD
4772 : symbol_name_match_type::FULL);
4775 /* Return the result of a standard (literal, C-like) lookup of NAME in
4776 given DOMAIN, visible from lexical block BLOCK. */
4778 static struct symbol *
4779 standard_lookup (const char *name, const struct block *block,
4782 /* Initialize it just to avoid a GCC false warning. */
4783 struct block_symbol sym = {NULL, NULL};
4785 if (lookup_cached_symbol (name, domain, &sym.symbol, NULL))
4787 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4788 cache_symbol (name, domain, sym.symbol, sym.block);
4793 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4794 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4795 since they contend in overloading in the same way. */
4797 is_nonfunction (struct block_symbol syms[], int n)
4801 for (i = 0; i < n; i += 1)
4802 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC
4803 && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM
4804 || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST))
4810 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4811 struct types. Otherwise, they may not. */
4814 equiv_types (struct type *type0, struct type *type1)
4818 if (type0 == NULL || type1 == NULL
4819 || TYPE_CODE (type0) != TYPE_CODE (type1))
4821 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4822 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4823 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4824 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4830 /* True iff SYM0 represents the same entity as SYM1, or one that is
4831 no more defined than that of SYM1. */
4834 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4838 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4839 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4842 switch (SYMBOL_CLASS (sym0))
4848 struct type *type0 = SYMBOL_TYPE (sym0);
4849 struct type *type1 = SYMBOL_TYPE (sym1);
4850 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4851 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4852 int len0 = strlen (name0);
4855 TYPE_CODE (type0) == TYPE_CODE (type1)
4856 && (equiv_types (type0, type1)
4857 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4858 && startswith (name1 + len0, "___XV")));
4861 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4862 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4868 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4869 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4872 add_defn_to_vec (struct obstack *obstackp,
4874 const struct block *block)
4877 struct block_symbol *prevDefns = defns_collected (obstackp, 0);
4879 /* Do not try to complete stub types, as the debugger is probably
4880 already scanning all symbols matching a certain name at the
4881 time when this function is called. Trying to replace the stub
4882 type by its associated full type will cause us to restart a scan
4883 which may lead to an infinite recursion. Instead, the client
4884 collecting the matching symbols will end up collecting several
4885 matches, with at least one of them complete. It can then filter
4886 out the stub ones if needed. */
4888 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4890 if (lesseq_defined_than (sym, prevDefns[i].symbol))
4892 else if (lesseq_defined_than (prevDefns[i].symbol, sym))
4894 prevDefns[i].symbol = sym;
4895 prevDefns[i].block = block;
4901 struct block_symbol info;
4905 obstack_grow (obstackp, &info, sizeof (struct block_symbol));
4909 /* Number of block_symbol structures currently collected in current vector in
4913 num_defns_collected (struct obstack *obstackp)
4915 return obstack_object_size (obstackp) / sizeof (struct block_symbol);
4918 /* Vector of block_symbol structures currently collected in current vector in
4919 OBSTACKP. If FINISH, close off the vector and return its final address. */
4921 static struct block_symbol *
4922 defns_collected (struct obstack *obstackp, int finish)
4925 return (struct block_symbol *) obstack_finish (obstackp);
4927 return (struct block_symbol *) obstack_base (obstackp);
4930 /* Return a bound minimal symbol matching NAME according to Ada
4931 decoding rules. Returns an invalid symbol if there is no such
4932 minimal symbol. Names prefixed with "standard__" are handled
4933 specially: "standard__" is first stripped off, and only static and
4934 global symbols are searched. */
4936 struct bound_minimal_symbol
4937 ada_lookup_simple_minsym (const char *name)
4939 struct bound_minimal_symbol result;
4940 struct objfile *objfile;
4941 struct minimal_symbol *msymbol;
4943 memset (&result, 0, sizeof (result));
4945 symbol_name_match_type match_type = name_match_type_from_name (name);
4946 lookup_name_info lookup_name (name, match_type);
4948 symbol_name_matcher_ftype *match_name
4949 = ada_get_symbol_name_matcher (lookup_name);
4951 ALL_MSYMBOLS (objfile, msymbol)
4953 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), lookup_name, NULL)
4954 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4956 result.minsym = msymbol;
4957 result.objfile = objfile;
4965 /* For all subprograms that statically enclose the subprogram of the
4966 selected frame, add symbols matching identifier NAME in DOMAIN
4967 and their blocks to the list of data in OBSTACKP, as for
4968 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4969 with a wildcard prefix. */
4972 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4973 const lookup_name_info &lookup_name,
4978 /* True if TYPE is definitely an artificial type supplied to a symbol
4979 for which no debugging information was given in the symbol file. */
4982 is_nondebugging_type (struct type *type)
4984 const char *name = ada_type_name (type);
4986 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4989 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4990 that are deemed "identical" for practical purposes.
4992 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4993 types and that their number of enumerals is identical (in other
4994 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4997 ada_identical_enum_types_p (struct type *type1, struct type *type2)
5001 /* The heuristic we use here is fairly conservative. We consider
5002 that 2 enumerate types are identical if they have the same
5003 number of enumerals and that all enumerals have the same
5004 underlying value and name. */
5006 /* All enums in the type should have an identical underlying value. */
5007 for (i = 0; i < TYPE_NFIELDS (type1); i++)
5008 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
5011 /* All enumerals should also have the same name (modulo any numerical
5013 for (i = 0; i < TYPE_NFIELDS (type1); i++)
5015 const char *name_1 = TYPE_FIELD_NAME (type1, i);
5016 const char *name_2 = TYPE_FIELD_NAME (type2, i);
5017 int len_1 = strlen (name_1);
5018 int len_2 = strlen (name_2);
5020 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
5021 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
5023 || strncmp (TYPE_FIELD_NAME (type1, i),
5024 TYPE_FIELD_NAME (type2, i),
5032 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5033 that are deemed "identical" for practical purposes. Sometimes,
5034 enumerals are not strictly identical, but their types are so similar
5035 that they can be considered identical.
5037 For instance, consider the following code:
5039 type Color is (Black, Red, Green, Blue, White);
5040 type RGB_Color is new Color range Red .. Blue;
5042 Type RGB_Color is a subrange of an implicit type which is a copy
5043 of type Color. If we call that implicit type RGB_ColorB ("B" is
5044 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5045 As a result, when an expression references any of the enumeral
5046 by name (Eg. "print green"), the expression is technically
5047 ambiguous and the user should be asked to disambiguate. But
5048 doing so would only hinder the user, since it wouldn't matter
5049 what choice he makes, the outcome would always be the same.
5050 So, for practical purposes, we consider them as the same. */
5053 symbols_are_identical_enums (const std::vector<struct block_symbol> &syms)
5057 /* Before performing a thorough comparison check of each type,
5058 we perform a series of inexpensive checks. We expect that these
5059 checks will quickly fail in the vast majority of cases, and thus
5060 help prevent the unnecessary use of a more expensive comparison.
5061 Said comparison also expects us to make some of these checks
5062 (see ada_identical_enum_types_p). */
5064 /* Quick check: All symbols should have an enum type. */
5065 for (i = 0; i < syms.size (); i++)
5066 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM)
5069 /* Quick check: They should all have the same value. */
5070 for (i = 1; i < syms.size (); i++)
5071 if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol))
5074 /* Quick check: They should all have the same number of enumerals. */
5075 for (i = 1; i < syms.size (); i++)
5076 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol))
5077 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol)))
5080 /* All the sanity checks passed, so we might have a set of
5081 identical enumeration types. Perform a more complete
5082 comparison of the type of each symbol. */
5083 for (i = 1; i < syms.size (); i++)
5084 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol),
5085 SYMBOL_TYPE (syms[0].symbol)))
5091 /* Remove any non-debugging symbols in SYMS that definitely
5092 duplicate other symbols in the list (The only case I know of where
5093 this happens is when object files containing stabs-in-ecoff are
5094 linked with files containing ordinary ecoff debugging symbols (or no
5095 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5096 Returns the number of items in the modified list. */
5099 remove_extra_symbols (std::vector<struct block_symbol> *syms)
5103 /* We should never be called with less than 2 symbols, as there
5104 cannot be any extra symbol in that case. But it's easy to
5105 handle, since we have nothing to do in that case. */
5106 if (syms->size () < 2)
5107 return syms->size ();
5110 while (i < syms->size ())
5114 /* If two symbols have the same name and one of them is a stub type,
5115 the get rid of the stub. */
5117 if (TYPE_STUB (SYMBOL_TYPE ((*syms)[i].symbol))
5118 && SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL)
5120 for (j = 0; j < syms->size (); j++)
5123 && !TYPE_STUB (SYMBOL_TYPE ((*syms)[j].symbol))
5124 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5125 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5126 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0)
5131 /* Two symbols with the same name, same class and same address
5132 should be identical. */
5134 else if (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL
5135 && SYMBOL_CLASS ((*syms)[i].symbol) == LOC_STATIC
5136 && is_nondebugging_type (SYMBOL_TYPE ((*syms)[i].symbol)))
5138 for (j = 0; j < syms->size (); j += 1)
5141 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5142 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5143 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0
5144 && SYMBOL_CLASS ((*syms)[i].symbol)
5145 == SYMBOL_CLASS ((*syms)[j].symbol)
5146 && SYMBOL_VALUE_ADDRESS ((*syms)[i].symbol)
5147 == SYMBOL_VALUE_ADDRESS ((*syms)[j].symbol))
5153 syms->erase (syms->begin () + i);
5158 /* If all the remaining symbols are identical enumerals, then
5159 just keep the first one and discard the rest.
5161 Unlike what we did previously, we do not discard any entry
5162 unless they are ALL identical. This is because the symbol
5163 comparison is not a strict comparison, but rather a practical
5164 comparison. If all symbols are considered identical, then
5165 we can just go ahead and use the first one and discard the rest.
5166 But if we cannot reduce the list to a single element, we have
5167 to ask the user to disambiguate anyways. And if we have to
5168 present a multiple-choice menu, it's less confusing if the list
5169 isn't missing some choices that were identical and yet distinct. */
5170 if (symbols_are_identical_enums (*syms))
5173 return syms->size ();
5176 /* Given a type that corresponds to a renaming entity, use the type name
5177 to extract the scope (package name or function name, fully qualified,
5178 and following the GNAT encoding convention) where this renaming has been
5182 xget_renaming_scope (struct type *renaming_type)
5184 /* The renaming types adhere to the following convention:
5185 <scope>__<rename>___<XR extension>.
5186 So, to extract the scope, we search for the "___XR" extension,
5187 and then backtrack until we find the first "__". */
5189 const char *name = TYPE_NAME (renaming_type);
5190 const char *suffix = strstr (name, "___XR");
5193 /* Now, backtrack a bit until we find the first "__". Start looking
5194 at suffix - 3, as the <rename> part is at least one character long. */
5196 for (last = suffix - 3; last > name; last--)
5197 if (last[0] == '_' && last[1] == '_')
5200 /* Make a copy of scope and return it. */
5201 return std::string (name, last);
5204 /* Return nonzero if NAME corresponds to a package name. */
5207 is_package_name (const char *name)
5209 /* Here, We take advantage of the fact that no symbols are generated
5210 for packages, while symbols are generated for each function.
5211 So the condition for NAME represent a package becomes equivalent
5212 to NAME not existing in our list of symbols. There is only one
5213 small complication with library-level functions (see below). */
5215 /* If it is a function that has not been defined at library level,
5216 then we should be able to look it up in the symbols. */
5217 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
5220 /* Library-level function names start with "_ada_". See if function
5221 "_ada_" followed by NAME can be found. */
5223 /* Do a quick check that NAME does not contain "__", since library-level
5224 functions names cannot contain "__" in them. */
5225 if (strstr (name, "__") != NULL)
5228 std::string fun_name = string_printf ("_ada_%s", name);
5230 return (standard_lookup (fun_name.c_str (), NULL, VAR_DOMAIN) == NULL);
5233 /* Return nonzero if SYM corresponds to a renaming entity that is
5234 not visible from FUNCTION_NAME. */
5237 old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
5239 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
5242 std::string scope = xget_renaming_scope (SYMBOL_TYPE (sym));
5244 /* If the rename has been defined in a package, then it is visible. */
5245 if (is_package_name (scope.c_str ()))
5248 /* Check that the rename is in the current function scope by checking
5249 that its name starts with SCOPE. */
5251 /* If the function name starts with "_ada_", it means that it is
5252 a library-level function. Strip this prefix before doing the
5253 comparison, as the encoding for the renaming does not contain
5255 if (startswith (function_name, "_ada_"))
5258 return !startswith (function_name, scope.c_str ());
5261 /* Remove entries from SYMS that corresponds to a renaming entity that
5262 is not visible from the function associated with CURRENT_BLOCK or
5263 that is superfluous due to the presence of more specific renaming
5264 information. Places surviving symbols in the initial entries of
5265 SYMS and returns the number of surviving symbols.
5268 First, in cases where an object renaming is implemented as a
5269 reference variable, GNAT may produce both the actual reference
5270 variable and the renaming encoding. In this case, we discard the
5273 Second, GNAT emits a type following a specified encoding for each renaming
5274 entity. Unfortunately, STABS currently does not support the definition
5275 of types that are local to a given lexical block, so all renamings types
5276 are emitted at library level. As a consequence, if an application
5277 contains two renaming entities using the same name, and a user tries to
5278 print the value of one of these entities, the result of the ada symbol
5279 lookup will also contain the wrong renaming type.
5281 This function partially covers for this limitation by attempting to
5282 remove from the SYMS list renaming symbols that should be visible
5283 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5284 method with the current information available. The implementation
5285 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5287 - When the user tries to print a rename in a function while there
5288 is another rename entity defined in a package: Normally, the
5289 rename in the function has precedence over the rename in the
5290 package, so the latter should be removed from the list. This is
5291 currently not the case.
5293 - This function will incorrectly remove valid renames if
5294 the CURRENT_BLOCK corresponds to a function which symbol name
5295 has been changed by an "Export" pragma. As a consequence,
5296 the user will be unable to print such rename entities. */
5299 remove_irrelevant_renamings (std::vector<struct block_symbol> *syms,
5300 const struct block *current_block)
5302 struct symbol *current_function;
5303 const char *current_function_name;
5305 int is_new_style_renaming;
5307 /* If there is both a renaming foo___XR... encoded as a variable and
5308 a simple variable foo in the same block, discard the latter.
5309 First, zero out such symbols, then compress. */
5310 is_new_style_renaming = 0;
5311 for (i = 0; i < syms->size (); i += 1)
5313 struct symbol *sym = (*syms)[i].symbol;
5314 const struct block *block = (*syms)[i].block;
5318 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
5320 name = SYMBOL_LINKAGE_NAME (sym);
5321 suffix = strstr (name, "___XR");
5325 int name_len = suffix - name;
5328 is_new_style_renaming = 1;
5329 for (j = 0; j < syms->size (); j += 1)
5330 if (i != j && (*syms)[j].symbol != NULL
5331 && strncmp (name, SYMBOL_LINKAGE_NAME ((*syms)[j].symbol),
5333 && block == (*syms)[j].block)
5334 (*syms)[j].symbol = NULL;
5337 if (is_new_style_renaming)
5341 for (j = k = 0; j < syms->size (); j += 1)
5342 if ((*syms)[j].symbol != NULL)
5344 (*syms)[k] = (*syms)[j];
5350 /* Extract the function name associated to CURRENT_BLOCK.
5351 Abort if unable to do so. */
5353 if (current_block == NULL)
5354 return syms->size ();
5356 current_function = block_linkage_function (current_block);
5357 if (current_function == NULL)
5358 return syms->size ();
5360 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
5361 if (current_function_name == NULL)
5362 return syms->size ();
5364 /* Check each of the symbols, and remove it from the list if it is
5365 a type corresponding to a renaming that is out of the scope of
5366 the current block. */
5369 while (i < syms->size ())
5371 if (ada_parse_renaming ((*syms)[i].symbol, NULL, NULL, NULL)
5372 == ADA_OBJECT_RENAMING
5373 && old_renaming_is_invisible ((*syms)[i].symbol,
5374 current_function_name))
5375 syms->erase (syms->begin () + i);
5380 return syms->size ();
5383 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5384 whose name and domain match NAME and DOMAIN respectively.
5385 If no match was found, then extend the search to "enclosing"
5386 routines (in other words, if we're inside a nested function,
5387 search the symbols defined inside the enclosing functions).
5388 If WILD_MATCH_P is nonzero, perform the naming matching in
5389 "wild" mode (see function "wild_match" for more info).
5391 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5394 ada_add_local_symbols (struct obstack *obstackp,
5395 const lookup_name_info &lookup_name,
5396 const struct block *block, domain_enum domain)
5398 int block_depth = 0;
5400 while (block != NULL)
5403 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
5405 /* If we found a non-function match, assume that's the one. */
5406 if (is_nonfunction (defns_collected (obstackp, 0),
5407 num_defns_collected (obstackp)))
5410 block = BLOCK_SUPERBLOCK (block);
5413 /* If no luck so far, try to find NAME as a local symbol in some lexically
5414 enclosing subprogram. */
5415 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
5416 add_symbols_from_enclosing_procs (obstackp, lookup_name, domain);
5419 /* An object of this type is used as the user_data argument when
5420 calling the map_matching_symbols method. */
5424 struct objfile *objfile;
5425 struct obstack *obstackp;
5426 struct symbol *arg_sym;
5430 /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
5431 to a list of symbols. DATA0 is a pointer to a struct match_data *
5432 containing the obstack that collects the symbol list, the file that SYM
5433 must come from, a flag indicating whether a non-argument symbol has
5434 been found in the current block, and the last argument symbol
5435 passed in SYM within the current block (if any). When SYM is null,
5436 marking the end of a block, the argument symbol is added if no
5437 other has been found. */
5440 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
5442 struct match_data *data = (struct match_data *) data0;
5446 if (!data->found_sym && data->arg_sym != NULL)
5447 add_defn_to_vec (data->obstackp,
5448 fixup_symbol_section (data->arg_sym, data->objfile),
5450 data->found_sym = 0;
5451 data->arg_sym = NULL;
5455 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5457 else if (SYMBOL_IS_ARGUMENT (sym))
5458 data->arg_sym = sym;
5461 data->found_sym = 1;
5462 add_defn_to_vec (data->obstackp,
5463 fixup_symbol_section (sym, data->objfile),
5470 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5471 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5472 symbols to OBSTACKP. Return whether we found such symbols. */
5475 ada_add_block_renamings (struct obstack *obstackp,
5476 const struct block *block,
5477 const lookup_name_info &lookup_name,
5480 struct using_direct *renaming;
5481 int defns_mark = num_defns_collected (obstackp);
5483 symbol_name_matcher_ftype *name_match
5484 = ada_get_symbol_name_matcher (lookup_name);
5486 for (renaming = block_using (block);
5488 renaming = renaming->next)
5492 /* Avoid infinite recursions: skip this renaming if we are actually
5493 already traversing it.
5495 Currently, symbol lookup in Ada don't use the namespace machinery from
5496 C++/Fortran support: skip namespace imports that use them. */
5497 if (renaming->searched
5498 || (renaming->import_src != NULL
5499 && renaming->import_src[0] != '\0')
5500 || (renaming->import_dest != NULL
5501 && renaming->import_dest[0] != '\0'))
5503 renaming->searched = 1;
5505 /* TODO: here, we perform another name-based symbol lookup, which can
5506 pull its own multiple overloads. In theory, we should be able to do
5507 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5508 not a simple name. But in order to do this, we would need to enhance
5509 the DWARF reader to associate a symbol to this renaming, instead of a
5510 name. So, for now, we do something simpler: re-use the C++/Fortran
5511 namespace machinery. */
5512 r_name = (renaming->alias != NULL
5514 : renaming->declaration);
5515 if (name_match (r_name, lookup_name, NULL))
5517 lookup_name_info decl_lookup_name (renaming->declaration,
5518 lookup_name.match_type ());
5519 ada_add_all_symbols (obstackp, block, decl_lookup_name, domain,
5522 renaming->searched = 0;
5524 return num_defns_collected (obstackp) != defns_mark;
5527 /* Implements compare_names, but only applying the comparision using
5528 the given CASING. */
5531 compare_names_with_case (const char *string1, const char *string2,
5532 enum case_sensitivity casing)
5534 while (*string1 != '\0' && *string2 != '\0')
5538 if (isspace (*string1) || isspace (*string2))
5539 return strcmp_iw_ordered (string1, string2);
5541 if (casing == case_sensitive_off)
5543 c1 = tolower (*string1);
5544 c2 = tolower (*string2);
5561 return strcmp_iw_ordered (string1, string2);
5563 if (*string2 == '\0')
5565 if (is_name_suffix (string1))
5572 if (*string2 == '(')
5573 return strcmp_iw_ordered (string1, string2);
5576 if (casing == case_sensitive_off)
5577 return tolower (*string1) - tolower (*string2);
5579 return *string1 - *string2;
5584 /* Compare STRING1 to STRING2, with results as for strcmp.
5585 Compatible with strcmp_iw_ordered in that...
5587 strcmp_iw_ordered (STRING1, STRING2) <= 0
5591 compare_names (STRING1, STRING2) <= 0
5593 (they may differ as to what symbols compare equal). */
5596 compare_names (const char *string1, const char *string2)
5600 /* Similar to what strcmp_iw_ordered does, we need to perform
5601 a case-insensitive comparison first, and only resort to
5602 a second, case-sensitive, comparison if the first one was
5603 not sufficient to differentiate the two strings. */
5605 result = compare_names_with_case (string1, string2, case_sensitive_off);
5607 result = compare_names_with_case (string1, string2, case_sensitive_on);
5612 /* Convenience function to get at the Ada encoded lookup name for
5613 LOOKUP_NAME, as a C string. */
5616 ada_lookup_name (const lookup_name_info &lookup_name)
5618 return lookup_name.ada ().lookup_name ().c_str ();
5621 /* Add to OBSTACKP all non-local symbols whose name and domain match
5622 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5623 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5624 symbols otherwise. */
5627 add_nonlocal_symbols (struct obstack *obstackp,
5628 const lookup_name_info &lookup_name,
5629 domain_enum domain, int global)
5631 struct objfile *objfile;
5632 struct compunit_symtab *cu;
5633 struct match_data data;
5635 memset (&data, 0, sizeof data);
5636 data.obstackp = obstackp;
5638 bool is_wild_match = lookup_name.ada ().wild_match_p ();
5640 ALL_OBJFILES (objfile)
5642 data.objfile = objfile;
5645 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5647 aux_add_nonlocal_symbols, &data,
5648 symbol_name_match_type::WILD,
5651 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5653 aux_add_nonlocal_symbols, &data,
5654 symbol_name_match_type::FULL,
5657 ALL_OBJFILE_COMPUNITS (objfile, cu)
5659 const struct block *global_block
5660 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK);
5662 if (ada_add_block_renamings (obstackp, global_block, lookup_name,
5668 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5670 const char *name = ada_lookup_name (lookup_name);
5671 std::string name1 = std::string ("<_ada_") + name + '>';
5673 ALL_OBJFILES (objfile)
5675 data.objfile = objfile;
5676 objfile->sf->qf->map_matching_symbols (objfile, name1.c_str (),
5678 aux_add_nonlocal_symbols,
5680 symbol_name_match_type::FULL,
5686 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5687 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5688 returning the number of matches. Add these to OBSTACKP.
5690 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5691 symbol match within the nest of blocks whose innermost member is BLOCK,
5692 is the one match returned (no other matches in that or
5693 enclosing blocks is returned). If there are any matches in or
5694 surrounding BLOCK, then these alone are returned.
5696 Names prefixed with "standard__" are handled specially:
5697 "standard__" is first stripped off (by the lookup_name
5698 constructor), and only static and global symbols are searched.
5700 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5701 to lookup global symbols. */
5704 ada_add_all_symbols (struct obstack *obstackp,
5705 const struct block *block,
5706 const lookup_name_info &lookup_name,
5709 int *made_global_lookup_p)
5713 if (made_global_lookup_p)
5714 *made_global_lookup_p = 0;
5716 /* Special case: If the user specifies a symbol name inside package
5717 Standard, do a non-wild matching of the symbol name without
5718 the "standard__" prefix. This was primarily introduced in order
5719 to allow the user to specifically access the standard exceptions
5720 using, for instance, Standard.Constraint_Error when Constraint_Error
5721 is ambiguous (due to the user defining its own Constraint_Error
5722 entity inside its program). */
5723 if (lookup_name.ada ().standard_p ())
5726 /* Check the non-global symbols. If we have ANY match, then we're done. */
5731 ada_add_local_symbols (obstackp, lookup_name, block, domain);
5734 /* In the !full_search case we're are being called by
5735 ada_iterate_over_symbols, and we don't want to search
5737 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
5739 if (num_defns_collected (obstackp) > 0 || !full_search)
5743 /* No non-global symbols found. Check our cache to see if we have
5744 already performed this search before. If we have, then return
5747 if (lookup_cached_symbol (ada_lookup_name (lookup_name),
5748 domain, &sym, &block))
5751 add_defn_to_vec (obstackp, sym, block);
5755 if (made_global_lookup_p)
5756 *made_global_lookup_p = 1;
5758 /* Search symbols from all global blocks. */
5760 add_nonlocal_symbols (obstackp, lookup_name, domain, 1);
5762 /* Now add symbols from all per-file blocks if we've gotten no hits
5763 (not strictly correct, but perhaps better than an error). */
5765 if (num_defns_collected (obstackp) == 0)
5766 add_nonlocal_symbols (obstackp, lookup_name, domain, 0);
5769 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5770 is non-zero, enclosing scope and in global scopes, returning the number of
5772 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5773 found and the blocks and symbol tables (if any) in which they were
5776 When full_search is non-zero, any non-function/non-enumeral
5777 symbol match within the nest of blocks whose innermost member is BLOCK,
5778 is the one match returned (no other matches in that or
5779 enclosing blocks is returned). If there are any matches in or
5780 surrounding BLOCK, then these alone are returned.
5782 Names prefixed with "standard__" are handled specially: "standard__"
5783 is first stripped off, and only static and global symbols are searched. */
5786 ada_lookup_symbol_list_worker (const lookup_name_info &lookup_name,
5787 const struct block *block,
5789 std::vector<struct block_symbol> *results,
5792 int syms_from_global_search;
5794 auto_obstack obstack;
5796 ada_add_all_symbols (&obstack, block, lookup_name,
5797 domain, full_search, &syms_from_global_search);
5799 ndefns = num_defns_collected (&obstack);
5801 struct block_symbol *base = defns_collected (&obstack, 1);
5802 for (int i = 0; i < ndefns; ++i)
5803 results->push_back (base[i]);
5805 ndefns = remove_extra_symbols (results);
5807 if (ndefns == 0 && full_search && syms_from_global_search)
5808 cache_symbol (ada_lookup_name (lookup_name), domain, NULL, NULL);
5810 if (ndefns == 1 && full_search && syms_from_global_search)
5811 cache_symbol (ada_lookup_name (lookup_name), domain,
5812 (*results)[0].symbol, (*results)[0].block);
5814 ndefns = remove_irrelevant_renamings (results, block);
5819 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5820 in global scopes, returning the number of matches, and filling *RESULTS
5821 with (SYM,BLOCK) tuples.
5823 See ada_lookup_symbol_list_worker for further details. */
5826 ada_lookup_symbol_list (const char *name, const struct block *block,
5828 std::vector<struct block_symbol> *results)
5830 symbol_name_match_type name_match_type = name_match_type_from_name (name);
5831 lookup_name_info lookup_name (name, name_match_type);
5833 return ada_lookup_symbol_list_worker (lookup_name, block, domain, results, 1);
5836 /* Implementation of the la_iterate_over_symbols method. */
5839 ada_iterate_over_symbols
5840 (const struct block *block, const lookup_name_info &name,
5842 gdb::function_view<symbol_found_callback_ftype> callback)
5845 std::vector<struct block_symbol> results;
5847 ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0);
5849 for (i = 0; i < ndefs; ++i)
5851 if (!callback (&results[i]))
5856 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5857 to 1, but choosing the first symbol found if there are multiple
5860 The result is stored in *INFO, which must be non-NULL.
5861 If no match is found, INFO->SYM is set to NULL. */
5864 ada_lookup_encoded_symbol (const char *name, const struct block *block,
5866 struct block_symbol *info)
5868 /* Since we already have an encoded name, wrap it in '<>' to force a
5869 verbatim match. Otherwise, if the name happens to not look like
5870 an encoded name (because it doesn't include a "__"),
5871 ada_lookup_name_info would re-encode/fold it again, and that
5872 would e.g., incorrectly lowercase object renaming names like
5873 "R28b" -> "r28b". */
5874 std::string verbatim = std::string ("<") + name + '>';
5876 gdb_assert (info != NULL);
5877 *info = ada_lookup_symbol (verbatim.c_str (), block, domain, NULL);
5880 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5881 scope and in global scopes, or NULL if none. NAME is folded and
5882 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5883 choosing the first symbol if there are multiple choices.
5884 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5887 ada_lookup_symbol (const char *name, const struct block *block0,
5888 domain_enum domain, int *is_a_field_of_this)
5890 if (is_a_field_of_this != NULL)
5891 *is_a_field_of_this = 0;
5893 std::vector<struct block_symbol> candidates;
5896 n_candidates = ada_lookup_symbol_list (name, block0, domain, &candidates);
5898 if (n_candidates == 0)
5901 block_symbol info = candidates[0];
5902 info.symbol = fixup_symbol_section (info.symbol, NULL);
5906 static struct block_symbol
5907 ada_lookup_symbol_nonlocal (const struct language_defn *langdef,
5909 const struct block *block,
5910 const domain_enum domain)
5912 struct block_symbol sym;
5914 sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5915 if (sym.symbol != NULL)
5918 /* If we haven't found a match at this point, try the primitive
5919 types. In other languages, this search is performed before
5920 searching for global symbols in order to short-circuit that
5921 global-symbol search if it happens that the name corresponds
5922 to a primitive type. But we cannot do the same in Ada, because
5923 it is perfectly legitimate for a program to declare a type which
5924 has the same name as a standard type. If looking up a type in
5925 that situation, we have traditionally ignored the primitive type
5926 in favor of user-defined types. This is why, unlike most other
5927 languages, we search the primitive types this late and only after
5928 having searched the global symbols without success. */
5930 if (domain == VAR_DOMAIN)
5932 struct gdbarch *gdbarch;
5935 gdbarch = target_gdbarch ();
5937 gdbarch = block_gdbarch (block);
5938 sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name);
5939 if (sym.symbol != NULL)
5943 return (struct block_symbol) {NULL, NULL};
5947 /* True iff STR is a possible encoded suffix of a normal Ada name
5948 that is to be ignored for matching purposes. Suffixes of parallel
5949 names (e.g., XVE) are not included here. Currently, the possible suffixes
5950 are given by any of the regular expressions:
5952 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5953 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5954 TKB [subprogram suffix for task bodies]
5955 _E[0-9]+[bs]$ [protected object entry suffixes]
5956 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5958 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5959 match is performed. This sequence is used to differentiate homonyms,
5960 is an optional part of a valid name suffix. */
5963 is_name_suffix (const char *str)
5966 const char *matching;
5967 const int len = strlen (str);
5969 /* Skip optional leading __[0-9]+. */
5971 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5974 while (isdigit (str[0]))
5980 if (str[0] == '.' || str[0] == '$')
5983 while (isdigit (matching[0]))
5985 if (matching[0] == '\0')
5991 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5994 while (isdigit (matching[0]))
5996 if (matching[0] == '\0')
6000 /* "TKB" suffixes are used for subprograms implementing task bodies. */
6002 if (strcmp (str, "TKB") == 0)
6006 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
6007 with a N at the end. Unfortunately, the compiler uses the same
6008 convention for other internal types it creates. So treating
6009 all entity names that end with an "N" as a name suffix causes
6010 some regressions. For instance, consider the case of an enumerated
6011 type. To support the 'Image attribute, it creates an array whose
6013 Having a single character like this as a suffix carrying some
6014 information is a bit risky. Perhaps we should change the encoding
6015 to be something like "_N" instead. In the meantime, do not do
6016 the following check. */
6017 /* Protected Object Subprograms */
6018 if (len == 1 && str [0] == 'N')
6023 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
6026 while (isdigit (matching[0]))
6028 if ((matching[0] == 'b' || matching[0] == 's')
6029 && matching [1] == '\0')
6033 /* ??? We should not modify STR directly, as we are doing below. This
6034 is fine in this case, but may become problematic later if we find
6035 that this alternative did not work, and want to try matching
6036 another one from the begining of STR. Since we modified it, we
6037 won't be able to find the begining of the string anymore! */
6041 while (str[0] != '_' && str[0] != '\0')
6043 if (str[0] != 'n' && str[0] != 'b')
6049 if (str[0] == '\000')
6054 if (str[1] != '_' || str[2] == '\000')
6058 if (strcmp (str + 3, "JM") == 0)
6060 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6061 the LJM suffix in favor of the JM one. But we will
6062 still accept LJM as a valid suffix for a reasonable
6063 amount of time, just to allow ourselves to debug programs
6064 compiled using an older version of GNAT. */
6065 if (strcmp (str + 3, "LJM") == 0)
6069 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
6070 || str[4] == 'U' || str[4] == 'P')
6072 if (str[4] == 'R' && str[5] != 'T')
6076 if (!isdigit (str[2]))
6078 for (k = 3; str[k] != '\0'; k += 1)
6079 if (!isdigit (str[k]) && str[k] != '_')
6083 if (str[0] == '$' && isdigit (str[1]))
6085 for (k = 2; str[k] != '\0'; k += 1)
6086 if (!isdigit (str[k]) && str[k] != '_')
6093 /* Return non-zero if the string starting at NAME and ending before
6094 NAME_END contains no capital letters. */
6097 is_valid_name_for_wild_match (const char *name0)
6099 const char *decoded_name = ada_decode (name0);
6102 /* If the decoded name starts with an angle bracket, it means that
6103 NAME0 does not follow the GNAT encoding format. It should then
6104 not be allowed as a possible wild match. */
6105 if (decoded_name[0] == '<')
6108 for (i=0; decoded_name[i] != '\0'; i++)
6109 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
6115 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6116 that could start a simple name. Assumes that *NAMEP points into
6117 the string beginning at NAME0. */
6120 advance_wild_match (const char **namep, const char *name0, int target0)
6122 const char *name = *namep;
6132 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
6135 if (name == name0 + 5 && startswith (name0, "_ada"))
6140 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
6141 || name[2] == target0))
6149 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
6159 /* Return true iff NAME encodes a name of the form prefix.PATN.
6160 Ignores any informational suffixes of NAME (i.e., for which
6161 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6165 wild_match (const char *name, const char *patn)
6168 const char *name0 = name;
6172 const char *match = name;
6176 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
6179 if (*p == '\0' && is_name_suffix (name))
6180 return match == name0 || is_valid_name_for_wild_match (name0);
6182 if (name[-1] == '_')
6185 if (!advance_wild_match (&name, name0, *patn))
6190 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6191 any trailing suffixes that encode debugging information or leading
6192 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6193 information that is ignored). */
6196 full_match (const char *sym_name, const char *search_name)
6198 size_t search_name_len = strlen (search_name);
6200 if (strncmp (sym_name, search_name, search_name_len) == 0
6201 && is_name_suffix (sym_name + search_name_len))
6204 if (startswith (sym_name, "_ada_")
6205 && strncmp (sym_name + 5, search_name, search_name_len) == 0
6206 && is_name_suffix (sym_name + search_name_len + 5))
6212 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6213 *defn_symbols, updating the list of symbols in OBSTACKP (if
6214 necessary). OBJFILE is the section containing BLOCK. */
6217 ada_add_block_symbols (struct obstack *obstackp,
6218 const struct block *block,
6219 const lookup_name_info &lookup_name,
6220 domain_enum domain, struct objfile *objfile)
6222 struct block_iterator iter;
6223 /* A matching argument symbol, if any. */
6224 struct symbol *arg_sym;
6225 /* Set true when we find a matching non-argument symbol. */
6231 for (sym = block_iter_match_first (block, lookup_name, &iter);
6233 sym = block_iter_match_next (lookup_name, &iter))
6235 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6236 SYMBOL_DOMAIN (sym), domain))
6238 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6240 if (SYMBOL_IS_ARGUMENT (sym))
6245 add_defn_to_vec (obstackp,
6246 fixup_symbol_section (sym, objfile),
6253 /* Handle renamings. */
6255 if (ada_add_block_renamings (obstackp, block, lookup_name, domain))
6258 if (!found_sym && arg_sym != NULL)
6260 add_defn_to_vec (obstackp,
6261 fixup_symbol_section (arg_sym, objfile),
6265 if (!lookup_name.ada ().wild_match_p ())
6269 const std::string &ada_lookup_name = lookup_name.ada ().lookup_name ();
6270 const char *name = ada_lookup_name.c_str ();
6271 size_t name_len = ada_lookup_name.size ();
6273 ALL_BLOCK_SYMBOLS (block, iter, sym)
6275 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6276 SYMBOL_DOMAIN (sym), domain))
6280 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
6283 cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_");
6285 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
6290 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
6292 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6294 if (SYMBOL_IS_ARGUMENT (sym))
6299 add_defn_to_vec (obstackp,
6300 fixup_symbol_section (sym, objfile),
6308 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6309 They aren't parameters, right? */
6310 if (!found_sym && arg_sym != NULL)
6312 add_defn_to_vec (obstackp,
6313 fixup_symbol_section (arg_sym, objfile),
6320 /* Symbol Completion */
6325 ada_lookup_name_info::matches
6326 (const char *sym_name,
6327 symbol_name_match_type match_type,
6328 completion_match_result *comp_match_res) const
6331 const char *text = m_encoded_name.c_str ();
6332 size_t text_len = m_encoded_name.size ();
6334 /* First, test against the fully qualified name of the symbol. */
6336 if (strncmp (sym_name, text, text_len) == 0)
6339 if (match && !m_encoded_p)
6341 /* One needed check before declaring a positive match is to verify
6342 that iff we are doing a verbatim match, the decoded version
6343 of the symbol name starts with '<'. Otherwise, this symbol name
6344 is not a suitable completion. */
6345 const char *sym_name_copy = sym_name;
6346 bool has_angle_bracket;
6348 sym_name = ada_decode (sym_name);
6349 has_angle_bracket = (sym_name[0] == '<');
6350 match = (has_angle_bracket == m_verbatim_p);
6351 sym_name = sym_name_copy;
6354 if (match && !m_verbatim_p)
6356 /* When doing non-verbatim match, another check that needs to
6357 be done is to verify that the potentially matching symbol name
6358 does not include capital letters, because the ada-mode would
6359 not be able to understand these symbol names without the
6360 angle bracket notation. */
6363 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
6368 /* Second: Try wild matching... */
6370 if (!match && m_wild_match_p)
6372 /* Since we are doing wild matching, this means that TEXT
6373 may represent an unqualified symbol name. We therefore must
6374 also compare TEXT against the unqualified name of the symbol. */
6375 sym_name = ada_unqualified_name (ada_decode (sym_name));
6377 if (strncmp (sym_name, text, text_len) == 0)
6381 /* Finally: If we found a match, prepare the result to return. */
6386 if (comp_match_res != NULL)
6388 std::string &match_str = comp_match_res->match.storage ();
6391 match_str = ada_decode (sym_name);
6395 match_str = add_angle_brackets (sym_name);
6397 match_str = sym_name;
6401 comp_match_res->set_match (match_str.c_str ());
6407 /* Add the list of possible symbol names completing TEXT to TRACKER.
6408 WORD is the entire command on which completion is made. */
6411 ada_collect_symbol_completion_matches (completion_tracker &tracker,
6412 complete_symbol_mode mode,
6413 symbol_name_match_type name_match_type,
6414 const char *text, const char *word,
6415 enum type_code code)
6418 struct compunit_symtab *s;
6419 struct minimal_symbol *msymbol;
6420 struct objfile *objfile;
6421 const struct block *b, *surrounding_static_block = 0;
6422 struct block_iterator iter;
6424 gdb_assert (code == TYPE_CODE_UNDEF);
6426 lookup_name_info lookup_name (text, name_match_type, true);
6428 /* First, look at the partial symtab symbols. */
6429 expand_symtabs_matching (NULL,
6435 /* At this point scan through the misc symbol vectors and add each
6436 symbol you find to the list. Eventually we want to ignore
6437 anything that isn't a text symbol (everything else will be
6438 handled by the psymtab code above). */
6440 ALL_MSYMBOLS (objfile, msymbol)
6444 if (completion_skip_symbol (mode, msymbol))
6447 language symbol_language = MSYMBOL_LANGUAGE (msymbol);
6449 /* Ada minimal symbols won't have their language set to Ada. If
6450 we let completion_list_add_name compare using the
6451 default/C-like matcher, then when completing e.g., symbols in a
6452 package named "pck", we'd match internal Ada symbols like
6453 "pckS", which are invalid in an Ada expression, unless you wrap
6454 them in '<' '>' to request a verbatim match.
6456 Unfortunately, some Ada encoded names successfully demangle as
6457 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6458 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6459 with the wrong language set. Paper over that issue here. */
6460 if (symbol_language == language_auto
6461 || symbol_language == language_cplus)
6462 symbol_language = language_ada;
6464 completion_list_add_name (tracker,
6466 MSYMBOL_LINKAGE_NAME (msymbol),
6467 lookup_name, text, word);
6470 /* Search upwards from currently selected frame (so that we can
6471 complete on local vars. */
6473 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
6475 if (!BLOCK_SUPERBLOCK (b))
6476 surrounding_static_block = b; /* For elmin of dups */
6478 ALL_BLOCK_SYMBOLS (b, iter, sym)
6480 if (completion_skip_symbol (mode, sym))
6483 completion_list_add_name (tracker,
6484 SYMBOL_LANGUAGE (sym),
6485 SYMBOL_LINKAGE_NAME (sym),
6486 lookup_name, text, word);
6490 /* Go through the symtabs and check the externs and statics for
6491 symbols which match. */
6493 ALL_COMPUNITS (objfile, s)
6496 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK);
6497 ALL_BLOCK_SYMBOLS (b, iter, sym)
6499 if (completion_skip_symbol (mode, sym))
6502 completion_list_add_name (tracker,
6503 SYMBOL_LANGUAGE (sym),
6504 SYMBOL_LINKAGE_NAME (sym),
6505 lookup_name, text, word);
6509 ALL_COMPUNITS (objfile, s)
6512 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK);
6513 /* Don't do this block twice. */
6514 if (b == surrounding_static_block)
6516 ALL_BLOCK_SYMBOLS (b, iter, sym)
6518 if (completion_skip_symbol (mode, sym))
6521 completion_list_add_name (tracker,
6522 SYMBOL_LANGUAGE (sym),
6523 SYMBOL_LINKAGE_NAME (sym),
6524 lookup_name, text, word);
6531 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6532 for tagged types. */
6535 ada_is_dispatch_table_ptr_type (struct type *type)
6539 if (TYPE_CODE (type) != TYPE_CODE_PTR)
6542 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
6546 return (strcmp (name, "ada__tags__dispatch_table") == 0);
6549 /* Return non-zero if TYPE is an interface tag. */
6552 ada_is_interface_tag (struct type *type)
6554 const char *name = TYPE_NAME (type);
6559 return (strcmp (name, "ada__tags__interface_tag") == 0);
6562 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6563 to be invisible to users. */
6566 ada_is_ignored_field (struct type *type, int field_num)
6568 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
6571 /* Check the name of that field. */
6573 const char *name = TYPE_FIELD_NAME (type, field_num);
6575 /* Anonymous field names should not be printed.
6576 brobecker/2007-02-20: I don't think this can actually happen
6577 but we don't want to print the value of annonymous fields anyway. */
6581 /* Normally, fields whose name start with an underscore ("_")
6582 are fields that have been internally generated by the compiler,
6583 and thus should not be printed. The "_parent" field is special,
6584 however: This is a field internally generated by the compiler
6585 for tagged types, and it contains the components inherited from
6586 the parent type. This field should not be printed as is, but
6587 should not be ignored either. */
6588 if (name[0] == '_' && !startswith (name, "_parent"))
6592 /* If this is the dispatch table of a tagged type or an interface tag,
6594 if (ada_is_tagged_type (type, 1)
6595 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num))
6596 || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num))))
6599 /* Not a special field, so it should not be ignored. */
6603 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6604 pointer or reference type whose ultimate target has a tag field. */
6607 ada_is_tagged_type (struct type *type, int refok)
6609 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1) != NULL);
6612 /* True iff TYPE represents the type of X'Tag */
6615 ada_is_tag_type (struct type *type)
6617 type = ada_check_typedef (type);
6619 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
6623 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
6625 return (name != NULL
6626 && strcmp (name, "ada__tags__dispatch_table") == 0);
6630 /* The type of the tag on VAL. */
6633 ada_tag_type (struct value *val)
6635 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0);
6638 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6639 retired at Ada 05). */
6642 is_ada95_tag (struct value *tag)
6644 return ada_value_struct_elt (tag, "tsd", 1) != NULL;
6647 /* The value of the tag on VAL. */
6650 ada_value_tag (struct value *val)
6652 return ada_value_struct_elt (val, "_tag", 0);
6655 /* The value of the tag on the object of type TYPE whose contents are
6656 saved at VALADDR, if it is non-null, or is at memory address
6659 static struct value *
6660 value_tag_from_contents_and_address (struct type *type,
6661 const gdb_byte *valaddr,
6664 int tag_byte_offset;
6665 struct type *tag_type;
6667 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
6670 const gdb_byte *valaddr1 = ((valaddr == NULL)
6672 : valaddr + tag_byte_offset);
6673 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
6675 return value_from_contents_and_address (tag_type, valaddr1, address1);
6680 static struct type *
6681 type_from_tag (struct value *tag)
6683 const char *type_name = ada_tag_name (tag);
6685 if (type_name != NULL)
6686 return ada_find_any_type (ada_encode (type_name));
6690 /* Given a value OBJ of a tagged type, return a value of this
6691 type at the base address of the object. The base address, as
6692 defined in Ada.Tags, it is the address of the primary tag of
6693 the object, and therefore where the field values of its full
6694 view can be fetched. */
6697 ada_tag_value_at_base_address (struct value *obj)
6700 LONGEST offset_to_top = 0;
6701 struct type *ptr_type, *obj_type;
6703 CORE_ADDR base_address;
6705 obj_type = value_type (obj);
6707 /* It is the responsability of the caller to deref pointers. */
6709 if (TYPE_CODE (obj_type) == TYPE_CODE_PTR
6710 || TYPE_CODE (obj_type) == TYPE_CODE_REF)
6713 tag = ada_value_tag (obj);
6717 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6719 if (is_ada95_tag (tag))
6722 ptr_type = language_lookup_primitive_type
6723 (language_def (language_ada), target_gdbarch(), "storage_offset");
6724 ptr_type = lookup_pointer_type (ptr_type);
6725 val = value_cast (ptr_type, tag);
6729 /* It is perfectly possible that an exception be raised while
6730 trying to determine the base address, just like for the tag;
6731 see ada_tag_name for more details. We do not print the error
6732 message for the same reason. */
6736 offset_to_top = value_as_long (value_ind (value_ptradd (val, -2)));
6739 CATCH (e, RETURN_MASK_ERROR)
6745 /* If offset is null, nothing to do. */
6747 if (offset_to_top == 0)
6750 /* -1 is a special case in Ada.Tags; however, what should be done
6751 is not quite clear from the documentation. So do nothing for
6754 if (offset_to_top == -1)
6757 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6758 from the base address. This was however incompatible with
6759 C++ dispatch table: C++ uses a *negative* value to *add*
6760 to the base address. Ada's convention has therefore been
6761 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6762 use the same convention. Here, we support both cases by
6763 checking the sign of OFFSET_TO_TOP. */
6765 if (offset_to_top > 0)
6766 offset_to_top = -offset_to_top;
6768 base_address = value_address (obj) + offset_to_top;
6769 tag = value_tag_from_contents_and_address (obj_type, NULL, base_address);
6771 /* Make sure that we have a proper tag at the new address.
6772 Otherwise, offset_to_top is bogus (which can happen when
6773 the object is not initialized yet). */
6778 obj_type = type_from_tag (tag);
6783 return value_from_contents_and_address (obj_type, NULL, base_address);
6786 /* Return the "ada__tags__type_specific_data" type. */
6788 static struct type *
6789 ada_get_tsd_type (struct inferior *inf)
6791 struct ada_inferior_data *data = get_ada_inferior_data (inf);
6793 if (data->tsd_type == 0)
6794 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6795 return data->tsd_type;
6798 /* Return the TSD (type-specific data) associated to the given TAG.
6799 TAG is assumed to be the tag of a tagged-type entity.
6801 May return NULL if we are unable to get the TSD. */
6803 static struct value *
6804 ada_get_tsd_from_tag (struct value *tag)
6809 /* First option: The TSD is simply stored as a field of our TAG.
6810 Only older versions of GNAT would use this format, but we have
6811 to test it first, because there are no visible markers for
6812 the current approach except the absence of that field. */
6814 val = ada_value_struct_elt (tag, "tsd", 1);
6818 /* Try the second representation for the dispatch table (in which
6819 there is no explicit 'tsd' field in the referent of the tag pointer,
6820 and instead the tsd pointer is stored just before the dispatch
6823 type = ada_get_tsd_type (current_inferior());
6826 type = lookup_pointer_type (lookup_pointer_type (type));
6827 val = value_cast (type, tag);
6830 return value_ind (value_ptradd (val, -1));
6833 /* Given the TSD of a tag (type-specific data), return a string
6834 containing the name of the associated type.
6836 The returned value is good until the next call. May return NULL
6837 if we are unable to determine the tag name. */
6840 ada_tag_name_from_tsd (struct value *tsd)
6842 static char name[1024];
6846 val = ada_value_struct_elt (tsd, "expanded_name", 1);
6849 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6850 for (p = name; *p != '\0'; p += 1)
6856 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6859 Return NULL if the TAG is not an Ada tag, or if we were unable to
6860 determine the name of that tag. The result is good until the next
6864 ada_tag_name (struct value *tag)
6868 if (!ada_is_tag_type (value_type (tag)))
6871 /* It is perfectly possible that an exception be raised while trying
6872 to determine the TAG's name, even under normal circumstances:
6873 The associated variable may be uninitialized or corrupted, for
6874 instance. We do not let any exception propagate past this point.
6875 instead we return NULL.
6877 We also do not print the error message either (which often is very
6878 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6879 the caller print a more meaningful message if necessary. */
6882 struct value *tsd = ada_get_tsd_from_tag (tag);
6885 name = ada_tag_name_from_tsd (tsd);
6887 CATCH (e, RETURN_MASK_ERROR)
6895 /* The parent type of TYPE, or NULL if none. */
6898 ada_parent_type (struct type *type)
6902 type = ada_check_typedef (type);
6904 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6907 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6908 if (ada_is_parent_field (type, i))
6910 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6912 /* If the _parent field is a pointer, then dereference it. */
6913 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6914 parent_type = TYPE_TARGET_TYPE (parent_type);
6915 /* If there is a parallel XVS type, get the actual base type. */
6916 parent_type = ada_get_base_type (parent_type);
6918 return ada_check_typedef (parent_type);
6924 /* True iff field number FIELD_NUM of structure type TYPE contains the
6925 parent-type (inherited) fields of a derived type. Assumes TYPE is
6926 a structure type with at least FIELD_NUM+1 fields. */
6929 ada_is_parent_field (struct type *type, int field_num)
6931 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6933 return (name != NULL
6934 && (startswith (name, "PARENT")
6935 || startswith (name, "_parent")));
6938 /* True iff field number FIELD_NUM of structure type TYPE is a
6939 transparent wrapper field (which should be silently traversed when doing
6940 field selection and flattened when printing). Assumes TYPE is a
6941 structure type with at least FIELD_NUM+1 fields. Such fields are always
6945 ada_is_wrapper_field (struct type *type, int field_num)
6947 const char *name = TYPE_FIELD_NAME (type, field_num);
6949 if (name != NULL && strcmp (name, "RETVAL") == 0)
6951 /* This happens in functions with "out" or "in out" parameters
6952 which are passed by copy. For such functions, GNAT describes
6953 the function's return type as being a struct where the return
6954 value is in a field called RETVAL, and where the other "out"
6955 or "in out" parameters are fields of that struct. This is not
6960 return (name != NULL
6961 && (startswith (name, "PARENT")
6962 || strcmp (name, "REP") == 0
6963 || startswith (name, "_parent")
6964 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6967 /* True iff field number FIELD_NUM of structure or union type TYPE
6968 is a variant wrapper. Assumes TYPE is a structure type with at least
6969 FIELD_NUM+1 fields. */
6972 ada_is_variant_part (struct type *type, int field_num)
6974 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6976 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6977 || (is_dynamic_field (type, field_num)
6978 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6979 == TYPE_CODE_UNION)));
6982 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6983 whose discriminants are contained in the record type OUTER_TYPE,
6984 returns the type of the controlling discriminant for the variant.
6985 May return NULL if the type could not be found. */
6988 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6990 const char *name = ada_variant_discrim_name (var_type);
6992 return ada_lookup_struct_elt_type (outer_type, name, 1, 1);
6995 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6996 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6997 represents a 'when others' clause; otherwise 0. */
7000 ada_is_others_clause (struct type *type, int field_num)
7002 const char *name = TYPE_FIELD_NAME (type, field_num);
7004 return (name != NULL && name[0] == 'O');
7007 /* Assuming that TYPE0 is the type of the variant part of a record,
7008 returns the name of the discriminant controlling the variant.
7009 The value is valid until the next call to ada_variant_discrim_name. */
7012 ada_variant_discrim_name (struct type *type0)
7014 static char *result = NULL;
7015 static size_t result_len = 0;
7018 const char *discrim_end;
7019 const char *discrim_start;
7021 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
7022 type = TYPE_TARGET_TYPE (type0);
7026 name = ada_type_name (type);
7028 if (name == NULL || name[0] == '\000')
7031 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
7034 if (startswith (discrim_end, "___XVN"))
7037 if (discrim_end == name)
7040 for (discrim_start = discrim_end; discrim_start != name + 3;
7043 if (discrim_start == name + 1)
7045 if ((discrim_start > name + 3
7046 && startswith (discrim_start - 3, "___"))
7047 || discrim_start[-1] == '.')
7051 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
7052 strncpy (result, discrim_start, discrim_end - discrim_start);
7053 result[discrim_end - discrim_start] = '\0';
7057 /* Scan STR for a subtype-encoded number, beginning at position K.
7058 Put the position of the character just past the number scanned in
7059 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7060 Return 1 if there was a valid number at the given position, and 0
7061 otherwise. A "subtype-encoded" number consists of the absolute value
7062 in decimal, followed by the letter 'm' to indicate a negative number.
7063 Assumes 0m does not occur. */
7066 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
7070 if (!isdigit (str[k]))
7073 /* Do it the hard way so as not to make any assumption about
7074 the relationship of unsigned long (%lu scan format code) and
7077 while (isdigit (str[k]))
7079 RU = RU * 10 + (str[k] - '0');
7086 *R = (-(LONGEST) (RU - 1)) - 1;
7092 /* NOTE on the above: Technically, C does not say what the results of
7093 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7094 number representable as a LONGEST (although either would probably work
7095 in most implementations). When RU>0, the locution in the then branch
7096 above is always equivalent to the negative of RU. */
7103 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7104 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7105 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7108 ada_in_variant (LONGEST val, struct type *type, int field_num)
7110 const char *name = TYPE_FIELD_NAME (type, field_num);
7124 if (!ada_scan_number (name, p + 1, &W, &p))
7134 if (!ada_scan_number (name, p + 1, &L, &p)
7135 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
7137 if (val >= L && val <= U)
7149 /* FIXME: Lots of redundancy below. Try to consolidate. */
7151 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7152 ARG_TYPE, extract and return the value of one of its (non-static)
7153 fields. FIELDNO says which field. Differs from value_primitive_field
7154 only in that it can handle packed values of arbitrary type. */
7156 static struct value *
7157 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
7158 struct type *arg_type)
7162 arg_type = ada_check_typedef (arg_type);
7163 type = TYPE_FIELD_TYPE (arg_type, fieldno);
7165 /* Handle packed fields. */
7167 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
7169 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
7170 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
7172 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
7173 offset + bit_pos / 8,
7174 bit_pos % 8, bit_size, type);
7177 return value_primitive_field (arg1, offset, fieldno, arg_type);
7180 /* Find field with name NAME in object of type TYPE. If found,
7181 set the following for each argument that is non-null:
7182 - *FIELD_TYPE_P to the field's type;
7183 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7184 an object of that type;
7185 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7186 - *BIT_SIZE_P to its size in bits if the field is packed, and
7188 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7189 fields up to but not including the desired field, or by the total
7190 number of fields if not found. A NULL value of NAME never
7191 matches; the function just counts visible fields in this case.
7193 Notice that we need to handle when a tagged record hierarchy
7194 has some components with the same name, like in this scenario:
7196 type Top_T is tagged record
7202 type Middle_T is new Top.Top_T with record
7203 N : Character := 'a';
7207 type Bottom_T is new Middle.Middle_T with record
7209 C : Character := '5';
7211 A : Character := 'J';
7214 Let's say we now have a variable declared and initialized as follow:
7216 TC : Top_A := new Bottom_T;
7218 And then we use this variable to call this function
7220 procedure Assign (Obj: in out Top_T; TV : Integer);
7224 Assign (Top_T (B), 12);
7226 Now, we're in the debugger, and we're inside that procedure
7227 then and we want to print the value of obj.c:
7229 Usually, the tagged record or one of the parent type owns the
7230 component to print and there's no issue but in this particular
7231 case, what does it mean to ask for Obj.C? Since the actual
7232 type for object is type Bottom_T, it could mean two things: type
7233 component C from the Middle_T view, but also component C from
7234 Bottom_T. So in that "undefined" case, when the component is
7235 not found in the non-resolved type (which includes all the
7236 components of the parent type), then resolve it and see if we
7237 get better luck once expanded.
7239 In the case of homonyms in the derived tagged type, we don't
7240 guaranty anything, and pick the one that's easiest for us
7243 Returns 1 if found, 0 otherwise. */
7246 find_struct_field (const char *name, struct type *type, int offset,
7247 struct type **field_type_p,
7248 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
7252 int parent_offset = -1;
7254 type = ada_check_typedef (type);
7256 if (field_type_p != NULL)
7257 *field_type_p = NULL;
7258 if (byte_offset_p != NULL)
7260 if (bit_offset_p != NULL)
7262 if (bit_size_p != NULL)
7265 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7267 int bit_pos = TYPE_FIELD_BITPOS (type, i);
7268 int fld_offset = offset + bit_pos / 8;
7269 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7271 if (t_field_name == NULL)
7274 else if (ada_is_parent_field (type, i))
7276 /* This is a field pointing us to the parent type of a tagged
7277 type. As hinted in this function's documentation, we give
7278 preference to fields in the current record first, so what
7279 we do here is just record the index of this field before
7280 we skip it. If it turns out we couldn't find our field
7281 in the current record, then we'll get back to it and search
7282 inside it whether the field might exist in the parent. */
7288 else if (name != NULL && field_name_match (t_field_name, name))
7290 int bit_size = TYPE_FIELD_BITSIZE (type, i);
7292 if (field_type_p != NULL)
7293 *field_type_p = TYPE_FIELD_TYPE (type, i);
7294 if (byte_offset_p != NULL)
7295 *byte_offset_p = fld_offset;
7296 if (bit_offset_p != NULL)
7297 *bit_offset_p = bit_pos % 8;
7298 if (bit_size_p != NULL)
7299 *bit_size_p = bit_size;
7302 else if (ada_is_wrapper_field (type, i))
7304 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
7305 field_type_p, byte_offset_p, bit_offset_p,
7306 bit_size_p, index_p))
7309 else if (ada_is_variant_part (type, i))
7311 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7314 struct type *field_type
7315 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
7317 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
7319 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
7321 + TYPE_FIELD_BITPOS (field_type, j) / 8,
7322 field_type_p, byte_offset_p,
7323 bit_offset_p, bit_size_p, index_p))
7327 else if (index_p != NULL)
7331 /* Field not found so far. If this is a tagged type which
7332 has a parent, try finding that field in the parent now. */
7334 if (parent_offset != -1)
7336 int bit_pos = TYPE_FIELD_BITPOS (type, parent_offset);
7337 int fld_offset = offset + bit_pos / 8;
7339 if (find_struct_field (name, TYPE_FIELD_TYPE (type, parent_offset),
7340 fld_offset, field_type_p, byte_offset_p,
7341 bit_offset_p, bit_size_p, index_p))
7348 /* Number of user-visible fields in record type TYPE. */
7351 num_visible_fields (struct type *type)
7356 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
7360 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7361 and search in it assuming it has (class) type TYPE.
7362 If found, return value, else return NULL.
7364 Searches recursively through wrapper fields (e.g., '_parent').
7366 In the case of homonyms in the tagged types, please refer to the
7367 long explanation in find_struct_field's function documentation. */
7369 static struct value *
7370 ada_search_struct_field (const char *name, struct value *arg, int offset,
7374 int parent_offset = -1;
7376 type = ada_check_typedef (type);
7377 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7379 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7381 if (t_field_name == NULL)
7384 else if (ada_is_parent_field (type, i))
7386 /* This is a field pointing us to the parent type of a tagged
7387 type. As hinted in this function's documentation, we give
7388 preference to fields in the current record first, so what
7389 we do here is just record the index of this field before
7390 we skip it. If it turns out we couldn't find our field
7391 in the current record, then we'll get back to it and search
7392 inside it whether the field might exist in the parent. */
7398 else if (field_name_match (t_field_name, name))
7399 return ada_value_primitive_field (arg, offset, i, type);
7401 else if (ada_is_wrapper_field (type, i))
7403 struct value *v = /* Do not let indent join lines here. */
7404 ada_search_struct_field (name, arg,
7405 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7406 TYPE_FIELD_TYPE (type, i));
7412 else if (ada_is_variant_part (type, i))
7414 /* PNH: Do we ever get here? See find_struct_field. */
7416 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7418 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
7420 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
7422 struct value *v = ada_search_struct_field /* Force line
7425 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
7426 TYPE_FIELD_TYPE (field_type, j));
7434 /* Field not found so far. If this is a tagged type which
7435 has a parent, try finding that field in the parent now. */
7437 if (parent_offset != -1)
7439 struct value *v = ada_search_struct_field (
7440 name, arg, offset + TYPE_FIELD_BITPOS (type, parent_offset) / 8,
7441 TYPE_FIELD_TYPE (type, parent_offset));
7450 static struct value *ada_index_struct_field_1 (int *, struct value *,
7451 int, struct type *);
7454 /* Return field #INDEX in ARG, where the index is that returned by
7455 * find_struct_field through its INDEX_P argument. Adjust the address
7456 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7457 * If found, return value, else return NULL. */
7459 static struct value *
7460 ada_index_struct_field (int index, struct value *arg, int offset,
7463 return ada_index_struct_field_1 (&index, arg, offset, type);
7467 /* Auxiliary function for ada_index_struct_field. Like
7468 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7471 static struct value *
7472 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
7476 type = ada_check_typedef (type);
7478 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7480 if (TYPE_FIELD_NAME (type, i) == NULL)
7482 else if (ada_is_wrapper_field (type, i))
7484 struct value *v = /* Do not let indent join lines here. */
7485 ada_index_struct_field_1 (index_p, arg,
7486 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7487 TYPE_FIELD_TYPE (type, i));
7493 else if (ada_is_variant_part (type, i))
7495 /* PNH: Do we ever get here? See ada_search_struct_field,
7496 find_struct_field. */
7497 error (_("Cannot assign this kind of variant record"));
7499 else if (*index_p == 0)
7500 return ada_value_primitive_field (arg, offset, i, type);
7507 /* Given ARG, a value of type (pointer or reference to a)*
7508 structure/union, extract the component named NAME from the ultimate
7509 target structure/union and return it as a value with its
7512 The routine searches for NAME among all members of the structure itself
7513 and (recursively) among all members of any wrapper members
7516 If NO_ERR, then simply return NULL in case of error, rather than
7520 ada_value_struct_elt (struct value *arg, const char *name, int no_err)
7522 struct type *t, *t1;
7526 t1 = t = ada_check_typedef (value_type (arg));
7527 if (TYPE_CODE (t) == TYPE_CODE_REF)
7529 t1 = TYPE_TARGET_TYPE (t);
7532 t1 = ada_check_typedef (t1);
7533 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7535 arg = coerce_ref (arg);
7540 while (TYPE_CODE (t) == TYPE_CODE_PTR)
7542 t1 = TYPE_TARGET_TYPE (t);
7545 t1 = ada_check_typedef (t1);
7546 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7548 arg = value_ind (arg);
7555 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
7559 v = ada_search_struct_field (name, arg, 0, t);
7562 int bit_offset, bit_size, byte_offset;
7563 struct type *field_type;
7566 if (TYPE_CODE (t) == TYPE_CODE_PTR)
7567 address = value_address (ada_value_ind (arg));
7569 address = value_address (ada_coerce_ref (arg));
7571 /* Check to see if this is a tagged type. We also need to handle
7572 the case where the type is a reference to a tagged type, but
7573 we have to be careful to exclude pointers to tagged types.
7574 The latter should be shown as usual (as a pointer), whereas
7575 a reference should mostly be transparent to the user. */
7577 if (ada_is_tagged_type (t1, 0)
7578 || (TYPE_CODE (t1) == TYPE_CODE_REF
7579 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1), 0)))
7581 /* We first try to find the searched field in the current type.
7582 If not found then let's look in the fixed type. */
7584 if (!find_struct_field (name, t1, 0,
7585 &field_type, &byte_offset, &bit_offset,
7587 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL,
7591 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL,
7594 if (find_struct_field (name, t1, 0,
7595 &field_type, &byte_offset, &bit_offset,
7600 if (TYPE_CODE (t) == TYPE_CODE_REF)
7601 arg = ada_coerce_ref (arg);
7603 arg = ada_value_ind (arg);
7604 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
7605 bit_offset, bit_size,
7609 v = value_at_lazy (field_type, address + byte_offset);
7613 if (v != NULL || no_err)
7616 error (_("There is no member named %s."), name);
7622 error (_("Attempt to extract a component of "
7623 "a value that is not a record."));
7626 /* Return a string representation of type TYPE. */
7629 type_as_string (struct type *type)
7631 string_file tmp_stream;
7633 type_print (type, "", &tmp_stream, -1);
7635 return std::move (tmp_stream.string ());
7638 /* Given a type TYPE, look up the type of the component of type named NAME.
7639 If DISPP is non-null, add its byte displacement from the beginning of a
7640 structure (pointed to by a value) of type TYPE to *DISPP (does not
7641 work for packed fields).
7643 Matches any field whose name has NAME as a prefix, possibly
7646 TYPE can be either a struct or union. If REFOK, TYPE may also
7647 be a (pointer or reference)+ to a struct or union, and the
7648 ultimate target type will be searched.
7650 Looks recursively into variant clauses and parent types.
7652 In the case of homonyms in the tagged types, please refer to the
7653 long explanation in find_struct_field's function documentation.
7655 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7656 TYPE is not a type of the right kind. */
7658 static struct type *
7659 ada_lookup_struct_elt_type (struct type *type, const char *name, int refok,
7663 int parent_offset = -1;
7668 if (refok && type != NULL)
7671 type = ada_check_typedef (type);
7672 if (TYPE_CODE (type) != TYPE_CODE_PTR
7673 && TYPE_CODE (type) != TYPE_CODE_REF)
7675 type = TYPE_TARGET_TYPE (type);
7679 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
7680 && TYPE_CODE (type) != TYPE_CODE_UNION))
7685 error (_("Type %s is not a structure or union type"),
7686 type != NULL ? type_as_string (type).c_str () : _("(null)"));
7689 type = to_static_fixed_type (type);
7691 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7693 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7696 if (t_field_name == NULL)
7699 else if (ada_is_parent_field (type, i))
7701 /* This is a field pointing us to the parent type of a tagged
7702 type. As hinted in this function's documentation, we give
7703 preference to fields in the current record first, so what
7704 we do here is just record the index of this field before
7705 we skip it. If it turns out we couldn't find our field
7706 in the current record, then we'll get back to it and search
7707 inside it whether the field might exist in the parent. */
7713 else if (field_name_match (t_field_name, name))
7714 return TYPE_FIELD_TYPE (type, i);
7716 else if (ada_is_wrapper_field (type, i))
7718 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
7724 else if (ada_is_variant_part (type, i))
7727 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7730 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
7732 /* FIXME pnh 2008/01/26: We check for a field that is
7733 NOT wrapped in a struct, since the compiler sometimes
7734 generates these for unchecked variant types. Revisit
7735 if the compiler changes this practice. */
7736 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
7738 if (v_field_name != NULL
7739 && field_name_match (v_field_name, name))
7740 t = TYPE_FIELD_TYPE (field_type, j);
7742 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
7753 /* Field not found so far. If this is a tagged type which
7754 has a parent, try finding that field in the parent now. */
7756 if (parent_offset != -1)
7760 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, parent_offset),
7769 const char *name_str = name != NULL ? name : _("<null>");
7771 error (_("Type %s has no component named %s"),
7772 type_as_string (type).c_str (), name_str);
7778 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7779 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7780 represents an unchecked union (that is, the variant part of a
7781 record that is named in an Unchecked_Union pragma). */
7784 is_unchecked_variant (struct type *var_type, struct type *outer_type)
7786 const char *discrim_name = ada_variant_discrim_name (var_type);
7788 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1) == NULL);
7792 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7793 within a value of type OUTER_TYPE that is stored in GDB at
7794 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7795 numbering from 0) is applicable. Returns -1 if none are. */
7798 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
7799 const gdb_byte *outer_valaddr)
7803 const char *discrim_name = ada_variant_discrim_name (var_type);
7804 struct value *outer;
7805 struct value *discrim;
7806 LONGEST discrim_val;
7808 /* Using plain value_from_contents_and_address here causes problems
7809 because we will end up trying to resolve a type that is currently
7810 being constructed. */
7811 outer = value_from_contents_and_address_unresolved (outer_type,
7813 discrim = ada_value_struct_elt (outer, discrim_name, 1);
7814 if (discrim == NULL)
7816 discrim_val = value_as_long (discrim);
7819 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
7821 if (ada_is_others_clause (var_type, i))
7823 else if (ada_in_variant (discrim_val, var_type, i))
7827 return others_clause;
7832 /* Dynamic-Sized Records */
7834 /* Strategy: The type ostensibly attached to a value with dynamic size
7835 (i.e., a size that is not statically recorded in the debugging
7836 data) does not accurately reflect the size or layout of the value.
7837 Our strategy is to convert these values to values with accurate,
7838 conventional types that are constructed on the fly. */
7840 /* There is a subtle and tricky problem here. In general, we cannot
7841 determine the size of dynamic records without its data. However,
7842 the 'struct value' data structure, which GDB uses to represent
7843 quantities in the inferior process (the target), requires the size
7844 of the type at the time of its allocation in order to reserve space
7845 for GDB's internal copy of the data. That's why the
7846 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7847 rather than struct value*s.
7849 However, GDB's internal history variables ($1, $2, etc.) are
7850 struct value*s containing internal copies of the data that are not, in
7851 general, the same as the data at their corresponding addresses in
7852 the target. Fortunately, the types we give to these values are all
7853 conventional, fixed-size types (as per the strategy described
7854 above), so that we don't usually have to perform the
7855 'to_fixed_xxx_type' conversions to look at their values.
7856 Unfortunately, there is one exception: if one of the internal
7857 history variables is an array whose elements are unconstrained
7858 records, then we will need to create distinct fixed types for each
7859 element selected. */
7861 /* The upshot of all of this is that many routines take a (type, host
7862 address, target address) triple as arguments to represent a value.
7863 The host address, if non-null, is supposed to contain an internal
7864 copy of the relevant data; otherwise, the program is to consult the
7865 target at the target address. */
7867 /* Assuming that VAL0 represents a pointer value, the result of
7868 dereferencing it. Differs from value_ind in its treatment of
7869 dynamic-sized types. */
7872 ada_value_ind (struct value *val0)
7874 struct value *val = value_ind (val0);
7876 if (ada_is_tagged_type (value_type (val), 0))
7877 val = ada_tag_value_at_base_address (val);
7879 return ada_to_fixed_value (val);
7882 /* The value resulting from dereferencing any "reference to"
7883 qualifiers on VAL0. */
7885 static struct value *
7886 ada_coerce_ref (struct value *val0)
7888 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
7890 struct value *val = val0;
7892 val = coerce_ref (val);
7894 if (ada_is_tagged_type (value_type (val), 0))
7895 val = ada_tag_value_at_base_address (val);
7897 return ada_to_fixed_value (val);
7903 /* Return OFF rounded upward if necessary to a multiple of
7904 ALIGNMENT (a power of 2). */
7907 align_value (unsigned int off, unsigned int alignment)
7909 return (off + alignment - 1) & ~(alignment - 1);
7912 /* Return the bit alignment required for field #F of template type TYPE. */
7915 field_alignment (struct type *type, int f)
7917 const char *name = TYPE_FIELD_NAME (type, f);
7921 /* The field name should never be null, unless the debugging information
7922 is somehow malformed. In this case, we assume the field does not
7923 require any alignment. */
7927 len = strlen (name);
7929 if (!isdigit (name[len - 1]))
7932 if (isdigit (name[len - 2]))
7933 align_offset = len - 2;
7935 align_offset = len - 1;
7937 if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV"))
7938 return TARGET_CHAR_BIT;
7940 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7943 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7945 static struct symbol *
7946 ada_find_any_type_symbol (const char *name)
7950 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
7951 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
7954 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7958 /* Find a type named NAME. Ignores ambiguity. This routine will look
7959 solely for types defined by debug info, it will not search the GDB
7962 static struct type *
7963 ada_find_any_type (const char *name)
7965 struct symbol *sym = ada_find_any_type_symbol (name);
7968 return SYMBOL_TYPE (sym);
7973 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7974 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7975 symbol, in which case it is returned. Otherwise, this looks for
7976 symbols whose name is that of NAME_SYM suffixed with "___XR".
7977 Return symbol if found, and NULL otherwise. */
7980 ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block)
7982 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
7985 if (strstr (name, "___XR") != NULL)
7988 sym = find_old_style_renaming_symbol (name, block);
7993 /* Not right yet. FIXME pnh 7/20/2007. */
7994 sym = ada_find_any_type_symbol (name);
7995 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
8001 static struct symbol *
8002 find_old_style_renaming_symbol (const char *name, const struct block *block)
8004 const struct symbol *function_sym = block_linkage_function (block);
8007 if (function_sym != NULL)
8009 /* If the symbol is defined inside a function, NAME is not fully
8010 qualified. This means we need to prepend the function name
8011 as well as adding the ``___XR'' suffix to build the name of
8012 the associated renaming symbol. */
8013 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
8014 /* Function names sometimes contain suffixes used
8015 for instance to qualify nested subprograms. When building
8016 the XR type name, we need to make sure that this suffix is
8017 not included. So do not include any suffix in the function
8018 name length below. */
8019 int function_name_len = ada_name_prefix_len (function_name);
8020 const int rename_len = function_name_len + 2 /* "__" */
8021 + strlen (name) + 6 /* "___XR\0" */ ;
8023 /* Strip the suffix if necessary. */
8024 ada_remove_trailing_digits (function_name, &function_name_len);
8025 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
8026 ada_remove_Xbn_suffix (function_name, &function_name_len);
8028 /* Library-level functions are a special case, as GNAT adds
8029 a ``_ada_'' prefix to the function name to avoid namespace
8030 pollution. However, the renaming symbols themselves do not
8031 have this prefix, so we need to skip this prefix if present. */
8032 if (function_name_len > 5 /* "_ada_" */
8033 && strstr (function_name, "_ada_") == function_name)
8036 function_name_len -= 5;
8039 rename = (char *) alloca (rename_len * sizeof (char));
8040 strncpy (rename, function_name, function_name_len);
8041 xsnprintf (rename + function_name_len, rename_len - function_name_len,
8046 const int rename_len = strlen (name) + 6;
8048 rename = (char *) alloca (rename_len * sizeof (char));
8049 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
8052 return ada_find_any_type_symbol (rename);
8055 /* Because of GNAT encoding conventions, several GDB symbols may match a
8056 given type name. If the type denoted by TYPE0 is to be preferred to
8057 that of TYPE1 for purposes of type printing, return non-zero;
8058 otherwise return 0. */
8061 ada_prefer_type (struct type *type0, struct type *type1)
8065 else if (type0 == NULL)
8067 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
8069 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
8071 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
8073 else if (ada_is_constrained_packed_array_type (type0))
8075 else if (ada_is_array_descriptor_type (type0)
8076 && !ada_is_array_descriptor_type (type1))
8080 const char *type0_name = TYPE_NAME (type0);
8081 const char *type1_name = TYPE_NAME (type1);
8083 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
8084 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
8090 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
8094 ada_type_name (struct type *type)
8098 return TYPE_NAME (type);
8101 /* Search the list of "descriptive" types associated to TYPE for a type
8102 whose name is NAME. */
8104 static struct type *
8105 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
8107 struct type *result, *tmp;
8109 if (ada_ignore_descriptive_types_p)
8112 /* If there no descriptive-type info, then there is no parallel type
8114 if (!HAVE_GNAT_AUX_INFO (type))
8117 result = TYPE_DESCRIPTIVE_TYPE (type);
8118 while (result != NULL)
8120 const char *result_name = ada_type_name (result);
8122 if (result_name == NULL)
8124 warning (_("unexpected null name on descriptive type"));
8128 /* If the names match, stop. */
8129 if (strcmp (result_name, name) == 0)
8132 /* Otherwise, look at the next item on the list, if any. */
8133 if (HAVE_GNAT_AUX_INFO (result))
8134 tmp = TYPE_DESCRIPTIVE_TYPE (result);
8138 /* If not found either, try after having resolved the typedef. */
8143 result = check_typedef (result);
8144 if (HAVE_GNAT_AUX_INFO (result))
8145 result = TYPE_DESCRIPTIVE_TYPE (result);
8151 /* If we didn't find a match, see whether this is a packed array. With
8152 older compilers, the descriptive type information is either absent or
8153 irrelevant when it comes to packed arrays so the above lookup fails.
8154 Fall back to using a parallel lookup by name in this case. */
8155 if (result == NULL && ada_is_constrained_packed_array_type (type))
8156 return ada_find_any_type (name);
8161 /* Find a parallel type to TYPE with the specified NAME, using the
8162 descriptive type taken from the debugging information, if available,
8163 and otherwise using the (slower) name-based method. */
8165 static struct type *
8166 ada_find_parallel_type_with_name (struct type *type, const char *name)
8168 struct type *result = NULL;
8170 if (HAVE_GNAT_AUX_INFO (type))
8171 result = find_parallel_type_by_descriptive_type (type, name);
8173 result = ada_find_any_type (name);
8178 /* Same as above, but specify the name of the parallel type by appending
8179 SUFFIX to the name of TYPE. */
8182 ada_find_parallel_type (struct type *type, const char *suffix)
8185 const char *type_name = ada_type_name (type);
8188 if (type_name == NULL)
8191 len = strlen (type_name);
8193 name = (char *) alloca (len + strlen (suffix) + 1);
8195 strcpy (name, type_name);
8196 strcpy (name + len, suffix);
8198 return ada_find_parallel_type_with_name (type, name);
8201 /* If TYPE is a variable-size record type, return the corresponding template
8202 type describing its fields. Otherwise, return NULL. */
8204 static struct type *
8205 dynamic_template_type (struct type *type)
8207 type = ada_check_typedef (type);
8209 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
8210 || ada_type_name (type) == NULL)
8214 int len = strlen (ada_type_name (type));
8216 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
8219 return ada_find_parallel_type (type, "___XVE");
8223 /* Assuming that TEMPL_TYPE is a union or struct type, returns
8224 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
8227 is_dynamic_field (struct type *templ_type, int field_num)
8229 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
8232 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
8233 && strstr (name, "___XVL") != NULL;
8236 /* The index of the variant field of TYPE, or -1 if TYPE does not
8237 represent a variant record type. */
8240 variant_field_index (struct type *type)
8244 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
8247 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
8249 if (ada_is_variant_part (type, f))
8255 /* A record type with no fields. */
8257 static struct type *
8258 empty_record (struct type *templ)
8260 struct type *type = alloc_type_copy (templ);
8262 TYPE_CODE (type) = TYPE_CODE_STRUCT;
8263 TYPE_NFIELDS (type) = 0;
8264 TYPE_FIELDS (type) = NULL;
8265 INIT_CPLUS_SPECIFIC (type);
8266 TYPE_NAME (type) = "<empty>";
8267 TYPE_LENGTH (type) = 0;
8271 /* An ordinary record type (with fixed-length fields) that describes
8272 the value of type TYPE at VALADDR or ADDRESS (see comments at
8273 the beginning of this section) VAL according to GNAT conventions.
8274 DVAL0 should describe the (portion of a) record that contains any
8275 necessary discriminants. It should be NULL if value_type (VAL) is
8276 an outer-level type (i.e., as opposed to a branch of a variant.) A
8277 variant field (unless unchecked) is replaced by a particular branch
8280 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8281 length are not statically known are discarded. As a consequence,
8282 VALADDR, ADDRESS and DVAL0 are ignored.
8284 NOTE: Limitations: For now, we assume that dynamic fields and
8285 variants occupy whole numbers of bytes. However, they need not be
8289 ada_template_to_fixed_record_type_1 (struct type *type,
8290 const gdb_byte *valaddr,
8291 CORE_ADDR address, struct value *dval0,
8292 int keep_dynamic_fields)
8294 struct value *mark = value_mark ();
8297 int nfields, bit_len;
8303 /* Compute the number of fields in this record type that are going
8304 to be processed: unless keep_dynamic_fields, this includes only
8305 fields whose position and length are static will be processed. */
8306 if (keep_dynamic_fields)
8307 nfields = TYPE_NFIELDS (type);
8311 while (nfields < TYPE_NFIELDS (type)
8312 && !ada_is_variant_part (type, nfields)
8313 && !is_dynamic_field (type, nfields))
8317 rtype = alloc_type_copy (type);
8318 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8319 INIT_CPLUS_SPECIFIC (rtype);
8320 TYPE_NFIELDS (rtype) = nfields;
8321 TYPE_FIELDS (rtype) = (struct field *)
8322 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8323 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
8324 TYPE_NAME (rtype) = ada_type_name (type);
8325 TYPE_FIXED_INSTANCE (rtype) = 1;
8331 for (f = 0; f < nfields; f += 1)
8333 off = align_value (off, field_alignment (type, f))
8334 + TYPE_FIELD_BITPOS (type, f);
8335 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
8336 TYPE_FIELD_BITSIZE (rtype, f) = 0;
8338 if (ada_is_variant_part (type, f))
8343 else if (is_dynamic_field (type, f))
8345 const gdb_byte *field_valaddr = valaddr;
8346 CORE_ADDR field_address = address;
8347 struct type *field_type =
8348 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
8352 /* rtype's length is computed based on the run-time
8353 value of discriminants. If the discriminants are not
8354 initialized, the type size may be completely bogus and
8355 GDB may fail to allocate a value for it. So check the
8356 size first before creating the value. */
8357 ada_ensure_varsize_limit (rtype);
8358 /* Using plain value_from_contents_and_address here
8359 causes problems because we will end up trying to
8360 resolve a type that is currently being
8362 dval = value_from_contents_and_address_unresolved (rtype,
8365 rtype = value_type (dval);
8370 /* If the type referenced by this field is an aligner type, we need
8371 to unwrap that aligner type, because its size might not be set.
8372 Keeping the aligner type would cause us to compute the wrong
8373 size for this field, impacting the offset of the all the fields
8374 that follow this one. */
8375 if (ada_is_aligner_type (field_type))
8377 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
8379 field_valaddr = cond_offset_host (field_valaddr, field_offset);
8380 field_address = cond_offset_target (field_address, field_offset);
8381 field_type = ada_aligned_type (field_type);
8384 field_valaddr = cond_offset_host (field_valaddr,
8385 off / TARGET_CHAR_BIT);
8386 field_address = cond_offset_target (field_address,
8387 off / TARGET_CHAR_BIT);
8389 /* Get the fixed type of the field. Note that, in this case,
8390 we do not want to get the real type out of the tag: if
8391 the current field is the parent part of a tagged record,
8392 we will get the tag of the object. Clearly wrong: the real
8393 type of the parent is not the real type of the child. We
8394 would end up in an infinite loop. */
8395 field_type = ada_get_base_type (field_type);
8396 field_type = ada_to_fixed_type (field_type, field_valaddr,
8397 field_address, dval, 0);
8398 /* If the field size is already larger than the maximum
8399 object size, then the record itself will necessarily
8400 be larger than the maximum object size. We need to make
8401 this check now, because the size might be so ridiculously
8402 large (due to an uninitialized variable in the inferior)
8403 that it would cause an overflow when adding it to the
8405 ada_ensure_varsize_limit (field_type);
8407 TYPE_FIELD_TYPE (rtype, f) = field_type;
8408 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
8409 /* The multiplication can potentially overflow. But because
8410 the field length has been size-checked just above, and
8411 assuming that the maximum size is a reasonable value,
8412 an overflow should not happen in practice. So rather than
8413 adding overflow recovery code to this already complex code,
8414 we just assume that it's not going to happen. */
8416 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
8420 /* Note: If this field's type is a typedef, it is important
8421 to preserve the typedef layer.
8423 Otherwise, we might be transforming a typedef to a fat
8424 pointer (encoding a pointer to an unconstrained array),
8425 into a basic fat pointer (encoding an unconstrained
8426 array). As both types are implemented using the same
8427 structure, the typedef is the only clue which allows us
8428 to distinguish between the two options. Stripping it
8429 would prevent us from printing this field appropriately. */
8430 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
8431 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
8432 if (TYPE_FIELD_BITSIZE (type, f) > 0)
8434 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
8437 struct type *field_type = TYPE_FIELD_TYPE (type, f);
8439 /* We need to be careful of typedefs when computing
8440 the length of our field. If this is a typedef,
8441 get the length of the target type, not the length
8443 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
8444 field_type = ada_typedef_target_type (field_type);
8447 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
8450 if (off + fld_bit_len > bit_len)
8451 bit_len = off + fld_bit_len;
8453 TYPE_LENGTH (rtype) =
8454 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8457 /* We handle the variant part, if any, at the end because of certain
8458 odd cases in which it is re-ordered so as NOT to be the last field of
8459 the record. This can happen in the presence of representation
8461 if (variant_field >= 0)
8463 struct type *branch_type;
8465 off = TYPE_FIELD_BITPOS (rtype, variant_field);
8469 /* Using plain value_from_contents_and_address here causes
8470 problems because we will end up trying to resolve a type
8471 that is currently being constructed. */
8472 dval = value_from_contents_and_address_unresolved (rtype, valaddr,
8474 rtype = value_type (dval);
8480 to_fixed_variant_branch_type
8481 (TYPE_FIELD_TYPE (type, variant_field),
8482 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
8483 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
8484 if (branch_type == NULL)
8486 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
8487 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8488 TYPE_NFIELDS (rtype) -= 1;
8492 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8493 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8495 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
8497 if (off + fld_bit_len > bit_len)
8498 bit_len = off + fld_bit_len;
8499 TYPE_LENGTH (rtype) =
8500 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8504 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8505 should contain the alignment of that record, which should be a strictly
8506 positive value. If null or negative, then something is wrong, most
8507 probably in the debug info. In that case, we don't round up the size
8508 of the resulting type. If this record is not part of another structure,
8509 the current RTYPE length might be good enough for our purposes. */
8510 if (TYPE_LENGTH (type) <= 0)
8512 if (TYPE_NAME (rtype))
8513 warning (_("Invalid type size for `%s' detected: %d."),
8514 TYPE_NAME (rtype), TYPE_LENGTH (type));
8516 warning (_("Invalid type size for <unnamed> detected: %d."),
8517 TYPE_LENGTH (type));
8521 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
8522 TYPE_LENGTH (type));
8525 value_free_to_mark (mark);
8526 if (TYPE_LENGTH (rtype) > varsize_limit)
8527 error (_("record type with dynamic size is larger than varsize-limit"));
8531 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8534 static struct type *
8535 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
8536 CORE_ADDR address, struct value *dval0)
8538 return ada_template_to_fixed_record_type_1 (type, valaddr,
8542 /* An ordinary record type in which ___XVL-convention fields and
8543 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8544 static approximations, containing all possible fields. Uses
8545 no runtime values. Useless for use in values, but that's OK,
8546 since the results are used only for type determinations. Works on both
8547 structs and unions. Representation note: to save space, we memorize
8548 the result of this function in the TYPE_TARGET_TYPE of the
8551 static struct type *
8552 template_to_static_fixed_type (struct type *type0)
8558 /* No need no do anything if the input type is already fixed. */
8559 if (TYPE_FIXED_INSTANCE (type0))
8562 /* Likewise if we already have computed the static approximation. */
8563 if (TYPE_TARGET_TYPE (type0) != NULL)
8564 return TYPE_TARGET_TYPE (type0);
8566 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8568 nfields = TYPE_NFIELDS (type0);
8570 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8571 recompute all over next time. */
8572 TYPE_TARGET_TYPE (type0) = type;
8574 for (f = 0; f < nfields; f += 1)
8576 struct type *field_type = TYPE_FIELD_TYPE (type0, f);
8577 struct type *new_type;
8579 if (is_dynamic_field (type0, f))
8581 field_type = ada_check_typedef (field_type);
8582 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
8585 new_type = static_unwrap_type (field_type);
8587 if (new_type != field_type)
8589 /* Clone TYPE0 only the first time we get a new field type. */
8592 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
8593 TYPE_CODE (type) = TYPE_CODE (type0);
8594 INIT_CPLUS_SPECIFIC (type);
8595 TYPE_NFIELDS (type) = nfields;
8596 TYPE_FIELDS (type) = (struct field *)
8597 TYPE_ALLOC (type, nfields * sizeof (struct field));
8598 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
8599 sizeof (struct field) * nfields);
8600 TYPE_NAME (type) = ada_type_name (type0);
8601 TYPE_FIXED_INSTANCE (type) = 1;
8602 TYPE_LENGTH (type) = 0;
8604 TYPE_FIELD_TYPE (type, f) = new_type;
8605 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
8612 /* Given an object of type TYPE whose contents are at VALADDR and
8613 whose address in memory is ADDRESS, returns a revision of TYPE,
8614 which should be a non-dynamic-sized record, in which the variant
8615 part, if any, is replaced with the appropriate branch. Looks
8616 for discriminant values in DVAL0, which can be NULL if the record
8617 contains the necessary discriminant values. */
8619 static struct type *
8620 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
8621 CORE_ADDR address, struct value *dval0)
8623 struct value *mark = value_mark ();
8626 struct type *branch_type;
8627 int nfields = TYPE_NFIELDS (type);
8628 int variant_field = variant_field_index (type);
8630 if (variant_field == -1)
8635 dval = value_from_contents_and_address (type, valaddr, address);
8636 type = value_type (dval);
8641 rtype = alloc_type_copy (type);
8642 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8643 INIT_CPLUS_SPECIFIC (rtype);
8644 TYPE_NFIELDS (rtype) = nfields;
8645 TYPE_FIELDS (rtype) =
8646 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8647 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
8648 sizeof (struct field) * nfields);
8649 TYPE_NAME (rtype) = ada_type_name (type);
8650 TYPE_FIXED_INSTANCE (rtype) = 1;
8651 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
8653 branch_type = to_fixed_variant_branch_type
8654 (TYPE_FIELD_TYPE (type, variant_field),
8655 cond_offset_host (valaddr,
8656 TYPE_FIELD_BITPOS (type, variant_field)
8658 cond_offset_target (address,
8659 TYPE_FIELD_BITPOS (type, variant_field)
8660 / TARGET_CHAR_BIT), dval);
8661 if (branch_type == NULL)
8665 for (f = variant_field + 1; f < nfields; f += 1)
8666 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8667 TYPE_NFIELDS (rtype) -= 1;
8671 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8672 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8673 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
8674 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
8676 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
8678 value_free_to_mark (mark);
8682 /* An ordinary record type (with fixed-length fields) that describes
8683 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8684 beginning of this section]. Any necessary discriminants' values
8685 should be in DVAL, a record value; it may be NULL if the object
8686 at ADDR itself contains any necessary discriminant values.
8687 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8688 values from the record are needed. Except in the case that DVAL,
8689 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8690 unchecked) is replaced by a particular branch of the variant.
8692 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8693 is questionable and may be removed. It can arise during the
8694 processing of an unconstrained-array-of-record type where all the
8695 variant branches have exactly the same size. This is because in
8696 such cases, the compiler does not bother to use the XVS convention
8697 when encoding the record. I am currently dubious of this
8698 shortcut and suspect the compiler should be altered. FIXME. */
8700 static struct type *
8701 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
8702 CORE_ADDR address, struct value *dval)
8704 struct type *templ_type;
8706 if (TYPE_FIXED_INSTANCE (type0))
8709 templ_type = dynamic_template_type (type0);
8711 if (templ_type != NULL)
8712 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
8713 else if (variant_field_index (type0) >= 0)
8715 if (dval == NULL && valaddr == NULL && address == 0)
8717 return to_record_with_fixed_variant_part (type0, valaddr, address,
8722 TYPE_FIXED_INSTANCE (type0) = 1;
8728 /* An ordinary record type (with fixed-length fields) that describes
8729 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8730 union type. Any necessary discriminants' values should be in DVAL,
8731 a record value. That is, this routine selects the appropriate
8732 branch of the union at ADDR according to the discriminant value
8733 indicated in the union's type name. Returns VAR_TYPE0 itself if
8734 it represents a variant subject to a pragma Unchecked_Union. */
8736 static struct type *
8737 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
8738 CORE_ADDR address, struct value *dval)
8741 struct type *templ_type;
8742 struct type *var_type;
8744 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
8745 var_type = TYPE_TARGET_TYPE (var_type0);
8747 var_type = var_type0;
8749 templ_type = ada_find_parallel_type (var_type, "___XVU");
8751 if (templ_type != NULL)
8752 var_type = templ_type;
8754 if (is_unchecked_variant (var_type, value_type (dval)))
8757 ada_which_variant_applies (var_type,
8758 value_type (dval), value_contents (dval));
8761 return empty_record (var_type);
8762 else if (is_dynamic_field (var_type, which))
8763 return to_fixed_record_type
8764 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
8765 valaddr, address, dval);
8766 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
8768 to_fixed_record_type
8769 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
8771 return TYPE_FIELD_TYPE (var_type, which);
8774 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8775 ENCODING_TYPE, a type following the GNAT conventions for discrete
8776 type encodings, only carries redundant information. */
8779 ada_is_redundant_range_encoding (struct type *range_type,
8780 struct type *encoding_type)
8782 const char *bounds_str;
8786 gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE);
8788 if (TYPE_CODE (get_base_type (range_type))
8789 != TYPE_CODE (get_base_type (encoding_type)))
8791 /* The compiler probably used a simple base type to describe
8792 the range type instead of the range's actual base type,
8793 expecting us to get the real base type from the encoding
8794 anyway. In this situation, the encoding cannot be ignored
8799 if (is_dynamic_type (range_type))
8802 if (TYPE_NAME (encoding_type) == NULL)
8805 bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_");
8806 if (bounds_str == NULL)
8809 n = 8; /* Skip "___XDLU_". */
8810 if (!ada_scan_number (bounds_str, n, &lo, &n))
8812 if (TYPE_LOW_BOUND (range_type) != lo)
8815 n += 2; /* Skip the "__" separator between the two bounds. */
8816 if (!ada_scan_number (bounds_str, n, &hi, &n))
8818 if (TYPE_HIGH_BOUND (range_type) != hi)
8824 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8825 a type following the GNAT encoding for describing array type
8826 indices, only carries redundant information. */
8829 ada_is_redundant_index_type_desc (struct type *array_type,
8830 struct type *desc_type)
8832 struct type *this_layer = check_typedef (array_type);
8835 for (i = 0; i < TYPE_NFIELDS (desc_type); i++)
8837 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer),
8838 TYPE_FIELD_TYPE (desc_type, i)))
8840 this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer));
8846 /* Assuming that TYPE0 is an array type describing the type of a value
8847 at ADDR, and that DVAL describes a record containing any
8848 discriminants used in TYPE0, returns a type for the value that
8849 contains no dynamic components (that is, no components whose sizes
8850 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8851 true, gives an error message if the resulting type's size is over
8854 static struct type *
8855 to_fixed_array_type (struct type *type0, struct value *dval,
8858 struct type *index_type_desc;
8859 struct type *result;
8860 int constrained_packed_array_p;
8861 static const char *xa_suffix = "___XA";
8863 type0 = ada_check_typedef (type0);
8864 if (TYPE_FIXED_INSTANCE (type0))
8867 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
8868 if (constrained_packed_array_p)
8869 type0 = decode_constrained_packed_array_type (type0);
8871 index_type_desc = ada_find_parallel_type (type0, xa_suffix);
8873 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8874 encoding suffixed with 'P' may still be generated. If so,
8875 it should be used to find the XA type. */
8877 if (index_type_desc == NULL)
8879 const char *type_name = ada_type_name (type0);
8881 if (type_name != NULL)
8883 const int len = strlen (type_name);
8884 char *name = (char *) alloca (len + strlen (xa_suffix));
8886 if (type_name[len - 1] == 'P')
8888 strcpy (name, type_name);
8889 strcpy (name + len - 1, xa_suffix);
8890 index_type_desc = ada_find_parallel_type_with_name (type0, name);
8895 ada_fixup_array_indexes_type (index_type_desc);
8896 if (index_type_desc != NULL
8897 && ada_is_redundant_index_type_desc (type0, index_type_desc))
8899 /* Ignore this ___XA parallel type, as it does not bring any
8900 useful information. This allows us to avoid creating fixed
8901 versions of the array's index types, which would be identical
8902 to the original ones. This, in turn, can also help avoid
8903 the creation of fixed versions of the array itself. */
8904 index_type_desc = NULL;
8907 if (index_type_desc == NULL)
8909 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
8911 /* NOTE: elt_type---the fixed version of elt_type0---should never
8912 depend on the contents of the array in properly constructed
8914 /* Create a fixed version of the array element type.
8915 We're not providing the address of an element here,
8916 and thus the actual object value cannot be inspected to do
8917 the conversion. This should not be a problem, since arrays of
8918 unconstrained objects are not allowed. In particular, all
8919 the elements of an array of a tagged type should all be of
8920 the same type specified in the debugging info. No need to
8921 consult the object tag. */
8922 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
8924 /* Make sure we always create a new array type when dealing with
8925 packed array types, since we're going to fix-up the array
8926 type length and element bitsize a little further down. */
8927 if (elt_type0 == elt_type && !constrained_packed_array_p)
8930 result = create_array_type (alloc_type_copy (type0),
8931 elt_type, TYPE_INDEX_TYPE (type0));
8936 struct type *elt_type0;
8939 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
8940 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8942 /* NOTE: result---the fixed version of elt_type0---should never
8943 depend on the contents of the array in properly constructed
8945 /* Create a fixed version of the array element type.
8946 We're not providing the address of an element here,
8947 and thus the actual object value cannot be inspected to do
8948 the conversion. This should not be a problem, since arrays of
8949 unconstrained objects are not allowed. In particular, all
8950 the elements of an array of a tagged type should all be of
8951 the same type specified in the debugging info. No need to
8952 consult the object tag. */
8954 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
8957 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
8959 struct type *range_type =
8960 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
8962 result = create_array_type (alloc_type_copy (elt_type0),
8963 result, range_type);
8964 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8966 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
8967 error (_("array type with dynamic size is larger than varsize-limit"));
8970 /* We want to preserve the type name. This can be useful when
8971 trying to get the type name of a value that has already been
8972 printed (for instance, if the user did "print VAR; whatis $". */
8973 TYPE_NAME (result) = TYPE_NAME (type0);
8975 if (constrained_packed_array_p)
8977 /* So far, the resulting type has been created as if the original
8978 type was a regular (non-packed) array type. As a result, the
8979 bitsize of the array elements needs to be set again, and the array
8980 length needs to be recomputed based on that bitsize. */
8981 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
8982 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
8984 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
8985 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
8986 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
8987 TYPE_LENGTH (result)++;
8990 TYPE_FIXED_INSTANCE (result) = 1;
8995 /* A standard type (containing no dynamically sized components)
8996 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8997 DVAL describes a record containing any discriminants used in TYPE0,
8998 and may be NULL if there are none, or if the object of type TYPE at
8999 ADDRESS or in VALADDR contains these discriminants.
9001 If CHECK_TAG is not null, in the case of tagged types, this function
9002 attempts to locate the object's tag and use it to compute the actual
9003 type. However, when ADDRESS is null, we cannot use it to determine the
9004 location of the tag, and therefore compute the tagged type's actual type.
9005 So we return the tagged type without consulting the tag. */
9007 static struct type *
9008 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
9009 CORE_ADDR address, struct value *dval, int check_tag)
9011 type = ada_check_typedef (type);
9012 switch (TYPE_CODE (type))
9016 case TYPE_CODE_STRUCT:
9018 struct type *static_type = to_static_fixed_type (type);
9019 struct type *fixed_record_type =
9020 to_fixed_record_type (type, valaddr, address, NULL);
9022 /* If STATIC_TYPE is a tagged type and we know the object's address,
9023 then we can determine its tag, and compute the object's actual
9024 type from there. Note that we have to use the fixed record
9025 type (the parent part of the record may have dynamic fields
9026 and the way the location of _tag is expressed may depend on
9029 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
9032 value_tag_from_contents_and_address
9036 struct type *real_type = type_from_tag (tag);
9038 value_from_contents_and_address (fixed_record_type,
9041 fixed_record_type = value_type (obj);
9042 if (real_type != NULL)
9043 return to_fixed_record_type
9045 value_address (ada_tag_value_at_base_address (obj)), NULL);
9048 /* Check to see if there is a parallel ___XVZ variable.
9049 If there is, then it provides the actual size of our type. */
9050 else if (ada_type_name (fixed_record_type) != NULL)
9052 const char *name = ada_type_name (fixed_record_type);
9054 = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */);
9055 bool xvz_found = false;
9058 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
9061 xvz_found = get_int_var_value (xvz_name, size);
9063 CATCH (except, RETURN_MASK_ERROR)
9065 /* We found the variable, but somehow failed to read
9066 its value. Rethrow the same error, but with a little
9067 bit more information, to help the user understand
9068 what went wrong (Eg: the variable might have been
9070 throw_error (except.error,
9071 _("unable to read value of %s (%s)"),
9072 xvz_name, except.message);
9076 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
9078 fixed_record_type = copy_type (fixed_record_type);
9079 TYPE_LENGTH (fixed_record_type) = size;
9081 /* The FIXED_RECORD_TYPE may have be a stub. We have
9082 observed this when the debugging info is STABS, and
9083 apparently it is something that is hard to fix.
9085 In practice, we don't need the actual type definition
9086 at all, because the presence of the XVZ variable allows us
9087 to assume that there must be a XVS type as well, which we
9088 should be able to use later, when we need the actual type
9091 In the meantime, pretend that the "fixed" type we are
9092 returning is NOT a stub, because this can cause trouble
9093 when using this type to create new types targeting it.
9094 Indeed, the associated creation routines often check
9095 whether the target type is a stub and will try to replace
9096 it, thus using a type with the wrong size. This, in turn,
9097 might cause the new type to have the wrong size too.
9098 Consider the case of an array, for instance, where the size
9099 of the array is computed from the number of elements in
9100 our array multiplied by the size of its element. */
9101 TYPE_STUB (fixed_record_type) = 0;
9104 return fixed_record_type;
9106 case TYPE_CODE_ARRAY:
9107 return to_fixed_array_type (type, dval, 1);
9108 case TYPE_CODE_UNION:
9112 return to_fixed_variant_branch_type (type, valaddr, address, dval);
9116 /* The same as ada_to_fixed_type_1, except that it preserves the type
9117 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
9119 The typedef layer needs be preserved in order to differentiate between
9120 arrays and array pointers when both types are implemented using the same
9121 fat pointer. In the array pointer case, the pointer is encoded as
9122 a typedef of the pointer type. For instance, considering:
9124 type String_Access is access String;
9125 S1 : String_Access := null;
9127 To the debugger, S1 is defined as a typedef of type String. But
9128 to the user, it is a pointer. So if the user tries to print S1,
9129 we should not dereference the array, but print the array address
9132 If we didn't preserve the typedef layer, we would lose the fact that
9133 the type is to be presented as a pointer (needs de-reference before
9134 being printed). And we would also use the source-level type name. */
9137 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
9138 CORE_ADDR address, struct value *dval, int check_tag)
9141 struct type *fixed_type =
9142 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
9144 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
9145 then preserve the typedef layer.
9147 Implementation note: We can only check the main-type portion of
9148 the TYPE and FIXED_TYPE, because eliminating the typedef layer
9149 from TYPE now returns a type that has the same instance flags
9150 as TYPE. For instance, if TYPE is a "typedef const", and its
9151 target type is a "struct", then the typedef elimination will return
9152 a "const" version of the target type. See check_typedef for more
9153 details about how the typedef layer elimination is done.
9155 brobecker/2010-11-19: It seems to me that the only case where it is
9156 useful to preserve the typedef layer is when dealing with fat pointers.
9157 Perhaps, we could add a check for that and preserve the typedef layer
9158 only in that situation. But this seems unecessary so far, probably
9159 because we call check_typedef/ada_check_typedef pretty much everywhere.
9161 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
9162 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
9163 == TYPE_MAIN_TYPE (fixed_type)))
9169 /* A standard (static-sized) type corresponding as well as possible to
9170 TYPE0, but based on no runtime data. */
9172 static struct type *
9173 to_static_fixed_type (struct type *type0)
9180 if (TYPE_FIXED_INSTANCE (type0))
9183 type0 = ada_check_typedef (type0);
9185 switch (TYPE_CODE (type0))
9189 case TYPE_CODE_STRUCT:
9190 type = dynamic_template_type (type0);
9192 return template_to_static_fixed_type (type);
9194 return template_to_static_fixed_type (type0);
9195 case TYPE_CODE_UNION:
9196 type = ada_find_parallel_type (type0, "___XVU");
9198 return template_to_static_fixed_type (type);
9200 return template_to_static_fixed_type (type0);
9204 /* A static approximation of TYPE with all type wrappers removed. */
9206 static struct type *
9207 static_unwrap_type (struct type *type)
9209 if (ada_is_aligner_type (type))
9211 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
9212 if (ada_type_name (type1) == NULL)
9213 TYPE_NAME (type1) = ada_type_name (type);
9215 return static_unwrap_type (type1);
9219 struct type *raw_real_type = ada_get_base_type (type);
9221 if (raw_real_type == type)
9224 return to_static_fixed_type (raw_real_type);
9228 /* In some cases, incomplete and private types require
9229 cross-references that are not resolved as records (for example,
9231 type FooP is access Foo;
9233 type Foo is array ...;
9234 ). In these cases, since there is no mechanism for producing
9235 cross-references to such types, we instead substitute for FooP a
9236 stub enumeration type that is nowhere resolved, and whose tag is
9237 the name of the actual type. Call these types "non-record stubs". */
9239 /* A type equivalent to TYPE that is not a non-record stub, if one
9240 exists, otherwise TYPE. */
9243 ada_check_typedef (struct type *type)
9248 /* If our type is a typedef type of a fat pointer, then we're done.
9249 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9250 what allows us to distinguish between fat pointers that represent
9251 array types, and fat pointers that represent array access types
9252 (in both cases, the compiler implements them as fat pointers). */
9253 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
9254 && is_thick_pntr (ada_typedef_target_type (type)))
9257 type = check_typedef (type);
9258 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
9259 || !TYPE_STUB (type)
9260 || TYPE_NAME (type) == NULL)
9264 const char *name = TYPE_NAME (type);
9265 struct type *type1 = ada_find_any_type (name);
9270 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9271 stubs pointing to arrays, as we don't create symbols for array
9272 types, only for the typedef-to-array types). If that's the case,
9273 strip the typedef layer. */
9274 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
9275 type1 = ada_check_typedef (type1);
9281 /* A value representing the data at VALADDR/ADDRESS as described by
9282 type TYPE0, but with a standard (static-sized) type that correctly
9283 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9284 type, then return VAL0 [this feature is simply to avoid redundant
9285 creation of struct values]. */
9287 static struct value *
9288 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
9291 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
9293 if (type == type0 && val0 != NULL)
9296 if (VALUE_LVAL (val0) != lval_memory)
9298 /* Our value does not live in memory; it could be a convenience
9299 variable, for instance. Create a not_lval value using val0's
9301 return value_from_contents (type, value_contents (val0));
9304 return value_from_contents_and_address (type, 0, address);
9307 /* A value representing VAL, but with a standard (static-sized) type
9308 that correctly describes it. Does not necessarily create a new
9312 ada_to_fixed_value (struct value *val)
9314 val = unwrap_value (val);
9315 val = ada_to_fixed_value_create (value_type (val),
9316 value_address (val),
9324 /* Table mapping attribute numbers to names.
9325 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9327 static const char *attribute_names[] = {
9345 ada_attribute_name (enum exp_opcode n)
9347 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
9348 return attribute_names[n - OP_ATR_FIRST + 1];
9350 return attribute_names[0];
9353 /* Evaluate the 'POS attribute applied to ARG. */
9356 pos_atr (struct value *arg)
9358 struct value *val = coerce_ref (arg);
9359 struct type *type = value_type (val);
9362 if (!discrete_type_p (type))
9363 error (_("'POS only defined on discrete types"));
9365 if (!discrete_position (type, value_as_long (val), &result))
9366 error (_("enumeration value is invalid: can't find 'POS"));
9371 static struct value *
9372 value_pos_atr (struct type *type, struct value *arg)
9374 return value_from_longest (type, pos_atr (arg));
9377 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9379 static struct value *
9380 value_val_atr (struct type *type, struct value *arg)
9382 if (!discrete_type_p (type))
9383 error (_("'VAL only defined on discrete types"));
9384 if (!integer_type_p (value_type (arg)))
9385 error (_("'VAL requires integral argument"));
9387 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
9389 long pos = value_as_long (arg);
9391 if (pos < 0 || pos >= TYPE_NFIELDS (type))
9392 error (_("argument to 'VAL out of range"));
9393 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
9396 return value_from_longest (type, value_as_long (arg));
9402 /* True if TYPE appears to be an Ada character type.
9403 [At the moment, this is true only for Character and Wide_Character;
9404 It is a heuristic test that could stand improvement]. */
9407 ada_is_character_type (struct type *type)
9411 /* If the type code says it's a character, then assume it really is,
9412 and don't check any further. */
9413 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
9416 /* Otherwise, assume it's a character type iff it is a discrete type
9417 with a known character type name. */
9418 name = ada_type_name (type);
9419 return (name != NULL
9420 && (TYPE_CODE (type) == TYPE_CODE_INT
9421 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9422 && (strcmp (name, "character") == 0
9423 || strcmp (name, "wide_character") == 0
9424 || strcmp (name, "wide_wide_character") == 0
9425 || strcmp (name, "unsigned char") == 0));
9428 /* True if TYPE appears to be an Ada string type. */
9431 ada_is_string_type (struct type *type)
9433 type = ada_check_typedef (type);
9435 && TYPE_CODE (type) != TYPE_CODE_PTR
9436 && (ada_is_simple_array_type (type)
9437 || ada_is_array_descriptor_type (type))
9438 && ada_array_arity (type) == 1)
9440 struct type *elttype = ada_array_element_type (type, 1);
9442 return ada_is_character_type (elttype);
9448 /* The compiler sometimes provides a parallel XVS type for a given
9449 PAD type. Normally, it is safe to follow the PAD type directly,
9450 but older versions of the compiler have a bug that causes the offset
9451 of its "F" field to be wrong. Following that field in that case
9452 would lead to incorrect results, but this can be worked around
9453 by ignoring the PAD type and using the associated XVS type instead.
9455 Set to True if the debugger should trust the contents of PAD types.
9456 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9457 static int trust_pad_over_xvs = 1;
9459 /* True if TYPE is a struct type introduced by the compiler to force the
9460 alignment of a value. Such types have a single field with a
9461 distinctive name. */
9464 ada_is_aligner_type (struct type *type)
9466 type = ada_check_typedef (type);
9468 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
9471 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
9472 && TYPE_NFIELDS (type) == 1
9473 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
9476 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9477 the parallel type. */
9480 ada_get_base_type (struct type *raw_type)
9482 struct type *real_type_namer;
9483 struct type *raw_real_type;
9485 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
9488 if (ada_is_aligner_type (raw_type))
9489 /* The encoding specifies that we should always use the aligner type.
9490 So, even if this aligner type has an associated XVS type, we should
9493 According to the compiler gurus, an XVS type parallel to an aligner
9494 type may exist because of a stabs limitation. In stabs, aligner
9495 types are empty because the field has a variable-sized type, and
9496 thus cannot actually be used as an aligner type. As a result,
9497 we need the associated parallel XVS type to decode the type.
9498 Since the policy in the compiler is to not change the internal
9499 representation based on the debugging info format, we sometimes
9500 end up having a redundant XVS type parallel to the aligner type. */
9503 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
9504 if (real_type_namer == NULL
9505 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
9506 || TYPE_NFIELDS (real_type_namer) != 1)
9509 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
9511 /* This is an older encoding form where the base type needs to be
9512 looked up by name. We prefer the newer enconding because it is
9514 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
9515 if (raw_real_type == NULL)
9518 return raw_real_type;
9521 /* The field in our XVS type is a reference to the base type. */
9522 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
9525 /* The type of value designated by TYPE, with all aligners removed. */
9528 ada_aligned_type (struct type *type)
9530 if (ada_is_aligner_type (type))
9531 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
9533 return ada_get_base_type (type);
9537 /* The address of the aligned value in an object at address VALADDR
9538 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9541 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
9543 if (ada_is_aligner_type (type))
9544 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
9546 TYPE_FIELD_BITPOS (type,
9547 0) / TARGET_CHAR_BIT);
9554 /* The printed representation of an enumeration literal with encoded
9555 name NAME. The value is good to the next call of ada_enum_name. */
9557 ada_enum_name (const char *name)
9559 static char *result;
9560 static size_t result_len = 0;
9563 /* First, unqualify the enumeration name:
9564 1. Search for the last '.' character. If we find one, then skip
9565 all the preceding characters, the unqualified name starts
9566 right after that dot.
9567 2. Otherwise, we may be debugging on a target where the compiler
9568 translates dots into "__". Search forward for double underscores,
9569 but stop searching when we hit an overloading suffix, which is
9570 of the form "__" followed by digits. */
9572 tmp = strrchr (name, '.');
9577 while ((tmp = strstr (name, "__")) != NULL)
9579 if (isdigit (tmp[2]))
9590 if (name[1] == 'U' || name[1] == 'W')
9592 if (sscanf (name + 2, "%x", &v) != 1)
9598 GROW_VECT (result, result_len, 16);
9599 if (isascii (v) && isprint (v))
9600 xsnprintf (result, result_len, "'%c'", v);
9601 else if (name[1] == 'U')
9602 xsnprintf (result, result_len, "[\"%02x\"]", v);
9604 xsnprintf (result, result_len, "[\"%04x\"]", v);
9610 tmp = strstr (name, "__");
9612 tmp = strstr (name, "$");
9615 GROW_VECT (result, result_len, tmp - name + 1);
9616 strncpy (result, name, tmp - name);
9617 result[tmp - name] = '\0';
9625 /* Evaluate the subexpression of EXP starting at *POS as for
9626 evaluate_type, updating *POS to point just past the evaluated
9629 static struct value *
9630 evaluate_subexp_type (struct expression *exp, int *pos)
9632 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9635 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9638 static struct value *
9639 unwrap_value (struct value *val)
9641 struct type *type = ada_check_typedef (value_type (val));
9643 if (ada_is_aligner_type (type))
9645 struct value *v = ada_value_struct_elt (val, "F", 0);
9646 struct type *val_type = ada_check_typedef (value_type (v));
9648 if (ada_type_name (val_type) == NULL)
9649 TYPE_NAME (val_type) = ada_type_name (type);
9651 return unwrap_value (v);
9655 struct type *raw_real_type =
9656 ada_check_typedef (ada_get_base_type (type));
9658 /* If there is no parallel XVS or XVE type, then the value is
9659 already unwrapped. Return it without further modification. */
9660 if ((type == raw_real_type)
9661 && ada_find_parallel_type (type, "___XVE") == NULL)
9665 coerce_unspec_val_to_type
9666 (val, ada_to_fixed_type (raw_real_type, 0,
9667 value_address (val),
9672 static struct value *
9673 cast_from_fixed (struct type *type, struct value *arg)
9675 struct value *scale = ada_scaling_factor (value_type (arg));
9676 arg = value_cast (value_type (scale), arg);
9678 arg = value_binop (arg, scale, BINOP_MUL);
9679 return value_cast (type, arg);
9682 static struct value *
9683 cast_to_fixed (struct type *type, struct value *arg)
9685 if (type == value_type (arg))
9688 struct value *scale = ada_scaling_factor (type);
9689 if (ada_is_fixed_point_type (value_type (arg)))
9690 arg = cast_from_fixed (value_type (scale), arg);
9692 arg = value_cast (value_type (scale), arg);
9694 arg = value_binop (arg, scale, BINOP_DIV);
9695 return value_cast (type, arg);
9698 /* Given two array types T1 and T2, return nonzero iff both arrays
9699 contain the same number of elements. */
9702 ada_same_array_size_p (struct type *t1, struct type *t2)
9704 LONGEST lo1, hi1, lo2, hi2;
9706 /* Get the array bounds in order to verify that the size of
9707 the two arrays match. */
9708 if (!get_array_bounds (t1, &lo1, &hi1)
9709 || !get_array_bounds (t2, &lo2, &hi2))
9710 error (_("unable to determine array bounds"));
9712 /* To make things easier for size comparison, normalize a bit
9713 the case of empty arrays by making sure that the difference
9714 between upper bound and lower bound is always -1. */
9720 return (hi1 - lo1 == hi2 - lo2);
9723 /* Assuming that VAL is an array of integrals, and TYPE represents
9724 an array with the same number of elements, but with wider integral
9725 elements, return an array "casted" to TYPE. In practice, this
9726 means that the returned array is built by casting each element
9727 of the original array into TYPE's (wider) element type. */
9729 static struct value *
9730 ada_promote_array_of_integrals (struct type *type, struct value *val)
9732 struct type *elt_type = TYPE_TARGET_TYPE (type);
9737 /* Verify that both val and type are arrays of scalars, and
9738 that the size of val's elements is smaller than the size
9739 of type's element. */
9740 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
9741 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
9742 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
9743 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
9744 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
9745 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
9747 if (!get_array_bounds (type, &lo, &hi))
9748 error (_("unable to determine array bounds"));
9750 res = allocate_value (type);
9752 /* Promote each array element. */
9753 for (i = 0; i < hi - lo + 1; i++)
9755 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
9757 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
9758 value_contents_all (elt), TYPE_LENGTH (elt_type));
9764 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9765 return the converted value. */
9767 static struct value *
9768 coerce_for_assign (struct type *type, struct value *val)
9770 struct type *type2 = value_type (val);
9775 type2 = ada_check_typedef (type2);
9776 type = ada_check_typedef (type);
9778 if (TYPE_CODE (type2) == TYPE_CODE_PTR
9779 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9781 val = ada_value_ind (val);
9782 type2 = value_type (val);
9785 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
9786 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9788 if (!ada_same_array_size_p (type, type2))
9789 error (_("cannot assign arrays of different length"));
9791 if (is_integral_type (TYPE_TARGET_TYPE (type))
9792 && is_integral_type (TYPE_TARGET_TYPE (type2))
9793 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9794 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9796 /* Allow implicit promotion of the array elements to
9798 return ada_promote_array_of_integrals (type, val);
9801 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9802 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9803 error (_("Incompatible types in assignment"));
9804 deprecated_set_value_type (val, type);
9809 static struct value *
9810 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
9813 struct type *type1, *type2;
9816 arg1 = coerce_ref (arg1);
9817 arg2 = coerce_ref (arg2);
9818 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
9819 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
9821 if (TYPE_CODE (type1) != TYPE_CODE_INT
9822 || TYPE_CODE (type2) != TYPE_CODE_INT)
9823 return value_binop (arg1, arg2, op);
9832 return value_binop (arg1, arg2, op);
9835 v2 = value_as_long (arg2);
9837 error (_("second operand of %s must not be zero."), op_string (op));
9839 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
9840 return value_binop (arg1, arg2, op);
9842 v1 = value_as_long (arg1);
9847 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
9848 v += v > 0 ? -1 : 1;
9856 /* Should not reach this point. */
9860 val = allocate_value (type1);
9861 store_unsigned_integer (value_contents_raw (val),
9862 TYPE_LENGTH (value_type (val)),
9863 gdbarch_byte_order (get_type_arch (type1)), v);
9868 ada_value_equal (struct value *arg1, struct value *arg2)
9870 if (ada_is_direct_array_type (value_type (arg1))
9871 || ada_is_direct_array_type (value_type (arg2)))
9873 struct type *arg1_type, *arg2_type;
9875 /* Automatically dereference any array reference before
9876 we attempt to perform the comparison. */
9877 arg1 = ada_coerce_ref (arg1);
9878 arg2 = ada_coerce_ref (arg2);
9880 arg1 = ada_coerce_to_simple_array (arg1);
9881 arg2 = ada_coerce_to_simple_array (arg2);
9883 arg1_type = ada_check_typedef (value_type (arg1));
9884 arg2_type = ada_check_typedef (value_type (arg2));
9886 if (TYPE_CODE (arg1_type) != TYPE_CODE_ARRAY
9887 || TYPE_CODE (arg2_type) != TYPE_CODE_ARRAY)
9888 error (_("Attempt to compare array with non-array"));
9889 /* FIXME: The following works only for types whose
9890 representations use all bits (no padding or undefined bits)
9891 and do not have user-defined equality. */
9892 return (TYPE_LENGTH (arg1_type) == TYPE_LENGTH (arg2_type)
9893 && memcmp (value_contents (arg1), value_contents (arg2),
9894 TYPE_LENGTH (arg1_type)) == 0);
9896 return value_equal (arg1, arg2);
9899 /* Total number of component associations in the aggregate starting at
9900 index PC in EXP. Assumes that index PC is the start of an
9904 num_component_specs (struct expression *exp, int pc)
9908 m = exp->elts[pc + 1].longconst;
9911 for (i = 0; i < m; i += 1)
9913 switch (exp->elts[pc].opcode)
9919 n += exp->elts[pc + 1].longconst;
9922 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
9927 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9928 component of LHS (a simple array or a record), updating *POS past
9929 the expression, assuming that LHS is contained in CONTAINER. Does
9930 not modify the inferior's memory, nor does it modify LHS (unless
9931 LHS == CONTAINER). */
9934 assign_component (struct value *container, struct value *lhs, LONGEST index,
9935 struct expression *exp, int *pos)
9937 struct value *mark = value_mark ();
9939 struct type *lhs_type = check_typedef (value_type (lhs));
9941 if (TYPE_CODE (lhs_type) == TYPE_CODE_ARRAY)
9943 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
9944 struct value *index_val = value_from_longest (index_type, index);
9946 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
9950 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
9951 elt = ada_to_fixed_value (elt);
9954 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9955 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
9957 value_assign_to_component (container, elt,
9958 ada_evaluate_subexp (NULL, exp, pos,
9961 value_free_to_mark (mark);
9964 /* Assuming that LHS represents an lvalue having a record or array
9965 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9966 of that aggregate's value to LHS, advancing *POS past the
9967 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9968 lvalue containing LHS (possibly LHS itself). Does not modify
9969 the inferior's memory, nor does it modify the contents of
9970 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9972 static struct value *
9973 assign_aggregate (struct value *container,
9974 struct value *lhs, struct expression *exp,
9975 int *pos, enum noside noside)
9977 struct type *lhs_type;
9978 int n = exp->elts[*pos+1].longconst;
9979 LONGEST low_index, high_index;
9982 int max_indices, num_indices;
9986 if (noside != EVAL_NORMAL)
9988 for (i = 0; i < n; i += 1)
9989 ada_evaluate_subexp (NULL, exp, pos, noside);
9993 container = ada_coerce_ref (container);
9994 if (ada_is_direct_array_type (value_type (container)))
9995 container = ada_coerce_to_simple_array (container);
9996 lhs = ada_coerce_ref (lhs);
9997 if (!deprecated_value_modifiable (lhs))
9998 error (_("Left operand of assignment is not a modifiable lvalue."));
10000 lhs_type = check_typedef (value_type (lhs));
10001 if (ada_is_direct_array_type (lhs_type))
10003 lhs = ada_coerce_to_simple_array (lhs);
10004 lhs_type = check_typedef (value_type (lhs));
10005 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
10006 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
10008 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
10011 high_index = num_visible_fields (lhs_type) - 1;
10014 error (_("Left-hand side must be array or record."));
10016 num_specs = num_component_specs (exp, *pos - 3);
10017 max_indices = 4 * num_specs + 4;
10018 indices = XALLOCAVEC (LONGEST, max_indices);
10019 indices[0] = indices[1] = low_index - 1;
10020 indices[2] = indices[3] = high_index + 1;
10023 for (i = 0; i < n; i += 1)
10025 switch (exp->elts[*pos].opcode)
10028 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
10029 &num_indices, max_indices,
10030 low_index, high_index);
10032 case OP_POSITIONAL:
10033 aggregate_assign_positional (container, lhs, exp, pos, indices,
10034 &num_indices, max_indices,
10035 low_index, high_index);
10039 error (_("Misplaced 'others' clause"));
10040 aggregate_assign_others (container, lhs, exp, pos, indices,
10041 num_indices, low_index, high_index);
10044 error (_("Internal error: bad aggregate clause"));
10051 /* Assign into the component of LHS indexed by the OP_POSITIONAL
10052 construct at *POS, updating *POS past the construct, given that
10053 the positions are relative to lower bound LOW, where HIGH is the
10054 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
10055 updating *NUM_INDICES as needed. CONTAINER is as for
10056 assign_aggregate. */
10058 aggregate_assign_positional (struct value *container,
10059 struct value *lhs, struct expression *exp,
10060 int *pos, LONGEST *indices, int *num_indices,
10061 int max_indices, LONGEST low, LONGEST high)
10063 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
10065 if (ind - 1 == high)
10066 warning (_("Extra components in aggregate ignored."));
10069 add_component_interval (ind, ind, indices, num_indices, max_indices);
10071 assign_component (container, lhs, ind, exp, pos);
10074 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10077 /* Assign into the components of LHS indexed by the OP_CHOICES
10078 construct at *POS, updating *POS past the construct, given that
10079 the allowable indices are LOW..HIGH. Record the indices assigned
10080 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
10081 needed. CONTAINER is as for assign_aggregate. */
10083 aggregate_assign_from_choices (struct value *container,
10084 struct value *lhs, struct expression *exp,
10085 int *pos, LONGEST *indices, int *num_indices,
10086 int max_indices, LONGEST low, LONGEST high)
10089 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
10090 int choice_pos, expr_pc;
10091 int is_array = ada_is_direct_array_type (value_type (lhs));
10093 choice_pos = *pos += 3;
10095 for (j = 0; j < n_choices; j += 1)
10096 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10098 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10100 for (j = 0; j < n_choices; j += 1)
10102 LONGEST lower, upper;
10103 enum exp_opcode op = exp->elts[choice_pos].opcode;
10105 if (op == OP_DISCRETE_RANGE)
10108 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10110 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10115 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
10127 name = &exp->elts[choice_pos + 2].string;
10130 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
10133 error (_("Invalid record component association."));
10135 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
10137 if (! find_struct_field (name, value_type (lhs), 0,
10138 NULL, NULL, NULL, NULL, &ind))
10139 error (_("Unknown component name: %s."), name);
10140 lower = upper = ind;
10143 if (lower <= upper && (lower < low || upper > high))
10144 error (_("Index in component association out of bounds."));
10146 add_component_interval (lower, upper, indices, num_indices,
10148 while (lower <= upper)
10153 assign_component (container, lhs, lower, exp, &pos1);
10159 /* Assign the value of the expression in the OP_OTHERS construct in
10160 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
10161 have not been previously assigned. The index intervals already assigned
10162 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
10163 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
10165 aggregate_assign_others (struct value *container,
10166 struct value *lhs, struct expression *exp,
10167 int *pos, LONGEST *indices, int num_indices,
10168 LONGEST low, LONGEST high)
10171 int expr_pc = *pos + 1;
10173 for (i = 0; i < num_indices - 2; i += 2)
10177 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
10181 localpos = expr_pc;
10182 assign_component (container, lhs, ind, exp, &localpos);
10185 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10188 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
10189 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10190 modifying *SIZE as needed. It is an error if *SIZE exceeds
10191 MAX_SIZE. The resulting intervals do not overlap. */
10193 add_component_interval (LONGEST low, LONGEST high,
10194 LONGEST* indices, int *size, int max_size)
10198 for (i = 0; i < *size; i += 2) {
10199 if (high >= indices[i] && low <= indices[i + 1])
10203 for (kh = i + 2; kh < *size; kh += 2)
10204 if (high < indices[kh])
10206 if (low < indices[i])
10208 indices[i + 1] = indices[kh - 1];
10209 if (high > indices[i + 1])
10210 indices[i + 1] = high;
10211 memcpy (indices + i + 2, indices + kh, *size - kh);
10212 *size -= kh - i - 2;
10215 else if (high < indices[i])
10219 if (*size == max_size)
10220 error (_("Internal error: miscounted aggregate components."));
10222 for (j = *size-1; j >= i+2; j -= 1)
10223 indices[j] = indices[j - 2];
10225 indices[i + 1] = high;
10228 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10231 static struct value *
10232 ada_value_cast (struct type *type, struct value *arg2)
10234 if (type == ada_check_typedef (value_type (arg2)))
10237 if (ada_is_fixed_point_type (type))
10238 return (cast_to_fixed (type, arg2));
10240 if (ada_is_fixed_point_type (value_type (arg2)))
10241 return cast_from_fixed (type, arg2);
10243 return value_cast (type, arg2);
10246 /* Evaluating Ada expressions, and printing their result.
10247 ------------------------------------------------------
10252 We usually evaluate an Ada expression in order to print its value.
10253 We also evaluate an expression in order to print its type, which
10254 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10255 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10256 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10257 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10260 Evaluating expressions is a little more complicated for Ada entities
10261 than it is for entities in languages such as C. The main reason for
10262 this is that Ada provides types whose definition might be dynamic.
10263 One example of such types is variant records. Or another example
10264 would be an array whose bounds can only be known at run time.
10266 The following description is a general guide as to what should be
10267 done (and what should NOT be done) in order to evaluate an expression
10268 involving such types, and when. This does not cover how the semantic
10269 information is encoded by GNAT as this is covered separatly. For the
10270 document used as the reference for the GNAT encoding, see exp_dbug.ads
10271 in the GNAT sources.
10273 Ideally, we should embed each part of this description next to its
10274 associated code. Unfortunately, the amount of code is so vast right
10275 now that it's hard to see whether the code handling a particular
10276 situation might be duplicated or not. One day, when the code is
10277 cleaned up, this guide might become redundant with the comments
10278 inserted in the code, and we might want to remove it.
10280 2. ``Fixing'' an Entity, the Simple Case:
10281 -----------------------------------------
10283 When evaluating Ada expressions, the tricky issue is that they may
10284 reference entities whose type contents and size are not statically
10285 known. Consider for instance a variant record:
10287 type Rec (Empty : Boolean := True) is record
10290 when False => Value : Integer;
10293 Yes : Rec := (Empty => False, Value => 1);
10294 No : Rec := (empty => True);
10296 The size and contents of that record depends on the value of the
10297 descriminant (Rec.Empty). At this point, neither the debugging
10298 information nor the associated type structure in GDB are able to
10299 express such dynamic types. So what the debugger does is to create
10300 "fixed" versions of the type that applies to the specific object.
10301 We also informally refer to this opperation as "fixing" an object,
10302 which means creating its associated fixed type.
10304 Example: when printing the value of variable "Yes" above, its fixed
10305 type would look like this:
10312 On the other hand, if we printed the value of "No", its fixed type
10319 Things become a little more complicated when trying to fix an entity
10320 with a dynamic type that directly contains another dynamic type,
10321 such as an array of variant records, for instance. There are
10322 two possible cases: Arrays, and records.
10324 3. ``Fixing'' Arrays:
10325 ---------------------
10327 The type structure in GDB describes an array in terms of its bounds,
10328 and the type of its elements. By design, all elements in the array
10329 have the same type and we cannot represent an array of variant elements
10330 using the current type structure in GDB. When fixing an array,
10331 we cannot fix the array element, as we would potentially need one
10332 fixed type per element of the array. As a result, the best we can do
10333 when fixing an array is to produce an array whose bounds and size
10334 are correct (allowing us to read it from memory), but without having
10335 touched its element type. Fixing each element will be done later,
10336 when (if) necessary.
10338 Arrays are a little simpler to handle than records, because the same
10339 amount of memory is allocated for each element of the array, even if
10340 the amount of space actually used by each element differs from element
10341 to element. Consider for instance the following array of type Rec:
10343 type Rec_Array is array (1 .. 2) of Rec;
10345 The actual amount of memory occupied by each element might be different
10346 from element to element, depending on the value of their discriminant.
10347 But the amount of space reserved for each element in the array remains
10348 fixed regardless. So we simply need to compute that size using
10349 the debugging information available, from which we can then determine
10350 the array size (we multiply the number of elements of the array by
10351 the size of each element).
10353 The simplest case is when we have an array of a constrained element
10354 type. For instance, consider the following type declarations:
10356 type Bounded_String (Max_Size : Integer) is
10358 Buffer : String (1 .. Max_Size);
10360 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10362 In this case, the compiler describes the array as an array of
10363 variable-size elements (identified by its XVS suffix) for which
10364 the size can be read in the parallel XVZ variable.
10366 In the case of an array of an unconstrained element type, the compiler
10367 wraps the array element inside a private PAD type. This type should not
10368 be shown to the user, and must be "unwrap"'ed before printing. Note
10369 that we also use the adjective "aligner" in our code to designate
10370 these wrapper types.
10372 In some cases, the size allocated for each element is statically
10373 known. In that case, the PAD type already has the correct size,
10374 and the array element should remain unfixed.
10376 But there are cases when this size is not statically known.
10377 For instance, assuming that "Five" is an integer variable:
10379 type Dynamic is array (1 .. Five) of Integer;
10380 type Wrapper (Has_Length : Boolean := False) is record
10383 when True => Length : Integer;
10384 when False => null;
10387 type Wrapper_Array is array (1 .. 2) of Wrapper;
10389 Hello : Wrapper_Array := (others => (Has_Length => True,
10390 Data => (others => 17),
10394 The debugging info would describe variable Hello as being an
10395 array of a PAD type. The size of that PAD type is not statically
10396 known, but can be determined using a parallel XVZ variable.
10397 In that case, a copy of the PAD type with the correct size should
10398 be used for the fixed array.
10400 3. ``Fixing'' record type objects:
10401 ----------------------------------
10403 Things are slightly different from arrays in the case of dynamic
10404 record types. In this case, in order to compute the associated
10405 fixed type, we need to determine the size and offset of each of
10406 its components. This, in turn, requires us to compute the fixed
10407 type of each of these components.
10409 Consider for instance the example:
10411 type Bounded_String (Max_Size : Natural) is record
10412 Str : String (1 .. Max_Size);
10415 My_String : Bounded_String (Max_Size => 10);
10417 In that case, the position of field "Length" depends on the size
10418 of field Str, which itself depends on the value of the Max_Size
10419 discriminant. In order to fix the type of variable My_String,
10420 we need to fix the type of field Str. Therefore, fixing a variant
10421 record requires us to fix each of its components.
10423 However, if a component does not have a dynamic size, the component
10424 should not be fixed. In particular, fields that use a PAD type
10425 should not fixed. Here is an example where this might happen
10426 (assuming type Rec above):
10428 type Container (Big : Boolean) is record
10432 when True => Another : Integer;
10433 when False => null;
10436 My_Container : Container := (Big => False,
10437 First => (Empty => True),
10440 In that example, the compiler creates a PAD type for component First,
10441 whose size is constant, and then positions the component After just
10442 right after it. The offset of component After is therefore constant
10445 The debugger computes the position of each field based on an algorithm
10446 that uses, among other things, the actual position and size of the field
10447 preceding it. Let's now imagine that the user is trying to print
10448 the value of My_Container. If the type fixing was recursive, we would
10449 end up computing the offset of field After based on the size of the
10450 fixed version of field First. And since in our example First has
10451 only one actual field, the size of the fixed type is actually smaller
10452 than the amount of space allocated to that field, and thus we would
10453 compute the wrong offset of field After.
10455 To make things more complicated, we need to watch out for dynamic
10456 components of variant records (identified by the ___XVL suffix in
10457 the component name). Even if the target type is a PAD type, the size
10458 of that type might not be statically known. So the PAD type needs
10459 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10460 we might end up with the wrong size for our component. This can be
10461 observed with the following type declarations:
10463 type Octal is new Integer range 0 .. 7;
10464 type Octal_Array is array (Positive range <>) of Octal;
10465 pragma Pack (Octal_Array);
10467 type Octal_Buffer (Size : Positive) is record
10468 Buffer : Octal_Array (1 .. Size);
10472 In that case, Buffer is a PAD type whose size is unset and needs
10473 to be computed by fixing the unwrapped type.
10475 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10476 ----------------------------------------------------------
10478 Lastly, when should the sub-elements of an entity that remained unfixed
10479 thus far, be actually fixed?
10481 The answer is: Only when referencing that element. For instance
10482 when selecting one component of a record, this specific component
10483 should be fixed at that point in time. Or when printing the value
10484 of a record, each component should be fixed before its value gets
10485 printed. Similarly for arrays, the element of the array should be
10486 fixed when printing each element of the array, or when extracting
10487 one element out of that array. On the other hand, fixing should
10488 not be performed on the elements when taking a slice of an array!
10490 Note that one of the side effects of miscomputing the offset and
10491 size of each field is that we end up also miscomputing the size
10492 of the containing type. This can have adverse results when computing
10493 the value of an entity. GDB fetches the value of an entity based
10494 on the size of its type, and thus a wrong size causes GDB to fetch
10495 the wrong amount of memory. In the case where the computed size is
10496 too small, GDB fetches too little data to print the value of our
10497 entity. Results in this case are unpredictable, as we usually read
10498 past the buffer containing the data =:-o. */
10500 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10501 for that subexpression cast to TO_TYPE. Advance *POS over the
10505 ada_evaluate_subexp_for_cast (expression *exp, int *pos,
10506 enum noside noside, struct type *to_type)
10510 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE
10511 || exp->elts[pc].opcode == OP_VAR_VALUE)
10516 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
10518 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10519 return value_zero (to_type, not_lval);
10521 val = evaluate_var_msym_value (noside,
10522 exp->elts[pc + 1].objfile,
10523 exp->elts[pc + 2].msymbol);
10526 val = evaluate_var_value (noside,
10527 exp->elts[pc + 1].block,
10528 exp->elts[pc + 2].symbol);
10530 if (noside == EVAL_SKIP)
10531 return eval_skip_value (exp);
10533 val = ada_value_cast (to_type, val);
10535 /* Follow the Ada language semantics that do not allow taking
10536 an address of the result of a cast (view conversion in Ada). */
10537 if (VALUE_LVAL (val) == lval_memory)
10539 if (value_lazy (val))
10540 value_fetch_lazy (val);
10541 VALUE_LVAL (val) = not_lval;
10546 value *val = evaluate_subexp (to_type, exp, pos, noside);
10547 if (noside == EVAL_SKIP)
10548 return eval_skip_value (exp);
10549 return ada_value_cast (to_type, val);
10552 /* Implement the evaluate_exp routine in the exp_descriptor structure
10553 for the Ada language. */
10555 static struct value *
10556 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
10557 int *pos, enum noside noside)
10559 enum exp_opcode op;
10563 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
10566 struct value **argvec;
10570 op = exp->elts[pc].opcode;
10576 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10578 if (noside == EVAL_NORMAL)
10579 arg1 = unwrap_value (arg1);
10581 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10582 then we need to perform the conversion manually, because
10583 evaluate_subexp_standard doesn't do it. This conversion is
10584 necessary in Ada because the different kinds of float/fixed
10585 types in Ada have different representations.
10587 Similarly, we need to perform the conversion from OP_LONG
10589 if ((op == OP_FLOAT || op == OP_LONG) && expect_type != NULL)
10590 arg1 = ada_value_cast (expect_type, arg1);
10596 struct value *result;
10599 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
10600 /* The result type will have code OP_STRING, bashed there from
10601 OP_ARRAY. Bash it back. */
10602 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
10603 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
10609 type = exp->elts[pc + 1].type;
10610 return ada_evaluate_subexp_for_cast (exp, pos, noside, type);
10614 type = exp->elts[pc + 1].type;
10615 return ada_evaluate_subexp (type, exp, pos, noside);
10618 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10619 if (exp->elts[*pos].opcode == OP_AGGREGATE)
10621 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
10622 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10624 return ada_value_assign (arg1, arg1);
10626 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10627 except if the lhs of our assignment is a convenience variable.
10628 In the case of assigning to a convenience variable, the lhs
10629 should be exactly the result of the evaluation of the rhs. */
10630 type = value_type (arg1);
10631 if (VALUE_LVAL (arg1) == lval_internalvar)
10633 arg2 = evaluate_subexp (type, exp, pos, noside);
10634 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10636 if (ada_is_fixed_point_type (value_type (arg1)))
10637 arg2 = cast_to_fixed (value_type (arg1), arg2);
10638 else if (ada_is_fixed_point_type (value_type (arg2)))
10640 (_("Fixed-point values must be assigned to fixed-point variables"));
10642 arg2 = coerce_for_assign (value_type (arg1), arg2);
10643 return ada_value_assign (arg1, arg2);
10646 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10647 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10648 if (noside == EVAL_SKIP)
10650 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10651 return (value_from_longest
10652 (value_type (arg1),
10653 value_as_long (arg1) + value_as_long (arg2)));
10654 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10655 return (value_from_longest
10656 (value_type (arg2),
10657 value_as_long (arg1) + value_as_long (arg2)));
10658 if ((ada_is_fixed_point_type (value_type (arg1))
10659 || ada_is_fixed_point_type (value_type (arg2)))
10660 && value_type (arg1) != value_type (arg2))
10661 error (_("Operands of fixed-point addition must have the same type"));
10662 /* Do the addition, and cast the result to the type of the first
10663 argument. We cannot cast the result to a reference type, so if
10664 ARG1 is a reference type, find its underlying type. */
10665 type = value_type (arg1);
10666 while (TYPE_CODE (type) == TYPE_CODE_REF)
10667 type = TYPE_TARGET_TYPE (type);
10668 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10669 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
10672 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10673 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10674 if (noside == EVAL_SKIP)
10676 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10677 return (value_from_longest
10678 (value_type (arg1),
10679 value_as_long (arg1) - value_as_long (arg2)));
10680 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10681 return (value_from_longest
10682 (value_type (arg2),
10683 value_as_long (arg1) - value_as_long (arg2)));
10684 if ((ada_is_fixed_point_type (value_type (arg1))
10685 || ada_is_fixed_point_type (value_type (arg2)))
10686 && value_type (arg1) != value_type (arg2))
10687 error (_("Operands of fixed-point subtraction "
10688 "must have the same type"));
10689 /* Do the substraction, and cast the result to the type of the first
10690 argument. We cannot cast the result to a reference type, so if
10691 ARG1 is a reference type, find its underlying type. */
10692 type = value_type (arg1);
10693 while (TYPE_CODE (type) == TYPE_CODE_REF)
10694 type = TYPE_TARGET_TYPE (type);
10695 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10696 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
10702 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10703 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10704 if (noside == EVAL_SKIP)
10706 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10708 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10709 return value_zero (value_type (arg1), not_lval);
10713 type = builtin_type (exp->gdbarch)->builtin_double;
10714 if (ada_is_fixed_point_type (value_type (arg1)))
10715 arg1 = cast_from_fixed (type, arg1);
10716 if (ada_is_fixed_point_type (value_type (arg2)))
10717 arg2 = cast_from_fixed (type, arg2);
10718 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10719 return ada_value_binop (arg1, arg2, op);
10723 case BINOP_NOTEQUAL:
10724 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10725 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
10726 if (noside == EVAL_SKIP)
10728 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10732 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10733 tem = ada_value_equal (arg1, arg2);
10735 if (op == BINOP_NOTEQUAL)
10737 type = language_bool_type (exp->language_defn, exp->gdbarch);
10738 return value_from_longest (type, (LONGEST) tem);
10741 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10742 if (noside == EVAL_SKIP)
10744 else if (ada_is_fixed_point_type (value_type (arg1)))
10745 return value_cast (value_type (arg1), value_neg (arg1));
10748 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10749 return value_neg (arg1);
10752 case BINOP_LOGICAL_AND:
10753 case BINOP_LOGICAL_OR:
10754 case UNOP_LOGICAL_NOT:
10759 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10760 type = language_bool_type (exp->language_defn, exp->gdbarch);
10761 return value_cast (type, val);
10764 case BINOP_BITWISE_AND:
10765 case BINOP_BITWISE_IOR:
10766 case BINOP_BITWISE_XOR:
10770 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
10772 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10774 return value_cast (value_type (arg1), val);
10780 if (noside == EVAL_SKIP)
10786 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
10787 /* Only encountered when an unresolved symbol occurs in a
10788 context other than a function call, in which case, it is
10790 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10791 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
10793 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10795 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
10796 /* Check to see if this is a tagged type. We also need to handle
10797 the case where the type is a reference to a tagged type, but
10798 we have to be careful to exclude pointers to tagged types.
10799 The latter should be shown as usual (as a pointer), whereas
10800 a reference should mostly be transparent to the user. */
10801 if (ada_is_tagged_type (type, 0)
10802 || (TYPE_CODE (type) == TYPE_CODE_REF
10803 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
10805 /* Tagged types are a little special in the fact that the real
10806 type is dynamic and can only be determined by inspecting the
10807 object's tag. This means that we need to get the object's
10808 value first (EVAL_NORMAL) and then extract the actual object
10811 Note that we cannot skip the final step where we extract
10812 the object type from its tag, because the EVAL_NORMAL phase
10813 results in dynamic components being resolved into fixed ones.
10814 This can cause problems when trying to print the type
10815 description of tagged types whose parent has a dynamic size:
10816 We use the type name of the "_parent" component in order
10817 to print the name of the ancestor type in the type description.
10818 If that component had a dynamic size, the resolution into
10819 a fixed type would result in the loss of that type name,
10820 thus preventing us from printing the name of the ancestor
10821 type in the type description. */
10822 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
10824 if (TYPE_CODE (type) != TYPE_CODE_REF)
10826 struct type *actual_type;
10828 actual_type = type_from_tag (ada_value_tag (arg1));
10829 if (actual_type == NULL)
10830 /* If, for some reason, we were unable to determine
10831 the actual type from the tag, then use the static
10832 approximation that we just computed as a fallback.
10833 This can happen if the debugging information is
10834 incomplete, for instance. */
10835 actual_type = type;
10836 return value_zero (actual_type, not_lval);
10840 /* In the case of a ref, ada_coerce_ref takes care
10841 of determining the actual type. But the evaluation
10842 should return a ref as it should be valid to ask
10843 for its address; so rebuild a ref after coerce. */
10844 arg1 = ada_coerce_ref (arg1);
10845 return value_ref (arg1, TYPE_CODE_REF);
10849 /* Records and unions for which GNAT encodings have been
10850 generated need to be statically fixed as well.
10851 Otherwise, non-static fixing produces a type where
10852 all dynamic properties are removed, which prevents "ptype"
10853 from being able to completely describe the type.
10854 For instance, a case statement in a variant record would be
10855 replaced by the relevant components based on the actual
10856 value of the discriminants. */
10857 if ((TYPE_CODE (type) == TYPE_CODE_STRUCT
10858 && dynamic_template_type (type) != NULL)
10859 || (TYPE_CODE (type) == TYPE_CODE_UNION
10860 && ada_find_parallel_type (type, "___XVU") != NULL))
10863 return value_zero (to_static_fixed_type (type), not_lval);
10867 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10868 return ada_to_fixed_value (arg1);
10873 /* Allocate arg vector, including space for the function to be
10874 called in argvec[0] and a terminating NULL. */
10875 nargs = longest_to_int (exp->elts[pc + 1].longconst);
10876 argvec = XALLOCAVEC (struct value *, nargs + 2);
10878 if (exp->elts[*pos].opcode == OP_VAR_VALUE
10879 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
10880 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10881 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
10884 for (tem = 0; tem <= nargs; tem += 1)
10885 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10888 if (noside == EVAL_SKIP)
10892 if (ada_is_constrained_packed_array_type
10893 (desc_base_type (value_type (argvec[0]))))
10894 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
10895 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10896 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
10897 /* This is a packed array that has already been fixed, and
10898 therefore already coerced to a simple array. Nothing further
10901 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF)
10903 /* Make sure we dereference references so that all the code below
10904 feels like it's really handling the referenced value. Wrapping
10905 types (for alignment) may be there, so make sure we strip them as
10907 argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0]));
10909 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10910 && VALUE_LVAL (argvec[0]) == lval_memory)
10911 argvec[0] = value_addr (argvec[0]);
10913 type = ada_check_typedef (value_type (argvec[0]));
10915 /* Ada allows us to implicitly dereference arrays when subscripting
10916 them. So, if this is an array typedef (encoding use for array
10917 access types encoded as fat pointers), strip it now. */
10918 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
10919 type = ada_typedef_target_type (type);
10921 if (TYPE_CODE (type) == TYPE_CODE_PTR)
10923 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
10925 case TYPE_CODE_FUNC:
10926 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10928 case TYPE_CODE_ARRAY:
10930 case TYPE_CODE_STRUCT:
10931 if (noside != EVAL_AVOID_SIDE_EFFECTS)
10932 argvec[0] = ada_value_ind (argvec[0]);
10933 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10936 error (_("cannot subscript or call something of type `%s'"),
10937 ada_type_name (value_type (argvec[0])));
10942 switch (TYPE_CODE (type))
10944 case TYPE_CODE_FUNC:
10945 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10947 if (TYPE_TARGET_TYPE (type) == NULL)
10948 error_call_unknown_return_type (NULL);
10949 return allocate_value (TYPE_TARGET_TYPE (type));
10951 return call_function_by_hand (argvec[0], NULL, nargs, argvec + 1);
10952 case TYPE_CODE_INTERNAL_FUNCTION:
10953 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10954 /* We don't know anything about what the internal
10955 function might return, but we have to return
10957 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10960 return call_internal_function (exp->gdbarch, exp->language_defn,
10961 argvec[0], nargs, argvec + 1);
10963 case TYPE_CODE_STRUCT:
10967 arity = ada_array_arity (type);
10968 type = ada_array_element_type (type, nargs);
10970 error (_("cannot subscript or call a record"));
10971 if (arity != nargs)
10972 error (_("wrong number of subscripts; expecting %d"), arity);
10973 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10974 return value_zero (ada_aligned_type (type), lval_memory);
10976 unwrap_value (ada_value_subscript
10977 (argvec[0], nargs, argvec + 1));
10979 case TYPE_CODE_ARRAY:
10980 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10982 type = ada_array_element_type (type, nargs);
10984 error (_("element type of array unknown"));
10986 return value_zero (ada_aligned_type (type), lval_memory);
10989 unwrap_value (ada_value_subscript
10990 (ada_coerce_to_simple_array (argvec[0]),
10991 nargs, argvec + 1));
10992 case TYPE_CODE_PTR: /* Pointer to array */
10993 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10995 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
10996 type = ada_array_element_type (type, nargs);
10998 error (_("element type of array unknown"));
11000 return value_zero (ada_aligned_type (type), lval_memory);
11003 unwrap_value (ada_value_ptr_subscript (argvec[0],
11004 nargs, argvec + 1));
11007 error (_("Attempt to index or call something other than an "
11008 "array or function"));
11013 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11014 struct value *low_bound_val =
11015 evaluate_subexp (NULL_TYPE, exp, pos, noside);
11016 struct value *high_bound_val =
11017 evaluate_subexp (NULL_TYPE, exp, pos, noside);
11019 LONGEST high_bound;
11021 low_bound_val = coerce_ref (low_bound_val);
11022 high_bound_val = coerce_ref (high_bound_val);
11023 low_bound = value_as_long (low_bound_val);
11024 high_bound = value_as_long (high_bound_val);
11026 if (noside == EVAL_SKIP)
11029 /* If this is a reference to an aligner type, then remove all
11031 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11032 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
11033 TYPE_TARGET_TYPE (value_type (array)) =
11034 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
11036 if (ada_is_constrained_packed_array_type (value_type (array)))
11037 error (_("cannot slice a packed array"));
11039 /* If this is a reference to an array or an array lvalue,
11040 convert to a pointer. */
11041 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11042 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
11043 && VALUE_LVAL (array) == lval_memory))
11044 array = value_addr (array);
11046 if (noside == EVAL_AVOID_SIDE_EFFECTS
11047 && ada_is_array_descriptor_type (ada_check_typedef
11048 (value_type (array))))
11049 return empty_array (ada_type_of_array (array, 0), low_bound);
11051 array = ada_coerce_to_simple_array_ptr (array);
11053 /* If we have more than one level of pointer indirection,
11054 dereference the value until we get only one level. */
11055 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
11056 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
11058 array = value_ind (array);
11060 /* Make sure we really do have an array type before going further,
11061 to avoid a SEGV when trying to get the index type or the target
11062 type later down the road if the debug info generated by
11063 the compiler is incorrect or incomplete. */
11064 if (!ada_is_simple_array_type (value_type (array)))
11065 error (_("cannot take slice of non-array"));
11067 if (TYPE_CODE (ada_check_typedef (value_type (array)))
11070 struct type *type0 = ada_check_typedef (value_type (array));
11072 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
11073 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
11076 struct type *arr_type0 =
11077 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
11079 return ada_value_slice_from_ptr (array, arr_type0,
11080 longest_to_int (low_bound),
11081 longest_to_int (high_bound));
11084 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11086 else if (high_bound < low_bound)
11087 return empty_array (value_type (array), low_bound);
11089 return ada_value_slice (array, longest_to_int (low_bound),
11090 longest_to_int (high_bound));
11093 case UNOP_IN_RANGE:
11095 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11096 type = check_typedef (exp->elts[pc + 1].type);
11098 if (noside == EVAL_SKIP)
11101 switch (TYPE_CODE (type))
11104 lim_warning (_("Membership test incompletely implemented; "
11105 "always returns true"));
11106 type = language_bool_type (exp->language_defn, exp->gdbarch);
11107 return value_from_longest (type, (LONGEST) 1);
11109 case TYPE_CODE_RANGE:
11110 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
11111 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
11112 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11113 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11114 type = language_bool_type (exp->language_defn, exp->gdbarch);
11116 value_from_longest (type,
11117 (value_less (arg1, arg3)
11118 || value_equal (arg1, arg3))
11119 && (value_less (arg2, arg1)
11120 || value_equal (arg2, arg1)));
11123 case BINOP_IN_BOUNDS:
11125 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11126 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11128 if (noside == EVAL_SKIP)
11131 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11133 type = language_bool_type (exp->language_defn, exp->gdbarch);
11134 return value_zero (type, not_lval);
11137 tem = longest_to_int (exp->elts[pc + 1].longconst);
11139 type = ada_index_type (value_type (arg2), tem, "range");
11141 type = value_type (arg1);
11143 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
11144 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
11146 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11147 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11148 type = language_bool_type (exp->language_defn, exp->gdbarch);
11150 value_from_longest (type,
11151 (value_less (arg1, arg3)
11152 || value_equal (arg1, arg3))
11153 && (value_less (arg2, arg1)
11154 || value_equal (arg2, arg1)));
11156 case TERNOP_IN_RANGE:
11157 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11158 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11159 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11161 if (noside == EVAL_SKIP)
11164 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11165 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
11166 type = language_bool_type (exp->language_defn, exp->gdbarch);
11168 value_from_longest (type,
11169 (value_less (arg1, arg3)
11170 || value_equal (arg1, arg3))
11171 && (value_less (arg2, arg1)
11172 || value_equal (arg2, arg1)));
11176 case OP_ATR_LENGTH:
11178 struct type *type_arg;
11180 if (exp->elts[*pos].opcode == OP_TYPE)
11182 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11184 type_arg = check_typedef (exp->elts[pc + 2].type);
11188 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11192 if (exp->elts[*pos].opcode != OP_LONG)
11193 error (_("Invalid operand to '%s"), ada_attribute_name (op));
11194 tem = longest_to_int (exp->elts[*pos + 2].longconst);
11197 if (noside == EVAL_SKIP)
11200 if (type_arg == NULL)
11202 arg1 = ada_coerce_ref (arg1);
11204 if (ada_is_constrained_packed_array_type (value_type (arg1)))
11205 arg1 = ada_coerce_to_simple_array (arg1);
11207 if (op == OP_ATR_LENGTH)
11208 type = builtin_type (exp->gdbarch)->builtin_int;
11211 type = ada_index_type (value_type (arg1), tem,
11212 ada_attribute_name (op));
11214 type = builtin_type (exp->gdbarch)->builtin_int;
11217 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11218 return allocate_value (type);
11222 default: /* Should never happen. */
11223 error (_("unexpected attribute encountered"));
11225 return value_from_longest
11226 (type, ada_array_bound (arg1, tem, 0));
11228 return value_from_longest
11229 (type, ada_array_bound (arg1, tem, 1));
11230 case OP_ATR_LENGTH:
11231 return value_from_longest
11232 (type, ada_array_length (arg1, tem));
11235 else if (discrete_type_p (type_arg))
11237 struct type *range_type;
11238 const char *name = ada_type_name (type_arg);
11241 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
11242 range_type = to_fixed_range_type (type_arg, NULL);
11243 if (range_type == NULL)
11244 range_type = type_arg;
11248 error (_("unexpected attribute encountered"));
11250 return value_from_longest
11251 (range_type, ada_discrete_type_low_bound (range_type));
11253 return value_from_longest
11254 (range_type, ada_discrete_type_high_bound (range_type));
11255 case OP_ATR_LENGTH:
11256 error (_("the 'length attribute applies only to array types"));
11259 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
11260 error (_("unimplemented type attribute"));
11265 if (ada_is_constrained_packed_array_type (type_arg))
11266 type_arg = decode_constrained_packed_array_type (type_arg);
11268 if (op == OP_ATR_LENGTH)
11269 type = builtin_type (exp->gdbarch)->builtin_int;
11272 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
11274 type = builtin_type (exp->gdbarch)->builtin_int;
11277 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11278 return allocate_value (type);
11283 error (_("unexpected attribute encountered"));
11285 low = ada_array_bound_from_type (type_arg, tem, 0);
11286 return value_from_longest (type, low);
11288 high = ada_array_bound_from_type (type_arg, tem, 1);
11289 return value_from_longest (type, high);
11290 case OP_ATR_LENGTH:
11291 low = ada_array_bound_from_type (type_arg, tem, 0);
11292 high = ada_array_bound_from_type (type_arg, tem, 1);
11293 return value_from_longest (type, high - low + 1);
11299 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11300 if (noside == EVAL_SKIP)
11303 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11304 return value_zero (ada_tag_type (arg1), not_lval);
11306 return ada_value_tag (arg1);
11310 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11311 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11312 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11313 if (noside == EVAL_SKIP)
11315 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11316 return value_zero (value_type (arg1), not_lval);
11319 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11320 return value_binop (arg1, arg2,
11321 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
11324 case OP_ATR_MODULUS:
11326 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
11328 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11329 if (noside == EVAL_SKIP)
11332 if (!ada_is_modular_type (type_arg))
11333 error (_("'modulus must be applied to modular type"));
11335 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
11336 ada_modulus (type_arg));
11341 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11342 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11343 if (noside == EVAL_SKIP)
11345 type = builtin_type (exp->gdbarch)->builtin_int;
11346 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11347 return value_zero (type, not_lval);
11349 return value_pos_atr (type, arg1);
11352 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11353 type = value_type (arg1);
11355 /* If the argument is a reference, then dereference its type, since
11356 the user is really asking for the size of the actual object,
11357 not the size of the pointer. */
11358 if (TYPE_CODE (type) == TYPE_CODE_REF)
11359 type = TYPE_TARGET_TYPE (type);
11361 if (noside == EVAL_SKIP)
11363 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11364 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
11366 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
11367 TARGET_CHAR_BIT * TYPE_LENGTH (type));
11370 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11371 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11372 type = exp->elts[pc + 2].type;
11373 if (noside == EVAL_SKIP)
11375 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11376 return value_zero (type, not_lval);
11378 return value_val_atr (type, arg1);
11381 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11382 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11383 if (noside == EVAL_SKIP)
11385 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11386 return value_zero (value_type (arg1), not_lval);
11389 /* For integer exponentiation operations,
11390 only promote the first argument. */
11391 if (is_integral_type (value_type (arg2)))
11392 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
11394 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11396 return value_binop (arg1, arg2, op);
11400 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11401 if (noside == EVAL_SKIP)
11407 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11408 if (noside == EVAL_SKIP)
11410 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
11411 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
11412 return value_neg (arg1);
11417 preeval_pos = *pos;
11418 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11419 if (noside == EVAL_SKIP)
11421 type = ada_check_typedef (value_type (arg1));
11422 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11424 if (ada_is_array_descriptor_type (type))
11425 /* GDB allows dereferencing GNAT array descriptors. */
11427 struct type *arrType = ada_type_of_array (arg1, 0);
11429 if (arrType == NULL)
11430 error (_("Attempt to dereference null array pointer."));
11431 return value_at_lazy (arrType, 0);
11433 else if (TYPE_CODE (type) == TYPE_CODE_PTR
11434 || TYPE_CODE (type) == TYPE_CODE_REF
11435 /* In C you can dereference an array to get the 1st elt. */
11436 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
11438 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11439 only be determined by inspecting the object's tag.
11440 This means that we need to evaluate completely the
11441 expression in order to get its type. */
11443 if ((TYPE_CODE (type) == TYPE_CODE_REF
11444 || TYPE_CODE (type) == TYPE_CODE_PTR)
11445 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))
11447 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11449 type = value_type (ada_value_ind (arg1));
11453 type = to_static_fixed_type
11455 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
11457 ada_ensure_varsize_limit (type);
11458 return value_zero (type, lval_memory);
11460 else if (TYPE_CODE (type) == TYPE_CODE_INT)
11462 /* GDB allows dereferencing an int. */
11463 if (expect_type == NULL)
11464 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
11469 to_static_fixed_type (ada_aligned_type (expect_type));
11470 return value_zero (expect_type, lval_memory);
11474 error (_("Attempt to take contents of a non-pointer value."));
11476 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
11477 type = ada_check_typedef (value_type (arg1));
11479 if (TYPE_CODE (type) == TYPE_CODE_INT)
11480 /* GDB allows dereferencing an int. If we were given
11481 the expect_type, then use that as the target type.
11482 Otherwise, assume that the target type is an int. */
11484 if (expect_type != NULL)
11485 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
11488 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
11489 (CORE_ADDR) value_as_address (arg1));
11492 if (ada_is_array_descriptor_type (type))
11493 /* GDB allows dereferencing GNAT array descriptors. */
11494 return ada_coerce_to_simple_array (arg1);
11496 return ada_value_ind (arg1);
11498 case STRUCTOP_STRUCT:
11499 tem = longest_to_int (exp->elts[pc + 1].longconst);
11500 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
11501 preeval_pos = *pos;
11502 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11503 if (noside == EVAL_SKIP)
11505 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11507 struct type *type1 = value_type (arg1);
11509 if (ada_is_tagged_type (type1, 1))
11511 type = ada_lookup_struct_elt_type (type1,
11512 &exp->elts[pc + 2].string,
11515 /* If the field is not found, check if it exists in the
11516 extension of this object's type. This means that we
11517 need to evaluate completely the expression. */
11521 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11523 arg1 = ada_value_struct_elt (arg1,
11524 &exp->elts[pc + 2].string,
11526 arg1 = unwrap_value (arg1);
11527 type = value_type (ada_to_fixed_value (arg1));
11532 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
11535 return value_zero (ada_aligned_type (type), lval_memory);
11539 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
11540 arg1 = unwrap_value (arg1);
11541 return ada_to_fixed_value (arg1);
11545 /* The value is not supposed to be used. This is here to make it
11546 easier to accommodate expressions that contain types. */
11548 if (noside == EVAL_SKIP)
11550 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11551 return allocate_value (exp->elts[pc + 1].type);
11553 error (_("Attempt to use a type name as an expression"));
11558 case OP_DISCRETE_RANGE:
11559 case OP_POSITIONAL:
11561 if (noside == EVAL_NORMAL)
11565 error (_("Undefined name, ambiguous name, or renaming used in "
11566 "component association: %s."), &exp->elts[pc+2].string);
11568 error (_("Aggregates only allowed on the right of an assignment"));
11570 internal_error (__FILE__, __LINE__,
11571 _("aggregate apparently mangled"));
11574 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11576 for (tem = 0; tem < nargs; tem += 1)
11577 ada_evaluate_subexp (NULL, exp, pos, noside);
11582 return eval_skip_value (exp);
11588 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11589 type name that encodes the 'small and 'delta information.
11590 Otherwise, return NULL. */
11592 static const char *
11593 fixed_type_info (struct type *type)
11595 const char *name = ada_type_name (type);
11596 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
11598 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
11600 const char *tail = strstr (name, "___XF_");
11607 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
11608 return fixed_type_info (TYPE_TARGET_TYPE (type));
11613 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11616 ada_is_fixed_point_type (struct type *type)
11618 return fixed_type_info (type) != NULL;
11621 /* Return non-zero iff TYPE represents a System.Address type. */
11624 ada_is_system_address_type (struct type *type)
11626 return (TYPE_NAME (type)
11627 && strcmp (TYPE_NAME (type), "system__address") == 0);
11630 /* Assuming that TYPE is the representation of an Ada fixed-point
11631 type, return the target floating-point type to be used to represent
11632 of this type during internal computation. */
11634 static struct type *
11635 ada_scaling_type (struct type *type)
11637 return builtin_type (get_type_arch (type))->builtin_long_double;
11640 /* Assuming that TYPE is the representation of an Ada fixed-point
11641 type, return its delta, or NULL if the type is malformed and the
11642 delta cannot be determined. */
11645 ada_delta (struct type *type)
11647 const char *encoding = fixed_type_info (type);
11648 struct type *scale_type = ada_scaling_type (type);
11650 long long num, den;
11652 if (sscanf (encoding, "_%lld_%lld", &num, &den) < 2)
11655 return value_binop (value_from_longest (scale_type, num),
11656 value_from_longest (scale_type, den), BINOP_DIV);
11659 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11660 factor ('SMALL value) associated with the type. */
11663 ada_scaling_factor (struct type *type)
11665 const char *encoding = fixed_type_info (type);
11666 struct type *scale_type = ada_scaling_type (type);
11668 long long num0, den0, num1, den1;
11671 n = sscanf (encoding, "_%lld_%lld_%lld_%lld",
11672 &num0, &den0, &num1, &den1);
11675 return value_from_longest (scale_type, 1);
11677 return value_binop (value_from_longest (scale_type, num1),
11678 value_from_longest (scale_type, den1), BINOP_DIV);
11680 return value_binop (value_from_longest (scale_type, num0),
11681 value_from_longest (scale_type, den0), BINOP_DIV);
11688 /* Scan STR beginning at position K for a discriminant name, and
11689 return the value of that discriminant field of DVAL in *PX. If
11690 PNEW_K is not null, put the position of the character beyond the
11691 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11692 not alter *PX and *PNEW_K if unsuccessful. */
11695 scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px,
11698 static char *bound_buffer = NULL;
11699 static size_t bound_buffer_len = 0;
11700 const char *pstart, *pend, *bound;
11701 struct value *bound_val;
11703 if (dval == NULL || str == NULL || str[k] == '\0')
11707 pend = strstr (pstart, "__");
11711 k += strlen (bound);
11715 int len = pend - pstart;
11717 /* Strip __ and beyond. */
11718 GROW_VECT (bound_buffer, bound_buffer_len, len + 1);
11719 strncpy (bound_buffer, pstart, len);
11720 bound_buffer[len] = '\0';
11722 bound = bound_buffer;
11726 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
11727 if (bound_val == NULL)
11730 *px = value_as_long (bound_val);
11731 if (pnew_k != NULL)
11736 /* Value of variable named NAME in the current environment. If
11737 no such variable found, then if ERR_MSG is null, returns 0, and
11738 otherwise causes an error with message ERR_MSG. */
11740 static struct value *
11741 get_var_value (const char *name, const char *err_msg)
11743 lookup_name_info lookup_name (name, symbol_name_match_type::FULL);
11745 std::vector<struct block_symbol> syms;
11746 int nsyms = ada_lookup_symbol_list_worker (lookup_name,
11747 get_selected_block (0),
11748 VAR_DOMAIN, &syms, 1);
11752 if (err_msg == NULL)
11755 error (("%s"), err_msg);
11758 return value_of_variable (syms[0].symbol, syms[0].block);
11761 /* Value of integer variable named NAME in the current environment.
11762 If no such variable is found, returns false. Otherwise, sets VALUE
11763 to the variable's value and returns true. */
11766 get_int_var_value (const char *name, LONGEST &value)
11768 struct value *var_val = get_var_value (name, 0);
11773 value = value_as_long (var_val);
11778 /* Return a range type whose base type is that of the range type named
11779 NAME in the current environment, and whose bounds are calculated
11780 from NAME according to the GNAT range encoding conventions.
11781 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11782 corresponding range type from debug information; fall back to using it
11783 if symbol lookup fails. If a new type must be created, allocate it
11784 like ORIG_TYPE was. The bounds information, in general, is encoded
11785 in NAME, the base type given in the named range type. */
11787 static struct type *
11788 to_fixed_range_type (struct type *raw_type, struct value *dval)
11791 struct type *base_type;
11792 const char *subtype_info;
11794 gdb_assert (raw_type != NULL);
11795 gdb_assert (TYPE_NAME (raw_type) != NULL);
11797 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
11798 base_type = TYPE_TARGET_TYPE (raw_type);
11800 base_type = raw_type;
11802 name = TYPE_NAME (raw_type);
11803 subtype_info = strstr (name, "___XD");
11804 if (subtype_info == NULL)
11806 LONGEST L = ada_discrete_type_low_bound (raw_type);
11807 LONGEST U = ada_discrete_type_high_bound (raw_type);
11809 if (L < INT_MIN || U > INT_MAX)
11812 return create_static_range_type (alloc_type_copy (raw_type), raw_type,
11817 static char *name_buf = NULL;
11818 static size_t name_len = 0;
11819 int prefix_len = subtype_info - name;
11822 const char *bounds_str;
11825 GROW_VECT (name_buf, name_len, prefix_len + 5);
11826 strncpy (name_buf, name, prefix_len);
11827 name_buf[prefix_len] = '\0';
11830 bounds_str = strchr (subtype_info, '_');
11833 if (*subtype_info == 'L')
11835 if (!ada_scan_number (bounds_str, n, &L, &n)
11836 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
11838 if (bounds_str[n] == '_')
11840 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
11846 strcpy (name_buf + prefix_len, "___L");
11847 if (!get_int_var_value (name_buf, L))
11849 lim_warning (_("Unknown lower bound, using 1."));
11854 if (*subtype_info == 'U')
11856 if (!ada_scan_number (bounds_str, n, &U, &n)
11857 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
11862 strcpy (name_buf + prefix_len, "___U");
11863 if (!get_int_var_value (name_buf, U))
11865 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
11870 type = create_static_range_type (alloc_type_copy (raw_type),
11872 /* create_static_range_type alters the resulting type's length
11873 to match the size of the base_type, which is not what we want.
11874 Set it back to the original range type's length. */
11875 TYPE_LENGTH (type) = TYPE_LENGTH (raw_type);
11876 TYPE_NAME (type) = name;
11881 /* True iff NAME is the name of a range type. */
11884 ada_is_range_type_name (const char *name)
11886 return (name != NULL && strstr (name, "___XD"));
11890 /* Modular types */
11892 /* True iff TYPE is an Ada modular type. */
11895 ada_is_modular_type (struct type *type)
11897 struct type *subranged_type = get_base_type (type);
11899 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
11900 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
11901 && TYPE_UNSIGNED (subranged_type));
11904 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11907 ada_modulus (struct type *type)
11909 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
11913 /* Ada exception catchpoint support:
11914 ---------------------------------
11916 We support 3 kinds of exception catchpoints:
11917 . catchpoints on Ada exceptions
11918 . catchpoints on unhandled Ada exceptions
11919 . catchpoints on failed assertions
11921 Exceptions raised during failed assertions, or unhandled exceptions
11922 could perfectly be caught with the general catchpoint on Ada exceptions.
11923 However, we can easily differentiate these two special cases, and having
11924 the option to distinguish these two cases from the rest can be useful
11925 to zero-in on certain situations.
11927 Exception catchpoints are a specialized form of breakpoint,
11928 since they rely on inserting breakpoints inside known routines
11929 of the GNAT runtime. The implementation therefore uses a standard
11930 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11933 Support in the runtime for exception catchpoints have been changed
11934 a few times already, and these changes affect the implementation
11935 of these catchpoints. In order to be able to support several
11936 variants of the runtime, we use a sniffer that will determine
11937 the runtime variant used by the program being debugged. */
11939 /* Ada's standard exceptions.
11941 The Ada 83 standard also defined Numeric_Error. But there so many
11942 situations where it was unclear from the Ada 83 Reference Manual
11943 (RM) whether Constraint_Error or Numeric_Error should be raised,
11944 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11945 Interpretation saying that anytime the RM says that Numeric_Error
11946 should be raised, the implementation may raise Constraint_Error.
11947 Ada 95 went one step further and pretty much removed Numeric_Error
11948 from the list of standard exceptions (it made it a renaming of
11949 Constraint_Error, to help preserve compatibility when compiling
11950 an Ada83 compiler). As such, we do not include Numeric_Error from
11951 this list of standard exceptions. */
11953 static const char *standard_exc[] = {
11954 "constraint_error",
11960 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
11962 /* A structure that describes how to support exception catchpoints
11963 for a given executable. */
11965 struct exception_support_info
11967 /* The name of the symbol to break on in order to insert
11968 a catchpoint on exceptions. */
11969 const char *catch_exception_sym;
11971 /* The name of the symbol to break on in order to insert
11972 a catchpoint on unhandled exceptions. */
11973 const char *catch_exception_unhandled_sym;
11975 /* The name of the symbol to break on in order to insert
11976 a catchpoint on failed assertions. */
11977 const char *catch_assert_sym;
11979 /* The name of the symbol to break on in order to insert
11980 a catchpoint on exception handling. */
11981 const char *catch_handlers_sym;
11983 /* Assuming that the inferior just triggered an unhandled exception
11984 catchpoint, this function is responsible for returning the address
11985 in inferior memory where the name of that exception is stored.
11986 Return zero if the address could not be computed. */
11987 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
11990 static CORE_ADDR ada_unhandled_exception_name_addr (void);
11991 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
11993 /* The following exception support info structure describes how to
11994 implement exception catchpoints with the latest version of the
11995 Ada runtime (as of 2007-03-06). */
11997 static const struct exception_support_info default_exception_support_info =
11999 "__gnat_debug_raise_exception", /* catch_exception_sym */
12000 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12001 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
12002 "__gnat_begin_handler", /* catch_handlers_sym */
12003 ada_unhandled_exception_name_addr
12006 /* The following exception support info structure describes how to
12007 implement exception catchpoints with a slightly older version
12008 of the Ada runtime. */
12010 static const struct exception_support_info exception_support_info_fallback =
12012 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
12013 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12014 "system__assertions__raise_assert_failure", /* catch_assert_sym */
12015 "__gnat_begin_handler", /* catch_handlers_sym */
12016 ada_unhandled_exception_name_addr_from_raise
12019 /* Return nonzero if we can detect the exception support routines
12020 described in EINFO.
12022 This function errors out if an abnormal situation is detected
12023 (for instance, if we find the exception support routines, but
12024 that support is found to be incomplete). */
12027 ada_has_this_exception_support (const struct exception_support_info *einfo)
12029 struct symbol *sym;
12031 /* The symbol we're looking up is provided by a unit in the GNAT runtime
12032 that should be compiled with debugging information. As a result, we
12033 expect to find that symbol in the symtabs. */
12035 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
12038 /* Perhaps we did not find our symbol because the Ada runtime was
12039 compiled without debugging info, or simply stripped of it.
12040 It happens on some GNU/Linux distributions for instance, where
12041 users have to install a separate debug package in order to get
12042 the runtime's debugging info. In that situation, let the user
12043 know why we cannot insert an Ada exception catchpoint.
12045 Note: Just for the purpose of inserting our Ada exception
12046 catchpoint, we could rely purely on the associated minimal symbol.
12047 But we would be operating in degraded mode anyway, since we are
12048 still lacking the debugging info needed later on to extract
12049 the name of the exception being raised (this name is printed in
12050 the catchpoint message, and is also used when trying to catch
12051 a specific exception). We do not handle this case for now. */
12052 struct bound_minimal_symbol msym
12053 = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL);
12055 if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline)
12056 error (_("Your Ada runtime appears to be missing some debugging "
12057 "information.\nCannot insert Ada exception catchpoint "
12058 "in this configuration."));
12063 /* Make sure that the symbol we found corresponds to a function. */
12065 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
12066 error (_("Symbol \"%s\" is not a function (class = %d)"),
12067 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
12072 /* Inspect the Ada runtime and determine which exception info structure
12073 should be used to provide support for exception catchpoints.
12075 This function will always set the per-inferior exception_info,
12076 or raise an error. */
12079 ada_exception_support_info_sniffer (void)
12081 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12083 /* If the exception info is already known, then no need to recompute it. */
12084 if (data->exception_info != NULL)
12087 /* Check the latest (default) exception support info. */
12088 if (ada_has_this_exception_support (&default_exception_support_info))
12090 data->exception_info = &default_exception_support_info;
12094 /* Try our fallback exception suport info. */
12095 if (ada_has_this_exception_support (&exception_support_info_fallback))
12097 data->exception_info = &exception_support_info_fallback;
12101 /* Sometimes, it is normal for us to not be able to find the routine
12102 we are looking for. This happens when the program is linked with
12103 the shared version of the GNAT runtime, and the program has not been
12104 started yet. Inform the user of these two possible causes if
12107 if (ada_update_initial_language (language_unknown) != language_ada)
12108 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
12110 /* If the symbol does not exist, then check that the program is
12111 already started, to make sure that shared libraries have been
12112 loaded. If it is not started, this may mean that the symbol is
12113 in a shared library. */
12115 if (inferior_ptid.pid () == 0)
12116 error (_("Unable to insert catchpoint. Try to start the program first."));
12118 /* At this point, we know that we are debugging an Ada program and
12119 that the inferior has been started, but we still are not able to
12120 find the run-time symbols. That can mean that we are in
12121 configurable run time mode, or that a-except as been optimized
12122 out by the linker... In any case, at this point it is not worth
12123 supporting this feature. */
12125 error (_("Cannot insert Ada exception catchpoints in this configuration."));
12128 /* True iff FRAME is very likely to be that of a function that is
12129 part of the runtime system. This is all very heuristic, but is
12130 intended to be used as advice as to what frames are uninteresting
12134 is_known_support_routine (struct frame_info *frame)
12136 enum language func_lang;
12138 const char *fullname;
12140 /* If this code does not have any debugging information (no symtab),
12141 This cannot be any user code. */
12143 symtab_and_line sal = find_frame_sal (frame);
12144 if (sal.symtab == NULL)
12147 /* If there is a symtab, but the associated source file cannot be
12148 located, then assume this is not user code: Selecting a frame
12149 for which we cannot display the code would not be very helpful
12150 for the user. This should also take care of case such as VxWorks
12151 where the kernel has some debugging info provided for a few units. */
12153 fullname = symtab_to_fullname (sal.symtab);
12154 if (access (fullname, R_OK) != 0)
12157 /* Check the unit filename againt the Ada runtime file naming.
12158 We also check the name of the objfile against the name of some
12159 known system libraries that sometimes come with debugging info
12162 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
12164 re_comp (known_runtime_file_name_patterns[i]);
12165 if (re_exec (lbasename (sal.symtab->filename)))
12167 if (SYMTAB_OBJFILE (sal.symtab) != NULL
12168 && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab))))
12172 /* Check whether the function is a GNAT-generated entity. */
12174 gdb::unique_xmalloc_ptr<char> func_name
12175 = find_frame_funname (frame, &func_lang, NULL);
12176 if (func_name == NULL)
12179 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
12181 re_comp (known_auxiliary_function_name_patterns[i]);
12182 if (re_exec (func_name.get ()))
12189 /* Find the first frame that contains debugging information and that is not
12190 part of the Ada run-time, starting from FI and moving upward. */
12193 ada_find_printable_frame (struct frame_info *fi)
12195 for (; fi != NULL; fi = get_prev_frame (fi))
12197 if (!is_known_support_routine (fi))
12206 /* Assuming that the inferior just triggered an unhandled exception
12207 catchpoint, return the address in inferior memory where the name
12208 of the exception is stored.
12210 Return zero if the address could not be computed. */
12213 ada_unhandled_exception_name_addr (void)
12215 return parse_and_eval_address ("e.full_name");
12218 /* Same as ada_unhandled_exception_name_addr, except that this function
12219 should be used when the inferior uses an older version of the runtime,
12220 where the exception name needs to be extracted from a specific frame
12221 several frames up in the callstack. */
12224 ada_unhandled_exception_name_addr_from_raise (void)
12227 struct frame_info *fi;
12228 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12230 /* To determine the name of this exception, we need to select
12231 the frame corresponding to RAISE_SYM_NAME. This frame is
12232 at least 3 levels up, so we simply skip the first 3 frames
12233 without checking the name of their associated function. */
12234 fi = get_current_frame ();
12235 for (frame_level = 0; frame_level < 3; frame_level += 1)
12237 fi = get_prev_frame (fi);
12241 enum language func_lang;
12243 gdb::unique_xmalloc_ptr<char> func_name
12244 = find_frame_funname (fi, &func_lang, NULL);
12245 if (func_name != NULL)
12247 if (strcmp (func_name.get (),
12248 data->exception_info->catch_exception_sym) == 0)
12249 break; /* We found the frame we were looking for... */
12251 fi = get_prev_frame (fi);
12258 return parse_and_eval_address ("id.full_name");
12261 /* Assuming the inferior just triggered an Ada exception catchpoint
12262 (of any type), return the address in inferior memory where the name
12263 of the exception is stored, if applicable.
12265 Assumes the selected frame is the current frame.
12267 Return zero if the address could not be computed, or if not relevant. */
12270 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex,
12271 struct breakpoint *b)
12273 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12277 case ada_catch_exception:
12278 return (parse_and_eval_address ("e.full_name"));
12281 case ada_catch_exception_unhandled:
12282 return data->exception_info->unhandled_exception_name_addr ();
12285 case ada_catch_handlers:
12286 return 0; /* The runtimes does not provide access to the exception
12290 case ada_catch_assert:
12291 return 0; /* Exception name is not relevant in this case. */
12295 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12299 return 0; /* Should never be reached. */
12302 /* Assuming the inferior is stopped at an exception catchpoint,
12303 return the message which was associated to the exception, if
12304 available. Return NULL if the message could not be retrieved.
12306 Note: The exception message can be associated to an exception
12307 either through the use of the Raise_Exception function, or
12308 more simply (Ada 2005 and later), via:
12310 raise Exception_Name with "exception message";
12314 static gdb::unique_xmalloc_ptr<char>
12315 ada_exception_message_1 (void)
12317 struct value *e_msg_val;
12320 /* For runtimes that support this feature, the exception message
12321 is passed as an unbounded string argument called "message". */
12322 e_msg_val = parse_and_eval ("message");
12323 if (e_msg_val == NULL)
12324 return NULL; /* Exception message not supported. */
12326 e_msg_val = ada_coerce_to_simple_array (e_msg_val);
12327 gdb_assert (e_msg_val != NULL);
12328 e_msg_len = TYPE_LENGTH (value_type (e_msg_val));
12330 /* If the message string is empty, then treat it as if there was
12331 no exception message. */
12332 if (e_msg_len <= 0)
12335 gdb::unique_xmalloc_ptr<char> e_msg ((char *) xmalloc (e_msg_len + 1));
12336 read_memory_string (value_address (e_msg_val), e_msg.get (), e_msg_len + 1);
12337 e_msg.get ()[e_msg_len] = '\0';
12342 /* Same as ada_exception_message_1, except that all exceptions are
12343 contained here (returning NULL instead). */
12345 static gdb::unique_xmalloc_ptr<char>
12346 ada_exception_message (void)
12348 gdb::unique_xmalloc_ptr<char> e_msg;
12352 e_msg = ada_exception_message_1 ();
12354 CATCH (e, RETURN_MASK_ERROR)
12356 e_msg.reset (nullptr);
12363 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12364 any error that ada_exception_name_addr_1 might cause to be thrown.
12365 When an error is intercepted, a warning with the error message is printed,
12366 and zero is returned. */
12369 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex,
12370 struct breakpoint *b)
12372 CORE_ADDR result = 0;
12376 result = ada_exception_name_addr_1 (ex, b);
12379 CATCH (e, RETURN_MASK_ERROR)
12381 warning (_("failed to get exception name: %s"), e.message);
12389 static std::string ada_exception_catchpoint_cond_string
12390 (const char *excep_string,
12391 enum ada_exception_catchpoint_kind ex);
12393 /* Ada catchpoints.
12395 In the case of catchpoints on Ada exceptions, the catchpoint will
12396 stop the target on every exception the program throws. When a user
12397 specifies the name of a specific exception, we translate this
12398 request into a condition expression (in text form), and then parse
12399 it into an expression stored in each of the catchpoint's locations.
12400 We then use this condition to check whether the exception that was
12401 raised is the one the user is interested in. If not, then the
12402 target is resumed again. We store the name of the requested
12403 exception, in order to be able to re-set the condition expression
12404 when symbols change. */
12406 /* An instance of this type is used to represent an Ada catchpoint
12407 breakpoint location. */
12409 class ada_catchpoint_location : public bp_location
12412 ada_catchpoint_location (const bp_location_ops *ops, breakpoint *owner)
12413 : bp_location (ops, owner)
12416 /* The condition that checks whether the exception that was raised
12417 is the specific exception the user specified on catchpoint
12419 expression_up excep_cond_expr;
12422 /* Implement the DTOR method in the bp_location_ops structure for all
12423 Ada exception catchpoint kinds. */
12426 ada_catchpoint_location_dtor (struct bp_location *bl)
12428 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
12430 al->excep_cond_expr.reset ();
12433 /* The vtable to be used in Ada catchpoint locations. */
12435 static const struct bp_location_ops ada_catchpoint_location_ops =
12437 ada_catchpoint_location_dtor
12440 /* An instance of this type is used to represent an Ada catchpoint. */
12442 struct ada_catchpoint : public breakpoint
12444 /* The name of the specific exception the user specified. */
12445 std::string excep_string;
12448 /* Parse the exception condition string in the context of each of the
12449 catchpoint's locations, and store them for later evaluation. */
12452 create_excep_cond_exprs (struct ada_catchpoint *c,
12453 enum ada_exception_catchpoint_kind ex)
12455 struct bp_location *bl;
12457 /* Nothing to do if there's no specific exception to catch. */
12458 if (c->excep_string.empty ())
12461 /* Same if there are no locations... */
12462 if (c->loc == NULL)
12465 /* Compute the condition expression in text form, from the specific
12466 expection we want to catch. */
12467 std::string cond_string
12468 = ada_exception_catchpoint_cond_string (c->excep_string.c_str (), ex);
12470 /* Iterate over all the catchpoint's locations, and parse an
12471 expression for each. */
12472 for (bl = c->loc; bl != NULL; bl = bl->next)
12474 struct ada_catchpoint_location *ada_loc
12475 = (struct ada_catchpoint_location *) bl;
12478 if (!bl->shlib_disabled)
12482 s = cond_string.c_str ();
12485 exp = parse_exp_1 (&s, bl->address,
12486 block_for_pc (bl->address),
12489 CATCH (e, RETURN_MASK_ERROR)
12491 warning (_("failed to reevaluate internal exception condition "
12492 "for catchpoint %d: %s"),
12493 c->number, e.message);
12498 ada_loc->excep_cond_expr = std::move (exp);
12502 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12503 structure for all exception catchpoint kinds. */
12505 static struct bp_location *
12506 allocate_location_exception (enum ada_exception_catchpoint_kind ex,
12507 struct breakpoint *self)
12509 return new ada_catchpoint_location (&ada_catchpoint_location_ops, self);
12512 /* Implement the RE_SET method in the breakpoint_ops structure for all
12513 exception catchpoint kinds. */
12516 re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
12518 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12520 /* Call the base class's method. This updates the catchpoint's
12522 bkpt_breakpoint_ops.re_set (b);
12524 /* Reparse the exception conditional expressions. One for each
12526 create_excep_cond_exprs (c, ex);
12529 /* Returns true if we should stop for this breakpoint hit. If the
12530 user specified a specific exception, we only want to cause a stop
12531 if the program thrown that exception. */
12534 should_stop_exception (const struct bp_location *bl)
12536 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
12537 const struct ada_catchpoint_location *ada_loc
12538 = (const struct ada_catchpoint_location *) bl;
12541 /* With no specific exception, should always stop. */
12542 if (c->excep_string.empty ())
12545 if (ada_loc->excep_cond_expr == NULL)
12547 /* We will have a NULL expression if back when we were creating
12548 the expressions, this location's had failed to parse. */
12555 struct value *mark;
12557 mark = value_mark ();
12558 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr.get ()));
12559 value_free_to_mark (mark);
12561 CATCH (ex, RETURN_MASK_ALL)
12563 exception_fprintf (gdb_stderr, ex,
12564 _("Error in testing exception condition:\n"));
12571 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12572 for all exception catchpoint kinds. */
12575 check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
12577 bs->stop = should_stop_exception (bs->bp_location_at);
12580 /* Implement the PRINT_IT method in the breakpoint_ops structure
12581 for all exception catchpoint kinds. */
12583 static enum print_stop_action
12584 print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
12586 struct ui_out *uiout = current_uiout;
12587 struct breakpoint *b = bs->breakpoint_at;
12589 annotate_catchpoint (b->number);
12591 if (uiout->is_mi_like_p ())
12593 uiout->field_string ("reason",
12594 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
12595 uiout->field_string ("disp", bpdisp_text (b->disposition));
12598 uiout->text (b->disposition == disp_del
12599 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12600 uiout->field_int ("bkptno", b->number);
12601 uiout->text (", ");
12603 /* ada_exception_name_addr relies on the selected frame being the
12604 current frame. Need to do this here because this function may be
12605 called more than once when printing a stop, and below, we'll
12606 select the first frame past the Ada run-time (see
12607 ada_find_printable_frame). */
12608 select_frame (get_current_frame ());
12612 case ada_catch_exception:
12613 case ada_catch_exception_unhandled:
12614 case ada_catch_handlers:
12616 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
12617 char exception_name[256];
12621 read_memory (addr, (gdb_byte *) exception_name,
12622 sizeof (exception_name) - 1);
12623 exception_name [sizeof (exception_name) - 1] = '\0';
12627 /* For some reason, we were unable to read the exception
12628 name. This could happen if the Runtime was compiled
12629 without debugging info, for instance. In that case,
12630 just replace the exception name by the generic string
12631 "exception" - it will read as "an exception" in the
12632 notification we are about to print. */
12633 memcpy (exception_name, "exception", sizeof ("exception"));
12635 /* In the case of unhandled exception breakpoints, we print
12636 the exception name as "unhandled EXCEPTION_NAME", to make
12637 it clearer to the user which kind of catchpoint just got
12638 hit. We used ui_out_text to make sure that this extra
12639 info does not pollute the exception name in the MI case. */
12640 if (ex == ada_catch_exception_unhandled)
12641 uiout->text ("unhandled ");
12642 uiout->field_string ("exception-name", exception_name);
12645 case ada_catch_assert:
12646 /* In this case, the name of the exception is not really
12647 important. Just print "failed assertion" to make it clearer
12648 that his program just hit an assertion-failure catchpoint.
12649 We used ui_out_text because this info does not belong in
12651 uiout->text ("failed assertion");
12655 gdb::unique_xmalloc_ptr<char> exception_message = ada_exception_message ();
12656 if (exception_message != NULL)
12658 uiout->text (" (");
12659 uiout->field_string ("exception-message", exception_message.get ());
12663 uiout->text (" at ");
12664 ada_find_printable_frame (get_current_frame ());
12666 return PRINT_SRC_AND_LOC;
12669 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12670 for all exception catchpoint kinds. */
12673 print_one_exception (enum ada_exception_catchpoint_kind ex,
12674 struct breakpoint *b, struct bp_location **last_loc)
12676 struct ui_out *uiout = current_uiout;
12677 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12678 struct value_print_options opts;
12680 get_user_print_options (&opts);
12681 if (opts.addressprint)
12683 annotate_field (4);
12684 uiout->field_core_addr ("addr", b->loc->gdbarch, b->loc->address);
12687 annotate_field (5);
12688 *last_loc = b->loc;
12691 case ada_catch_exception:
12692 if (!c->excep_string.empty ())
12694 std::string msg = string_printf (_("`%s' Ada exception"),
12695 c->excep_string.c_str ());
12697 uiout->field_string ("what", msg);
12700 uiout->field_string ("what", "all Ada exceptions");
12704 case ada_catch_exception_unhandled:
12705 uiout->field_string ("what", "unhandled Ada exceptions");
12708 case ada_catch_handlers:
12709 if (!c->excep_string.empty ())
12711 uiout->field_fmt ("what",
12712 _("`%s' Ada exception handlers"),
12713 c->excep_string.c_str ());
12716 uiout->field_string ("what", "all Ada exceptions handlers");
12719 case ada_catch_assert:
12720 uiout->field_string ("what", "failed Ada assertions");
12724 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12729 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12730 for all exception catchpoint kinds. */
12733 print_mention_exception (enum ada_exception_catchpoint_kind ex,
12734 struct breakpoint *b)
12736 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12737 struct ui_out *uiout = current_uiout;
12739 uiout->text (b->disposition == disp_del ? _("Temporary catchpoint ")
12740 : _("Catchpoint "));
12741 uiout->field_int ("bkptno", b->number);
12742 uiout->text (": ");
12746 case ada_catch_exception:
12747 if (!c->excep_string.empty ())
12749 std::string info = string_printf (_("`%s' Ada exception"),
12750 c->excep_string.c_str ());
12751 uiout->text (info.c_str ());
12754 uiout->text (_("all Ada exceptions"));
12757 case ada_catch_exception_unhandled:
12758 uiout->text (_("unhandled Ada exceptions"));
12761 case ada_catch_handlers:
12762 if (!c->excep_string.empty ())
12765 = string_printf (_("`%s' Ada exception handlers"),
12766 c->excep_string.c_str ());
12767 uiout->text (info.c_str ());
12770 uiout->text (_("all Ada exceptions handlers"));
12773 case ada_catch_assert:
12774 uiout->text (_("failed Ada assertions"));
12778 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12783 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12784 for all exception catchpoint kinds. */
12787 print_recreate_exception (enum ada_exception_catchpoint_kind ex,
12788 struct breakpoint *b, struct ui_file *fp)
12790 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12794 case ada_catch_exception:
12795 fprintf_filtered (fp, "catch exception");
12796 if (!c->excep_string.empty ())
12797 fprintf_filtered (fp, " %s", c->excep_string.c_str ());
12800 case ada_catch_exception_unhandled:
12801 fprintf_filtered (fp, "catch exception unhandled");
12804 case ada_catch_handlers:
12805 fprintf_filtered (fp, "catch handlers");
12808 case ada_catch_assert:
12809 fprintf_filtered (fp, "catch assert");
12813 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12815 print_recreate_thread (b, fp);
12818 /* Virtual table for "catch exception" breakpoints. */
12820 static struct bp_location *
12821 allocate_location_catch_exception (struct breakpoint *self)
12823 return allocate_location_exception (ada_catch_exception, self);
12827 re_set_catch_exception (struct breakpoint *b)
12829 re_set_exception (ada_catch_exception, b);
12833 check_status_catch_exception (bpstat bs)
12835 check_status_exception (ada_catch_exception, bs);
12838 static enum print_stop_action
12839 print_it_catch_exception (bpstat bs)
12841 return print_it_exception (ada_catch_exception, bs);
12845 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
12847 print_one_exception (ada_catch_exception, b, last_loc);
12851 print_mention_catch_exception (struct breakpoint *b)
12853 print_mention_exception (ada_catch_exception, b);
12857 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
12859 print_recreate_exception (ada_catch_exception, b, fp);
12862 static struct breakpoint_ops catch_exception_breakpoint_ops;
12864 /* Virtual table for "catch exception unhandled" breakpoints. */
12866 static struct bp_location *
12867 allocate_location_catch_exception_unhandled (struct breakpoint *self)
12869 return allocate_location_exception (ada_catch_exception_unhandled, self);
12873 re_set_catch_exception_unhandled (struct breakpoint *b)
12875 re_set_exception (ada_catch_exception_unhandled, b);
12879 check_status_catch_exception_unhandled (bpstat bs)
12881 check_status_exception (ada_catch_exception_unhandled, bs);
12884 static enum print_stop_action
12885 print_it_catch_exception_unhandled (bpstat bs)
12887 return print_it_exception (ada_catch_exception_unhandled, bs);
12891 print_one_catch_exception_unhandled (struct breakpoint *b,
12892 struct bp_location **last_loc)
12894 print_one_exception (ada_catch_exception_unhandled, b, last_loc);
12898 print_mention_catch_exception_unhandled (struct breakpoint *b)
12900 print_mention_exception (ada_catch_exception_unhandled, b);
12904 print_recreate_catch_exception_unhandled (struct breakpoint *b,
12905 struct ui_file *fp)
12907 print_recreate_exception (ada_catch_exception_unhandled, b, fp);
12910 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
12912 /* Virtual table for "catch assert" breakpoints. */
12914 static struct bp_location *
12915 allocate_location_catch_assert (struct breakpoint *self)
12917 return allocate_location_exception (ada_catch_assert, self);
12921 re_set_catch_assert (struct breakpoint *b)
12923 re_set_exception (ada_catch_assert, b);
12927 check_status_catch_assert (bpstat bs)
12929 check_status_exception (ada_catch_assert, bs);
12932 static enum print_stop_action
12933 print_it_catch_assert (bpstat bs)
12935 return print_it_exception (ada_catch_assert, bs);
12939 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
12941 print_one_exception (ada_catch_assert, b, last_loc);
12945 print_mention_catch_assert (struct breakpoint *b)
12947 print_mention_exception (ada_catch_assert, b);
12951 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
12953 print_recreate_exception (ada_catch_assert, b, fp);
12956 static struct breakpoint_ops catch_assert_breakpoint_ops;
12958 /* Virtual table for "catch handlers" breakpoints. */
12960 static struct bp_location *
12961 allocate_location_catch_handlers (struct breakpoint *self)
12963 return allocate_location_exception (ada_catch_handlers, self);
12967 re_set_catch_handlers (struct breakpoint *b)
12969 re_set_exception (ada_catch_handlers, b);
12973 check_status_catch_handlers (bpstat bs)
12975 check_status_exception (ada_catch_handlers, bs);
12978 static enum print_stop_action
12979 print_it_catch_handlers (bpstat bs)
12981 return print_it_exception (ada_catch_handlers, bs);
12985 print_one_catch_handlers (struct breakpoint *b,
12986 struct bp_location **last_loc)
12988 print_one_exception (ada_catch_handlers, b, last_loc);
12992 print_mention_catch_handlers (struct breakpoint *b)
12994 print_mention_exception (ada_catch_handlers, b);
12998 print_recreate_catch_handlers (struct breakpoint *b,
12999 struct ui_file *fp)
13001 print_recreate_exception (ada_catch_handlers, b, fp);
13004 static struct breakpoint_ops catch_handlers_breakpoint_ops;
13006 /* Split the arguments specified in a "catch exception" command.
13007 Set EX to the appropriate catchpoint type.
13008 Set EXCEP_STRING to the name of the specific exception if
13009 specified by the user.
13010 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
13011 "catch handlers" command. False otherwise.
13012 If a condition is found at the end of the arguments, the condition
13013 expression is stored in COND_STRING (memory must be deallocated
13014 after use). Otherwise COND_STRING is set to NULL. */
13017 catch_ada_exception_command_split (const char *args,
13018 bool is_catch_handlers_cmd,
13019 enum ada_exception_catchpoint_kind *ex,
13020 std::string *excep_string,
13021 std::string *cond_string)
13023 std::string exception_name;
13025 exception_name = extract_arg (&args);
13026 if (exception_name == "if")
13028 /* This is not an exception name; this is the start of a condition
13029 expression for a catchpoint on all exceptions. So, "un-get"
13030 this token, and set exception_name to NULL. */
13031 exception_name.clear ();
13035 /* Check to see if we have a condition. */
13037 args = skip_spaces (args);
13038 if (startswith (args, "if")
13039 && (isspace (args[2]) || args[2] == '\0'))
13042 args = skip_spaces (args);
13044 if (args[0] == '\0')
13045 error (_("Condition missing after `if' keyword"));
13046 *cond_string = args;
13048 args += strlen (args);
13051 /* Check that we do not have any more arguments. Anything else
13054 if (args[0] != '\0')
13055 error (_("Junk at end of expression"));
13057 if (is_catch_handlers_cmd)
13059 /* Catch handling of exceptions. */
13060 *ex = ada_catch_handlers;
13061 *excep_string = exception_name;
13063 else if (exception_name.empty ())
13065 /* Catch all exceptions. */
13066 *ex = ada_catch_exception;
13067 excep_string->clear ();
13069 else if (exception_name == "unhandled")
13071 /* Catch unhandled exceptions. */
13072 *ex = ada_catch_exception_unhandled;
13073 excep_string->clear ();
13077 /* Catch a specific exception. */
13078 *ex = ada_catch_exception;
13079 *excep_string = exception_name;
13083 /* Return the name of the symbol on which we should break in order to
13084 implement a catchpoint of the EX kind. */
13086 static const char *
13087 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex)
13089 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
13091 gdb_assert (data->exception_info != NULL);
13095 case ada_catch_exception:
13096 return (data->exception_info->catch_exception_sym);
13098 case ada_catch_exception_unhandled:
13099 return (data->exception_info->catch_exception_unhandled_sym);
13101 case ada_catch_assert:
13102 return (data->exception_info->catch_assert_sym);
13104 case ada_catch_handlers:
13105 return (data->exception_info->catch_handlers_sym);
13108 internal_error (__FILE__, __LINE__,
13109 _("unexpected catchpoint kind (%d)"), ex);
13113 /* Return the breakpoint ops "virtual table" used for catchpoints
13116 static const struct breakpoint_ops *
13117 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex)
13121 case ada_catch_exception:
13122 return (&catch_exception_breakpoint_ops);
13124 case ada_catch_exception_unhandled:
13125 return (&catch_exception_unhandled_breakpoint_ops);
13127 case ada_catch_assert:
13128 return (&catch_assert_breakpoint_ops);
13130 case ada_catch_handlers:
13131 return (&catch_handlers_breakpoint_ops);
13134 internal_error (__FILE__, __LINE__,
13135 _("unexpected catchpoint kind (%d)"), ex);
13139 /* Return the condition that will be used to match the current exception
13140 being raised with the exception that the user wants to catch. This
13141 assumes that this condition is used when the inferior just triggered
13142 an exception catchpoint.
13143 EX: the type of catchpoints used for catching Ada exceptions. */
13146 ada_exception_catchpoint_cond_string (const char *excep_string,
13147 enum ada_exception_catchpoint_kind ex)
13150 bool is_standard_exc = false;
13151 std::string result;
13153 if (ex == ada_catch_handlers)
13155 /* For exception handlers catchpoints, the condition string does
13156 not use the same parameter as for the other exceptions. */
13157 result = ("long_integer (GNAT_GCC_exception_Access"
13158 "(gcc_exception).all.occurrence.id)");
13161 result = "long_integer (e)";
13163 /* The standard exceptions are a special case. They are defined in
13164 runtime units that have been compiled without debugging info; if
13165 EXCEP_STRING is the not-fully-qualified name of a standard
13166 exception (e.g. "constraint_error") then, during the evaluation
13167 of the condition expression, the symbol lookup on this name would
13168 *not* return this standard exception. The catchpoint condition
13169 may then be set only on user-defined exceptions which have the
13170 same not-fully-qualified name (e.g. my_package.constraint_error).
13172 To avoid this unexcepted behavior, these standard exceptions are
13173 systematically prefixed by "standard". This means that "catch
13174 exception constraint_error" is rewritten into "catch exception
13175 standard.constraint_error".
13177 If an exception named contraint_error is defined in another package of
13178 the inferior program, then the only way to specify this exception as a
13179 breakpoint condition is to use its fully-qualified named:
13180 e.g. my_package.constraint_error. */
13182 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
13184 if (strcmp (standard_exc [i], excep_string) == 0)
13186 is_standard_exc = true;
13193 if (is_standard_exc)
13194 string_appendf (result, "long_integer (&standard.%s)", excep_string);
13196 string_appendf (result, "long_integer (&%s)", excep_string);
13201 /* Return the symtab_and_line that should be used to insert an exception
13202 catchpoint of the TYPE kind.
13204 ADDR_STRING returns the name of the function where the real
13205 breakpoint that implements the catchpoints is set, depending on the
13206 type of catchpoint we need to create. */
13208 static struct symtab_and_line
13209 ada_exception_sal (enum ada_exception_catchpoint_kind ex,
13210 const char **addr_string, const struct breakpoint_ops **ops)
13212 const char *sym_name;
13213 struct symbol *sym;
13215 /* First, find out which exception support info to use. */
13216 ada_exception_support_info_sniffer ();
13218 /* Then lookup the function on which we will break in order to catch
13219 the Ada exceptions requested by the user. */
13220 sym_name = ada_exception_sym_name (ex);
13221 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
13224 error (_("Catchpoint symbol not found: %s"), sym_name);
13226 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
13227 error (_("Unable to insert catchpoint. %s is not a function."), sym_name);
13229 /* Set ADDR_STRING. */
13230 *addr_string = xstrdup (sym_name);
13233 *ops = ada_exception_breakpoint_ops (ex);
13235 return find_function_start_sal (sym, 1);
13238 /* Create an Ada exception catchpoint.
13240 EX_KIND is the kind of exception catchpoint to be created.
13242 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
13243 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
13244 of the exception to which this catchpoint applies.
13246 COND_STRING, if not empty, is the catchpoint condition.
13248 TEMPFLAG, if nonzero, means that the underlying breakpoint
13249 should be temporary.
13251 FROM_TTY is the usual argument passed to all commands implementations. */
13254 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
13255 enum ada_exception_catchpoint_kind ex_kind,
13256 const std::string &excep_string,
13257 const std::string &cond_string,
13262 const char *addr_string = NULL;
13263 const struct breakpoint_ops *ops = NULL;
13264 struct symtab_and_line sal = ada_exception_sal (ex_kind, &addr_string, &ops);
13266 std::unique_ptr<ada_catchpoint> c (new ada_catchpoint ());
13267 init_ada_exception_breakpoint (c.get (), gdbarch, sal, addr_string,
13268 ops, tempflag, disabled, from_tty);
13269 c->excep_string = excep_string;
13270 create_excep_cond_exprs (c.get (), ex_kind);
13271 if (!cond_string.empty ())
13272 set_breakpoint_condition (c.get (), cond_string.c_str (), from_tty);
13273 install_breakpoint (0, std::move (c), 1);
13276 /* Implement the "catch exception" command. */
13279 catch_ada_exception_command (const char *arg_entry, int from_tty,
13280 struct cmd_list_element *command)
13282 const char *arg = arg_entry;
13283 struct gdbarch *gdbarch = get_current_arch ();
13285 enum ada_exception_catchpoint_kind ex_kind;
13286 std::string excep_string;
13287 std::string cond_string;
13289 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13293 catch_ada_exception_command_split (arg, false, &ex_kind, &excep_string,
13295 create_ada_exception_catchpoint (gdbarch, ex_kind,
13296 excep_string, cond_string,
13297 tempflag, 1 /* enabled */,
13301 /* Implement the "catch handlers" command. */
13304 catch_ada_handlers_command (const char *arg_entry, int from_tty,
13305 struct cmd_list_element *command)
13307 const char *arg = arg_entry;
13308 struct gdbarch *gdbarch = get_current_arch ();
13310 enum ada_exception_catchpoint_kind ex_kind;
13311 std::string excep_string;
13312 std::string cond_string;
13314 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13318 catch_ada_exception_command_split (arg, true, &ex_kind, &excep_string,
13320 create_ada_exception_catchpoint (gdbarch, ex_kind,
13321 excep_string, cond_string,
13322 tempflag, 1 /* enabled */,
13326 /* Split the arguments specified in a "catch assert" command.
13328 ARGS contains the command's arguments (or the empty string if
13329 no arguments were passed).
13331 If ARGS contains a condition, set COND_STRING to that condition
13332 (the memory needs to be deallocated after use). */
13335 catch_ada_assert_command_split (const char *args, std::string &cond_string)
13337 args = skip_spaces (args);
13339 /* Check whether a condition was provided. */
13340 if (startswith (args, "if")
13341 && (isspace (args[2]) || args[2] == '\0'))
13344 args = skip_spaces (args);
13345 if (args[0] == '\0')
13346 error (_("condition missing after `if' keyword"));
13347 cond_string.assign (args);
13350 /* Otherwise, there should be no other argument at the end of
13352 else if (args[0] != '\0')
13353 error (_("Junk at end of arguments."));
13356 /* Implement the "catch assert" command. */
13359 catch_assert_command (const char *arg_entry, int from_tty,
13360 struct cmd_list_element *command)
13362 const char *arg = arg_entry;
13363 struct gdbarch *gdbarch = get_current_arch ();
13365 std::string cond_string;
13367 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13371 catch_ada_assert_command_split (arg, cond_string);
13372 create_ada_exception_catchpoint (gdbarch, ada_catch_assert,
13374 tempflag, 1 /* enabled */,
13378 /* Return non-zero if the symbol SYM is an Ada exception object. */
13381 ada_is_exception_sym (struct symbol *sym)
13383 const char *type_name = TYPE_NAME (SYMBOL_TYPE (sym));
13385 return (SYMBOL_CLASS (sym) != LOC_TYPEDEF
13386 && SYMBOL_CLASS (sym) != LOC_BLOCK
13387 && SYMBOL_CLASS (sym) != LOC_CONST
13388 && SYMBOL_CLASS (sym) != LOC_UNRESOLVED
13389 && type_name != NULL && strcmp (type_name, "exception") == 0);
13392 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13393 Ada exception object. This matches all exceptions except the ones
13394 defined by the Ada language. */
13397 ada_is_non_standard_exception_sym (struct symbol *sym)
13401 if (!ada_is_exception_sym (sym))
13404 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13405 if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0)
13406 return 0; /* A standard exception. */
13408 /* Numeric_Error is also a standard exception, so exclude it.
13409 See the STANDARD_EXC description for more details as to why
13410 this exception is not listed in that array. */
13411 if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0)
13417 /* A helper function for std::sort, comparing two struct ada_exc_info
13420 The comparison is determined first by exception name, and then
13421 by exception address. */
13424 ada_exc_info::operator< (const ada_exc_info &other) const
13428 result = strcmp (name, other.name);
13431 if (result == 0 && addr < other.addr)
13437 ada_exc_info::operator== (const ada_exc_info &other) const
13439 return addr == other.addr && strcmp (name, other.name) == 0;
13442 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13443 routine, but keeping the first SKIP elements untouched.
13445 All duplicates are also removed. */
13448 sort_remove_dups_ada_exceptions_list (std::vector<ada_exc_info> *exceptions,
13451 std::sort (exceptions->begin () + skip, exceptions->end ());
13452 exceptions->erase (std::unique (exceptions->begin () + skip, exceptions->end ()),
13453 exceptions->end ());
13456 /* Add all exceptions defined by the Ada standard whose name match
13457 a regular expression.
13459 If PREG is not NULL, then this regexp_t object is used to
13460 perform the symbol name matching. Otherwise, no name-based
13461 filtering is performed.
13463 EXCEPTIONS is a vector of exceptions to which matching exceptions
13467 ada_add_standard_exceptions (compiled_regex *preg,
13468 std::vector<ada_exc_info> *exceptions)
13472 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13475 || preg->exec (standard_exc[i], 0, NULL, 0) == 0)
13477 struct bound_minimal_symbol msymbol
13478 = ada_lookup_simple_minsym (standard_exc[i]);
13480 if (msymbol.minsym != NULL)
13482 struct ada_exc_info info
13483 = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)};
13485 exceptions->push_back (info);
13491 /* Add all Ada exceptions defined locally and accessible from the given
13494 If PREG is not NULL, then this regexp_t object is used to
13495 perform the symbol name matching. Otherwise, no name-based
13496 filtering is performed.
13498 EXCEPTIONS is a vector of exceptions to which matching exceptions
13502 ada_add_exceptions_from_frame (compiled_regex *preg,
13503 struct frame_info *frame,
13504 std::vector<ada_exc_info> *exceptions)
13506 const struct block *block = get_frame_block (frame, 0);
13510 struct block_iterator iter;
13511 struct symbol *sym;
13513 ALL_BLOCK_SYMBOLS (block, iter, sym)
13515 switch (SYMBOL_CLASS (sym))
13522 if (ada_is_exception_sym (sym))
13524 struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym),
13525 SYMBOL_VALUE_ADDRESS (sym)};
13527 exceptions->push_back (info);
13531 if (BLOCK_FUNCTION (block) != NULL)
13533 block = BLOCK_SUPERBLOCK (block);
13537 /* Return true if NAME matches PREG or if PREG is NULL. */
13540 name_matches_regex (const char *name, compiled_regex *preg)
13542 return (preg == NULL
13543 || preg->exec (ada_decode (name), 0, NULL, 0) == 0);
13546 /* Add all exceptions defined globally whose name name match
13547 a regular expression, excluding standard exceptions.
13549 The reason we exclude standard exceptions is that they need
13550 to be handled separately: Standard exceptions are defined inside
13551 a runtime unit which is normally not compiled with debugging info,
13552 and thus usually do not show up in our symbol search. However,
13553 if the unit was in fact built with debugging info, we need to
13554 exclude them because they would duplicate the entry we found
13555 during the special loop that specifically searches for those
13556 standard exceptions.
13558 If PREG is not NULL, then this regexp_t object is used to
13559 perform the symbol name matching. Otherwise, no name-based
13560 filtering is performed.
13562 EXCEPTIONS is a vector of exceptions to which matching exceptions
13566 ada_add_global_exceptions (compiled_regex *preg,
13567 std::vector<ada_exc_info> *exceptions)
13569 struct objfile *objfile;
13570 struct compunit_symtab *s;
13572 /* In Ada, the symbol "search name" is a linkage name, whereas the
13573 regular expression used to do the matching refers to the natural
13574 name. So match against the decoded name. */
13575 expand_symtabs_matching (NULL,
13576 lookup_name_info::match_any (),
13577 [&] (const char *search_name)
13579 const char *decoded = ada_decode (search_name);
13580 return name_matches_regex (decoded, preg);
13585 ALL_COMPUNITS (objfile, s)
13587 const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s);
13590 for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++)
13592 struct block *b = BLOCKVECTOR_BLOCK (bv, i);
13593 struct block_iterator iter;
13594 struct symbol *sym;
13596 ALL_BLOCK_SYMBOLS (b, iter, sym)
13597 if (ada_is_non_standard_exception_sym (sym)
13598 && name_matches_regex (SYMBOL_NATURAL_NAME (sym), preg))
13600 struct ada_exc_info info
13601 = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)};
13603 exceptions->push_back (info);
13609 /* Implements ada_exceptions_list with the regular expression passed
13610 as a regex_t, rather than a string.
13612 If not NULL, PREG is used to filter out exceptions whose names
13613 do not match. Otherwise, all exceptions are listed. */
13615 static std::vector<ada_exc_info>
13616 ada_exceptions_list_1 (compiled_regex *preg)
13618 std::vector<ada_exc_info> result;
13621 /* First, list the known standard exceptions. These exceptions
13622 need to be handled separately, as they are usually defined in
13623 runtime units that have been compiled without debugging info. */
13625 ada_add_standard_exceptions (preg, &result);
13627 /* Next, find all exceptions whose scope is local and accessible
13628 from the currently selected frame. */
13630 if (has_stack_frames ())
13632 prev_len = result.size ();
13633 ada_add_exceptions_from_frame (preg, get_selected_frame (NULL),
13635 if (result.size () > prev_len)
13636 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13639 /* Add all exceptions whose scope is global. */
13641 prev_len = result.size ();
13642 ada_add_global_exceptions (preg, &result);
13643 if (result.size () > prev_len)
13644 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13649 /* Return a vector of ada_exc_info.
13651 If REGEXP is NULL, all exceptions are included in the result.
13652 Otherwise, it should contain a valid regular expression,
13653 and only the exceptions whose names match that regular expression
13654 are included in the result.
13656 The exceptions are sorted in the following order:
13657 - Standard exceptions (defined by the Ada language), in
13658 alphabetical order;
13659 - Exceptions only visible from the current frame, in
13660 alphabetical order;
13661 - Exceptions whose scope is global, in alphabetical order. */
13663 std::vector<ada_exc_info>
13664 ada_exceptions_list (const char *regexp)
13666 if (regexp == NULL)
13667 return ada_exceptions_list_1 (NULL);
13669 compiled_regex reg (regexp, REG_NOSUB, _("invalid regular expression"));
13670 return ada_exceptions_list_1 (®);
13673 /* Implement the "info exceptions" command. */
13676 info_exceptions_command (const char *regexp, int from_tty)
13678 struct gdbarch *gdbarch = get_current_arch ();
13680 std::vector<ada_exc_info> exceptions = ada_exceptions_list (regexp);
13682 if (regexp != NULL)
13684 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp);
13686 printf_filtered (_("All defined Ada exceptions:\n"));
13688 for (const ada_exc_info &info : exceptions)
13689 printf_filtered ("%s: %s\n", info.name, paddress (gdbarch, info.addr));
13693 /* Information about operators given special treatment in functions
13695 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13697 #define ADA_OPERATORS \
13698 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13699 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13700 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13701 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13702 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13703 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13704 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13705 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13706 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13707 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13708 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13709 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13710 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13711 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13712 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13713 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13714 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13715 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13716 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13719 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
13722 switch (exp->elts[pc - 1].opcode)
13725 operator_length_standard (exp, pc, oplenp, argsp);
13728 #define OP_DEFN(op, len, args, binop) \
13729 case op: *oplenp = len; *argsp = args; break;
13735 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
13740 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
13745 /* Implementation of the exp_descriptor method operator_check. */
13748 ada_operator_check (struct expression *exp, int pos,
13749 int (*objfile_func) (struct objfile *objfile, void *data),
13752 const union exp_element *const elts = exp->elts;
13753 struct type *type = NULL;
13755 switch (elts[pos].opcode)
13757 case UNOP_IN_RANGE:
13759 type = elts[pos + 1].type;
13763 return operator_check_standard (exp, pos, objfile_func, data);
13766 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13768 if (type && TYPE_OBJFILE (type)
13769 && (*objfile_func) (TYPE_OBJFILE (type), data))
13775 static const char *
13776 ada_op_name (enum exp_opcode opcode)
13781 return op_name_standard (opcode);
13783 #define OP_DEFN(op, len, args, binop) case op: return #op;
13788 return "OP_AGGREGATE";
13790 return "OP_CHOICES";
13796 /* As for operator_length, but assumes PC is pointing at the first
13797 element of the operator, and gives meaningful results only for the
13798 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13801 ada_forward_operator_length (struct expression *exp, int pc,
13802 int *oplenp, int *argsp)
13804 switch (exp->elts[pc].opcode)
13807 *oplenp = *argsp = 0;
13810 #define OP_DEFN(op, len, args, binop) \
13811 case op: *oplenp = len; *argsp = args; break;
13817 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
13822 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
13828 int len = longest_to_int (exp->elts[pc + 1].longconst);
13830 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
13838 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
13840 enum exp_opcode op = exp->elts[elt].opcode;
13845 ada_forward_operator_length (exp, elt, &oplen, &nargs);
13849 /* Ada attributes ('Foo). */
13852 case OP_ATR_LENGTH:
13856 case OP_ATR_MODULUS:
13863 case UNOP_IN_RANGE:
13865 /* XXX: gdb_sprint_host_address, type_sprint */
13866 fprintf_filtered (stream, _("Type @"));
13867 gdb_print_host_address (exp->elts[pc + 1].type, stream);
13868 fprintf_filtered (stream, " (");
13869 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
13870 fprintf_filtered (stream, ")");
13872 case BINOP_IN_BOUNDS:
13873 fprintf_filtered (stream, " (%d)",
13874 longest_to_int (exp->elts[pc + 2].longconst));
13876 case TERNOP_IN_RANGE:
13881 case OP_DISCRETE_RANGE:
13882 case OP_POSITIONAL:
13889 char *name = &exp->elts[elt + 2].string;
13890 int len = longest_to_int (exp->elts[elt + 1].longconst);
13892 fprintf_filtered (stream, "Text: `%.*s'", len, name);
13897 return dump_subexp_body_standard (exp, stream, elt);
13901 for (i = 0; i < nargs; i += 1)
13902 elt = dump_subexp (exp, stream, elt);
13907 /* The Ada extension of print_subexp (q.v.). */
13910 ada_print_subexp (struct expression *exp, int *pos,
13911 struct ui_file *stream, enum precedence prec)
13913 int oplen, nargs, i;
13915 enum exp_opcode op = exp->elts[pc].opcode;
13917 ada_forward_operator_length (exp, pc, &oplen, &nargs);
13924 print_subexp_standard (exp, pos, stream, prec);
13928 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
13931 case BINOP_IN_BOUNDS:
13932 /* XXX: sprint_subexp */
13933 print_subexp (exp, pos, stream, PREC_SUFFIX);
13934 fputs_filtered (" in ", stream);
13935 print_subexp (exp, pos, stream, PREC_SUFFIX);
13936 fputs_filtered ("'range", stream);
13937 if (exp->elts[pc + 1].longconst > 1)
13938 fprintf_filtered (stream, "(%ld)",
13939 (long) exp->elts[pc + 1].longconst);
13942 case TERNOP_IN_RANGE:
13943 if (prec >= PREC_EQUAL)
13944 fputs_filtered ("(", stream);
13945 /* XXX: sprint_subexp */
13946 print_subexp (exp, pos, stream, PREC_SUFFIX);
13947 fputs_filtered (" in ", stream);
13948 print_subexp (exp, pos, stream, PREC_EQUAL);
13949 fputs_filtered (" .. ", stream);
13950 print_subexp (exp, pos, stream, PREC_EQUAL);
13951 if (prec >= PREC_EQUAL)
13952 fputs_filtered (")", stream);
13957 case OP_ATR_LENGTH:
13961 case OP_ATR_MODULUS:
13966 if (exp->elts[*pos].opcode == OP_TYPE)
13968 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
13969 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0,
13970 &type_print_raw_options);
13974 print_subexp (exp, pos, stream, PREC_SUFFIX);
13975 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
13980 for (tem = 1; tem < nargs; tem += 1)
13982 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
13983 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
13985 fputs_filtered (")", stream);
13990 type_print (exp->elts[pc + 1].type, "", stream, 0);
13991 fputs_filtered ("'(", stream);
13992 print_subexp (exp, pos, stream, PREC_PREFIX);
13993 fputs_filtered (")", stream);
13996 case UNOP_IN_RANGE:
13997 /* XXX: sprint_subexp */
13998 print_subexp (exp, pos, stream, PREC_SUFFIX);
13999 fputs_filtered (" in ", stream);
14000 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0,
14001 &type_print_raw_options);
14004 case OP_DISCRETE_RANGE:
14005 print_subexp (exp, pos, stream, PREC_SUFFIX);
14006 fputs_filtered ("..", stream);
14007 print_subexp (exp, pos, stream, PREC_SUFFIX);
14011 fputs_filtered ("others => ", stream);
14012 print_subexp (exp, pos, stream, PREC_SUFFIX);
14016 for (i = 0; i < nargs-1; i += 1)
14019 fputs_filtered ("|", stream);
14020 print_subexp (exp, pos, stream, PREC_SUFFIX);
14022 fputs_filtered (" => ", stream);
14023 print_subexp (exp, pos, stream, PREC_SUFFIX);
14026 case OP_POSITIONAL:
14027 print_subexp (exp, pos, stream, PREC_SUFFIX);
14031 fputs_filtered ("(", stream);
14032 for (i = 0; i < nargs; i += 1)
14035 fputs_filtered (", ", stream);
14036 print_subexp (exp, pos, stream, PREC_SUFFIX);
14038 fputs_filtered (")", stream);
14043 /* Table mapping opcodes into strings for printing operators
14044 and precedences of the operators. */
14046 static const struct op_print ada_op_print_tab[] = {
14047 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
14048 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
14049 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
14050 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
14051 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
14052 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
14053 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
14054 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
14055 {"<=", BINOP_LEQ, PREC_ORDER, 0},
14056 {">=", BINOP_GEQ, PREC_ORDER, 0},
14057 {">", BINOP_GTR, PREC_ORDER, 0},
14058 {"<", BINOP_LESS, PREC_ORDER, 0},
14059 {">>", BINOP_RSH, PREC_SHIFT, 0},
14060 {"<<", BINOP_LSH, PREC_SHIFT, 0},
14061 {"+", BINOP_ADD, PREC_ADD, 0},
14062 {"-", BINOP_SUB, PREC_ADD, 0},
14063 {"&", BINOP_CONCAT, PREC_ADD, 0},
14064 {"*", BINOP_MUL, PREC_MUL, 0},
14065 {"/", BINOP_DIV, PREC_MUL, 0},
14066 {"rem", BINOP_REM, PREC_MUL, 0},
14067 {"mod", BINOP_MOD, PREC_MUL, 0},
14068 {"**", BINOP_EXP, PREC_REPEAT, 0},
14069 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
14070 {"-", UNOP_NEG, PREC_PREFIX, 0},
14071 {"+", UNOP_PLUS, PREC_PREFIX, 0},
14072 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
14073 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
14074 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
14075 {".all", UNOP_IND, PREC_SUFFIX, 1},
14076 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
14077 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
14078 {NULL, OP_NULL, PREC_SUFFIX, 0}
14081 enum ada_primitive_types {
14082 ada_primitive_type_int,
14083 ada_primitive_type_long,
14084 ada_primitive_type_short,
14085 ada_primitive_type_char,
14086 ada_primitive_type_float,
14087 ada_primitive_type_double,
14088 ada_primitive_type_void,
14089 ada_primitive_type_long_long,
14090 ada_primitive_type_long_double,
14091 ada_primitive_type_natural,
14092 ada_primitive_type_positive,
14093 ada_primitive_type_system_address,
14094 ada_primitive_type_storage_offset,
14095 nr_ada_primitive_types
14099 ada_language_arch_info (struct gdbarch *gdbarch,
14100 struct language_arch_info *lai)
14102 const struct builtin_type *builtin = builtin_type (gdbarch);
14104 lai->primitive_type_vector
14105 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
14108 lai->primitive_type_vector [ada_primitive_type_int]
14109 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14111 lai->primitive_type_vector [ada_primitive_type_long]
14112 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
14113 0, "long_integer");
14114 lai->primitive_type_vector [ada_primitive_type_short]
14115 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
14116 0, "short_integer");
14117 lai->string_char_type
14118 = lai->primitive_type_vector [ada_primitive_type_char]
14119 = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
14120 lai->primitive_type_vector [ada_primitive_type_float]
14121 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
14122 "float", gdbarch_float_format (gdbarch));
14123 lai->primitive_type_vector [ada_primitive_type_double]
14124 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
14125 "long_float", gdbarch_double_format (gdbarch));
14126 lai->primitive_type_vector [ada_primitive_type_long_long]
14127 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
14128 0, "long_long_integer");
14129 lai->primitive_type_vector [ada_primitive_type_long_double]
14130 = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch),
14131 "long_long_float", gdbarch_long_double_format (gdbarch));
14132 lai->primitive_type_vector [ada_primitive_type_natural]
14133 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14135 lai->primitive_type_vector [ada_primitive_type_positive]
14136 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14138 lai->primitive_type_vector [ada_primitive_type_void]
14139 = builtin->builtin_void;
14141 lai->primitive_type_vector [ada_primitive_type_system_address]
14142 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT,
14144 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
14145 = "system__address";
14147 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
14148 type. This is a signed integral type whose size is the same as
14149 the size of addresses. */
14151 unsigned int addr_length = TYPE_LENGTH
14152 (lai->primitive_type_vector [ada_primitive_type_system_address]);
14154 lai->primitive_type_vector [ada_primitive_type_storage_offset]
14155 = arch_integer_type (gdbarch, addr_length * HOST_CHAR_BIT, 0,
14159 lai->bool_type_symbol = NULL;
14160 lai->bool_type_default = builtin->builtin_bool;
14163 /* Language vector */
14165 /* Not really used, but needed in the ada_language_defn. */
14168 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
14170 ada_emit_char (c, type, stream, quoter, 1);
14174 parse (struct parser_state *ps)
14176 warnings_issued = 0;
14177 return ada_parse (ps);
14180 static const struct exp_descriptor ada_exp_descriptor = {
14182 ada_operator_length,
14183 ada_operator_check,
14185 ada_dump_subexp_body,
14186 ada_evaluate_subexp
14189 /* symbol_name_matcher_ftype adapter for wild_match. */
14192 do_wild_match (const char *symbol_search_name,
14193 const lookup_name_info &lookup_name,
14194 completion_match_result *comp_match_res)
14196 return wild_match (symbol_search_name, ada_lookup_name (lookup_name));
14199 /* symbol_name_matcher_ftype adapter for full_match. */
14202 do_full_match (const char *symbol_search_name,
14203 const lookup_name_info &lookup_name,
14204 completion_match_result *comp_match_res)
14206 return full_match (symbol_search_name, ada_lookup_name (lookup_name));
14209 /* Build the Ada lookup name for LOOKUP_NAME. */
14211 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info &lookup_name)
14213 const std::string &user_name = lookup_name.name ();
14215 if (user_name[0] == '<')
14217 if (user_name.back () == '>')
14218 m_encoded_name = user_name.substr (1, user_name.size () - 2);
14220 m_encoded_name = user_name.substr (1, user_name.size () - 1);
14221 m_encoded_p = true;
14222 m_verbatim_p = true;
14223 m_wild_match_p = false;
14224 m_standard_p = false;
14228 m_verbatim_p = false;
14230 m_encoded_p = user_name.find ("__") != std::string::npos;
14234 const char *folded = ada_fold_name (user_name.c_str ());
14235 const char *encoded = ada_encode_1 (folded, false);
14236 if (encoded != NULL)
14237 m_encoded_name = encoded;
14239 m_encoded_name = user_name;
14242 m_encoded_name = user_name;
14244 /* Handle the 'package Standard' special case. See description
14245 of m_standard_p. */
14246 if (startswith (m_encoded_name.c_str (), "standard__"))
14248 m_encoded_name = m_encoded_name.substr (sizeof ("standard__") - 1);
14249 m_standard_p = true;
14252 m_standard_p = false;
14254 /* If the name contains a ".", then the user is entering a fully
14255 qualified entity name, and the match must not be done in wild
14256 mode. Similarly, if the user wants to complete what looks
14257 like an encoded name, the match must not be done in wild
14258 mode. Also, in the standard__ special case always do
14259 non-wild matching. */
14261 = (lookup_name.match_type () != symbol_name_match_type::FULL
14264 && user_name.find ('.') == std::string::npos);
14268 /* symbol_name_matcher_ftype method for Ada. This only handles
14269 completion mode. */
14272 ada_symbol_name_matches (const char *symbol_search_name,
14273 const lookup_name_info &lookup_name,
14274 completion_match_result *comp_match_res)
14276 return lookup_name.ada ().matches (symbol_search_name,
14277 lookup_name.match_type (),
14281 /* A name matcher that matches the symbol name exactly, with
14285 literal_symbol_name_matcher (const char *symbol_search_name,
14286 const lookup_name_info &lookup_name,
14287 completion_match_result *comp_match_res)
14289 const std::string &name = lookup_name.name ();
14291 int cmp = (lookup_name.completion_mode ()
14292 ? strncmp (symbol_search_name, name.c_str (), name.size ())
14293 : strcmp (symbol_search_name, name.c_str ()));
14296 if (comp_match_res != NULL)
14297 comp_match_res->set_match (symbol_search_name);
14304 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14307 static symbol_name_matcher_ftype *
14308 ada_get_symbol_name_matcher (const lookup_name_info &lookup_name)
14310 if (lookup_name.match_type () == symbol_name_match_type::SEARCH_NAME)
14311 return literal_symbol_name_matcher;
14313 if (lookup_name.completion_mode ())
14314 return ada_symbol_name_matches;
14317 if (lookup_name.ada ().wild_match_p ())
14318 return do_wild_match;
14320 return do_full_match;
14324 /* Implement the "la_read_var_value" language_defn method for Ada. */
14326 static struct value *
14327 ada_read_var_value (struct symbol *var, const struct block *var_block,
14328 struct frame_info *frame)
14330 const struct block *frame_block = NULL;
14331 struct symbol *renaming_sym = NULL;
14333 /* The only case where default_read_var_value is not sufficient
14334 is when VAR is a renaming... */
14336 frame_block = get_frame_block (frame, NULL);
14338 renaming_sym = ada_find_renaming_symbol (var, frame_block);
14339 if (renaming_sym != NULL)
14340 return ada_read_renaming_var_value (renaming_sym, frame_block);
14342 /* This is a typical case where we expect the default_read_var_value
14343 function to work. */
14344 return default_read_var_value (var, var_block, frame);
14347 static const char *ada_extensions[] =
14349 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14352 extern const struct language_defn ada_language_defn = {
14353 "ada", /* Language name */
14357 case_sensitive_on, /* Yes, Ada is case-insensitive, but
14358 that's not quite what this means. */
14360 macro_expansion_no,
14362 &ada_exp_descriptor,
14365 ada_printchar, /* Print a character constant */
14366 ada_printstr, /* Function to print string constant */
14367 emit_char, /* Function to print single char (not used) */
14368 ada_print_type, /* Print a type using appropriate syntax */
14369 ada_print_typedef, /* Print a typedef using appropriate syntax */
14370 ada_val_print, /* Print a value using appropriate syntax */
14371 ada_value_print, /* Print a top-level value */
14372 ada_read_var_value, /* la_read_var_value */
14373 NULL, /* Language specific skip_trampoline */
14374 NULL, /* name_of_this */
14375 true, /* la_store_sym_names_in_linkage_form_p */
14376 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
14377 basic_lookup_transparent_type, /* lookup_transparent_type */
14378 ada_la_decode, /* Language specific symbol demangler */
14379 ada_sniff_from_mangled_name,
14380 NULL, /* Language specific
14381 class_name_from_physname */
14382 ada_op_print_tab, /* expression operators for printing */
14383 0, /* c-style arrays */
14384 1, /* String lower bound */
14385 ada_get_gdb_completer_word_break_characters,
14386 ada_collect_symbol_completion_matches,
14387 ada_language_arch_info,
14388 ada_print_array_index,
14389 default_pass_by_reference,
14391 c_watch_location_expression,
14392 ada_get_symbol_name_matcher, /* la_get_symbol_name_matcher */
14393 ada_iterate_over_symbols,
14394 default_search_name_hash,
14401 /* Command-list for the "set/show ada" prefix command. */
14402 static struct cmd_list_element *set_ada_list;
14403 static struct cmd_list_element *show_ada_list;
14405 /* Implement the "set ada" prefix command. */
14408 set_ada_command (const char *arg, int from_tty)
14410 printf_unfiltered (_(\
14411 "\"set ada\" must be followed by the name of a setting.\n"));
14412 help_list (set_ada_list, "set ada ", all_commands, gdb_stdout);
14415 /* Implement the "show ada" prefix command. */
14418 show_ada_command (const char *args, int from_tty)
14420 cmd_show_list (show_ada_list, from_tty, "");
14424 initialize_ada_catchpoint_ops (void)
14426 struct breakpoint_ops *ops;
14428 initialize_breakpoint_ops ();
14430 ops = &catch_exception_breakpoint_ops;
14431 *ops = bkpt_breakpoint_ops;
14432 ops->allocate_location = allocate_location_catch_exception;
14433 ops->re_set = re_set_catch_exception;
14434 ops->check_status = check_status_catch_exception;
14435 ops->print_it = print_it_catch_exception;
14436 ops->print_one = print_one_catch_exception;
14437 ops->print_mention = print_mention_catch_exception;
14438 ops->print_recreate = print_recreate_catch_exception;
14440 ops = &catch_exception_unhandled_breakpoint_ops;
14441 *ops = bkpt_breakpoint_ops;
14442 ops->allocate_location = allocate_location_catch_exception_unhandled;
14443 ops->re_set = re_set_catch_exception_unhandled;
14444 ops->check_status = check_status_catch_exception_unhandled;
14445 ops->print_it = print_it_catch_exception_unhandled;
14446 ops->print_one = print_one_catch_exception_unhandled;
14447 ops->print_mention = print_mention_catch_exception_unhandled;
14448 ops->print_recreate = print_recreate_catch_exception_unhandled;
14450 ops = &catch_assert_breakpoint_ops;
14451 *ops = bkpt_breakpoint_ops;
14452 ops->allocate_location = allocate_location_catch_assert;
14453 ops->re_set = re_set_catch_assert;
14454 ops->check_status = check_status_catch_assert;
14455 ops->print_it = print_it_catch_assert;
14456 ops->print_one = print_one_catch_assert;
14457 ops->print_mention = print_mention_catch_assert;
14458 ops->print_recreate = print_recreate_catch_assert;
14460 ops = &catch_handlers_breakpoint_ops;
14461 *ops = bkpt_breakpoint_ops;
14462 ops->allocate_location = allocate_location_catch_handlers;
14463 ops->re_set = re_set_catch_handlers;
14464 ops->check_status = check_status_catch_handlers;
14465 ops->print_it = print_it_catch_handlers;
14466 ops->print_one = print_one_catch_handlers;
14467 ops->print_mention = print_mention_catch_handlers;
14468 ops->print_recreate = print_recreate_catch_handlers;
14471 /* This module's 'new_objfile' observer. */
14474 ada_new_objfile_observer (struct objfile *objfile)
14476 ada_clear_symbol_cache ();
14479 /* This module's 'free_objfile' observer. */
14482 ada_free_objfile_observer (struct objfile *objfile)
14484 ada_clear_symbol_cache ();
14488 _initialize_ada_language (void)
14490 initialize_ada_catchpoint_ops ();
14492 add_prefix_cmd ("ada", no_class, set_ada_command,
14493 _("Prefix command for changing Ada-specfic settings"),
14494 &set_ada_list, "set ada ", 0, &setlist);
14496 add_prefix_cmd ("ada", no_class, show_ada_command,
14497 _("Generic command for showing Ada-specific settings."),
14498 &show_ada_list, "show ada ", 0, &showlist);
14500 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
14501 &trust_pad_over_xvs, _("\
14502 Enable or disable an optimization trusting PAD types over XVS types"), _("\
14503 Show whether an optimization trusting PAD types over XVS types is activated"),
14505 This is related to the encoding used by the GNAT compiler. The debugger\n\
14506 should normally trust the contents of PAD types, but certain older versions\n\
14507 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14508 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14509 work around this bug. It is always safe to turn this option \"off\", but\n\
14510 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14511 this option to \"off\" unless necessary."),
14512 NULL, NULL, &set_ada_list, &show_ada_list);
14514 add_setshow_boolean_cmd ("print-signatures", class_vars,
14515 &print_signatures, _("\
14516 Enable or disable the output of formal and return types for functions in the \
14517 overloads selection menu"), _("\
14518 Show whether the output of formal and return types for functions in the \
14519 overloads selection menu is activated"),
14520 NULL, NULL, NULL, &set_ada_list, &show_ada_list);
14522 add_catch_command ("exception", _("\
14523 Catch Ada exceptions, when raised.\n\
14524 With an argument, catch only exceptions with the given name."),
14525 catch_ada_exception_command,
14530 add_catch_command ("handlers", _("\
14531 Catch Ada exceptions, when handled.\n\
14532 With an argument, catch only exceptions with the given name."),
14533 catch_ada_handlers_command,
14537 add_catch_command ("assert", _("\
14538 Catch failed Ada assertions, when raised.\n\
14539 With an argument, catch only exceptions with the given name."),
14540 catch_assert_command,
14545 varsize_limit = 65536;
14546 add_setshow_uinteger_cmd ("varsize-limit", class_support,
14547 &varsize_limit, _("\
14548 Set the maximum number of bytes allowed in a variable-size object."), _("\
14549 Show the maximum number of bytes allowed in a variable-size object."), _("\
14550 Attempts to access an object whose size is not a compile-time constant\n\
14551 and exceeds this limit will cause an error."),
14552 NULL, NULL, &setlist, &showlist);
14554 add_info ("exceptions", info_exceptions_command,
14556 List all Ada exception names.\n\
14557 If a regular expression is passed as an argument, only those matching\n\
14558 the regular expression are listed."));
14560 add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd,
14561 _("Set Ada maintenance-related variables."),
14562 &maint_set_ada_cmdlist, "maintenance set ada ",
14563 0/*allow-unknown*/, &maintenance_set_cmdlist);
14565 add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd,
14566 _("Show Ada maintenance-related variables"),
14567 &maint_show_ada_cmdlist, "maintenance show ada ",
14568 0/*allow-unknown*/, &maintenance_show_cmdlist);
14570 add_setshow_boolean_cmd
14571 ("ignore-descriptive-types", class_maintenance,
14572 &ada_ignore_descriptive_types_p,
14573 _("Set whether descriptive types generated by GNAT should be ignored."),
14574 _("Show whether descriptive types generated by GNAT should be ignored."),
14576 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14577 DWARF attribute."),
14578 NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist);
14580 decoded_names_store = htab_create_alloc (256, htab_hash_string, streq_hash,
14581 NULL, xcalloc, xfree);
14583 /* The ada-lang observers. */
14584 gdb::observers::new_objfile.attach (ada_new_objfile_observer);
14585 gdb::observers::free_objfile.attach (ada_free_objfile_observer);
14586 gdb::observers::inferior_exit.attach (ada_inferior_exit);
14588 /* Setup various context-specific data. */
14590 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);
14591 ada_pspace_data_handle
14592 = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup);