1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2014 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/>. */
27 #include "gdb_regex.h"
32 #include "expression.h"
33 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
50 #include "dictionary.h"
51 #include "exceptions.h"
59 #include "typeprint.h"
63 #include "mi/mi-common.h"
64 #include "arch-utils.h"
65 #include "cli/cli-utils.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 int full_match (const char *, const char *);
109 static struct value *make_array_descriptor (struct type *, struct value *);
111 static void ada_add_block_symbols (struct obstack *,
112 const struct block *, const char *,
113 domain_enum, struct objfile *, int);
115 static int is_nonfunction (struct ada_symbol_info *, int);
117 static void add_defn_to_vec (struct obstack *, struct symbol *,
118 const struct block *);
120 static int num_defns_collected (struct obstack *);
122 static struct ada_symbol_info *defns_collected (struct obstack *, int);
124 static struct value *resolve_subexp (struct expression **, int *, int,
127 static void replace_operator_with_call (struct expression **, int, int, int,
128 struct symbol *, const struct block *);
130 static int possible_user_operator_p (enum exp_opcode, struct value **);
132 static char *ada_op_name (enum exp_opcode);
134 static const char *ada_decoded_op_name (enum exp_opcode);
136 static int numeric_type_p (struct type *);
138 static int integer_type_p (struct type *);
140 static int scalar_type_p (struct type *);
142 static int discrete_type_p (struct type *);
144 static enum ada_renaming_category parse_old_style_renaming (struct type *,
149 static struct symbol *find_old_style_renaming_symbol (const char *,
150 const struct block *);
152 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
155 static struct value *evaluate_subexp_type (struct expression *, int *);
157 static struct type *ada_find_parallel_type_with_name (struct type *,
160 static int is_dynamic_field (struct type *, int);
162 static struct type *to_fixed_variant_branch_type (struct type *,
164 CORE_ADDR, struct value *);
166 static struct type *to_fixed_array_type (struct type *, struct value *, int);
168 static struct type *to_fixed_range_type (struct type *, struct value *);
170 static struct type *to_static_fixed_type (struct type *);
171 static struct type *static_unwrap_type (struct type *type);
173 static struct value *unwrap_value (struct value *);
175 static struct type *constrained_packed_array_type (struct type *, long *);
177 static struct type *decode_constrained_packed_array_type (struct type *);
179 static long decode_packed_array_bitsize (struct type *);
181 static struct value *decode_constrained_packed_array (struct value *);
183 static int ada_is_packed_array_type (struct type *);
185 static int ada_is_unconstrained_packed_array_type (struct type *);
187 static struct value *value_subscript_packed (struct value *, int,
190 static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int);
192 static struct value *coerce_unspec_val_to_type (struct value *,
195 static struct value *get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol *, struct symbol *);
199 static int equiv_types (struct type *, struct type *);
201 static int is_name_suffix (const char *);
203 static int advance_wild_match (const char **, const char *, int);
205 static int wild_match (const char *, const char *);
207 static struct value *ada_coerce_ref (struct value *);
209 static LONGEST pos_atr (struct value *);
211 static struct value *value_pos_atr (struct type *, struct value *);
213 static struct value *value_val_atr (struct type *, struct value *);
215 static struct symbol *standard_lookup (const char *, const struct block *,
218 static struct value *ada_search_struct_field (char *, struct value *, int,
221 static struct value *ada_value_primitive_field (struct value *, int, int,
224 static int find_struct_field (const char *, struct type *, int,
225 struct type **, int *, int *, int *, int *);
227 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
230 static int ada_resolve_function (struct ada_symbol_info *, int,
231 struct value **, int, const char *,
234 static int ada_is_direct_array_type (struct type *);
236 static void ada_language_arch_info (struct gdbarch *,
237 struct language_arch_info *);
239 static void check_size (const struct type *);
241 static struct value *ada_index_struct_field (int, struct value *, int,
244 static struct value *assign_aggregate (struct value *, struct value *,
248 static void aggregate_assign_from_choices (struct value *, struct value *,
250 int *, LONGEST *, int *,
251 int, LONGEST, LONGEST);
253 static void aggregate_assign_positional (struct value *, struct value *,
255 int *, LONGEST *, int *, int,
259 static void aggregate_assign_others (struct value *, struct value *,
261 int *, LONGEST *, int, LONGEST, LONGEST);
264 static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
267 static struct value *ada_evaluate_subexp (struct type *, struct expression *,
270 static void ada_forward_operator_length (struct expression *, int, int *,
273 static struct type *ada_find_any_type (const char *name);
277 /* Maximum-sized dynamic type. */
278 static unsigned int varsize_limit;
280 /* FIXME: brobecker/2003-09-17: No longer a const because it is
281 returned by a function that does not return a const char *. */
282 static char *ada_completer_word_break_characters =
284 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
286 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
289 /* The name of the symbol to use to get the name of the main subprogram. */
290 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
291 = "__gnat_ada_main_program_name";
293 /* Limit on the number of warnings to raise per expression evaluation. */
294 static int warning_limit = 2;
296 /* Number of warning messages issued; reset to 0 by cleanups after
297 expression evaluation. */
298 static int warnings_issued = 0;
300 static const char *known_runtime_file_name_patterns[] = {
301 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
304 static const char *known_auxiliary_function_name_patterns[] = {
305 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
308 /* Space for allocating results of ada_lookup_symbol_list. */
309 static struct obstack symbol_list_obstack;
311 /* Maintenance-related settings for this module. */
313 static struct cmd_list_element *maint_set_ada_cmdlist;
314 static struct cmd_list_element *maint_show_ada_cmdlist;
316 /* Implement the "maintenance set ada" (prefix) command. */
319 maint_set_ada_cmd (char *args, int from_tty)
321 help_list (maint_set_ada_cmdlist, "maintenance set ada ", -1, gdb_stdout);
324 /* Implement the "maintenance show ada" (prefix) command. */
327 maint_show_ada_cmd (char *args, int from_tty)
329 cmd_show_list (maint_show_ada_cmdlist, from_tty, "");
332 /* The "maintenance ada set/show ignore-descriptive-type" value. */
334 static int ada_ignore_descriptive_types_p = 0;
336 /* Inferior-specific data. */
338 /* Per-inferior data for this module. */
340 struct ada_inferior_data
342 /* The ada__tags__type_specific_data type, which is used when decoding
343 tagged types. With older versions of GNAT, this type was directly
344 accessible through a component ("tsd") in the object tag. But this
345 is no longer the case, so we cache it for each inferior. */
346 struct type *tsd_type;
348 /* The exception_support_info data. This data is used to determine
349 how to implement support for Ada exception catchpoints in a given
351 const struct exception_support_info *exception_info;
354 /* Our key to this module's inferior data. */
355 static const struct inferior_data *ada_inferior_data;
357 /* A cleanup routine for our inferior data. */
359 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
361 struct ada_inferior_data *data;
363 data = inferior_data (inf, ada_inferior_data);
368 /* Return our inferior data for the given inferior (INF).
370 This function always returns a valid pointer to an allocated
371 ada_inferior_data structure. If INF's inferior data has not
372 been previously set, this functions creates a new one with all
373 fields set to zero, sets INF's inferior to it, and then returns
374 a pointer to that newly allocated ada_inferior_data. */
376 static struct ada_inferior_data *
377 get_ada_inferior_data (struct inferior *inf)
379 struct ada_inferior_data *data;
381 data = inferior_data (inf, ada_inferior_data);
384 data = XCNEW (struct ada_inferior_data);
385 set_inferior_data (inf, ada_inferior_data, data);
391 /* Perform all necessary cleanups regarding our module's inferior data
392 that is required after the inferior INF just exited. */
395 ada_inferior_exit (struct inferior *inf)
397 ada_inferior_data_cleanup (inf, NULL);
398 set_inferior_data (inf, ada_inferior_data, NULL);
403 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
404 all typedef layers have been peeled. Otherwise, return TYPE.
406 Normally, we really expect a typedef type to only have 1 typedef layer.
407 In other words, we really expect the target type of a typedef type to be
408 a non-typedef type. This is particularly true for Ada units, because
409 the language does not have a typedef vs not-typedef distinction.
410 In that respect, the Ada compiler has been trying to eliminate as many
411 typedef definitions in the debugging information, since they generally
412 do not bring any extra information (we still use typedef under certain
413 circumstances related mostly to the GNAT encoding).
415 Unfortunately, we have seen situations where the debugging information
416 generated by the compiler leads to such multiple typedef layers. For
417 instance, consider the following example with stabs:
419 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
420 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
422 This is an error in the debugging information which causes type
423 pck__float_array___XUP to be defined twice, and the second time,
424 it is defined as a typedef of a typedef.
426 This is on the fringe of legality as far as debugging information is
427 concerned, and certainly unexpected. But it is easy to handle these
428 situations correctly, so we can afford to be lenient in this case. */
431 ada_typedef_target_type (struct type *type)
433 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
434 type = TYPE_TARGET_TYPE (type);
438 /* Given DECODED_NAME a string holding a symbol name in its
439 decoded form (ie using the Ada dotted notation), returns
440 its unqualified name. */
443 ada_unqualified_name (const char *decoded_name)
445 const char *result = strrchr (decoded_name, '.');
448 result++; /* Skip the dot... */
450 result = decoded_name;
455 /* Return a string starting with '<', followed by STR, and '>'.
456 The result is good until the next call. */
459 add_angle_brackets (const char *str)
461 static char *result = NULL;
464 result = xstrprintf ("<%s>", str);
469 ada_get_gdb_completer_word_break_characters (void)
471 return ada_completer_word_break_characters;
474 /* Print an array element index using the Ada syntax. */
477 ada_print_array_index (struct value *index_value, struct ui_file *stream,
478 const struct value_print_options *options)
480 LA_VALUE_PRINT (index_value, stream, options);
481 fprintf_filtered (stream, " => ");
484 /* Assuming VECT points to an array of *SIZE objects of size
485 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
486 updating *SIZE as necessary and returning the (new) array. */
489 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
491 if (*size < min_size)
494 if (*size < min_size)
496 vect = xrealloc (vect, *size * element_size);
501 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
502 suffix of FIELD_NAME beginning "___". */
505 field_name_match (const char *field_name, const char *target)
507 int len = strlen (target);
510 (strncmp (field_name, target, len) == 0
511 && (field_name[len] == '\0'
512 || (strncmp (field_name + len, "___", 3) == 0
513 && strcmp (field_name + strlen (field_name) - 6,
518 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
519 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
520 and return its index. This function also handles fields whose name
521 have ___ suffixes because the compiler sometimes alters their name
522 by adding such a suffix to represent fields with certain constraints.
523 If the field could not be found, return a negative number if
524 MAYBE_MISSING is set. Otherwise raise an error. */
527 ada_get_field_index (const struct type *type, const char *field_name,
531 struct type *struct_type = check_typedef ((struct type *) type);
533 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
534 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
538 error (_("Unable to find field %s in struct %s. Aborting"),
539 field_name, TYPE_NAME (struct_type));
544 /* The length of the prefix of NAME prior to any "___" suffix. */
547 ada_name_prefix_len (const char *name)
553 const char *p = strstr (name, "___");
556 return strlen (name);
562 /* Return non-zero if SUFFIX is a suffix of STR.
563 Return zero if STR is null. */
566 is_suffix (const char *str, const char *suffix)
573 len2 = strlen (suffix);
574 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
577 /* The contents of value VAL, treated as a value of type TYPE. The
578 result is an lval in memory if VAL is. */
580 static struct value *
581 coerce_unspec_val_to_type (struct value *val, struct type *type)
583 type = ada_check_typedef (type);
584 if (value_type (val) == type)
588 struct value *result;
590 /* Make sure that the object size is not unreasonable before
591 trying to allocate some memory for it. */
595 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
596 result = allocate_value_lazy (type);
599 result = allocate_value (type);
600 memcpy (value_contents_raw (result), value_contents (val),
603 set_value_component_location (result, val);
604 set_value_bitsize (result, value_bitsize (val));
605 set_value_bitpos (result, value_bitpos (val));
606 set_value_address (result, value_address (val));
607 set_value_optimized_out (result, value_optimized_out_const (val));
612 static const gdb_byte *
613 cond_offset_host (const gdb_byte *valaddr, long offset)
618 return valaddr + offset;
622 cond_offset_target (CORE_ADDR address, long offset)
627 return address + offset;
630 /* Issue a warning (as for the definition of warning in utils.c, but
631 with exactly one argument rather than ...), unless the limit on the
632 number of warnings has passed during the evaluation of the current
635 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
636 provided by "complaint". */
637 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
640 lim_warning (const char *format, ...)
644 va_start (args, format);
645 warnings_issued += 1;
646 if (warnings_issued <= warning_limit)
647 vwarning (format, args);
652 /* Issue an error if the size of an object of type T is unreasonable,
653 i.e. if it would be a bad idea to allocate a value of this type in
657 check_size (const struct type *type)
659 if (TYPE_LENGTH (type) > varsize_limit)
660 error (_("object size is larger than varsize-limit"));
663 /* Maximum value of a SIZE-byte signed integer type. */
665 max_of_size (int size)
667 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
669 return top_bit | (top_bit - 1);
672 /* Minimum value of a SIZE-byte signed integer type. */
674 min_of_size (int size)
676 return -max_of_size (size) - 1;
679 /* Maximum value of a SIZE-byte unsigned integer type. */
681 umax_of_size (int size)
683 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
685 return top_bit | (top_bit - 1);
688 /* Maximum value of integral type T, as a signed quantity. */
690 max_of_type (struct type *t)
692 if (TYPE_UNSIGNED (t))
693 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
695 return max_of_size (TYPE_LENGTH (t));
698 /* Minimum value of integral type T, as a signed quantity. */
700 min_of_type (struct type *t)
702 if (TYPE_UNSIGNED (t))
705 return min_of_size (TYPE_LENGTH (t));
708 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
710 ada_discrete_type_high_bound (struct type *type)
712 switch (TYPE_CODE (type))
714 case TYPE_CODE_RANGE:
715 return TYPE_HIGH_BOUND (type);
717 return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1);
722 return max_of_type (type);
724 error (_("Unexpected type in ada_discrete_type_high_bound."));
728 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
730 ada_discrete_type_low_bound (struct type *type)
732 switch (TYPE_CODE (type))
734 case TYPE_CODE_RANGE:
735 return TYPE_LOW_BOUND (type);
737 return TYPE_FIELD_ENUMVAL (type, 0);
742 return min_of_type (type);
744 error (_("Unexpected type in ada_discrete_type_low_bound."));
748 /* The identity on non-range types. For range types, the underlying
749 non-range scalar type. */
752 get_base_type (struct type *type)
754 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
756 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
758 type = TYPE_TARGET_TYPE (type);
763 /* Return a decoded version of the given VALUE. This means returning
764 a value whose type is obtained by applying all the GNAT-specific
765 encondings, making the resulting type a static but standard description
766 of the initial type. */
769 ada_get_decoded_value (struct value *value)
771 struct type *type = ada_check_typedef (value_type (value));
773 if (ada_is_array_descriptor_type (type)
774 || (ada_is_constrained_packed_array_type (type)
775 && TYPE_CODE (type) != TYPE_CODE_PTR))
777 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */
778 value = ada_coerce_to_simple_array_ptr (value);
780 value = ada_coerce_to_simple_array (value);
783 value = ada_to_fixed_value (value);
788 /* Same as ada_get_decoded_value, but with the given TYPE.
789 Because there is no associated actual value for this type,
790 the resulting type might be a best-effort approximation in
791 the case of dynamic types. */
794 ada_get_decoded_type (struct type *type)
796 type = to_static_fixed_type (type);
797 if (ada_is_constrained_packed_array_type (type))
798 type = ada_coerce_to_simple_array_type (type);
804 /* Language Selection */
806 /* If the main program is in Ada, return language_ada, otherwise return LANG
807 (the main program is in Ada iif the adainit symbol is found). */
810 ada_update_initial_language (enum language lang)
812 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
813 (struct objfile *) NULL) != NULL)
819 /* If the main procedure is written in Ada, then return its name.
820 The result is good until the next call. Return NULL if the main
821 procedure doesn't appear to be in Ada. */
826 struct minimal_symbol *msym;
827 static char *main_program_name = NULL;
829 /* For Ada, the name of the main procedure is stored in a specific
830 string constant, generated by the binder. Look for that symbol,
831 extract its address, and then read that string. If we didn't find
832 that string, then most probably the main procedure is not written
834 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
838 CORE_ADDR main_program_name_addr;
841 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
842 if (main_program_name_addr == 0)
843 error (_("Invalid address for Ada main program name."));
845 xfree (main_program_name);
846 target_read_string (main_program_name_addr, &main_program_name,
851 return main_program_name;
854 /* The main procedure doesn't seem to be in Ada. */
860 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
863 const struct ada_opname_map ada_opname_table[] = {
864 {"Oadd", "\"+\"", BINOP_ADD},
865 {"Osubtract", "\"-\"", BINOP_SUB},
866 {"Omultiply", "\"*\"", BINOP_MUL},
867 {"Odivide", "\"/\"", BINOP_DIV},
868 {"Omod", "\"mod\"", BINOP_MOD},
869 {"Orem", "\"rem\"", BINOP_REM},
870 {"Oexpon", "\"**\"", BINOP_EXP},
871 {"Olt", "\"<\"", BINOP_LESS},
872 {"Ole", "\"<=\"", BINOP_LEQ},
873 {"Ogt", "\">\"", BINOP_GTR},
874 {"Oge", "\">=\"", BINOP_GEQ},
875 {"Oeq", "\"=\"", BINOP_EQUAL},
876 {"One", "\"/=\"", BINOP_NOTEQUAL},
877 {"Oand", "\"and\"", BINOP_BITWISE_AND},
878 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
879 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
880 {"Oconcat", "\"&\"", BINOP_CONCAT},
881 {"Oabs", "\"abs\"", UNOP_ABS},
882 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
883 {"Oadd", "\"+\"", UNOP_PLUS},
884 {"Osubtract", "\"-\"", UNOP_NEG},
888 /* The "encoded" form of DECODED, according to GNAT conventions.
889 The result is valid until the next call to ada_encode. */
892 ada_encode (const char *decoded)
894 static char *encoding_buffer = NULL;
895 static size_t encoding_buffer_size = 0;
902 GROW_VECT (encoding_buffer, encoding_buffer_size,
903 2 * strlen (decoded) + 10);
906 for (p = decoded; *p != '\0'; p += 1)
910 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
915 const struct ada_opname_map *mapping;
917 for (mapping = ada_opname_table;
918 mapping->encoded != NULL
919 && strncmp (mapping->decoded, p,
920 strlen (mapping->decoded)) != 0; mapping += 1)
922 if (mapping->encoded == NULL)
923 error (_("invalid Ada operator name: %s"), p);
924 strcpy (encoding_buffer + k, mapping->encoded);
925 k += strlen (mapping->encoded);
930 encoding_buffer[k] = *p;
935 encoding_buffer[k] = '\0';
936 return encoding_buffer;
939 /* Return NAME folded to lower case, or, if surrounded by single
940 quotes, unfolded, but with the quotes stripped away. Result good
944 ada_fold_name (const char *name)
946 static char *fold_buffer = NULL;
947 static size_t fold_buffer_size = 0;
949 int len = strlen (name);
950 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
954 strncpy (fold_buffer, name + 1, len - 2);
955 fold_buffer[len - 2] = '\000';
961 for (i = 0; i <= len; i += 1)
962 fold_buffer[i] = tolower (name[i]);
968 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
971 is_lower_alphanum (const char c)
973 return (isdigit (c) || (isalpha (c) && islower (c)));
976 /* ENCODED is the linkage name of a symbol and LEN contains its length.
977 This function saves in LEN the length of that same symbol name but
978 without either of these suffixes:
984 These are suffixes introduced by the compiler for entities such as
985 nested subprogram for instance, in order to avoid name clashes.
986 They do not serve any purpose for the debugger. */
989 ada_remove_trailing_digits (const char *encoded, int *len)
991 if (*len > 1 && isdigit (encoded[*len - 1]))
995 while (i > 0 && isdigit (encoded[i]))
997 if (i >= 0 && encoded[i] == '.')
999 else if (i >= 0 && encoded[i] == '$')
1001 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
1003 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
1008 /* Remove the suffix introduced by the compiler for protected object
1012 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
1014 /* Remove trailing N. */
1016 /* Protected entry subprograms are broken into two
1017 separate subprograms: The first one is unprotected, and has
1018 a 'N' suffix; the second is the protected version, and has
1019 the 'P' suffix. The second calls the first one after handling
1020 the protection. Since the P subprograms are internally generated,
1021 we leave these names undecoded, giving the user a clue that this
1022 entity is internal. */
1025 && encoded[*len - 1] == 'N'
1026 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
1030 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1033 ada_remove_Xbn_suffix (const char *encoded, int *len)
1037 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
1040 if (encoded[i] != 'X')
1046 if (isalnum (encoded[i-1]))
1050 /* If ENCODED follows the GNAT entity encoding conventions, then return
1051 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1052 replaced by ENCODED.
1054 The resulting string is valid until the next call of ada_decode.
1055 If the string is unchanged by decoding, the original string pointer
1059 ada_decode (const char *encoded)
1066 static char *decoding_buffer = NULL;
1067 static size_t decoding_buffer_size = 0;
1069 /* The name of the Ada main procedure starts with "_ada_".
1070 This prefix is not part of the decoded name, so skip this part
1071 if we see this prefix. */
1072 if (strncmp (encoded, "_ada_", 5) == 0)
1075 /* If the name starts with '_', then it is not a properly encoded
1076 name, so do not attempt to decode it. Similarly, if the name
1077 starts with '<', the name should not be decoded. */
1078 if (encoded[0] == '_' || encoded[0] == '<')
1081 len0 = strlen (encoded);
1083 ada_remove_trailing_digits (encoded, &len0);
1084 ada_remove_po_subprogram_suffix (encoded, &len0);
1086 /* Remove the ___X.* suffix if present. Do not forget to verify that
1087 the suffix is located before the current "end" of ENCODED. We want
1088 to avoid re-matching parts of ENCODED that have previously been
1089 marked as discarded (by decrementing LEN0). */
1090 p = strstr (encoded, "___");
1091 if (p != NULL && p - encoded < len0 - 3)
1099 /* Remove any trailing TKB suffix. It tells us that this symbol
1100 is for the body of a task, but that information does not actually
1101 appear in the decoded name. */
1103 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
1106 /* Remove any trailing TB suffix. The TB suffix is slightly different
1107 from the TKB suffix because it is used for non-anonymous task
1110 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
1113 /* Remove trailing "B" suffixes. */
1114 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1116 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
1119 /* Make decoded big enough for possible expansion by operator name. */
1121 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1122 decoded = decoding_buffer;
1124 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1126 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1129 while ((i >= 0 && isdigit (encoded[i]))
1130 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1132 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1134 else if (encoded[i] == '$')
1138 /* The first few characters that are not alphabetic are not part
1139 of any encoding we use, so we can copy them over verbatim. */
1141 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1142 decoded[j] = encoded[i];
1147 /* Is this a symbol function? */
1148 if (at_start_name && encoded[i] == 'O')
1152 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1154 int op_len = strlen (ada_opname_table[k].encoded);
1155 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1157 && !isalnum (encoded[i + op_len]))
1159 strcpy (decoded + j, ada_opname_table[k].decoded);
1162 j += strlen (ada_opname_table[k].decoded);
1166 if (ada_opname_table[k].encoded != NULL)
1171 /* Replace "TK__" with "__", which will eventually be translated
1172 into "." (just below). */
1174 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1177 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1178 be translated into "." (just below). These are internal names
1179 generated for anonymous blocks inside which our symbol is nested. */
1181 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1182 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1183 && isdigit (encoded [i+4]))
1187 while (k < len0 && isdigit (encoded[k]))
1188 k++; /* Skip any extra digit. */
1190 /* Double-check that the "__B_{DIGITS}+" sequence we found
1191 is indeed followed by "__". */
1192 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1196 /* Remove _E{DIGITS}+[sb] */
1198 /* Just as for protected object subprograms, there are 2 categories
1199 of subprograms created by the compiler for each entry. The first
1200 one implements the actual entry code, and has a suffix following
1201 the convention above; the second one implements the barrier and
1202 uses the same convention as above, except that the 'E' is replaced
1205 Just as above, we do not decode the name of barrier functions
1206 to give the user a clue that the code he is debugging has been
1207 internally generated. */
1209 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1210 && isdigit (encoded[i+2]))
1214 while (k < len0 && isdigit (encoded[k]))
1218 && (encoded[k] == 'b' || encoded[k] == 's'))
1221 /* Just as an extra precaution, make sure that if this
1222 suffix is followed by anything else, it is a '_'.
1223 Otherwise, we matched this sequence by accident. */
1225 || (k < len0 && encoded[k] == '_'))
1230 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1231 the GNAT front-end in protected object subprograms. */
1234 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1236 /* Backtrack a bit up until we reach either the begining of
1237 the encoded name, or "__". Make sure that we only find
1238 digits or lowercase characters. */
1239 const char *ptr = encoded + i - 1;
1241 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1244 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1248 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1250 /* This is a X[bn]* sequence not separated from the previous
1251 part of the name with a non-alpha-numeric character (in other
1252 words, immediately following an alpha-numeric character), then
1253 verify that it is placed at the end of the encoded name. If
1254 not, then the encoding is not valid and we should abort the
1255 decoding. Otherwise, just skip it, it is used in body-nested
1259 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1263 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1265 /* Replace '__' by '.'. */
1273 /* It's a character part of the decoded name, so just copy it
1275 decoded[j] = encoded[i];
1280 decoded[j] = '\000';
1282 /* Decoded names should never contain any uppercase character.
1283 Double-check this, and abort the decoding if we find one. */
1285 for (i = 0; decoded[i] != '\0'; i += 1)
1286 if (isupper (decoded[i]) || decoded[i] == ' ')
1289 if (strcmp (decoded, encoded) == 0)
1295 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1296 decoded = decoding_buffer;
1297 if (encoded[0] == '<')
1298 strcpy (decoded, encoded);
1300 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1305 /* Table for keeping permanent unique copies of decoded names. Once
1306 allocated, names in this table are never released. While this is a
1307 storage leak, it should not be significant unless there are massive
1308 changes in the set of decoded names in successive versions of a
1309 symbol table loaded during a single session. */
1310 static struct htab *decoded_names_store;
1312 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1313 in the language-specific part of GSYMBOL, if it has not been
1314 previously computed. Tries to save the decoded name in the same
1315 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1316 in any case, the decoded symbol has a lifetime at least that of
1318 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1319 const, but nevertheless modified to a semantically equivalent form
1320 when a decoded name is cached in it. */
1323 ada_decode_symbol (const struct general_symbol_info *arg)
1325 struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg;
1326 const char **resultp =
1327 &gsymbol->language_specific.mangled_lang.demangled_name;
1329 if (!gsymbol->ada_mangled)
1331 const char *decoded = ada_decode (gsymbol->name);
1332 struct obstack *obstack = gsymbol->language_specific.obstack;
1334 gsymbol->ada_mangled = 1;
1336 if (obstack != NULL)
1337 *resultp = obstack_copy0 (obstack, decoded, strlen (decoded));
1340 /* Sometimes, we can't find a corresponding objfile, in
1341 which case, we put the result on the heap. Since we only
1342 decode when needed, we hope this usually does not cause a
1343 significant memory leak (FIXME). */
1345 char **slot = (char **) htab_find_slot (decoded_names_store,
1349 *slot = xstrdup (decoded);
1358 ada_la_decode (const char *encoded, int options)
1360 return xstrdup (ada_decode (encoded));
1363 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1364 suffixes that encode debugging information or leading _ada_ on
1365 SYM_NAME (see is_name_suffix commentary for the debugging
1366 information that is ignored). If WILD, then NAME need only match a
1367 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1368 either argument is NULL. */
1371 match_name (const char *sym_name, const char *name, int wild)
1373 if (sym_name == NULL || name == NULL)
1376 return wild_match (sym_name, name) == 0;
1379 int len_name = strlen (name);
1381 return (strncmp (sym_name, name, len_name) == 0
1382 && is_name_suffix (sym_name + len_name))
1383 || (strncmp (sym_name, "_ada_", 5) == 0
1384 && strncmp (sym_name + 5, name, len_name) == 0
1385 && is_name_suffix (sym_name + len_name + 5));
1392 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1393 generated by the GNAT compiler to describe the index type used
1394 for each dimension of an array, check whether it follows the latest
1395 known encoding. If not, fix it up to conform to the latest encoding.
1396 Otherwise, do nothing. This function also does nothing if
1397 INDEX_DESC_TYPE is NULL.
1399 The GNAT encoding used to describle the array index type evolved a bit.
1400 Initially, the information would be provided through the name of each
1401 field of the structure type only, while the type of these fields was
1402 described as unspecified and irrelevant. The debugger was then expected
1403 to perform a global type lookup using the name of that field in order
1404 to get access to the full index type description. Because these global
1405 lookups can be very expensive, the encoding was later enhanced to make
1406 the global lookup unnecessary by defining the field type as being
1407 the full index type description.
1409 The purpose of this routine is to allow us to support older versions
1410 of the compiler by detecting the use of the older encoding, and by
1411 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1412 we essentially replace each field's meaningless type by the associated
1416 ada_fixup_array_indexes_type (struct type *index_desc_type)
1420 if (index_desc_type == NULL)
1422 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1424 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1425 to check one field only, no need to check them all). If not, return
1428 If our INDEX_DESC_TYPE was generated using the older encoding,
1429 the field type should be a meaningless integer type whose name
1430 is not equal to the field name. */
1431 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1432 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1433 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1436 /* Fixup each field of INDEX_DESC_TYPE. */
1437 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1439 const char *name = TYPE_FIELD_NAME (index_desc_type, i);
1440 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1443 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1447 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1449 static char *bound_name[] = {
1450 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1451 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1454 /* Maximum number of array dimensions we are prepared to handle. */
1456 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1459 /* The desc_* routines return primitive portions of array descriptors
1462 /* The descriptor or array type, if any, indicated by TYPE; removes
1463 level of indirection, if needed. */
1465 static struct type *
1466 desc_base_type (struct type *type)
1470 type = ada_check_typedef (type);
1471 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1472 type = ada_typedef_target_type (type);
1475 && (TYPE_CODE (type) == TYPE_CODE_PTR
1476 || TYPE_CODE (type) == TYPE_CODE_REF))
1477 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1482 /* True iff TYPE indicates a "thin" array pointer type. */
1485 is_thin_pntr (struct type *type)
1488 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1489 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1492 /* The descriptor type for thin pointer type TYPE. */
1494 static struct type *
1495 thin_descriptor_type (struct type *type)
1497 struct type *base_type = desc_base_type (type);
1499 if (base_type == NULL)
1501 if (is_suffix (ada_type_name (base_type), "___XVE"))
1505 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1507 if (alt_type == NULL)
1514 /* A pointer to the array data for thin-pointer value VAL. */
1516 static struct value *
1517 thin_data_pntr (struct value *val)
1519 struct type *type = ada_check_typedef (value_type (val));
1520 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1522 data_type = lookup_pointer_type (data_type);
1524 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1525 return value_cast (data_type, value_copy (val));
1527 return value_from_longest (data_type, value_address (val));
1530 /* True iff TYPE indicates a "thick" array pointer type. */
1533 is_thick_pntr (struct type *type)
1535 type = desc_base_type (type);
1536 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1537 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1540 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1541 pointer to one, the type of its bounds data; otherwise, NULL. */
1543 static struct type *
1544 desc_bounds_type (struct type *type)
1548 type = desc_base_type (type);
1552 else if (is_thin_pntr (type))
1554 type = thin_descriptor_type (type);
1557 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1559 return ada_check_typedef (r);
1561 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1563 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1565 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1570 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1571 one, a pointer to its bounds data. Otherwise NULL. */
1573 static struct value *
1574 desc_bounds (struct value *arr)
1576 struct type *type = ada_check_typedef (value_type (arr));
1578 if (is_thin_pntr (type))
1580 struct type *bounds_type =
1581 desc_bounds_type (thin_descriptor_type (type));
1584 if (bounds_type == NULL)
1585 error (_("Bad GNAT array descriptor"));
1587 /* NOTE: The following calculation is not really kosher, but
1588 since desc_type is an XVE-encoded type (and shouldn't be),
1589 the correct calculation is a real pain. FIXME (and fix GCC). */
1590 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1591 addr = value_as_long (arr);
1593 addr = value_address (arr);
1596 value_from_longest (lookup_pointer_type (bounds_type),
1597 addr - TYPE_LENGTH (bounds_type));
1600 else if (is_thick_pntr (type))
1602 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1603 _("Bad GNAT array descriptor"));
1604 struct type *p_bounds_type = value_type (p_bounds);
1607 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1609 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1611 if (TYPE_STUB (target_type))
1612 p_bounds = value_cast (lookup_pointer_type
1613 (ada_check_typedef (target_type)),
1617 error (_("Bad GNAT array descriptor"));
1625 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1626 position of the field containing the address of the bounds data. */
1629 fat_pntr_bounds_bitpos (struct type *type)
1631 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1634 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1635 size of the field containing the address of the bounds data. */
1638 fat_pntr_bounds_bitsize (struct type *type)
1640 type = desc_base_type (type);
1642 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1643 return TYPE_FIELD_BITSIZE (type, 1);
1645 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1648 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1649 pointer to one, the type of its array data (a array-with-no-bounds type);
1650 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1653 static struct type *
1654 desc_data_target_type (struct type *type)
1656 type = desc_base_type (type);
1658 /* NOTE: The following is bogus; see comment in desc_bounds. */
1659 if (is_thin_pntr (type))
1660 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1661 else if (is_thick_pntr (type))
1663 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1666 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1667 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1673 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1676 static struct value *
1677 desc_data (struct value *arr)
1679 struct type *type = value_type (arr);
1681 if (is_thin_pntr (type))
1682 return thin_data_pntr (arr);
1683 else if (is_thick_pntr (type))
1684 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1685 _("Bad GNAT array descriptor"));
1691 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1692 position of the field containing the address of the data. */
1695 fat_pntr_data_bitpos (struct type *type)
1697 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1700 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1701 size of the field containing the address of the data. */
1704 fat_pntr_data_bitsize (struct type *type)
1706 type = desc_base_type (type);
1708 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1709 return TYPE_FIELD_BITSIZE (type, 0);
1711 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1714 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1715 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1716 bound, if WHICH is 1. The first bound is I=1. */
1718 static struct value *
1719 desc_one_bound (struct value *bounds, int i, int which)
1721 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1722 _("Bad GNAT array descriptor bounds"));
1725 /* If BOUNDS is an array-bounds structure type, return the bit position
1726 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1727 bound, if WHICH is 1. The first bound is I=1. */
1730 desc_bound_bitpos (struct type *type, int i, int which)
1732 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1735 /* If BOUNDS is an array-bounds structure type, return the bit field size
1736 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1737 bound, if WHICH is 1. The first bound is I=1. */
1740 desc_bound_bitsize (struct type *type, int i, int which)
1742 type = desc_base_type (type);
1744 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1745 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1747 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1750 /* If TYPE is the type of an array-bounds structure, the type of its
1751 Ith bound (numbering from 1). Otherwise, NULL. */
1753 static struct type *
1754 desc_index_type (struct type *type, int i)
1756 type = desc_base_type (type);
1758 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1759 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1764 /* The number of index positions in the array-bounds type TYPE.
1765 Return 0 if TYPE is NULL. */
1768 desc_arity (struct type *type)
1770 type = desc_base_type (type);
1773 return TYPE_NFIELDS (type) / 2;
1777 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1778 an array descriptor type (representing an unconstrained array
1782 ada_is_direct_array_type (struct type *type)
1786 type = ada_check_typedef (type);
1787 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1788 || ada_is_array_descriptor_type (type));
1791 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1795 ada_is_array_type (struct type *type)
1798 && (TYPE_CODE (type) == TYPE_CODE_PTR
1799 || TYPE_CODE (type) == TYPE_CODE_REF))
1800 type = TYPE_TARGET_TYPE (type);
1801 return ada_is_direct_array_type (type);
1804 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1807 ada_is_simple_array_type (struct type *type)
1811 type = ada_check_typedef (type);
1812 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1813 || (TYPE_CODE (type) == TYPE_CODE_PTR
1814 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1815 == TYPE_CODE_ARRAY));
1818 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1821 ada_is_array_descriptor_type (struct type *type)
1823 struct type *data_type = desc_data_target_type (type);
1827 type = ada_check_typedef (type);
1828 return (data_type != NULL
1829 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1830 && desc_arity (desc_bounds_type (type)) > 0);
1833 /* Non-zero iff type is a partially mal-formed GNAT array
1834 descriptor. FIXME: This is to compensate for some problems with
1835 debugging output from GNAT. Re-examine periodically to see if it
1839 ada_is_bogus_array_descriptor (struct type *type)
1843 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1844 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1845 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1846 && !ada_is_array_descriptor_type (type);
1850 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1851 (fat pointer) returns the type of the array data described---specifically,
1852 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1853 in from the descriptor; otherwise, they are left unspecified. If
1854 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1855 returns NULL. The result is simply the type of ARR if ARR is not
1858 ada_type_of_array (struct value *arr, int bounds)
1860 if (ada_is_constrained_packed_array_type (value_type (arr)))
1861 return decode_constrained_packed_array_type (value_type (arr));
1863 if (!ada_is_array_descriptor_type (value_type (arr)))
1864 return value_type (arr);
1868 struct type *array_type =
1869 ada_check_typedef (desc_data_target_type (value_type (arr)));
1871 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1872 TYPE_FIELD_BITSIZE (array_type, 0) =
1873 decode_packed_array_bitsize (value_type (arr));
1879 struct type *elt_type;
1881 struct value *descriptor;
1883 elt_type = ada_array_element_type (value_type (arr), -1);
1884 arity = ada_array_arity (value_type (arr));
1886 if (elt_type == NULL || arity == 0)
1887 return ada_check_typedef (value_type (arr));
1889 descriptor = desc_bounds (arr);
1890 if (value_as_long (descriptor) == 0)
1894 struct type *range_type = alloc_type_copy (value_type (arr));
1895 struct type *array_type = alloc_type_copy (value_type (arr));
1896 struct value *low = desc_one_bound (descriptor, arity, 0);
1897 struct value *high = desc_one_bound (descriptor, arity, 1);
1900 create_range_type (range_type, value_type (low),
1901 longest_to_int (value_as_long (low)),
1902 longest_to_int (value_as_long (high)));
1903 elt_type = create_array_type (array_type, elt_type, range_type);
1905 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1907 /* We need to store the element packed bitsize, as well as
1908 recompute the array size, because it was previously
1909 computed based on the unpacked element size. */
1910 LONGEST lo = value_as_long (low);
1911 LONGEST hi = value_as_long (high);
1913 TYPE_FIELD_BITSIZE (elt_type, 0) =
1914 decode_packed_array_bitsize (value_type (arr));
1915 /* If the array has no element, then the size is already
1916 zero, and does not need to be recomputed. */
1920 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
1922 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
1927 return lookup_pointer_type (elt_type);
1931 /* If ARR does not represent an array, returns ARR unchanged.
1932 Otherwise, returns either a standard GDB array with bounds set
1933 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1934 GDB array. Returns NULL if ARR is a null fat pointer. */
1937 ada_coerce_to_simple_array_ptr (struct value *arr)
1939 if (ada_is_array_descriptor_type (value_type (arr)))
1941 struct type *arrType = ada_type_of_array (arr, 1);
1943 if (arrType == NULL)
1945 return value_cast (arrType, value_copy (desc_data (arr)));
1947 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1948 return decode_constrained_packed_array (arr);
1953 /* If ARR does not represent an array, returns ARR unchanged.
1954 Otherwise, returns a standard GDB array describing ARR (which may
1955 be ARR itself if it already is in the proper form). */
1958 ada_coerce_to_simple_array (struct value *arr)
1960 if (ada_is_array_descriptor_type (value_type (arr)))
1962 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1965 error (_("Bounds unavailable for null array pointer."));
1966 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1967 return value_ind (arrVal);
1969 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1970 return decode_constrained_packed_array (arr);
1975 /* If TYPE represents a GNAT array type, return it translated to an
1976 ordinary GDB array type (possibly with BITSIZE fields indicating
1977 packing). For other types, is the identity. */
1980 ada_coerce_to_simple_array_type (struct type *type)
1982 if (ada_is_constrained_packed_array_type (type))
1983 return decode_constrained_packed_array_type (type);
1985 if (ada_is_array_descriptor_type (type))
1986 return ada_check_typedef (desc_data_target_type (type));
1991 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1994 ada_is_packed_array_type (struct type *type)
1998 type = desc_base_type (type);
1999 type = ada_check_typedef (type);
2001 ada_type_name (type) != NULL
2002 && strstr (ada_type_name (type), "___XP") != NULL;
2005 /* Non-zero iff TYPE represents a standard GNAT constrained
2006 packed-array type. */
2009 ada_is_constrained_packed_array_type (struct type *type)
2011 return ada_is_packed_array_type (type)
2012 && !ada_is_array_descriptor_type (type);
2015 /* Non-zero iff TYPE represents an array descriptor for a
2016 unconstrained packed-array type. */
2019 ada_is_unconstrained_packed_array_type (struct type *type)
2021 return ada_is_packed_array_type (type)
2022 && ada_is_array_descriptor_type (type);
2025 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2026 return the size of its elements in bits. */
2029 decode_packed_array_bitsize (struct type *type)
2031 const char *raw_name;
2035 /* Access to arrays implemented as fat pointers are encoded as a typedef
2036 of the fat pointer type. We need the name of the fat pointer type
2037 to do the decoding, so strip the typedef layer. */
2038 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
2039 type = ada_typedef_target_type (type);
2041 raw_name = ada_type_name (ada_check_typedef (type));
2043 raw_name = ada_type_name (desc_base_type (type));
2048 tail = strstr (raw_name, "___XP");
2049 gdb_assert (tail != NULL);
2051 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
2054 (_("could not understand bit size information on packed array"));
2061 /* Given that TYPE is a standard GDB array type with all bounds filled
2062 in, and that the element size of its ultimate scalar constituents
2063 (that is, either its elements, or, if it is an array of arrays, its
2064 elements' elements, etc.) is *ELT_BITS, return an identical type,
2065 but with the bit sizes of its elements (and those of any
2066 constituent arrays) recorded in the BITSIZE components of its
2067 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2070 static struct type *
2071 constrained_packed_array_type (struct type *type, long *elt_bits)
2073 struct type *new_elt_type;
2074 struct type *new_type;
2075 struct type *index_type_desc;
2076 struct type *index_type;
2077 LONGEST low_bound, high_bound;
2079 type = ada_check_typedef (type);
2080 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2083 index_type_desc = ada_find_parallel_type (type, "___XA");
2084 if (index_type_desc)
2085 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0),
2088 index_type = TYPE_INDEX_TYPE (type);
2090 new_type = alloc_type_copy (type);
2092 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2094 create_array_type (new_type, new_elt_type, index_type);
2095 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2096 TYPE_NAME (new_type) = ada_type_name (type);
2098 if (get_discrete_bounds (index_type, &low_bound, &high_bound) < 0)
2099 low_bound = high_bound = 0;
2100 if (high_bound < low_bound)
2101 *elt_bits = TYPE_LENGTH (new_type) = 0;
2104 *elt_bits *= (high_bound - low_bound + 1);
2105 TYPE_LENGTH (new_type) =
2106 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2109 TYPE_FIXED_INSTANCE (new_type) = 1;
2113 /* The array type encoded by TYPE, where
2114 ada_is_constrained_packed_array_type (TYPE). */
2116 static struct type *
2117 decode_constrained_packed_array_type (struct type *type)
2119 const char *raw_name = ada_type_name (ada_check_typedef (type));
2122 struct type *shadow_type;
2126 raw_name = ada_type_name (desc_base_type (type));
2131 name = (char *) alloca (strlen (raw_name) + 1);
2132 tail = strstr (raw_name, "___XP");
2133 type = desc_base_type (type);
2135 memcpy (name, raw_name, tail - raw_name);
2136 name[tail - raw_name] = '\000';
2138 shadow_type = ada_find_parallel_type_with_name (type, name);
2140 if (shadow_type == NULL)
2142 lim_warning (_("could not find bounds information on packed array"));
2145 CHECK_TYPEDEF (shadow_type);
2147 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2149 lim_warning (_("could not understand bounds "
2150 "information on packed array"));
2154 bits = decode_packed_array_bitsize (type);
2155 return constrained_packed_array_type (shadow_type, &bits);
2158 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2159 array, returns a simple array that denotes that array. Its type is a
2160 standard GDB array type except that the BITSIZEs of the array
2161 target types are set to the number of bits in each element, and the
2162 type length is set appropriately. */
2164 static struct value *
2165 decode_constrained_packed_array (struct value *arr)
2169 arr = ada_coerce_ref (arr);
2171 /* If our value is a pointer, then dererence it. Make sure that
2172 this operation does not cause the target type to be fixed, as
2173 this would indirectly cause this array to be decoded. The rest
2174 of the routine assumes that the array hasn't been decoded yet,
2175 so we use the basic "value_ind" routine to perform the dereferencing,
2176 as opposed to using "ada_value_ind". */
2177 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2178 arr = value_ind (arr);
2180 type = decode_constrained_packed_array_type (value_type (arr));
2183 error (_("can't unpack array"));
2187 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2188 && ada_is_modular_type (value_type (arr)))
2190 /* This is a (right-justified) modular type representing a packed
2191 array with no wrapper. In order to interpret the value through
2192 the (left-justified) packed array type we just built, we must
2193 first left-justify it. */
2194 int bit_size, bit_pos;
2197 mod = ada_modulus (value_type (arr)) - 1;
2204 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2205 arr = ada_value_primitive_packed_val (arr, NULL,
2206 bit_pos / HOST_CHAR_BIT,
2207 bit_pos % HOST_CHAR_BIT,
2212 return coerce_unspec_val_to_type (arr, type);
2216 /* The value of the element of packed array ARR at the ARITY indices
2217 given in IND. ARR must be a simple array. */
2219 static struct value *
2220 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2223 int bits, elt_off, bit_off;
2224 long elt_total_bit_offset;
2225 struct type *elt_type;
2229 elt_total_bit_offset = 0;
2230 elt_type = ada_check_typedef (value_type (arr));
2231 for (i = 0; i < arity; i += 1)
2233 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2234 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2236 (_("attempt to do packed indexing of "
2237 "something other than a packed array"));
2240 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2241 LONGEST lowerbound, upperbound;
2244 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2246 lim_warning (_("don't know bounds of array"));
2247 lowerbound = upperbound = 0;
2250 idx = pos_atr (ind[i]);
2251 if (idx < lowerbound || idx > upperbound)
2252 lim_warning (_("packed array index %ld out of bounds"),
2254 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2255 elt_total_bit_offset += (idx - lowerbound) * bits;
2256 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2259 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2260 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2262 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2267 /* Non-zero iff TYPE includes negative integer values. */
2270 has_negatives (struct type *type)
2272 switch (TYPE_CODE (type))
2277 return !TYPE_UNSIGNED (type);
2278 case TYPE_CODE_RANGE:
2279 return TYPE_LOW_BOUND (type) < 0;
2284 /* Create a new value of type TYPE from the contents of OBJ starting
2285 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2286 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2287 assigning through the result will set the field fetched from.
2288 VALADDR is ignored unless OBJ is NULL, in which case,
2289 VALADDR+OFFSET must address the start of storage containing the
2290 packed value. The value returned in this case is never an lval.
2291 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2294 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2295 long offset, int bit_offset, int bit_size,
2299 int src, /* Index into the source area */
2300 targ, /* Index into the target area */
2301 srcBitsLeft, /* Number of source bits left to move */
2302 nsrc, ntarg, /* Number of source and target bytes */
2303 unusedLS, /* Number of bits in next significant
2304 byte of source that are unused */
2305 accumSize; /* Number of meaningful bits in accum */
2306 unsigned char *bytes; /* First byte containing data to unpack */
2307 unsigned char *unpacked;
2308 unsigned long accum; /* Staging area for bits being transferred */
2310 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2311 /* Transmit bytes from least to most significant; delta is the direction
2312 the indices move. */
2313 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
2315 type = ada_check_typedef (type);
2319 v = allocate_value (type);
2320 bytes = (unsigned char *) (valaddr + offset);
2322 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2324 v = value_at (type, value_address (obj));
2325 bytes = (unsigned char *) alloca (len);
2326 read_memory (value_address (v) + offset, bytes, len);
2330 v = allocate_value (type);
2331 bytes = (unsigned char *) value_contents (obj) + offset;
2336 long new_offset = offset;
2338 set_value_component_location (v, obj);
2339 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2340 set_value_bitsize (v, bit_size);
2341 if (value_bitpos (v) >= HOST_CHAR_BIT)
2344 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2346 set_value_offset (v, new_offset);
2348 /* Also set the parent value. This is needed when trying to
2349 assign a new value (in inferior memory). */
2350 set_value_parent (v, obj);
2353 set_value_bitsize (v, bit_size);
2354 unpacked = (unsigned char *) value_contents (v);
2356 srcBitsLeft = bit_size;
2358 ntarg = TYPE_LENGTH (type);
2362 memset (unpacked, 0, TYPE_LENGTH (type));
2365 else if (gdbarch_bits_big_endian (get_type_arch (type)))
2368 if (has_negatives (type)
2369 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2373 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2376 switch (TYPE_CODE (type))
2378 case TYPE_CODE_ARRAY:
2379 case TYPE_CODE_UNION:
2380 case TYPE_CODE_STRUCT:
2381 /* Non-scalar values must be aligned at a byte boundary... */
2383 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2384 /* ... And are placed at the beginning (most-significant) bytes
2386 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2391 targ = TYPE_LENGTH (type) - 1;
2397 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2400 unusedLS = bit_offset;
2403 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2410 /* Mask for removing bits of the next source byte that are not
2411 part of the value. */
2412 unsigned int unusedMSMask =
2413 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2415 /* Sign-extend bits for this byte. */
2416 unsigned int signMask = sign & ~unusedMSMask;
2419 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2420 accumSize += HOST_CHAR_BIT - unusedLS;
2421 if (accumSize >= HOST_CHAR_BIT)
2423 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2424 accumSize -= HOST_CHAR_BIT;
2425 accum >>= HOST_CHAR_BIT;
2429 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2436 accum |= sign << accumSize;
2437 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2438 accumSize -= HOST_CHAR_BIT;
2439 accum >>= HOST_CHAR_BIT;
2447 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2448 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2451 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2452 int src_offset, int n, int bits_big_endian_p)
2454 unsigned int accum, mask;
2455 int accum_bits, chunk_size;
2457 target += targ_offset / HOST_CHAR_BIT;
2458 targ_offset %= HOST_CHAR_BIT;
2459 source += src_offset / HOST_CHAR_BIT;
2460 src_offset %= HOST_CHAR_BIT;
2461 if (bits_big_endian_p)
2463 accum = (unsigned char) *source;
2465 accum_bits = HOST_CHAR_BIT - src_offset;
2471 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2472 accum_bits += HOST_CHAR_BIT;
2474 chunk_size = HOST_CHAR_BIT - targ_offset;
2477 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2478 mask = ((1 << chunk_size) - 1) << unused_right;
2481 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2483 accum_bits -= chunk_size;
2490 accum = (unsigned char) *source >> src_offset;
2492 accum_bits = HOST_CHAR_BIT - src_offset;
2496 accum = accum + ((unsigned char) *source << accum_bits);
2497 accum_bits += HOST_CHAR_BIT;
2499 chunk_size = HOST_CHAR_BIT - targ_offset;
2502 mask = ((1 << chunk_size) - 1) << targ_offset;
2503 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2505 accum_bits -= chunk_size;
2506 accum >>= chunk_size;
2513 /* Store the contents of FROMVAL into the location of TOVAL.
2514 Return a new value with the location of TOVAL and contents of
2515 FROMVAL. Handles assignment into packed fields that have
2516 floating-point or non-scalar types. */
2518 static struct value *
2519 ada_value_assign (struct value *toval, struct value *fromval)
2521 struct type *type = value_type (toval);
2522 int bits = value_bitsize (toval);
2524 toval = ada_coerce_ref (toval);
2525 fromval = ada_coerce_ref (fromval);
2527 if (ada_is_direct_array_type (value_type (toval)))
2528 toval = ada_coerce_to_simple_array (toval);
2529 if (ada_is_direct_array_type (value_type (fromval)))
2530 fromval = ada_coerce_to_simple_array (fromval);
2532 if (!deprecated_value_modifiable (toval))
2533 error (_("Left operand of assignment is not a modifiable lvalue."));
2535 if (VALUE_LVAL (toval) == lval_memory
2537 && (TYPE_CODE (type) == TYPE_CODE_FLT
2538 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2540 int len = (value_bitpos (toval)
2541 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2543 gdb_byte *buffer = alloca (len);
2545 CORE_ADDR to_addr = value_address (toval);
2547 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2548 fromval = value_cast (type, fromval);
2550 read_memory (to_addr, buffer, len);
2551 from_size = value_bitsize (fromval);
2553 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2554 if (gdbarch_bits_big_endian (get_type_arch (type)))
2555 move_bits (buffer, value_bitpos (toval),
2556 value_contents (fromval), from_size - bits, bits, 1);
2558 move_bits (buffer, value_bitpos (toval),
2559 value_contents (fromval), 0, bits, 0);
2560 write_memory_with_notification (to_addr, buffer, len);
2562 val = value_copy (toval);
2563 memcpy (value_contents_raw (val), value_contents (fromval),
2564 TYPE_LENGTH (type));
2565 deprecated_set_value_type (val, type);
2570 return value_assign (toval, fromval);
2574 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2575 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2576 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2577 * COMPONENT, and not the inferior's memory. The current contents
2578 * of COMPONENT are ignored. */
2580 value_assign_to_component (struct value *container, struct value *component,
2583 LONGEST offset_in_container =
2584 (LONGEST) (value_address (component) - value_address (container));
2585 int bit_offset_in_container =
2586 value_bitpos (component) - value_bitpos (container);
2589 val = value_cast (value_type (component), val);
2591 if (value_bitsize (component) == 0)
2592 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2594 bits = value_bitsize (component);
2596 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2597 move_bits (value_contents_writeable (container) + offset_in_container,
2598 value_bitpos (container) + bit_offset_in_container,
2599 value_contents (val),
2600 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2603 move_bits (value_contents_writeable (container) + offset_in_container,
2604 value_bitpos (container) + bit_offset_in_container,
2605 value_contents (val), 0, bits, 0);
2608 /* The value of the element of array ARR at the ARITY indices given in IND.
2609 ARR may be either a simple array, GNAT array descriptor, or pointer
2613 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2617 struct type *elt_type;
2619 elt = ada_coerce_to_simple_array (arr);
2621 elt_type = ada_check_typedef (value_type (elt));
2622 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2623 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2624 return value_subscript_packed (elt, arity, ind);
2626 for (k = 0; k < arity; k += 1)
2628 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2629 error (_("too many subscripts (%d expected)"), k);
2630 elt = value_subscript (elt, pos_atr (ind[k]));
2635 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2636 value of the element of *ARR at the ARITY indices given in
2637 IND. Does not read the entire array into memory. */
2639 static struct value *
2640 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2645 for (k = 0; k < arity; k += 1)
2649 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2650 error (_("too many subscripts (%d expected)"), k);
2651 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2653 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2654 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2655 type = TYPE_TARGET_TYPE (type);
2658 return value_ind (arr);
2661 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2662 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2663 elements starting at index LOW. The lower bound of this array is LOW, as
2665 static struct value *
2666 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2669 struct type *type0 = ada_check_typedef (type);
2670 CORE_ADDR base = value_as_address (array_ptr)
2671 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)))
2672 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2673 struct type *index_type =
2674 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)),
2676 struct type *slice_type =
2677 create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type);
2679 return value_at_lazy (slice_type, base);
2683 static struct value *
2684 ada_value_slice (struct value *array, int low, int high)
2686 struct type *type = ada_check_typedef (value_type (array));
2687 struct type *index_type =
2688 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2689 struct type *slice_type =
2690 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2692 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2695 /* If type is a record type in the form of a standard GNAT array
2696 descriptor, returns the number of dimensions for type. If arr is a
2697 simple array, returns the number of "array of"s that prefix its
2698 type designation. Otherwise, returns 0. */
2701 ada_array_arity (struct type *type)
2708 type = desc_base_type (type);
2711 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2712 return desc_arity (desc_bounds_type (type));
2714 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2717 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2723 /* If TYPE is a record type in the form of a standard GNAT array
2724 descriptor or a simple array type, returns the element type for
2725 TYPE after indexing by NINDICES indices, or by all indices if
2726 NINDICES is -1. Otherwise, returns NULL. */
2729 ada_array_element_type (struct type *type, int nindices)
2731 type = desc_base_type (type);
2733 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2736 struct type *p_array_type;
2738 p_array_type = desc_data_target_type (type);
2740 k = ada_array_arity (type);
2744 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2745 if (nindices >= 0 && k > nindices)
2747 while (k > 0 && p_array_type != NULL)
2749 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2752 return p_array_type;
2754 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2756 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2758 type = TYPE_TARGET_TYPE (type);
2767 /* The type of nth index in arrays of given type (n numbering from 1).
2768 Does not examine memory. Throws an error if N is invalid or TYPE
2769 is not an array type. NAME is the name of the Ada attribute being
2770 evaluated ('range, 'first, 'last, or 'length); it is used in building
2771 the error message. */
2773 static struct type *
2774 ada_index_type (struct type *type, int n, const char *name)
2776 struct type *result_type;
2778 type = desc_base_type (type);
2780 if (n < 0 || n > ada_array_arity (type))
2781 error (_("invalid dimension number to '%s"), name);
2783 if (ada_is_simple_array_type (type))
2787 for (i = 1; i < n; i += 1)
2788 type = TYPE_TARGET_TYPE (type);
2789 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2790 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2791 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2792 perhaps stabsread.c would make more sense. */
2793 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2798 result_type = desc_index_type (desc_bounds_type (type), n);
2799 if (result_type == NULL)
2800 error (_("attempt to take bound of something that is not an array"));
2806 /* Given that arr is an array type, returns the lower bound of the
2807 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2808 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2809 array-descriptor type. It works for other arrays with bounds supplied
2810 by run-time quantities other than discriminants. */
2813 ada_array_bound_from_type (struct type *arr_type, int n, int which)
2815 struct type *type, *index_type_desc, *index_type;
2818 gdb_assert (which == 0 || which == 1);
2820 if (ada_is_constrained_packed_array_type (arr_type))
2821 arr_type = decode_constrained_packed_array_type (arr_type);
2823 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2824 return (LONGEST) - which;
2826 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2827 type = TYPE_TARGET_TYPE (arr_type);
2831 index_type_desc = ada_find_parallel_type (type, "___XA");
2832 ada_fixup_array_indexes_type (index_type_desc);
2833 if (index_type_desc != NULL)
2834 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2838 struct type *elt_type = check_typedef (type);
2840 for (i = 1; i < n; i++)
2841 elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type));
2843 index_type = TYPE_INDEX_TYPE (elt_type);
2847 (LONGEST) (which == 0
2848 ? ada_discrete_type_low_bound (index_type)
2849 : ada_discrete_type_high_bound (index_type));
2852 /* Given that arr is an array value, returns the lower bound of the
2853 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2854 WHICH is 1. This routine will also work for arrays with bounds
2855 supplied by run-time quantities other than discriminants. */
2858 ada_array_bound (struct value *arr, int n, int which)
2860 struct type *arr_type = value_type (arr);
2862 if (ada_is_constrained_packed_array_type (arr_type))
2863 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
2864 else if (ada_is_simple_array_type (arr_type))
2865 return ada_array_bound_from_type (arr_type, n, which);
2867 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
2870 /* Given that arr is an array value, returns the length of the
2871 nth index. This routine will also work for arrays with bounds
2872 supplied by run-time quantities other than discriminants.
2873 Does not work for arrays indexed by enumeration types with representation
2874 clauses at the moment. */
2877 ada_array_length (struct value *arr, int n)
2879 struct type *arr_type = ada_check_typedef (value_type (arr));
2881 if (ada_is_constrained_packed_array_type (arr_type))
2882 return ada_array_length (decode_constrained_packed_array (arr), n);
2884 if (ada_is_simple_array_type (arr_type))
2885 return (ada_array_bound_from_type (arr_type, n, 1)
2886 - ada_array_bound_from_type (arr_type, n, 0) + 1);
2888 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2889 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
2892 /* An empty array whose type is that of ARR_TYPE (an array type),
2893 with bounds LOW to LOW-1. */
2895 static struct value *
2896 empty_array (struct type *arr_type, int low)
2898 struct type *arr_type0 = ada_check_typedef (arr_type);
2899 struct type *index_type =
2900 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)),
2902 struct type *elt_type = ada_array_element_type (arr_type0, 1);
2904 return allocate_value (create_array_type (NULL, elt_type, index_type));
2908 /* Name resolution */
2910 /* The "decoded" name for the user-definable Ada operator corresponding
2914 ada_decoded_op_name (enum exp_opcode op)
2918 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2920 if (ada_opname_table[i].op == op)
2921 return ada_opname_table[i].decoded;
2923 error (_("Could not find operator name for opcode"));
2927 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2928 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2929 undefined namespace) and converts operators that are
2930 user-defined into appropriate function calls. If CONTEXT_TYPE is
2931 non-null, it provides a preferred result type [at the moment, only
2932 type void has any effect---causing procedures to be preferred over
2933 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2934 return type is preferred. May change (expand) *EXP. */
2937 resolve (struct expression **expp, int void_context_p)
2939 struct type *context_type = NULL;
2943 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
2945 resolve_subexp (expp, &pc, 1, context_type);
2948 /* Resolve the operator of the subexpression beginning at
2949 position *POS of *EXPP. "Resolving" consists of replacing
2950 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2951 with their resolutions, replacing built-in operators with
2952 function calls to user-defined operators, where appropriate, and,
2953 when DEPROCEDURE_P is non-zero, converting function-valued variables
2954 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2955 are as in ada_resolve, above. */
2957 static struct value *
2958 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2959 struct type *context_type)
2963 struct expression *exp; /* Convenience: == *expp. */
2964 enum exp_opcode op = (*expp)->elts[pc].opcode;
2965 struct value **argvec; /* Vector of operand types (alloca'ed). */
2966 int nargs; /* Number of operands. */
2973 /* Pass one: resolve operands, saving their types and updating *pos,
2978 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2979 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2984 resolve_subexp (expp, pos, 0, NULL);
2986 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2991 resolve_subexp (expp, pos, 0, NULL);
2996 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
2999 case OP_ATR_MODULUS:
3009 case TERNOP_IN_RANGE:
3010 case BINOP_IN_BOUNDS:
3016 case OP_DISCRETE_RANGE:
3018 ada_forward_operator_length (exp, pc, &oplen, &nargs);
3027 arg1 = resolve_subexp (expp, pos, 0, NULL);
3029 resolve_subexp (expp, pos, 1, NULL);
3031 resolve_subexp (expp, pos, 1, value_type (arg1));
3048 case BINOP_LOGICAL_AND:
3049 case BINOP_LOGICAL_OR:
3050 case BINOP_BITWISE_AND:
3051 case BINOP_BITWISE_IOR:
3052 case BINOP_BITWISE_XOR:
3055 case BINOP_NOTEQUAL:
3062 case BINOP_SUBSCRIPT:
3070 case UNOP_LOGICAL_NOT:
3086 case OP_INTERNALVAR:
3096 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3099 case STRUCTOP_STRUCT:
3100 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3113 error (_("Unexpected operator during name resolution"));
3116 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
3117 for (i = 0; i < nargs; i += 1)
3118 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3122 /* Pass two: perform any resolution on principal operator. */
3129 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3131 struct ada_symbol_info *candidates;
3135 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3136 (exp->elts[pc + 2].symbol),
3137 exp->elts[pc + 1].block, VAR_DOMAIN,
3140 if (n_candidates > 1)
3142 /* Types tend to get re-introduced locally, so if there
3143 are any local symbols that are not types, first filter
3146 for (j = 0; j < n_candidates; j += 1)
3147 switch (SYMBOL_CLASS (candidates[j].sym))
3152 case LOC_REGPARM_ADDR:
3160 if (j < n_candidates)
3163 while (j < n_candidates)
3165 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3167 candidates[j] = candidates[n_candidates - 1];
3176 if (n_candidates == 0)
3177 error (_("No definition found for %s"),
3178 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3179 else if (n_candidates == 1)
3181 else if (deprocedure_p
3182 && !is_nonfunction (candidates, n_candidates))
3184 i = ada_resolve_function
3185 (candidates, n_candidates, NULL, 0,
3186 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3189 error (_("Could not find a match for %s"),
3190 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3194 printf_filtered (_("Multiple matches for %s\n"),
3195 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3196 user_select_syms (candidates, n_candidates, 1);
3200 exp->elts[pc + 1].block = candidates[i].block;
3201 exp->elts[pc + 2].symbol = candidates[i].sym;
3202 if (innermost_block == NULL
3203 || contained_in (candidates[i].block, innermost_block))
3204 innermost_block = candidates[i].block;
3208 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3211 replace_operator_with_call (expp, pc, 0, 0,
3212 exp->elts[pc + 2].symbol,
3213 exp->elts[pc + 1].block);
3220 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3221 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3223 struct ada_symbol_info *candidates;
3227 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3228 (exp->elts[pc + 5].symbol),
3229 exp->elts[pc + 4].block, VAR_DOMAIN,
3231 if (n_candidates == 1)
3235 i = ada_resolve_function
3236 (candidates, n_candidates,
3238 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3241 error (_("Could not find a match for %s"),
3242 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3245 exp->elts[pc + 4].block = candidates[i].block;
3246 exp->elts[pc + 5].symbol = candidates[i].sym;
3247 if (innermost_block == NULL
3248 || contained_in (candidates[i].block, innermost_block))
3249 innermost_block = candidates[i].block;
3260 case BINOP_BITWISE_AND:
3261 case BINOP_BITWISE_IOR:
3262 case BINOP_BITWISE_XOR:
3264 case BINOP_NOTEQUAL:
3272 case UNOP_LOGICAL_NOT:
3274 if (possible_user_operator_p (op, argvec))
3276 struct ada_symbol_info *candidates;
3280 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3281 (struct block *) NULL, VAR_DOMAIN,
3283 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
3284 ada_decoded_op_name (op), NULL);
3288 replace_operator_with_call (expp, pc, nargs, 1,
3289 candidates[i].sym, candidates[i].block);
3300 return evaluate_subexp_type (exp, pos);
3303 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3304 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3306 /* The term "match" here is rather loose. The match is heuristic and
3310 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3312 ftype = ada_check_typedef (ftype);
3313 atype = ada_check_typedef (atype);
3315 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3316 ftype = TYPE_TARGET_TYPE (ftype);
3317 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3318 atype = TYPE_TARGET_TYPE (atype);
3320 switch (TYPE_CODE (ftype))
3323 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3325 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3326 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3327 TYPE_TARGET_TYPE (atype), 0);
3330 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3332 case TYPE_CODE_ENUM:
3333 case TYPE_CODE_RANGE:
3334 switch (TYPE_CODE (atype))
3337 case TYPE_CODE_ENUM:
3338 case TYPE_CODE_RANGE:
3344 case TYPE_CODE_ARRAY:
3345 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3346 || ada_is_array_descriptor_type (atype));
3348 case TYPE_CODE_STRUCT:
3349 if (ada_is_array_descriptor_type (ftype))
3350 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3351 || ada_is_array_descriptor_type (atype));
3353 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3354 && !ada_is_array_descriptor_type (atype));
3356 case TYPE_CODE_UNION:
3358 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3362 /* Return non-zero if the formals of FUNC "sufficiently match" the
3363 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3364 may also be an enumeral, in which case it is treated as a 0-
3365 argument function. */
3368 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3371 struct type *func_type = SYMBOL_TYPE (func);
3373 if (SYMBOL_CLASS (func) == LOC_CONST
3374 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3375 return (n_actuals == 0);
3376 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3379 if (TYPE_NFIELDS (func_type) != n_actuals)
3382 for (i = 0; i < n_actuals; i += 1)
3384 if (actuals[i] == NULL)
3388 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3390 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3392 if (!ada_type_match (ftype, atype, 1))
3399 /* False iff function type FUNC_TYPE definitely does not produce a value
3400 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3401 FUNC_TYPE is not a valid function type with a non-null return type
3402 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3405 return_match (struct type *func_type, struct type *context_type)
3407 struct type *return_type;
3409 if (func_type == NULL)
3412 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3413 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
3415 return_type = get_base_type (func_type);
3416 if (return_type == NULL)
3419 context_type = get_base_type (context_type);
3421 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3422 return context_type == NULL || return_type == context_type;
3423 else if (context_type == NULL)
3424 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3426 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3430 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3431 function (if any) that matches the types of the NARGS arguments in
3432 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3433 that returns that type, then eliminate matches that don't. If
3434 CONTEXT_TYPE is void and there is at least one match that does not
3435 return void, eliminate all matches that do.
3437 Asks the user if there is more than one match remaining. Returns -1
3438 if there is no such symbol or none is selected. NAME is used
3439 solely for messages. May re-arrange and modify SYMS in
3440 the process; the index returned is for the modified vector. */
3443 ada_resolve_function (struct ada_symbol_info syms[],
3444 int nsyms, struct value **args, int nargs,
3445 const char *name, struct type *context_type)
3449 int m; /* Number of hits */
3452 /* In the first pass of the loop, we only accept functions matching
3453 context_type. If none are found, we add a second pass of the loop
3454 where every function is accepted. */
3455 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3457 for (k = 0; k < nsyms; k += 1)
3459 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3461 if (ada_args_match (syms[k].sym, args, nargs)
3462 && (fallback || return_match (type, context_type)))
3474 printf_filtered (_("Multiple matches for %s\n"), name);
3475 user_select_syms (syms, m, 1);
3481 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3482 in a listing of choices during disambiguation (see sort_choices, below).
3483 The idea is that overloadings of a subprogram name from the
3484 same package should sort in their source order. We settle for ordering
3485 such symbols by their trailing number (__N or $N). */
3488 encoded_ordered_before (const char *N0, const char *N1)
3492 else if (N0 == NULL)
3498 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3500 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3502 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3503 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3508 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3511 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3513 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3514 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3516 return (strcmp (N0, N1) < 0);
3520 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3524 sort_choices (struct ada_symbol_info syms[], int nsyms)
3528 for (i = 1; i < nsyms; i += 1)
3530 struct ada_symbol_info sym = syms[i];
3533 for (j = i - 1; j >= 0; j -= 1)
3535 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3536 SYMBOL_LINKAGE_NAME (sym.sym)))
3538 syms[j + 1] = syms[j];
3544 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3545 by asking the user (if necessary), returning the number selected,
3546 and setting the first elements of SYMS items. Error if no symbols
3549 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3550 to be re-integrated one of these days. */
3553 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3556 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3558 int first_choice = (max_results == 1) ? 1 : 2;
3559 const char *select_mode = multiple_symbols_select_mode ();
3561 if (max_results < 1)
3562 error (_("Request to select 0 symbols!"));
3566 if (select_mode == multiple_symbols_cancel)
3568 canceled because the command is ambiguous\n\
3569 See set/show multiple-symbol."));
3571 /* If select_mode is "all", then return all possible symbols.
3572 Only do that if more than one symbol can be selected, of course.
3573 Otherwise, display the menu as usual. */
3574 if (select_mode == multiple_symbols_all && max_results > 1)
3577 printf_unfiltered (_("[0] cancel\n"));
3578 if (max_results > 1)
3579 printf_unfiltered (_("[1] all\n"));
3581 sort_choices (syms, nsyms);
3583 for (i = 0; i < nsyms; i += 1)
3585 if (syms[i].sym == NULL)
3588 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3590 struct symtab_and_line sal =
3591 find_function_start_sal (syms[i].sym, 1);
3593 if (sal.symtab == NULL)
3594 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3596 SYMBOL_PRINT_NAME (syms[i].sym),
3599 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3600 SYMBOL_PRINT_NAME (syms[i].sym),
3601 symtab_to_filename_for_display (sal.symtab),
3608 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3609 && SYMBOL_TYPE (syms[i].sym) != NULL
3610 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3611 struct symtab *symtab = SYMBOL_SYMTAB (syms[i].sym);
3613 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3614 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3616 SYMBOL_PRINT_NAME (syms[i].sym),
3617 symtab_to_filename_for_display (symtab),
3618 SYMBOL_LINE (syms[i].sym));
3619 else if (is_enumeral
3620 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3622 printf_unfiltered (("[%d] "), i + first_choice);
3623 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3624 gdb_stdout, -1, 0, &type_print_raw_options);
3625 printf_unfiltered (_("'(%s) (enumeral)\n"),
3626 SYMBOL_PRINT_NAME (syms[i].sym));
3628 else if (symtab != NULL)
3629 printf_unfiltered (is_enumeral
3630 ? _("[%d] %s in %s (enumeral)\n")
3631 : _("[%d] %s at %s:?\n"),
3633 SYMBOL_PRINT_NAME (syms[i].sym),
3634 symtab_to_filename_for_display (symtab));
3636 printf_unfiltered (is_enumeral
3637 ? _("[%d] %s (enumeral)\n")
3638 : _("[%d] %s at ?\n"),
3640 SYMBOL_PRINT_NAME (syms[i].sym));
3644 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3647 for (i = 0; i < n_chosen; i += 1)
3648 syms[i] = syms[chosen[i]];
3653 /* Read and validate a set of numeric choices from the user in the
3654 range 0 .. N_CHOICES-1. Place the results in increasing
3655 order in CHOICES[0 .. N-1], and return N.
3657 The user types choices as a sequence of numbers on one line
3658 separated by blanks, encoding them as follows:
3660 + A choice of 0 means to cancel the selection, throwing an error.
3661 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3662 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3664 The user is not allowed to choose more than MAX_RESULTS values.
3666 ANNOTATION_SUFFIX, if present, is used to annotate the input
3667 prompts (for use with the -f switch). */
3670 get_selections (int *choices, int n_choices, int max_results,
3671 int is_all_choice, char *annotation_suffix)
3676 int first_choice = is_all_choice ? 2 : 1;
3678 prompt = getenv ("PS2");
3682 args = command_line_input (prompt, 0, annotation_suffix);
3685 error_no_arg (_("one or more choice numbers"));
3689 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3690 order, as given in args. Choices are validated. */
3696 args = skip_spaces (args);
3697 if (*args == '\0' && n_chosen == 0)
3698 error_no_arg (_("one or more choice numbers"));
3699 else if (*args == '\0')
3702 choice = strtol (args, &args2, 10);
3703 if (args == args2 || choice < 0
3704 || choice > n_choices + first_choice - 1)
3705 error (_("Argument must be choice number"));
3709 error (_("cancelled"));
3711 if (choice < first_choice)
3713 n_chosen = n_choices;
3714 for (j = 0; j < n_choices; j += 1)
3718 choice -= first_choice;
3720 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3724 if (j < 0 || choice != choices[j])
3728 for (k = n_chosen - 1; k > j; k -= 1)
3729 choices[k + 1] = choices[k];
3730 choices[j + 1] = choice;
3735 if (n_chosen > max_results)
3736 error (_("Select no more than %d of the above"), max_results);
3741 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3742 on the function identified by SYM and BLOCK, and taking NARGS
3743 arguments. Update *EXPP as needed to hold more space. */
3746 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3747 int oplen, struct symbol *sym,
3748 const struct block *block)
3750 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3751 symbol, -oplen for operator being replaced). */
3752 struct expression *newexp = (struct expression *)
3753 xzalloc (sizeof (struct expression)
3754 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3755 struct expression *exp = *expp;
3757 newexp->nelts = exp->nelts + 7 - oplen;
3758 newexp->language_defn = exp->language_defn;
3759 newexp->gdbarch = exp->gdbarch;
3760 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3761 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3762 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3764 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3765 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3767 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3768 newexp->elts[pc + 4].block = block;
3769 newexp->elts[pc + 5].symbol = sym;
3775 /* Type-class predicates */
3777 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3781 numeric_type_p (struct type *type)
3787 switch (TYPE_CODE (type))
3792 case TYPE_CODE_RANGE:
3793 return (type == TYPE_TARGET_TYPE (type)
3794 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3801 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3804 integer_type_p (struct type *type)
3810 switch (TYPE_CODE (type))
3814 case TYPE_CODE_RANGE:
3815 return (type == TYPE_TARGET_TYPE (type)
3816 || integer_type_p (TYPE_TARGET_TYPE (type)));
3823 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3826 scalar_type_p (struct type *type)
3832 switch (TYPE_CODE (type))
3835 case TYPE_CODE_RANGE:
3836 case TYPE_CODE_ENUM:
3845 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3848 discrete_type_p (struct type *type)
3854 switch (TYPE_CODE (type))
3857 case TYPE_CODE_RANGE:
3858 case TYPE_CODE_ENUM:
3859 case TYPE_CODE_BOOL:
3867 /* Returns non-zero if OP with operands in the vector ARGS could be
3868 a user-defined function. Errs on the side of pre-defined operators
3869 (i.e., result 0). */
3872 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3874 struct type *type0 =
3875 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3876 struct type *type1 =
3877 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3891 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3895 case BINOP_BITWISE_AND:
3896 case BINOP_BITWISE_IOR:
3897 case BINOP_BITWISE_XOR:
3898 return (!(integer_type_p (type0) && integer_type_p (type1)));
3901 case BINOP_NOTEQUAL:
3906 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3909 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3912 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3916 case UNOP_LOGICAL_NOT:
3918 return (!numeric_type_p (type0));
3927 1. In the following, we assume that a renaming type's name may
3928 have an ___XD suffix. It would be nice if this went away at some
3930 2. We handle both the (old) purely type-based representation of
3931 renamings and the (new) variable-based encoding. At some point,
3932 it is devoutly to be hoped that the former goes away
3933 (FIXME: hilfinger-2007-07-09).
3934 3. Subprogram renamings are not implemented, although the XRS
3935 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3937 /* If SYM encodes a renaming,
3939 <renaming> renames <renamed entity>,
3941 sets *LEN to the length of the renamed entity's name,
3942 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3943 the string describing the subcomponent selected from the renamed
3944 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3945 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3946 are undefined). Otherwise, returns a value indicating the category
3947 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3948 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3949 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3950 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3951 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3952 may be NULL, in which case they are not assigned.
3954 [Currently, however, GCC does not generate subprogram renamings.] */
3956 enum ada_renaming_category
3957 ada_parse_renaming (struct symbol *sym,
3958 const char **renamed_entity, int *len,
3959 const char **renaming_expr)
3961 enum ada_renaming_category kind;
3966 return ADA_NOT_RENAMING;
3967 switch (SYMBOL_CLASS (sym))
3970 return ADA_NOT_RENAMING;
3972 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3973 renamed_entity, len, renaming_expr);
3977 case LOC_OPTIMIZED_OUT:
3978 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3980 return ADA_NOT_RENAMING;
3984 kind = ADA_OBJECT_RENAMING;
3988 kind = ADA_EXCEPTION_RENAMING;
3992 kind = ADA_PACKAGE_RENAMING;
3996 kind = ADA_SUBPROGRAM_RENAMING;
4000 return ADA_NOT_RENAMING;
4004 if (renamed_entity != NULL)
4005 *renamed_entity = info;
4006 suffix = strstr (info, "___XE");
4007 if (suffix == NULL || suffix == info)
4008 return ADA_NOT_RENAMING;
4010 *len = strlen (info) - strlen (suffix);
4012 if (renaming_expr != NULL)
4013 *renaming_expr = suffix;
4017 /* Assuming TYPE encodes a renaming according to the old encoding in
4018 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4019 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4020 ADA_NOT_RENAMING otherwise. */
4021 static enum ada_renaming_category
4022 parse_old_style_renaming (struct type *type,
4023 const char **renamed_entity, int *len,
4024 const char **renaming_expr)
4026 enum ada_renaming_category kind;
4031 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4032 || TYPE_NFIELDS (type) != 1)
4033 return ADA_NOT_RENAMING;
4035 name = type_name_no_tag (type);
4037 return ADA_NOT_RENAMING;
4039 name = strstr (name, "___XR");
4041 return ADA_NOT_RENAMING;
4046 kind = ADA_OBJECT_RENAMING;
4049 kind = ADA_EXCEPTION_RENAMING;
4052 kind = ADA_PACKAGE_RENAMING;
4055 kind = ADA_SUBPROGRAM_RENAMING;
4058 return ADA_NOT_RENAMING;
4061 info = TYPE_FIELD_NAME (type, 0);
4063 return ADA_NOT_RENAMING;
4064 if (renamed_entity != NULL)
4065 *renamed_entity = info;
4066 suffix = strstr (info, "___XE");
4067 if (renaming_expr != NULL)
4068 *renaming_expr = suffix + 5;
4069 if (suffix == NULL || suffix == info)
4070 return ADA_NOT_RENAMING;
4072 *len = suffix - info;
4076 /* Compute the value of the given RENAMING_SYM, which is expected to
4077 be a symbol encoding a renaming expression. BLOCK is the block
4078 used to evaluate the renaming. */
4080 static struct value *
4081 ada_read_renaming_var_value (struct symbol *renaming_sym,
4082 struct block *block)
4084 const char *sym_name;
4085 struct expression *expr;
4086 struct value *value;
4087 struct cleanup *old_chain = NULL;
4089 sym_name = SYMBOL_LINKAGE_NAME (renaming_sym);
4090 expr = parse_exp_1 (&sym_name, 0, block, 0);
4091 old_chain = make_cleanup (free_current_contents, &expr);
4092 value = evaluate_expression (expr);
4094 do_cleanups (old_chain);
4099 /* Evaluation: Function Calls */
4101 /* Return an lvalue containing the value VAL. This is the identity on
4102 lvalues, and otherwise has the side-effect of allocating memory
4103 in the inferior where a copy of the value contents is copied. */
4105 static struct value *
4106 ensure_lval (struct value *val)
4108 if (VALUE_LVAL (val) == not_lval
4109 || VALUE_LVAL (val) == lval_internalvar)
4111 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4112 const CORE_ADDR addr =
4113 value_as_long (value_allocate_space_in_inferior (len));
4115 set_value_address (val, addr);
4116 VALUE_LVAL (val) = lval_memory;
4117 write_memory (addr, value_contents (val), len);
4123 /* Return the value ACTUAL, converted to be an appropriate value for a
4124 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4125 allocating any necessary descriptors (fat pointers), or copies of
4126 values not residing in memory, updating it as needed. */
4129 ada_convert_actual (struct value *actual, struct type *formal_type0)
4131 struct type *actual_type = ada_check_typedef (value_type (actual));
4132 struct type *formal_type = ada_check_typedef (formal_type0);
4133 struct type *formal_target =
4134 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4135 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4136 struct type *actual_target =
4137 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4138 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4140 if (ada_is_array_descriptor_type (formal_target)
4141 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4142 return make_array_descriptor (formal_type, actual);
4143 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4144 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4146 struct value *result;
4148 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4149 && ada_is_array_descriptor_type (actual_target))
4150 result = desc_data (actual);
4151 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4153 if (VALUE_LVAL (actual) != lval_memory)
4157 actual_type = ada_check_typedef (value_type (actual));
4158 val = allocate_value (actual_type);
4159 memcpy ((char *) value_contents_raw (val),
4160 (char *) value_contents (actual),
4161 TYPE_LENGTH (actual_type));
4162 actual = ensure_lval (val);
4164 result = value_addr (actual);
4168 return value_cast_pointers (formal_type, result, 0);
4170 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4171 return ada_value_ind (actual);
4176 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4177 type TYPE. This is usually an inefficient no-op except on some targets
4178 (such as AVR) where the representation of a pointer and an address
4182 value_pointer (struct value *value, struct type *type)
4184 struct gdbarch *gdbarch = get_type_arch (type);
4185 unsigned len = TYPE_LENGTH (type);
4186 gdb_byte *buf = alloca (len);
4189 addr = value_address (value);
4190 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4191 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4196 /* Push a descriptor of type TYPE for array value ARR on the stack at
4197 *SP, updating *SP to reflect the new descriptor. Return either
4198 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4199 to-descriptor type rather than a descriptor type), a struct value *
4200 representing a pointer to this descriptor. */
4202 static struct value *
4203 make_array_descriptor (struct type *type, struct value *arr)
4205 struct type *bounds_type = desc_bounds_type (type);
4206 struct type *desc_type = desc_base_type (type);
4207 struct value *descriptor = allocate_value (desc_type);
4208 struct value *bounds = allocate_value (bounds_type);
4211 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4214 modify_field (value_type (bounds), value_contents_writeable (bounds),
4215 ada_array_bound (arr, i, 0),
4216 desc_bound_bitpos (bounds_type, i, 0),
4217 desc_bound_bitsize (bounds_type, i, 0));
4218 modify_field (value_type (bounds), value_contents_writeable (bounds),
4219 ada_array_bound (arr, i, 1),
4220 desc_bound_bitpos (bounds_type, i, 1),
4221 desc_bound_bitsize (bounds_type, i, 1));
4224 bounds = ensure_lval (bounds);
4226 modify_field (value_type (descriptor),
4227 value_contents_writeable (descriptor),
4228 value_pointer (ensure_lval (arr),
4229 TYPE_FIELD_TYPE (desc_type, 0)),
4230 fat_pntr_data_bitpos (desc_type),
4231 fat_pntr_data_bitsize (desc_type));
4233 modify_field (value_type (descriptor),
4234 value_contents_writeable (descriptor),
4235 value_pointer (bounds,
4236 TYPE_FIELD_TYPE (desc_type, 1)),
4237 fat_pntr_bounds_bitpos (desc_type),
4238 fat_pntr_bounds_bitsize (desc_type));
4240 descriptor = ensure_lval (descriptor);
4242 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4243 return value_addr (descriptor);
4248 /* Dummy definitions for an experimental caching module that is not
4249 * used in the public sources. */
4252 lookup_cached_symbol (const char *name, domain_enum namespace,
4253 struct symbol **sym, const struct block **block)
4259 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
4260 const struct block *block)
4266 /* Return nonzero if wild matching should be used when searching for
4267 all symbols matching LOOKUP_NAME.
4269 LOOKUP_NAME is expected to be a symbol name after transformation
4270 for Ada lookups (see ada_name_for_lookup). */
4273 should_use_wild_match (const char *lookup_name)
4275 return (strstr (lookup_name, "__") == NULL);
4278 /* Return the result of a standard (literal, C-like) lookup of NAME in
4279 given DOMAIN, visible from lexical block BLOCK. */
4281 static struct symbol *
4282 standard_lookup (const char *name, const struct block *block,
4285 /* Initialize it just to avoid a GCC false warning. */
4286 struct symbol *sym = NULL;
4288 if (lookup_cached_symbol (name, domain, &sym, NULL))
4290 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4291 cache_symbol (name, domain, sym, block_found);
4296 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4297 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4298 since they contend in overloading in the same way. */
4300 is_nonfunction (struct ada_symbol_info syms[], int n)
4304 for (i = 0; i < n; i += 1)
4305 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4306 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4307 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
4313 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4314 struct types. Otherwise, they may not. */
4317 equiv_types (struct type *type0, struct type *type1)
4321 if (type0 == NULL || type1 == NULL
4322 || TYPE_CODE (type0) != TYPE_CODE (type1))
4324 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4325 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4326 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4327 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4333 /* True iff SYM0 represents the same entity as SYM1, or one that is
4334 no more defined than that of SYM1. */
4337 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4341 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4342 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4345 switch (SYMBOL_CLASS (sym0))
4351 struct type *type0 = SYMBOL_TYPE (sym0);
4352 struct type *type1 = SYMBOL_TYPE (sym1);
4353 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4354 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4355 int len0 = strlen (name0);
4358 TYPE_CODE (type0) == TYPE_CODE (type1)
4359 && (equiv_types (type0, type1)
4360 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4361 && strncmp (name1 + len0, "___XV", 5) == 0));
4364 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4365 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4371 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4372 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4375 add_defn_to_vec (struct obstack *obstackp,
4377 const struct block *block)
4380 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4382 /* Do not try to complete stub types, as the debugger is probably
4383 already scanning all symbols matching a certain name at the
4384 time when this function is called. Trying to replace the stub
4385 type by its associated full type will cause us to restart a scan
4386 which may lead to an infinite recursion. Instead, the client
4387 collecting the matching symbols will end up collecting several
4388 matches, with at least one of them complete. It can then filter
4389 out the stub ones if needed. */
4391 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4393 if (lesseq_defined_than (sym, prevDefns[i].sym))
4395 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4397 prevDefns[i].sym = sym;
4398 prevDefns[i].block = block;
4404 struct ada_symbol_info info;
4408 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4412 /* Number of ada_symbol_info structures currently collected in
4413 current vector in *OBSTACKP. */
4416 num_defns_collected (struct obstack *obstackp)
4418 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4421 /* Vector of ada_symbol_info structures currently collected in current
4422 vector in *OBSTACKP. If FINISH, close off the vector and return
4423 its final address. */
4425 static struct ada_symbol_info *
4426 defns_collected (struct obstack *obstackp, int finish)
4429 return obstack_finish (obstackp);
4431 return (struct ada_symbol_info *) obstack_base (obstackp);
4434 /* Return a bound minimal symbol matching NAME according to Ada
4435 decoding rules. Returns an invalid symbol if there is no such
4436 minimal symbol. Names prefixed with "standard__" are handled
4437 specially: "standard__" is first stripped off, and only static and
4438 global symbols are searched. */
4440 struct bound_minimal_symbol
4441 ada_lookup_simple_minsym (const char *name)
4443 struct bound_minimal_symbol result;
4444 struct objfile *objfile;
4445 struct minimal_symbol *msymbol;
4446 const int wild_match_p = should_use_wild_match (name);
4448 memset (&result, 0, sizeof (result));
4450 /* Special case: If the user specifies a symbol name inside package
4451 Standard, do a non-wild matching of the symbol name without
4452 the "standard__" prefix. This was primarily introduced in order
4453 to allow the user to specifically access the standard exceptions
4454 using, for instance, Standard.Constraint_Error when Constraint_Error
4455 is ambiguous (due to the user defining its own Constraint_Error
4456 entity inside its program). */
4457 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4458 name += sizeof ("standard__") - 1;
4460 ALL_MSYMBOLS (objfile, msymbol)
4462 if (match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match_p)
4463 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4465 result.minsym = msymbol;
4466 result.objfile = objfile;
4474 /* For all subprograms that statically enclose the subprogram of the
4475 selected frame, add symbols matching identifier NAME in DOMAIN
4476 and their blocks to the list of data in OBSTACKP, as for
4477 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4478 with a wildcard prefix. */
4481 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4482 const char *name, domain_enum namespace,
4487 /* True if TYPE is definitely an artificial type supplied to a symbol
4488 for which no debugging information was given in the symbol file. */
4491 is_nondebugging_type (struct type *type)
4493 const char *name = ada_type_name (type);
4495 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4498 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4499 that are deemed "identical" for practical purposes.
4501 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4502 types and that their number of enumerals is identical (in other
4503 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4506 ada_identical_enum_types_p (struct type *type1, struct type *type2)
4510 /* The heuristic we use here is fairly conservative. We consider
4511 that 2 enumerate types are identical if they have the same
4512 number of enumerals and that all enumerals have the same
4513 underlying value and name. */
4515 /* All enums in the type should have an identical underlying value. */
4516 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4517 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
4520 /* All enumerals should also have the same name (modulo any numerical
4522 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4524 const char *name_1 = TYPE_FIELD_NAME (type1, i);
4525 const char *name_2 = TYPE_FIELD_NAME (type2, i);
4526 int len_1 = strlen (name_1);
4527 int len_2 = strlen (name_2);
4529 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
4530 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
4532 || strncmp (TYPE_FIELD_NAME (type1, i),
4533 TYPE_FIELD_NAME (type2, i),
4541 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4542 that are deemed "identical" for practical purposes. Sometimes,
4543 enumerals are not strictly identical, but their types are so similar
4544 that they can be considered identical.
4546 For instance, consider the following code:
4548 type Color is (Black, Red, Green, Blue, White);
4549 type RGB_Color is new Color range Red .. Blue;
4551 Type RGB_Color is a subrange of an implicit type which is a copy
4552 of type Color. If we call that implicit type RGB_ColorB ("B" is
4553 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4554 As a result, when an expression references any of the enumeral
4555 by name (Eg. "print green"), the expression is technically
4556 ambiguous and the user should be asked to disambiguate. But
4557 doing so would only hinder the user, since it wouldn't matter
4558 what choice he makes, the outcome would always be the same.
4559 So, for practical purposes, we consider them as the same. */
4562 symbols_are_identical_enums (struct ada_symbol_info *syms, int nsyms)
4566 /* Before performing a thorough comparison check of each type,
4567 we perform a series of inexpensive checks. We expect that these
4568 checks will quickly fail in the vast majority of cases, and thus
4569 help prevent the unnecessary use of a more expensive comparison.
4570 Said comparison also expects us to make some of these checks
4571 (see ada_identical_enum_types_p). */
4573 /* Quick check: All symbols should have an enum type. */
4574 for (i = 0; i < nsyms; i++)
4575 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM)
4578 /* Quick check: They should all have the same value. */
4579 for (i = 1; i < nsyms; i++)
4580 if (SYMBOL_VALUE (syms[i].sym) != SYMBOL_VALUE (syms[0].sym))
4583 /* Quick check: They should all have the same number of enumerals. */
4584 for (i = 1; i < nsyms; i++)
4585 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].sym))
4586 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].sym)))
4589 /* All the sanity checks passed, so we might have a set of
4590 identical enumeration types. Perform a more complete
4591 comparison of the type of each symbol. */
4592 for (i = 1; i < nsyms; i++)
4593 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].sym),
4594 SYMBOL_TYPE (syms[0].sym)))
4600 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4601 duplicate other symbols in the list (The only case I know of where
4602 this happens is when object files containing stabs-in-ecoff are
4603 linked with files containing ordinary ecoff debugging symbols (or no
4604 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4605 Returns the number of items in the modified list. */
4608 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4612 /* We should never be called with less than 2 symbols, as there
4613 cannot be any extra symbol in that case. But it's easy to
4614 handle, since we have nothing to do in that case. */
4623 /* If two symbols have the same name and one of them is a stub type,
4624 the get rid of the stub. */
4626 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4627 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4629 for (j = 0; j < nsyms; j++)
4632 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4633 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4634 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4635 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4640 /* Two symbols with the same name, same class and same address
4641 should be identical. */
4643 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4644 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4645 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4647 for (j = 0; j < nsyms; j += 1)
4650 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4651 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4652 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4653 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4654 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4655 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4662 for (j = i + 1; j < nsyms; j += 1)
4663 syms[j - 1] = syms[j];
4670 /* If all the remaining symbols are identical enumerals, then
4671 just keep the first one and discard the rest.
4673 Unlike what we did previously, we do not discard any entry
4674 unless they are ALL identical. This is because the symbol
4675 comparison is not a strict comparison, but rather a practical
4676 comparison. If all symbols are considered identical, then
4677 we can just go ahead and use the first one and discard the rest.
4678 But if we cannot reduce the list to a single element, we have
4679 to ask the user to disambiguate anyways. And if we have to
4680 present a multiple-choice menu, it's less confusing if the list
4681 isn't missing some choices that were identical and yet distinct. */
4682 if (symbols_are_identical_enums (syms, nsyms))
4688 /* Given a type that corresponds to a renaming entity, use the type name
4689 to extract the scope (package name or function name, fully qualified,
4690 and following the GNAT encoding convention) where this renaming has been
4691 defined. The string returned needs to be deallocated after use. */
4694 xget_renaming_scope (struct type *renaming_type)
4696 /* The renaming types adhere to the following convention:
4697 <scope>__<rename>___<XR extension>.
4698 So, to extract the scope, we search for the "___XR" extension,
4699 and then backtrack until we find the first "__". */
4701 const char *name = type_name_no_tag (renaming_type);
4702 char *suffix = strstr (name, "___XR");
4707 /* Now, backtrack a bit until we find the first "__". Start looking
4708 at suffix - 3, as the <rename> part is at least one character long. */
4710 for (last = suffix - 3; last > name; last--)
4711 if (last[0] == '_' && last[1] == '_')
4714 /* Make a copy of scope and return it. */
4716 scope_len = last - name;
4717 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4719 strncpy (scope, name, scope_len);
4720 scope[scope_len] = '\0';
4725 /* Return nonzero if NAME corresponds to a package name. */
4728 is_package_name (const char *name)
4730 /* Here, We take advantage of the fact that no symbols are generated
4731 for packages, while symbols are generated for each function.
4732 So the condition for NAME represent a package becomes equivalent
4733 to NAME not existing in our list of symbols. There is only one
4734 small complication with library-level functions (see below). */
4738 /* If it is a function that has not been defined at library level,
4739 then we should be able to look it up in the symbols. */
4740 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4743 /* Library-level function names start with "_ada_". See if function
4744 "_ada_" followed by NAME can be found. */
4746 /* Do a quick check that NAME does not contain "__", since library-level
4747 functions names cannot contain "__" in them. */
4748 if (strstr (name, "__") != NULL)
4751 fun_name = xstrprintf ("_ada_%s", name);
4753 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4756 /* Return nonzero if SYM corresponds to a renaming entity that is
4757 not visible from FUNCTION_NAME. */
4760 old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
4763 struct cleanup *old_chain;
4765 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4768 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4769 old_chain = make_cleanup (xfree, scope);
4771 /* If the rename has been defined in a package, then it is visible. */
4772 if (is_package_name (scope))
4774 do_cleanups (old_chain);
4778 /* Check that the rename is in the current function scope by checking
4779 that its name starts with SCOPE. */
4781 /* If the function name starts with "_ada_", it means that it is
4782 a library-level function. Strip this prefix before doing the
4783 comparison, as the encoding for the renaming does not contain
4785 if (strncmp (function_name, "_ada_", 5) == 0)
4789 int is_invisible = strncmp (function_name, scope, strlen (scope)) != 0;
4791 do_cleanups (old_chain);
4792 return is_invisible;
4796 /* Remove entries from SYMS that corresponds to a renaming entity that
4797 is not visible from the function associated with CURRENT_BLOCK or
4798 that is superfluous due to the presence of more specific renaming
4799 information. Places surviving symbols in the initial entries of
4800 SYMS and returns the number of surviving symbols.
4803 First, in cases where an object renaming is implemented as a
4804 reference variable, GNAT may produce both the actual reference
4805 variable and the renaming encoding. In this case, we discard the
4808 Second, GNAT emits a type following a specified encoding for each renaming
4809 entity. Unfortunately, STABS currently does not support the definition
4810 of types that are local to a given lexical block, so all renamings types
4811 are emitted at library level. As a consequence, if an application
4812 contains two renaming entities using the same name, and a user tries to
4813 print the value of one of these entities, the result of the ada symbol
4814 lookup will also contain the wrong renaming type.
4816 This function partially covers for this limitation by attempting to
4817 remove from the SYMS list renaming symbols that should be visible
4818 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4819 method with the current information available. The implementation
4820 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4822 - When the user tries to print a rename in a function while there
4823 is another rename entity defined in a package: Normally, the
4824 rename in the function has precedence over the rename in the
4825 package, so the latter should be removed from the list. This is
4826 currently not the case.
4828 - This function will incorrectly remove valid renames if
4829 the CURRENT_BLOCK corresponds to a function which symbol name
4830 has been changed by an "Export" pragma. As a consequence,
4831 the user will be unable to print such rename entities. */
4834 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4835 int nsyms, const struct block *current_block)
4837 struct symbol *current_function;
4838 const char *current_function_name;
4840 int is_new_style_renaming;
4842 /* If there is both a renaming foo___XR... encoded as a variable and
4843 a simple variable foo in the same block, discard the latter.
4844 First, zero out such symbols, then compress. */
4845 is_new_style_renaming = 0;
4846 for (i = 0; i < nsyms; i += 1)
4848 struct symbol *sym = syms[i].sym;
4849 const struct block *block = syms[i].block;
4853 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4855 name = SYMBOL_LINKAGE_NAME (sym);
4856 suffix = strstr (name, "___XR");
4860 int name_len = suffix - name;
4863 is_new_style_renaming = 1;
4864 for (j = 0; j < nsyms; j += 1)
4865 if (i != j && syms[j].sym != NULL
4866 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4868 && block == syms[j].block)
4872 if (is_new_style_renaming)
4876 for (j = k = 0; j < nsyms; j += 1)
4877 if (syms[j].sym != NULL)
4885 /* Extract the function name associated to CURRENT_BLOCK.
4886 Abort if unable to do so. */
4888 if (current_block == NULL)
4891 current_function = block_linkage_function (current_block);
4892 if (current_function == NULL)
4895 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4896 if (current_function_name == NULL)
4899 /* Check each of the symbols, and remove it from the list if it is
4900 a type corresponding to a renaming that is out of the scope of
4901 the current block. */
4906 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4907 == ADA_OBJECT_RENAMING
4908 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4912 for (j = i + 1; j < nsyms; j += 1)
4913 syms[j - 1] = syms[j];
4923 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4924 whose name and domain match NAME and DOMAIN respectively.
4925 If no match was found, then extend the search to "enclosing"
4926 routines (in other words, if we're inside a nested function,
4927 search the symbols defined inside the enclosing functions).
4928 If WILD_MATCH_P is nonzero, perform the naming matching in
4929 "wild" mode (see function "wild_match" for more info).
4931 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4934 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4935 const struct block *block, domain_enum domain,
4938 int block_depth = 0;
4940 while (block != NULL)
4943 ada_add_block_symbols (obstackp, block, name, domain, NULL,
4946 /* If we found a non-function match, assume that's the one. */
4947 if (is_nonfunction (defns_collected (obstackp, 0),
4948 num_defns_collected (obstackp)))
4951 block = BLOCK_SUPERBLOCK (block);
4954 /* If no luck so far, try to find NAME as a local symbol in some lexically
4955 enclosing subprogram. */
4956 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4957 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match_p);
4960 /* An object of this type is used as the user_data argument when
4961 calling the map_matching_symbols method. */
4965 struct objfile *objfile;
4966 struct obstack *obstackp;
4967 struct symbol *arg_sym;
4971 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4972 to a list of symbols. DATA0 is a pointer to a struct match_data *
4973 containing the obstack that collects the symbol list, the file that SYM
4974 must come from, a flag indicating whether a non-argument symbol has
4975 been found in the current block, and the last argument symbol
4976 passed in SYM within the current block (if any). When SYM is null,
4977 marking the end of a block, the argument symbol is added if no
4978 other has been found. */
4981 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
4983 struct match_data *data = (struct match_data *) data0;
4987 if (!data->found_sym && data->arg_sym != NULL)
4988 add_defn_to_vec (data->obstackp,
4989 fixup_symbol_section (data->arg_sym, data->objfile),
4991 data->found_sym = 0;
4992 data->arg_sym = NULL;
4996 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4998 else if (SYMBOL_IS_ARGUMENT (sym))
4999 data->arg_sym = sym;
5002 data->found_sym = 1;
5003 add_defn_to_vec (data->obstackp,
5004 fixup_symbol_section (sym, data->objfile),
5011 /* Implements compare_names, but only applying the comparision using
5012 the given CASING. */
5015 compare_names_with_case (const char *string1, const char *string2,
5016 enum case_sensitivity casing)
5018 while (*string1 != '\0' && *string2 != '\0')
5022 if (isspace (*string1) || isspace (*string2))
5023 return strcmp_iw_ordered (string1, string2);
5025 if (casing == case_sensitive_off)
5027 c1 = tolower (*string1);
5028 c2 = tolower (*string2);
5045 return strcmp_iw_ordered (string1, string2);
5047 if (*string2 == '\0')
5049 if (is_name_suffix (string1))
5056 if (*string2 == '(')
5057 return strcmp_iw_ordered (string1, string2);
5060 if (casing == case_sensitive_off)
5061 return tolower (*string1) - tolower (*string2);
5063 return *string1 - *string2;
5068 /* Compare STRING1 to STRING2, with results as for strcmp.
5069 Compatible with strcmp_iw_ordered in that...
5071 strcmp_iw_ordered (STRING1, STRING2) <= 0
5075 compare_names (STRING1, STRING2) <= 0
5077 (they may differ as to what symbols compare equal). */
5080 compare_names (const char *string1, const char *string2)
5084 /* Similar to what strcmp_iw_ordered does, we need to perform
5085 a case-insensitive comparison first, and only resort to
5086 a second, case-sensitive, comparison if the first one was
5087 not sufficient to differentiate the two strings. */
5089 result = compare_names_with_case (string1, string2, case_sensitive_off);
5091 result = compare_names_with_case (string1, string2, case_sensitive_on);
5096 /* Add to OBSTACKP all non-local symbols whose name and domain match
5097 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5098 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5101 add_nonlocal_symbols (struct obstack *obstackp, const char *name,
5102 domain_enum domain, int global,
5105 struct objfile *objfile;
5106 struct match_data data;
5108 memset (&data, 0, sizeof data);
5109 data.obstackp = obstackp;
5111 ALL_OBJFILES (objfile)
5113 data.objfile = objfile;
5116 objfile->sf->qf->map_matching_symbols (objfile, name, domain, global,
5117 aux_add_nonlocal_symbols, &data,
5120 objfile->sf->qf->map_matching_symbols (objfile, name, domain, global,
5121 aux_add_nonlocal_symbols, &data,
5122 full_match, compare_names);
5125 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5127 ALL_OBJFILES (objfile)
5129 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
5130 strcpy (name1, "_ada_");
5131 strcpy (name1 + sizeof ("_ada_") - 1, name);
5132 data.objfile = objfile;
5133 objfile->sf->qf->map_matching_symbols (objfile, name1, domain,
5135 aux_add_nonlocal_symbols,
5137 full_match, compare_names);
5142 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5143 non-zero, enclosing scope and in global scopes, returning the number of
5145 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5146 indicating the symbols found and the blocks and symbol tables (if
5147 any) in which they were found. This vector is transient---good only to
5148 the next call of ada_lookup_symbol_list.
5150 When full_search is non-zero, any non-function/non-enumeral
5151 symbol match within the nest of blocks whose innermost member is BLOCK0,
5152 is the one match returned (no other matches in that or
5153 enclosing blocks is returned). If there are any matches in or
5154 surrounding BLOCK0, then these alone are returned.
5156 Names prefixed with "standard__" are handled specially: "standard__"
5157 is first stripped off, and only static and global symbols are searched. */
5160 ada_lookup_symbol_list_worker (const char *name0, const struct block *block0,
5161 domain_enum namespace,
5162 struct ada_symbol_info **results,
5166 const struct block *block;
5168 const int wild_match_p = should_use_wild_match (name0);
5172 obstack_free (&symbol_list_obstack, NULL);
5173 obstack_init (&symbol_list_obstack);
5177 /* Search specified block and its superiors. */
5182 /* Special case: If the user specifies a symbol name inside package
5183 Standard, do a non-wild matching of the symbol name without
5184 the "standard__" prefix. This was primarily introduced in order
5185 to allow the user to specifically access the standard exceptions
5186 using, for instance, Standard.Constraint_Error when Constraint_Error
5187 is ambiguous (due to the user defining its own Constraint_Error
5188 entity inside its program). */
5189 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
5192 name = name0 + sizeof ("standard__") - 1;
5195 /* Check the non-global symbols. If we have ANY match, then we're done. */
5201 ada_add_local_symbols (&symbol_list_obstack, name, block,
5202 namespace, wild_match_p);
5206 /* In the !full_search case we're are being called by
5207 ada_iterate_over_symbols, and we don't want to search
5209 ada_add_block_symbols (&symbol_list_obstack, block, name,
5210 namespace, NULL, wild_match_p);
5212 if (num_defns_collected (&symbol_list_obstack) > 0 || !full_search)
5216 /* No non-global symbols found. Check our cache to see if we have
5217 already performed this search before. If we have, then return
5221 if (lookup_cached_symbol (name0, namespace, &sym, &block))
5224 add_defn_to_vec (&symbol_list_obstack, sym, block);
5228 /* Search symbols from all global blocks. */
5230 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
5233 /* Now add symbols from all per-file blocks if we've gotten no hits
5234 (not strictly correct, but perhaps better than an error). */
5236 if (num_defns_collected (&symbol_list_obstack) == 0)
5237 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
5241 ndefns = num_defns_collected (&symbol_list_obstack);
5242 *results = defns_collected (&symbol_list_obstack, 1);
5244 ndefns = remove_extra_symbols (*results, ndefns);
5246 if (ndefns == 0 && full_search)
5247 cache_symbol (name0, namespace, NULL, NULL);
5249 if (ndefns == 1 && full_search && cacheIfUnique)
5250 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
5252 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
5257 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5258 in global scopes, returning the number of matches, and setting *RESULTS
5259 to a vector of (SYM,BLOCK) tuples.
5260 See ada_lookup_symbol_list_worker for further details. */
5263 ada_lookup_symbol_list (const char *name0, const struct block *block0,
5264 domain_enum domain, struct ada_symbol_info **results)
5266 return ada_lookup_symbol_list_worker (name0, block0, domain, results, 1);
5269 /* Implementation of the la_iterate_over_symbols method. */
5272 ada_iterate_over_symbols (const struct block *block,
5273 const char *name, domain_enum domain,
5274 symbol_found_callback_ftype *callback,
5278 struct ada_symbol_info *results;
5280 ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0);
5281 for (i = 0; i < ndefs; ++i)
5283 if (! (*callback) (results[i].sym, data))
5288 /* If NAME is the name of an entity, return a string that should
5289 be used to look that entity up in Ada units. This string should
5290 be deallocated after use using xfree.
5292 NAME can have any form that the "break" or "print" commands might
5293 recognize. In other words, it does not have to be the "natural"
5294 name, or the "encoded" name. */
5297 ada_name_for_lookup (const char *name)
5300 int nlen = strlen (name);
5302 if (name[0] == '<' && name[nlen - 1] == '>')
5304 canon = xmalloc (nlen - 1);
5305 memcpy (canon, name + 1, nlen - 2);
5306 canon[nlen - 2] = '\0';
5309 canon = xstrdup (ada_encode (ada_fold_name (name)));
5313 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5314 to 1, but choosing the first symbol found if there are multiple
5317 The result is stored in *INFO, which must be non-NULL.
5318 If no match is found, INFO->SYM is set to NULL. */
5321 ada_lookup_encoded_symbol (const char *name, const struct block *block,
5322 domain_enum namespace,
5323 struct ada_symbol_info *info)
5325 struct ada_symbol_info *candidates;
5328 gdb_assert (info != NULL);
5329 memset (info, 0, sizeof (struct ada_symbol_info));
5331 n_candidates = ada_lookup_symbol_list (name, block, namespace, &candidates);
5332 if (n_candidates == 0)
5335 *info = candidates[0];
5336 info->sym = fixup_symbol_section (info->sym, NULL);
5339 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5340 scope and in global scopes, or NULL if none. NAME is folded and
5341 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5342 choosing the first symbol if there are multiple choices.
5343 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5346 ada_lookup_symbol (const char *name, const struct block *block0,
5347 domain_enum namespace, int *is_a_field_of_this)
5349 struct ada_symbol_info info;
5351 if (is_a_field_of_this != NULL)
5352 *is_a_field_of_this = 0;
5354 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
5355 block0, namespace, &info);
5359 static struct symbol *
5360 ada_lookup_symbol_nonlocal (const char *name,
5361 const struct block *block,
5362 const domain_enum domain)
5364 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5368 /* True iff STR is a possible encoded suffix of a normal Ada name
5369 that is to be ignored for matching purposes. Suffixes of parallel
5370 names (e.g., XVE) are not included here. Currently, the possible suffixes
5371 are given by any of the regular expressions:
5373 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5374 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5375 TKB [subprogram suffix for task bodies]
5376 _E[0-9]+[bs]$ [protected object entry suffixes]
5377 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5379 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5380 match is performed. This sequence is used to differentiate homonyms,
5381 is an optional part of a valid name suffix. */
5384 is_name_suffix (const char *str)
5387 const char *matching;
5388 const int len = strlen (str);
5390 /* Skip optional leading __[0-9]+. */
5392 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5395 while (isdigit (str[0]))
5401 if (str[0] == '.' || str[0] == '$')
5404 while (isdigit (matching[0]))
5406 if (matching[0] == '\0')
5412 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5415 while (isdigit (matching[0]))
5417 if (matching[0] == '\0')
5421 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5423 if (strcmp (str, "TKB") == 0)
5427 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5428 with a N at the end. Unfortunately, the compiler uses the same
5429 convention for other internal types it creates. So treating
5430 all entity names that end with an "N" as a name suffix causes
5431 some regressions. For instance, consider the case of an enumerated
5432 type. To support the 'Image attribute, it creates an array whose
5434 Having a single character like this as a suffix carrying some
5435 information is a bit risky. Perhaps we should change the encoding
5436 to be something like "_N" instead. In the meantime, do not do
5437 the following check. */
5438 /* Protected Object Subprograms */
5439 if (len == 1 && str [0] == 'N')
5444 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
5447 while (isdigit (matching[0]))
5449 if ((matching[0] == 'b' || matching[0] == 's')
5450 && matching [1] == '\0')
5454 /* ??? We should not modify STR directly, as we are doing below. This
5455 is fine in this case, but may become problematic later if we find
5456 that this alternative did not work, and want to try matching
5457 another one from the begining of STR. Since we modified it, we
5458 won't be able to find the begining of the string anymore! */
5462 while (str[0] != '_' && str[0] != '\0')
5464 if (str[0] != 'n' && str[0] != 'b')
5470 if (str[0] == '\000')
5475 if (str[1] != '_' || str[2] == '\000')
5479 if (strcmp (str + 3, "JM") == 0)
5481 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5482 the LJM suffix in favor of the JM one. But we will
5483 still accept LJM as a valid suffix for a reasonable
5484 amount of time, just to allow ourselves to debug programs
5485 compiled using an older version of GNAT. */
5486 if (strcmp (str + 3, "LJM") == 0)
5490 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5491 || str[4] == 'U' || str[4] == 'P')
5493 if (str[4] == 'R' && str[5] != 'T')
5497 if (!isdigit (str[2]))
5499 for (k = 3; str[k] != '\0'; k += 1)
5500 if (!isdigit (str[k]) && str[k] != '_')
5504 if (str[0] == '$' && isdigit (str[1]))
5506 for (k = 2; str[k] != '\0'; k += 1)
5507 if (!isdigit (str[k]) && str[k] != '_')
5514 /* Return non-zero if the string starting at NAME and ending before
5515 NAME_END contains no capital letters. */
5518 is_valid_name_for_wild_match (const char *name0)
5520 const char *decoded_name = ada_decode (name0);
5523 /* If the decoded name starts with an angle bracket, it means that
5524 NAME0 does not follow the GNAT encoding format. It should then
5525 not be allowed as a possible wild match. */
5526 if (decoded_name[0] == '<')
5529 for (i=0; decoded_name[i] != '\0'; i++)
5530 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5536 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5537 that could start a simple name. Assumes that *NAMEP points into
5538 the string beginning at NAME0. */
5541 advance_wild_match (const char **namep, const char *name0, int target0)
5543 const char *name = *namep;
5553 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5556 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5561 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5562 || name[2] == target0))
5570 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5580 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5581 informational suffixes of NAME (i.e., for which is_name_suffix is
5582 true). Assumes that PATN is a lower-cased Ada simple name. */
5585 wild_match (const char *name, const char *patn)
5588 const char *name0 = name;
5592 const char *match = name;
5596 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5599 if (*p == '\0' && is_name_suffix (name))
5600 return match != name0 && !is_valid_name_for_wild_match (name0);
5602 if (name[-1] == '_')
5605 if (!advance_wild_match (&name, name0, *patn))
5610 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5611 informational suffix. */
5614 full_match (const char *sym_name, const char *search_name)
5616 return !match_name (sym_name, search_name, 0);
5620 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5621 vector *defn_symbols, updating the list of symbols in OBSTACKP
5622 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5623 OBJFILE is the section containing BLOCK. */
5626 ada_add_block_symbols (struct obstack *obstackp,
5627 const struct block *block, const char *name,
5628 domain_enum domain, struct objfile *objfile,
5631 struct block_iterator iter;
5632 int name_len = strlen (name);
5633 /* A matching argument symbol, if any. */
5634 struct symbol *arg_sym;
5635 /* Set true when we find a matching non-argument symbol. */
5643 for (sym = block_iter_match_first (block, name, wild_match, &iter);
5644 sym != NULL; sym = block_iter_match_next (name, wild_match, &iter))
5646 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5647 SYMBOL_DOMAIN (sym), domain)
5648 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
5650 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5652 else if (SYMBOL_IS_ARGUMENT (sym))
5657 add_defn_to_vec (obstackp,
5658 fixup_symbol_section (sym, objfile),
5666 for (sym = block_iter_match_first (block, name, full_match, &iter);
5667 sym != NULL; sym = block_iter_match_next (name, full_match, &iter))
5669 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5670 SYMBOL_DOMAIN (sym), domain))
5672 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5674 if (SYMBOL_IS_ARGUMENT (sym))
5679 add_defn_to_vec (obstackp,
5680 fixup_symbol_section (sym, objfile),
5688 if (!found_sym && arg_sym != NULL)
5690 add_defn_to_vec (obstackp,
5691 fixup_symbol_section (arg_sym, objfile),
5700 ALL_BLOCK_SYMBOLS (block, iter, sym)
5702 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5703 SYMBOL_DOMAIN (sym), domain))
5707 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5710 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5712 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5717 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5719 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5721 if (SYMBOL_IS_ARGUMENT (sym))
5726 add_defn_to_vec (obstackp,
5727 fixup_symbol_section (sym, objfile),
5735 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5736 They aren't parameters, right? */
5737 if (!found_sym && arg_sym != NULL)
5739 add_defn_to_vec (obstackp,
5740 fixup_symbol_section (arg_sym, objfile),
5747 /* Symbol Completion */
5749 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5750 name in a form that's appropriate for the completion. The result
5751 does not need to be deallocated, but is only good until the next call.
5753 TEXT_LEN is equal to the length of TEXT.
5754 Perform a wild match if WILD_MATCH_P is set.
5755 ENCODED_P should be set if TEXT represents the start of a symbol name
5756 in its encoded form. */
5759 symbol_completion_match (const char *sym_name,
5760 const char *text, int text_len,
5761 int wild_match_p, int encoded_p)
5763 const int verbatim_match = (text[0] == '<');
5768 /* Strip the leading angle bracket. */
5773 /* First, test against the fully qualified name of the symbol. */
5775 if (strncmp (sym_name, text, text_len) == 0)
5778 if (match && !encoded_p)
5780 /* One needed check before declaring a positive match is to verify
5781 that iff we are doing a verbatim match, the decoded version
5782 of the symbol name starts with '<'. Otherwise, this symbol name
5783 is not a suitable completion. */
5784 const char *sym_name_copy = sym_name;
5785 int has_angle_bracket;
5787 sym_name = ada_decode (sym_name);
5788 has_angle_bracket = (sym_name[0] == '<');
5789 match = (has_angle_bracket == verbatim_match);
5790 sym_name = sym_name_copy;
5793 if (match && !verbatim_match)
5795 /* When doing non-verbatim match, another check that needs to
5796 be done is to verify that the potentially matching symbol name
5797 does not include capital letters, because the ada-mode would
5798 not be able to understand these symbol names without the
5799 angle bracket notation. */
5802 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5807 /* Second: Try wild matching... */
5809 if (!match && wild_match_p)
5811 /* Since we are doing wild matching, this means that TEXT
5812 may represent an unqualified symbol name. We therefore must
5813 also compare TEXT against the unqualified name of the symbol. */
5814 sym_name = ada_unqualified_name (ada_decode (sym_name));
5816 if (strncmp (sym_name, text, text_len) == 0)
5820 /* Finally: If we found a mach, prepare the result to return. */
5826 sym_name = add_angle_brackets (sym_name);
5829 sym_name = ada_decode (sym_name);
5834 /* A companion function to ada_make_symbol_completion_list().
5835 Check if SYM_NAME represents a symbol which name would be suitable
5836 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5837 it is appended at the end of the given string vector SV.
5839 ORIG_TEXT is the string original string from the user command
5840 that needs to be completed. WORD is the entire command on which
5841 completion should be performed. These two parameters are used to
5842 determine which part of the symbol name should be added to the
5844 if WILD_MATCH_P is set, then wild matching is performed.
5845 ENCODED_P should be set if TEXT represents a symbol name in its
5846 encoded formed (in which case the completion should also be
5850 symbol_completion_add (VEC(char_ptr) **sv,
5851 const char *sym_name,
5852 const char *text, int text_len,
5853 const char *orig_text, const char *word,
5854 int wild_match_p, int encoded_p)
5856 const char *match = symbol_completion_match (sym_name, text, text_len,
5857 wild_match_p, encoded_p);
5863 /* We found a match, so add the appropriate completion to the given
5866 if (word == orig_text)
5868 completion = xmalloc (strlen (match) + 5);
5869 strcpy (completion, match);
5871 else if (word > orig_text)
5873 /* Return some portion of sym_name. */
5874 completion = xmalloc (strlen (match) + 5);
5875 strcpy (completion, match + (word - orig_text));
5879 /* Return some of ORIG_TEXT plus sym_name. */
5880 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5881 strncpy (completion, word, orig_text - word);
5882 completion[orig_text - word] = '\0';
5883 strcat (completion, match);
5886 VEC_safe_push (char_ptr, *sv, completion);
5889 /* An object of this type is passed as the user_data argument to the
5890 expand_symtabs_matching method. */
5891 struct add_partial_datum
5893 VEC(char_ptr) **completions;
5902 /* A callback for expand_symtabs_matching. */
5905 ada_complete_symbol_matcher (const char *name, void *user_data)
5907 struct add_partial_datum *data = user_data;
5909 return symbol_completion_match (name, data->text, data->text_len,
5910 data->wild_match, data->encoded) != NULL;
5913 /* Return a list of possible symbol names completing TEXT0. WORD is
5914 the entire command on which completion is made. */
5916 static VEC (char_ptr) *
5917 ada_make_symbol_completion_list (const char *text0, const char *word,
5918 enum type_code code)
5924 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5927 struct minimal_symbol *msymbol;
5928 struct objfile *objfile;
5929 struct block *b, *surrounding_static_block = 0;
5931 struct block_iterator iter;
5932 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
5934 gdb_assert (code == TYPE_CODE_UNDEF);
5936 if (text0[0] == '<')
5938 text = xstrdup (text0);
5939 make_cleanup (xfree, text);
5940 text_len = strlen (text);
5946 text = xstrdup (ada_encode (text0));
5947 make_cleanup (xfree, text);
5948 text_len = strlen (text);
5949 for (i = 0; i < text_len; i++)
5950 text[i] = tolower (text[i]);
5952 encoded_p = (strstr (text0, "__") != NULL);
5953 /* If the name contains a ".", then the user is entering a fully
5954 qualified entity name, and the match must not be done in wild
5955 mode. Similarly, if the user wants to complete what looks like
5956 an encoded name, the match must not be done in wild mode. */
5957 wild_match_p = (strchr (text0, '.') == NULL && !encoded_p);
5960 /* First, look at the partial symtab symbols. */
5962 struct add_partial_datum data;
5964 data.completions = &completions;
5966 data.text_len = text_len;
5969 data.wild_match = wild_match_p;
5970 data.encoded = encoded_p;
5971 expand_symtabs_matching (NULL, ada_complete_symbol_matcher, ALL_DOMAIN,
5975 /* At this point scan through the misc symbol vectors and add each
5976 symbol you find to the list. Eventually we want to ignore
5977 anything that isn't a text symbol (everything else will be
5978 handled by the psymtab code above). */
5980 ALL_MSYMBOLS (objfile, msymbol)
5983 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5984 text, text_len, text0, word, wild_match_p,
5988 /* Search upwards from currently selected frame (so that we can
5989 complete on local vars. */
5991 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5993 if (!BLOCK_SUPERBLOCK (b))
5994 surrounding_static_block = b; /* For elmin of dups */
5996 ALL_BLOCK_SYMBOLS (b, iter, sym)
5998 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5999 text, text_len, text0, word,
6000 wild_match_p, encoded_p);
6004 /* Go through the symtabs and check the externs and statics for
6005 symbols which match. */
6007 ALL_SYMTABS (objfile, s)
6010 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
6011 ALL_BLOCK_SYMBOLS (b, iter, sym)
6013 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
6014 text, text_len, text0, word,
6015 wild_match_p, encoded_p);
6019 ALL_SYMTABS (objfile, s)
6022 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
6023 /* Don't do this block twice. */
6024 if (b == surrounding_static_block)
6026 ALL_BLOCK_SYMBOLS (b, iter, sym)
6028 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
6029 text, text_len, text0, word,
6030 wild_match_p, encoded_p);
6034 do_cleanups (old_chain);
6040 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6041 for tagged types. */
6044 ada_is_dispatch_table_ptr_type (struct type *type)
6048 if (TYPE_CODE (type) != TYPE_CODE_PTR)
6051 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
6055 return (strcmp (name, "ada__tags__dispatch_table") == 0);
6058 /* Return non-zero if TYPE is an interface tag. */
6061 ada_is_interface_tag (struct type *type)
6063 const char *name = TYPE_NAME (type);
6068 return (strcmp (name, "ada__tags__interface_tag") == 0);
6071 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6072 to be invisible to users. */
6075 ada_is_ignored_field (struct type *type, int field_num)
6077 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
6080 /* Check the name of that field. */
6082 const char *name = TYPE_FIELD_NAME (type, field_num);
6084 /* Anonymous field names should not be printed.
6085 brobecker/2007-02-20: I don't think this can actually happen
6086 but we don't want to print the value of annonymous fields anyway. */
6090 /* Normally, fields whose name start with an underscore ("_")
6091 are fields that have been internally generated by the compiler,
6092 and thus should not be printed. The "_parent" field is special,
6093 however: This is a field internally generated by the compiler
6094 for tagged types, and it contains the components inherited from
6095 the parent type. This field should not be printed as is, but
6096 should not be ignored either. */
6097 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
6101 /* If this is the dispatch table of a tagged type or an interface tag,
6103 if (ada_is_tagged_type (type, 1)
6104 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num))
6105 || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num))))
6108 /* Not a special field, so it should not be ignored. */
6112 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6113 pointer or reference type whose ultimate target has a tag field. */
6116 ada_is_tagged_type (struct type *type, int refok)
6118 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
6121 /* True iff TYPE represents the type of X'Tag */
6124 ada_is_tag_type (struct type *type)
6126 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
6130 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
6132 return (name != NULL
6133 && strcmp (name, "ada__tags__dispatch_table") == 0);
6137 /* The type of the tag on VAL. */
6140 ada_tag_type (struct value *val)
6142 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
6145 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6146 retired at Ada 05). */
6149 is_ada95_tag (struct value *tag)
6151 return ada_value_struct_elt (tag, "tsd", 1) != NULL;
6154 /* The value of the tag on VAL. */
6157 ada_value_tag (struct value *val)
6159 return ada_value_struct_elt (val, "_tag", 0);
6162 /* The value of the tag on the object of type TYPE whose contents are
6163 saved at VALADDR, if it is non-null, or is at memory address
6166 static struct value *
6167 value_tag_from_contents_and_address (struct type *type,
6168 const gdb_byte *valaddr,
6171 int tag_byte_offset;
6172 struct type *tag_type;
6174 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
6177 const gdb_byte *valaddr1 = ((valaddr == NULL)
6179 : valaddr + tag_byte_offset);
6180 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
6182 return value_from_contents_and_address (tag_type, valaddr1, address1);
6187 static struct type *
6188 type_from_tag (struct value *tag)
6190 const char *type_name = ada_tag_name (tag);
6192 if (type_name != NULL)
6193 return ada_find_any_type (ada_encode (type_name));
6197 /* Given a value OBJ of a tagged type, return a value of this
6198 type at the base address of the object. The base address, as
6199 defined in Ada.Tags, it is the address of the primary tag of
6200 the object, and therefore where the field values of its full
6201 view can be fetched. */
6204 ada_tag_value_at_base_address (struct value *obj)
6206 volatile struct gdb_exception e;
6208 LONGEST offset_to_top = 0;
6209 struct type *ptr_type, *obj_type;
6211 CORE_ADDR base_address;
6213 obj_type = value_type (obj);
6215 /* It is the responsability of the caller to deref pointers. */
6217 if (TYPE_CODE (obj_type) == TYPE_CODE_PTR
6218 || TYPE_CODE (obj_type) == TYPE_CODE_REF)
6221 tag = ada_value_tag (obj);
6225 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6227 if (is_ada95_tag (tag))
6230 ptr_type = builtin_type (target_gdbarch ())->builtin_data_ptr;
6231 ptr_type = lookup_pointer_type (ptr_type);
6232 val = value_cast (ptr_type, tag);
6236 /* It is perfectly possible that an exception be raised while
6237 trying to determine the base address, just like for the tag;
6238 see ada_tag_name for more details. We do not print the error
6239 message for the same reason. */
6241 TRY_CATCH (e, RETURN_MASK_ERROR)
6243 offset_to_top = value_as_long (value_ind (value_ptradd (val, -2)));
6249 /* If offset is null, nothing to do. */
6251 if (offset_to_top == 0)
6254 /* -1 is a special case in Ada.Tags; however, what should be done
6255 is not quite clear from the documentation. So do nothing for
6258 if (offset_to_top == -1)
6261 base_address = value_address (obj) - offset_to_top;
6262 tag = value_tag_from_contents_and_address (obj_type, NULL, base_address);
6264 /* Make sure that we have a proper tag at the new address.
6265 Otherwise, offset_to_top is bogus (which can happen when
6266 the object is not initialized yet). */
6271 obj_type = type_from_tag (tag);
6276 return value_from_contents_and_address (obj_type, NULL, base_address);
6279 /* Return the "ada__tags__type_specific_data" type. */
6281 static struct type *
6282 ada_get_tsd_type (struct inferior *inf)
6284 struct ada_inferior_data *data = get_ada_inferior_data (inf);
6286 if (data->tsd_type == 0)
6287 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6288 return data->tsd_type;
6291 /* Return the TSD (type-specific data) associated to the given TAG.
6292 TAG is assumed to be the tag of a tagged-type entity.
6294 May return NULL if we are unable to get the TSD. */
6296 static struct value *
6297 ada_get_tsd_from_tag (struct value *tag)
6302 /* First option: The TSD is simply stored as a field of our TAG.
6303 Only older versions of GNAT would use this format, but we have
6304 to test it first, because there are no visible markers for
6305 the current approach except the absence of that field. */
6307 val = ada_value_struct_elt (tag, "tsd", 1);
6311 /* Try the second representation for the dispatch table (in which
6312 there is no explicit 'tsd' field in the referent of the tag pointer,
6313 and instead the tsd pointer is stored just before the dispatch
6316 type = ada_get_tsd_type (current_inferior());
6319 type = lookup_pointer_type (lookup_pointer_type (type));
6320 val = value_cast (type, tag);
6323 return value_ind (value_ptradd (val, -1));
6326 /* Given the TSD of a tag (type-specific data), return a string
6327 containing the name of the associated type.
6329 The returned value is good until the next call. May return NULL
6330 if we are unable to determine the tag name. */
6333 ada_tag_name_from_tsd (struct value *tsd)
6335 static char name[1024];
6339 val = ada_value_struct_elt (tsd, "expanded_name", 1);
6342 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6343 for (p = name; *p != '\0'; p += 1)
6349 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6352 Return NULL if the TAG is not an Ada tag, or if we were unable to
6353 determine the name of that tag. The result is good until the next
6357 ada_tag_name (struct value *tag)
6359 volatile struct gdb_exception e;
6362 if (!ada_is_tag_type (value_type (tag)))
6365 /* It is perfectly possible that an exception be raised while trying
6366 to determine the TAG's name, even under normal circumstances:
6367 The associated variable may be uninitialized or corrupted, for
6368 instance. We do not let any exception propagate past this point.
6369 instead we return NULL.
6371 We also do not print the error message either (which often is very
6372 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6373 the caller print a more meaningful message if necessary. */
6374 TRY_CATCH (e, RETURN_MASK_ERROR)
6376 struct value *tsd = ada_get_tsd_from_tag (tag);
6379 name = ada_tag_name_from_tsd (tsd);
6385 /* The parent type of TYPE, or NULL if none. */
6388 ada_parent_type (struct type *type)
6392 type = ada_check_typedef (type);
6394 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6397 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6398 if (ada_is_parent_field (type, i))
6400 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6402 /* If the _parent field is a pointer, then dereference it. */
6403 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6404 parent_type = TYPE_TARGET_TYPE (parent_type);
6405 /* If there is a parallel XVS type, get the actual base type. */
6406 parent_type = ada_get_base_type (parent_type);
6408 return ada_check_typedef (parent_type);
6414 /* True iff field number FIELD_NUM of structure type TYPE contains the
6415 parent-type (inherited) fields of a derived type. Assumes TYPE is
6416 a structure type with at least FIELD_NUM+1 fields. */
6419 ada_is_parent_field (struct type *type, int field_num)
6421 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6423 return (name != NULL
6424 && (strncmp (name, "PARENT", 6) == 0
6425 || strncmp (name, "_parent", 7) == 0));
6428 /* True iff field number FIELD_NUM of structure type TYPE is a
6429 transparent wrapper field (which should be silently traversed when doing
6430 field selection and flattened when printing). Assumes TYPE is a
6431 structure type with at least FIELD_NUM+1 fields. Such fields are always
6435 ada_is_wrapper_field (struct type *type, int field_num)
6437 const char *name = TYPE_FIELD_NAME (type, field_num);
6439 return (name != NULL
6440 && (strncmp (name, "PARENT", 6) == 0
6441 || strcmp (name, "REP") == 0
6442 || strncmp (name, "_parent", 7) == 0
6443 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6446 /* True iff field number FIELD_NUM of structure or union type TYPE
6447 is a variant wrapper. Assumes TYPE is a structure type with at least
6448 FIELD_NUM+1 fields. */
6451 ada_is_variant_part (struct type *type, int field_num)
6453 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6455 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6456 || (is_dynamic_field (type, field_num)
6457 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6458 == TYPE_CODE_UNION)));
6461 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6462 whose discriminants are contained in the record type OUTER_TYPE,
6463 returns the type of the controlling discriminant for the variant.
6464 May return NULL if the type could not be found. */
6467 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6469 char *name = ada_variant_discrim_name (var_type);
6471 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
6474 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6475 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6476 represents a 'when others' clause; otherwise 0. */
6479 ada_is_others_clause (struct type *type, int field_num)
6481 const char *name = TYPE_FIELD_NAME (type, field_num);
6483 return (name != NULL && name[0] == 'O');
6486 /* Assuming that TYPE0 is the type of the variant part of a record,
6487 returns the name of the discriminant controlling the variant.
6488 The value is valid until the next call to ada_variant_discrim_name. */
6491 ada_variant_discrim_name (struct type *type0)
6493 static char *result = NULL;
6494 static size_t result_len = 0;
6497 const char *discrim_end;
6498 const char *discrim_start;
6500 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
6501 type = TYPE_TARGET_TYPE (type0);
6505 name = ada_type_name (type);
6507 if (name == NULL || name[0] == '\000')
6510 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
6513 if (strncmp (discrim_end, "___XVN", 6) == 0)
6516 if (discrim_end == name)
6519 for (discrim_start = discrim_end; discrim_start != name + 3;
6522 if (discrim_start == name + 1)
6524 if ((discrim_start > name + 3
6525 && strncmp (discrim_start - 3, "___", 3) == 0)
6526 || discrim_start[-1] == '.')
6530 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
6531 strncpy (result, discrim_start, discrim_end - discrim_start);
6532 result[discrim_end - discrim_start] = '\0';
6536 /* Scan STR for a subtype-encoded number, beginning at position K.
6537 Put the position of the character just past the number scanned in
6538 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6539 Return 1 if there was a valid number at the given position, and 0
6540 otherwise. A "subtype-encoded" number consists of the absolute value
6541 in decimal, followed by the letter 'm' to indicate a negative number.
6542 Assumes 0m does not occur. */
6545 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
6549 if (!isdigit (str[k]))
6552 /* Do it the hard way so as not to make any assumption about
6553 the relationship of unsigned long (%lu scan format code) and
6556 while (isdigit (str[k]))
6558 RU = RU * 10 + (str[k] - '0');
6565 *R = (-(LONGEST) (RU - 1)) - 1;
6571 /* NOTE on the above: Technically, C does not say what the results of
6572 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6573 number representable as a LONGEST (although either would probably work
6574 in most implementations). When RU>0, the locution in the then branch
6575 above is always equivalent to the negative of RU. */
6582 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6583 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6584 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6587 ada_in_variant (LONGEST val, struct type *type, int field_num)
6589 const char *name = TYPE_FIELD_NAME (type, field_num);
6603 if (!ada_scan_number (name, p + 1, &W, &p))
6613 if (!ada_scan_number (name, p + 1, &L, &p)
6614 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6616 if (val >= L && val <= U)
6628 /* FIXME: Lots of redundancy below. Try to consolidate. */
6630 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6631 ARG_TYPE, extract and return the value of one of its (non-static)
6632 fields. FIELDNO says which field. Differs from value_primitive_field
6633 only in that it can handle packed values of arbitrary type. */
6635 static struct value *
6636 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
6637 struct type *arg_type)
6641 arg_type = ada_check_typedef (arg_type);
6642 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6644 /* Handle packed fields. */
6646 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6648 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6649 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
6651 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
6652 offset + bit_pos / 8,
6653 bit_pos % 8, bit_size, type);
6656 return value_primitive_field (arg1, offset, fieldno, arg_type);
6659 /* Find field with name NAME in object of type TYPE. If found,
6660 set the following for each argument that is non-null:
6661 - *FIELD_TYPE_P to the field's type;
6662 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6663 an object of that type;
6664 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6665 - *BIT_SIZE_P to its size in bits if the field is packed, and
6667 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6668 fields up to but not including the desired field, or by the total
6669 number of fields if not found. A NULL value of NAME never
6670 matches; the function just counts visible fields in this case.
6672 Returns 1 if found, 0 otherwise. */
6675 find_struct_field (const char *name, struct type *type, int offset,
6676 struct type **field_type_p,
6677 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6682 type = ada_check_typedef (type);
6684 if (field_type_p != NULL)
6685 *field_type_p = NULL;
6686 if (byte_offset_p != NULL)
6688 if (bit_offset_p != NULL)
6690 if (bit_size_p != NULL)
6693 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6695 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6696 int fld_offset = offset + bit_pos / 8;
6697 const char *t_field_name = TYPE_FIELD_NAME (type, i);
6699 if (t_field_name == NULL)
6702 else if (name != NULL && field_name_match (t_field_name, name))
6704 int bit_size = TYPE_FIELD_BITSIZE (type, i);
6706 if (field_type_p != NULL)
6707 *field_type_p = TYPE_FIELD_TYPE (type, i);
6708 if (byte_offset_p != NULL)
6709 *byte_offset_p = fld_offset;
6710 if (bit_offset_p != NULL)
6711 *bit_offset_p = bit_pos % 8;
6712 if (bit_size_p != NULL)
6713 *bit_size_p = bit_size;
6716 else if (ada_is_wrapper_field (type, i))
6718 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6719 field_type_p, byte_offset_p, bit_offset_p,
6720 bit_size_p, index_p))
6723 else if (ada_is_variant_part (type, i))
6725 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6728 struct type *field_type
6729 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6731 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6733 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6735 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6736 field_type_p, byte_offset_p,
6737 bit_offset_p, bit_size_p, index_p))
6741 else if (index_p != NULL)
6747 /* Number of user-visible fields in record type TYPE. */
6750 num_visible_fields (struct type *type)
6755 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6759 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6760 and search in it assuming it has (class) type TYPE.
6761 If found, return value, else return NULL.
6763 Searches recursively through wrapper fields (e.g., '_parent'). */
6765 static struct value *
6766 ada_search_struct_field (char *name, struct value *arg, int offset,
6771 type = ada_check_typedef (type);
6772 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6774 const char *t_field_name = TYPE_FIELD_NAME (type, i);
6776 if (t_field_name == NULL)
6779 else if (field_name_match (t_field_name, name))
6780 return ada_value_primitive_field (arg, offset, i, type);
6782 else if (ada_is_wrapper_field (type, i))
6784 struct value *v = /* Do not let indent join lines here. */
6785 ada_search_struct_field (name, arg,
6786 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6787 TYPE_FIELD_TYPE (type, i));
6793 else if (ada_is_variant_part (type, i))
6795 /* PNH: Do we ever get here? See find_struct_field. */
6797 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6799 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6801 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6803 struct value *v = ada_search_struct_field /* Force line
6806 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6807 TYPE_FIELD_TYPE (field_type, j));
6817 static struct value *ada_index_struct_field_1 (int *, struct value *,
6818 int, struct type *);
6821 /* Return field #INDEX in ARG, where the index is that returned by
6822 * find_struct_field through its INDEX_P argument. Adjust the address
6823 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6824 * If found, return value, else return NULL. */
6826 static struct value *
6827 ada_index_struct_field (int index, struct value *arg, int offset,
6830 return ada_index_struct_field_1 (&index, arg, offset, type);
6834 /* Auxiliary function for ada_index_struct_field. Like
6835 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6838 static struct value *
6839 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6843 type = ada_check_typedef (type);
6845 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6847 if (TYPE_FIELD_NAME (type, i) == NULL)
6849 else if (ada_is_wrapper_field (type, i))
6851 struct value *v = /* Do not let indent join lines here. */
6852 ada_index_struct_field_1 (index_p, arg,
6853 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6854 TYPE_FIELD_TYPE (type, i));
6860 else if (ada_is_variant_part (type, i))
6862 /* PNH: Do we ever get here? See ada_search_struct_field,
6863 find_struct_field. */
6864 error (_("Cannot assign this kind of variant record"));
6866 else if (*index_p == 0)
6867 return ada_value_primitive_field (arg, offset, i, type);
6874 /* Given ARG, a value of type (pointer or reference to a)*
6875 structure/union, extract the component named NAME from the ultimate
6876 target structure/union and return it as a value with its
6879 The routine searches for NAME among all members of the structure itself
6880 and (recursively) among all members of any wrapper members
6883 If NO_ERR, then simply return NULL in case of error, rather than
6887 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6889 struct type *t, *t1;
6893 t1 = t = ada_check_typedef (value_type (arg));
6894 if (TYPE_CODE (t) == TYPE_CODE_REF)
6896 t1 = TYPE_TARGET_TYPE (t);
6899 t1 = ada_check_typedef (t1);
6900 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6902 arg = coerce_ref (arg);
6907 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6909 t1 = TYPE_TARGET_TYPE (t);
6912 t1 = ada_check_typedef (t1);
6913 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6915 arg = value_ind (arg);
6922 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6926 v = ada_search_struct_field (name, arg, 0, t);
6929 int bit_offset, bit_size, byte_offset;
6930 struct type *field_type;
6933 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6934 address = value_address (ada_value_ind (arg));
6936 address = value_address (ada_coerce_ref (arg));
6938 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6939 if (find_struct_field (name, t1, 0,
6940 &field_type, &byte_offset, &bit_offset,
6945 if (TYPE_CODE (t) == TYPE_CODE_REF)
6946 arg = ada_coerce_ref (arg);
6948 arg = ada_value_ind (arg);
6949 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6950 bit_offset, bit_size,
6954 v = value_at_lazy (field_type, address + byte_offset);
6958 if (v != NULL || no_err)
6961 error (_("There is no member named %s."), name);
6967 error (_("Attempt to extract a component of "
6968 "a value that is not a record."));
6971 /* Given a type TYPE, look up the type of the component of type named NAME.
6972 If DISPP is non-null, add its byte displacement from the beginning of a
6973 structure (pointed to by a value) of type TYPE to *DISPP (does not
6974 work for packed fields).
6976 Matches any field whose name has NAME as a prefix, possibly
6979 TYPE can be either a struct or union. If REFOK, TYPE may also
6980 be a (pointer or reference)+ to a struct or union, and the
6981 ultimate target type will be searched.
6983 Looks recursively into variant clauses and parent types.
6985 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6986 TYPE is not a type of the right kind. */
6988 static struct type *
6989 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6990 int noerr, int *dispp)
6997 if (refok && type != NULL)
7000 type = ada_check_typedef (type);
7001 if (TYPE_CODE (type) != TYPE_CODE_PTR
7002 && TYPE_CODE (type) != TYPE_CODE_REF)
7004 type = TYPE_TARGET_TYPE (type);
7008 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
7009 && TYPE_CODE (type) != TYPE_CODE_UNION))
7015 target_terminal_ours ();
7016 gdb_flush (gdb_stdout);
7018 error (_("Type (null) is not a structure or union type"));
7021 /* XXX: type_sprint */
7022 fprintf_unfiltered (gdb_stderr, _("Type "));
7023 type_print (type, "", gdb_stderr, -1);
7024 error (_(" is not a structure or union type"));
7029 type = to_static_fixed_type (type);
7031 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7033 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7037 if (t_field_name == NULL)
7040 else if (field_name_match (t_field_name, name))
7043 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
7044 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
7047 else if (ada_is_wrapper_field (type, i))
7050 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
7055 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
7060 else if (ada_is_variant_part (type, i))
7063 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7066 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
7068 /* FIXME pnh 2008/01/26: We check for a field that is
7069 NOT wrapped in a struct, since the compiler sometimes
7070 generates these for unchecked variant types. Revisit
7071 if the compiler changes this practice. */
7072 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
7074 if (v_field_name != NULL
7075 && field_name_match (v_field_name, name))
7076 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
7078 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
7085 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
7096 target_terminal_ours ();
7097 gdb_flush (gdb_stdout);
7100 /* XXX: type_sprint */
7101 fprintf_unfiltered (gdb_stderr, _("Type "));
7102 type_print (type, "", gdb_stderr, -1);
7103 error (_(" has no component named <null>"));
7107 /* XXX: type_sprint */
7108 fprintf_unfiltered (gdb_stderr, _("Type "));
7109 type_print (type, "", gdb_stderr, -1);
7110 error (_(" has no component named %s"), name);
7117 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7118 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7119 represents an unchecked union (that is, the variant part of a
7120 record that is named in an Unchecked_Union pragma). */
7123 is_unchecked_variant (struct type *var_type, struct type *outer_type)
7125 char *discrim_name = ada_variant_discrim_name (var_type);
7127 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
7132 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7133 within a value of type OUTER_TYPE that is stored in GDB at
7134 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7135 numbering from 0) is applicable. Returns -1 if none are. */
7138 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
7139 const gdb_byte *outer_valaddr)
7143 char *discrim_name = ada_variant_discrim_name (var_type);
7144 struct value *outer;
7145 struct value *discrim;
7146 LONGEST discrim_val;
7148 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
7149 discrim = ada_value_struct_elt (outer, discrim_name, 1);
7150 if (discrim == NULL)
7152 discrim_val = value_as_long (discrim);
7155 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
7157 if (ada_is_others_clause (var_type, i))
7159 else if (ada_in_variant (discrim_val, var_type, i))
7163 return others_clause;
7168 /* Dynamic-Sized Records */
7170 /* Strategy: The type ostensibly attached to a value with dynamic size
7171 (i.e., a size that is not statically recorded in the debugging
7172 data) does not accurately reflect the size or layout of the value.
7173 Our strategy is to convert these values to values with accurate,
7174 conventional types that are constructed on the fly. */
7176 /* There is a subtle and tricky problem here. In general, we cannot
7177 determine the size of dynamic records without its data. However,
7178 the 'struct value' data structure, which GDB uses to represent
7179 quantities in the inferior process (the target), requires the size
7180 of the type at the time of its allocation in order to reserve space
7181 for GDB's internal copy of the data. That's why the
7182 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7183 rather than struct value*s.
7185 However, GDB's internal history variables ($1, $2, etc.) are
7186 struct value*s containing internal copies of the data that are not, in
7187 general, the same as the data at their corresponding addresses in
7188 the target. Fortunately, the types we give to these values are all
7189 conventional, fixed-size types (as per the strategy described
7190 above), so that we don't usually have to perform the
7191 'to_fixed_xxx_type' conversions to look at their values.
7192 Unfortunately, there is one exception: if one of the internal
7193 history variables is an array whose elements are unconstrained
7194 records, then we will need to create distinct fixed types for each
7195 element selected. */
7197 /* The upshot of all of this is that many routines take a (type, host
7198 address, target address) triple as arguments to represent a value.
7199 The host address, if non-null, is supposed to contain an internal
7200 copy of the relevant data; otherwise, the program is to consult the
7201 target at the target address. */
7203 /* Assuming that VAL0 represents a pointer value, the result of
7204 dereferencing it. Differs from value_ind in its treatment of
7205 dynamic-sized types. */
7208 ada_value_ind (struct value *val0)
7210 struct value *val = value_ind (val0);
7212 if (ada_is_tagged_type (value_type (val), 0))
7213 val = ada_tag_value_at_base_address (val);
7215 return ada_to_fixed_value (val);
7218 /* The value resulting from dereferencing any "reference to"
7219 qualifiers on VAL0. */
7221 static struct value *
7222 ada_coerce_ref (struct value *val0)
7224 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
7226 struct value *val = val0;
7228 val = coerce_ref (val);
7230 if (ada_is_tagged_type (value_type (val), 0))
7231 val = ada_tag_value_at_base_address (val);
7233 return ada_to_fixed_value (val);
7239 /* Return OFF rounded upward if necessary to a multiple of
7240 ALIGNMENT (a power of 2). */
7243 align_value (unsigned int off, unsigned int alignment)
7245 return (off + alignment - 1) & ~(alignment - 1);
7248 /* Return the bit alignment required for field #F of template type TYPE. */
7251 field_alignment (struct type *type, int f)
7253 const char *name = TYPE_FIELD_NAME (type, f);
7257 /* The field name should never be null, unless the debugging information
7258 is somehow malformed. In this case, we assume the field does not
7259 require any alignment. */
7263 len = strlen (name);
7265 if (!isdigit (name[len - 1]))
7268 if (isdigit (name[len - 2]))
7269 align_offset = len - 2;
7271 align_offset = len - 1;
7273 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
7274 return TARGET_CHAR_BIT;
7276 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7279 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7281 static struct symbol *
7282 ada_find_any_type_symbol (const char *name)
7286 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
7287 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
7290 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7294 /* Find a type named NAME. Ignores ambiguity. This routine will look
7295 solely for types defined by debug info, it will not search the GDB
7298 static struct type *
7299 ada_find_any_type (const char *name)
7301 struct symbol *sym = ada_find_any_type_symbol (name);
7304 return SYMBOL_TYPE (sym);
7309 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7310 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7311 symbol, in which case it is returned. Otherwise, this looks for
7312 symbols whose name is that of NAME_SYM suffixed with "___XR".
7313 Return symbol if found, and NULL otherwise. */
7316 ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block)
7318 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
7321 if (strstr (name, "___XR") != NULL)
7324 sym = find_old_style_renaming_symbol (name, block);
7329 /* Not right yet. FIXME pnh 7/20/2007. */
7330 sym = ada_find_any_type_symbol (name);
7331 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
7337 static struct symbol *
7338 find_old_style_renaming_symbol (const char *name, const struct block *block)
7340 const struct symbol *function_sym = block_linkage_function (block);
7343 if (function_sym != NULL)
7345 /* If the symbol is defined inside a function, NAME is not fully
7346 qualified. This means we need to prepend the function name
7347 as well as adding the ``___XR'' suffix to build the name of
7348 the associated renaming symbol. */
7349 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
7350 /* Function names sometimes contain suffixes used
7351 for instance to qualify nested subprograms. When building
7352 the XR type name, we need to make sure that this suffix is
7353 not included. So do not include any suffix in the function
7354 name length below. */
7355 int function_name_len = ada_name_prefix_len (function_name);
7356 const int rename_len = function_name_len + 2 /* "__" */
7357 + strlen (name) + 6 /* "___XR\0" */ ;
7359 /* Strip the suffix if necessary. */
7360 ada_remove_trailing_digits (function_name, &function_name_len);
7361 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
7362 ada_remove_Xbn_suffix (function_name, &function_name_len);
7364 /* Library-level functions are a special case, as GNAT adds
7365 a ``_ada_'' prefix to the function name to avoid namespace
7366 pollution. However, the renaming symbols themselves do not
7367 have this prefix, so we need to skip this prefix if present. */
7368 if (function_name_len > 5 /* "_ada_" */
7369 && strstr (function_name, "_ada_") == function_name)
7372 function_name_len -= 5;
7375 rename = (char *) alloca (rename_len * sizeof (char));
7376 strncpy (rename, function_name, function_name_len);
7377 xsnprintf (rename + function_name_len, rename_len - function_name_len,
7382 const int rename_len = strlen (name) + 6;
7384 rename = (char *) alloca (rename_len * sizeof (char));
7385 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
7388 return ada_find_any_type_symbol (rename);
7391 /* Because of GNAT encoding conventions, several GDB symbols may match a
7392 given type name. If the type denoted by TYPE0 is to be preferred to
7393 that of TYPE1 for purposes of type printing, return non-zero;
7394 otherwise return 0. */
7397 ada_prefer_type (struct type *type0, struct type *type1)
7401 else if (type0 == NULL)
7403 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
7405 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
7407 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
7409 else if (ada_is_constrained_packed_array_type (type0))
7411 else if (ada_is_array_descriptor_type (type0)
7412 && !ada_is_array_descriptor_type (type1))
7416 const char *type0_name = type_name_no_tag (type0);
7417 const char *type1_name = type_name_no_tag (type1);
7419 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
7420 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
7426 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7427 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7430 ada_type_name (struct type *type)
7434 else if (TYPE_NAME (type) != NULL)
7435 return TYPE_NAME (type);
7437 return TYPE_TAG_NAME (type);
7440 /* Search the list of "descriptive" types associated to TYPE for a type
7441 whose name is NAME. */
7443 static struct type *
7444 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
7446 struct type *result;
7448 if (ada_ignore_descriptive_types_p)
7451 /* If there no descriptive-type info, then there is no parallel type
7453 if (!HAVE_GNAT_AUX_INFO (type))
7456 result = TYPE_DESCRIPTIVE_TYPE (type);
7457 while (result != NULL)
7459 const char *result_name = ada_type_name (result);
7461 if (result_name == NULL)
7463 warning (_("unexpected null name on descriptive type"));
7467 /* If the names match, stop. */
7468 if (strcmp (result_name, name) == 0)
7471 /* Otherwise, look at the next item on the list, if any. */
7472 if (HAVE_GNAT_AUX_INFO (result))
7473 result = TYPE_DESCRIPTIVE_TYPE (result);
7478 /* If we didn't find a match, see whether this is a packed array. With
7479 older compilers, the descriptive type information is either absent or
7480 irrelevant when it comes to packed arrays so the above lookup fails.
7481 Fall back to using a parallel lookup by name in this case. */
7482 if (result == NULL && ada_is_constrained_packed_array_type (type))
7483 return ada_find_any_type (name);
7488 /* Find a parallel type to TYPE with the specified NAME, using the
7489 descriptive type taken from the debugging information, if available,
7490 and otherwise using the (slower) name-based method. */
7492 static struct type *
7493 ada_find_parallel_type_with_name (struct type *type, const char *name)
7495 struct type *result = NULL;
7497 if (HAVE_GNAT_AUX_INFO (type))
7498 result = find_parallel_type_by_descriptive_type (type, name);
7500 result = ada_find_any_type (name);
7505 /* Same as above, but specify the name of the parallel type by appending
7506 SUFFIX to the name of TYPE. */
7509 ada_find_parallel_type (struct type *type, const char *suffix)
7512 const char *typename = ada_type_name (type);
7515 if (typename == NULL)
7518 len = strlen (typename);
7520 name = (char *) alloca (len + strlen (suffix) + 1);
7522 strcpy (name, typename);
7523 strcpy (name + len, suffix);
7525 return ada_find_parallel_type_with_name (type, name);
7528 /* If TYPE is a variable-size record type, return the corresponding template
7529 type describing its fields. Otherwise, return NULL. */
7531 static struct type *
7532 dynamic_template_type (struct type *type)
7534 type = ada_check_typedef (type);
7536 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
7537 || ada_type_name (type) == NULL)
7541 int len = strlen (ada_type_name (type));
7543 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
7546 return ada_find_parallel_type (type, "___XVE");
7550 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7551 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7554 is_dynamic_field (struct type *templ_type, int field_num)
7556 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
7559 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
7560 && strstr (name, "___XVL") != NULL;
7563 /* The index of the variant field of TYPE, or -1 if TYPE does not
7564 represent a variant record type. */
7567 variant_field_index (struct type *type)
7571 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
7574 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
7576 if (ada_is_variant_part (type, f))
7582 /* A record type with no fields. */
7584 static struct type *
7585 empty_record (struct type *template)
7587 struct type *type = alloc_type_copy (template);
7589 TYPE_CODE (type) = TYPE_CODE_STRUCT;
7590 TYPE_NFIELDS (type) = 0;
7591 TYPE_FIELDS (type) = NULL;
7592 INIT_CPLUS_SPECIFIC (type);
7593 TYPE_NAME (type) = "<empty>";
7594 TYPE_TAG_NAME (type) = NULL;
7595 TYPE_LENGTH (type) = 0;
7599 /* An ordinary record type (with fixed-length fields) that describes
7600 the value of type TYPE at VALADDR or ADDRESS (see comments at
7601 the beginning of this section) VAL according to GNAT conventions.
7602 DVAL0 should describe the (portion of a) record that contains any
7603 necessary discriminants. It should be NULL if value_type (VAL) is
7604 an outer-level type (i.e., as opposed to a branch of a variant.) A
7605 variant field (unless unchecked) is replaced by a particular branch
7608 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7609 length are not statically known are discarded. As a consequence,
7610 VALADDR, ADDRESS and DVAL0 are ignored.
7612 NOTE: Limitations: For now, we assume that dynamic fields and
7613 variants occupy whole numbers of bytes. However, they need not be
7617 ada_template_to_fixed_record_type_1 (struct type *type,
7618 const gdb_byte *valaddr,
7619 CORE_ADDR address, struct value *dval0,
7620 int keep_dynamic_fields)
7622 struct value *mark = value_mark ();
7625 int nfields, bit_len;
7631 /* Compute the number of fields in this record type that are going
7632 to be processed: unless keep_dynamic_fields, this includes only
7633 fields whose position and length are static will be processed. */
7634 if (keep_dynamic_fields)
7635 nfields = TYPE_NFIELDS (type);
7639 while (nfields < TYPE_NFIELDS (type)
7640 && !ada_is_variant_part (type, nfields)
7641 && !is_dynamic_field (type, nfields))
7645 rtype = alloc_type_copy (type);
7646 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7647 INIT_CPLUS_SPECIFIC (rtype);
7648 TYPE_NFIELDS (rtype) = nfields;
7649 TYPE_FIELDS (rtype) = (struct field *)
7650 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7651 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7652 TYPE_NAME (rtype) = ada_type_name (type);
7653 TYPE_TAG_NAME (rtype) = NULL;
7654 TYPE_FIXED_INSTANCE (rtype) = 1;
7660 for (f = 0; f < nfields; f += 1)
7662 off = align_value (off, field_alignment (type, f))
7663 + TYPE_FIELD_BITPOS (type, f);
7664 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
7665 TYPE_FIELD_BITSIZE (rtype, f) = 0;
7667 if (ada_is_variant_part (type, f))
7672 else if (is_dynamic_field (type, f))
7674 const gdb_byte *field_valaddr = valaddr;
7675 CORE_ADDR field_address = address;
7676 struct type *field_type =
7677 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7681 /* rtype's length is computed based on the run-time
7682 value of discriminants. If the discriminants are not
7683 initialized, the type size may be completely bogus and
7684 GDB may fail to allocate a value for it. So check the
7685 size first before creating the value. */
7687 dval = value_from_contents_and_address (rtype, valaddr, address);
7692 /* If the type referenced by this field is an aligner type, we need
7693 to unwrap that aligner type, because its size might not be set.
7694 Keeping the aligner type would cause us to compute the wrong
7695 size for this field, impacting the offset of the all the fields
7696 that follow this one. */
7697 if (ada_is_aligner_type (field_type))
7699 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7701 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7702 field_address = cond_offset_target (field_address, field_offset);
7703 field_type = ada_aligned_type (field_type);
7706 field_valaddr = cond_offset_host (field_valaddr,
7707 off / TARGET_CHAR_BIT);
7708 field_address = cond_offset_target (field_address,
7709 off / TARGET_CHAR_BIT);
7711 /* Get the fixed type of the field. Note that, in this case,
7712 we do not want to get the real type out of the tag: if
7713 the current field is the parent part of a tagged record,
7714 we will get the tag of the object. Clearly wrong: the real
7715 type of the parent is not the real type of the child. We
7716 would end up in an infinite loop. */
7717 field_type = ada_get_base_type (field_type);
7718 field_type = ada_to_fixed_type (field_type, field_valaddr,
7719 field_address, dval, 0);
7720 /* If the field size is already larger than the maximum
7721 object size, then the record itself will necessarily
7722 be larger than the maximum object size. We need to make
7723 this check now, because the size might be so ridiculously
7724 large (due to an uninitialized variable in the inferior)
7725 that it would cause an overflow when adding it to the
7727 check_size (field_type);
7729 TYPE_FIELD_TYPE (rtype, f) = field_type;
7730 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7731 /* The multiplication can potentially overflow. But because
7732 the field length has been size-checked just above, and
7733 assuming that the maximum size is a reasonable value,
7734 an overflow should not happen in practice. So rather than
7735 adding overflow recovery code to this already complex code,
7736 we just assume that it's not going to happen. */
7738 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7742 /* Note: If this field's type is a typedef, it is important
7743 to preserve the typedef layer.
7745 Otherwise, we might be transforming a typedef to a fat
7746 pointer (encoding a pointer to an unconstrained array),
7747 into a basic fat pointer (encoding an unconstrained
7748 array). As both types are implemented using the same
7749 structure, the typedef is the only clue which allows us
7750 to distinguish between the two options. Stripping it
7751 would prevent us from printing this field appropriately. */
7752 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
7753 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7754 if (TYPE_FIELD_BITSIZE (type, f) > 0)
7756 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7759 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7761 /* We need to be careful of typedefs when computing
7762 the length of our field. If this is a typedef,
7763 get the length of the target type, not the length
7765 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
7766 field_type = ada_typedef_target_type (field_type);
7769 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
7772 if (off + fld_bit_len > bit_len)
7773 bit_len = off + fld_bit_len;
7775 TYPE_LENGTH (rtype) =
7776 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7779 /* We handle the variant part, if any, at the end because of certain
7780 odd cases in which it is re-ordered so as NOT to be the last field of
7781 the record. This can happen in the presence of representation
7783 if (variant_field >= 0)
7785 struct type *branch_type;
7787 off = TYPE_FIELD_BITPOS (rtype, variant_field);
7790 dval = value_from_contents_and_address (rtype, valaddr, address);
7795 to_fixed_variant_branch_type
7796 (TYPE_FIELD_TYPE (type, variant_field),
7797 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
7798 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
7799 if (branch_type == NULL)
7801 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
7802 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7803 TYPE_NFIELDS (rtype) -= 1;
7807 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7808 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7810 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
7812 if (off + fld_bit_len > bit_len)
7813 bit_len = off + fld_bit_len;
7814 TYPE_LENGTH (rtype) =
7815 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7819 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7820 should contain the alignment of that record, which should be a strictly
7821 positive value. If null or negative, then something is wrong, most
7822 probably in the debug info. In that case, we don't round up the size
7823 of the resulting type. If this record is not part of another structure,
7824 the current RTYPE length might be good enough for our purposes. */
7825 if (TYPE_LENGTH (type) <= 0)
7827 if (TYPE_NAME (rtype))
7828 warning (_("Invalid type size for `%s' detected: %d."),
7829 TYPE_NAME (rtype), TYPE_LENGTH (type));
7831 warning (_("Invalid type size for <unnamed> detected: %d."),
7832 TYPE_LENGTH (type));
7836 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
7837 TYPE_LENGTH (type));
7840 value_free_to_mark (mark);
7841 if (TYPE_LENGTH (rtype) > varsize_limit)
7842 error (_("record type with dynamic size is larger than varsize-limit"));
7846 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7849 static struct type *
7850 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
7851 CORE_ADDR address, struct value *dval0)
7853 return ada_template_to_fixed_record_type_1 (type, valaddr,
7857 /* An ordinary record type in which ___XVL-convention fields and
7858 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7859 static approximations, containing all possible fields. Uses
7860 no runtime values. Useless for use in values, but that's OK,
7861 since the results are used only for type determinations. Works on both
7862 structs and unions. Representation note: to save space, we memorize
7863 the result of this function in the TYPE_TARGET_TYPE of the
7866 static struct type *
7867 template_to_static_fixed_type (struct type *type0)
7873 if (TYPE_TARGET_TYPE (type0) != NULL)
7874 return TYPE_TARGET_TYPE (type0);
7876 nfields = TYPE_NFIELDS (type0);
7879 for (f = 0; f < nfields; f += 1)
7881 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
7882 struct type *new_type;
7884 if (is_dynamic_field (type0, f))
7885 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
7887 new_type = static_unwrap_type (field_type);
7888 if (type == type0 && new_type != field_type)
7890 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
7891 TYPE_CODE (type) = TYPE_CODE (type0);
7892 INIT_CPLUS_SPECIFIC (type);
7893 TYPE_NFIELDS (type) = nfields;
7894 TYPE_FIELDS (type) = (struct field *)
7895 TYPE_ALLOC (type, nfields * sizeof (struct field));
7896 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7897 sizeof (struct field) * nfields);
7898 TYPE_NAME (type) = ada_type_name (type0);
7899 TYPE_TAG_NAME (type) = NULL;
7900 TYPE_FIXED_INSTANCE (type) = 1;
7901 TYPE_LENGTH (type) = 0;
7903 TYPE_FIELD_TYPE (type, f) = new_type;
7904 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
7909 /* Given an object of type TYPE whose contents are at VALADDR and
7910 whose address in memory is ADDRESS, returns a revision of TYPE,
7911 which should be a non-dynamic-sized record, in which the variant
7912 part, if any, is replaced with the appropriate branch. Looks
7913 for discriminant values in DVAL0, which can be NULL if the record
7914 contains the necessary discriminant values. */
7916 static struct type *
7917 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
7918 CORE_ADDR address, struct value *dval0)
7920 struct value *mark = value_mark ();
7923 struct type *branch_type;
7924 int nfields = TYPE_NFIELDS (type);
7925 int variant_field = variant_field_index (type);
7927 if (variant_field == -1)
7931 dval = value_from_contents_and_address (type, valaddr, address);
7935 rtype = alloc_type_copy (type);
7936 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7937 INIT_CPLUS_SPECIFIC (rtype);
7938 TYPE_NFIELDS (rtype) = nfields;
7939 TYPE_FIELDS (rtype) =
7940 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7941 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7942 sizeof (struct field) * nfields);
7943 TYPE_NAME (rtype) = ada_type_name (type);
7944 TYPE_TAG_NAME (rtype) = NULL;
7945 TYPE_FIXED_INSTANCE (rtype) = 1;
7946 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7948 branch_type = to_fixed_variant_branch_type
7949 (TYPE_FIELD_TYPE (type, variant_field),
7950 cond_offset_host (valaddr,
7951 TYPE_FIELD_BITPOS (type, variant_field)
7953 cond_offset_target (address,
7954 TYPE_FIELD_BITPOS (type, variant_field)
7955 / TARGET_CHAR_BIT), dval);
7956 if (branch_type == NULL)
7960 for (f = variant_field + 1; f < nfields; f += 1)
7961 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7962 TYPE_NFIELDS (rtype) -= 1;
7966 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7967 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7968 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7969 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7971 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7973 value_free_to_mark (mark);
7977 /* An ordinary record type (with fixed-length fields) that describes
7978 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7979 beginning of this section]. Any necessary discriminants' values
7980 should be in DVAL, a record value; it may be NULL if the object
7981 at ADDR itself contains any necessary discriminant values.
7982 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7983 values from the record are needed. Except in the case that DVAL,
7984 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7985 unchecked) is replaced by a particular branch of the variant.
7987 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7988 is questionable and may be removed. It can arise during the
7989 processing of an unconstrained-array-of-record type where all the
7990 variant branches have exactly the same size. This is because in
7991 such cases, the compiler does not bother to use the XVS convention
7992 when encoding the record. I am currently dubious of this
7993 shortcut and suspect the compiler should be altered. FIXME. */
7995 static struct type *
7996 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7997 CORE_ADDR address, struct value *dval)
7999 struct type *templ_type;
8001 if (TYPE_FIXED_INSTANCE (type0))
8004 templ_type = dynamic_template_type (type0);
8006 if (templ_type != NULL)
8007 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
8008 else if (variant_field_index (type0) >= 0)
8010 if (dval == NULL && valaddr == NULL && address == 0)
8012 return to_record_with_fixed_variant_part (type0, valaddr, address,
8017 TYPE_FIXED_INSTANCE (type0) = 1;
8023 /* An ordinary record type (with fixed-length fields) that describes
8024 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8025 union type. Any necessary discriminants' values should be in DVAL,
8026 a record value. That is, this routine selects the appropriate
8027 branch of the union at ADDR according to the discriminant value
8028 indicated in the union's type name. Returns VAR_TYPE0 itself if
8029 it represents a variant subject to a pragma Unchecked_Union. */
8031 static struct type *
8032 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
8033 CORE_ADDR address, struct value *dval)
8036 struct type *templ_type;
8037 struct type *var_type;
8039 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
8040 var_type = TYPE_TARGET_TYPE (var_type0);
8042 var_type = var_type0;
8044 templ_type = ada_find_parallel_type (var_type, "___XVU");
8046 if (templ_type != NULL)
8047 var_type = templ_type;
8049 if (is_unchecked_variant (var_type, value_type (dval)))
8052 ada_which_variant_applies (var_type,
8053 value_type (dval), value_contents (dval));
8056 return empty_record (var_type);
8057 else if (is_dynamic_field (var_type, which))
8058 return to_fixed_record_type
8059 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
8060 valaddr, address, dval);
8061 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
8063 to_fixed_record_type
8064 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
8066 return TYPE_FIELD_TYPE (var_type, which);
8069 /* Assuming that TYPE0 is an array type describing the type of a value
8070 at ADDR, and that DVAL describes a record containing any
8071 discriminants used in TYPE0, returns a type for the value that
8072 contains no dynamic components (that is, no components whose sizes
8073 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8074 true, gives an error message if the resulting type's size is over
8077 static struct type *
8078 to_fixed_array_type (struct type *type0, struct value *dval,
8081 struct type *index_type_desc;
8082 struct type *result;
8083 int constrained_packed_array_p;
8085 type0 = ada_check_typedef (type0);
8086 if (TYPE_FIXED_INSTANCE (type0))
8089 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
8090 if (constrained_packed_array_p)
8091 type0 = decode_constrained_packed_array_type (type0);
8093 index_type_desc = ada_find_parallel_type (type0, "___XA");
8094 ada_fixup_array_indexes_type (index_type_desc);
8095 if (index_type_desc == NULL)
8097 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
8099 /* NOTE: elt_type---the fixed version of elt_type0---should never
8100 depend on the contents of the array in properly constructed
8102 /* Create a fixed version of the array element type.
8103 We're not providing the address of an element here,
8104 and thus the actual object value cannot be inspected to do
8105 the conversion. This should not be a problem, since arrays of
8106 unconstrained objects are not allowed. In particular, all
8107 the elements of an array of a tagged type should all be of
8108 the same type specified in the debugging info. No need to
8109 consult the object tag. */
8110 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
8112 /* Make sure we always create a new array type when dealing with
8113 packed array types, since we're going to fix-up the array
8114 type length and element bitsize a little further down. */
8115 if (elt_type0 == elt_type && !constrained_packed_array_p)
8118 result = create_array_type (alloc_type_copy (type0),
8119 elt_type, TYPE_INDEX_TYPE (type0));
8124 struct type *elt_type0;
8127 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
8128 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8130 /* NOTE: result---the fixed version of elt_type0---should never
8131 depend on the contents of the array in properly constructed
8133 /* Create a fixed version of the array element type.
8134 We're not providing the address of an element here,
8135 and thus the actual object value cannot be inspected to do
8136 the conversion. This should not be a problem, since arrays of
8137 unconstrained objects are not allowed. In particular, all
8138 the elements of an array of a tagged type should all be of
8139 the same type specified in the debugging info. No need to
8140 consult the object tag. */
8142 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
8145 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
8147 struct type *range_type =
8148 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
8150 result = create_array_type (alloc_type_copy (elt_type0),
8151 result, range_type);
8152 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8154 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
8155 error (_("array type with dynamic size is larger than varsize-limit"));
8158 /* We want to preserve the type name. This can be useful when
8159 trying to get the type name of a value that has already been
8160 printed (for instance, if the user did "print VAR; whatis $". */
8161 TYPE_NAME (result) = TYPE_NAME (type0);
8163 if (constrained_packed_array_p)
8165 /* So far, the resulting type has been created as if the original
8166 type was a regular (non-packed) array type. As a result, the
8167 bitsize of the array elements needs to be set again, and the array
8168 length needs to be recomputed based on that bitsize. */
8169 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
8170 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
8172 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
8173 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
8174 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
8175 TYPE_LENGTH (result)++;
8178 TYPE_FIXED_INSTANCE (result) = 1;
8183 /* A standard type (containing no dynamically sized components)
8184 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8185 DVAL describes a record containing any discriminants used in TYPE0,
8186 and may be NULL if there are none, or if the object of type TYPE at
8187 ADDRESS or in VALADDR contains these discriminants.
8189 If CHECK_TAG is not null, in the case of tagged types, this function
8190 attempts to locate the object's tag and use it to compute the actual
8191 type. However, when ADDRESS is null, we cannot use it to determine the
8192 location of the tag, and therefore compute the tagged type's actual type.
8193 So we return the tagged type without consulting the tag. */
8195 static struct type *
8196 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
8197 CORE_ADDR address, struct value *dval, int check_tag)
8199 type = ada_check_typedef (type);
8200 switch (TYPE_CODE (type))
8204 case TYPE_CODE_STRUCT:
8206 struct type *static_type = to_static_fixed_type (type);
8207 struct type *fixed_record_type =
8208 to_fixed_record_type (type, valaddr, address, NULL);
8210 /* If STATIC_TYPE is a tagged type and we know the object's address,
8211 then we can determine its tag, and compute the object's actual
8212 type from there. Note that we have to use the fixed record
8213 type (the parent part of the record may have dynamic fields
8214 and the way the location of _tag is expressed may depend on
8217 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
8220 value_tag_from_contents_and_address
8224 struct type *real_type = type_from_tag (tag);
8226 value_from_contents_and_address (fixed_record_type,
8229 if (real_type != NULL)
8230 return to_fixed_record_type
8232 value_address (ada_tag_value_at_base_address (obj)), NULL);
8235 /* Check to see if there is a parallel ___XVZ variable.
8236 If there is, then it provides the actual size of our type. */
8237 else if (ada_type_name (fixed_record_type) != NULL)
8239 const char *name = ada_type_name (fixed_record_type);
8240 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
8244 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
8245 size = get_int_var_value (xvz_name, &xvz_found);
8246 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
8248 fixed_record_type = copy_type (fixed_record_type);
8249 TYPE_LENGTH (fixed_record_type) = size;
8251 /* The FIXED_RECORD_TYPE may have be a stub. We have
8252 observed this when the debugging info is STABS, and
8253 apparently it is something that is hard to fix.
8255 In practice, we don't need the actual type definition
8256 at all, because the presence of the XVZ variable allows us
8257 to assume that there must be a XVS type as well, which we
8258 should be able to use later, when we need the actual type
8261 In the meantime, pretend that the "fixed" type we are
8262 returning is NOT a stub, because this can cause trouble
8263 when using this type to create new types targeting it.
8264 Indeed, the associated creation routines often check
8265 whether the target type is a stub and will try to replace
8266 it, thus using a type with the wrong size. This, in turn,
8267 might cause the new type to have the wrong size too.
8268 Consider the case of an array, for instance, where the size
8269 of the array is computed from the number of elements in
8270 our array multiplied by the size of its element. */
8271 TYPE_STUB (fixed_record_type) = 0;
8274 return fixed_record_type;
8276 case TYPE_CODE_ARRAY:
8277 return to_fixed_array_type (type, dval, 1);
8278 case TYPE_CODE_UNION:
8282 return to_fixed_variant_branch_type (type, valaddr, address, dval);
8286 /* The same as ada_to_fixed_type_1, except that it preserves the type
8287 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8289 The typedef layer needs be preserved in order to differentiate between
8290 arrays and array pointers when both types are implemented using the same
8291 fat pointer. In the array pointer case, the pointer is encoded as
8292 a typedef of the pointer type. For instance, considering:
8294 type String_Access is access String;
8295 S1 : String_Access := null;
8297 To the debugger, S1 is defined as a typedef of type String. But
8298 to the user, it is a pointer. So if the user tries to print S1,
8299 we should not dereference the array, but print the array address
8302 If we didn't preserve the typedef layer, we would lose the fact that
8303 the type is to be presented as a pointer (needs de-reference before
8304 being printed). And we would also use the source-level type name. */
8307 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
8308 CORE_ADDR address, struct value *dval, int check_tag)
8311 struct type *fixed_type =
8312 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
8314 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8315 then preserve the typedef layer.
8317 Implementation note: We can only check the main-type portion of
8318 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8319 from TYPE now returns a type that has the same instance flags
8320 as TYPE. For instance, if TYPE is a "typedef const", and its
8321 target type is a "struct", then the typedef elimination will return
8322 a "const" version of the target type. See check_typedef for more
8323 details about how the typedef layer elimination is done.
8325 brobecker/2010-11-19: It seems to me that the only case where it is
8326 useful to preserve the typedef layer is when dealing with fat pointers.
8327 Perhaps, we could add a check for that and preserve the typedef layer
8328 only in that situation. But this seems unecessary so far, probably
8329 because we call check_typedef/ada_check_typedef pretty much everywhere.
8331 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8332 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
8333 == TYPE_MAIN_TYPE (fixed_type)))
8339 /* A standard (static-sized) type corresponding as well as possible to
8340 TYPE0, but based on no runtime data. */
8342 static struct type *
8343 to_static_fixed_type (struct type *type0)
8350 if (TYPE_FIXED_INSTANCE (type0))
8353 type0 = ada_check_typedef (type0);
8355 switch (TYPE_CODE (type0))
8359 case TYPE_CODE_STRUCT:
8360 type = dynamic_template_type (type0);
8362 return template_to_static_fixed_type (type);
8364 return template_to_static_fixed_type (type0);
8365 case TYPE_CODE_UNION:
8366 type = ada_find_parallel_type (type0, "___XVU");
8368 return template_to_static_fixed_type (type);
8370 return template_to_static_fixed_type (type0);
8374 /* A static approximation of TYPE with all type wrappers removed. */
8376 static struct type *
8377 static_unwrap_type (struct type *type)
8379 if (ada_is_aligner_type (type))
8381 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
8382 if (ada_type_name (type1) == NULL)
8383 TYPE_NAME (type1) = ada_type_name (type);
8385 return static_unwrap_type (type1);
8389 struct type *raw_real_type = ada_get_base_type (type);
8391 if (raw_real_type == type)
8394 return to_static_fixed_type (raw_real_type);
8398 /* In some cases, incomplete and private types require
8399 cross-references that are not resolved as records (for example,
8401 type FooP is access Foo;
8403 type Foo is array ...;
8404 ). In these cases, since there is no mechanism for producing
8405 cross-references to such types, we instead substitute for FooP a
8406 stub enumeration type that is nowhere resolved, and whose tag is
8407 the name of the actual type. Call these types "non-record stubs". */
8409 /* A type equivalent to TYPE that is not a non-record stub, if one
8410 exists, otherwise TYPE. */
8413 ada_check_typedef (struct type *type)
8418 /* If our type is a typedef type of a fat pointer, then we're done.
8419 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8420 what allows us to distinguish between fat pointers that represent
8421 array types, and fat pointers that represent array access types
8422 (in both cases, the compiler implements them as fat pointers). */
8423 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8424 && is_thick_pntr (ada_typedef_target_type (type)))
8427 CHECK_TYPEDEF (type);
8428 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
8429 || !TYPE_STUB (type)
8430 || TYPE_TAG_NAME (type) == NULL)
8434 const char *name = TYPE_TAG_NAME (type);
8435 struct type *type1 = ada_find_any_type (name);
8440 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8441 stubs pointing to arrays, as we don't create symbols for array
8442 types, only for the typedef-to-array types). If that's the case,
8443 strip the typedef layer. */
8444 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
8445 type1 = ada_check_typedef (type1);
8451 /* A value representing the data at VALADDR/ADDRESS as described by
8452 type TYPE0, but with a standard (static-sized) type that correctly
8453 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8454 type, then return VAL0 [this feature is simply to avoid redundant
8455 creation of struct values]. */
8457 static struct value *
8458 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
8461 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
8463 if (type == type0 && val0 != NULL)
8466 return value_from_contents_and_address (type, 0, address);
8469 /* A value representing VAL, but with a standard (static-sized) type
8470 that correctly describes it. Does not necessarily create a new
8474 ada_to_fixed_value (struct value *val)
8476 val = unwrap_value (val);
8477 val = ada_to_fixed_value_create (value_type (val),
8478 value_address (val),
8486 /* Table mapping attribute numbers to names.
8487 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8489 static const char *attribute_names[] = {
8507 ada_attribute_name (enum exp_opcode n)
8509 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
8510 return attribute_names[n - OP_ATR_FIRST + 1];
8512 return attribute_names[0];
8515 /* Evaluate the 'POS attribute applied to ARG. */
8518 pos_atr (struct value *arg)
8520 struct value *val = coerce_ref (arg);
8521 struct type *type = value_type (val);
8523 if (!discrete_type_p (type))
8524 error (_("'POS only defined on discrete types"));
8526 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8529 LONGEST v = value_as_long (val);
8531 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
8533 if (v == TYPE_FIELD_ENUMVAL (type, i))
8536 error (_("enumeration value is invalid: can't find 'POS"));
8539 return value_as_long (val);
8542 static struct value *
8543 value_pos_atr (struct type *type, struct value *arg)
8545 return value_from_longest (type, pos_atr (arg));
8548 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8550 static struct value *
8551 value_val_atr (struct type *type, struct value *arg)
8553 if (!discrete_type_p (type))
8554 error (_("'VAL only defined on discrete types"));
8555 if (!integer_type_p (value_type (arg)))
8556 error (_("'VAL requires integral argument"));
8558 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8560 long pos = value_as_long (arg);
8562 if (pos < 0 || pos >= TYPE_NFIELDS (type))
8563 error (_("argument to 'VAL out of range"));
8564 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
8567 return value_from_longest (type, value_as_long (arg));
8573 /* True if TYPE appears to be an Ada character type.
8574 [At the moment, this is true only for Character and Wide_Character;
8575 It is a heuristic test that could stand improvement]. */
8578 ada_is_character_type (struct type *type)
8582 /* If the type code says it's a character, then assume it really is,
8583 and don't check any further. */
8584 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
8587 /* Otherwise, assume it's a character type iff it is a discrete type
8588 with a known character type name. */
8589 name = ada_type_name (type);
8590 return (name != NULL
8591 && (TYPE_CODE (type) == TYPE_CODE_INT
8592 || TYPE_CODE (type) == TYPE_CODE_RANGE)
8593 && (strcmp (name, "character") == 0
8594 || strcmp (name, "wide_character") == 0
8595 || strcmp (name, "wide_wide_character") == 0
8596 || strcmp (name, "unsigned char") == 0));
8599 /* True if TYPE appears to be an Ada string type. */
8602 ada_is_string_type (struct type *type)
8604 type = ada_check_typedef (type);
8606 && TYPE_CODE (type) != TYPE_CODE_PTR
8607 && (ada_is_simple_array_type (type)
8608 || ada_is_array_descriptor_type (type))
8609 && ada_array_arity (type) == 1)
8611 struct type *elttype = ada_array_element_type (type, 1);
8613 return ada_is_character_type (elttype);
8619 /* The compiler sometimes provides a parallel XVS type for a given
8620 PAD type. Normally, it is safe to follow the PAD type directly,
8621 but older versions of the compiler have a bug that causes the offset
8622 of its "F" field to be wrong. Following that field in that case
8623 would lead to incorrect results, but this can be worked around
8624 by ignoring the PAD type and using the associated XVS type instead.
8626 Set to True if the debugger should trust the contents of PAD types.
8627 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8628 static int trust_pad_over_xvs = 1;
8630 /* True if TYPE is a struct type introduced by the compiler to force the
8631 alignment of a value. Such types have a single field with a
8632 distinctive name. */
8635 ada_is_aligner_type (struct type *type)
8637 type = ada_check_typedef (type);
8639 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
8642 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
8643 && TYPE_NFIELDS (type) == 1
8644 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
8647 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8648 the parallel type. */
8651 ada_get_base_type (struct type *raw_type)
8653 struct type *real_type_namer;
8654 struct type *raw_real_type;
8656 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
8659 if (ada_is_aligner_type (raw_type))
8660 /* The encoding specifies that we should always use the aligner type.
8661 So, even if this aligner type has an associated XVS type, we should
8664 According to the compiler gurus, an XVS type parallel to an aligner
8665 type may exist because of a stabs limitation. In stabs, aligner
8666 types are empty because the field has a variable-sized type, and
8667 thus cannot actually be used as an aligner type. As a result,
8668 we need the associated parallel XVS type to decode the type.
8669 Since the policy in the compiler is to not change the internal
8670 representation based on the debugging info format, we sometimes
8671 end up having a redundant XVS type parallel to the aligner type. */
8674 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
8675 if (real_type_namer == NULL
8676 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
8677 || TYPE_NFIELDS (real_type_namer) != 1)
8680 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
8682 /* This is an older encoding form where the base type needs to be
8683 looked up by name. We prefer the newer enconding because it is
8685 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
8686 if (raw_real_type == NULL)
8689 return raw_real_type;
8692 /* The field in our XVS type is a reference to the base type. */
8693 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
8696 /* The type of value designated by TYPE, with all aligners removed. */
8699 ada_aligned_type (struct type *type)
8701 if (ada_is_aligner_type (type))
8702 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
8704 return ada_get_base_type (type);
8708 /* The address of the aligned value in an object at address VALADDR
8709 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8712 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
8714 if (ada_is_aligner_type (type))
8715 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
8717 TYPE_FIELD_BITPOS (type,
8718 0) / TARGET_CHAR_BIT);
8725 /* The printed representation of an enumeration literal with encoded
8726 name NAME. The value is good to the next call of ada_enum_name. */
8728 ada_enum_name (const char *name)
8730 static char *result;
8731 static size_t result_len = 0;
8734 /* First, unqualify the enumeration name:
8735 1. Search for the last '.' character. If we find one, then skip
8736 all the preceding characters, the unqualified name starts
8737 right after that dot.
8738 2. Otherwise, we may be debugging on a target where the compiler
8739 translates dots into "__". Search forward for double underscores,
8740 but stop searching when we hit an overloading suffix, which is
8741 of the form "__" followed by digits. */
8743 tmp = strrchr (name, '.');
8748 while ((tmp = strstr (name, "__")) != NULL)
8750 if (isdigit (tmp[2]))
8761 if (name[1] == 'U' || name[1] == 'W')
8763 if (sscanf (name + 2, "%x", &v) != 1)
8769 GROW_VECT (result, result_len, 16);
8770 if (isascii (v) && isprint (v))
8771 xsnprintf (result, result_len, "'%c'", v);
8772 else if (name[1] == 'U')
8773 xsnprintf (result, result_len, "[\"%02x\"]", v);
8775 xsnprintf (result, result_len, "[\"%04x\"]", v);
8781 tmp = strstr (name, "__");
8783 tmp = strstr (name, "$");
8786 GROW_VECT (result, result_len, tmp - name + 1);
8787 strncpy (result, name, tmp - name);
8788 result[tmp - name] = '\0';
8796 /* Evaluate the subexpression of EXP starting at *POS as for
8797 evaluate_type, updating *POS to point just past the evaluated
8800 static struct value *
8801 evaluate_subexp_type (struct expression *exp, int *pos)
8803 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8806 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8809 static struct value *
8810 unwrap_value (struct value *val)
8812 struct type *type = ada_check_typedef (value_type (val));
8814 if (ada_is_aligner_type (type))
8816 struct value *v = ada_value_struct_elt (val, "F", 0);
8817 struct type *val_type = ada_check_typedef (value_type (v));
8819 if (ada_type_name (val_type) == NULL)
8820 TYPE_NAME (val_type) = ada_type_name (type);
8822 return unwrap_value (v);
8826 struct type *raw_real_type =
8827 ada_check_typedef (ada_get_base_type (type));
8829 /* If there is no parallel XVS or XVE type, then the value is
8830 already unwrapped. Return it without further modification. */
8831 if ((type == raw_real_type)
8832 && ada_find_parallel_type (type, "___XVE") == NULL)
8836 coerce_unspec_val_to_type
8837 (val, ada_to_fixed_type (raw_real_type, 0,
8838 value_address (val),
8843 static struct value *
8844 cast_to_fixed (struct type *type, struct value *arg)
8848 if (type == value_type (arg))
8850 else if (ada_is_fixed_point_type (value_type (arg)))
8851 val = ada_float_to_fixed (type,
8852 ada_fixed_to_float (value_type (arg),
8853 value_as_long (arg)));
8856 DOUBLEST argd = value_as_double (arg);
8858 val = ada_float_to_fixed (type, argd);
8861 return value_from_longest (type, val);
8864 static struct value *
8865 cast_from_fixed (struct type *type, struct value *arg)
8867 DOUBLEST val = ada_fixed_to_float (value_type (arg),
8868 value_as_long (arg));
8870 return value_from_double (type, val);
8873 /* Given two array types T1 and T2, return nonzero iff both arrays
8874 contain the same number of elements. */
8877 ada_same_array_size_p (struct type *t1, struct type *t2)
8879 LONGEST lo1, hi1, lo2, hi2;
8881 /* Get the array bounds in order to verify that the size of
8882 the two arrays match. */
8883 if (!get_array_bounds (t1, &lo1, &hi1)
8884 || !get_array_bounds (t2, &lo2, &hi2))
8885 error (_("unable to determine array bounds"));
8887 /* To make things easier for size comparison, normalize a bit
8888 the case of empty arrays by making sure that the difference
8889 between upper bound and lower bound is always -1. */
8895 return (hi1 - lo1 == hi2 - lo2);
8898 /* Assuming that VAL is an array of integrals, and TYPE represents
8899 an array with the same number of elements, but with wider integral
8900 elements, return an array "casted" to TYPE. In practice, this
8901 means that the returned array is built by casting each element
8902 of the original array into TYPE's (wider) element type. */
8904 static struct value *
8905 ada_promote_array_of_integrals (struct type *type, struct value *val)
8907 struct type *elt_type = TYPE_TARGET_TYPE (type);
8912 /* Verify that both val and type are arrays of scalars, and
8913 that the size of val's elements is smaller than the size
8914 of type's element. */
8915 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
8916 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
8917 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
8918 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
8919 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
8920 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
8922 if (!get_array_bounds (type, &lo, &hi))
8923 error (_("unable to determine array bounds"));
8925 res = allocate_value (type);
8927 /* Promote each array element. */
8928 for (i = 0; i < hi - lo + 1; i++)
8930 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
8932 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
8933 value_contents_all (elt), TYPE_LENGTH (elt_type));
8939 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8940 return the converted value. */
8942 static struct value *
8943 coerce_for_assign (struct type *type, struct value *val)
8945 struct type *type2 = value_type (val);
8950 type2 = ada_check_typedef (type2);
8951 type = ada_check_typedef (type);
8953 if (TYPE_CODE (type2) == TYPE_CODE_PTR
8954 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8956 val = ada_value_ind (val);
8957 type2 = value_type (val);
8960 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
8961 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8963 if (!ada_same_array_size_p (type, type2))
8964 error (_("cannot assign arrays of different length"));
8966 if (is_integral_type (TYPE_TARGET_TYPE (type))
8967 && is_integral_type (TYPE_TARGET_TYPE (type2))
8968 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8969 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
8971 /* Allow implicit promotion of the array elements to
8973 return ada_promote_array_of_integrals (type, val);
8976 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8977 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
8978 error (_("Incompatible types in assignment"));
8979 deprecated_set_value_type (val, type);
8984 static struct value *
8985 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
8988 struct type *type1, *type2;
8991 arg1 = coerce_ref (arg1);
8992 arg2 = coerce_ref (arg2);
8993 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
8994 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
8996 if (TYPE_CODE (type1) != TYPE_CODE_INT
8997 || TYPE_CODE (type2) != TYPE_CODE_INT)
8998 return value_binop (arg1, arg2, op);
9007 return value_binop (arg1, arg2, op);
9010 v2 = value_as_long (arg2);
9012 error (_("second operand of %s must not be zero."), op_string (op));
9014 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
9015 return value_binop (arg1, arg2, op);
9017 v1 = value_as_long (arg1);
9022 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
9023 v += v > 0 ? -1 : 1;
9031 /* Should not reach this point. */
9035 val = allocate_value (type1);
9036 store_unsigned_integer (value_contents_raw (val),
9037 TYPE_LENGTH (value_type (val)),
9038 gdbarch_byte_order (get_type_arch (type1)), v);
9043 ada_value_equal (struct value *arg1, struct value *arg2)
9045 if (ada_is_direct_array_type (value_type (arg1))
9046 || ada_is_direct_array_type (value_type (arg2)))
9048 /* Automatically dereference any array reference before
9049 we attempt to perform the comparison. */
9050 arg1 = ada_coerce_ref (arg1);
9051 arg2 = ada_coerce_ref (arg2);
9053 arg1 = ada_coerce_to_simple_array (arg1);
9054 arg2 = ada_coerce_to_simple_array (arg2);
9055 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
9056 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
9057 error (_("Attempt to compare array with non-array"));
9058 /* FIXME: The following works only for types whose
9059 representations use all bits (no padding or undefined bits)
9060 and do not have user-defined equality. */
9062 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
9063 && memcmp (value_contents (arg1), value_contents (arg2),
9064 TYPE_LENGTH (value_type (arg1))) == 0;
9066 return value_equal (arg1, arg2);
9069 /* Total number of component associations in the aggregate starting at
9070 index PC in EXP. Assumes that index PC is the start of an
9074 num_component_specs (struct expression *exp, int pc)
9078 m = exp->elts[pc + 1].longconst;
9081 for (i = 0; i < m; i += 1)
9083 switch (exp->elts[pc].opcode)
9089 n += exp->elts[pc + 1].longconst;
9092 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
9097 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9098 component of LHS (a simple array or a record), updating *POS past
9099 the expression, assuming that LHS is contained in CONTAINER. Does
9100 not modify the inferior's memory, nor does it modify LHS (unless
9101 LHS == CONTAINER). */
9104 assign_component (struct value *container, struct value *lhs, LONGEST index,
9105 struct expression *exp, int *pos)
9107 struct value *mark = value_mark ();
9110 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
9112 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
9113 struct value *index_val = value_from_longest (index_type, index);
9115 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
9119 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
9120 elt = ada_to_fixed_value (elt);
9123 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9124 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
9126 value_assign_to_component (container, elt,
9127 ada_evaluate_subexp (NULL, exp, pos,
9130 value_free_to_mark (mark);
9133 /* Assuming that LHS represents an lvalue having a record or array
9134 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9135 of that aggregate's value to LHS, advancing *POS past the
9136 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9137 lvalue containing LHS (possibly LHS itself). Does not modify
9138 the inferior's memory, nor does it modify the contents of
9139 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9141 static struct value *
9142 assign_aggregate (struct value *container,
9143 struct value *lhs, struct expression *exp,
9144 int *pos, enum noside noside)
9146 struct type *lhs_type;
9147 int n = exp->elts[*pos+1].longconst;
9148 LONGEST low_index, high_index;
9151 int max_indices, num_indices;
9155 if (noside != EVAL_NORMAL)
9157 for (i = 0; i < n; i += 1)
9158 ada_evaluate_subexp (NULL, exp, pos, noside);
9162 container = ada_coerce_ref (container);
9163 if (ada_is_direct_array_type (value_type (container)))
9164 container = ada_coerce_to_simple_array (container);
9165 lhs = ada_coerce_ref (lhs);
9166 if (!deprecated_value_modifiable (lhs))
9167 error (_("Left operand of assignment is not a modifiable lvalue."));
9169 lhs_type = value_type (lhs);
9170 if (ada_is_direct_array_type (lhs_type))
9172 lhs = ada_coerce_to_simple_array (lhs);
9173 lhs_type = value_type (lhs);
9174 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
9175 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
9177 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
9180 high_index = num_visible_fields (lhs_type) - 1;
9183 error (_("Left-hand side must be array or record."));
9185 num_specs = num_component_specs (exp, *pos - 3);
9186 max_indices = 4 * num_specs + 4;
9187 indices = alloca (max_indices * sizeof (indices[0]));
9188 indices[0] = indices[1] = low_index - 1;
9189 indices[2] = indices[3] = high_index + 1;
9192 for (i = 0; i < n; i += 1)
9194 switch (exp->elts[*pos].opcode)
9197 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
9198 &num_indices, max_indices,
9199 low_index, high_index);
9202 aggregate_assign_positional (container, lhs, exp, pos, indices,
9203 &num_indices, max_indices,
9204 low_index, high_index);
9208 error (_("Misplaced 'others' clause"));
9209 aggregate_assign_others (container, lhs, exp, pos, indices,
9210 num_indices, low_index, high_index);
9213 error (_("Internal error: bad aggregate clause"));
9220 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9221 construct at *POS, updating *POS past the construct, given that
9222 the positions are relative to lower bound LOW, where HIGH is the
9223 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9224 updating *NUM_INDICES as needed. CONTAINER is as for
9225 assign_aggregate. */
9227 aggregate_assign_positional (struct value *container,
9228 struct value *lhs, struct expression *exp,
9229 int *pos, LONGEST *indices, int *num_indices,
9230 int max_indices, LONGEST low, LONGEST high)
9232 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
9234 if (ind - 1 == high)
9235 warning (_("Extra components in aggregate ignored."));
9238 add_component_interval (ind, ind, indices, num_indices, max_indices);
9240 assign_component (container, lhs, ind, exp, pos);
9243 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9246 /* Assign into the components of LHS indexed by the OP_CHOICES
9247 construct at *POS, updating *POS past the construct, given that
9248 the allowable indices are LOW..HIGH. Record the indices assigned
9249 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9250 needed. CONTAINER is as for assign_aggregate. */
9252 aggregate_assign_from_choices (struct value *container,
9253 struct value *lhs, struct expression *exp,
9254 int *pos, LONGEST *indices, int *num_indices,
9255 int max_indices, LONGEST low, LONGEST high)
9258 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
9259 int choice_pos, expr_pc;
9260 int is_array = ada_is_direct_array_type (value_type (lhs));
9262 choice_pos = *pos += 3;
9264 for (j = 0; j < n_choices; j += 1)
9265 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9267 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9269 for (j = 0; j < n_choices; j += 1)
9271 LONGEST lower, upper;
9272 enum exp_opcode op = exp->elts[choice_pos].opcode;
9274 if (op == OP_DISCRETE_RANGE)
9277 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9279 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9284 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
9296 name = &exp->elts[choice_pos + 2].string;
9299 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
9302 error (_("Invalid record component association."));
9304 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
9306 if (! find_struct_field (name, value_type (lhs), 0,
9307 NULL, NULL, NULL, NULL, &ind))
9308 error (_("Unknown component name: %s."), name);
9309 lower = upper = ind;
9312 if (lower <= upper && (lower < low || upper > high))
9313 error (_("Index in component association out of bounds."));
9315 add_component_interval (lower, upper, indices, num_indices,
9317 while (lower <= upper)
9322 assign_component (container, lhs, lower, exp, &pos1);
9328 /* Assign the value of the expression in the OP_OTHERS construct in
9329 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9330 have not been previously assigned. The index intervals already assigned
9331 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9332 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9334 aggregate_assign_others (struct value *container,
9335 struct value *lhs, struct expression *exp,
9336 int *pos, LONGEST *indices, int num_indices,
9337 LONGEST low, LONGEST high)
9340 int expr_pc = *pos + 1;
9342 for (i = 0; i < num_indices - 2; i += 2)
9346 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
9351 assign_component (container, lhs, ind, exp, &localpos);
9354 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9357 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9358 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9359 modifying *SIZE as needed. It is an error if *SIZE exceeds
9360 MAX_SIZE. The resulting intervals do not overlap. */
9362 add_component_interval (LONGEST low, LONGEST high,
9363 LONGEST* indices, int *size, int max_size)
9367 for (i = 0; i < *size; i += 2) {
9368 if (high >= indices[i] && low <= indices[i + 1])
9372 for (kh = i + 2; kh < *size; kh += 2)
9373 if (high < indices[kh])
9375 if (low < indices[i])
9377 indices[i + 1] = indices[kh - 1];
9378 if (high > indices[i + 1])
9379 indices[i + 1] = high;
9380 memcpy (indices + i + 2, indices + kh, *size - kh);
9381 *size -= kh - i - 2;
9384 else if (high < indices[i])
9388 if (*size == max_size)
9389 error (_("Internal error: miscounted aggregate components."));
9391 for (j = *size-1; j >= i+2; j -= 1)
9392 indices[j] = indices[j - 2];
9394 indices[i + 1] = high;
9397 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9400 static struct value *
9401 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
9403 if (type == ada_check_typedef (value_type (arg2)))
9406 if (ada_is_fixed_point_type (type))
9407 return (cast_to_fixed (type, arg2));
9409 if (ada_is_fixed_point_type (value_type (arg2)))
9410 return cast_from_fixed (type, arg2);
9412 return value_cast (type, arg2);
9415 /* Evaluating Ada expressions, and printing their result.
9416 ------------------------------------------------------
9421 We usually evaluate an Ada expression in order to print its value.
9422 We also evaluate an expression in order to print its type, which
9423 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9424 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9425 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9426 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9429 Evaluating expressions is a little more complicated for Ada entities
9430 than it is for entities in languages such as C. The main reason for
9431 this is that Ada provides types whose definition might be dynamic.
9432 One example of such types is variant records. Or another example
9433 would be an array whose bounds can only be known at run time.
9435 The following description is a general guide as to what should be
9436 done (and what should NOT be done) in order to evaluate an expression
9437 involving such types, and when. This does not cover how the semantic
9438 information is encoded by GNAT as this is covered separatly. For the
9439 document used as the reference for the GNAT encoding, see exp_dbug.ads
9440 in the GNAT sources.
9442 Ideally, we should embed each part of this description next to its
9443 associated code. Unfortunately, the amount of code is so vast right
9444 now that it's hard to see whether the code handling a particular
9445 situation might be duplicated or not. One day, when the code is
9446 cleaned up, this guide might become redundant with the comments
9447 inserted in the code, and we might want to remove it.
9449 2. ``Fixing'' an Entity, the Simple Case:
9450 -----------------------------------------
9452 When evaluating Ada expressions, the tricky issue is that they may
9453 reference entities whose type contents and size are not statically
9454 known. Consider for instance a variant record:
9456 type Rec (Empty : Boolean := True) is record
9459 when False => Value : Integer;
9462 Yes : Rec := (Empty => False, Value => 1);
9463 No : Rec := (empty => True);
9465 The size and contents of that record depends on the value of the
9466 descriminant (Rec.Empty). At this point, neither the debugging
9467 information nor the associated type structure in GDB are able to
9468 express such dynamic types. So what the debugger does is to create
9469 "fixed" versions of the type that applies to the specific object.
9470 We also informally refer to this opperation as "fixing" an object,
9471 which means creating its associated fixed type.
9473 Example: when printing the value of variable "Yes" above, its fixed
9474 type would look like this:
9481 On the other hand, if we printed the value of "No", its fixed type
9488 Things become a little more complicated when trying to fix an entity
9489 with a dynamic type that directly contains another dynamic type,
9490 such as an array of variant records, for instance. There are
9491 two possible cases: Arrays, and records.
9493 3. ``Fixing'' Arrays:
9494 ---------------------
9496 The type structure in GDB describes an array in terms of its bounds,
9497 and the type of its elements. By design, all elements in the array
9498 have the same type and we cannot represent an array of variant elements
9499 using the current type structure in GDB. When fixing an array,
9500 we cannot fix the array element, as we would potentially need one
9501 fixed type per element of the array. As a result, the best we can do
9502 when fixing an array is to produce an array whose bounds and size
9503 are correct (allowing us to read it from memory), but without having
9504 touched its element type. Fixing each element will be done later,
9505 when (if) necessary.
9507 Arrays are a little simpler to handle than records, because the same
9508 amount of memory is allocated for each element of the array, even if
9509 the amount of space actually used by each element differs from element
9510 to element. Consider for instance the following array of type Rec:
9512 type Rec_Array is array (1 .. 2) of Rec;
9514 The actual amount of memory occupied by each element might be different
9515 from element to element, depending on the value of their discriminant.
9516 But the amount of space reserved for each element in the array remains
9517 fixed regardless. So we simply need to compute that size using
9518 the debugging information available, from which we can then determine
9519 the array size (we multiply the number of elements of the array by
9520 the size of each element).
9522 The simplest case is when we have an array of a constrained element
9523 type. For instance, consider the following type declarations:
9525 type Bounded_String (Max_Size : Integer) is
9527 Buffer : String (1 .. Max_Size);
9529 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9531 In this case, the compiler describes the array as an array of
9532 variable-size elements (identified by its XVS suffix) for which
9533 the size can be read in the parallel XVZ variable.
9535 In the case of an array of an unconstrained element type, the compiler
9536 wraps the array element inside a private PAD type. This type should not
9537 be shown to the user, and must be "unwrap"'ed before printing. Note
9538 that we also use the adjective "aligner" in our code to designate
9539 these wrapper types.
9541 In some cases, the size allocated for each element is statically
9542 known. In that case, the PAD type already has the correct size,
9543 and the array element should remain unfixed.
9545 But there are cases when this size is not statically known.
9546 For instance, assuming that "Five" is an integer variable:
9548 type Dynamic is array (1 .. Five) of Integer;
9549 type Wrapper (Has_Length : Boolean := False) is record
9552 when True => Length : Integer;
9556 type Wrapper_Array is array (1 .. 2) of Wrapper;
9558 Hello : Wrapper_Array := (others => (Has_Length => True,
9559 Data => (others => 17),
9563 The debugging info would describe variable Hello as being an
9564 array of a PAD type. The size of that PAD type is not statically
9565 known, but can be determined using a parallel XVZ variable.
9566 In that case, a copy of the PAD type with the correct size should
9567 be used for the fixed array.
9569 3. ``Fixing'' record type objects:
9570 ----------------------------------
9572 Things are slightly different from arrays in the case of dynamic
9573 record types. In this case, in order to compute the associated
9574 fixed type, we need to determine the size and offset of each of
9575 its components. This, in turn, requires us to compute the fixed
9576 type of each of these components.
9578 Consider for instance the example:
9580 type Bounded_String (Max_Size : Natural) is record
9581 Str : String (1 .. Max_Size);
9584 My_String : Bounded_String (Max_Size => 10);
9586 In that case, the position of field "Length" depends on the size
9587 of field Str, which itself depends on the value of the Max_Size
9588 discriminant. In order to fix the type of variable My_String,
9589 we need to fix the type of field Str. Therefore, fixing a variant
9590 record requires us to fix each of its components.
9592 However, if a component does not have a dynamic size, the component
9593 should not be fixed. In particular, fields that use a PAD type
9594 should not fixed. Here is an example where this might happen
9595 (assuming type Rec above):
9597 type Container (Big : Boolean) is record
9601 when True => Another : Integer;
9605 My_Container : Container := (Big => False,
9606 First => (Empty => True),
9609 In that example, the compiler creates a PAD type for component First,
9610 whose size is constant, and then positions the component After just
9611 right after it. The offset of component After is therefore constant
9614 The debugger computes the position of each field based on an algorithm
9615 that uses, among other things, the actual position and size of the field
9616 preceding it. Let's now imagine that the user is trying to print
9617 the value of My_Container. If the type fixing was recursive, we would
9618 end up computing the offset of field After based on the size of the
9619 fixed version of field First. And since in our example First has
9620 only one actual field, the size of the fixed type is actually smaller
9621 than the amount of space allocated to that field, and thus we would
9622 compute the wrong offset of field After.
9624 To make things more complicated, we need to watch out for dynamic
9625 components of variant records (identified by the ___XVL suffix in
9626 the component name). Even if the target type is a PAD type, the size
9627 of that type might not be statically known. So the PAD type needs
9628 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9629 we might end up with the wrong size for our component. This can be
9630 observed with the following type declarations:
9632 type Octal is new Integer range 0 .. 7;
9633 type Octal_Array is array (Positive range <>) of Octal;
9634 pragma Pack (Octal_Array);
9636 type Octal_Buffer (Size : Positive) is record
9637 Buffer : Octal_Array (1 .. Size);
9641 In that case, Buffer is a PAD type whose size is unset and needs
9642 to be computed by fixing the unwrapped type.
9644 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9645 ----------------------------------------------------------
9647 Lastly, when should the sub-elements of an entity that remained unfixed
9648 thus far, be actually fixed?
9650 The answer is: Only when referencing that element. For instance
9651 when selecting one component of a record, this specific component
9652 should be fixed at that point in time. Or when printing the value
9653 of a record, each component should be fixed before its value gets
9654 printed. Similarly for arrays, the element of the array should be
9655 fixed when printing each element of the array, or when extracting
9656 one element out of that array. On the other hand, fixing should
9657 not be performed on the elements when taking a slice of an array!
9659 Note that one of the side-effects of miscomputing the offset and
9660 size of each field is that we end up also miscomputing the size
9661 of the containing type. This can have adverse results when computing
9662 the value of an entity. GDB fetches the value of an entity based
9663 on the size of its type, and thus a wrong size causes GDB to fetch
9664 the wrong amount of memory. In the case where the computed size is
9665 too small, GDB fetches too little data to print the value of our
9666 entiry. Results in this case as unpredicatble, as we usually read
9667 past the buffer containing the data =:-o. */
9669 /* Implement the evaluate_exp routine in the exp_descriptor structure
9670 for the Ada language. */
9672 static struct value *
9673 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
9674 int *pos, enum noside noside)
9679 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
9682 struct value **argvec;
9686 op = exp->elts[pc].opcode;
9692 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9694 if (noside == EVAL_NORMAL)
9695 arg1 = unwrap_value (arg1);
9697 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9698 then we need to perform the conversion manually, because
9699 evaluate_subexp_standard doesn't do it. This conversion is
9700 necessary in Ada because the different kinds of float/fixed
9701 types in Ada have different representations.
9703 Similarly, we need to perform the conversion from OP_LONG
9705 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
9706 arg1 = ada_value_cast (expect_type, arg1, noside);
9712 struct value *result;
9715 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
9716 /* The result type will have code OP_STRING, bashed there from
9717 OP_ARRAY. Bash it back. */
9718 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
9719 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
9725 type = exp->elts[pc + 1].type;
9726 arg1 = evaluate_subexp (type, exp, pos, noside);
9727 if (noside == EVAL_SKIP)
9729 arg1 = ada_value_cast (type, arg1, noside);
9734 type = exp->elts[pc + 1].type;
9735 return ada_evaluate_subexp (type, exp, pos, noside);
9738 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9739 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9741 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
9742 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9744 return ada_value_assign (arg1, arg1);
9746 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9747 except if the lhs of our assignment is a convenience variable.
9748 In the case of assigning to a convenience variable, the lhs
9749 should be exactly the result of the evaluation of the rhs. */
9750 type = value_type (arg1);
9751 if (VALUE_LVAL (arg1) == lval_internalvar)
9753 arg2 = evaluate_subexp (type, exp, pos, noside);
9754 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9756 if (ada_is_fixed_point_type (value_type (arg1)))
9757 arg2 = cast_to_fixed (value_type (arg1), arg2);
9758 else if (ada_is_fixed_point_type (value_type (arg2)))
9760 (_("Fixed-point values must be assigned to fixed-point variables"));
9762 arg2 = coerce_for_assign (value_type (arg1), arg2);
9763 return ada_value_assign (arg1, arg2);
9766 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9767 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9768 if (noside == EVAL_SKIP)
9770 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9771 return (value_from_longest
9773 value_as_long (arg1) + value_as_long (arg2)));
9774 if ((ada_is_fixed_point_type (value_type (arg1))
9775 || ada_is_fixed_point_type (value_type (arg2)))
9776 && value_type (arg1) != value_type (arg2))
9777 error (_("Operands of fixed-point addition must have the same type"));
9778 /* Do the addition, and cast the result to the type of the first
9779 argument. We cannot cast the result to a reference type, so if
9780 ARG1 is a reference type, find its underlying type. */
9781 type = value_type (arg1);
9782 while (TYPE_CODE (type) == TYPE_CODE_REF)
9783 type = TYPE_TARGET_TYPE (type);
9784 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9785 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
9788 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9789 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9790 if (noside == EVAL_SKIP)
9792 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9793 return (value_from_longest
9795 value_as_long (arg1) - value_as_long (arg2)));
9796 if ((ada_is_fixed_point_type (value_type (arg1))
9797 || ada_is_fixed_point_type (value_type (arg2)))
9798 && value_type (arg1) != value_type (arg2))
9799 error (_("Operands of fixed-point subtraction "
9800 "must have the same type"));
9801 /* Do the substraction, and cast the result to the type of the first
9802 argument. We cannot cast the result to a reference type, so if
9803 ARG1 is a reference type, find its underlying type. */
9804 type = value_type (arg1);
9805 while (TYPE_CODE (type) == TYPE_CODE_REF)
9806 type = TYPE_TARGET_TYPE (type);
9807 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9808 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
9814 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9815 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9816 if (noside == EVAL_SKIP)
9818 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9820 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9821 return value_zero (value_type (arg1), not_lval);
9825 type = builtin_type (exp->gdbarch)->builtin_double;
9826 if (ada_is_fixed_point_type (value_type (arg1)))
9827 arg1 = cast_from_fixed (type, arg1);
9828 if (ada_is_fixed_point_type (value_type (arg2)))
9829 arg2 = cast_from_fixed (type, arg2);
9830 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9831 return ada_value_binop (arg1, arg2, op);
9835 case BINOP_NOTEQUAL:
9836 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9837 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
9838 if (noside == EVAL_SKIP)
9840 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9844 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9845 tem = ada_value_equal (arg1, arg2);
9847 if (op == BINOP_NOTEQUAL)
9849 type = language_bool_type (exp->language_defn, exp->gdbarch);
9850 return value_from_longest (type, (LONGEST) tem);
9853 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9854 if (noside == EVAL_SKIP)
9856 else if (ada_is_fixed_point_type (value_type (arg1)))
9857 return value_cast (value_type (arg1), value_neg (arg1));
9860 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9861 return value_neg (arg1);
9864 case BINOP_LOGICAL_AND:
9865 case BINOP_LOGICAL_OR:
9866 case UNOP_LOGICAL_NOT:
9871 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9872 type = language_bool_type (exp->language_defn, exp->gdbarch);
9873 return value_cast (type, val);
9876 case BINOP_BITWISE_AND:
9877 case BINOP_BITWISE_IOR:
9878 case BINOP_BITWISE_XOR:
9882 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9884 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9886 return value_cast (value_type (arg1), val);
9892 if (noside == EVAL_SKIP)
9897 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
9898 /* Only encountered when an unresolved symbol occurs in a
9899 context other than a function call, in which case, it is
9901 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9902 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
9903 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9905 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
9906 /* Check to see if this is a tagged type. We also need to handle
9907 the case where the type is a reference to a tagged type, but
9908 we have to be careful to exclude pointers to tagged types.
9909 The latter should be shown as usual (as a pointer), whereas
9910 a reference should mostly be transparent to the user. */
9911 if (ada_is_tagged_type (type, 0)
9912 || (TYPE_CODE(type) == TYPE_CODE_REF
9913 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
9915 /* Tagged types are a little special in the fact that the real
9916 type is dynamic and can only be determined by inspecting the
9917 object's tag. This means that we need to get the object's
9918 value first (EVAL_NORMAL) and then extract the actual object
9921 Note that we cannot skip the final step where we extract
9922 the object type from its tag, because the EVAL_NORMAL phase
9923 results in dynamic components being resolved into fixed ones.
9924 This can cause problems when trying to print the type
9925 description of tagged types whose parent has a dynamic size:
9926 We use the type name of the "_parent" component in order
9927 to print the name of the ancestor type in the type description.
9928 If that component had a dynamic size, the resolution into
9929 a fixed type would result in the loss of that type name,
9930 thus preventing us from printing the name of the ancestor
9931 type in the type description. */
9932 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
9934 if (TYPE_CODE (type) != TYPE_CODE_REF)
9936 struct type *actual_type;
9938 actual_type = type_from_tag (ada_value_tag (arg1));
9939 if (actual_type == NULL)
9940 /* If, for some reason, we were unable to determine
9941 the actual type from the tag, then use the static
9942 approximation that we just computed as a fallback.
9943 This can happen if the debugging information is
9944 incomplete, for instance. */
9946 return value_zero (actual_type, not_lval);
9950 /* In the case of a ref, ada_coerce_ref takes care
9951 of determining the actual type. But the evaluation
9952 should return a ref as it should be valid to ask
9953 for its address; so rebuild a ref after coerce. */
9954 arg1 = ada_coerce_ref (arg1);
9955 return value_ref (arg1);
9961 (to_static_fixed_type
9962 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
9967 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9968 return ada_to_fixed_value (arg1);
9974 /* Allocate arg vector, including space for the function to be
9975 called in argvec[0] and a terminating NULL. */
9976 nargs = longest_to_int (exp->elts[pc + 1].longconst);
9978 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
9980 if (exp->elts[*pos].opcode == OP_VAR_VALUE
9981 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
9982 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9983 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
9986 for (tem = 0; tem <= nargs; tem += 1)
9987 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9990 if (noside == EVAL_SKIP)
9994 if (ada_is_constrained_packed_array_type
9995 (desc_base_type (value_type (argvec[0]))))
9996 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
9997 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9998 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
9999 /* This is a packed array that has already been fixed, and
10000 therefore already coerced to a simple array. Nothing further
10003 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
10004 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10005 && VALUE_LVAL (argvec[0]) == lval_memory))
10006 argvec[0] = value_addr (argvec[0]);
10008 type = ada_check_typedef (value_type (argvec[0]));
10010 /* Ada allows us to implicitly dereference arrays when subscripting
10011 them. So, if this is an array typedef (encoding use for array
10012 access types encoded as fat pointers), strip it now. */
10013 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
10014 type = ada_typedef_target_type (type);
10016 if (TYPE_CODE (type) == TYPE_CODE_PTR)
10018 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
10020 case TYPE_CODE_FUNC:
10021 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10023 case TYPE_CODE_ARRAY:
10025 case TYPE_CODE_STRUCT:
10026 if (noside != EVAL_AVOID_SIDE_EFFECTS)
10027 argvec[0] = ada_value_ind (argvec[0]);
10028 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10031 error (_("cannot subscript or call something of type `%s'"),
10032 ada_type_name (value_type (argvec[0])));
10037 switch (TYPE_CODE (type))
10039 case TYPE_CODE_FUNC:
10040 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10042 struct type *rtype = TYPE_TARGET_TYPE (type);
10044 if (TYPE_GNU_IFUNC (type))
10045 return allocate_value (TYPE_TARGET_TYPE (rtype));
10046 return allocate_value (rtype);
10048 return call_function_by_hand (argvec[0], nargs, argvec + 1);
10049 case TYPE_CODE_INTERNAL_FUNCTION:
10050 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10051 /* We don't know anything about what the internal
10052 function might return, but we have to return
10054 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10057 return call_internal_function (exp->gdbarch, exp->language_defn,
10058 argvec[0], nargs, argvec + 1);
10060 case TYPE_CODE_STRUCT:
10064 arity = ada_array_arity (type);
10065 type = ada_array_element_type (type, nargs);
10067 error (_("cannot subscript or call a record"));
10068 if (arity != nargs)
10069 error (_("wrong number of subscripts; expecting %d"), arity);
10070 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10071 return value_zero (ada_aligned_type (type), lval_memory);
10073 unwrap_value (ada_value_subscript
10074 (argvec[0], nargs, argvec + 1));
10076 case TYPE_CODE_ARRAY:
10077 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10079 type = ada_array_element_type (type, nargs);
10081 error (_("element type of array unknown"));
10083 return value_zero (ada_aligned_type (type), lval_memory);
10086 unwrap_value (ada_value_subscript
10087 (ada_coerce_to_simple_array (argvec[0]),
10088 nargs, argvec + 1));
10089 case TYPE_CODE_PTR: /* Pointer to array */
10090 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
10091 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10093 type = ada_array_element_type (type, nargs);
10095 error (_("element type of array unknown"));
10097 return value_zero (ada_aligned_type (type), lval_memory);
10100 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
10101 nargs, argvec + 1));
10104 error (_("Attempt to index or call something other than an "
10105 "array or function"));
10110 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10111 struct value *low_bound_val =
10112 evaluate_subexp (NULL_TYPE, exp, pos, noside);
10113 struct value *high_bound_val =
10114 evaluate_subexp (NULL_TYPE, exp, pos, noside);
10116 LONGEST high_bound;
10118 low_bound_val = coerce_ref (low_bound_val);
10119 high_bound_val = coerce_ref (high_bound_val);
10120 low_bound = pos_atr (low_bound_val);
10121 high_bound = pos_atr (high_bound_val);
10123 if (noside == EVAL_SKIP)
10126 /* If this is a reference to an aligner type, then remove all
10128 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
10129 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
10130 TYPE_TARGET_TYPE (value_type (array)) =
10131 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
10133 if (ada_is_constrained_packed_array_type (value_type (array)))
10134 error (_("cannot slice a packed array"));
10136 /* If this is a reference to an array or an array lvalue,
10137 convert to a pointer. */
10138 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
10139 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
10140 && VALUE_LVAL (array) == lval_memory))
10141 array = value_addr (array);
10143 if (noside == EVAL_AVOID_SIDE_EFFECTS
10144 && ada_is_array_descriptor_type (ada_check_typedef
10145 (value_type (array))))
10146 return empty_array (ada_type_of_array (array, 0), low_bound);
10148 array = ada_coerce_to_simple_array_ptr (array);
10150 /* If we have more than one level of pointer indirection,
10151 dereference the value until we get only one level. */
10152 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
10153 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
10155 array = value_ind (array);
10157 /* Make sure we really do have an array type before going further,
10158 to avoid a SEGV when trying to get the index type or the target
10159 type later down the road if the debug info generated by
10160 the compiler is incorrect or incomplete. */
10161 if (!ada_is_simple_array_type (value_type (array)))
10162 error (_("cannot take slice of non-array"));
10164 if (TYPE_CODE (ada_check_typedef (value_type (array)))
10167 struct type *type0 = ada_check_typedef (value_type (array));
10169 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
10170 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
10173 struct type *arr_type0 =
10174 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
10176 return ada_value_slice_from_ptr (array, arr_type0,
10177 longest_to_int (low_bound),
10178 longest_to_int (high_bound));
10181 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10183 else if (high_bound < low_bound)
10184 return empty_array (value_type (array), low_bound);
10186 return ada_value_slice (array, longest_to_int (low_bound),
10187 longest_to_int (high_bound));
10190 case UNOP_IN_RANGE:
10192 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10193 type = check_typedef (exp->elts[pc + 1].type);
10195 if (noside == EVAL_SKIP)
10198 switch (TYPE_CODE (type))
10201 lim_warning (_("Membership test incompletely implemented; "
10202 "always returns true"));
10203 type = language_bool_type (exp->language_defn, exp->gdbarch);
10204 return value_from_longest (type, (LONGEST) 1);
10206 case TYPE_CODE_RANGE:
10207 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
10208 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
10209 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10210 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10211 type = language_bool_type (exp->language_defn, exp->gdbarch);
10213 value_from_longest (type,
10214 (value_less (arg1, arg3)
10215 || value_equal (arg1, arg3))
10216 && (value_less (arg2, arg1)
10217 || value_equal (arg2, arg1)));
10220 case BINOP_IN_BOUNDS:
10222 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10223 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10225 if (noside == EVAL_SKIP)
10228 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10230 type = language_bool_type (exp->language_defn, exp->gdbarch);
10231 return value_zero (type, not_lval);
10234 tem = longest_to_int (exp->elts[pc + 1].longconst);
10236 type = ada_index_type (value_type (arg2), tem, "range");
10238 type = value_type (arg1);
10240 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
10241 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
10243 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10244 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10245 type = language_bool_type (exp->language_defn, exp->gdbarch);
10247 value_from_longest (type,
10248 (value_less (arg1, arg3)
10249 || value_equal (arg1, arg3))
10250 && (value_less (arg2, arg1)
10251 || value_equal (arg2, arg1)));
10253 case TERNOP_IN_RANGE:
10254 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10255 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10256 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10258 if (noside == EVAL_SKIP)
10261 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10262 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10263 type = language_bool_type (exp->language_defn, exp->gdbarch);
10265 value_from_longest (type,
10266 (value_less (arg1, arg3)
10267 || value_equal (arg1, arg3))
10268 && (value_less (arg2, arg1)
10269 || value_equal (arg2, arg1)));
10273 case OP_ATR_LENGTH:
10275 struct type *type_arg;
10277 if (exp->elts[*pos].opcode == OP_TYPE)
10279 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10281 type_arg = check_typedef (exp->elts[pc + 2].type);
10285 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10289 if (exp->elts[*pos].opcode != OP_LONG)
10290 error (_("Invalid operand to '%s"), ada_attribute_name (op));
10291 tem = longest_to_int (exp->elts[*pos + 2].longconst);
10294 if (noside == EVAL_SKIP)
10297 if (type_arg == NULL)
10299 arg1 = ada_coerce_ref (arg1);
10301 if (ada_is_constrained_packed_array_type (value_type (arg1)))
10302 arg1 = ada_coerce_to_simple_array (arg1);
10304 type = ada_index_type (value_type (arg1), tem,
10305 ada_attribute_name (op));
10307 type = builtin_type (exp->gdbarch)->builtin_int;
10309 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10310 return allocate_value (type);
10314 default: /* Should never happen. */
10315 error (_("unexpected attribute encountered"));
10317 return value_from_longest
10318 (type, ada_array_bound (arg1, tem, 0));
10320 return value_from_longest
10321 (type, ada_array_bound (arg1, tem, 1));
10322 case OP_ATR_LENGTH:
10323 return value_from_longest
10324 (type, ada_array_length (arg1, tem));
10327 else if (discrete_type_p (type_arg))
10329 struct type *range_type;
10330 const char *name = ada_type_name (type_arg);
10333 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
10334 range_type = to_fixed_range_type (type_arg, NULL);
10335 if (range_type == NULL)
10336 range_type = type_arg;
10340 error (_("unexpected attribute encountered"));
10342 return value_from_longest
10343 (range_type, ada_discrete_type_low_bound (range_type));
10345 return value_from_longest
10346 (range_type, ada_discrete_type_high_bound (range_type));
10347 case OP_ATR_LENGTH:
10348 error (_("the 'length attribute applies only to array types"));
10351 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
10352 error (_("unimplemented type attribute"));
10357 if (ada_is_constrained_packed_array_type (type_arg))
10358 type_arg = decode_constrained_packed_array_type (type_arg);
10360 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
10362 type = builtin_type (exp->gdbarch)->builtin_int;
10364 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10365 return allocate_value (type);
10370 error (_("unexpected attribute encountered"));
10372 low = ada_array_bound_from_type (type_arg, tem, 0);
10373 return value_from_longest (type, low);
10375 high = ada_array_bound_from_type (type_arg, tem, 1);
10376 return value_from_longest (type, high);
10377 case OP_ATR_LENGTH:
10378 low = ada_array_bound_from_type (type_arg, tem, 0);
10379 high = ada_array_bound_from_type (type_arg, tem, 1);
10380 return value_from_longest (type, high - low + 1);
10386 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10387 if (noside == EVAL_SKIP)
10390 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10391 return value_zero (ada_tag_type (arg1), not_lval);
10393 return ada_value_tag (arg1);
10397 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10398 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10399 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10400 if (noside == EVAL_SKIP)
10402 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10403 return value_zero (value_type (arg1), not_lval);
10406 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10407 return value_binop (arg1, arg2,
10408 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
10411 case OP_ATR_MODULUS:
10413 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
10415 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10416 if (noside == EVAL_SKIP)
10419 if (!ada_is_modular_type (type_arg))
10420 error (_("'modulus must be applied to modular type"));
10422 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
10423 ada_modulus (type_arg));
10428 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10429 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10430 if (noside == EVAL_SKIP)
10432 type = builtin_type (exp->gdbarch)->builtin_int;
10433 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10434 return value_zero (type, not_lval);
10436 return value_pos_atr (type, arg1);
10439 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10440 type = value_type (arg1);
10442 /* If the argument is a reference, then dereference its type, since
10443 the user is really asking for the size of the actual object,
10444 not the size of the pointer. */
10445 if (TYPE_CODE (type) == TYPE_CODE_REF)
10446 type = TYPE_TARGET_TYPE (type);
10448 if (noside == EVAL_SKIP)
10450 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10451 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
10453 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
10454 TARGET_CHAR_BIT * TYPE_LENGTH (type));
10457 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10458 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10459 type = exp->elts[pc + 2].type;
10460 if (noside == EVAL_SKIP)
10462 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10463 return value_zero (type, not_lval);
10465 return value_val_atr (type, arg1);
10468 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10469 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10470 if (noside == EVAL_SKIP)
10472 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10473 return value_zero (value_type (arg1), not_lval);
10476 /* For integer exponentiation operations,
10477 only promote the first argument. */
10478 if (is_integral_type (value_type (arg2)))
10479 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10481 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10483 return value_binop (arg1, arg2, op);
10487 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10488 if (noside == EVAL_SKIP)
10494 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10495 if (noside == EVAL_SKIP)
10497 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10498 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
10499 return value_neg (arg1);
10504 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10505 if (noside == EVAL_SKIP)
10507 type = ada_check_typedef (value_type (arg1));
10508 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10510 if (ada_is_array_descriptor_type (type))
10511 /* GDB allows dereferencing GNAT array descriptors. */
10513 struct type *arrType = ada_type_of_array (arg1, 0);
10515 if (arrType == NULL)
10516 error (_("Attempt to dereference null array pointer."));
10517 return value_at_lazy (arrType, 0);
10519 else if (TYPE_CODE (type) == TYPE_CODE_PTR
10520 || TYPE_CODE (type) == TYPE_CODE_REF
10521 /* In C you can dereference an array to get the 1st elt. */
10522 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
10524 type = to_static_fixed_type
10526 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
10528 return value_zero (type, lval_memory);
10530 else if (TYPE_CODE (type) == TYPE_CODE_INT)
10532 /* GDB allows dereferencing an int. */
10533 if (expect_type == NULL)
10534 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10539 to_static_fixed_type (ada_aligned_type (expect_type));
10540 return value_zero (expect_type, lval_memory);
10544 error (_("Attempt to take contents of a non-pointer value."));
10546 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
10547 type = ada_check_typedef (value_type (arg1));
10549 if (TYPE_CODE (type) == TYPE_CODE_INT)
10550 /* GDB allows dereferencing an int. If we were given
10551 the expect_type, then use that as the target type.
10552 Otherwise, assume that the target type is an int. */
10554 if (expect_type != NULL)
10555 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
10558 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
10559 (CORE_ADDR) value_as_address (arg1));
10562 if (ada_is_array_descriptor_type (type))
10563 /* GDB allows dereferencing GNAT array descriptors. */
10564 return ada_coerce_to_simple_array (arg1);
10566 return ada_value_ind (arg1);
10568 case STRUCTOP_STRUCT:
10569 tem = longest_to_int (exp->elts[pc + 1].longconst);
10570 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
10571 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10572 if (noside == EVAL_SKIP)
10574 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10576 struct type *type1 = value_type (arg1);
10578 if (ada_is_tagged_type (type1, 1))
10580 type = ada_lookup_struct_elt_type (type1,
10581 &exp->elts[pc + 2].string,
10584 /* In this case, we assume that the field COULD exist
10585 in some extension of the type. Return an object of
10586 "type" void, which will match any formal
10587 (see ada_type_match). */
10588 return value_zero (builtin_type (exp->gdbarch)->builtin_void,
10593 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
10596 return value_zero (ada_aligned_type (type), lval_memory);
10599 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
10600 arg1 = unwrap_value (arg1);
10601 return ada_to_fixed_value (arg1);
10604 /* The value is not supposed to be used. This is here to make it
10605 easier to accommodate expressions that contain types. */
10607 if (noside == EVAL_SKIP)
10609 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10610 return allocate_value (exp->elts[pc + 1].type);
10612 error (_("Attempt to use a type name as an expression"));
10617 case OP_DISCRETE_RANGE:
10618 case OP_POSITIONAL:
10620 if (noside == EVAL_NORMAL)
10624 error (_("Undefined name, ambiguous name, or renaming used in "
10625 "component association: %s."), &exp->elts[pc+2].string);
10627 error (_("Aggregates only allowed on the right of an assignment"));
10629 internal_error (__FILE__, __LINE__,
10630 _("aggregate apparently mangled"));
10633 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10635 for (tem = 0; tem < nargs; tem += 1)
10636 ada_evaluate_subexp (NULL, exp, pos, noside);
10641 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
10647 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10648 type name that encodes the 'small and 'delta information.
10649 Otherwise, return NULL. */
10651 static const char *
10652 fixed_type_info (struct type *type)
10654 const char *name = ada_type_name (type);
10655 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
10657 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
10659 const char *tail = strstr (name, "___XF_");
10666 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
10667 return fixed_type_info (TYPE_TARGET_TYPE (type));
10672 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10675 ada_is_fixed_point_type (struct type *type)
10677 return fixed_type_info (type) != NULL;
10680 /* Return non-zero iff TYPE represents a System.Address type. */
10683 ada_is_system_address_type (struct type *type)
10685 return (TYPE_NAME (type)
10686 && strcmp (TYPE_NAME (type), "system__address") == 0);
10689 /* Assuming that TYPE is the representation of an Ada fixed-point
10690 type, return its delta, or -1 if the type is malformed and the
10691 delta cannot be determined. */
10694 ada_delta (struct type *type)
10696 const char *encoding = fixed_type_info (type);
10699 /* Strictly speaking, num and den are encoded as integer. However,
10700 they may not fit into a long, and they will have to be converted
10701 to DOUBLEST anyway. So scan them as DOUBLEST. */
10702 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10709 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10710 factor ('SMALL value) associated with the type. */
10713 scaling_factor (struct type *type)
10715 const char *encoding = fixed_type_info (type);
10716 DOUBLEST num0, den0, num1, den1;
10719 /* Strictly speaking, num's and den's are encoded as integer. However,
10720 they may not fit into a long, and they will have to be converted
10721 to DOUBLEST anyway. So scan them as DOUBLEST. */
10722 n = sscanf (encoding,
10723 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
10724 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10725 &num0, &den0, &num1, &den1);
10730 return num1 / den1;
10732 return num0 / den0;
10736 /* Assuming that X is the representation of a value of fixed-point
10737 type TYPE, return its floating-point equivalent. */
10740 ada_fixed_to_float (struct type *type, LONGEST x)
10742 return (DOUBLEST) x *scaling_factor (type);
10745 /* The representation of a fixed-point value of type TYPE
10746 corresponding to the value X. */
10749 ada_float_to_fixed (struct type *type, DOUBLEST x)
10751 return (LONGEST) (x / scaling_factor (type) + 0.5);
10758 /* Scan STR beginning at position K for a discriminant name, and
10759 return the value of that discriminant field of DVAL in *PX. If
10760 PNEW_K is not null, put the position of the character beyond the
10761 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10762 not alter *PX and *PNEW_K if unsuccessful. */
10765 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
10768 static char *bound_buffer = NULL;
10769 static size_t bound_buffer_len = 0;
10772 struct value *bound_val;
10774 if (dval == NULL || str == NULL || str[k] == '\0')
10777 pend = strstr (str + k, "__");
10781 k += strlen (bound);
10785 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
10786 bound = bound_buffer;
10787 strncpy (bound_buffer, str + k, pend - (str + k));
10788 bound[pend - (str + k)] = '\0';
10792 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
10793 if (bound_val == NULL)
10796 *px = value_as_long (bound_val);
10797 if (pnew_k != NULL)
10802 /* Value of variable named NAME in the current environment. If
10803 no such variable found, then if ERR_MSG is null, returns 0, and
10804 otherwise causes an error with message ERR_MSG. */
10806 static struct value *
10807 get_var_value (char *name, char *err_msg)
10809 struct ada_symbol_info *syms;
10812 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
10817 if (err_msg == NULL)
10820 error (("%s"), err_msg);
10823 return value_of_variable (syms[0].sym, syms[0].block);
10826 /* Value of integer variable named NAME in the current environment. If
10827 no such variable found, returns 0, and sets *FLAG to 0. If
10828 successful, sets *FLAG to 1. */
10831 get_int_var_value (char *name, int *flag)
10833 struct value *var_val = get_var_value (name, 0);
10845 return value_as_long (var_val);
10850 /* Return a range type whose base type is that of the range type named
10851 NAME in the current environment, and whose bounds are calculated
10852 from NAME according to the GNAT range encoding conventions.
10853 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10854 corresponding range type from debug information; fall back to using it
10855 if symbol lookup fails. If a new type must be created, allocate it
10856 like ORIG_TYPE was. The bounds information, in general, is encoded
10857 in NAME, the base type given in the named range type. */
10859 static struct type *
10860 to_fixed_range_type (struct type *raw_type, struct value *dval)
10863 struct type *base_type;
10864 char *subtype_info;
10866 gdb_assert (raw_type != NULL);
10867 gdb_assert (TYPE_NAME (raw_type) != NULL);
10869 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
10870 base_type = TYPE_TARGET_TYPE (raw_type);
10872 base_type = raw_type;
10874 name = TYPE_NAME (raw_type);
10875 subtype_info = strstr (name, "___XD");
10876 if (subtype_info == NULL)
10878 LONGEST L = ada_discrete_type_low_bound (raw_type);
10879 LONGEST U = ada_discrete_type_high_bound (raw_type);
10881 if (L < INT_MIN || U > INT_MAX)
10884 return create_range_type (alloc_type_copy (raw_type), raw_type,
10885 ada_discrete_type_low_bound (raw_type),
10886 ada_discrete_type_high_bound (raw_type));
10890 static char *name_buf = NULL;
10891 static size_t name_len = 0;
10892 int prefix_len = subtype_info - name;
10898 GROW_VECT (name_buf, name_len, prefix_len + 5);
10899 strncpy (name_buf, name, prefix_len);
10900 name_buf[prefix_len] = '\0';
10903 bounds_str = strchr (subtype_info, '_');
10906 if (*subtype_info == 'L')
10908 if (!ada_scan_number (bounds_str, n, &L, &n)
10909 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
10911 if (bounds_str[n] == '_')
10913 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
10921 strcpy (name_buf + prefix_len, "___L");
10922 L = get_int_var_value (name_buf, &ok);
10925 lim_warning (_("Unknown lower bound, using 1."));
10930 if (*subtype_info == 'U')
10932 if (!ada_scan_number (bounds_str, n, &U, &n)
10933 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
10940 strcpy (name_buf + prefix_len, "___U");
10941 U = get_int_var_value (name_buf, &ok);
10944 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
10949 type = create_range_type (alloc_type_copy (raw_type), base_type, L, U);
10950 TYPE_NAME (type) = name;
10955 /* True iff NAME is the name of a range type. */
10958 ada_is_range_type_name (const char *name)
10960 return (name != NULL && strstr (name, "___XD"));
10964 /* Modular types */
10966 /* True iff TYPE is an Ada modular type. */
10969 ada_is_modular_type (struct type *type)
10971 struct type *subranged_type = get_base_type (type);
10973 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
10974 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
10975 && TYPE_UNSIGNED (subranged_type));
10978 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10981 ada_modulus (struct type *type)
10983 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
10987 /* Ada exception catchpoint support:
10988 ---------------------------------
10990 We support 3 kinds of exception catchpoints:
10991 . catchpoints on Ada exceptions
10992 . catchpoints on unhandled Ada exceptions
10993 . catchpoints on failed assertions
10995 Exceptions raised during failed assertions, or unhandled exceptions
10996 could perfectly be caught with the general catchpoint on Ada exceptions.
10997 However, we can easily differentiate these two special cases, and having
10998 the option to distinguish these two cases from the rest can be useful
10999 to zero-in on certain situations.
11001 Exception catchpoints are a specialized form of breakpoint,
11002 since they rely on inserting breakpoints inside known routines
11003 of the GNAT runtime. The implementation therefore uses a standard
11004 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11007 Support in the runtime for exception catchpoints have been changed
11008 a few times already, and these changes affect the implementation
11009 of these catchpoints. In order to be able to support several
11010 variants of the runtime, we use a sniffer that will determine
11011 the runtime variant used by the program being debugged. */
11013 /* Ada's standard exceptions. */
11015 static char *standard_exc[] = {
11016 "constraint_error",
11022 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
11024 /* A structure that describes how to support exception catchpoints
11025 for a given executable. */
11027 struct exception_support_info
11029 /* The name of the symbol to break on in order to insert
11030 a catchpoint on exceptions. */
11031 const char *catch_exception_sym;
11033 /* The name of the symbol to break on in order to insert
11034 a catchpoint on unhandled exceptions. */
11035 const char *catch_exception_unhandled_sym;
11037 /* The name of the symbol to break on in order to insert
11038 a catchpoint on failed assertions. */
11039 const char *catch_assert_sym;
11041 /* Assuming that the inferior just triggered an unhandled exception
11042 catchpoint, this function is responsible for returning the address
11043 in inferior memory where the name of that exception is stored.
11044 Return zero if the address could not be computed. */
11045 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
11048 static CORE_ADDR ada_unhandled_exception_name_addr (void);
11049 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
11051 /* The following exception support info structure describes how to
11052 implement exception catchpoints with the latest version of the
11053 Ada runtime (as of 2007-03-06). */
11055 static const struct exception_support_info default_exception_support_info =
11057 "__gnat_debug_raise_exception", /* catch_exception_sym */
11058 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11059 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11060 ada_unhandled_exception_name_addr
11063 /* The following exception support info structure describes how to
11064 implement exception catchpoints with a slightly older version
11065 of the Ada runtime. */
11067 static const struct exception_support_info exception_support_info_fallback =
11069 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11070 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11071 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11072 ada_unhandled_exception_name_addr_from_raise
11075 /* Return nonzero if we can detect the exception support routines
11076 described in EINFO.
11078 This function errors out if an abnormal situation is detected
11079 (for instance, if we find the exception support routines, but
11080 that support is found to be incomplete). */
11083 ada_has_this_exception_support (const struct exception_support_info *einfo)
11085 struct symbol *sym;
11087 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11088 that should be compiled with debugging information. As a result, we
11089 expect to find that symbol in the symtabs. */
11091 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
11094 /* Perhaps we did not find our symbol because the Ada runtime was
11095 compiled without debugging info, or simply stripped of it.
11096 It happens on some GNU/Linux distributions for instance, where
11097 users have to install a separate debug package in order to get
11098 the runtime's debugging info. In that situation, let the user
11099 know why we cannot insert an Ada exception catchpoint.
11101 Note: Just for the purpose of inserting our Ada exception
11102 catchpoint, we could rely purely on the associated minimal symbol.
11103 But we would be operating in degraded mode anyway, since we are
11104 still lacking the debugging info needed later on to extract
11105 the name of the exception being raised (this name is printed in
11106 the catchpoint message, and is also used when trying to catch
11107 a specific exception). We do not handle this case for now. */
11108 struct minimal_symbol *msym
11109 = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL);
11111 if (msym && MSYMBOL_TYPE (msym) != mst_solib_trampoline)
11112 error (_("Your Ada runtime appears to be missing some debugging "
11113 "information.\nCannot insert Ada exception catchpoint "
11114 "in this configuration."));
11119 /* Make sure that the symbol we found corresponds to a function. */
11121 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
11122 error (_("Symbol \"%s\" is not a function (class = %d)"),
11123 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
11128 /* Inspect the Ada runtime and determine which exception info structure
11129 should be used to provide support for exception catchpoints.
11131 This function will always set the per-inferior exception_info,
11132 or raise an error. */
11135 ada_exception_support_info_sniffer (void)
11137 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11139 /* If the exception info is already known, then no need to recompute it. */
11140 if (data->exception_info != NULL)
11143 /* Check the latest (default) exception support info. */
11144 if (ada_has_this_exception_support (&default_exception_support_info))
11146 data->exception_info = &default_exception_support_info;
11150 /* Try our fallback exception suport info. */
11151 if (ada_has_this_exception_support (&exception_support_info_fallback))
11153 data->exception_info = &exception_support_info_fallback;
11157 /* Sometimes, it is normal for us to not be able to find the routine
11158 we are looking for. This happens when the program is linked with
11159 the shared version of the GNAT runtime, and the program has not been
11160 started yet. Inform the user of these two possible causes if
11163 if (ada_update_initial_language (language_unknown) != language_ada)
11164 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11166 /* If the symbol does not exist, then check that the program is
11167 already started, to make sure that shared libraries have been
11168 loaded. If it is not started, this may mean that the symbol is
11169 in a shared library. */
11171 if (ptid_get_pid (inferior_ptid) == 0)
11172 error (_("Unable to insert catchpoint. Try to start the program first."));
11174 /* At this point, we know that we are debugging an Ada program and
11175 that the inferior has been started, but we still are not able to
11176 find the run-time symbols. That can mean that we are in
11177 configurable run time mode, or that a-except as been optimized
11178 out by the linker... In any case, at this point it is not worth
11179 supporting this feature. */
11181 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11184 /* True iff FRAME is very likely to be that of a function that is
11185 part of the runtime system. This is all very heuristic, but is
11186 intended to be used as advice as to what frames are uninteresting
11190 is_known_support_routine (struct frame_info *frame)
11192 struct symtab_and_line sal;
11194 enum language func_lang;
11196 const char *fullname;
11198 /* If this code does not have any debugging information (no symtab),
11199 This cannot be any user code. */
11201 find_frame_sal (frame, &sal);
11202 if (sal.symtab == NULL)
11205 /* If there is a symtab, but the associated source file cannot be
11206 located, then assume this is not user code: Selecting a frame
11207 for which we cannot display the code would not be very helpful
11208 for the user. This should also take care of case such as VxWorks
11209 where the kernel has some debugging info provided for a few units. */
11211 fullname = symtab_to_fullname (sal.symtab);
11212 if (access (fullname, R_OK) != 0)
11215 /* Check the unit filename againt the Ada runtime file naming.
11216 We also check the name of the objfile against the name of some
11217 known system libraries that sometimes come with debugging info
11220 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
11222 re_comp (known_runtime_file_name_patterns[i]);
11223 if (re_exec (lbasename (sal.symtab->filename)))
11225 if (sal.symtab->objfile != NULL
11226 && re_exec (objfile_name (sal.symtab->objfile)))
11230 /* Check whether the function is a GNAT-generated entity. */
11232 find_frame_funname (frame, &func_name, &func_lang, NULL);
11233 if (func_name == NULL)
11236 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
11238 re_comp (known_auxiliary_function_name_patterns[i]);
11239 if (re_exec (func_name))
11250 /* Find the first frame that contains debugging information and that is not
11251 part of the Ada run-time, starting from FI and moving upward. */
11254 ada_find_printable_frame (struct frame_info *fi)
11256 for (; fi != NULL; fi = get_prev_frame (fi))
11258 if (!is_known_support_routine (fi))
11267 /* Assuming that the inferior just triggered an unhandled exception
11268 catchpoint, return the address in inferior memory where the name
11269 of the exception is stored.
11271 Return zero if the address could not be computed. */
11274 ada_unhandled_exception_name_addr (void)
11276 return parse_and_eval_address ("e.full_name");
11279 /* Same as ada_unhandled_exception_name_addr, except that this function
11280 should be used when the inferior uses an older version of the runtime,
11281 where the exception name needs to be extracted from a specific frame
11282 several frames up in the callstack. */
11285 ada_unhandled_exception_name_addr_from_raise (void)
11288 struct frame_info *fi;
11289 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11290 struct cleanup *old_chain;
11292 /* To determine the name of this exception, we need to select
11293 the frame corresponding to RAISE_SYM_NAME. This frame is
11294 at least 3 levels up, so we simply skip the first 3 frames
11295 without checking the name of their associated function. */
11296 fi = get_current_frame ();
11297 for (frame_level = 0; frame_level < 3; frame_level += 1)
11299 fi = get_prev_frame (fi);
11301 old_chain = make_cleanup (null_cleanup, NULL);
11305 enum language func_lang;
11307 find_frame_funname (fi, &func_name, &func_lang, NULL);
11308 if (func_name != NULL)
11310 make_cleanup (xfree, func_name);
11312 if (strcmp (func_name,
11313 data->exception_info->catch_exception_sym) == 0)
11314 break; /* We found the frame we were looking for... */
11315 fi = get_prev_frame (fi);
11318 do_cleanups (old_chain);
11324 return parse_and_eval_address ("id.full_name");
11327 /* Assuming the inferior just triggered an Ada exception catchpoint
11328 (of any type), return the address in inferior memory where the name
11329 of the exception is stored, if applicable.
11331 Return zero if the address could not be computed, or if not relevant. */
11334 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex,
11335 struct breakpoint *b)
11337 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11341 case ada_catch_exception:
11342 return (parse_and_eval_address ("e.full_name"));
11345 case ada_catch_exception_unhandled:
11346 return data->exception_info->unhandled_exception_name_addr ();
11349 case ada_catch_assert:
11350 return 0; /* Exception name is not relevant in this case. */
11354 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11358 return 0; /* Should never be reached. */
11361 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11362 any error that ada_exception_name_addr_1 might cause to be thrown.
11363 When an error is intercepted, a warning with the error message is printed,
11364 and zero is returned. */
11367 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex,
11368 struct breakpoint *b)
11370 volatile struct gdb_exception e;
11371 CORE_ADDR result = 0;
11373 TRY_CATCH (e, RETURN_MASK_ERROR)
11375 result = ada_exception_name_addr_1 (ex, b);
11380 warning (_("failed to get exception name: %s"), e.message);
11387 static char *ada_exception_catchpoint_cond_string (const char *excep_string);
11389 /* Ada catchpoints.
11391 In the case of catchpoints on Ada exceptions, the catchpoint will
11392 stop the target on every exception the program throws. When a user
11393 specifies the name of a specific exception, we translate this
11394 request into a condition expression (in text form), and then parse
11395 it into an expression stored in each of the catchpoint's locations.
11396 We then use this condition to check whether the exception that was
11397 raised is the one the user is interested in. If not, then the
11398 target is resumed again. We store the name of the requested
11399 exception, in order to be able to re-set the condition expression
11400 when symbols change. */
11402 /* An instance of this type is used to represent an Ada catchpoint
11403 breakpoint location. It includes a "struct bp_location" as a kind
11404 of base class; users downcast to "struct bp_location *" when
11407 struct ada_catchpoint_location
11409 /* The base class. */
11410 struct bp_location base;
11412 /* The condition that checks whether the exception that was raised
11413 is the specific exception the user specified on catchpoint
11415 struct expression *excep_cond_expr;
11418 /* Implement the DTOR method in the bp_location_ops structure for all
11419 Ada exception catchpoint kinds. */
11422 ada_catchpoint_location_dtor (struct bp_location *bl)
11424 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
11426 xfree (al->excep_cond_expr);
11429 /* The vtable to be used in Ada catchpoint locations. */
11431 static const struct bp_location_ops ada_catchpoint_location_ops =
11433 ada_catchpoint_location_dtor
11436 /* An instance of this type is used to represent an Ada catchpoint.
11437 It includes a "struct breakpoint" as a kind of base class; users
11438 downcast to "struct breakpoint *" when needed. */
11440 struct ada_catchpoint
11442 /* The base class. */
11443 struct breakpoint base;
11445 /* The name of the specific exception the user specified. */
11446 char *excep_string;
11449 /* Parse the exception condition string in the context of each of the
11450 catchpoint's locations, and store them for later evaluation. */
11453 create_excep_cond_exprs (struct ada_catchpoint *c)
11455 struct cleanup *old_chain;
11456 struct bp_location *bl;
11459 /* Nothing to do if there's no specific exception to catch. */
11460 if (c->excep_string == NULL)
11463 /* Same if there are no locations... */
11464 if (c->base.loc == NULL)
11467 /* Compute the condition expression in text form, from the specific
11468 expection we want to catch. */
11469 cond_string = ada_exception_catchpoint_cond_string (c->excep_string);
11470 old_chain = make_cleanup (xfree, cond_string);
11472 /* Iterate over all the catchpoint's locations, and parse an
11473 expression for each. */
11474 for (bl = c->base.loc; bl != NULL; bl = bl->next)
11476 struct ada_catchpoint_location *ada_loc
11477 = (struct ada_catchpoint_location *) bl;
11478 struct expression *exp = NULL;
11480 if (!bl->shlib_disabled)
11482 volatile struct gdb_exception e;
11486 TRY_CATCH (e, RETURN_MASK_ERROR)
11488 exp = parse_exp_1 (&s, bl->address,
11489 block_for_pc (bl->address), 0);
11493 warning (_("failed to reevaluate internal exception condition "
11494 "for catchpoint %d: %s"),
11495 c->base.number, e.message);
11496 /* There is a bug in GCC on sparc-solaris when building with
11497 optimization which causes EXP to change unexpectedly
11498 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11499 The problem should be fixed starting with GCC 4.9.
11500 In the meantime, work around it by forcing EXP back
11506 ada_loc->excep_cond_expr = exp;
11509 do_cleanups (old_chain);
11512 /* Implement the DTOR method in the breakpoint_ops structure for all
11513 exception catchpoint kinds. */
11516 dtor_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
11518 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11520 xfree (c->excep_string);
11522 bkpt_breakpoint_ops.dtor (b);
11525 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11526 structure for all exception catchpoint kinds. */
11528 static struct bp_location *
11529 allocate_location_exception (enum ada_exception_catchpoint_kind ex,
11530 struct breakpoint *self)
11532 struct ada_catchpoint_location *loc;
11534 loc = XNEW (struct ada_catchpoint_location);
11535 init_bp_location (&loc->base, &ada_catchpoint_location_ops, self);
11536 loc->excep_cond_expr = NULL;
11540 /* Implement the RE_SET method in the breakpoint_ops structure for all
11541 exception catchpoint kinds. */
11544 re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
11546 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11548 /* Call the base class's method. This updates the catchpoint's
11550 bkpt_breakpoint_ops.re_set (b);
11552 /* Reparse the exception conditional expressions. One for each
11554 create_excep_cond_exprs (c);
11557 /* Returns true if we should stop for this breakpoint hit. If the
11558 user specified a specific exception, we only want to cause a stop
11559 if the program thrown that exception. */
11562 should_stop_exception (const struct bp_location *bl)
11564 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
11565 const struct ada_catchpoint_location *ada_loc
11566 = (const struct ada_catchpoint_location *) bl;
11567 volatile struct gdb_exception ex;
11570 /* With no specific exception, should always stop. */
11571 if (c->excep_string == NULL)
11574 if (ada_loc->excep_cond_expr == NULL)
11576 /* We will have a NULL expression if back when we were creating
11577 the expressions, this location's had failed to parse. */
11582 TRY_CATCH (ex, RETURN_MASK_ALL)
11584 struct value *mark;
11586 mark = value_mark ();
11587 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr));
11588 value_free_to_mark (mark);
11591 exception_fprintf (gdb_stderr, ex,
11592 _("Error in testing exception condition:\n"));
11596 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11597 for all exception catchpoint kinds. */
11600 check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
11602 bs->stop = should_stop_exception (bs->bp_location_at);
11605 /* Implement the PRINT_IT method in the breakpoint_ops structure
11606 for all exception catchpoint kinds. */
11608 static enum print_stop_action
11609 print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
11611 struct ui_out *uiout = current_uiout;
11612 struct breakpoint *b = bs->breakpoint_at;
11614 annotate_catchpoint (b->number);
11616 if (ui_out_is_mi_like_p (uiout))
11618 ui_out_field_string (uiout, "reason",
11619 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
11620 ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition));
11623 ui_out_text (uiout,
11624 b->disposition == disp_del ? "\nTemporary catchpoint "
11625 : "\nCatchpoint ");
11626 ui_out_field_int (uiout, "bkptno", b->number);
11627 ui_out_text (uiout, ", ");
11631 case ada_catch_exception:
11632 case ada_catch_exception_unhandled:
11634 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
11635 char exception_name[256];
11639 read_memory (addr, (gdb_byte *) exception_name,
11640 sizeof (exception_name) - 1);
11641 exception_name [sizeof (exception_name) - 1] = '\0';
11645 /* For some reason, we were unable to read the exception
11646 name. This could happen if the Runtime was compiled
11647 without debugging info, for instance. In that case,
11648 just replace the exception name by the generic string
11649 "exception" - it will read as "an exception" in the
11650 notification we are about to print. */
11651 memcpy (exception_name, "exception", sizeof ("exception"));
11653 /* In the case of unhandled exception breakpoints, we print
11654 the exception name as "unhandled EXCEPTION_NAME", to make
11655 it clearer to the user which kind of catchpoint just got
11656 hit. We used ui_out_text to make sure that this extra
11657 info does not pollute the exception name in the MI case. */
11658 if (ex == ada_catch_exception_unhandled)
11659 ui_out_text (uiout, "unhandled ");
11660 ui_out_field_string (uiout, "exception-name", exception_name);
11663 case ada_catch_assert:
11664 /* In this case, the name of the exception is not really
11665 important. Just print "failed assertion" to make it clearer
11666 that his program just hit an assertion-failure catchpoint.
11667 We used ui_out_text because this info does not belong in
11669 ui_out_text (uiout, "failed assertion");
11672 ui_out_text (uiout, " at ");
11673 ada_find_printable_frame (get_current_frame ());
11675 return PRINT_SRC_AND_LOC;
11678 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11679 for all exception catchpoint kinds. */
11682 print_one_exception (enum ada_exception_catchpoint_kind ex,
11683 struct breakpoint *b, struct bp_location **last_loc)
11685 struct ui_out *uiout = current_uiout;
11686 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11687 struct value_print_options opts;
11689 get_user_print_options (&opts);
11690 if (opts.addressprint)
11692 annotate_field (4);
11693 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
11696 annotate_field (5);
11697 *last_loc = b->loc;
11700 case ada_catch_exception:
11701 if (c->excep_string != NULL)
11703 char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11705 ui_out_field_string (uiout, "what", msg);
11709 ui_out_field_string (uiout, "what", "all Ada exceptions");
11713 case ada_catch_exception_unhandled:
11714 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
11717 case ada_catch_assert:
11718 ui_out_field_string (uiout, "what", "failed Ada assertions");
11722 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11727 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11728 for all exception catchpoint kinds. */
11731 print_mention_exception (enum ada_exception_catchpoint_kind ex,
11732 struct breakpoint *b)
11734 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11735 struct ui_out *uiout = current_uiout;
11737 ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ")
11738 : _("Catchpoint "));
11739 ui_out_field_int (uiout, "bkptno", b->number);
11740 ui_out_text (uiout, ": ");
11744 case ada_catch_exception:
11745 if (c->excep_string != NULL)
11747 char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11748 struct cleanup *old_chain = make_cleanup (xfree, info);
11750 ui_out_text (uiout, info);
11751 do_cleanups (old_chain);
11754 ui_out_text (uiout, _("all Ada exceptions"));
11757 case ada_catch_exception_unhandled:
11758 ui_out_text (uiout, _("unhandled Ada exceptions"));
11761 case ada_catch_assert:
11762 ui_out_text (uiout, _("failed Ada assertions"));
11766 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11771 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11772 for all exception catchpoint kinds. */
11775 print_recreate_exception (enum ada_exception_catchpoint_kind ex,
11776 struct breakpoint *b, struct ui_file *fp)
11778 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11782 case ada_catch_exception:
11783 fprintf_filtered (fp, "catch exception");
11784 if (c->excep_string != NULL)
11785 fprintf_filtered (fp, " %s", c->excep_string);
11788 case ada_catch_exception_unhandled:
11789 fprintf_filtered (fp, "catch exception unhandled");
11792 case ada_catch_assert:
11793 fprintf_filtered (fp, "catch assert");
11797 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11799 print_recreate_thread (b, fp);
11802 /* Virtual table for "catch exception" breakpoints. */
11805 dtor_catch_exception (struct breakpoint *b)
11807 dtor_exception (ada_catch_exception, b);
11810 static struct bp_location *
11811 allocate_location_catch_exception (struct breakpoint *self)
11813 return allocate_location_exception (ada_catch_exception, self);
11817 re_set_catch_exception (struct breakpoint *b)
11819 re_set_exception (ada_catch_exception, b);
11823 check_status_catch_exception (bpstat bs)
11825 check_status_exception (ada_catch_exception, bs);
11828 static enum print_stop_action
11829 print_it_catch_exception (bpstat bs)
11831 return print_it_exception (ada_catch_exception, bs);
11835 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
11837 print_one_exception (ada_catch_exception, b, last_loc);
11841 print_mention_catch_exception (struct breakpoint *b)
11843 print_mention_exception (ada_catch_exception, b);
11847 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
11849 print_recreate_exception (ada_catch_exception, b, fp);
11852 static struct breakpoint_ops catch_exception_breakpoint_ops;
11854 /* Virtual table for "catch exception unhandled" breakpoints. */
11857 dtor_catch_exception_unhandled (struct breakpoint *b)
11859 dtor_exception (ada_catch_exception_unhandled, b);
11862 static struct bp_location *
11863 allocate_location_catch_exception_unhandled (struct breakpoint *self)
11865 return allocate_location_exception (ada_catch_exception_unhandled, self);
11869 re_set_catch_exception_unhandled (struct breakpoint *b)
11871 re_set_exception (ada_catch_exception_unhandled, b);
11875 check_status_catch_exception_unhandled (bpstat bs)
11877 check_status_exception (ada_catch_exception_unhandled, bs);
11880 static enum print_stop_action
11881 print_it_catch_exception_unhandled (bpstat bs)
11883 return print_it_exception (ada_catch_exception_unhandled, bs);
11887 print_one_catch_exception_unhandled (struct breakpoint *b,
11888 struct bp_location **last_loc)
11890 print_one_exception (ada_catch_exception_unhandled, b, last_loc);
11894 print_mention_catch_exception_unhandled (struct breakpoint *b)
11896 print_mention_exception (ada_catch_exception_unhandled, b);
11900 print_recreate_catch_exception_unhandled (struct breakpoint *b,
11901 struct ui_file *fp)
11903 print_recreate_exception (ada_catch_exception_unhandled, b, fp);
11906 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
11908 /* Virtual table for "catch assert" breakpoints. */
11911 dtor_catch_assert (struct breakpoint *b)
11913 dtor_exception (ada_catch_assert, b);
11916 static struct bp_location *
11917 allocate_location_catch_assert (struct breakpoint *self)
11919 return allocate_location_exception (ada_catch_assert, self);
11923 re_set_catch_assert (struct breakpoint *b)
11925 re_set_exception (ada_catch_assert, b);
11929 check_status_catch_assert (bpstat bs)
11931 check_status_exception (ada_catch_assert, bs);
11934 static enum print_stop_action
11935 print_it_catch_assert (bpstat bs)
11937 return print_it_exception (ada_catch_assert, bs);
11941 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
11943 print_one_exception (ada_catch_assert, b, last_loc);
11947 print_mention_catch_assert (struct breakpoint *b)
11949 print_mention_exception (ada_catch_assert, b);
11953 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
11955 print_recreate_exception (ada_catch_assert, b, fp);
11958 static struct breakpoint_ops catch_assert_breakpoint_ops;
11960 /* Return a newly allocated copy of the first space-separated token
11961 in ARGSP, and then adjust ARGSP to point immediately after that
11964 Return NULL if ARGPS does not contain any more tokens. */
11967 ada_get_next_arg (char **argsp)
11969 char *args = *argsp;
11973 args = skip_spaces (args);
11974 if (args[0] == '\0')
11975 return NULL; /* No more arguments. */
11977 /* Find the end of the current argument. */
11979 end = skip_to_space (args);
11981 /* Adjust ARGSP to point to the start of the next argument. */
11985 /* Make a copy of the current argument and return it. */
11987 result = xmalloc (end - args + 1);
11988 strncpy (result, args, end - args);
11989 result[end - args] = '\0';
11994 /* Split the arguments specified in a "catch exception" command.
11995 Set EX to the appropriate catchpoint type.
11996 Set EXCEP_STRING to the name of the specific exception if
11997 specified by the user.
11998 If a condition is found at the end of the arguments, the condition
11999 expression is stored in COND_STRING (memory must be deallocated
12000 after use). Otherwise COND_STRING is set to NULL. */
12003 catch_ada_exception_command_split (char *args,
12004 enum ada_exception_catchpoint_kind *ex,
12005 char **excep_string,
12006 char **cond_string)
12008 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
12009 char *exception_name;
12012 exception_name = ada_get_next_arg (&args);
12013 if (exception_name != NULL && strcmp (exception_name, "if") == 0)
12015 /* This is not an exception name; this is the start of a condition
12016 expression for a catchpoint on all exceptions. So, "un-get"
12017 this token, and set exception_name to NULL. */
12018 xfree (exception_name);
12019 exception_name = NULL;
12022 make_cleanup (xfree, exception_name);
12024 /* Check to see if we have a condition. */
12026 args = skip_spaces (args);
12027 if (strncmp (args, "if", 2) == 0
12028 && (isspace (args[2]) || args[2] == '\0'))
12031 args = skip_spaces (args);
12033 if (args[0] == '\0')
12034 error (_("Condition missing after `if' keyword"));
12035 cond = xstrdup (args);
12036 make_cleanup (xfree, cond);
12038 args += strlen (args);
12041 /* Check that we do not have any more arguments. Anything else
12044 if (args[0] != '\0')
12045 error (_("Junk at end of expression"));
12047 discard_cleanups (old_chain);
12049 if (exception_name == NULL)
12051 /* Catch all exceptions. */
12052 *ex = ada_catch_exception;
12053 *excep_string = NULL;
12055 else if (strcmp (exception_name, "unhandled") == 0)
12057 /* Catch unhandled exceptions. */
12058 *ex = ada_catch_exception_unhandled;
12059 *excep_string = NULL;
12063 /* Catch a specific exception. */
12064 *ex = ada_catch_exception;
12065 *excep_string = exception_name;
12067 *cond_string = cond;
12070 /* Return the name of the symbol on which we should break in order to
12071 implement a catchpoint of the EX kind. */
12073 static const char *
12074 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex)
12076 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12078 gdb_assert (data->exception_info != NULL);
12082 case ada_catch_exception:
12083 return (data->exception_info->catch_exception_sym);
12085 case ada_catch_exception_unhandled:
12086 return (data->exception_info->catch_exception_unhandled_sym);
12088 case ada_catch_assert:
12089 return (data->exception_info->catch_assert_sym);
12092 internal_error (__FILE__, __LINE__,
12093 _("unexpected catchpoint kind (%d)"), ex);
12097 /* Return the breakpoint ops "virtual table" used for catchpoints
12100 static const struct breakpoint_ops *
12101 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex)
12105 case ada_catch_exception:
12106 return (&catch_exception_breakpoint_ops);
12108 case ada_catch_exception_unhandled:
12109 return (&catch_exception_unhandled_breakpoint_ops);
12111 case ada_catch_assert:
12112 return (&catch_assert_breakpoint_ops);
12115 internal_error (__FILE__, __LINE__,
12116 _("unexpected catchpoint kind (%d)"), ex);
12120 /* Return the condition that will be used to match the current exception
12121 being raised with the exception that the user wants to catch. This
12122 assumes that this condition is used when the inferior just triggered
12123 an exception catchpoint.
12125 The string returned is a newly allocated string that needs to be
12126 deallocated later. */
12129 ada_exception_catchpoint_cond_string (const char *excep_string)
12133 /* The standard exceptions are a special case. They are defined in
12134 runtime units that have been compiled without debugging info; if
12135 EXCEP_STRING is the not-fully-qualified name of a standard
12136 exception (e.g. "constraint_error") then, during the evaluation
12137 of the condition expression, the symbol lookup on this name would
12138 *not* return this standard exception. The catchpoint condition
12139 may then be set only on user-defined exceptions which have the
12140 same not-fully-qualified name (e.g. my_package.constraint_error).
12142 To avoid this unexcepted behavior, these standard exceptions are
12143 systematically prefixed by "standard". This means that "catch
12144 exception constraint_error" is rewritten into "catch exception
12145 standard.constraint_error".
12147 If an exception named contraint_error is defined in another package of
12148 the inferior program, then the only way to specify this exception as a
12149 breakpoint condition is to use its fully-qualified named:
12150 e.g. my_package.constraint_error. */
12152 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
12154 if (strcmp (standard_exc [i], excep_string) == 0)
12156 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12160 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string);
12163 /* Return the symtab_and_line that should be used to insert an exception
12164 catchpoint of the TYPE kind.
12166 EXCEP_STRING should contain the name of a specific exception that
12167 the catchpoint should catch, or NULL otherwise.
12169 ADDR_STRING returns the name of the function where the real
12170 breakpoint that implements the catchpoints is set, depending on the
12171 type of catchpoint we need to create. */
12173 static struct symtab_and_line
12174 ada_exception_sal (enum ada_exception_catchpoint_kind ex, char *excep_string,
12175 char **addr_string, const struct breakpoint_ops **ops)
12177 const char *sym_name;
12178 struct symbol *sym;
12180 /* First, find out which exception support info to use. */
12181 ada_exception_support_info_sniffer ();
12183 /* Then lookup the function on which we will break in order to catch
12184 the Ada exceptions requested by the user. */
12185 sym_name = ada_exception_sym_name (ex);
12186 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
12188 /* We can assume that SYM is not NULL at this stage. If the symbol
12189 did not exist, ada_exception_support_info_sniffer would have
12190 raised an exception.
12192 Also, ada_exception_support_info_sniffer should have already
12193 verified that SYM is a function symbol. */
12194 gdb_assert (sym != NULL);
12195 gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK);
12197 /* Set ADDR_STRING. */
12198 *addr_string = xstrdup (sym_name);
12201 *ops = ada_exception_breakpoint_ops (ex);
12203 return find_function_start_sal (sym, 1);
12206 /* Create an Ada exception catchpoint.
12208 EX_KIND is the kind of exception catchpoint to be created.
12210 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12211 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12212 of the exception to which this catchpoint applies. When not NULL,
12213 the string must be allocated on the heap, and its deallocation
12214 is no longer the responsibility of the caller.
12216 COND_STRING, if not NULL, is the catchpoint condition. This string
12217 must be allocated on the heap, and its deallocation is no longer
12218 the responsibility of the caller.
12220 TEMPFLAG, if nonzero, means that the underlying breakpoint
12221 should be temporary.
12223 FROM_TTY is the usual argument passed to all commands implementations. */
12226 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
12227 enum ada_exception_catchpoint_kind ex_kind,
12228 char *excep_string,
12234 struct ada_catchpoint *c;
12235 char *addr_string = NULL;
12236 const struct breakpoint_ops *ops = NULL;
12237 struct symtab_and_line sal
12238 = ada_exception_sal (ex_kind, excep_string, &addr_string, &ops);
12240 c = XNEW (struct ada_catchpoint);
12241 init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string,
12242 ops, tempflag, disabled, from_tty);
12243 c->excep_string = excep_string;
12244 create_excep_cond_exprs (c);
12245 if (cond_string != NULL)
12246 set_breakpoint_condition (&c->base, cond_string, from_tty);
12247 install_breakpoint (0, &c->base, 1);
12250 /* Implement the "catch exception" command. */
12253 catch_ada_exception_command (char *arg, int from_tty,
12254 struct cmd_list_element *command)
12256 struct gdbarch *gdbarch = get_current_arch ();
12258 enum ada_exception_catchpoint_kind ex_kind;
12259 char *excep_string = NULL;
12260 char *cond_string = NULL;
12262 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12266 catch_ada_exception_command_split (arg, &ex_kind, &excep_string,
12268 create_ada_exception_catchpoint (gdbarch, ex_kind,
12269 excep_string, cond_string,
12270 tempflag, 1 /* enabled */,
12274 /* Split the arguments specified in a "catch assert" command.
12276 ARGS contains the command's arguments (or the empty string if
12277 no arguments were passed).
12279 If ARGS contains a condition, set COND_STRING to that condition
12280 (the memory needs to be deallocated after use). */
12283 catch_ada_assert_command_split (char *args, char **cond_string)
12285 args = skip_spaces (args);
12287 /* Check whether a condition was provided. */
12288 if (strncmp (args, "if", 2) == 0
12289 && (isspace (args[2]) || args[2] == '\0'))
12292 args = skip_spaces (args);
12293 if (args[0] == '\0')
12294 error (_("condition missing after `if' keyword"));
12295 *cond_string = xstrdup (args);
12298 /* Otherwise, there should be no other argument at the end of
12300 else if (args[0] != '\0')
12301 error (_("Junk at end of arguments."));
12304 /* Implement the "catch assert" command. */
12307 catch_assert_command (char *arg, int from_tty,
12308 struct cmd_list_element *command)
12310 struct gdbarch *gdbarch = get_current_arch ();
12312 char *cond_string = NULL;
12314 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12318 catch_ada_assert_command_split (arg, &cond_string);
12319 create_ada_exception_catchpoint (gdbarch, ada_catch_assert,
12321 tempflag, 1 /* enabled */,
12325 /* Return non-zero if the symbol SYM is an Ada exception object. */
12328 ada_is_exception_sym (struct symbol *sym)
12330 const char *type_name = type_name_no_tag (SYMBOL_TYPE (sym));
12332 return (SYMBOL_CLASS (sym) != LOC_TYPEDEF
12333 && SYMBOL_CLASS (sym) != LOC_BLOCK
12334 && SYMBOL_CLASS (sym) != LOC_CONST
12335 && SYMBOL_CLASS (sym) != LOC_UNRESOLVED
12336 && type_name != NULL && strcmp (type_name, "exception") == 0);
12339 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12340 Ada exception object. This matches all exceptions except the ones
12341 defined by the Ada language. */
12344 ada_is_non_standard_exception_sym (struct symbol *sym)
12348 if (!ada_is_exception_sym (sym))
12351 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
12352 if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0)
12353 return 0; /* A standard exception. */
12355 /* Numeric_Error is also a standard exception, so exclude it.
12356 See the STANDARD_EXC description for more details as to why
12357 this exception is not listed in that array. */
12358 if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0)
12364 /* A helper function for qsort, comparing two struct ada_exc_info
12367 The comparison is determined first by exception name, and then
12368 by exception address. */
12371 compare_ada_exception_info (const void *a, const void *b)
12373 const struct ada_exc_info *exc_a = (struct ada_exc_info *) a;
12374 const struct ada_exc_info *exc_b = (struct ada_exc_info *) b;
12377 result = strcmp (exc_a->name, exc_b->name);
12381 if (exc_a->addr < exc_b->addr)
12383 if (exc_a->addr > exc_b->addr)
12389 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12390 routine, but keeping the first SKIP elements untouched.
12392 All duplicates are also removed. */
12395 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info) **exceptions,
12398 struct ada_exc_info *to_sort
12399 = VEC_address (ada_exc_info, *exceptions) + skip;
12401 = VEC_length (ada_exc_info, *exceptions) - skip;
12404 qsort (to_sort, to_sort_len, sizeof (struct ada_exc_info),
12405 compare_ada_exception_info);
12407 for (i = 1, j = 1; i < to_sort_len; i++)
12408 if (compare_ada_exception_info (&to_sort[i], &to_sort[j - 1]) != 0)
12409 to_sort[j++] = to_sort[i];
12411 VEC_truncate(ada_exc_info, *exceptions, skip + to_sort_len);
12414 /* A function intended as the "name_matcher" callback in the struct
12415 quick_symbol_functions' expand_symtabs_matching method.
12417 SEARCH_NAME is the symbol's search name.
12419 If USER_DATA is not NULL, it is a pointer to a regext_t object
12420 used to match the symbol (by natural name). Otherwise, when USER_DATA
12421 is null, no filtering is performed, and all symbols are a positive
12425 ada_exc_search_name_matches (const char *search_name, void *user_data)
12427 regex_t *preg = user_data;
12432 /* In Ada, the symbol "search name" is a linkage name, whereas
12433 the regular expression used to do the matching refers to
12434 the natural name. So match against the decoded name. */
12435 return (regexec (preg, ada_decode (search_name), 0, NULL, 0) == 0);
12438 /* Add all exceptions defined by the Ada standard whose name match
12439 a regular expression.
12441 If PREG is not NULL, then this regexp_t object is used to
12442 perform the symbol name matching. Otherwise, no name-based
12443 filtering is performed.
12445 EXCEPTIONS is a vector of exceptions to which matching exceptions
12449 ada_add_standard_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions)
12453 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
12456 || regexec (preg, standard_exc[i], 0, NULL, 0) == 0)
12458 struct bound_minimal_symbol msymbol
12459 = ada_lookup_simple_minsym (standard_exc[i]);
12461 if (msymbol.minsym != NULL)
12463 struct ada_exc_info info
12464 = {standard_exc[i], SYMBOL_VALUE_ADDRESS (msymbol.minsym)};
12466 VEC_safe_push (ada_exc_info, *exceptions, &info);
12472 /* Add all Ada exceptions defined locally and accessible from the given
12475 If PREG is not NULL, then this regexp_t object is used to
12476 perform the symbol name matching. Otherwise, no name-based
12477 filtering is performed.
12479 EXCEPTIONS is a vector of exceptions to which matching exceptions
12483 ada_add_exceptions_from_frame (regex_t *preg, struct frame_info *frame,
12484 VEC(ada_exc_info) **exceptions)
12486 struct block *block = get_frame_block (frame, 0);
12490 struct block_iterator iter;
12491 struct symbol *sym;
12493 ALL_BLOCK_SYMBOLS (block, iter, sym)
12495 switch (SYMBOL_CLASS (sym))
12502 if (ada_is_exception_sym (sym))
12504 struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym),
12505 SYMBOL_VALUE_ADDRESS (sym)};
12507 VEC_safe_push (ada_exc_info, *exceptions, &info);
12511 if (BLOCK_FUNCTION (block) != NULL)
12513 block = BLOCK_SUPERBLOCK (block);
12517 /* Add all exceptions defined globally whose name name match
12518 a regular expression, excluding standard exceptions.
12520 The reason we exclude standard exceptions is that they need
12521 to be handled separately: Standard exceptions are defined inside
12522 a runtime unit which is normally not compiled with debugging info,
12523 and thus usually do not show up in our symbol search. However,
12524 if the unit was in fact built with debugging info, we need to
12525 exclude them because they would duplicate the entry we found
12526 during the special loop that specifically searches for those
12527 standard exceptions.
12529 If PREG is not NULL, then this regexp_t object is used to
12530 perform the symbol name matching. Otherwise, no name-based
12531 filtering is performed.
12533 EXCEPTIONS is a vector of exceptions to which matching exceptions
12537 ada_add_global_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions)
12539 struct objfile *objfile;
12542 expand_symtabs_matching (NULL, ada_exc_search_name_matches,
12543 VARIABLES_DOMAIN, preg);
12545 ALL_PRIMARY_SYMTABS (objfile, s)
12547 struct blockvector *bv = BLOCKVECTOR (s);
12550 for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++)
12552 struct block *b = BLOCKVECTOR_BLOCK (bv, i);
12553 struct block_iterator iter;
12554 struct symbol *sym;
12556 ALL_BLOCK_SYMBOLS (b, iter, sym)
12557 if (ada_is_non_standard_exception_sym (sym)
12559 || regexec (preg, SYMBOL_NATURAL_NAME (sym),
12562 struct ada_exc_info info
12563 = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)};
12565 VEC_safe_push (ada_exc_info, *exceptions, &info);
12571 /* Implements ada_exceptions_list with the regular expression passed
12572 as a regex_t, rather than a string.
12574 If not NULL, PREG is used to filter out exceptions whose names
12575 do not match. Otherwise, all exceptions are listed. */
12577 static VEC(ada_exc_info) *
12578 ada_exceptions_list_1 (regex_t *preg)
12580 VEC(ada_exc_info) *result = NULL;
12581 struct cleanup *old_chain
12582 = make_cleanup (VEC_cleanup (ada_exc_info), &result);
12585 /* First, list the known standard exceptions. These exceptions
12586 need to be handled separately, as they are usually defined in
12587 runtime units that have been compiled without debugging info. */
12589 ada_add_standard_exceptions (preg, &result);
12591 /* Next, find all exceptions whose scope is local and accessible
12592 from the currently selected frame. */
12594 if (has_stack_frames ())
12596 prev_len = VEC_length (ada_exc_info, result);
12597 ada_add_exceptions_from_frame (preg, get_selected_frame (NULL),
12599 if (VEC_length (ada_exc_info, result) > prev_len)
12600 sort_remove_dups_ada_exceptions_list (&result, prev_len);
12603 /* Add all exceptions whose scope is global. */
12605 prev_len = VEC_length (ada_exc_info, result);
12606 ada_add_global_exceptions (preg, &result);
12607 if (VEC_length (ada_exc_info, result) > prev_len)
12608 sort_remove_dups_ada_exceptions_list (&result, prev_len);
12610 discard_cleanups (old_chain);
12614 /* Return a vector of ada_exc_info.
12616 If REGEXP is NULL, all exceptions are included in the result.
12617 Otherwise, it should contain a valid regular expression,
12618 and only the exceptions whose names match that regular expression
12619 are included in the result.
12621 The exceptions are sorted in the following order:
12622 - Standard exceptions (defined by the Ada language), in
12623 alphabetical order;
12624 - Exceptions only visible from the current frame, in
12625 alphabetical order;
12626 - Exceptions whose scope is global, in alphabetical order. */
12628 VEC(ada_exc_info) *
12629 ada_exceptions_list (const char *regexp)
12631 VEC(ada_exc_info) *result = NULL;
12632 struct cleanup *old_chain = NULL;
12635 if (regexp != NULL)
12636 old_chain = compile_rx_or_error (®, regexp,
12637 _("invalid regular expression"));
12639 result = ada_exceptions_list_1 (regexp != NULL ? ® : NULL);
12641 if (old_chain != NULL)
12642 do_cleanups (old_chain);
12646 /* Implement the "info exceptions" command. */
12649 info_exceptions_command (char *regexp, int from_tty)
12651 VEC(ada_exc_info) *exceptions;
12652 struct cleanup *cleanup;
12653 struct gdbarch *gdbarch = get_current_arch ();
12655 struct ada_exc_info *info;
12657 exceptions = ada_exceptions_list (regexp);
12658 cleanup = make_cleanup (VEC_cleanup (ada_exc_info), &exceptions);
12660 if (regexp != NULL)
12662 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp);
12664 printf_filtered (_("All defined Ada exceptions:\n"));
12666 for (ix = 0; VEC_iterate(ada_exc_info, exceptions, ix, info); ix++)
12667 printf_filtered ("%s: %s\n", info->name, paddress (gdbarch, info->addr));
12669 do_cleanups (cleanup);
12673 /* Information about operators given special treatment in functions
12675 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12677 #define ADA_OPERATORS \
12678 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12679 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12680 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12681 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12682 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12683 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12684 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12685 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12686 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12687 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12688 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12689 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12690 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12691 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12692 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12693 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12694 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12695 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12696 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12699 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
12702 switch (exp->elts[pc - 1].opcode)
12705 operator_length_standard (exp, pc, oplenp, argsp);
12708 #define OP_DEFN(op, len, args, binop) \
12709 case op: *oplenp = len; *argsp = args; break;
12715 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
12720 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
12725 /* Implementation of the exp_descriptor method operator_check. */
12728 ada_operator_check (struct expression *exp, int pos,
12729 int (*objfile_func) (struct objfile *objfile, void *data),
12732 const union exp_element *const elts = exp->elts;
12733 struct type *type = NULL;
12735 switch (elts[pos].opcode)
12737 case UNOP_IN_RANGE:
12739 type = elts[pos + 1].type;
12743 return operator_check_standard (exp, pos, objfile_func, data);
12746 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12748 if (type && TYPE_OBJFILE (type)
12749 && (*objfile_func) (TYPE_OBJFILE (type), data))
12756 ada_op_name (enum exp_opcode opcode)
12761 return op_name_standard (opcode);
12763 #define OP_DEFN(op, len, args, binop) case op: return #op;
12768 return "OP_AGGREGATE";
12770 return "OP_CHOICES";
12776 /* As for operator_length, but assumes PC is pointing at the first
12777 element of the operator, and gives meaningful results only for the
12778 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
12781 ada_forward_operator_length (struct expression *exp, int pc,
12782 int *oplenp, int *argsp)
12784 switch (exp->elts[pc].opcode)
12787 *oplenp = *argsp = 0;
12790 #define OP_DEFN(op, len, args, binop) \
12791 case op: *oplenp = len; *argsp = args; break;
12797 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
12802 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
12808 int len = longest_to_int (exp->elts[pc + 1].longconst);
12810 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
12818 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
12820 enum exp_opcode op = exp->elts[elt].opcode;
12825 ada_forward_operator_length (exp, elt, &oplen, &nargs);
12829 /* Ada attributes ('Foo). */
12832 case OP_ATR_LENGTH:
12836 case OP_ATR_MODULUS:
12843 case UNOP_IN_RANGE:
12845 /* XXX: gdb_sprint_host_address, type_sprint */
12846 fprintf_filtered (stream, _("Type @"));
12847 gdb_print_host_address (exp->elts[pc + 1].type, stream);
12848 fprintf_filtered (stream, " (");
12849 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
12850 fprintf_filtered (stream, ")");
12852 case BINOP_IN_BOUNDS:
12853 fprintf_filtered (stream, " (%d)",
12854 longest_to_int (exp->elts[pc + 2].longconst));
12856 case TERNOP_IN_RANGE:
12861 case OP_DISCRETE_RANGE:
12862 case OP_POSITIONAL:
12869 char *name = &exp->elts[elt + 2].string;
12870 int len = longest_to_int (exp->elts[elt + 1].longconst);
12872 fprintf_filtered (stream, "Text: `%.*s'", len, name);
12877 return dump_subexp_body_standard (exp, stream, elt);
12881 for (i = 0; i < nargs; i += 1)
12882 elt = dump_subexp (exp, stream, elt);
12887 /* The Ada extension of print_subexp (q.v.). */
12890 ada_print_subexp (struct expression *exp, int *pos,
12891 struct ui_file *stream, enum precedence prec)
12893 int oplen, nargs, i;
12895 enum exp_opcode op = exp->elts[pc].opcode;
12897 ada_forward_operator_length (exp, pc, &oplen, &nargs);
12904 print_subexp_standard (exp, pos, stream, prec);
12908 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
12911 case BINOP_IN_BOUNDS:
12912 /* XXX: sprint_subexp */
12913 print_subexp (exp, pos, stream, PREC_SUFFIX);
12914 fputs_filtered (" in ", stream);
12915 print_subexp (exp, pos, stream, PREC_SUFFIX);
12916 fputs_filtered ("'range", stream);
12917 if (exp->elts[pc + 1].longconst > 1)
12918 fprintf_filtered (stream, "(%ld)",
12919 (long) exp->elts[pc + 1].longconst);
12922 case TERNOP_IN_RANGE:
12923 if (prec >= PREC_EQUAL)
12924 fputs_filtered ("(", stream);
12925 /* XXX: sprint_subexp */
12926 print_subexp (exp, pos, stream, PREC_SUFFIX);
12927 fputs_filtered (" in ", stream);
12928 print_subexp (exp, pos, stream, PREC_EQUAL);
12929 fputs_filtered (" .. ", stream);
12930 print_subexp (exp, pos, stream, PREC_EQUAL);
12931 if (prec >= PREC_EQUAL)
12932 fputs_filtered (")", stream);
12937 case OP_ATR_LENGTH:
12941 case OP_ATR_MODULUS:
12946 if (exp->elts[*pos].opcode == OP_TYPE)
12948 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
12949 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0,
12950 &type_print_raw_options);
12954 print_subexp (exp, pos, stream, PREC_SUFFIX);
12955 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
12960 for (tem = 1; tem < nargs; tem += 1)
12962 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
12963 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
12965 fputs_filtered (")", stream);
12970 type_print (exp->elts[pc + 1].type, "", stream, 0);
12971 fputs_filtered ("'(", stream);
12972 print_subexp (exp, pos, stream, PREC_PREFIX);
12973 fputs_filtered (")", stream);
12976 case UNOP_IN_RANGE:
12977 /* XXX: sprint_subexp */
12978 print_subexp (exp, pos, stream, PREC_SUFFIX);
12979 fputs_filtered (" in ", stream);
12980 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0,
12981 &type_print_raw_options);
12984 case OP_DISCRETE_RANGE:
12985 print_subexp (exp, pos, stream, PREC_SUFFIX);
12986 fputs_filtered ("..", stream);
12987 print_subexp (exp, pos, stream, PREC_SUFFIX);
12991 fputs_filtered ("others => ", stream);
12992 print_subexp (exp, pos, stream, PREC_SUFFIX);
12996 for (i = 0; i < nargs-1; i += 1)
12999 fputs_filtered ("|", stream);
13000 print_subexp (exp, pos, stream, PREC_SUFFIX);
13002 fputs_filtered (" => ", stream);
13003 print_subexp (exp, pos, stream, PREC_SUFFIX);
13006 case OP_POSITIONAL:
13007 print_subexp (exp, pos, stream, PREC_SUFFIX);
13011 fputs_filtered ("(", stream);
13012 for (i = 0; i < nargs; i += 1)
13015 fputs_filtered (", ", stream);
13016 print_subexp (exp, pos, stream, PREC_SUFFIX);
13018 fputs_filtered (")", stream);
13023 /* Table mapping opcodes into strings for printing operators
13024 and precedences of the operators. */
13026 static const struct op_print ada_op_print_tab[] = {
13027 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
13028 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
13029 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
13030 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
13031 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
13032 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
13033 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
13034 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
13035 {"<=", BINOP_LEQ, PREC_ORDER, 0},
13036 {">=", BINOP_GEQ, PREC_ORDER, 0},
13037 {">", BINOP_GTR, PREC_ORDER, 0},
13038 {"<", BINOP_LESS, PREC_ORDER, 0},
13039 {">>", BINOP_RSH, PREC_SHIFT, 0},
13040 {"<<", BINOP_LSH, PREC_SHIFT, 0},
13041 {"+", BINOP_ADD, PREC_ADD, 0},
13042 {"-", BINOP_SUB, PREC_ADD, 0},
13043 {"&", BINOP_CONCAT, PREC_ADD, 0},
13044 {"*", BINOP_MUL, PREC_MUL, 0},
13045 {"/", BINOP_DIV, PREC_MUL, 0},
13046 {"rem", BINOP_REM, PREC_MUL, 0},
13047 {"mod", BINOP_MOD, PREC_MUL, 0},
13048 {"**", BINOP_EXP, PREC_REPEAT, 0},
13049 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
13050 {"-", UNOP_NEG, PREC_PREFIX, 0},
13051 {"+", UNOP_PLUS, PREC_PREFIX, 0},
13052 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
13053 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
13054 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
13055 {".all", UNOP_IND, PREC_SUFFIX, 1},
13056 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
13057 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
13061 enum ada_primitive_types {
13062 ada_primitive_type_int,
13063 ada_primitive_type_long,
13064 ada_primitive_type_short,
13065 ada_primitive_type_char,
13066 ada_primitive_type_float,
13067 ada_primitive_type_double,
13068 ada_primitive_type_void,
13069 ada_primitive_type_long_long,
13070 ada_primitive_type_long_double,
13071 ada_primitive_type_natural,
13072 ada_primitive_type_positive,
13073 ada_primitive_type_system_address,
13074 nr_ada_primitive_types
13078 ada_language_arch_info (struct gdbarch *gdbarch,
13079 struct language_arch_info *lai)
13081 const struct builtin_type *builtin = builtin_type (gdbarch);
13083 lai->primitive_type_vector
13084 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
13087 lai->primitive_type_vector [ada_primitive_type_int]
13088 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13090 lai->primitive_type_vector [ada_primitive_type_long]
13091 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
13092 0, "long_integer");
13093 lai->primitive_type_vector [ada_primitive_type_short]
13094 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
13095 0, "short_integer");
13096 lai->string_char_type
13097 = lai->primitive_type_vector [ada_primitive_type_char]
13098 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
13099 lai->primitive_type_vector [ada_primitive_type_float]
13100 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
13102 lai->primitive_type_vector [ada_primitive_type_double]
13103 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
13104 "long_float", NULL);
13105 lai->primitive_type_vector [ada_primitive_type_long_long]
13106 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
13107 0, "long_long_integer");
13108 lai->primitive_type_vector [ada_primitive_type_long_double]
13109 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
13110 "long_long_float", NULL);
13111 lai->primitive_type_vector [ada_primitive_type_natural]
13112 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13114 lai->primitive_type_vector [ada_primitive_type_positive]
13115 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13117 lai->primitive_type_vector [ada_primitive_type_void]
13118 = builtin->builtin_void;
13120 lai->primitive_type_vector [ada_primitive_type_system_address]
13121 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
13122 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
13123 = "system__address";
13125 lai->bool_type_symbol = NULL;
13126 lai->bool_type_default = builtin->builtin_bool;
13129 /* Language vector */
13131 /* Not really used, but needed in the ada_language_defn. */
13134 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
13136 ada_emit_char (c, type, stream, quoter, 1);
13142 warnings_issued = 0;
13143 return ada_parse ();
13146 static const struct exp_descriptor ada_exp_descriptor = {
13148 ada_operator_length,
13149 ada_operator_check,
13151 ada_dump_subexp_body,
13152 ada_evaluate_subexp
13155 /* Implement the "la_get_symbol_name_cmp" language_defn method
13158 static symbol_name_cmp_ftype
13159 ada_get_symbol_name_cmp (const char *lookup_name)
13161 if (should_use_wild_match (lookup_name))
13164 return compare_names;
13167 /* Implement the "la_read_var_value" language_defn method for Ada. */
13169 static struct value *
13170 ada_read_var_value (struct symbol *var, struct frame_info *frame)
13172 struct block *frame_block = NULL;
13173 struct symbol *renaming_sym = NULL;
13175 /* The only case where default_read_var_value is not sufficient
13176 is when VAR is a renaming... */
13178 frame_block = get_frame_block (frame, NULL);
13180 renaming_sym = ada_find_renaming_symbol (var, frame_block);
13181 if (renaming_sym != NULL)
13182 return ada_read_renaming_var_value (renaming_sym, frame_block);
13184 /* This is a typical case where we expect the default_read_var_value
13185 function to work. */
13186 return default_read_var_value (var, frame);
13189 const struct language_defn ada_language_defn = {
13190 "ada", /* Language name */
13194 case_sensitive_on, /* Yes, Ada is case-insensitive, but
13195 that's not quite what this means. */
13197 macro_expansion_no,
13198 &ada_exp_descriptor,
13202 ada_printchar, /* Print a character constant */
13203 ada_printstr, /* Function to print string constant */
13204 emit_char, /* Function to print single char (not used) */
13205 ada_print_type, /* Print a type using appropriate syntax */
13206 ada_print_typedef, /* Print a typedef using appropriate syntax */
13207 ada_val_print, /* Print a value using appropriate syntax */
13208 ada_value_print, /* Print a top-level value */
13209 ada_read_var_value, /* la_read_var_value */
13210 NULL, /* Language specific skip_trampoline */
13211 NULL, /* name_of_this */
13212 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
13213 basic_lookup_transparent_type, /* lookup_transparent_type */
13214 ada_la_decode, /* Language specific symbol demangler */
13215 NULL, /* Language specific
13216 class_name_from_physname */
13217 ada_op_print_tab, /* expression operators for printing */
13218 0, /* c-style arrays */
13219 1, /* String lower bound */
13220 ada_get_gdb_completer_word_break_characters,
13221 ada_make_symbol_completion_list,
13222 ada_language_arch_info,
13223 ada_print_array_index,
13224 default_pass_by_reference,
13226 ada_get_symbol_name_cmp, /* la_get_symbol_name_cmp */
13227 ada_iterate_over_symbols,
13232 /* Provide a prototype to silence -Wmissing-prototypes. */
13233 extern initialize_file_ftype _initialize_ada_language;
13235 /* Command-list for the "set/show ada" prefix command. */
13236 static struct cmd_list_element *set_ada_list;
13237 static struct cmd_list_element *show_ada_list;
13239 /* Implement the "set ada" prefix command. */
13242 set_ada_command (char *arg, int from_tty)
13244 printf_unfiltered (_(\
13245 "\"set ada\" must be followed by the name of a setting.\n"));
13246 help_list (set_ada_list, "set ada ", -1, gdb_stdout);
13249 /* Implement the "show ada" prefix command. */
13252 show_ada_command (char *args, int from_tty)
13254 cmd_show_list (show_ada_list, from_tty, "");
13258 initialize_ada_catchpoint_ops (void)
13260 struct breakpoint_ops *ops;
13262 initialize_breakpoint_ops ();
13264 ops = &catch_exception_breakpoint_ops;
13265 *ops = bkpt_breakpoint_ops;
13266 ops->dtor = dtor_catch_exception;
13267 ops->allocate_location = allocate_location_catch_exception;
13268 ops->re_set = re_set_catch_exception;
13269 ops->check_status = check_status_catch_exception;
13270 ops->print_it = print_it_catch_exception;
13271 ops->print_one = print_one_catch_exception;
13272 ops->print_mention = print_mention_catch_exception;
13273 ops->print_recreate = print_recreate_catch_exception;
13275 ops = &catch_exception_unhandled_breakpoint_ops;
13276 *ops = bkpt_breakpoint_ops;
13277 ops->dtor = dtor_catch_exception_unhandled;
13278 ops->allocate_location = allocate_location_catch_exception_unhandled;
13279 ops->re_set = re_set_catch_exception_unhandled;
13280 ops->check_status = check_status_catch_exception_unhandled;
13281 ops->print_it = print_it_catch_exception_unhandled;
13282 ops->print_one = print_one_catch_exception_unhandled;
13283 ops->print_mention = print_mention_catch_exception_unhandled;
13284 ops->print_recreate = print_recreate_catch_exception_unhandled;
13286 ops = &catch_assert_breakpoint_ops;
13287 *ops = bkpt_breakpoint_ops;
13288 ops->dtor = dtor_catch_assert;
13289 ops->allocate_location = allocate_location_catch_assert;
13290 ops->re_set = re_set_catch_assert;
13291 ops->check_status = check_status_catch_assert;
13292 ops->print_it = print_it_catch_assert;
13293 ops->print_one = print_one_catch_assert;
13294 ops->print_mention = print_mention_catch_assert;
13295 ops->print_recreate = print_recreate_catch_assert;
13299 _initialize_ada_language (void)
13301 add_language (&ada_language_defn);
13303 initialize_ada_catchpoint_ops ();
13305 add_prefix_cmd ("ada", no_class, set_ada_command,
13306 _("Prefix command for changing Ada-specfic settings"),
13307 &set_ada_list, "set ada ", 0, &setlist);
13309 add_prefix_cmd ("ada", no_class, show_ada_command,
13310 _("Generic command for showing Ada-specific settings."),
13311 &show_ada_list, "show ada ", 0, &showlist);
13313 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
13314 &trust_pad_over_xvs, _("\
13315 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13316 Show whether an optimization trusting PAD types over XVS types is activated"),
13318 This is related to the encoding used by the GNAT compiler. The debugger\n\
13319 should normally trust the contents of PAD types, but certain older versions\n\
13320 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13321 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13322 work around this bug. It is always safe to turn this option \"off\", but\n\
13323 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13324 this option to \"off\" unless necessary."),
13325 NULL, NULL, &set_ada_list, &show_ada_list);
13327 add_catch_command ("exception", _("\
13328 Catch Ada exceptions, when raised.\n\
13329 With an argument, catch only exceptions with the given name."),
13330 catch_ada_exception_command,
13334 add_catch_command ("assert", _("\
13335 Catch failed Ada assertions, when raised.\n\
13336 With an argument, catch only exceptions with the given name."),
13337 catch_assert_command,
13342 varsize_limit = 65536;
13344 add_info ("exceptions", info_exceptions_command,
13346 List all Ada exception names.\n\
13347 If a regular expression is passed as an argument, only those matching\n\
13348 the regular expression are listed."));
13350 add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd,
13351 _("Set Ada maintenance-related variables."),
13352 &maint_set_ada_cmdlist, "maintenance set ada ",
13353 0/*allow-unknown*/, &maintenance_set_cmdlist);
13355 add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd,
13356 _("Show Ada maintenance-related variables"),
13357 &maint_show_ada_cmdlist, "maintenance show ada ",
13358 0/*allow-unknown*/, &maintenance_show_cmdlist);
13360 add_setshow_boolean_cmd
13361 ("ignore-descriptive-types", class_maintenance,
13362 &ada_ignore_descriptive_types_p,
13363 _("Set whether descriptive types generated by GNAT should be ignored."),
13364 _("Show whether descriptive types generated by GNAT should be ignored."),
13366 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13367 DWARF attribute."),
13368 NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist);
13370 obstack_init (&symbol_list_obstack);
13372 decoded_names_store = htab_create_alloc
13373 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
13374 NULL, xcalloc, xfree);
13376 /* Setup per-inferior data. */
13377 observer_attach_inferior_exit (ada_inferior_exit);
13379 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);