1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
63 #include "mi/mi-common.h"
64 #include "arch-utils.h"
65 #include "exceptions.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 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 *,
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 *, 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 *,
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 (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 *,
275 /* Maximum-sized dynamic type. */
276 static unsigned int varsize_limit;
278 /* FIXME: brobecker/2003-09-17: No longer a const because it is
279 returned by a function that does not return a const char *. */
280 static char *ada_completer_word_break_characters =
282 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
284 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
287 /* The name of the symbol to use to get the name of the main subprogram. */
288 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
289 = "__gnat_ada_main_program_name";
291 /* Limit on the number of warnings to raise per expression evaluation. */
292 static int warning_limit = 2;
294 /* Number of warning messages issued; reset to 0 by cleanups after
295 expression evaluation. */
296 static int warnings_issued = 0;
298 static const char *known_runtime_file_name_patterns[] = {
299 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
302 static const char *known_auxiliary_function_name_patterns[] = {
303 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
306 /* Space for allocating results of ada_lookup_symbol_list. */
307 static struct obstack symbol_list_obstack;
309 /* Inferior-specific data. */
311 /* Per-inferior data for this module. */
313 struct ada_inferior_data
315 /* The ada__tags__type_specific_data type, which is used when decoding
316 tagged types. With older versions of GNAT, this type was directly
317 accessible through a component ("tsd") in the object tag. But this
318 is no longer the case, so we cache it for each inferior. */
319 struct type *tsd_type;
322 /* Our key to this module's inferior data. */
323 static const struct inferior_data *ada_inferior_data;
325 /* A cleanup routine for our inferior data. */
327 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
329 struct ada_inferior_data *data;
331 data = inferior_data (inf, ada_inferior_data);
336 /* Return our inferior data for the given inferior (INF).
338 This function always returns a valid pointer to an allocated
339 ada_inferior_data structure. If INF's inferior data has not
340 been previously set, this functions creates a new one with all
341 fields set to zero, sets INF's inferior to it, and then returns
342 a pointer to that newly allocated ada_inferior_data. */
344 static struct ada_inferior_data *
345 get_ada_inferior_data (struct inferior *inf)
347 struct ada_inferior_data *data;
349 data = inferior_data (inf, ada_inferior_data);
352 data = XZALLOC (struct ada_inferior_data);
353 set_inferior_data (inf, ada_inferior_data, data);
359 /* Perform all necessary cleanups regarding our module's inferior data
360 that is required after the inferior INF just exited. */
363 ada_inferior_exit (struct inferior *inf)
365 ada_inferior_data_cleanup (inf, NULL);
366 set_inferior_data (inf, ada_inferior_data, NULL);
371 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
372 all typedef layers have been peeled. Otherwise, return TYPE.
374 Normally, we really expect a typedef type to only have 1 typedef layer.
375 In other words, we really expect the target type of a typedef type to be
376 a non-typedef type. This is particularly true for Ada units, because
377 the language does not have a typedef vs not-typedef distinction.
378 In that respect, the Ada compiler has been trying to eliminate as many
379 typedef definitions in the debugging information, since they generally
380 do not bring any extra information (we still use typedef under certain
381 circumstances related mostly to the GNAT encoding).
383 Unfortunately, we have seen situations where the debugging information
384 generated by the compiler leads to such multiple typedef layers. For
385 instance, consider the following example with stabs:
387 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
388 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
390 This is an error in the debugging information which causes type
391 pck__float_array___XUP to be defined twice, and the second time,
392 it is defined as a typedef of a typedef.
394 This is on the fringe of legality as far as debugging information is
395 concerned, and certainly unexpected. But it is easy to handle these
396 situations correctly, so we can afford to be lenient in this case. */
399 ada_typedef_target_type (struct type *type)
401 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
402 type = TYPE_TARGET_TYPE (type);
406 /* Given DECODED_NAME a string holding a symbol name in its
407 decoded form (ie using the Ada dotted notation), returns
408 its unqualified name. */
411 ada_unqualified_name (const char *decoded_name)
413 const char *result = strrchr (decoded_name, '.');
416 result++; /* Skip the dot... */
418 result = decoded_name;
423 /* Return a string starting with '<', followed by STR, and '>'.
424 The result is good until the next call. */
427 add_angle_brackets (const char *str)
429 static char *result = NULL;
432 result = xstrprintf ("<%s>", str);
437 ada_get_gdb_completer_word_break_characters (void)
439 return ada_completer_word_break_characters;
442 /* Print an array element index using the Ada syntax. */
445 ada_print_array_index (struct value *index_value, struct ui_file *stream,
446 const struct value_print_options *options)
448 LA_VALUE_PRINT (index_value, stream, options);
449 fprintf_filtered (stream, " => ");
452 /* Assuming VECT points to an array of *SIZE objects of size
453 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
454 updating *SIZE as necessary and returning the (new) array. */
457 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
459 if (*size < min_size)
462 if (*size < min_size)
464 vect = xrealloc (vect, *size * element_size);
469 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
470 suffix of FIELD_NAME beginning "___". */
473 field_name_match (const char *field_name, const char *target)
475 int len = strlen (target);
478 (strncmp (field_name, target, len) == 0
479 && (field_name[len] == '\0'
480 || (strncmp (field_name + len, "___", 3) == 0
481 && strcmp (field_name + strlen (field_name) - 6,
486 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
487 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
488 and return its index. This function also handles fields whose name
489 have ___ suffixes because the compiler sometimes alters their name
490 by adding such a suffix to represent fields with certain constraints.
491 If the field could not be found, return a negative number if
492 MAYBE_MISSING is set. Otherwise raise an error. */
495 ada_get_field_index (const struct type *type, const char *field_name,
499 struct type *struct_type = check_typedef ((struct type *) type);
501 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
502 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
506 error (_("Unable to find field %s in struct %s. Aborting"),
507 field_name, TYPE_NAME (struct_type));
512 /* The length of the prefix of NAME prior to any "___" suffix. */
515 ada_name_prefix_len (const char *name)
521 const char *p = strstr (name, "___");
524 return strlen (name);
530 /* Return non-zero if SUFFIX is a suffix of STR.
531 Return zero if STR is null. */
534 is_suffix (const char *str, const char *suffix)
541 len2 = strlen (suffix);
542 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
545 /* The contents of value VAL, treated as a value of type TYPE. The
546 result is an lval in memory if VAL is. */
548 static struct value *
549 coerce_unspec_val_to_type (struct value *val, struct type *type)
551 type = ada_check_typedef (type);
552 if (value_type (val) == type)
556 struct value *result;
558 /* Make sure that the object size is not unreasonable before
559 trying to allocate some memory for it. */
563 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
564 result = allocate_value_lazy (type);
567 result = allocate_value (type);
568 memcpy (value_contents_raw (result), value_contents (val),
571 set_value_component_location (result, val);
572 set_value_bitsize (result, value_bitsize (val));
573 set_value_bitpos (result, value_bitpos (val));
574 set_value_address (result, value_address (val));
579 static const gdb_byte *
580 cond_offset_host (const gdb_byte *valaddr, long offset)
585 return valaddr + offset;
589 cond_offset_target (CORE_ADDR address, long offset)
594 return address + offset;
597 /* Issue a warning (as for the definition of warning in utils.c, but
598 with exactly one argument rather than ...), unless the limit on the
599 number of warnings has passed during the evaluation of the current
602 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
603 provided by "complaint". */
604 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
607 lim_warning (const char *format, ...)
611 va_start (args, format);
612 warnings_issued += 1;
613 if (warnings_issued <= warning_limit)
614 vwarning (format, args);
619 /* Issue an error if the size of an object of type T is unreasonable,
620 i.e. if it would be a bad idea to allocate a value of this type in
624 check_size (const struct type *type)
626 if (TYPE_LENGTH (type) > varsize_limit)
627 error (_("object size is larger than varsize-limit"));
630 /* Maximum value of a SIZE-byte signed integer type. */
632 max_of_size (int size)
634 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
636 return top_bit | (top_bit - 1);
639 /* Minimum value of a SIZE-byte signed integer type. */
641 min_of_size (int size)
643 return -max_of_size (size) - 1;
646 /* Maximum value of a SIZE-byte unsigned integer type. */
648 umax_of_size (int size)
650 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
652 return top_bit | (top_bit - 1);
655 /* Maximum value of integral type T, as a signed quantity. */
657 max_of_type (struct type *t)
659 if (TYPE_UNSIGNED (t))
660 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
662 return max_of_size (TYPE_LENGTH (t));
665 /* Minimum value of integral type T, as a signed quantity. */
667 min_of_type (struct type *t)
669 if (TYPE_UNSIGNED (t))
672 return min_of_size (TYPE_LENGTH (t));
675 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
677 ada_discrete_type_high_bound (struct type *type)
679 switch (TYPE_CODE (type))
681 case TYPE_CODE_RANGE:
682 return TYPE_HIGH_BOUND (type);
684 return TYPE_FIELD_BITPOS (type, TYPE_NFIELDS (type) - 1);
689 return max_of_type (type);
691 error (_("Unexpected type in ada_discrete_type_high_bound."));
695 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
697 ada_discrete_type_low_bound (struct type *type)
699 switch (TYPE_CODE (type))
701 case TYPE_CODE_RANGE:
702 return TYPE_LOW_BOUND (type);
704 return TYPE_FIELD_BITPOS (type, 0);
709 return min_of_type (type);
711 error (_("Unexpected type in ada_discrete_type_low_bound."));
715 /* The identity on non-range types. For range types, the underlying
716 non-range scalar type. */
719 base_type (struct type *type)
721 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
723 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
725 type = TYPE_TARGET_TYPE (type);
731 /* Language Selection */
733 /* If the main program is in Ada, return language_ada, otherwise return LANG
734 (the main program is in Ada iif the adainit symbol is found). */
737 ada_update_initial_language (enum language lang)
739 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
740 (struct objfile *) NULL) != NULL)
746 /* If the main procedure is written in Ada, then return its name.
747 The result is good until the next call. Return NULL if the main
748 procedure doesn't appear to be in Ada. */
753 struct minimal_symbol *msym;
754 static char *main_program_name = NULL;
756 /* For Ada, the name of the main procedure is stored in a specific
757 string constant, generated by the binder. Look for that symbol,
758 extract its address, and then read that string. If we didn't find
759 that string, then most probably the main procedure is not written
761 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
765 CORE_ADDR main_program_name_addr;
768 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
769 if (main_program_name_addr == 0)
770 error (_("Invalid address for Ada main program name."));
772 xfree (main_program_name);
773 target_read_string (main_program_name_addr, &main_program_name,
778 return main_program_name;
781 /* The main procedure doesn't seem to be in Ada. */
787 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
790 const struct ada_opname_map ada_opname_table[] = {
791 {"Oadd", "\"+\"", BINOP_ADD},
792 {"Osubtract", "\"-\"", BINOP_SUB},
793 {"Omultiply", "\"*\"", BINOP_MUL},
794 {"Odivide", "\"/\"", BINOP_DIV},
795 {"Omod", "\"mod\"", BINOP_MOD},
796 {"Orem", "\"rem\"", BINOP_REM},
797 {"Oexpon", "\"**\"", BINOP_EXP},
798 {"Olt", "\"<\"", BINOP_LESS},
799 {"Ole", "\"<=\"", BINOP_LEQ},
800 {"Ogt", "\">\"", BINOP_GTR},
801 {"Oge", "\">=\"", BINOP_GEQ},
802 {"Oeq", "\"=\"", BINOP_EQUAL},
803 {"One", "\"/=\"", BINOP_NOTEQUAL},
804 {"Oand", "\"and\"", BINOP_BITWISE_AND},
805 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
806 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
807 {"Oconcat", "\"&\"", BINOP_CONCAT},
808 {"Oabs", "\"abs\"", UNOP_ABS},
809 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
810 {"Oadd", "\"+\"", UNOP_PLUS},
811 {"Osubtract", "\"-\"", UNOP_NEG},
815 /* The "encoded" form of DECODED, according to GNAT conventions.
816 The result is valid until the next call to ada_encode. */
819 ada_encode (const char *decoded)
821 static char *encoding_buffer = NULL;
822 static size_t encoding_buffer_size = 0;
829 GROW_VECT (encoding_buffer, encoding_buffer_size,
830 2 * strlen (decoded) + 10);
833 for (p = decoded; *p != '\0'; p += 1)
837 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
842 const struct ada_opname_map *mapping;
844 for (mapping = ada_opname_table;
845 mapping->encoded != NULL
846 && strncmp (mapping->decoded, p,
847 strlen (mapping->decoded)) != 0; mapping += 1)
849 if (mapping->encoded == NULL)
850 error (_("invalid Ada operator name: %s"), p);
851 strcpy (encoding_buffer + k, mapping->encoded);
852 k += strlen (mapping->encoded);
857 encoding_buffer[k] = *p;
862 encoding_buffer[k] = '\0';
863 return encoding_buffer;
866 /* Return NAME folded to lower case, or, if surrounded by single
867 quotes, unfolded, but with the quotes stripped away. Result good
871 ada_fold_name (const char *name)
873 static char *fold_buffer = NULL;
874 static size_t fold_buffer_size = 0;
876 int len = strlen (name);
877 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
881 strncpy (fold_buffer, name + 1, len - 2);
882 fold_buffer[len - 2] = '\000';
888 for (i = 0; i <= len; i += 1)
889 fold_buffer[i] = tolower (name[i]);
895 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
898 is_lower_alphanum (const char c)
900 return (isdigit (c) || (isalpha (c) && islower (c)));
903 /* ENCODED is the linkage name of a symbol and LEN contains its length.
904 This function saves in LEN the length of that same symbol name but
905 without either of these suffixes:
911 These are suffixes introduced by the compiler for entities such as
912 nested subprogram for instance, in order to avoid name clashes.
913 They do not serve any purpose for the debugger. */
916 ada_remove_trailing_digits (const char *encoded, int *len)
918 if (*len > 1 && isdigit (encoded[*len - 1]))
922 while (i > 0 && isdigit (encoded[i]))
924 if (i >= 0 && encoded[i] == '.')
926 else if (i >= 0 && encoded[i] == '$')
928 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
930 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
935 /* Remove the suffix introduced by the compiler for protected object
939 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
941 /* Remove trailing N. */
943 /* Protected entry subprograms are broken into two
944 separate subprograms: The first one is unprotected, and has
945 a 'N' suffix; the second is the protected version, and has
946 the 'P' suffix. The second calls the first one after handling
947 the protection. Since the P subprograms are internally generated,
948 we leave these names undecoded, giving the user a clue that this
949 entity is internal. */
952 && encoded[*len - 1] == 'N'
953 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
957 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
960 ada_remove_Xbn_suffix (const char *encoded, int *len)
964 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
967 if (encoded[i] != 'X')
973 if (isalnum (encoded[i-1]))
977 /* If ENCODED follows the GNAT entity encoding conventions, then return
978 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
981 The resulting string is valid until the next call of ada_decode.
982 If the string is unchanged by decoding, the original string pointer
986 ada_decode (const char *encoded)
993 static char *decoding_buffer = NULL;
994 static size_t decoding_buffer_size = 0;
996 /* The name of the Ada main procedure starts with "_ada_".
997 This prefix is not part of the decoded name, so skip this part
998 if we see this prefix. */
999 if (strncmp (encoded, "_ada_", 5) == 0)
1002 /* If the name starts with '_', then it is not a properly encoded
1003 name, so do not attempt to decode it. Similarly, if the name
1004 starts with '<', the name should not be decoded. */
1005 if (encoded[0] == '_' || encoded[0] == '<')
1008 len0 = strlen (encoded);
1010 ada_remove_trailing_digits (encoded, &len0);
1011 ada_remove_po_subprogram_suffix (encoded, &len0);
1013 /* Remove the ___X.* suffix if present. Do not forget to verify that
1014 the suffix is located before the current "end" of ENCODED. We want
1015 to avoid re-matching parts of ENCODED that have previously been
1016 marked as discarded (by decrementing LEN0). */
1017 p = strstr (encoded, "___");
1018 if (p != NULL && p - encoded < len0 - 3)
1026 /* Remove any trailing TKB suffix. It tells us that this symbol
1027 is for the body of a task, but that information does not actually
1028 appear in the decoded name. */
1030 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
1033 /* Remove any trailing TB suffix. The TB suffix is slightly different
1034 from the TKB suffix because it is used for non-anonymous task
1037 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
1040 /* Remove trailing "B" suffixes. */
1041 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1043 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
1046 /* Make decoded big enough for possible expansion by operator name. */
1048 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1049 decoded = decoding_buffer;
1051 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1053 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1056 while ((i >= 0 && isdigit (encoded[i]))
1057 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1059 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1061 else if (encoded[i] == '$')
1065 /* The first few characters that are not alphabetic are not part
1066 of any encoding we use, so we can copy them over verbatim. */
1068 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1069 decoded[j] = encoded[i];
1074 /* Is this a symbol function? */
1075 if (at_start_name && encoded[i] == 'O')
1079 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1081 int op_len = strlen (ada_opname_table[k].encoded);
1082 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1084 && !isalnum (encoded[i + op_len]))
1086 strcpy (decoded + j, ada_opname_table[k].decoded);
1089 j += strlen (ada_opname_table[k].decoded);
1093 if (ada_opname_table[k].encoded != NULL)
1098 /* Replace "TK__" with "__", which will eventually be translated
1099 into "." (just below). */
1101 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1104 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1105 be translated into "." (just below). These are internal names
1106 generated for anonymous blocks inside which our symbol is nested. */
1108 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1109 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1110 && isdigit (encoded [i+4]))
1114 while (k < len0 && isdigit (encoded[k]))
1115 k++; /* Skip any extra digit. */
1117 /* Double-check that the "__B_{DIGITS}+" sequence we found
1118 is indeed followed by "__". */
1119 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1123 /* Remove _E{DIGITS}+[sb] */
1125 /* Just as for protected object subprograms, there are 2 categories
1126 of subprograms created by the compiler for each entry. The first
1127 one implements the actual entry code, and has a suffix following
1128 the convention above; the second one implements the barrier and
1129 uses the same convention as above, except that the 'E' is replaced
1132 Just as above, we do not decode the name of barrier functions
1133 to give the user a clue that the code he is debugging has been
1134 internally generated. */
1136 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1137 && isdigit (encoded[i+2]))
1141 while (k < len0 && isdigit (encoded[k]))
1145 && (encoded[k] == 'b' || encoded[k] == 's'))
1148 /* Just as an extra precaution, make sure that if this
1149 suffix is followed by anything else, it is a '_'.
1150 Otherwise, we matched this sequence by accident. */
1152 || (k < len0 && encoded[k] == '_'))
1157 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1158 the GNAT front-end in protected object subprograms. */
1161 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1163 /* Backtrack a bit up until we reach either the begining of
1164 the encoded name, or "__". Make sure that we only find
1165 digits or lowercase characters. */
1166 const char *ptr = encoded + i - 1;
1168 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1171 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1175 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1177 /* This is a X[bn]* sequence not separated from the previous
1178 part of the name with a non-alpha-numeric character (in other
1179 words, immediately following an alpha-numeric character), then
1180 verify that it is placed at the end of the encoded name. If
1181 not, then the encoding is not valid and we should abort the
1182 decoding. Otherwise, just skip it, it is used in body-nested
1186 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1190 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1192 /* Replace '__' by '.'. */
1200 /* It's a character part of the decoded name, so just copy it
1202 decoded[j] = encoded[i];
1207 decoded[j] = '\000';
1209 /* Decoded names should never contain any uppercase character.
1210 Double-check this, and abort the decoding if we find one. */
1212 for (i = 0; decoded[i] != '\0'; i += 1)
1213 if (isupper (decoded[i]) || decoded[i] == ' ')
1216 if (strcmp (decoded, encoded) == 0)
1222 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1223 decoded = decoding_buffer;
1224 if (encoded[0] == '<')
1225 strcpy (decoded, encoded);
1227 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1232 /* Table for keeping permanent unique copies of decoded names. Once
1233 allocated, names in this table are never released. While this is a
1234 storage leak, it should not be significant unless there are massive
1235 changes in the set of decoded names in successive versions of a
1236 symbol table loaded during a single session. */
1237 static struct htab *decoded_names_store;
1239 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1240 in the language-specific part of GSYMBOL, if it has not been
1241 previously computed. Tries to save the decoded name in the same
1242 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1243 in any case, the decoded symbol has a lifetime at least that of
1245 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1246 const, but nevertheless modified to a semantically equivalent form
1247 when a decoded name is cached in it. */
1250 ada_decode_symbol (const struct general_symbol_info *gsymbol)
1253 (char **) &gsymbol->language_specific.mangled_lang.demangled_name;
1255 if (*resultp == NULL)
1257 const char *decoded = ada_decode (gsymbol->name);
1259 if (gsymbol->obj_section != NULL)
1261 struct objfile *objf = gsymbol->obj_section->objfile;
1263 *resultp = obsavestring (decoded, strlen (decoded),
1264 &objf->objfile_obstack);
1266 /* Sometimes, we can't find a corresponding objfile, in which
1267 case, we put the result on the heap. Since we only decode
1268 when needed, we hope this usually does not cause a
1269 significant memory leak (FIXME). */
1270 if (*resultp == NULL)
1272 char **slot = (char **) htab_find_slot (decoded_names_store,
1276 *slot = xstrdup (decoded);
1285 ada_la_decode (const char *encoded, int options)
1287 return xstrdup (ada_decode (encoded));
1290 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1291 suffixes that encode debugging information or leading _ada_ on
1292 SYM_NAME (see is_name_suffix commentary for the debugging
1293 information that is ignored). If WILD, then NAME need only match a
1294 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1295 either argument is NULL. */
1298 match_name (const char *sym_name, const char *name, int wild)
1300 if (sym_name == NULL || name == NULL)
1303 return wild_match (sym_name, name) == 0;
1306 int len_name = strlen (name);
1308 return (strncmp (sym_name, name, len_name) == 0
1309 && is_name_suffix (sym_name + len_name))
1310 || (strncmp (sym_name, "_ada_", 5) == 0
1311 && strncmp (sym_name + 5, name, len_name) == 0
1312 && is_name_suffix (sym_name + len_name + 5));
1319 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1320 generated by the GNAT compiler to describe the index type used
1321 for each dimension of an array, check whether it follows the latest
1322 known encoding. If not, fix it up to conform to the latest encoding.
1323 Otherwise, do nothing. This function also does nothing if
1324 INDEX_DESC_TYPE is NULL.
1326 The GNAT encoding used to describle the array index type evolved a bit.
1327 Initially, the information would be provided through the name of each
1328 field of the structure type only, while the type of these fields was
1329 described as unspecified and irrelevant. The debugger was then expected
1330 to perform a global type lookup using the name of that field in order
1331 to get access to the full index type description. Because these global
1332 lookups can be very expensive, the encoding was later enhanced to make
1333 the global lookup unnecessary by defining the field type as being
1334 the full index type description.
1336 The purpose of this routine is to allow us to support older versions
1337 of the compiler by detecting the use of the older encoding, and by
1338 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1339 we essentially replace each field's meaningless type by the associated
1343 ada_fixup_array_indexes_type (struct type *index_desc_type)
1347 if (index_desc_type == NULL)
1349 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1351 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1352 to check one field only, no need to check them all). If not, return
1355 If our INDEX_DESC_TYPE was generated using the older encoding,
1356 the field type should be a meaningless integer type whose name
1357 is not equal to the field name. */
1358 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1359 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1360 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1363 /* Fixup each field of INDEX_DESC_TYPE. */
1364 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1366 char *name = TYPE_FIELD_NAME (index_desc_type, i);
1367 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1370 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1374 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1376 static char *bound_name[] = {
1377 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1378 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1381 /* Maximum number of array dimensions we are prepared to handle. */
1383 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1386 /* The desc_* routines return primitive portions of array descriptors
1389 /* The descriptor or array type, if any, indicated by TYPE; removes
1390 level of indirection, if needed. */
1392 static struct type *
1393 desc_base_type (struct type *type)
1397 type = ada_check_typedef (type);
1398 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1399 type = ada_typedef_target_type (type);
1402 && (TYPE_CODE (type) == TYPE_CODE_PTR
1403 || TYPE_CODE (type) == TYPE_CODE_REF))
1404 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1409 /* True iff TYPE indicates a "thin" array pointer type. */
1412 is_thin_pntr (struct type *type)
1415 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1416 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1419 /* The descriptor type for thin pointer type TYPE. */
1421 static struct type *
1422 thin_descriptor_type (struct type *type)
1424 struct type *base_type = desc_base_type (type);
1426 if (base_type == NULL)
1428 if (is_suffix (ada_type_name (base_type), "___XVE"))
1432 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1434 if (alt_type == NULL)
1441 /* A pointer to the array data for thin-pointer value VAL. */
1443 static struct value *
1444 thin_data_pntr (struct value *val)
1446 struct type *type = ada_check_typedef (value_type (val));
1447 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1449 data_type = lookup_pointer_type (data_type);
1451 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1452 return value_cast (data_type, value_copy (val));
1454 return value_from_longest (data_type, value_address (val));
1457 /* True iff TYPE indicates a "thick" array pointer type. */
1460 is_thick_pntr (struct type *type)
1462 type = desc_base_type (type);
1463 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1464 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1467 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1468 pointer to one, the type of its bounds data; otherwise, NULL. */
1470 static struct type *
1471 desc_bounds_type (struct type *type)
1475 type = desc_base_type (type);
1479 else if (is_thin_pntr (type))
1481 type = thin_descriptor_type (type);
1484 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1486 return ada_check_typedef (r);
1488 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1490 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1492 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1497 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1498 one, a pointer to its bounds data. Otherwise NULL. */
1500 static struct value *
1501 desc_bounds (struct value *arr)
1503 struct type *type = ada_check_typedef (value_type (arr));
1505 if (is_thin_pntr (type))
1507 struct type *bounds_type =
1508 desc_bounds_type (thin_descriptor_type (type));
1511 if (bounds_type == NULL)
1512 error (_("Bad GNAT array descriptor"));
1514 /* NOTE: The following calculation is not really kosher, but
1515 since desc_type is an XVE-encoded type (and shouldn't be),
1516 the correct calculation is a real pain. FIXME (and fix GCC). */
1517 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1518 addr = value_as_long (arr);
1520 addr = value_address (arr);
1523 value_from_longest (lookup_pointer_type (bounds_type),
1524 addr - TYPE_LENGTH (bounds_type));
1527 else if (is_thick_pntr (type))
1529 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1530 _("Bad GNAT array descriptor"));
1531 struct type *p_bounds_type = value_type (p_bounds);
1534 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1536 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1538 if (TYPE_STUB (target_type))
1539 p_bounds = value_cast (lookup_pointer_type
1540 (ada_check_typedef (target_type)),
1544 error (_("Bad GNAT array descriptor"));
1552 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1553 position of the field containing the address of the bounds data. */
1556 fat_pntr_bounds_bitpos (struct type *type)
1558 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1561 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1562 size of the field containing the address of the bounds data. */
1565 fat_pntr_bounds_bitsize (struct type *type)
1567 type = desc_base_type (type);
1569 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1570 return TYPE_FIELD_BITSIZE (type, 1);
1572 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1575 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1576 pointer to one, the type of its array data (a array-with-no-bounds type);
1577 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1580 static struct type *
1581 desc_data_target_type (struct type *type)
1583 type = desc_base_type (type);
1585 /* NOTE: The following is bogus; see comment in desc_bounds. */
1586 if (is_thin_pntr (type))
1587 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1588 else if (is_thick_pntr (type))
1590 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1593 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1594 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1600 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1603 static struct value *
1604 desc_data (struct value *arr)
1606 struct type *type = value_type (arr);
1608 if (is_thin_pntr (type))
1609 return thin_data_pntr (arr);
1610 else if (is_thick_pntr (type))
1611 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1612 _("Bad GNAT array descriptor"));
1618 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1619 position of the field containing the address of the data. */
1622 fat_pntr_data_bitpos (struct type *type)
1624 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1627 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1628 size of the field containing the address of the data. */
1631 fat_pntr_data_bitsize (struct type *type)
1633 type = desc_base_type (type);
1635 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1636 return TYPE_FIELD_BITSIZE (type, 0);
1638 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1641 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1642 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1643 bound, if WHICH is 1. The first bound is I=1. */
1645 static struct value *
1646 desc_one_bound (struct value *bounds, int i, int which)
1648 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1649 _("Bad GNAT array descriptor bounds"));
1652 /* If BOUNDS is an array-bounds structure type, return the bit position
1653 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1654 bound, if WHICH is 1. The first bound is I=1. */
1657 desc_bound_bitpos (struct type *type, int i, int which)
1659 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1662 /* If BOUNDS is an array-bounds structure type, return the bit field size
1663 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1664 bound, if WHICH is 1. The first bound is I=1. */
1667 desc_bound_bitsize (struct type *type, int i, int which)
1669 type = desc_base_type (type);
1671 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1672 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1674 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1677 /* If TYPE is the type of an array-bounds structure, the type of its
1678 Ith bound (numbering from 1). Otherwise, NULL. */
1680 static struct type *
1681 desc_index_type (struct type *type, int i)
1683 type = desc_base_type (type);
1685 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1686 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1691 /* The number of index positions in the array-bounds type TYPE.
1692 Return 0 if TYPE is NULL. */
1695 desc_arity (struct type *type)
1697 type = desc_base_type (type);
1700 return TYPE_NFIELDS (type) / 2;
1704 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1705 an array descriptor type (representing an unconstrained array
1709 ada_is_direct_array_type (struct type *type)
1713 type = ada_check_typedef (type);
1714 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1715 || ada_is_array_descriptor_type (type));
1718 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1722 ada_is_array_type (struct type *type)
1725 && (TYPE_CODE (type) == TYPE_CODE_PTR
1726 || TYPE_CODE (type) == TYPE_CODE_REF))
1727 type = TYPE_TARGET_TYPE (type);
1728 return ada_is_direct_array_type (type);
1731 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1734 ada_is_simple_array_type (struct type *type)
1738 type = ada_check_typedef (type);
1739 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1740 || (TYPE_CODE (type) == TYPE_CODE_PTR
1741 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1742 == TYPE_CODE_ARRAY));
1745 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1748 ada_is_array_descriptor_type (struct type *type)
1750 struct type *data_type = desc_data_target_type (type);
1754 type = ada_check_typedef (type);
1755 return (data_type != NULL
1756 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1757 && desc_arity (desc_bounds_type (type)) > 0);
1760 /* Non-zero iff type is a partially mal-formed GNAT array
1761 descriptor. FIXME: This is to compensate for some problems with
1762 debugging output from GNAT. Re-examine periodically to see if it
1766 ada_is_bogus_array_descriptor (struct type *type)
1770 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1771 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1772 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1773 && !ada_is_array_descriptor_type (type);
1777 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1778 (fat pointer) returns the type of the array data described---specifically,
1779 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1780 in from the descriptor; otherwise, they are left unspecified. If
1781 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1782 returns NULL. The result is simply the type of ARR if ARR is not
1785 ada_type_of_array (struct value *arr, int bounds)
1787 if (ada_is_constrained_packed_array_type (value_type (arr)))
1788 return decode_constrained_packed_array_type (value_type (arr));
1790 if (!ada_is_array_descriptor_type (value_type (arr)))
1791 return value_type (arr);
1795 struct type *array_type =
1796 ada_check_typedef (desc_data_target_type (value_type (arr)));
1798 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1799 TYPE_FIELD_BITSIZE (array_type, 0) =
1800 decode_packed_array_bitsize (value_type (arr));
1806 struct type *elt_type;
1808 struct value *descriptor;
1810 elt_type = ada_array_element_type (value_type (arr), -1);
1811 arity = ada_array_arity (value_type (arr));
1813 if (elt_type == NULL || arity == 0)
1814 return ada_check_typedef (value_type (arr));
1816 descriptor = desc_bounds (arr);
1817 if (value_as_long (descriptor) == 0)
1821 struct type *range_type = alloc_type_copy (value_type (arr));
1822 struct type *array_type = alloc_type_copy (value_type (arr));
1823 struct value *low = desc_one_bound (descriptor, arity, 0);
1824 struct value *high = desc_one_bound (descriptor, arity, 1);
1827 create_range_type (range_type, value_type (low),
1828 longest_to_int (value_as_long (low)),
1829 longest_to_int (value_as_long (high)));
1830 elt_type = create_array_type (array_type, elt_type, range_type);
1832 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1834 /* We need to store the element packed bitsize, as well as
1835 recompute the array size, because it was previously
1836 computed based on the unpacked element size. */
1837 LONGEST lo = value_as_long (low);
1838 LONGEST hi = value_as_long (high);
1840 TYPE_FIELD_BITSIZE (elt_type, 0) =
1841 decode_packed_array_bitsize (value_type (arr));
1842 /* If the array has no element, then the size is already
1843 zero, and does not need to be recomputed. */
1847 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
1849 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
1854 return lookup_pointer_type (elt_type);
1858 /* If ARR does not represent an array, returns ARR unchanged.
1859 Otherwise, returns either a standard GDB array with bounds set
1860 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1861 GDB array. Returns NULL if ARR is a null fat pointer. */
1864 ada_coerce_to_simple_array_ptr (struct value *arr)
1866 if (ada_is_array_descriptor_type (value_type (arr)))
1868 struct type *arrType = ada_type_of_array (arr, 1);
1870 if (arrType == NULL)
1872 return value_cast (arrType, value_copy (desc_data (arr)));
1874 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1875 return decode_constrained_packed_array (arr);
1880 /* If ARR does not represent an array, returns ARR unchanged.
1881 Otherwise, returns a standard GDB array describing ARR (which may
1882 be ARR itself if it already is in the proper form). */
1885 ada_coerce_to_simple_array (struct value *arr)
1887 if (ada_is_array_descriptor_type (value_type (arr)))
1889 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1892 error (_("Bounds unavailable for null array pointer."));
1893 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1894 return value_ind (arrVal);
1896 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1897 return decode_constrained_packed_array (arr);
1902 /* If TYPE represents a GNAT array type, return it translated to an
1903 ordinary GDB array type (possibly with BITSIZE fields indicating
1904 packing). For other types, is the identity. */
1907 ada_coerce_to_simple_array_type (struct type *type)
1909 if (ada_is_constrained_packed_array_type (type))
1910 return decode_constrained_packed_array_type (type);
1912 if (ada_is_array_descriptor_type (type))
1913 return ada_check_typedef (desc_data_target_type (type));
1918 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1921 ada_is_packed_array_type (struct type *type)
1925 type = desc_base_type (type);
1926 type = ada_check_typedef (type);
1928 ada_type_name (type) != NULL
1929 && strstr (ada_type_name (type), "___XP") != NULL;
1932 /* Non-zero iff TYPE represents a standard GNAT constrained
1933 packed-array type. */
1936 ada_is_constrained_packed_array_type (struct type *type)
1938 return ada_is_packed_array_type (type)
1939 && !ada_is_array_descriptor_type (type);
1942 /* Non-zero iff TYPE represents an array descriptor for a
1943 unconstrained packed-array type. */
1946 ada_is_unconstrained_packed_array_type (struct type *type)
1948 return ada_is_packed_array_type (type)
1949 && ada_is_array_descriptor_type (type);
1952 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1953 return the size of its elements in bits. */
1956 decode_packed_array_bitsize (struct type *type)
1962 /* Access to arrays implemented as fat pointers are encoded as a typedef
1963 of the fat pointer type. We need the name of the fat pointer type
1964 to do the decoding, so strip the typedef layer. */
1965 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1966 type = ada_typedef_target_type (type);
1968 raw_name = ada_type_name (ada_check_typedef (type));
1970 raw_name = ada_type_name (desc_base_type (type));
1975 tail = strstr (raw_name, "___XP");
1976 gdb_assert (tail != NULL);
1978 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1981 (_("could not understand bit size information on packed array"));
1988 /* Given that TYPE is a standard GDB array type with all bounds filled
1989 in, and that the element size of its ultimate scalar constituents
1990 (that is, either its elements, or, if it is an array of arrays, its
1991 elements' elements, etc.) is *ELT_BITS, return an identical type,
1992 but with the bit sizes of its elements (and those of any
1993 constituent arrays) recorded in the BITSIZE components of its
1994 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1997 static struct type *
1998 constrained_packed_array_type (struct type *type, long *elt_bits)
2000 struct type *new_elt_type;
2001 struct type *new_type;
2002 LONGEST low_bound, high_bound;
2004 type = ada_check_typedef (type);
2005 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2008 new_type = alloc_type_copy (type);
2010 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2012 create_array_type (new_type, new_elt_type, TYPE_INDEX_TYPE (type));
2013 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2014 TYPE_NAME (new_type) = ada_type_name (type);
2016 if (get_discrete_bounds (TYPE_INDEX_TYPE (type),
2017 &low_bound, &high_bound) < 0)
2018 low_bound = high_bound = 0;
2019 if (high_bound < low_bound)
2020 *elt_bits = TYPE_LENGTH (new_type) = 0;
2023 *elt_bits *= (high_bound - low_bound + 1);
2024 TYPE_LENGTH (new_type) =
2025 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2028 TYPE_FIXED_INSTANCE (new_type) = 1;
2032 /* The array type encoded by TYPE, where
2033 ada_is_constrained_packed_array_type (TYPE). */
2035 static struct type *
2036 decode_constrained_packed_array_type (struct type *type)
2038 char *raw_name = ada_type_name (ada_check_typedef (type));
2041 struct type *shadow_type;
2045 raw_name = ada_type_name (desc_base_type (type));
2050 name = (char *) alloca (strlen (raw_name) + 1);
2051 tail = strstr (raw_name, "___XP");
2052 type = desc_base_type (type);
2054 memcpy (name, raw_name, tail - raw_name);
2055 name[tail - raw_name] = '\000';
2057 shadow_type = ada_find_parallel_type_with_name (type, name);
2059 if (shadow_type == NULL)
2061 lim_warning (_("could not find bounds information on packed array"));
2064 CHECK_TYPEDEF (shadow_type);
2066 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2068 lim_warning (_("could not understand bounds "
2069 "information on packed array"));
2073 bits = decode_packed_array_bitsize (type);
2074 return constrained_packed_array_type (shadow_type, &bits);
2077 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2078 array, returns a simple array that denotes that array. Its type is a
2079 standard GDB array type except that the BITSIZEs of the array
2080 target types are set to the number of bits in each element, and the
2081 type length is set appropriately. */
2083 static struct value *
2084 decode_constrained_packed_array (struct value *arr)
2088 arr = ada_coerce_ref (arr);
2090 /* If our value is a pointer, then dererence it. Make sure that
2091 this operation does not cause the target type to be fixed, as
2092 this would indirectly cause this array to be decoded. The rest
2093 of the routine assumes that the array hasn't been decoded yet,
2094 so we use the basic "value_ind" routine to perform the dereferencing,
2095 as opposed to using "ada_value_ind". */
2096 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2097 arr = value_ind (arr);
2099 type = decode_constrained_packed_array_type (value_type (arr));
2102 error (_("can't unpack array"));
2106 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2107 && ada_is_modular_type (value_type (arr)))
2109 /* This is a (right-justified) modular type representing a packed
2110 array with no wrapper. In order to interpret the value through
2111 the (left-justified) packed array type we just built, we must
2112 first left-justify it. */
2113 int bit_size, bit_pos;
2116 mod = ada_modulus (value_type (arr)) - 1;
2123 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2124 arr = ada_value_primitive_packed_val (arr, NULL,
2125 bit_pos / HOST_CHAR_BIT,
2126 bit_pos % HOST_CHAR_BIT,
2131 return coerce_unspec_val_to_type (arr, type);
2135 /* The value of the element of packed array ARR at the ARITY indices
2136 given in IND. ARR must be a simple array. */
2138 static struct value *
2139 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2142 int bits, elt_off, bit_off;
2143 long elt_total_bit_offset;
2144 struct type *elt_type;
2148 elt_total_bit_offset = 0;
2149 elt_type = ada_check_typedef (value_type (arr));
2150 for (i = 0; i < arity; i += 1)
2152 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2153 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2155 (_("attempt to do packed indexing of "
2156 "something other than a packed array"));
2159 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2160 LONGEST lowerbound, upperbound;
2163 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2165 lim_warning (_("don't know bounds of array"));
2166 lowerbound = upperbound = 0;
2169 idx = pos_atr (ind[i]);
2170 if (idx < lowerbound || idx > upperbound)
2171 lim_warning (_("packed array index %ld out of bounds"),
2173 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2174 elt_total_bit_offset += (idx - lowerbound) * bits;
2175 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2178 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2179 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2181 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2186 /* Non-zero iff TYPE includes negative integer values. */
2189 has_negatives (struct type *type)
2191 switch (TYPE_CODE (type))
2196 return !TYPE_UNSIGNED (type);
2197 case TYPE_CODE_RANGE:
2198 return TYPE_LOW_BOUND (type) < 0;
2203 /* Create a new value of type TYPE from the contents of OBJ starting
2204 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2205 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2206 assigning through the result will set the field fetched from.
2207 VALADDR is ignored unless OBJ is NULL, in which case,
2208 VALADDR+OFFSET must address the start of storage containing the
2209 packed value. The value returned in this case is never an lval.
2210 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2213 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2214 long offset, int bit_offset, int bit_size,
2218 int src, /* Index into the source area */
2219 targ, /* Index into the target area */
2220 srcBitsLeft, /* Number of source bits left to move */
2221 nsrc, ntarg, /* Number of source and target bytes */
2222 unusedLS, /* Number of bits in next significant
2223 byte of source that are unused */
2224 accumSize; /* Number of meaningful bits in accum */
2225 unsigned char *bytes; /* First byte containing data to unpack */
2226 unsigned char *unpacked;
2227 unsigned long accum; /* Staging area for bits being transferred */
2229 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2230 /* Transmit bytes from least to most significant; delta is the direction
2231 the indices move. */
2232 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
2234 type = ada_check_typedef (type);
2238 v = allocate_value (type);
2239 bytes = (unsigned char *) (valaddr + offset);
2241 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2244 value_address (obj) + offset);
2245 bytes = (unsigned char *) alloca (len);
2246 read_memory (value_address (v), bytes, len);
2250 v = allocate_value (type);
2251 bytes = (unsigned char *) value_contents (obj) + offset;
2258 set_value_component_location (v, obj);
2259 new_addr = value_address (obj) + offset;
2260 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2261 set_value_bitsize (v, bit_size);
2262 if (value_bitpos (v) >= HOST_CHAR_BIT)
2265 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2267 set_value_address (v, new_addr);
2270 set_value_bitsize (v, bit_size);
2271 unpacked = (unsigned char *) value_contents (v);
2273 srcBitsLeft = bit_size;
2275 ntarg = TYPE_LENGTH (type);
2279 memset (unpacked, 0, TYPE_LENGTH (type));
2282 else if (gdbarch_bits_big_endian (get_type_arch (type)))
2285 if (has_negatives (type)
2286 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2290 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2293 switch (TYPE_CODE (type))
2295 case TYPE_CODE_ARRAY:
2296 case TYPE_CODE_UNION:
2297 case TYPE_CODE_STRUCT:
2298 /* Non-scalar values must be aligned at a byte boundary... */
2300 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2301 /* ... And are placed at the beginning (most-significant) bytes
2303 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2308 targ = TYPE_LENGTH (type) - 1;
2314 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2317 unusedLS = bit_offset;
2320 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2327 /* Mask for removing bits of the next source byte that are not
2328 part of the value. */
2329 unsigned int unusedMSMask =
2330 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2332 /* Sign-extend bits for this byte. */
2333 unsigned int signMask = sign & ~unusedMSMask;
2336 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2337 accumSize += HOST_CHAR_BIT - unusedLS;
2338 if (accumSize >= HOST_CHAR_BIT)
2340 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2341 accumSize -= HOST_CHAR_BIT;
2342 accum >>= HOST_CHAR_BIT;
2346 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2353 accum |= sign << accumSize;
2354 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2355 accumSize -= HOST_CHAR_BIT;
2356 accum >>= HOST_CHAR_BIT;
2364 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2365 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2368 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2369 int src_offset, int n, int bits_big_endian_p)
2371 unsigned int accum, mask;
2372 int accum_bits, chunk_size;
2374 target += targ_offset / HOST_CHAR_BIT;
2375 targ_offset %= HOST_CHAR_BIT;
2376 source += src_offset / HOST_CHAR_BIT;
2377 src_offset %= HOST_CHAR_BIT;
2378 if (bits_big_endian_p)
2380 accum = (unsigned char) *source;
2382 accum_bits = HOST_CHAR_BIT - src_offset;
2388 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2389 accum_bits += HOST_CHAR_BIT;
2391 chunk_size = HOST_CHAR_BIT - targ_offset;
2394 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2395 mask = ((1 << chunk_size) - 1) << unused_right;
2398 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2400 accum_bits -= chunk_size;
2407 accum = (unsigned char) *source >> src_offset;
2409 accum_bits = HOST_CHAR_BIT - src_offset;
2413 accum = accum + ((unsigned char) *source << accum_bits);
2414 accum_bits += HOST_CHAR_BIT;
2416 chunk_size = HOST_CHAR_BIT - targ_offset;
2419 mask = ((1 << chunk_size) - 1) << targ_offset;
2420 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2422 accum_bits -= chunk_size;
2423 accum >>= chunk_size;
2430 /* Store the contents of FROMVAL into the location of TOVAL.
2431 Return a new value with the location of TOVAL and contents of
2432 FROMVAL. Handles assignment into packed fields that have
2433 floating-point or non-scalar types. */
2435 static struct value *
2436 ada_value_assign (struct value *toval, struct value *fromval)
2438 struct type *type = value_type (toval);
2439 int bits = value_bitsize (toval);
2441 toval = ada_coerce_ref (toval);
2442 fromval = ada_coerce_ref (fromval);
2444 if (ada_is_direct_array_type (value_type (toval)))
2445 toval = ada_coerce_to_simple_array (toval);
2446 if (ada_is_direct_array_type (value_type (fromval)))
2447 fromval = ada_coerce_to_simple_array (fromval);
2449 if (!deprecated_value_modifiable (toval))
2450 error (_("Left operand of assignment is not a modifiable lvalue."));
2452 if (VALUE_LVAL (toval) == lval_memory
2454 && (TYPE_CODE (type) == TYPE_CODE_FLT
2455 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2457 int len = (value_bitpos (toval)
2458 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2460 char *buffer = (char *) alloca (len);
2462 CORE_ADDR to_addr = value_address (toval);
2464 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2465 fromval = value_cast (type, fromval);
2467 read_memory (to_addr, buffer, len);
2468 from_size = value_bitsize (fromval);
2470 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2471 if (gdbarch_bits_big_endian (get_type_arch (type)))
2472 move_bits (buffer, value_bitpos (toval),
2473 value_contents (fromval), from_size - bits, bits, 1);
2475 move_bits (buffer, value_bitpos (toval),
2476 value_contents (fromval), 0, bits, 0);
2477 write_memory (to_addr, buffer, len);
2478 observer_notify_memory_changed (to_addr, len, buffer);
2480 val = value_copy (toval);
2481 memcpy (value_contents_raw (val), value_contents (fromval),
2482 TYPE_LENGTH (type));
2483 deprecated_set_value_type (val, type);
2488 return value_assign (toval, fromval);
2492 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2493 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2494 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2495 * COMPONENT, and not the inferior's memory. The current contents
2496 * of COMPONENT are ignored. */
2498 value_assign_to_component (struct value *container, struct value *component,
2501 LONGEST offset_in_container =
2502 (LONGEST) (value_address (component) - value_address (container));
2503 int bit_offset_in_container =
2504 value_bitpos (component) - value_bitpos (container);
2507 val = value_cast (value_type (component), val);
2509 if (value_bitsize (component) == 0)
2510 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2512 bits = value_bitsize (component);
2514 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2515 move_bits (value_contents_writeable (container) + offset_in_container,
2516 value_bitpos (container) + bit_offset_in_container,
2517 value_contents (val),
2518 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2521 move_bits (value_contents_writeable (container) + offset_in_container,
2522 value_bitpos (container) + bit_offset_in_container,
2523 value_contents (val), 0, bits, 0);
2526 /* The value of the element of array ARR at the ARITY indices given in IND.
2527 ARR may be either a simple array, GNAT array descriptor, or pointer
2531 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2535 struct type *elt_type;
2537 elt = ada_coerce_to_simple_array (arr);
2539 elt_type = ada_check_typedef (value_type (elt));
2540 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2541 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2542 return value_subscript_packed (elt, arity, ind);
2544 for (k = 0; k < arity; k += 1)
2546 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2547 error (_("too many subscripts (%d expected)"), k);
2548 elt = value_subscript (elt, pos_atr (ind[k]));
2553 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2554 value of the element of *ARR at the ARITY indices given in
2555 IND. Does not read the entire array into memory. */
2557 static struct value *
2558 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2563 for (k = 0; k < arity; k += 1)
2567 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2568 error (_("too many subscripts (%d expected)"), k);
2569 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2571 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2572 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2573 type = TYPE_TARGET_TYPE (type);
2576 return value_ind (arr);
2579 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2580 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2581 elements starting at index LOW. The lower bound of this array is LOW, as
2583 static struct value *
2584 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2587 struct type *type0 = ada_check_typedef (type);
2588 CORE_ADDR base = value_as_address (array_ptr)
2589 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)))
2590 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2591 struct type *index_type =
2592 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)),
2594 struct type *slice_type =
2595 create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type);
2597 return value_at_lazy (slice_type, base);
2601 static struct value *
2602 ada_value_slice (struct value *array, int low, int high)
2604 struct type *type = ada_check_typedef (value_type (array));
2605 struct type *index_type =
2606 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2607 struct type *slice_type =
2608 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2610 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2613 /* If type is a record type in the form of a standard GNAT array
2614 descriptor, returns the number of dimensions for type. If arr is a
2615 simple array, returns the number of "array of"s that prefix its
2616 type designation. Otherwise, returns 0. */
2619 ada_array_arity (struct type *type)
2626 type = desc_base_type (type);
2629 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2630 return desc_arity (desc_bounds_type (type));
2632 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2635 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2641 /* If TYPE is a record type in the form of a standard GNAT array
2642 descriptor or a simple array type, returns the element type for
2643 TYPE after indexing by NINDICES indices, or by all indices if
2644 NINDICES is -1. Otherwise, returns NULL. */
2647 ada_array_element_type (struct type *type, int nindices)
2649 type = desc_base_type (type);
2651 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2654 struct type *p_array_type;
2656 p_array_type = desc_data_target_type (type);
2658 k = ada_array_arity (type);
2662 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2663 if (nindices >= 0 && k > nindices)
2665 while (k > 0 && p_array_type != NULL)
2667 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2670 return p_array_type;
2672 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2674 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2676 type = TYPE_TARGET_TYPE (type);
2685 /* The type of nth index in arrays of given type (n numbering from 1).
2686 Does not examine memory. Throws an error if N is invalid or TYPE
2687 is not an array type. NAME is the name of the Ada attribute being
2688 evaluated ('range, 'first, 'last, or 'length); it is used in building
2689 the error message. */
2691 static struct type *
2692 ada_index_type (struct type *type, int n, const char *name)
2694 struct type *result_type;
2696 type = desc_base_type (type);
2698 if (n < 0 || n > ada_array_arity (type))
2699 error (_("invalid dimension number to '%s"), name);
2701 if (ada_is_simple_array_type (type))
2705 for (i = 1; i < n; i += 1)
2706 type = TYPE_TARGET_TYPE (type);
2707 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2708 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2709 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2710 perhaps stabsread.c would make more sense. */
2711 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2716 result_type = desc_index_type (desc_bounds_type (type), n);
2717 if (result_type == NULL)
2718 error (_("attempt to take bound of something that is not an array"));
2724 /* Given that arr is an array type, returns the lower bound of the
2725 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2726 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2727 array-descriptor type. It works for other arrays with bounds supplied
2728 by run-time quantities other than discriminants. */
2731 ada_array_bound_from_type (struct type * arr_type, int n, int which)
2733 struct type *type, *elt_type, *index_type_desc, *index_type;
2736 gdb_assert (which == 0 || which == 1);
2738 if (ada_is_constrained_packed_array_type (arr_type))
2739 arr_type = decode_constrained_packed_array_type (arr_type);
2741 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2742 return (LONGEST) - which;
2744 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2745 type = TYPE_TARGET_TYPE (arr_type);
2750 for (i = n; i > 1; i--)
2751 elt_type = TYPE_TARGET_TYPE (type);
2753 index_type_desc = ada_find_parallel_type (type, "___XA");
2754 ada_fixup_array_indexes_type (index_type_desc);
2755 if (index_type_desc != NULL)
2756 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2759 index_type = TYPE_INDEX_TYPE (elt_type);
2762 (LONGEST) (which == 0
2763 ? ada_discrete_type_low_bound (index_type)
2764 : ada_discrete_type_high_bound (index_type));
2767 /* Given that arr is an array value, returns the lower bound of the
2768 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2769 WHICH is 1. This routine will also work for arrays with bounds
2770 supplied by run-time quantities other than discriminants. */
2773 ada_array_bound (struct value *arr, int n, int which)
2775 struct type *arr_type = value_type (arr);
2777 if (ada_is_constrained_packed_array_type (arr_type))
2778 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
2779 else if (ada_is_simple_array_type (arr_type))
2780 return ada_array_bound_from_type (arr_type, n, which);
2782 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
2785 /* Given that arr is an array value, returns the length of the
2786 nth index. This routine will also work for arrays with bounds
2787 supplied by run-time quantities other than discriminants.
2788 Does not work for arrays indexed by enumeration types with representation
2789 clauses at the moment. */
2792 ada_array_length (struct value *arr, int n)
2794 struct type *arr_type = ada_check_typedef (value_type (arr));
2796 if (ada_is_constrained_packed_array_type (arr_type))
2797 return ada_array_length (decode_constrained_packed_array (arr), n);
2799 if (ada_is_simple_array_type (arr_type))
2800 return (ada_array_bound_from_type (arr_type, n, 1)
2801 - ada_array_bound_from_type (arr_type, n, 0) + 1);
2803 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2804 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
2807 /* An empty array whose type is that of ARR_TYPE (an array type),
2808 with bounds LOW to LOW-1. */
2810 static struct value *
2811 empty_array (struct type *arr_type, int low)
2813 struct type *arr_type0 = ada_check_typedef (arr_type);
2814 struct type *index_type =
2815 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)),
2817 struct type *elt_type = ada_array_element_type (arr_type0, 1);
2819 return allocate_value (create_array_type (NULL, elt_type, index_type));
2823 /* Name resolution */
2825 /* The "decoded" name for the user-definable Ada operator corresponding
2829 ada_decoded_op_name (enum exp_opcode op)
2833 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2835 if (ada_opname_table[i].op == op)
2836 return ada_opname_table[i].decoded;
2838 error (_("Could not find operator name for opcode"));
2842 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2843 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2844 undefined namespace) and converts operators that are
2845 user-defined into appropriate function calls. If CONTEXT_TYPE is
2846 non-null, it provides a preferred result type [at the moment, only
2847 type void has any effect---causing procedures to be preferred over
2848 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2849 return type is preferred. May change (expand) *EXP. */
2852 resolve (struct expression **expp, int void_context_p)
2854 struct type *context_type = NULL;
2858 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
2860 resolve_subexp (expp, &pc, 1, context_type);
2863 /* Resolve the operator of the subexpression beginning at
2864 position *POS of *EXPP. "Resolving" consists of replacing
2865 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2866 with their resolutions, replacing built-in operators with
2867 function calls to user-defined operators, where appropriate, and,
2868 when DEPROCEDURE_P is non-zero, converting function-valued variables
2869 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2870 are as in ada_resolve, above. */
2872 static struct value *
2873 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2874 struct type *context_type)
2878 struct expression *exp; /* Convenience: == *expp. */
2879 enum exp_opcode op = (*expp)->elts[pc].opcode;
2880 struct value **argvec; /* Vector of operand types (alloca'ed). */
2881 int nargs; /* Number of operands. */
2888 /* Pass one: resolve operands, saving their types and updating *pos,
2893 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2894 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2899 resolve_subexp (expp, pos, 0, NULL);
2901 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2906 resolve_subexp (expp, pos, 0, NULL);
2911 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
2914 case OP_ATR_MODULUS:
2924 case TERNOP_IN_RANGE:
2925 case BINOP_IN_BOUNDS:
2931 case OP_DISCRETE_RANGE:
2933 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2942 arg1 = resolve_subexp (expp, pos, 0, NULL);
2944 resolve_subexp (expp, pos, 1, NULL);
2946 resolve_subexp (expp, pos, 1, value_type (arg1));
2963 case BINOP_LOGICAL_AND:
2964 case BINOP_LOGICAL_OR:
2965 case BINOP_BITWISE_AND:
2966 case BINOP_BITWISE_IOR:
2967 case BINOP_BITWISE_XOR:
2970 case BINOP_NOTEQUAL:
2977 case BINOP_SUBSCRIPT:
2985 case UNOP_LOGICAL_NOT:
3001 case OP_INTERNALVAR:
3011 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3014 case STRUCTOP_STRUCT:
3015 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3028 error (_("Unexpected operator during name resolution"));
3031 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
3032 for (i = 0; i < nargs; i += 1)
3033 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3037 /* Pass two: perform any resolution on principal operator. */
3044 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3046 struct ada_symbol_info *candidates;
3050 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3051 (exp->elts[pc + 2].symbol),
3052 exp->elts[pc + 1].block, VAR_DOMAIN,
3055 if (n_candidates > 1)
3057 /* Types tend to get re-introduced locally, so if there
3058 are any local symbols that are not types, first filter
3061 for (j = 0; j < n_candidates; j += 1)
3062 switch (SYMBOL_CLASS (candidates[j].sym))
3067 case LOC_REGPARM_ADDR:
3075 if (j < n_candidates)
3078 while (j < n_candidates)
3080 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3082 candidates[j] = candidates[n_candidates - 1];
3091 if (n_candidates == 0)
3092 error (_("No definition found for %s"),
3093 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3094 else if (n_candidates == 1)
3096 else if (deprocedure_p
3097 && !is_nonfunction (candidates, n_candidates))
3099 i = ada_resolve_function
3100 (candidates, n_candidates, NULL, 0,
3101 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3104 error (_("Could not find a match for %s"),
3105 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3109 printf_filtered (_("Multiple matches for %s\n"),
3110 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3111 user_select_syms (candidates, n_candidates, 1);
3115 exp->elts[pc + 1].block = candidates[i].block;
3116 exp->elts[pc + 2].symbol = candidates[i].sym;
3117 if (innermost_block == NULL
3118 || contained_in (candidates[i].block, innermost_block))
3119 innermost_block = candidates[i].block;
3123 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3126 replace_operator_with_call (expp, pc, 0, 0,
3127 exp->elts[pc + 2].symbol,
3128 exp->elts[pc + 1].block);
3135 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3136 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3138 struct ada_symbol_info *candidates;
3142 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3143 (exp->elts[pc + 5].symbol),
3144 exp->elts[pc + 4].block, VAR_DOMAIN,
3146 if (n_candidates == 1)
3150 i = ada_resolve_function
3151 (candidates, n_candidates,
3153 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3156 error (_("Could not find a match for %s"),
3157 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3160 exp->elts[pc + 4].block = candidates[i].block;
3161 exp->elts[pc + 5].symbol = candidates[i].sym;
3162 if (innermost_block == NULL
3163 || contained_in (candidates[i].block, innermost_block))
3164 innermost_block = candidates[i].block;
3175 case BINOP_BITWISE_AND:
3176 case BINOP_BITWISE_IOR:
3177 case BINOP_BITWISE_XOR:
3179 case BINOP_NOTEQUAL:
3187 case UNOP_LOGICAL_NOT:
3189 if (possible_user_operator_p (op, argvec))
3191 struct ada_symbol_info *candidates;
3195 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3196 (struct block *) NULL, VAR_DOMAIN,
3198 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
3199 ada_decoded_op_name (op), NULL);
3203 replace_operator_with_call (expp, pc, nargs, 1,
3204 candidates[i].sym, candidates[i].block);
3215 return evaluate_subexp_type (exp, pos);
3218 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3219 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3221 /* The term "match" here is rather loose. The match is heuristic and
3225 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3227 ftype = ada_check_typedef (ftype);
3228 atype = ada_check_typedef (atype);
3230 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3231 ftype = TYPE_TARGET_TYPE (ftype);
3232 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3233 atype = TYPE_TARGET_TYPE (atype);
3235 switch (TYPE_CODE (ftype))
3238 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3240 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3241 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3242 TYPE_TARGET_TYPE (atype), 0);
3245 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3247 case TYPE_CODE_ENUM:
3248 case TYPE_CODE_RANGE:
3249 switch (TYPE_CODE (atype))
3252 case TYPE_CODE_ENUM:
3253 case TYPE_CODE_RANGE:
3259 case TYPE_CODE_ARRAY:
3260 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3261 || ada_is_array_descriptor_type (atype));
3263 case TYPE_CODE_STRUCT:
3264 if (ada_is_array_descriptor_type (ftype))
3265 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3266 || ada_is_array_descriptor_type (atype));
3268 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3269 && !ada_is_array_descriptor_type (atype));
3271 case TYPE_CODE_UNION:
3273 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3277 /* Return non-zero if the formals of FUNC "sufficiently match" the
3278 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3279 may also be an enumeral, in which case it is treated as a 0-
3280 argument function. */
3283 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3286 struct type *func_type = SYMBOL_TYPE (func);
3288 if (SYMBOL_CLASS (func) == LOC_CONST
3289 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3290 return (n_actuals == 0);
3291 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3294 if (TYPE_NFIELDS (func_type) != n_actuals)
3297 for (i = 0; i < n_actuals; i += 1)
3299 if (actuals[i] == NULL)
3303 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3305 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3307 if (!ada_type_match (ftype, atype, 1))
3314 /* False iff function type FUNC_TYPE definitely does not produce a value
3315 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3316 FUNC_TYPE is not a valid function type with a non-null return type
3317 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3320 return_match (struct type *func_type, struct type *context_type)
3322 struct type *return_type;
3324 if (func_type == NULL)
3327 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3328 return_type = base_type (TYPE_TARGET_TYPE (func_type));
3330 return_type = base_type (func_type);
3331 if (return_type == NULL)
3334 context_type = base_type (context_type);
3336 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3337 return context_type == NULL || return_type == context_type;
3338 else if (context_type == NULL)
3339 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3341 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3345 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3346 function (if any) that matches the types of the NARGS arguments in
3347 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3348 that returns that type, then eliminate matches that don't. If
3349 CONTEXT_TYPE is void and there is at least one match that does not
3350 return void, eliminate all matches that do.
3352 Asks the user if there is more than one match remaining. Returns -1
3353 if there is no such symbol or none is selected. NAME is used
3354 solely for messages. May re-arrange and modify SYMS in
3355 the process; the index returned is for the modified vector. */
3358 ada_resolve_function (struct ada_symbol_info syms[],
3359 int nsyms, struct value **args, int nargs,
3360 const char *name, struct type *context_type)
3364 int m; /* Number of hits */
3367 /* In the first pass of the loop, we only accept functions matching
3368 context_type. If none are found, we add a second pass of the loop
3369 where every function is accepted. */
3370 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3372 for (k = 0; k < nsyms; k += 1)
3374 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3376 if (ada_args_match (syms[k].sym, args, nargs)
3377 && (fallback || return_match (type, context_type)))
3389 printf_filtered (_("Multiple matches for %s\n"), name);
3390 user_select_syms (syms, m, 1);
3396 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3397 in a listing of choices during disambiguation (see sort_choices, below).
3398 The idea is that overloadings of a subprogram name from the
3399 same package should sort in their source order. We settle for ordering
3400 such symbols by their trailing number (__N or $N). */
3403 encoded_ordered_before (char *N0, char *N1)
3407 else if (N0 == NULL)
3413 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3415 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3417 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3418 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3423 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3426 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3428 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3429 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3431 return (strcmp (N0, N1) < 0);
3435 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3439 sort_choices (struct ada_symbol_info syms[], int nsyms)
3443 for (i = 1; i < nsyms; i += 1)
3445 struct ada_symbol_info sym = syms[i];
3448 for (j = i - 1; j >= 0; j -= 1)
3450 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3451 SYMBOL_LINKAGE_NAME (sym.sym)))
3453 syms[j + 1] = syms[j];
3459 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3460 by asking the user (if necessary), returning the number selected,
3461 and setting the first elements of SYMS items. Error if no symbols
3464 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3465 to be re-integrated one of these days. */
3468 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3471 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3473 int first_choice = (max_results == 1) ? 1 : 2;
3474 const char *select_mode = multiple_symbols_select_mode ();
3476 if (max_results < 1)
3477 error (_("Request to select 0 symbols!"));
3481 if (select_mode == multiple_symbols_cancel)
3483 canceled because the command is ambiguous\n\
3484 See set/show multiple-symbol."));
3486 /* If select_mode is "all", then return all possible symbols.
3487 Only do that if more than one symbol can be selected, of course.
3488 Otherwise, display the menu as usual. */
3489 if (select_mode == multiple_symbols_all && max_results > 1)
3492 printf_unfiltered (_("[0] cancel\n"));
3493 if (max_results > 1)
3494 printf_unfiltered (_("[1] all\n"));
3496 sort_choices (syms, nsyms);
3498 for (i = 0; i < nsyms; i += 1)
3500 if (syms[i].sym == NULL)
3503 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3505 struct symtab_and_line sal =
3506 find_function_start_sal (syms[i].sym, 1);
3508 if (sal.symtab == NULL)
3509 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3511 SYMBOL_PRINT_NAME (syms[i].sym),
3514 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3515 SYMBOL_PRINT_NAME (syms[i].sym),
3516 sal.symtab->filename, sal.line);
3522 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3523 && SYMBOL_TYPE (syms[i].sym) != NULL
3524 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3525 struct symtab *symtab = syms[i].sym->symtab;
3527 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3528 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3530 SYMBOL_PRINT_NAME (syms[i].sym),
3531 symtab->filename, SYMBOL_LINE (syms[i].sym));
3532 else if (is_enumeral
3533 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3535 printf_unfiltered (("[%d] "), i + first_choice);
3536 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3538 printf_unfiltered (_("'(%s) (enumeral)\n"),
3539 SYMBOL_PRINT_NAME (syms[i].sym));
3541 else if (symtab != NULL)
3542 printf_unfiltered (is_enumeral
3543 ? _("[%d] %s in %s (enumeral)\n")
3544 : _("[%d] %s at %s:?\n"),
3546 SYMBOL_PRINT_NAME (syms[i].sym),
3549 printf_unfiltered (is_enumeral
3550 ? _("[%d] %s (enumeral)\n")
3551 : _("[%d] %s at ?\n"),
3553 SYMBOL_PRINT_NAME (syms[i].sym));
3557 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3560 for (i = 0; i < n_chosen; i += 1)
3561 syms[i] = syms[chosen[i]];
3566 /* Read and validate a set of numeric choices from the user in the
3567 range 0 .. N_CHOICES-1. Place the results in increasing
3568 order in CHOICES[0 .. N-1], and return N.
3570 The user types choices as a sequence of numbers on one line
3571 separated by blanks, encoding them as follows:
3573 + A choice of 0 means to cancel the selection, throwing an error.
3574 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3575 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3577 The user is not allowed to choose more than MAX_RESULTS values.
3579 ANNOTATION_SUFFIX, if present, is used to annotate the input
3580 prompts (for use with the -f switch). */
3583 get_selections (int *choices, int n_choices, int max_results,
3584 int is_all_choice, char *annotation_suffix)
3589 int first_choice = is_all_choice ? 2 : 1;
3591 prompt = getenv ("PS2");
3595 args = command_line_input (prompt, 0, annotation_suffix);
3598 error_no_arg (_("one or more choice numbers"));
3602 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3603 order, as given in args. Choices are validated. */
3609 while (isspace (*args))
3611 if (*args == '\0' && n_chosen == 0)
3612 error_no_arg (_("one or more choice numbers"));
3613 else if (*args == '\0')
3616 choice = strtol (args, &args2, 10);
3617 if (args == args2 || choice < 0
3618 || choice > n_choices + first_choice - 1)
3619 error (_("Argument must be choice number"));
3623 error (_("cancelled"));
3625 if (choice < first_choice)
3627 n_chosen = n_choices;
3628 for (j = 0; j < n_choices; j += 1)
3632 choice -= first_choice;
3634 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3638 if (j < 0 || choice != choices[j])
3642 for (k = n_chosen - 1; k > j; k -= 1)
3643 choices[k + 1] = choices[k];
3644 choices[j + 1] = choice;
3649 if (n_chosen > max_results)
3650 error (_("Select no more than %d of the above"), max_results);
3655 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3656 on the function identified by SYM and BLOCK, and taking NARGS
3657 arguments. Update *EXPP as needed to hold more space. */
3660 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3661 int oplen, struct symbol *sym,
3662 struct block *block)
3664 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3665 symbol, -oplen for operator being replaced). */
3666 struct expression *newexp = (struct expression *)
3667 xzalloc (sizeof (struct expression)
3668 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3669 struct expression *exp = *expp;
3671 newexp->nelts = exp->nelts + 7 - oplen;
3672 newexp->language_defn = exp->language_defn;
3673 newexp->gdbarch = exp->gdbarch;
3674 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3675 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3676 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3678 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3679 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3681 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3682 newexp->elts[pc + 4].block = block;
3683 newexp->elts[pc + 5].symbol = sym;
3689 /* Type-class predicates */
3691 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3695 numeric_type_p (struct type *type)
3701 switch (TYPE_CODE (type))
3706 case TYPE_CODE_RANGE:
3707 return (type == TYPE_TARGET_TYPE (type)
3708 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3715 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3718 integer_type_p (struct type *type)
3724 switch (TYPE_CODE (type))
3728 case TYPE_CODE_RANGE:
3729 return (type == TYPE_TARGET_TYPE (type)
3730 || integer_type_p (TYPE_TARGET_TYPE (type)));
3737 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3740 scalar_type_p (struct type *type)
3746 switch (TYPE_CODE (type))
3749 case TYPE_CODE_RANGE:
3750 case TYPE_CODE_ENUM:
3759 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3762 discrete_type_p (struct type *type)
3768 switch (TYPE_CODE (type))
3771 case TYPE_CODE_RANGE:
3772 case TYPE_CODE_ENUM:
3773 case TYPE_CODE_BOOL:
3781 /* Returns non-zero if OP with operands in the vector ARGS could be
3782 a user-defined function. Errs on the side of pre-defined operators
3783 (i.e., result 0). */
3786 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3788 struct type *type0 =
3789 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3790 struct type *type1 =
3791 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3805 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3809 case BINOP_BITWISE_AND:
3810 case BINOP_BITWISE_IOR:
3811 case BINOP_BITWISE_XOR:
3812 return (!(integer_type_p (type0) && integer_type_p (type1)));
3815 case BINOP_NOTEQUAL:
3820 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3823 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3826 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3830 case UNOP_LOGICAL_NOT:
3832 return (!numeric_type_p (type0));
3841 1. In the following, we assume that a renaming type's name may
3842 have an ___XD suffix. It would be nice if this went away at some
3844 2. We handle both the (old) purely type-based representation of
3845 renamings and the (new) variable-based encoding. At some point,
3846 it is devoutly to be hoped that the former goes away
3847 (FIXME: hilfinger-2007-07-09).
3848 3. Subprogram renamings are not implemented, although the XRS
3849 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3851 /* If SYM encodes a renaming,
3853 <renaming> renames <renamed entity>,
3855 sets *LEN to the length of the renamed entity's name,
3856 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3857 the string describing the subcomponent selected from the renamed
3858 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3859 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3860 are undefined). Otherwise, returns a value indicating the category
3861 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3862 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3863 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3864 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3865 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3866 may be NULL, in which case they are not assigned.
3868 [Currently, however, GCC does not generate subprogram renamings.] */
3870 enum ada_renaming_category
3871 ada_parse_renaming (struct symbol *sym,
3872 const char **renamed_entity, int *len,
3873 const char **renaming_expr)
3875 enum ada_renaming_category kind;
3880 return ADA_NOT_RENAMING;
3881 switch (SYMBOL_CLASS (sym))
3884 return ADA_NOT_RENAMING;
3886 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3887 renamed_entity, len, renaming_expr);
3891 case LOC_OPTIMIZED_OUT:
3892 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3894 return ADA_NOT_RENAMING;
3898 kind = ADA_OBJECT_RENAMING;
3902 kind = ADA_EXCEPTION_RENAMING;
3906 kind = ADA_PACKAGE_RENAMING;
3910 kind = ADA_SUBPROGRAM_RENAMING;
3914 return ADA_NOT_RENAMING;
3918 if (renamed_entity != NULL)
3919 *renamed_entity = info;
3920 suffix = strstr (info, "___XE");
3921 if (suffix == NULL || suffix == info)
3922 return ADA_NOT_RENAMING;
3924 *len = strlen (info) - strlen (suffix);
3926 if (renaming_expr != NULL)
3927 *renaming_expr = suffix;
3931 /* Assuming TYPE encodes a renaming according to the old encoding in
3932 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3933 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3934 ADA_NOT_RENAMING otherwise. */
3935 static enum ada_renaming_category
3936 parse_old_style_renaming (struct type *type,
3937 const char **renamed_entity, int *len,
3938 const char **renaming_expr)
3940 enum ada_renaming_category kind;
3945 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3946 || TYPE_NFIELDS (type) != 1)
3947 return ADA_NOT_RENAMING;
3949 name = type_name_no_tag (type);
3951 return ADA_NOT_RENAMING;
3953 name = strstr (name, "___XR");
3955 return ADA_NOT_RENAMING;
3960 kind = ADA_OBJECT_RENAMING;
3963 kind = ADA_EXCEPTION_RENAMING;
3966 kind = ADA_PACKAGE_RENAMING;
3969 kind = ADA_SUBPROGRAM_RENAMING;
3972 return ADA_NOT_RENAMING;
3975 info = TYPE_FIELD_NAME (type, 0);
3977 return ADA_NOT_RENAMING;
3978 if (renamed_entity != NULL)
3979 *renamed_entity = info;
3980 suffix = strstr (info, "___XE");
3981 if (renaming_expr != NULL)
3982 *renaming_expr = suffix + 5;
3983 if (suffix == NULL || suffix == info)
3984 return ADA_NOT_RENAMING;
3986 *len = suffix - info;
3992 /* Evaluation: Function Calls */
3994 /* Return an lvalue containing the value VAL. This is the identity on
3995 lvalues, and otherwise has the side-effect of allocating memory
3996 in the inferior where a copy of the value contents is copied. */
3998 static struct value *
3999 ensure_lval (struct value *val)
4001 if (VALUE_LVAL (val) == not_lval
4002 || VALUE_LVAL (val) == lval_internalvar)
4004 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4005 const CORE_ADDR addr =
4006 value_as_long (value_allocate_space_in_inferior (len));
4008 set_value_address (val, addr);
4009 VALUE_LVAL (val) = lval_memory;
4010 write_memory (addr, value_contents (val), len);
4016 /* Return the value ACTUAL, converted to be an appropriate value for a
4017 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4018 allocating any necessary descriptors (fat pointers), or copies of
4019 values not residing in memory, updating it as needed. */
4022 ada_convert_actual (struct value *actual, struct type *formal_type0)
4024 struct type *actual_type = ada_check_typedef (value_type (actual));
4025 struct type *formal_type = ada_check_typedef (formal_type0);
4026 struct type *formal_target =
4027 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4028 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4029 struct type *actual_target =
4030 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4031 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4033 if (ada_is_array_descriptor_type (formal_target)
4034 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4035 return make_array_descriptor (formal_type, actual);
4036 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4037 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4039 struct value *result;
4041 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4042 && ada_is_array_descriptor_type (actual_target))
4043 result = desc_data (actual);
4044 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4046 if (VALUE_LVAL (actual) != lval_memory)
4050 actual_type = ada_check_typedef (value_type (actual));
4051 val = allocate_value (actual_type);
4052 memcpy ((char *) value_contents_raw (val),
4053 (char *) value_contents (actual),
4054 TYPE_LENGTH (actual_type));
4055 actual = ensure_lval (val);
4057 result = value_addr (actual);
4061 return value_cast_pointers (formal_type, result);
4063 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4064 return ada_value_ind (actual);
4069 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4070 type TYPE. This is usually an inefficient no-op except on some targets
4071 (such as AVR) where the representation of a pointer and an address
4075 value_pointer (struct value *value, struct type *type)
4077 struct gdbarch *gdbarch = get_type_arch (type);
4078 unsigned len = TYPE_LENGTH (type);
4079 gdb_byte *buf = alloca (len);
4082 addr = value_address (value);
4083 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4084 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4089 /* Push a descriptor of type TYPE for array value ARR on the stack at
4090 *SP, updating *SP to reflect the new descriptor. Return either
4091 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4092 to-descriptor type rather than a descriptor type), a struct value *
4093 representing a pointer to this descriptor. */
4095 static struct value *
4096 make_array_descriptor (struct type *type, struct value *arr)
4098 struct type *bounds_type = desc_bounds_type (type);
4099 struct type *desc_type = desc_base_type (type);
4100 struct value *descriptor = allocate_value (desc_type);
4101 struct value *bounds = allocate_value (bounds_type);
4104 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4107 modify_field (value_type (bounds), value_contents_writeable (bounds),
4108 ada_array_bound (arr, i, 0),
4109 desc_bound_bitpos (bounds_type, i, 0),
4110 desc_bound_bitsize (bounds_type, i, 0));
4111 modify_field (value_type (bounds), value_contents_writeable (bounds),
4112 ada_array_bound (arr, i, 1),
4113 desc_bound_bitpos (bounds_type, i, 1),
4114 desc_bound_bitsize (bounds_type, i, 1));
4117 bounds = ensure_lval (bounds);
4119 modify_field (value_type (descriptor),
4120 value_contents_writeable (descriptor),
4121 value_pointer (ensure_lval (arr),
4122 TYPE_FIELD_TYPE (desc_type, 0)),
4123 fat_pntr_data_bitpos (desc_type),
4124 fat_pntr_data_bitsize (desc_type));
4126 modify_field (value_type (descriptor),
4127 value_contents_writeable (descriptor),
4128 value_pointer (bounds,
4129 TYPE_FIELD_TYPE (desc_type, 1)),
4130 fat_pntr_bounds_bitpos (desc_type),
4131 fat_pntr_bounds_bitsize (desc_type));
4133 descriptor = ensure_lval (descriptor);
4135 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4136 return value_addr (descriptor);
4141 /* Dummy definitions for an experimental caching module that is not
4142 * used in the public sources. */
4145 lookup_cached_symbol (const char *name, domain_enum namespace,
4146 struct symbol **sym, struct block **block)
4152 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
4153 struct block *block)
4159 /* Return the result of a standard (literal, C-like) lookup of NAME in
4160 given DOMAIN, visible from lexical block BLOCK. */
4162 static struct symbol *
4163 standard_lookup (const char *name, const struct block *block,
4168 if (lookup_cached_symbol (name, domain, &sym, NULL))
4170 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4171 cache_symbol (name, domain, sym, block_found);
4176 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4177 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4178 since they contend in overloading in the same way. */
4180 is_nonfunction (struct ada_symbol_info syms[], int n)
4184 for (i = 0; i < n; i += 1)
4185 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4186 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4187 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
4193 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4194 struct types. Otherwise, they may not. */
4197 equiv_types (struct type *type0, struct type *type1)
4201 if (type0 == NULL || type1 == NULL
4202 || TYPE_CODE (type0) != TYPE_CODE (type1))
4204 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4205 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4206 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4207 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4213 /* True iff SYM0 represents the same entity as SYM1, or one that is
4214 no more defined than that of SYM1. */
4217 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4221 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4222 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4225 switch (SYMBOL_CLASS (sym0))
4231 struct type *type0 = SYMBOL_TYPE (sym0);
4232 struct type *type1 = SYMBOL_TYPE (sym1);
4233 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4234 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4235 int len0 = strlen (name0);
4238 TYPE_CODE (type0) == TYPE_CODE (type1)
4239 && (equiv_types (type0, type1)
4240 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4241 && strncmp (name1 + len0, "___XV", 5) == 0));
4244 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4245 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4251 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4252 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4255 add_defn_to_vec (struct obstack *obstackp,
4257 struct block *block)
4260 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4262 /* Do not try to complete stub types, as the debugger is probably
4263 already scanning all symbols matching a certain name at the
4264 time when this function is called. Trying to replace the stub
4265 type by its associated full type will cause us to restart a scan
4266 which may lead to an infinite recursion. Instead, the client
4267 collecting the matching symbols will end up collecting several
4268 matches, with at least one of them complete. It can then filter
4269 out the stub ones if needed. */
4271 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4273 if (lesseq_defined_than (sym, prevDefns[i].sym))
4275 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4277 prevDefns[i].sym = sym;
4278 prevDefns[i].block = block;
4284 struct ada_symbol_info info;
4288 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4292 /* Number of ada_symbol_info structures currently collected in
4293 current vector in *OBSTACKP. */
4296 num_defns_collected (struct obstack *obstackp)
4298 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4301 /* Vector of ada_symbol_info structures currently collected in current
4302 vector in *OBSTACKP. If FINISH, close off the vector and return
4303 its final address. */
4305 static struct ada_symbol_info *
4306 defns_collected (struct obstack *obstackp, int finish)
4309 return obstack_finish (obstackp);
4311 return (struct ada_symbol_info *) obstack_base (obstackp);
4314 /* Return a minimal symbol matching NAME according to Ada decoding
4315 rules. Returns NULL if there is no such minimal symbol. Names
4316 prefixed with "standard__" are handled specially: "standard__" is
4317 first stripped off, and only static and global symbols are searched. */
4319 struct minimal_symbol *
4320 ada_lookup_simple_minsym (const char *name)
4322 struct objfile *objfile;
4323 struct minimal_symbol *msymbol;
4326 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4328 name += sizeof ("standard__") - 1;
4332 wild_match = (strstr (name, "__") == NULL);
4334 ALL_MSYMBOLS (objfile, msymbol)
4336 if (match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4337 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4344 /* For all subprograms that statically enclose the subprogram of the
4345 selected frame, add symbols matching identifier NAME in DOMAIN
4346 and their blocks to the list of data in OBSTACKP, as for
4347 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4351 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4352 const char *name, domain_enum namespace,
4357 /* True if TYPE is definitely an artificial type supplied to a symbol
4358 for which no debugging information was given in the symbol file. */
4361 is_nondebugging_type (struct type *type)
4363 char *name = ada_type_name (type);
4365 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4368 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4369 that are deemed "identical" for practical purposes.
4371 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4372 types and that their number of enumerals is identical (in other
4373 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4376 ada_identical_enum_types_p (struct type *type1, struct type *type2)
4380 /* The heuristic we use here is fairly conservative. We consider
4381 that 2 enumerate types are identical if they have the same
4382 number of enumerals and that all enumerals have the same
4383 underlying value and name. */
4385 /* All enums in the type should have an identical underlying value. */
4386 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4387 if (TYPE_FIELD_BITPOS (type1, i) != TYPE_FIELD_BITPOS (type2, i))
4390 /* All enumerals should also have the same name (modulo any numerical
4392 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4394 char *name_1 = TYPE_FIELD_NAME (type1, i);
4395 char *name_2 = TYPE_FIELD_NAME (type2, i);
4396 int len_1 = strlen (name_1);
4397 int len_2 = strlen (name_2);
4399 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
4400 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
4402 || strncmp (TYPE_FIELD_NAME (type1, i),
4403 TYPE_FIELD_NAME (type2, i),
4411 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4412 that are deemed "identical" for practical purposes. Sometimes,
4413 enumerals are not strictly identical, but their types are so similar
4414 that they can be considered identical.
4416 For instance, consider the following code:
4418 type Color is (Black, Red, Green, Blue, White);
4419 type RGB_Color is new Color range Red .. Blue;
4421 Type RGB_Color is a subrange of an implicit type which is a copy
4422 of type Color. If we call that implicit type RGB_ColorB ("B" is
4423 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4424 As a result, when an expression references any of the enumeral
4425 by name (Eg. "print green"), the expression is technically
4426 ambiguous and the user should be asked to disambiguate. But
4427 doing so would only hinder the user, since it wouldn't matter
4428 what choice he makes, the outcome would always be the same.
4429 So, for practical purposes, we consider them as the same. */
4432 symbols_are_identical_enums (struct ada_symbol_info *syms, int nsyms)
4436 /* Before performing a thorough comparison check of each type,
4437 we perform a series of inexpensive checks. We expect that these
4438 checks will quickly fail in the vast majority of cases, and thus
4439 help prevent the unnecessary use of a more expensive comparison.
4440 Said comparison also expects us to make some of these checks
4441 (see ada_identical_enum_types_p). */
4443 /* Quick check: All symbols should have an enum type. */
4444 for (i = 0; i < nsyms; i++)
4445 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM)
4448 /* Quick check: They should all have the same value. */
4449 for (i = 1; i < nsyms; i++)
4450 if (SYMBOL_VALUE (syms[i].sym) != SYMBOL_VALUE (syms[0].sym))
4453 /* Quick check: They should all have the same number of enumerals. */
4454 for (i = 1; i < nsyms; i++)
4455 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].sym))
4456 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].sym)))
4459 /* All the sanity checks passed, so we might have a set of
4460 identical enumeration types. Perform a more complete
4461 comparison of the type of each symbol. */
4462 for (i = 1; i < nsyms; i++)
4463 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].sym),
4464 SYMBOL_TYPE (syms[0].sym)))
4470 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4471 duplicate other symbols in the list (The only case I know of where
4472 this happens is when object files containing stabs-in-ecoff are
4473 linked with files containing ordinary ecoff debugging symbols (or no
4474 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4475 Returns the number of items in the modified list. */
4478 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4482 /* We should never be called with less than 2 symbols, as there
4483 cannot be any extra symbol in that case. But it's easy to
4484 handle, since we have nothing to do in that case. */
4493 /* If two symbols have the same name and one of them is a stub type,
4494 the get rid of the stub. */
4496 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4497 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4499 for (j = 0; j < nsyms; j++)
4502 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4503 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4504 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4505 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4510 /* Two symbols with the same name, same class and same address
4511 should be identical. */
4513 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4514 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4515 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4517 for (j = 0; j < nsyms; j += 1)
4520 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4521 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4522 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4523 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4524 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4525 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4532 for (j = i + 1; j < nsyms; j += 1)
4533 syms[j - 1] = syms[j];
4540 /* If all the remaining symbols are identical enumerals, then
4541 just keep the first one and discard the rest.
4543 Unlike what we did previously, we do not discard any entry
4544 unless they are ALL identical. This is because the symbol
4545 comparison is not a strict comparison, but rather a practical
4546 comparison. If all symbols are considered identical, then
4547 we can just go ahead and use the first one and discard the rest.
4548 But if we cannot reduce the list to a single element, we have
4549 to ask the user to disambiguate anyways. And if we have to
4550 present a multiple-choice menu, it's less confusing if the list
4551 isn't missing some choices that were identical and yet distinct. */
4552 if (symbols_are_identical_enums (syms, nsyms))
4558 /* Given a type that corresponds to a renaming entity, use the type name
4559 to extract the scope (package name or function name, fully qualified,
4560 and following the GNAT encoding convention) where this renaming has been
4561 defined. The string returned needs to be deallocated after use. */
4564 xget_renaming_scope (struct type *renaming_type)
4566 /* The renaming types adhere to the following convention:
4567 <scope>__<rename>___<XR extension>.
4568 So, to extract the scope, we search for the "___XR" extension,
4569 and then backtrack until we find the first "__". */
4571 const char *name = type_name_no_tag (renaming_type);
4572 char *suffix = strstr (name, "___XR");
4577 /* Now, backtrack a bit until we find the first "__". Start looking
4578 at suffix - 3, as the <rename> part is at least one character long. */
4580 for (last = suffix - 3; last > name; last--)
4581 if (last[0] == '_' && last[1] == '_')
4584 /* Make a copy of scope and return it. */
4586 scope_len = last - name;
4587 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4589 strncpy (scope, name, scope_len);
4590 scope[scope_len] = '\0';
4595 /* Return nonzero if NAME corresponds to a package name. */
4598 is_package_name (const char *name)
4600 /* Here, We take advantage of the fact that no symbols are generated
4601 for packages, while symbols are generated for each function.
4602 So the condition for NAME represent a package becomes equivalent
4603 to NAME not existing in our list of symbols. There is only one
4604 small complication with library-level functions (see below). */
4608 /* If it is a function that has not been defined at library level,
4609 then we should be able to look it up in the symbols. */
4610 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4613 /* Library-level function names start with "_ada_". See if function
4614 "_ada_" followed by NAME can be found. */
4616 /* Do a quick check that NAME does not contain "__", since library-level
4617 functions names cannot contain "__" in them. */
4618 if (strstr (name, "__") != NULL)
4621 fun_name = xstrprintf ("_ada_%s", name);
4623 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4626 /* Return nonzero if SYM corresponds to a renaming entity that is
4627 not visible from FUNCTION_NAME. */
4630 old_renaming_is_invisible (const struct symbol *sym, char *function_name)
4634 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4637 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4639 make_cleanup (xfree, scope);
4641 /* If the rename has been defined in a package, then it is visible. */
4642 if (is_package_name (scope))
4645 /* Check that the rename is in the current function scope by checking
4646 that its name starts with SCOPE. */
4648 /* If the function name starts with "_ada_", it means that it is
4649 a library-level function. Strip this prefix before doing the
4650 comparison, as the encoding for the renaming does not contain
4652 if (strncmp (function_name, "_ada_", 5) == 0)
4655 return (strncmp (function_name, scope, strlen (scope)) != 0);
4658 /* Remove entries from SYMS that corresponds to a renaming entity that
4659 is not visible from the function associated with CURRENT_BLOCK or
4660 that is superfluous due to the presence of more specific renaming
4661 information. Places surviving symbols in the initial entries of
4662 SYMS and returns the number of surviving symbols.
4665 First, in cases where an object renaming is implemented as a
4666 reference variable, GNAT may produce both the actual reference
4667 variable and the renaming encoding. In this case, we discard the
4670 Second, GNAT emits a type following a specified encoding for each renaming
4671 entity. Unfortunately, STABS currently does not support the definition
4672 of types that are local to a given lexical block, so all renamings types
4673 are emitted at library level. As a consequence, if an application
4674 contains two renaming entities using the same name, and a user tries to
4675 print the value of one of these entities, the result of the ada symbol
4676 lookup will also contain the wrong renaming type.
4678 This function partially covers for this limitation by attempting to
4679 remove from the SYMS list renaming symbols that should be visible
4680 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4681 method with the current information available. The implementation
4682 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4684 - When the user tries to print a rename in a function while there
4685 is another rename entity defined in a package: Normally, the
4686 rename in the function has precedence over the rename in the
4687 package, so the latter should be removed from the list. This is
4688 currently not the case.
4690 - This function will incorrectly remove valid renames if
4691 the CURRENT_BLOCK corresponds to a function which symbol name
4692 has been changed by an "Export" pragma. As a consequence,
4693 the user will be unable to print such rename entities. */
4696 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4697 int nsyms, const struct block *current_block)
4699 struct symbol *current_function;
4700 char *current_function_name;
4702 int is_new_style_renaming;
4704 /* If there is both a renaming foo___XR... encoded as a variable and
4705 a simple variable foo in the same block, discard the latter.
4706 First, zero out such symbols, then compress. */
4707 is_new_style_renaming = 0;
4708 for (i = 0; i < nsyms; i += 1)
4710 struct symbol *sym = syms[i].sym;
4711 struct block *block = syms[i].block;
4715 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4717 name = SYMBOL_LINKAGE_NAME (sym);
4718 suffix = strstr (name, "___XR");
4722 int name_len = suffix - name;
4725 is_new_style_renaming = 1;
4726 for (j = 0; j < nsyms; j += 1)
4727 if (i != j && syms[j].sym != NULL
4728 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4730 && block == syms[j].block)
4734 if (is_new_style_renaming)
4738 for (j = k = 0; j < nsyms; j += 1)
4739 if (syms[j].sym != NULL)
4747 /* Extract the function name associated to CURRENT_BLOCK.
4748 Abort if unable to do so. */
4750 if (current_block == NULL)
4753 current_function = block_linkage_function (current_block);
4754 if (current_function == NULL)
4757 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4758 if (current_function_name == NULL)
4761 /* Check each of the symbols, and remove it from the list if it is
4762 a type corresponding to a renaming that is out of the scope of
4763 the current block. */
4768 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4769 == ADA_OBJECT_RENAMING
4770 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4774 for (j = i + 1; j < nsyms; j += 1)
4775 syms[j - 1] = syms[j];
4785 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4786 whose name and domain match NAME and DOMAIN respectively.
4787 If no match was found, then extend the search to "enclosing"
4788 routines (in other words, if we're inside a nested function,
4789 search the symbols defined inside the enclosing functions).
4791 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4794 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4795 struct block *block, domain_enum domain,
4798 int block_depth = 0;
4800 while (block != NULL)
4803 ada_add_block_symbols (obstackp, block, name, domain, NULL, wild_match);
4805 /* If we found a non-function match, assume that's the one. */
4806 if (is_nonfunction (defns_collected (obstackp, 0),
4807 num_defns_collected (obstackp)))
4810 block = BLOCK_SUPERBLOCK (block);
4813 /* If no luck so far, try to find NAME as a local symbol in some lexically
4814 enclosing subprogram. */
4815 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4816 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match);
4819 /* An object of this type is used as the user_data argument when
4820 calling the map_matching_symbols method. */
4824 struct objfile *objfile;
4825 struct obstack *obstackp;
4826 struct symbol *arg_sym;
4830 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4831 to a list of symbols. DATA0 is a pointer to a struct match_data *
4832 containing the obstack that collects the symbol list, the file that SYM
4833 must come from, a flag indicating whether a non-argument symbol has
4834 been found in the current block, and the last argument symbol
4835 passed in SYM within the current block (if any). When SYM is null,
4836 marking the end of a block, the argument symbol is added if no
4837 other has been found. */
4840 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
4842 struct match_data *data = (struct match_data *) data0;
4846 if (!data->found_sym && data->arg_sym != NULL)
4847 add_defn_to_vec (data->obstackp,
4848 fixup_symbol_section (data->arg_sym, data->objfile),
4850 data->found_sym = 0;
4851 data->arg_sym = NULL;
4855 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4857 else if (SYMBOL_IS_ARGUMENT (sym))
4858 data->arg_sym = sym;
4861 data->found_sym = 1;
4862 add_defn_to_vec (data->obstackp,
4863 fixup_symbol_section (sym, data->objfile),
4870 /* Compare STRING1 to STRING2, with results as for strcmp.
4871 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4872 implies compare_names (STRING1, STRING2) (they may differ as to
4873 what symbols compare equal). */
4876 compare_names (const char *string1, const char *string2)
4878 while (*string1 != '\0' && *string2 != '\0')
4880 if (isspace (*string1) || isspace (*string2))
4881 return strcmp_iw_ordered (string1, string2);
4882 if (*string1 != *string2)
4890 return strcmp_iw_ordered (string1, string2);
4892 if (*string2 == '\0')
4894 if (is_name_suffix (string1))
4901 if (*string2 == '(')
4902 return strcmp_iw_ordered (string1, string2);
4904 return *string1 - *string2;
4908 /* Add to OBSTACKP all non-local symbols whose name and domain match
4909 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4910 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4913 add_nonlocal_symbols (struct obstack *obstackp, const char *name,
4914 domain_enum domain, int global,
4917 struct objfile *objfile;
4918 struct match_data data;
4920 data.obstackp = obstackp;
4921 data.arg_sym = NULL;
4923 ALL_OBJFILES (objfile)
4925 data.objfile = objfile;
4928 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4929 aux_add_nonlocal_symbols, &data,
4932 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4933 aux_add_nonlocal_symbols, &data,
4934 full_match, compare_names);
4937 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
4939 ALL_OBJFILES (objfile)
4941 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
4942 strcpy (name1, "_ada_");
4943 strcpy (name1 + sizeof ("_ada_") - 1, name);
4944 data.objfile = objfile;
4945 objfile->sf->qf->map_matching_symbols (name1, domain,
4947 aux_add_nonlocal_symbols,
4949 full_match, compare_names);
4954 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4955 scope and in global scopes, returning the number of matches. Sets
4956 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4957 indicating the symbols found and the blocks and symbol tables (if
4958 any) in which they were found. This vector are transient---good only to
4959 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4960 symbol match within the nest of blocks whose innermost member is BLOCK0,
4961 is the one match returned (no other matches in that or
4962 enclosing blocks is returned). If there are any matches in or
4963 surrounding BLOCK0, then these alone are returned. Otherwise, the
4964 search extends to global and file-scope (static) symbol tables.
4965 Names prefixed with "standard__" are handled specially: "standard__"
4966 is first stripped off, and only static and global symbols are searched. */
4969 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4970 domain_enum namespace,
4971 struct ada_symbol_info **results)
4974 struct block *block;
4980 obstack_free (&symbol_list_obstack, NULL);
4981 obstack_init (&symbol_list_obstack);
4985 /* Search specified block and its superiors. */
4987 wild_match = (strstr (name0, "__") == NULL);
4989 block = (struct block *) block0; /* FIXME: No cast ought to be
4990 needed, but adding const will
4991 have a cascade effect. */
4993 /* Special case: If the user specifies a symbol name inside package
4994 Standard, do a non-wild matching of the symbol name without
4995 the "standard__" prefix. This was primarily introduced in order
4996 to allow the user to specifically access the standard exceptions
4997 using, for instance, Standard.Constraint_Error when Constraint_Error
4998 is ambiguous (due to the user defining its own Constraint_Error
4999 entity inside its program). */
5000 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
5004 name = name0 + sizeof ("standard__") - 1;
5007 /* Check the non-global symbols. If we have ANY match, then we're done. */
5009 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
5011 if (num_defns_collected (&symbol_list_obstack) > 0)
5014 /* No non-global symbols found. Check our cache to see if we have
5015 already performed this search before. If we have, then return
5019 if (lookup_cached_symbol (name0, namespace, &sym, &block))
5022 add_defn_to_vec (&symbol_list_obstack, sym, block);
5026 /* Search symbols from all global blocks. */
5028 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
5031 /* Now add symbols from all per-file blocks if we've gotten no hits
5032 (not strictly correct, but perhaps better than an error). */
5034 if (num_defns_collected (&symbol_list_obstack) == 0)
5035 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
5039 ndefns = num_defns_collected (&symbol_list_obstack);
5040 *results = defns_collected (&symbol_list_obstack, 1);
5042 ndefns = remove_extra_symbols (*results, ndefns);
5045 cache_symbol (name0, namespace, NULL, NULL);
5047 if (ndefns == 1 && cacheIfUnique)
5048 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
5050 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
5056 ada_lookup_encoded_symbol (const char *name, const struct block *block0,
5057 domain_enum namespace, struct block **block_found)
5059 struct ada_symbol_info *candidates;
5062 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
5064 if (n_candidates == 0)
5067 if (block_found != NULL)
5068 *block_found = candidates[0].block;
5070 return fixup_symbol_section (candidates[0].sym, NULL);
5073 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5074 scope and in global scopes, or NULL if none. NAME is folded and
5075 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5076 choosing the first symbol if there are multiple choices.
5077 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
5078 table in which the symbol was found (in both cases, these
5079 assignments occur only if the pointers are non-null). */
5081 ada_lookup_symbol (const char *name, const struct block *block0,
5082 domain_enum namespace, int *is_a_field_of_this)
5084 if (is_a_field_of_this != NULL)
5085 *is_a_field_of_this = 0;
5088 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
5089 block0, namespace, NULL);
5092 static struct symbol *
5093 ada_lookup_symbol_nonlocal (const char *name,
5094 const struct block *block,
5095 const domain_enum domain)
5097 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5101 /* True iff STR is a possible encoded suffix of a normal Ada name
5102 that is to be ignored for matching purposes. Suffixes of parallel
5103 names (e.g., XVE) are not included here. Currently, the possible suffixes
5104 are given by any of the regular expressions:
5106 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5107 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5108 _E[0-9]+[bs]$ [protected object entry suffixes]
5109 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5111 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5112 match is performed. This sequence is used to differentiate homonyms,
5113 is an optional part of a valid name suffix. */
5116 is_name_suffix (const char *str)
5119 const char *matching;
5120 const int len = strlen (str);
5122 /* Skip optional leading __[0-9]+. */
5124 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5127 while (isdigit (str[0]))
5133 if (str[0] == '.' || str[0] == '$')
5136 while (isdigit (matching[0]))
5138 if (matching[0] == '\0')
5144 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5147 while (isdigit (matching[0]))
5149 if (matching[0] == '\0')
5154 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5155 with a N at the end. Unfortunately, the compiler uses the same
5156 convention for other internal types it creates. So treating
5157 all entity names that end with an "N" as a name suffix causes
5158 some regressions. For instance, consider the case of an enumerated
5159 type. To support the 'Image attribute, it creates an array whose
5161 Having a single character like this as a suffix carrying some
5162 information is a bit risky. Perhaps we should change the encoding
5163 to be something like "_N" instead. In the meantime, do not do
5164 the following check. */
5165 /* Protected Object Subprograms */
5166 if (len == 1 && str [0] == 'N')
5171 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
5174 while (isdigit (matching[0]))
5176 if ((matching[0] == 'b' || matching[0] == 's')
5177 && matching [1] == '\0')
5181 /* ??? We should not modify STR directly, as we are doing below. This
5182 is fine in this case, but may become problematic later if we find
5183 that this alternative did not work, and want to try matching
5184 another one from the begining of STR. Since we modified it, we
5185 won't be able to find the begining of the string anymore! */
5189 while (str[0] != '_' && str[0] != '\0')
5191 if (str[0] != 'n' && str[0] != 'b')
5197 if (str[0] == '\000')
5202 if (str[1] != '_' || str[2] == '\000')
5206 if (strcmp (str + 3, "JM") == 0)
5208 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5209 the LJM suffix in favor of the JM one. But we will
5210 still accept LJM as a valid suffix for a reasonable
5211 amount of time, just to allow ourselves to debug programs
5212 compiled using an older version of GNAT. */
5213 if (strcmp (str + 3, "LJM") == 0)
5217 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5218 || str[4] == 'U' || str[4] == 'P')
5220 if (str[4] == 'R' && str[5] != 'T')
5224 if (!isdigit (str[2]))
5226 for (k = 3; str[k] != '\0'; k += 1)
5227 if (!isdigit (str[k]) && str[k] != '_')
5231 if (str[0] == '$' && isdigit (str[1]))
5233 for (k = 2; str[k] != '\0'; k += 1)
5234 if (!isdigit (str[k]) && str[k] != '_')
5241 /* Return non-zero if the string starting at NAME and ending before
5242 NAME_END contains no capital letters. */
5245 is_valid_name_for_wild_match (const char *name0)
5247 const char *decoded_name = ada_decode (name0);
5250 /* If the decoded name starts with an angle bracket, it means that
5251 NAME0 does not follow the GNAT encoding format. It should then
5252 not be allowed as a possible wild match. */
5253 if (decoded_name[0] == '<')
5256 for (i=0; decoded_name[i] != '\0'; i++)
5257 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5263 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5264 that could start a simple name. Assumes that *NAMEP points into
5265 the string beginning at NAME0. */
5268 advance_wild_match (const char **namep, const char *name0, int target0)
5270 const char *name = *namep;
5280 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5283 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5288 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5289 || name[2] == target0))
5297 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5307 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5308 informational suffixes of NAME (i.e., for which is_name_suffix is
5309 true). Assumes that PATN is a lower-cased Ada simple name. */
5312 wild_match (const char *name, const char *patn)
5315 const char *name0 = name;
5319 const char *match = name;
5323 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5326 if (*p == '\0' && is_name_suffix (name))
5327 return match != name0 && !is_valid_name_for_wild_match (name0);
5329 if (name[-1] == '_')
5332 if (!advance_wild_match (&name, name0, *patn))
5337 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5338 informational suffix. */
5341 full_match (const char *sym_name, const char *search_name)
5343 return !match_name (sym_name, search_name, 0);
5347 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5348 vector *defn_symbols, updating the list of symbols in OBSTACKP
5349 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5350 OBJFILE is the section containing BLOCK.
5351 SYMTAB is recorded with each symbol added. */
5354 ada_add_block_symbols (struct obstack *obstackp,
5355 struct block *block, const char *name,
5356 domain_enum domain, struct objfile *objfile,
5359 struct dict_iterator iter;
5360 int name_len = strlen (name);
5361 /* A matching argument symbol, if any. */
5362 struct symbol *arg_sym;
5363 /* Set true when we find a matching non-argument symbol. */
5371 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5373 sym != NULL; sym = dict_iter_match_next (name, wild_match, &iter))
5375 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5376 SYMBOL_DOMAIN (sym), domain)
5377 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
5379 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5381 else if (SYMBOL_IS_ARGUMENT (sym))
5386 add_defn_to_vec (obstackp,
5387 fixup_symbol_section (sym, objfile),
5395 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5397 sym != NULL; sym = dict_iter_match_next (name, full_match, &iter))
5399 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5400 SYMBOL_DOMAIN (sym), domain))
5402 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5404 if (SYMBOL_IS_ARGUMENT (sym))
5409 add_defn_to_vec (obstackp,
5410 fixup_symbol_section (sym, objfile),
5418 if (!found_sym && arg_sym != NULL)
5420 add_defn_to_vec (obstackp,
5421 fixup_symbol_section (arg_sym, objfile),
5430 ALL_BLOCK_SYMBOLS (block, iter, sym)
5432 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5433 SYMBOL_DOMAIN (sym), domain))
5437 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5440 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5442 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5447 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5449 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5451 if (SYMBOL_IS_ARGUMENT (sym))
5456 add_defn_to_vec (obstackp,
5457 fixup_symbol_section (sym, objfile),
5465 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5466 They aren't parameters, right? */
5467 if (!found_sym && arg_sym != NULL)
5469 add_defn_to_vec (obstackp,
5470 fixup_symbol_section (arg_sym, objfile),
5477 /* Symbol Completion */
5479 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5480 name in a form that's appropriate for the completion. The result
5481 does not need to be deallocated, but is only good until the next call.
5483 TEXT_LEN is equal to the length of TEXT.
5484 Perform a wild match if WILD_MATCH is set.
5485 ENCODED should be set if TEXT represents the start of a symbol name
5486 in its encoded form. */
5489 symbol_completion_match (const char *sym_name,
5490 const char *text, int text_len,
5491 int wild_match, int encoded)
5493 const int verbatim_match = (text[0] == '<');
5498 /* Strip the leading angle bracket. */
5503 /* First, test against the fully qualified name of the symbol. */
5505 if (strncmp (sym_name, text, text_len) == 0)
5508 if (match && !encoded)
5510 /* One needed check before declaring a positive match is to verify
5511 that iff we are doing a verbatim match, the decoded version
5512 of the symbol name starts with '<'. Otherwise, this symbol name
5513 is not a suitable completion. */
5514 const char *sym_name_copy = sym_name;
5515 int has_angle_bracket;
5517 sym_name = ada_decode (sym_name);
5518 has_angle_bracket = (sym_name[0] == '<');
5519 match = (has_angle_bracket == verbatim_match);
5520 sym_name = sym_name_copy;
5523 if (match && !verbatim_match)
5525 /* When doing non-verbatim match, another check that needs to
5526 be done is to verify that the potentially matching symbol name
5527 does not include capital letters, because the ada-mode would
5528 not be able to understand these symbol names without the
5529 angle bracket notation. */
5532 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5537 /* Second: Try wild matching... */
5539 if (!match && wild_match)
5541 /* Since we are doing wild matching, this means that TEXT
5542 may represent an unqualified symbol name. We therefore must
5543 also compare TEXT against the unqualified name of the symbol. */
5544 sym_name = ada_unqualified_name (ada_decode (sym_name));
5546 if (strncmp (sym_name, text, text_len) == 0)
5550 /* Finally: If we found a mach, prepare the result to return. */
5556 sym_name = add_angle_brackets (sym_name);
5559 sym_name = ada_decode (sym_name);
5564 DEF_VEC_P (char_ptr);
5566 /* A companion function to ada_make_symbol_completion_list().
5567 Check if SYM_NAME represents a symbol which name would be suitable
5568 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5569 it is appended at the end of the given string vector SV.
5571 ORIG_TEXT is the string original string from the user command
5572 that needs to be completed. WORD is the entire command on which
5573 completion should be performed. These two parameters are used to
5574 determine which part of the symbol name should be added to the
5576 if WILD_MATCH is set, then wild matching is performed.
5577 ENCODED should be set if TEXT represents a symbol name in its
5578 encoded formed (in which case the completion should also be
5582 symbol_completion_add (VEC(char_ptr) **sv,
5583 const char *sym_name,
5584 const char *text, int text_len,
5585 const char *orig_text, const char *word,
5586 int wild_match, int encoded)
5588 const char *match = symbol_completion_match (sym_name, text, text_len,
5589 wild_match, encoded);
5595 /* We found a match, so add the appropriate completion to the given
5598 if (word == orig_text)
5600 completion = xmalloc (strlen (match) + 5);
5601 strcpy (completion, match);
5603 else if (word > orig_text)
5605 /* Return some portion of sym_name. */
5606 completion = xmalloc (strlen (match) + 5);
5607 strcpy (completion, match + (word - orig_text));
5611 /* Return some of ORIG_TEXT plus sym_name. */
5612 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5613 strncpy (completion, word, orig_text - word);
5614 completion[orig_text - word] = '\0';
5615 strcat (completion, match);
5618 VEC_safe_push (char_ptr, *sv, completion);
5621 /* An object of this type is passed as the user_data argument to the
5622 expand_partial_symbol_names method. */
5623 struct add_partial_datum
5625 VEC(char_ptr) **completions;
5634 /* A callback for expand_partial_symbol_names. */
5636 ada_expand_partial_symbol_name (const char *name, void *user_data)
5638 struct add_partial_datum *data = user_data;
5640 return symbol_completion_match (name, data->text, data->text_len,
5641 data->wild_match, data->encoded) != NULL;
5644 /* Return a list of possible symbol names completing TEXT0. The list
5645 is NULL terminated. WORD is the entire command on which completion
5649 ada_make_symbol_completion_list (char *text0, char *word)
5655 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5658 struct minimal_symbol *msymbol;
5659 struct objfile *objfile;
5660 struct block *b, *surrounding_static_block = 0;
5662 struct dict_iterator iter;
5664 if (text0[0] == '<')
5666 text = xstrdup (text0);
5667 make_cleanup (xfree, text);
5668 text_len = strlen (text);
5674 text = xstrdup (ada_encode (text0));
5675 make_cleanup (xfree, text);
5676 text_len = strlen (text);
5677 for (i = 0; i < text_len; i++)
5678 text[i] = tolower (text[i]);
5680 encoded = (strstr (text0, "__") != NULL);
5681 /* If the name contains a ".", then the user is entering a fully
5682 qualified entity name, and the match must not be done in wild
5683 mode. Similarly, if the user wants to complete what looks like
5684 an encoded name, the match must not be done in wild mode. */
5685 wild_match = (strchr (text0, '.') == NULL && !encoded);
5688 /* First, look at the partial symtab symbols. */
5690 struct add_partial_datum data;
5692 data.completions = &completions;
5694 data.text_len = text_len;
5697 data.wild_match = wild_match;
5698 data.encoded = encoded;
5699 expand_partial_symbol_names (ada_expand_partial_symbol_name, &data);
5702 /* At this point scan through the misc symbol vectors and add each
5703 symbol you find to the list. Eventually we want to ignore
5704 anything that isn't a text symbol (everything else will be
5705 handled by the psymtab code above). */
5707 ALL_MSYMBOLS (objfile, msymbol)
5710 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5711 text, text_len, text0, word, wild_match, encoded);
5714 /* Search upwards from currently selected frame (so that we can
5715 complete on local vars. */
5717 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5719 if (!BLOCK_SUPERBLOCK (b))
5720 surrounding_static_block = b; /* For elmin of dups */
5722 ALL_BLOCK_SYMBOLS (b, iter, sym)
5724 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5725 text, text_len, text0, word,
5726 wild_match, encoded);
5730 /* Go through the symtabs and check the externs and statics for
5731 symbols which match. */
5733 ALL_SYMTABS (objfile, s)
5736 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5737 ALL_BLOCK_SYMBOLS (b, iter, sym)
5739 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5740 text, text_len, text0, word,
5741 wild_match, encoded);
5745 ALL_SYMTABS (objfile, s)
5748 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5749 /* Don't do this block twice. */
5750 if (b == surrounding_static_block)
5752 ALL_BLOCK_SYMBOLS (b, iter, sym)
5754 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5755 text, text_len, text0, word,
5756 wild_match, encoded);
5760 /* Append the closing NULL entry. */
5761 VEC_safe_push (char_ptr, completions, NULL);
5763 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5764 return the copy. It's unfortunate that we have to make a copy
5765 of an array that we're about to destroy, but there is nothing much
5766 we can do about it. Fortunately, it's typically not a very large
5769 const size_t completions_size =
5770 VEC_length (char_ptr, completions) * sizeof (char *);
5771 char **result = xmalloc (completions_size);
5773 memcpy (result, VEC_address (char_ptr, completions), completions_size);
5775 VEC_free (char_ptr, completions);
5782 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5783 for tagged types. */
5786 ada_is_dispatch_table_ptr_type (struct type *type)
5790 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5793 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5797 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5800 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5801 to be invisible to users. */
5804 ada_is_ignored_field (struct type *type, int field_num)
5806 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5809 /* Check the name of that field. */
5811 const char *name = TYPE_FIELD_NAME (type, field_num);
5813 /* Anonymous field names should not be printed.
5814 brobecker/2007-02-20: I don't think this can actually happen
5815 but we don't want to print the value of annonymous fields anyway. */
5819 /* A field named "_parent" is internally generated by GNAT for
5820 tagged types, and should not be printed either. */
5821 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5825 /* If this is the dispatch table of a tagged type, then ignore. */
5826 if (ada_is_tagged_type (type, 1)
5827 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5830 /* Not a special field, so it should not be ignored. */
5834 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5835 pointer or reference type whose ultimate target has a tag field. */
5838 ada_is_tagged_type (struct type *type, int refok)
5840 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5843 /* True iff TYPE represents the type of X'Tag */
5846 ada_is_tag_type (struct type *type)
5848 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5852 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5854 return (name != NULL
5855 && strcmp (name, "ada__tags__dispatch_table") == 0);
5859 /* The type of the tag on VAL. */
5862 ada_tag_type (struct value *val)
5864 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
5867 /* The value of the tag on VAL. */
5870 ada_value_tag (struct value *val)
5872 return ada_value_struct_elt (val, "_tag", 0);
5875 /* The value of the tag on the object of type TYPE whose contents are
5876 saved at VALADDR, if it is non-null, or is at memory address
5879 static struct value *
5880 value_tag_from_contents_and_address (struct type *type,
5881 const gdb_byte *valaddr,
5884 int tag_byte_offset;
5885 struct type *tag_type;
5887 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5890 const gdb_byte *valaddr1 = ((valaddr == NULL)
5892 : valaddr + tag_byte_offset);
5893 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5895 return value_from_contents_and_address (tag_type, valaddr1, address1);
5900 static struct type *
5901 type_from_tag (struct value *tag)
5903 const char *type_name = ada_tag_name (tag);
5905 if (type_name != NULL)
5906 return ada_find_any_type (ada_encode (type_name));
5917 static int ada_tag_name_1 (void *);
5918 static int ada_tag_name_2 (struct tag_args *);
5920 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5921 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5922 The value stored in ARGS->name is valid until the next call to
5926 ada_tag_name_1 (void *args0)
5928 struct tag_args *args = (struct tag_args *) args0;
5929 static char name[1024];
5934 val = ada_value_struct_elt (args->tag, "tsd", 1);
5936 return ada_tag_name_2 (args);
5937 val = ada_value_struct_elt (val, "expanded_name", 1);
5940 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5941 for (p = name; *p != '\0'; p += 1)
5948 /* Return the "ada__tags__type_specific_data" type. */
5950 static struct type *
5951 ada_get_tsd_type (struct inferior *inf)
5953 struct ada_inferior_data *data = get_ada_inferior_data (inf);
5955 if (data->tsd_type == 0)
5956 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
5957 return data->tsd_type;
5960 /* Utility function for ada_tag_name_1 that tries the second
5961 representation for the dispatch table (in which there is no
5962 explicit 'tsd' field in the referent of the tag pointer, and instead
5963 the tsd pointer is stored just before the dispatch table. */
5966 ada_tag_name_2 (struct tag_args *args)
5968 struct type *info_type;
5969 static char name[1024];
5971 struct value *val, *valp;
5974 info_type = ada_get_tsd_type (current_inferior());
5975 if (info_type == NULL)
5977 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
5978 valp = value_cast (info_type, args->tag);
5981 val = value_ind (value_ptradd (valp, -1));
5984 val = ada_value_struct_elt (val, "expanded_name", 1);
5987 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5988 for (p = name; *p != '\0'; p += 1)
5995 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5999 ada_tag_name (struct value *tag)
6001 struct tag_args args;
6003 if (!ada_is_tag_type (value_type (tag)))
6007 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
6011 /* The parent type of TYPE, or NULL if none. */
6014 ada_parent_type (struct type *type)
6018 type = ada_check_typedef (type);
6020 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6023 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6024 if (ada_is_parent_field (type, i))
6026 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6028 /* If the _parent field is a pointer, then dereference it. */
6029 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6030 parent_type = TYPE_TARGET_TYPE (parent_type);
6031 /* If there is a parallel XVS type, get the actual base type. */
6032 parent_type = ada_get_base_type (parent_type);
6034 return ada_check_typedef (parent_type);
6040 /* True iff field number FIELD_NUM of structure type TYPE contains the
6041 parent-type (inherited) fields of a derived type. Assumes TYPE is
6042 a structure type with at least FIELD_NUM+1 fields. */
6045 ada_is_parent_field (struct type *type, int field_num)
6047 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6049 return (name != NULL
6050 && (strncmp (name, "PARENT", 6) == 0
6051 || strncmp (name, "_parent", 7) == 0));
6054 /* True iff field number FIELD_NUM of structure type TYPE is a
6055 transparent wrapper field (which should be silently traversed when doing
6056 field selection and flattened when printing). Assumes TYPE is a
6057 structure type with at least FIELD_NUM+1 fields. Such fields are always
6061 ada_is_wrapper_field (struct type *type, int field_num)
6063 const char *name = TYPE_FIELD_NAME (type, field_num);
6065 return (name != NULL
6066 && (strncmp (name, "PARENT", 6) == 0
6067 || strcmp (name, "REP") == 0
6068 || strncmp (name, "_parent", 7) == 0
6069 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6072 /* True iff field number FIELD_NUM of structure or union type TYPE
6073 is a variant wrapper. Assumes TYPE is a structure type with at least
6074 FIELD_NUM+1 fields. */
6077 ada_is_variant_part (struct type *type, int field_num)
6079 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6081 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6082 || (is_dynamic_field (type, field_num)
6083 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6084 == TYPE_CODE_UNION)));
6087 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6088 whose discriminants are contained in the record type OUTER_TYPE,
6089 returns the type of the controlling discriminant for the variant.
6090 May return NULL if the type could not be found. */
6093 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6095 char *name = ada_variant_discrim_name (var_type);
6097 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
6100 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6101 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6102 represents a 'when others' clause; otherwise 0. */
6105 ada_is_others_clause (struct type *type, int field_num)
6107 const char *name = TYPE_FIELD_NAME (type, field_num);
6109 return (name != NULL && name[0] == 'O');
6112 /* Assuming that TYPE0 is the type of the variant part of a record,
6113 returns the name of the discriminant controlling the variant.
6114 The value is valid until the next call to ada_variant_discrim_name. */
6117 ada_variant_discrim_name (struct type *type0)
6119 static char *result = NULL;
6120 static size_t result_len = 0;
6123 const char *discrim_end;
6124 const char *discrim_start;
6126 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
6127 type = TYPE_TARGET_TYPE (type0);
6131 name = ada_type_name (type);
6133 if (name == NULL || name[0] == '\000')
6136 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
6139 if (strncmp (discrim_end, "___XVN", 6) == 0)
6142 if (discrim_end == name)
6145 for (discrim_start = discrim_end; discrim_start != name + 3;
6148 if (discrim_start == name + 1)
6150 if ((discrim_start > name + 3
6151 && strncmp (discrim_start - 3, "___", 3) == 0)
6152 || discrim_start[-1] == '.')
6156 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
6157 strncpy (result, discrim_start, discrim_end - discrim_start);
6158 result[discrim_end - discrim_start] = '\0';
6162 /* Scan STR for a subtype-encoded number, beginning at position K.
6163 Put the position of the character just past the number scanned in
6164 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6165 Return 1 if there was a valid number at the given position, and 0
6166 otherwise. A "subtype-encoded" number consists of the absolute value
6167 in decimal, followed by the letter 'm' to indicate a negative number.
6168 Assumes 0m does not occur. */
6171 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
6175 if (!isdigit (str[k]))
6178 /* Do it the hard way so as not to make any assumption about
6179 the relationship of unsigned long (%lu scan format code) and
6182 while (isdigit (str[k]))
6184 RU = RU * 10 + (str[k] - '0');
6191 *R = (-(LONGEST) (RU - 1)) - 1;
6197 /* NOTE on the above: Technically, C does not say what the results of
6198 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6199 number representable as a LONGEST (although either would probably work
6200 in most implementations). When RU>0, the locution in the then branch
6201 above is always equivalent to the negative of RU. */
6208 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6209 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6210 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6213 ada_in_variant (LONGEST val, struct type *type, int field_num)
6215 const char *name = TYPE_FIELD_NAME (type, field_num);
6229 if (!ada_scan_number (name, p + 1, &W, &p))
6239 if (!ada_scan_number (name, p + 1, &L, &p)
6240 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6242 if (val >= L && val <= U)
6254 /* FIXME: Lots of redundancy below. Try to consolidate. */
6256 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6257 ARG_TYPE, extract and return the value of one of its (non-static)
6258 fields. FIELDNO says which field. Differs from value_primitive_field
6259 only in that it can handle packed values of arbitrary type. */
6261 static struct value *
6262 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
6263 struct type *arg_type)
6267 arg_type = ada_check_typedef (arg_type);
6268 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6270 /* Handle packed fields. */
6272 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6274 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6275 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
6277 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
6278 offset + bit_pos / 8,
6279 bit_pos % 8, bit_size, type);
6282 return value_primitive_field (arg1, offset, fieldno, arg_type);
6285 /* Find field with name NAME in object of type TYPE. If found,
6286 set the following for each argument that is non-null:
6287 - *FIELD_TYPE_P to the field's type;
6288 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6289 an object of that type;
6290 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6291 - *BIT_SIZE_P to its size in bits if the field is packed, and
6293 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6294 fields up to but not including the desired field, or by the total
6295 number of fields if not found. A NULL value of NAME never
6296 matches; the function just counts visible fields in this case.
6298 Returns 1 if found, 0 otherwise. */
6301 find_struct_field (char *name, struct type *type, int offset,
6302 struct type **field_type_p,
6303 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6308 type = ada_check_typedef (type);
6310 if (field_type_p != NULL)
6311 *field_type_p = NULL;
6312 if (byte_offset_p != NULL)
6314 if (bit_offset_p != NULL)
6316 if (bit_size_p != NULL)
6319 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6321 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6322 int fld_offset = offset + bit_pos / 8;
6323 char *t_field_name = TYPE_FIELD_NAME (type, i);
6325 if (t_field_name == NULL)
6328 else if (name != NULL && field_name_match (t_field_name, name))
6330 int bit_size = TYPE_FIELD_BITSIZE (type, i);
6332 if (field_type_p != NULL)
6333 *field_type_p = TYPE_FIELD_TYPE (type, i);
6334 if (byte_offset_p != NULL)
6335 *byte_offset_p = fld_offset;
6336 if (bit_offset_p != NULL)
6337 *bit_offset_p = bit_pos % 8;
6338 if (bit_size_p != NULL)
6339 *bit_size_p = bit_size;
6342 else if (ada_is_wrapper_field (type, i))
6344 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6345 field_type_p, byte_offset_p, bit_offset_p,
6346 bit_size_p, index_p))
6349 else if (ada_is_variant_part (type, i))
6351 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6354 struct type *field_type
6355 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6357 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6359 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6361 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6362 field_type_p, byte_offset_p,
6363 bit_offset_p, bit_size_p, index_p))
6367 else if (index_p != NULL)
6373 /* Number of user-visible fields in record type TYPE. */
6376 num_visible_fields (struct type *type)
6381 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6385 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6386 and search in it assuming it has (class) type TYPE.
6387 If found, return value, else return NULL.
6389 Searches recursively through wrapper fields (e.g., '_parent'). */
6391 static struct value *
6392 ada_search_struct_field (char *name, struct value *arg, int offset,
6397 type = ada_check_typedef (type);
6398 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6400 char *t_field_name = TYPE_FIELD_NAME (type, i);
6402 if (t_field_name == NULL)
6405 else if (field_name_match (t_field_name, name))
6406 return ada_value_primitive_field (arg, offset, i, type);
6408 else if (ada_is_wrapper_field (type, i))
6410 struct value *v = /* Do not let indent join lines here. */
6411 ada_search_struct_field (name, arg,
6412 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6413 TYPE_FIELD_TYPE (type, i));
6419 else if (ada_is_variant_part (type, i))
6421 /* PNH: Do we ever get here? See find_struct_field. */
6423 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6425 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6427 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6429 struct value *v = ada_search_struct_field /* Force line
6432 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6433 TYPE_FIELD_TYPE (field_type, j));
6443 static struct value *ada_index_struct_field_1 (int *, struct value *,
6444 int, struct type *);
6447 /* Return field #INDEX in ARG, where the index is that returned by
6448 * find_struct_field through its INDEX_P argument. Adjust the address
6449 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6450 * If found, return value, else return NULL. */
6452 static struct value *
6453 ada_index_struct_field (int index, struct value *arg, int offset,
6456 return ada_index_struct_field_1 (&index, arg, offset, type);
6460 /* Auxiliary function for ada_index_struct_field. Like
6461 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6464 static struct value *
6465 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6469 type = ada_check_typedef (type);
6471 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6473 if (TYPE_FIELD_NAME (type, i) == NULL)
6475 else if (ada_is_wrapper_field (type, i))
6477 struct value *v = /* Do not let indent join lines here. */
6478 ada_index_struct_field_1 (index_p, arg,
6479 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6480 TYPE_FIELD_TYPE (type, i));
6486 else if (ada_is_variant_part (type, i))
6488 /* PNH: Do we ever get here? See ada_search_struct_field,
6489 find_struct_field. */
6490 error (_("Cannot assign this kind of variant record"));
6492 else if (*index_p == 0)
6493 return ada_value_primitive_field (arg, offset, i, type);
6500 /* Given ARG, a value of type (pointer or reference to a)*
6501 structure/union, extract the component named NAME from the ultimate
6502 target structure/union and return it as a value with its
6505 The routine searches for NAME among all members of the structure itself
6506 and (recursively) among all members of any wrapper members
6509 If NO_ERR, then simply return NULL in case of error, rather than
6513 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6515 struct type *t, *t1;
6519 t1 = t = ada_check_typedef (value_type (arg));
6520 if (TYPE_CODE (t) == TYPE_CODE_REF)
6522 t1 = TYPE_TARGET_TYPE (t);
6525 t1 = ada_check_typedef (t1);
6526 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6528 arg = coerce_ref (arg);
6533 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6535 t1 = TYPE_TARGET_TYPE (t);
6538 t1 = ada_check_typedef (t1);
6539 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6541 arg = value_ind (arg);
6548 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6552 v = ada_search_struct_field (name, arg, 0, t);
6555 int bit_offset, bit_size, byte_offset;
6556 struct type *field_type;
6559 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6560 address = value_as_address (arg);
6562 address = unpack_pointer (t, value_contents (arg));
6564 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6565 if (find_struct_field (name, t1, 0,
6566 &field_type, &byte_offset, &bit_offset,
6571 if (TYPE_CODE (t) == TYPE_CODE_REF)
6572 arg = ada_coerce_ref (arg);
6574 arg = ada_value_ind (arg);
6575 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6576 bit_offset, bit_size,
6580 v = value_at_lazy (field_type, address + byte_offset);
6584 if (v != NULL || no_err)
6587 error (_("There is no member named %s."), name);
6593 error (_("Attempt to extract a component of "
6594 "a value that is not a record."));
6597 /* Given a type TYPE, look up the type of the component of type named NAME.
6598 If DISPP is non-null, add its byte displacement from the beginning of a
6599 structure (pointed to by a value) of type TYPE to *DISPP (does not
6600 work for packed fields).
6602 Matches any field whose name has NAME as a prefix, possibly
6605 TYPE can be either a struct or union. If REFOK, TYPE may also
6606 be a (pointer or reference)+ to a struct or union, and the
6607 ultimate target type will be searched.
6609 Looks recursively into variant clauses and parent types.
6611 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6612 TYPE is not a type of the right kind. */
6614 static struct type *
6615 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6616 int noerr, int *dispp)
6623 if (refok && type != NULL)
6626 type = ada_check_typedef (type);
6627 if (TYPE_CODE (type) != TYPE_CODE_PTR
6628 && TYPE_CODE (type) != TYPE_CODE_REF)
6630 type = TYPE_TARGET_TYPE (type);
6634 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6635 && TYPE_CODE (type) != TYPE_CODE_UNION))
6641 target_terminal_ours ();
6642 gdb_flush (gdb_stdout);
6644 error (_("Type (null) is not a structure or union type"));
6647 /* XXX: type_sprint */
6648 fprintf_unfiltered (gdb_stderr, _("Type "));
6649 type_print (type, "", gdb_stderr, -1);
6650 error (_(" is not a structure or union type"));
6655 type = to_static_fixed_type (type);
6657 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6659 char *t_field_name = TYPE_FIELD_NAME (type, i);
6663 if (t_field_name == NULL)
6666 else if (field_name_match (t_field_name, name))
6669 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
6670 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6673 else if (ada_is_wrapper_field (type, i))
6676 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6681 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6686 else if (ada_is_variant_part (type, i))
6689 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6692 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6694 /* FIXME pnh 2008/01/26: We check for a field that is
6695 NOT wrapped in a struct, since the compiler sometimes
6696 generates these for unchecked variant types. Revisit
6697 if the compiler changes this practice. */
6698 char *v_field_name = TYPE_FIELD_NAME (field_type, j);
6700 if (v_field_name != NULL
6701 && field_name_match (v_field_name, name))
6702 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6704 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
6711 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6722 target_terminal_ours ();
6723 gdb_flush (gdb_stdout);
6726 /* XXX: type_sprint */
6727 fprintf_unfiltered (gdb_stderr, _("Type "));
6728 type_print (type, "", gdb_stderr, -1);
6729 error (_(" has no component named <null>"));
6733 /* XXX: type_sprint */
6734 fprintf_unfiltered (gdb_stderr, _("Type "));
6735 type_print (type, "", gdb_stderr, -1);
6736 error (_(" has no component named %s"), name);
6743 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6744 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6745 represents an unchecked union (that is, the variant part of a
6746 record that is named in an Unchecked_Union pragma). */
6749 is_unchecked_variant (struct type *var_type, struct type *outer_type)
6751 char *discrim_name = ada_variant_discrim_name (var_type);
6753 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6758 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6759 within a value of type OUTER_TYPE that is stored in GDB at
6760 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6761 numbering from 0) is applicable. Returns -1 if none are. */
6764 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
6765 const gdb_byte *outer_valaddr)
6769 char *discrim_name = ada_variant_discrim_name (var_type);
6770 struct value *outer;
6771 struct value *discrim;
6772 LONGEST discrim_val;
6774 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6775 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6776 if (discrim == NULL)
6778 discrim_val = value_as_long (discrim);
6781 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6783 if (ada_is_others_clause (var_type, i))
6785 else if (ada_in_variant (discrim_val, var_type, i))
6789 return others_clause;
6794 /* Dynamic-Sized Records */
6796 /* Strategy: The type ostensibly attached to a value with dynamic size
6797 (i.e., a size that is not statically recorded in the debugging
6798 data) does not accurately reflect the size or layout of the value.
6799 Our strategy is to convert these values to values with accurate,
6800 conventional types that are constructed on the fly. */
6802 /* There is a subtle and tricky problem here. In general, we cannot
6803 determine the size of dynamic records without its data. However,
6804 the 'struct value' data structure, which GDB uses to represent
6805 quantities in the inferior process (the target), requires the size
6806 of the type at the time of its allocation in order to reserve space
6807 for GDB's internal copy of the data. That's why the
6808 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6809 rather than struct value*s.
6811 However, GDB's internal history variables ($1, $2, etc.) are
6812 struct value*s containing internal copies of the data that are not, in
6813 general, the same as the data at their corresponding addresses in
6814 the target. Fortunately, the types we give to these values are all
6815 conventional, fixed-size types (as per the strategy described
6816 above), so that we don't usually have to perform the
6817 'to_fixed_xxx_type' conversions to look at their values.
6818 Unfortunately, there is one exception: if one of the internal
6819 history variables is an array whose elements are unconstrained
6820 records, then we will need to create distinct fixed types for each
6821 element selected. */
6823 /* The upshot of all of this is that many routines take a (type, host
6824 address, target address) triple as arguments to represent a value.
6825 The host address, if non-null, is supposed to contain an internal
6826 copy of the relevant data; otherwise, the program is to consult the
6827 target at the target address. */
6829 /* Assuming that VAL0 represents a pointer value, the result of
6830 dereferencing it. Differs from value_ind in its treatment of
6831 dynamic-sized types. */
6834 ada_value_ind (struct value *val0)
6836 struct value *val = unwrap_value (value_ind (val0));
6838 return ada_to_fixed_value (val);
6841 /* The value resulting from dereferencing any "reference to"
6842 qualifiers on VAL0. */
6844 static struct value *
6845 ada_coerce_ref (struct value *val0)
6847 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
6849 struct value *val = val0;
6851 val = coerce_ref (val);
6852 val = unwrap_value (val);
6853 return ada_to_fixed_value (val);
6859 /* Return OFF rounded upward if necessary to a multiple of
6860 ALIGNMENT (a power of 2). */
6863 align_value (unsigned int off, unsigned int alignment)
6865 return (off + alignment - 1) & ~(alignment - 1);
6868 /* Return the bit alignment required for field #F of template type TYPE. */
6871 field_alignment (struct type *type, int f)
6873 const char *name = TYPE_FIELD_NAME (type, f);
6877 /* The field name should never be null, unless the debugging information
6878 is somehow malformed. In this case, we assume the field does not
6879 require any alignment. */
6883 len = strlen (name);
6885 if (!isdigit (name[len - 1]))
6888 if (isdigit (name[len - 2]))
6889 align_offset = len - 2;
6891 align_offset = len - 1;
6893 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
6894 return TARGET_CHAR_BIT;
6896 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6899 /* Find a symbol named NAME. Ignores ambiguity. */
6902 ada_find_any_symbol (const char *name)
6906 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6907 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6910 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6914 /* Find a type named NAME. Ignores ambiguity. This routine will look
6915 solely for types defined by debug info, it will not search the GDB
6919 ada_find_any_type (const char *name)
6921 struct symbol *sym = ada_find_any_symbol (name);
6924 return SYMBOL_TYPE (sym);
6929 /* Given NAME and an associated BLOCK, search all symbols for
6930 NAME suffixed with "___XR", which is the ``renaming'' symbol
6931 associated to NAME. Return this symbol if found, return
6935 ada_find_renaming_symbol (const char *name, struct block *block)
6939 sym = find_old_style_renaming_symbol (name, block);
6944 /* Not right yet. FIXME pnh 7/20/2007. */
6945 sym = ada_find_any_symbol (name);
6946 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
6952 static struct symbol *
6953 find_old_style_renaming_symbol (const char *name, struct block *block)
6955 const struct symbol *function_sym = block_linkage_function (block);
6958 if (function_sym != NULL)
6960 /* If the symbol is defined inside a function, NAME is not fully
6961 qualified. This means we need to prepend the function name
6962 as well as adding the ``___XR'' suffix to build the name of
6963 the associated renaming symbol. */
6964 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
6965 /* Function names sometimes contain suffixes used
6966 for instance to qualify nested subprograms. When building
6967 the XR type name, we need to make sure that this suffix is
6968 not included. So do not include any suffix in the function
6969 name length below. */
6970 int function_name_len = ada_name_prefix_len (function_name);
6971 const int rename_len = function_name_len + 2 /* "__" */
6972 + strlen (name) + 6 /* "___XR\0" */ ;
6974 /* Strip the suffix if necessary. */
6975 ada_remove_trailing_digits (function_name, &function_name_len);
6976 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
6977 ada_remove_Xbn_suffix (function_name, &function_name_len);
6979 /* Library-level functions are a special case, as GNAT adds
6980 a ``_ada_'' prefix to the function name to avoid namespace
6981 pollution. However, the renaming symbols themselves do not
6982 have this prefix, so we need to skip this prefix if present. */
6983 if (function_name_len > 5 /* "_ada_" */
6984 && strstr (function_name, "_ada_") == function_name)
6987 function_name_len -= 5;
6990 rename = (char *) alloca (rename_len * sizeof (char));
6991 strncpy (rename, function_name, function_name_len);
6992 xsnprintf (rename + function_name_len, rename_len - function_name_len,
6997 const int rename_len = strlen (name) + 6;
6999 rename = (char *) alloca (rename_len * sizeof (char));
7000 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
7003 return ada_find_any_symbol (rename);
7006 /* Because of GNAT encoding conventions, several GDB symbols may match a
7007 given type name. If the type denoted by TYPE0 is to be preferred to
7008 that of TYPE1 for purposes of type printing, return non-zero;
7009 otherwise return 0. */
7012 ada_prefer_type (struct type *type0, struct type *type1)
7016 else if (type0 == NULL)
7018 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
7020 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
7022 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
7024 else if (ada_is_constrained_packed_array_type (type0))
7026 else if (ada_is_array_descriptor_type (type0)
7027 && !ada_is_array_descriptor_type (type1))
7031 const char *type0_name = type_name_no_tag (type0);
7032 const char *type1_name = type_name_no_tag (type1);
7034 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
7035 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
7041 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7042 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7045 ada_type_name (struct type *type)
7049 else if (TYPE_NAME (type) != NULL)
7050 return TYPE_NAME (type);
7052 return TYPE_TAG_NAME (type);
7055 /* Search the list of "descriptive" types associated to TYPE for a type
7056 whose name is NAME. */
7058 static struct type *
7059 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
7061 struct type *result;
7063 /* If there no descriptive-type info, then there is no parallel type
7065 if (!HAVE_GNAT_AUX_INFO (type))
7068 result = TYPE_DESCRIPTIVE_TYPE (type);
7069 while (result != NULL)
7071 char *result_name = ada_type_name (result);
7073 if (result_name == NULL)
7075 warning (_("unexpected null name on descriptive type"));
7079 /* If the names match, stop. */
7080 if (strcmp (result_name, name) == 0)
7083 /* Otherwise, look at the next item on the list, if any. */
7084 if (HAVE_GNAT_AUX_INFO (result))
7085 result = TYPE_DESCRIPTIVE_TYPE (result);
7090 /* If we didn't find a match, see whether this is a packed array. With
7091 older compilers, the descriptive type information is either absent or
7092 irrelevant when it comes to packed arrays so the above lookup fails.
7093 Fall back to using a parallel lookup by name in this case. */
7094 if (result == NULL && ada_is_constrained_packed_array_type (type))
7095 return ada_find_any_type (name);
7100 /* Find a parallel type to TYPE with the specified NAME, using the
7101 descriptive type taken from the debugging information, if available,
7102 and otherwise using the (slower) name-based method. */
7104 static struct type *
7105 ada_find_parallel_type_with_name (struct type *type, const char *name)
7107 struct type *result = NULL;
7109 if (HAVE_GNAT_AUX_INFO (type))
7110 result = find_parallel_type_by_descriptive_type (type, name);
7112 result = ada_find_any_type (name);
7117 /* Same as above, but specify the name of the parallel type by appending
7118 SUFFIX to the name of TYPE. */
7121 ada_find_parallel_type (struct type *type, const char *suffix)
7123 char *name, *typename = ada_type_name (type);
7126 if (typename == NULL)
7129 len = strlen (typename);
7131 name = (char *) alloca (len + strlen (suffix) + 1);
7133 strcpy (name, typename);
7134 strcpy (name + len, suffix);
7136 return ada_find_parallel_type_with_name (type, name);
7139 /* If TYPE is a variable-size record type, return the corresponding template
7140 type describing its fields. Otherwise, return NULL. */
7142 static struct type *
7143 dynamic_template_type (struct type *type)
7145 type = ada_check_typedef (type);
7147 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
7148 || ada_type_name (type) == NULL)
7152 int len = strlen (ada_type_name (type));
7154 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
7157 return ada_find_parallel_type (type, "___XVE");
7161 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7162 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7165 is_dynamic_field (struct type *templ_type, int field_num)
7167 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
7170 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
7171 && strstr (name, "___XVL") != NULL;
7174 /* The index of the variant field of TYPE, or -1 if TYPE does not
7175 represent a variant record type. */
7178 variant_field_index (struct type *type)
7182 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
7185 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
7187 if (ada_is_variant_part (type, f))
7193 /* A record type with no fields. */
7195 static struct type *
7196 empty_record (struct type *template)
7198 struct type *type = alloc_type_copy (template);
7200 TYPE_CODE (type) = TYPE_CODE_STRUCT;
7201 TYPE_NFIELDS (type) = 0;
7202 TYPE_FIELDS (type) = NULL;
7203 INIT_CPLUS_SPECIFIC (type);
7204 TYPE_NAME (type) = "<empty>";
7205 TYPE_TAG_NAME (type) = NULL;
7206 TYPE_LENGTH (type) = 0;
7210 /* An ordinary record type (with fixed-length fields) that describes
7211 the value of type TYPE at VALADDR or ADDRESS (see comments at
7212 the beginning of this section) VAL according to GNAT conventions.
7213 DVAL0 should describe the (portion of a) record that contains any
7214 necessary discriminants. It should be NULL if value_type (VAL) is
7215 an outer-level type (i.e., as opposed to a branch of a variant.) A
7216 variant field (unless unchecked) is replaced by a particular branch
7219 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7220 length are not statically known are discarded. As a consequence,
7221 VALADDR, ADDRESS and DVAL0 are ignored.
7223 NOTE: Limitations: For now, we assume that dynamic fields and
7224 variants occupy whole numbers of bytes. However, they need not be
7228 ada_template_to_fixed_record_type_1 (struct type *type,
7229 const gdb_byte *valaddr,
7230 CORE_ADDR address, struct value *dval0,
7231 int keep_dynamic_fields)
7233 struct value *mark = value_mark ();
7236 int nfields, bit_len;
7242 /* Compute the number of fields in this record type that are going
7243 to be processed: unless keep_dynamic_fields, this includes only
7244 fields whose position and length are static will be processed. */
7245 if (keep_dynamic_fields)
7246 nfields = TYPE_NFIELDS (type);
7250 while (nfields < TYPE_NFIELDS (type)
7251 && !ada_is_variant_part (type, nfields)
7252 && !is_dynamic_field (type, nfields))
7256 rtype = alloc_type_copy (type);
7257 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7258 INIT_CPLUS_SPECIFIC (rtype);
7259 TYPE_NFIELDS (rtype) = nfields;
7260 TYPE_FIELDS (rtype) = (struct field *)
7261 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7262 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7263 TYPE_NAME (rtype) = ada_type_name (type);
7264 TYPE_TAG_NAME (rtype) = NULL;
7265 TYPE_FIXED_INSTANCE (rtype) = 1;
7271 for (f = 0; f < nfields; f += 1)
7273 off = align_value (off, field_alignment (type, f))
7274 + TYPE_FIELD_BITPOS (type, f);
7275 TYPE_FIELD_BITPOS (rtype, f) = off;
7276 TYPE_FIELD_BITSIZE (rtype, f) = 0;
7278 if (ada_is_variant_part (type, f))
7283 else if (is_dynamic_field (type, f))
7285 const gdb_byte *field_valaddr = valaddr;
7286 CORE_ADDR field_address = address;
7287 struct type *field_type =
7288 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7292 /* rtype's length is computed based on the run-time
7293 value of discriminants. If the discriminants are not
7294 initialized, the type size may be completely bogus and
7295 GDB may fail to allocate a value for it. So check the
7296 size first before creating the value. */
7298 dval = value_from_contents_and_address (rtype, valaddr, address);
7303 /* If the type referenced by this field is an aligner type, we need
7304 to unwrap that aligner type, because its size might not be set.
7305 Keeping the aligner type would cause us to compute the wrong
7306 size for this field, impacting the offset of the all the fields
7307 that follow this one. */
7308 if (ada_is_aligner_type (field_type))
7310 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7312 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7313 field_address = cond_offset_target (field_address, field_offset);
7314 field_type = ada_aligned_type (field_type);
7317 field_valaddr = cond_offset_host (field_valaddr,
7318 off / TARGET_CHAR_BIT);
7319 field_address = cond_offset_target (field_address,
7320 off / TARGET_CHAR_BIT);
7322 /* Get the fixed type of the field. Note that, in this case,
7323 we do not want to get the real type out of the tag: if
7324 the current field is the parent part of a tagged record,
7325 we will get the tag of the object. Clearly wrong: the real
7326 type of the parent is not the real type of the child. We
7327 would end up in an infinite loop. */
7328 field_type = ada_get_base_type (field_type);
7329 field_type = ada_to_fixed_type (field_type, field_valaddr,
7330 field_address, dval, 0);
7331 /* If the field size is already larger than the maximum
7332 object size, then the record itself will necessarily
7333 be larger than the maximum object size. We need to make
7334 this check now, because the size might be so ridiculously
7335 large (due to an uninitialized variable in the inferior)
7336 that it would cause an overflow when adding it to the
7338 check_size (field_type);
7340 TYPE_FIELD_TYPE (rtype, f) = field_type;
7341 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7342 /* The multiplication can potentially overflow. But because
7343 the field length has been size-checked just above, and
7344 assuming that the maximum size is a reasonable value,
7345 an overflow should not happen in practice. So rather than
7346 adding overflow recovery code to this already complex code,
7347 we just assume that it's not going to happen. */
7349 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7353 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7355 /* If our field is a typedef type (most likely a typedef of
7356 a fat pointer, encoding an array access), then we need to
7357 look at its target type to determine its characteristics.
7358 In particular, we would miscompute the field size if we took
7359 the size of the typedef (zero), instead of the size of
7361 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
7362 field_type = ada_typedef_target_type (field_type);
7364 TYPE_FIELD_TYPE (rtype, f) = field_type;
7365 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7366 if (TYPE_FIELD_BITSIZE (type, f) > 0)
7368 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7371 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
7373 if (off + fld_bit_len > bit_len)
7374 bit_len = off + fld_bit_len;
7376 TYPE_LENGTH (rtype) =
7377 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7380 /* We handle the variant part, if any, at the end because of certain
7381 odd cases in which it is re-ordered so as NOT to be the last field of
7382 the record. This can happen in the presence of representation
7384 if (variant_field >= 0)
7386 struct type *branch_type;
7388 off = TYPE_FIELD_BITPOS (rtype, variant_field);
7391 dval = value_from_contents_and_address (rtype, valaddr, address);
7396 to_fixed_variant_branch_type
7397 (TYPE_FIELD_TYPE (type, variant_field),
7398 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
7399 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
7400 if (branch_type == NULL)
7402 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
7403 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7404 TYPE_NFIELDS (rtype) -= 1;
7408 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7409 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7411 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
7413 if (off + fld_bit_len > bit_len)
7414 bit_len = off + fld_bit_len;
7415 TYPE_LENGTH (rtype) =
7416 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7420 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7421 should contain the alignment of that record, which should be a strictly
7422 positive value. If null or negative, then something is wrong, most
7423 probably in the debug info. In that case, we don't round up the size
7424 of the resulting type. If this record is not part of another structure,
7425 the current RTYPE length might be good enough for our purposes. */
7426 if (TYPE_LENGTH (type) <= 0)
7428 if (TYPE_NAME (rtype))
7429 warning (_("Invalid type size for `%s' detected: %d."),
7430 TYPE_NAME (rtype), TYPE_LENGTH (type));
7432 warning (_("Invalid type size for <unnamed> detected: %d."),
7433 TYPE_LENGTH (type));
7437 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
7438 TYPE_LENGTH (type));
7441 value_free_to_mark (mark);
7442 if (TYPE_LENGTH (rtype) > varsize_limit)
7443 error (_("record type with dynamic size is larger than varsize-limit"));
7447 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7450 static struct type *
7451 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
7452 CORE_ADDR address, struct value *dval0)
7454 return ada_template_to_fixed_record_type_1 (type, valaddr,
7458 /* An ordinary record type in which ___XVL-convention fields and
7459 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7460 static approximations, containing all possible fields. Uses
7461 no runtime values. Useless for use in values, but that's OK,
7462 since the results are used only for type determinations. Works on both
7463 structs and unions. Representation note: to save space, we memorize
7464 the result of this function in the TYPE_TARGET_TYPE of the
7467 static struct type *
7468 template_to_static_fixed_type (struct type *type0)
7474 if (TYPE_TARGET_TYPE (type0) != NULL)
7475 return TYPE_TARGET_TYPE (type0);
7477 nfields = TYPE_NFIELDS (type0);
7480 for (f = 0; f < nfields; f += 1)
7482 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
7483 struct type *new_type;
7485 if (is_dynamic_field (type0, f))
7486 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
7488 new_type = static_unwrap_type (field_type);
7489 if (type == type0 && new_type != field_type)
7491 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
7492 TYPE_CODE (type) = TYPE_CODE (type0);
7493 INIT_CPLUS_SPECIFIC (type);
7494 TYPE_NFIELDS (type) = nfields;
7495 TYPE_FIELDS (type) = (struct field *)
7496 TYPE_ALLOC (type, nfields * sizeof (struct field));
7497 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7498 sizeof (struct field) * nfields);
7499 TYPE_NAME (type) = ada_type_name (type0);
7500 TYPE_TAG_NAME (type) = NULL;
7501 TYPE_FIXED_INSTANCE (type) = 1;
7502 TYPE_LENGTH (type) = 0;
7504 TYPE_FIELD_TYPE (type, f) = new_type;
7505 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
7510 /* Given an object of type TYPE whose contents are at VALADDR and
7511 whose address in memory is ADDRESS, returns a revision of TYPE,
7512 which should be a non-dynamic-sized record, in which the variant
7513 part, if any, is replaced with the appropriate branch. Looks
7514 for discriminant values in DVAL0, which can be NULL if the record
7515 contains the necessary discriminant values. */
7517 static struct type *
7518 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
7519 CORE_ADDR address, struct value *dval0)
7521 struct value *mark = value_mark ();
7524 struct type *branch_type;
7525 int nfields = TYPE_NFIELDS (type);
7526 int variant_field = variant_field_index (type);
7528 if (variant_field == -1)
7532 dval = value_from_contents_and_address (type, valaddr, address);
7536 rtype = alloc_type_copy (type);
7537 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7538 INIT_CPLUS_SPECIFIC (rtype);
7539 TYPE_NFIELDS (rtype) = nfields;
7540 TYPE_FIELDS (rtype) =
7541 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7542 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7543 sizeof (struct field) * nfields);
7544 TYPE_NAME (rtype) = ada_type_name (type);
7545 TYPE_TAG_NAME (rtype) = NULL;
7546 TYPE_FIXED_INSTANCE (rtype) = 1;
7547 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7549 branch_type = to_fixed_variant_branch_type
7550 (TYPE_FIELD_TYPE (type, variant_field),
7551 cond_offset_host (valaddr,
7552 TYPE_FIELD_BITPOS (type, variant_field)
7554 cond_offset_target (address,
7555 TYPE_FIELD_BITPOS (type, variant_field)
7556 / TARGET_CHAR_BIT), dval);
7557 if (branch_type == NULL)
7561 for (f = variant_field + 1; f < nfields; f += 1)
7562 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7563 TYPE_NFIELDS (rtype) -= 1;
7567 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7568 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7569 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7570 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7572 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7574 value_free_to_mark (mark);
7578 /* An ordinary record type (with fixed-length fields) that describes
7579 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7580 beginning of this section]. Any necessary discriminants' values
7581 should be in DVAL, a record value; it may be NULL if the object
7582 at ADDR itself contains any necessary discriminant values.
7583 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7584 values from the record are needed. Except in the case that DVAL,
7585 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7586 unchecked) is replaced by a particular branch of the variant.
7588 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7589 is questionable and may be removed. It can arise during the
7590 processing of an unconstrained-array-of-record type where all the
7591 variant branches have exactly the same size. This is because in
7592 such cases, the compiler does not bother to use the XVS convention
7593 when encoding the record. I am currently dubious of this
7594 shortcut and suspect the compiler should be altered. FIXME. */
7596 static struct type *
7597 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7598 CORE_ADDR address, struct value *dval)
7600 struct type *templ_type;
7602 if (TYPE_FIXED_INSTANCE (type0))
7605 templ_type = dynamic_template_type (type0);
7607 if (templ_type != NULL)
7608 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
7609 else if (variant_field_index (type0) >= 0)
7611 if (dval == NULL && valaddr == NULL && address == 0)
7613 return to_record_with_fixed_variant_part (type0, valaddr, address,
7618 TYPE_FIXED_INSTANCE (type0) = 1;
7624 /* An ordinary record type (with fixed-length fields) that describes
7625 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7626 union type. Any necessary discriminants' values should be in DVAL,
7627 a record value. That is, this routine selects the appropriate
7628 branch of the union at ADDR according to the discriminant value
7629 indicated in the union's type name. Returns VAR_TYPE0 itself if
7630 it represents a variant subject to a pragma Unchecked_Union. */
7632 static struct type *
7633 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
7634 CORE_ADDR address, struct value *dval)
7637 struct type *templ_type;
7638 struct type *var_type;
7640 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7641 var_type = TYPE_TARGET_TYPE (var_type0);
7643 var_type = var_type0;
7645 templ_type = ada_find_parallel_type (var_type, "___XVU");
7647 if (templ_type != NULL)
7648 var_type = templ_type;
7650 if (is_unchecked_variant (var_type, value_type (dval)))
7653 ada_which_variant_applies (var_type,
7654 value_type (dval), value_contents (dval));
7657 return empty_record (var_type);
7658 else if (is_dynamic_field (var_type, which))
7659 return to_fixed_record_type
7660 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7661 valaddr, address, dval);
7662 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
7664 to_fixed_record_type
7665 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
7667 return TYPE_FIELD_TYPE (var_type, which);
7670 /* Assuming that TYPE0 is an array type describing the type of a value
7671 at ADDR, and that DVAL describes a record containing any
7672 discriminants used in TYPE0, returns a type for the value that
7673 contains no dynamic components (that is, no components whose sizes
7674 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7675 true, gives an error message if the resulting type's size is over
7678 static struct type *
7679 to_fixed_array_type (struct type *type0, struct value *dval,
7682 struct type *index_type_desc;
7683 struct type *result;
7684 int constrained_packed_array_p;
7686 type0 = ada_check_typedef (type0);
7687 if (TYPE_FIXED_INSTANCE (type0))
7690 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
7691 if (constrained_packed_array_p)
7692 type0 = decode_constrained_packed_array_type (type0);
7694 index_type_desc = ada_find_parallel_type (type0, "___XA");
7695 ada_fixup_array_indexes_type (index_type_desc);
7696 if (index_type_desc == NULL)
7698 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
7700 /* NOTE: elt_type---the fixed version of elt_type0---should never
7701 depend on the contents of the array in properly constructed
7703 /* Create a fixed version of the array element type.
7704 We're not providing the address of an element here,
7705 and thus the actual object value cannot be inspected to do
7706 the conversion. This should not be a problem, since arrays of
7707 unconstrained objects are not allowed. In particular, all
7708 the elements of an array of a tagged type should all be of
7709 the same type specified in the debugging info. No need to
7710 consult the object tag. */
7711 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
7713 /* Make sure we always create a new array type when dealing with
7714 packed array types, since we're going to fix-up the array
7715 type length and element bitsize a little further down. */
7716 if (elt_type0 == elt_type && !constrained_packed_array_p)
7719 result = create_array_type (alloc_type_copy (type0),
7720 elt_type, TYPE_INDEX_TYPE (type0));
7725 struct type *elt_type0;
7728 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
7729 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7731 /* NOTE: result---the fixed version of elt_type0---should never
7732 depend on the contents of the array in properly constructed
7734 /* Create a fixed version of the array element type.
7735 We're not providing the address of an element here,
7736 and thus the actual object value cannot be inspected to do
7737 the conversion. This should not be a problem, since arrays of
7738 unconstrained objects are not allowed. In particular, all
7739 the elements of an array of a tagged type should all be of
7740 the same type specified in the debugging info. No need to
7741 consult the object tag. */
7743 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
7746 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
7748 struct type *range_type =
7749 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
7751 result = create_array_type (alloc_type_copy (elt_type0),
7752 result, range_type);
7753 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7755 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
7756 error (_("array type with dynamic size is larger than varsize-limit"));
7759 if (constrained_packed_array_p)
7761 /* So far, the resulting type has been created as if the original
7762 type was a regular (non-packed) array type. As a result, the
7763 bitsize of the array elements needs to be set again, and the array
7764 length needs to be recomputed based on that bitsize. */
7765 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
7766 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
7768 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
7769 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
7770 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
7771 TYPE_LENGTH (result)++;
7774 TYPE_FIXED_INSTANCE (result) = 1;
7779 /* A standard type (containing no dynamically sized components)
7780 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7781 DVAL describes a record containing any discriminants used in TYPE0,
7782 and may be NULL if there are none, or if the object of type TYPE at
7783 ADDRESS or in VALADDR contains these discriminants.
7785 If CHECK_TAG is not null, in the case of tagged types, this function
7786 attempts to locate the object's tag and use it to compute the actual
7787 type. However, when ADDRESS is null, we cannot use it to determine the
7788 location of the tag, and therefore compute the tagged type's actual type.
7789 So we return the tagged type without consulting the tag. */
7791 static struct type *
7792 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
7793 CORE_ADDR address, struct value *dval, int check_tag)
7795 type = ada_check_typedef (type);
7796 switch (TYPE_CODE (type))
7800 case TYPE_CODE_STRUCT:
7802 struct type *static_type = to_static_fixed_type (type);
7803 struct type *fixed_record_type =
7804 to_fixed_record_type (type, valaddr, address, NULL);
7806 /* If STATIC_TYPE is a tagged type and we know the object's address,
7807 then we can determine its tag, and compute the object's actual
7808 type from there. Note that we have to use the fixed record
7809 type (the parent part of the record may have dynamic fields
7810 and the way the location of _tag is expressed may depend on
7813 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
7815 struct type *real_type =
7816 type_from_tag (value_tag_from_contents_and_address
7821 if (real_type != NULL)
7822 return to_fixed_record_type (real_type, valaddr, address, NULL);
7825 /* Check to see if there is a parallel ___XVZ variable.
7826 If there is, then it provides the actual size of our type. */
7827 else if (ada_type_name (fixed_record_type) != NULL)
7829 char *name = ada_type_name (fixed_record_type);
7830 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
7834 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
7835 size = get_int_var_value (xvz_name, &xvz_found);
7836 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
7838 fixed_record_type = copy_type (fixed_record_type);
7839 TYPE_LENGTH (fixed_record_type) = size;
7841 /* The FIXED_RECORD_TYPE may have be a stub. We have
7842 observed this when the debugging info is STABS, and
7843 apparently it is something that is hard to fix.
7845 In practice, we don't need the actual type definition
7846 at all, because the presence of the XVZ variable allows us
7847 to assume that there must be a XVS type as well, which we
7848 should be able to use later, when we need the actual type
7851 In the meantime, pretend that the "fixed" type we are
7852 returning is NOT a stub, because this can cause trouble
7853 when using this type to create new types targeting it.
7854 Indeed, the associated creation routines often check
7855 whether the target type is a stub and will try to replace
7856 it, thus using a type with the wrong size. This, in turn,
7857 might cause the new type to have the wrong size too.
7858 Consider the case of an array, for instance, where the size
7859 of the array is computed from the number of elements in
7860 our array multiplied by the size of its element. */
7861 TYPE_STUB (fixed_record_type) = 0;
7864 return fixed_record_type;
7866 case TYPE_CODE_ARRAY:
7867 return to_fixed_array_type (type, dval, 1);
7868 case TYPE_CODE_UNION:
7872 return to_fixed_variant_branch_type (type, valaddr, address, dval);
7876 /* The same as ada_to_fixed_type_1, except that it preserves the type
7877 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7879 The typedef layer needs be preserved in order to differentiate between
7880 arrays and array pointers when both types are implemented using the same
7881 fat pointer. In the array pointer case, the pointer is encoded as
7882 a typedef of the pointer type. For instance, considering:
7884 type String_Access is access String;
7885 S1 : String_Access := null;
7887 To the debugger, S1 is defined as a typedef of type String. But
7888 to the user, it is a pointer. So if the user tries to print S1,
7889 we should not dereference the array, but print the array address
7892 If we didn't preserve the typedef layer, we would lose the fact that
7893 the type is to be presented as a pointer (needs de-reference before
7894 being printed). And we would also use the source-level type name. */
7897 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7898 CORE_ADDR address, struct value *dval, int check_tag)
7901 struct type *fixed_type =
7902 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7904 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
7905 then preserve the typedef layer.
7907 Implementation note: We can only check the main-type portion of
7908 the TYPE and FIXED_TYPE, because eliminating the typedef layer
7909 from TYPE now returns a type that has the same instance flags
7910 as TYPE. For instance, if TYPE is a "typedef const", and its
7911 target type is a "struct", then the typedef elimination will return
7912 a "const" version of the target type. See check_typedef for more
7913 details about how the typedef layer elimination is done.
7915 brobecker/2010-11-19: It seems to me that the only case where it is
7916 useful to preserve the typedef layer is when dealing with fat pointers.
7917 Perhaps, we could add a check for that and preserve the typedef layer
7918 only in that situation. But this seems unecessary so far, probably
7919 because we call check_typedef/ada_check_typedef pretty much everywhere.
7921 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7922 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
7923 == TYPE_MAIN_TYPE (fixed_type)))
7929 /* A standard (static-sized) type corresponding as well as possible to
7930 TYPE0, but based on no runtime data. */
7932 static struct type *
7933 to_static_fixed_type (struct type *type0)
7940 if (TYPE_FIXED_INSTANCE (type0))
7943 type0 = ada_check_typedef (type0);
7945 switch (TYPE_CODE (type0))
7949 case TYPE_CODE_STRUCT:
7950 type = dynamic_template_type (type0);
7952 return template_to_static_fixed_type (type);
7954 return template_to_static_fixed_type (type0);
7955 case TYPE_CODE_UNION:
7956 type = ada_find_parallel_type (type0, "___XVU");
7958 return template_to_static_fixed_type (type);
7960 return template_to_static_fixed_type (type0);
7964 /* A static approximation of TYPE with all type wrappers removed. */
7966 static struct type *
7967 static_unwrap_type (struct type *type)
7969 if (ada_is_aligner_type (type))
7971 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
7972 if (ada_type_name (type1) == NULL)
7973 TYPE_NAME (type1) = ada_type_name (type);
7975 return static_unwrap_type (type1);
7979 struct type *raw_real_type = ada_get_base_type (type);
7981 if (raw_real_type == type)
7984 return to_static_fixed_type (raw_real_type);
7988 /* In some cases, incomplete and private types require
7989 cross-references that are not resolved as records (for example,
7991 type FooP is access Foo;
7993 type Foo is array ...;
7994 ). In these cases, since there is no mechanism for producing
7995 cross-references to such types, we instead substitute for FooP a
7996 stub enumeration type that is nowhere resolved, and whose tag is
7997 the name of the actual type. Call these types "non-record stubs". */
7999 /* A type equivalent to TYPE that is not a non-record stub, if one
8000 exists, otherwise TYPE. */
8003 ada_check_typedef (struct type *type)
8008 /* If our type is a typedef type of a fat pointer, then we're done.
8009 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8010 what allows us to distinguish between fat pointers that represent
8011 array types, and fat pointers that represent array access types
8012 (in both cases, the compiler implements them as fat pointers). */
8013 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8014 && is_thick_pntr (ada_typedef_target_type (type)))
8017 CHECK_TYPEDEF (type);
8018 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
8019 || !TYPE_STUB (type)
8020 || TYPE_TAG_NAME (type) == NULL)
8024 char *name = TYPE_TAG_NAME (type);
8025 struct type *type1 = ada_find_any_type (name);
8030 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8031 stubs pointing to arrays, as we don't create symbols for array
8032 types, only for the typedef-to-array types). If that's the case,
8033 strip the typedef layer. */
8034 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
8035 type1 = ada_check_typedef (type1);
8041 /* A value representing the data at VALADDR/ADDRESS as described by
8042 type TYPE0, but with a standard (static-sized) type that correctly
8043 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8044 type, then return VAL0 [this feature is simply to avoid redundant
8045 creation of struct values]. */
8047 static struct value *
8048 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
8051 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
8053 if (type == type0 && val0 != NULL)
8056 return value_from_contents_and_address (type, 0, address);
8059 /* A value representing VAL, but with a standard (static-sized) type
8060 that correctly describes it. Does not necessarily create a new
8064 ada_to_fixed_value (struct value *val)
8066 return ada_to_fixed_value_create (value_type (val),
8067 value_address (val),
8074 /* Table mapping attribute numbers to names.
8075 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8077 static const char *attribute_names[] = {
8095 ada_attribute_name (enum exp_opcode n)
8097 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
8098 return attribute_names[n - OP_ATR_FIRST + 1];
8100 return attribute_names[0];
8103 /* Evaluate the 'POS attribute applied to ARG. */
8106 pos_atr (struct value *arg)
8108 struct value *val = coerce_ref (arg);
8109 struct type *type = value_type (val);
8111 if (!discrete_type_p (type))
8112 error (_("'POS only defined on discrete types"));
8114 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8117 LONGEST v = value_as_long (val);
8119 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
8121 if (v == TYPE_FIELD_BITPOS (type, i))
8124 error (_("enumeration value is invalid: can't find 'POS"));
8127 return value_as_long (val);
8130 static struct value *
8131 value_pos_atr (struct type *type, struct value *arg)
8133 return value_from_longest (type, pos_atr (arg));
8136 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8138 static struct value *
8139 value_val_atr (struct type *type, struct value *arg)
8141 if (!discrete_type_p (type))
8142 error (_("'VAL only defined on discrete types"));
8143 if (!integer_type_p (value_type (arg)))
8144 error (_("'VAL requires integral argument"));
8146 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8148 long pos = value_as_long (arg);
8150 if (pos < 0 || pos >= TYPE_NFIELDS (type))
8151 error (_("argument to 'VAL out of range"));
8152 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
8155 return value_from_longest (type, value_as_long (arg));
8161 /* True if TYPE appears to be an Ada character type.
8162 [At the moment, this is true only for Character and Wide_Character;
8163 It is a heuristic test that could stand improvement]. */
8166 ada_is_character_type (struct type *type)
8170 /* If the type code says it's a character, then assume it really is,
8171 and don't check any further. */
8172 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
8175 /* Otherwise, assume it's a character type iff it is a discrete type
8176 with a known character type name. */
8177 name = ada_type_name (type);
8178 return (name != NULL
8179 && (TYPE_CODE (type) == TYPE_CODE_INT
8180 || TYPE_CODE (type) == TYPE_CODE_RANGE)
8181 && (strcmp (name, "character") == 0
8182 || strcmp (name, "wide_character") == 0
8183 || strcmp (name, "wide_wide_character") == 0
8184 || strcmp (name, "unsigned char") == 0));
8187 /* True if TYPE appears to be an Ada string type. */
8190 ada_is_string_type (struct type *type)
8192 type = ada_check_typedef (type);
8194 && TYPE_CODE (type) != TYPE_CODE_PTR
8195 && (ada_is_simple_array_type (type)
8196 || ada_is_array_descriptor_type (type))
8197 && ada_array_arity (type) == 1)
8199 struct type *elttype = ada_array_element_type (type, 1);
8201 return ada_is_character_type (elttype);
8207 /* The compiler sometimes provides a parallel XVS type for a given
8208 PAD type. Normally, it is safe to follow the PAD type directly,
8209 but older versions of the compiler have a bug that causes the offset
8210 of its "F" field to be wrong. Following that field in that case
8211 would lead to incorrect results, but this can be worked around
8212 by ignoring the PAD type and using the associated XVS type instead.
8214 Set to True if the debugger should trust the contents of PAD types.
8215 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8216 static int trust_pad_over_xvs = 1;
8218 /* True if TYPE is a struct type introduced by the compiler to force the
8219 alignment of a value. Such types have a single field with a
8220 distinctive name. */
8223 ada_is_aligner_type (struct type *type)
8225 type = ada_check_typedef (type);
8227 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
8230 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
8231 && TYPE_NFIELDS (type) == 1
8232 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
8235 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8236 the parallel type. */
8239 ada_get_base_type (struct type *raw_type)
8241 struct type *real_type_namer;
8242 struct type *raw_real_type;
8244 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
8247 if (ada_is_aligner_type (raw_type))
8248 /* The encoding specifies that we should always use the aligner type.
8249 So, even if this aligner type has an associated XVS type, we should
8252 According to the compiler gurus, an XVS type parallel to an aligner
8253 type may exist because of a stabs limitation. In stabs, aligner
8254 types are empty because the field has a variable-sized type, and
8255 thus cannot actually be used as an aligner type. As a result,
8256 we need the associated parallel XVS type to decode the type.
8257 Since the policy in the compiler is to not change the internal
8258 representation based on the debugging info format, we sometimes
8259 end up having a redundant XVS type parallel to the aligner type. */
8262 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
8263 if (real_type_namer == NULL
8264 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
8265 || TYPE_NFIELDS (real_type_namer) != 1)
8268 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
8270 /* This is an older encoding form where the base type needs to be
8271 looked up by name. We prefer the newer enconding because it is
8273 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
8274 if (raw_real_type == NULL)
8277 return raw_real_type;
8280 /* The field in our XVS type is a reference to the base type. */
8281 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
8284 /* The type of value designated by TYPE, with all aligners removed. */
8287 ada_aligned_type (struct type *type)
8289 if (ada_is_aligner_type (type))
8290 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
8292 return ada_get_base_type (type);
8296 /* The address of the aligned value in an object at address VALADDR
8297 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8300 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
8302 if (ada_is_aligner_type (type))
8303 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
8305 TYPE_FIELD_BITPOS (type,
8306 0) / TARGET_CHAR_BIT);
8313 /* The printed representation of an enumeration literal with encoded
8314 name NAME. The value is good to the next call of ada_enum_name. */
8316 ada_enum_name (const char *name)
8318 static char *result;
8319 static size_t result_len = 0;
8322 /* First, unqualify the enumeration name:
8323 1. Search for the last '.' character. If we find one, then skip
8324 all the preceding characters, the unqualified name starts
8325 right after that dot.
8326 2. Otherwise, we may be debugging on a target where the compiler
8327 translates dots into "__". Search forward for double underscores,
8328 but stop searching when we hit an overloading suffix, which is
8329 of the form "__" followed by digits. */
8331 tmp = strrchr (name, '.');
8336 while ((tmp = strstr (name, "__")) != NULL)
8338 if (isdigit (tmp[2]))
8349 if (name[1] == 'U' || name[1] == 'W')
8351 if (sscanf (name + 2, "%x", &v) != 1)
8357 GROW_VECT (result, result_len, 16);
8358 if (isascii (v) && isprint (v))
8359 xsnprintf (result, result_len, "'%c'", v);
8360 else if (name[1] == 'U')
8361 xsnprintf (result, result_len, "[\"%02x\"]", v);
8363 xsnprintf (result, result_len, "[\"%04x\"]", v);
8369 tmp = strstr (name, "__");
8371 tmp = strstr (name, "$");
8374 GROW_VECT (result, result_len, tmp - name + 1);
8375 strncpy (result, name, tmp - name);
8376 result[tmp - name] = '\0';
8384 /* Evaluate the subexpression of EXP starting at *POS as for
8385 evaluate_type, updating *POS to point just past the evaluated
8388 static struct value *
8389 evaluate_subexp_type (struct expression *exp, int *pos)
8391 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8394 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8397 static struct value *
8398 unwrap_value (struct value *val)
8400 struct type *type = ada_check_typedef (value_type (val));
8402 if (ada_is_aligner_type (type))
8404 struct value *v = ada_value_struct_elt (val, "F", 0);
8405 struct type *val_type = ada_check_typedef (value_type (v));
8407 if (ada_type_name (val_type) == NULL)
8408 TYPE_NAME (val_type) = ada_type_name (type);
8410 return unwrap_value (v);
8414 struct type *raw_real_type =
8415 ada_check_typedef (ada_get_base_type (type));
8417 /* If there is no parallel XVS or XVE type, then the value is
8418 already unwrapped. Return it without further modification. */
8419 if ((type == raw_real_type)
8420 && ada_find_parallel_type (type, "___XVE") == NULL)
8424 coerce_unspec_val_to_type
8425 (val, ada_to_fixed_type (raw_real_type, 0,
8426 value_address (val),
8431 static struct value *
8432 cast_to_fixed (struct type *type, struct value *arg)
8436 if (type == value_type (arg))
8438 else if (ada_is_fixed_point_type (value_type (arg)))
8439 val = ada_float_to_fixed (type,
8440 ada_fixed_to_float (value_type (arg),
8441 value_as_long (arg)));
8444 DOUBLEST argd = value_as_double (arg);
8446 val = ada_float_to_fixed (type, argd);
8449 return value_from_longest (type, val);
8452 static struct value *
8453 cast_from_fixed (struct type *type, struct value *arg)
8455 DOUBLEST val = ada_fixed_to_float (value_type (arg),
8456 value_as_long (arg));
8458 return value_from_double (type, val);
8461 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8462 return the converted value. */
8464 static struct value *
8465 coerce_for_assign (struct type *type, struct value *val)
8467 struct type *type2 = value_type (val);
8472 type2 = ada_check_typedef (type2);
8473 type = ada_check_typedef (type);
8475 if (TYPE_CODE (type2) == TYPE_CODE_PTR
8476 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8478 val = ada_value_ind (val);
8479 type2 = value_type (val);
8482 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
8483 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8485 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
8486 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8487 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
8488 error (_("Incompatible types in assignment"));
8489 deprecated_set_value_type (val, type);
8494 static struct value *
8495 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
8498 struct type *type1, *type2;
8501 arg1 = coerce_ref (arg1);
8502 arg2 = coerce_ref (arg2);
8503 type1 = base_type (ada_check_typedef (value_type (arg1)));
8504 type2 = base_type (ada_check_typedef (value_type (arg2)));
8506 if (TYPE_CODE (type1) != TYPE_CODE_INT
8507 || TYPE_CODE (type2) != TYPE_CODE_INT)
8508 return value_binop (arg1, arg2, op);
8517 return value_binop (arg1, arg2, op);
8520 v2 = value_as_long (arg2);
8522 error (_("second operand of %s must not be zero."), op_string (op));
8524 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
8525 return value_binop (arg1, arg2, op);
8527 v1 = value_as_long (arg1);
8532 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
8533 v += v > 0 ? -1 : 1;
8541 /* Should not reach this point. */
8545 val = allocate_value (type1);
8546 store_unsigned_integer (value_contents_raw (val),
8547 TYPE_LENGTH (value_type (val)),
8548 gdbarch_byte_order (get_type_arch (type1)), v);
8553 ada_value_equal (struct value *arg1, struct value *arg2)
8555 if (ada_is_direct_array_type (value_type (arg1))
8556 || ada_is_direct_array_type (value_type (arg2)))
8558 /* Automatically dereference any array reference before
8559 we attempt to perform the comparison. */
8560 arg1 = ada_coerce_ref (arg1);
8561 arg2 = ada_coerce_ref (arg2);
8563 arg1 = ada_coerce_to_simple_array (arg1);
8564 arg2 = ada_coerce_to_simple_array (arg2);
8565 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
8566 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
8567 error (_("Attempt to compare array with non-array"));
8568 /* FIXME: The following works only for types whose
8569 representations use all bits (no padding or undefined bits)
8570 and do not have user-defined equality. */
8572 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
8573 && memcmp (value_contents (arg1), value_contents (arg2),
8574 TYPE_LENGTH (value_type (arg1))) == 0;
8576 return value_equal (arg1, arg2);
8579 /* Total number of component associations in the aggregate starting at
8580 index PC in EXP. Assumes that index PC is the start of an
8584 num_component_specs (struct expression *exp, int pc)
8588 m = exp->elts[pc + 1].longconst;
8591 for (i = 0; i < m; i += 1)
8593 switch (exp->elts[pc].opcode)
8599 n += exp->elts[pc + 1].longconst;
8602 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8607 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8608 component of LHS (a simple array or a record), updating *POS past
8609 the expression, assuming that LHS is contained in CONTAINER. Does
8610 not modify the inferior's memory, nor does it modify LHS (unless
8611 LHS == CONTAINER). */
8614 assign_component (struct value *container, struct value *lhs, LONGEST index,
8615 struct expression *exp, int *pos)
8617 struct value *mark = value_mark ();
8620 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8622 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
8623 struct value *index_val = value_from_longest (index_type, index);
8625 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8629 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
8630 elt = ada_to_fixed_value (unwrap_value (elt));
8633 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8634 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8636 value_assign_to_component (container, elt,
8637 ada_evaluate_subexp (NULL, exp, pos,
8640 value_free_to_mark (mark);
8643 /* Assuming that LHS represents an lvalue having a record or array
8644 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8645 of that aggregate's value to LHS, advancing *POS past the
8646 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8647 lvalue containing LHS (possibly LHS itself). Does not modify
8648 the inferior's memory, nor does it modify the contents of
8649 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8651 static struct value *
8652 assign_aggregate (struct value *container,
8653 struct value *lhs, struct expression *exp,
8654 int *pos, enum noside noside)
8656 struct type *lhs_type;
8657 int n = exp->elts[*pos+1].longconst;
8658 LONGEST low_index, high_index;
8661 int max_indices, num_indices;
8662 int is_array_aggregate;
8666 if (noside != EVAL_NORMAL)
8670 for (i = 0; i < n; i += 1)
8671 ada_evaluate_subexp (NULL, exp, pos, noside);
8675 container = ada_coerce_ref (container);
8676 if (ada_is_direct_array_type (value_type (container)))
8677 container = ada_coerce_to_simple_array (container);
8678 lhs = ada_coerce_ref (lhs);
8679 if (!deprecated_value_modifiable (lhs))
8680 error (_("Left operand of assignment is not a modifiable lvalue."));
8682 lhs_type = value_type (lhs);
8683 if (ada_is_direct_array_type (lhs_type))
8685 lhs = ada_coerce_to_simple_array (lhs);
8686 lhs_type = value_type (lhs);
8687 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8688 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8689 is_array_aggregate = 1;
8691 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8694 high_index = num_visible_fields (lhs_type) - 1;
8695 is_array_aggregate = 0;
8698 error (_("Left-hand side must be array or record."));
8700 num_specs = num_component_specs (exp, *pos - 3);
8701 max_indices = 4 * num_specs + 4;
8702 indices = alloca (max_indices * sizeof (indices[0]));
8703 indices[0] = indices[1] = low_index - 1;
8704 indices[2] = indices[3] = high_index + 1;
8707 for (i = 0; i < n; i += 1)
8709 switch (exp->elts[*pos].opcode)
8712 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8713 &num_indices, max_indices,
8714 low_index, high_index);
8717 aggregate_assign_positional (container, lhs, exp, pos, indices,
8718 &num_indices, max_indices,
8719 low_index, high_index);
8723 error (_("Misplaced 'others' clause"));
8724 aggregate_assign_others (container, lhs, exp, pos, indices,
8725 num_indices, low_index, high_index);
8728 error (_("Internal error: bad aggregate clause"));
8735 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8736 construct at *POS, updating *POS past the construct, given that
8737 the positions are relative to lower bound LOW, where HIGH is the
8738 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8739 updating *NUM_INDICES as needed. CONTAINER is as for
8740 assign_aggregate. */
8742 aggregate_assign_positional (struct value *container,
8743 struct value *lhs, struct expression *exp,
8744 int *pos, LONGEST *indices, int *num_indices,
8745 int max_indices, LONGEST low, LONGEST high)
8747 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8749 if (ind - 1 == high)
8750 warning (_("Extra components in aggregate ignored."));
8753 add_component_interval (ind, ind, indices, num_indices, max_indices);
8755 assign_component (container, lhs, ind, exp, pos);
8758 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8761 /* Assign into the components of LHS indexed by the OP_CHOICES
8762 construct at *POS, updating *POS past the construct, given that
8763 the allowable indices are LOW..HIGH. Record the indices assigned
8764 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8765 needed. CONTAINER is as for assign_aggregate. */
8767 aggregate_assign_from_choices (struct value *container,
8768 struct value *lhs, struct expression *exp,
8769 int *pos, LONGEST *indices, int *num_indices,
8770 int max_indices, LONGEST low, LONGEST high)
8773 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
8774 int choice_pos, expr_pc;
8775 int is_array = ada_is_direct_array_type (value_type (lhs));
8777 choice_pos = *pos += 3;
8779 for (j = 0; j < n_choices; j += 1)
8780 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8782 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8784 for (j = 0; j < n_choices; j += 1)
8786 LONGEST lower, upper;
8787 enum exp_opcode op = exp->elts[choice_pos].opcode;
8789 if (op == OP_DISCRETE_RANGE)
8792 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8794 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8799 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8811 name = &exp->elts[choice_pos + 2].string;
8814 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8817 error (_("Invalid record component association."));
8819 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8821 if (! find_struct_field (name, value_type (lhs), 0,
8822 NULL, NULL, NULL, NULL, &ind))
8823 error (_("Unknown component name: %s."), name);
8824 lower = upper = ind;
8827 if (lower <= upper && (lower < low || upper > high))
8828 error (_("Index in component association out of bounds."));
8830 add_component_interval (lower, upper, indices, num_indices,
8832 while (lower <= upper)
8837 assign_component (container, lhs, lower, exp, &pos1);
8843 /* Assign the value of the expression in the OP_OTHERS construct in
8844 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8845 have not been previously assigned. The index intervals already assigned
8846 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8847 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
8849 aggregate_assign_others (struct value *container,
8850 struct value *lhs, struct expression *exp,
8851 int *pos, LONGEST *indices, int num_indices,
8852 LONGEST low, LONGEST high)
8855 int expr_pc = *pos + 1;
8857 for (i = 0; i < num_indices - 2; i += 2)
8861 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8866 assign_component (container, lhs, ind, exp, &localpos);
8869 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8872 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8873 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8874 modifying *SIZE as needed. It is an error if *SIZE exceeds
8875 MAX_SIZE. The resulting intervals do not overlap. */
8877 add_component_interval (LONGEST low, LONGEST high,
8878 LONGEST* indices, int *size, int max_size)
8882 for (i = 0; i < *size; i += 2) {
8883 if (high >= indices[i] && low <= indices[i + 1])
8887 for (kh = i + 2; kh < *size; kh += 2)
8888 if (high < indices[kh])
8890 if (low < indices[i])
8892 indices[i + 1] = indices[kh - 1];
8893 if (high > indices[i + 1])
8894 indices[i + 1] = high;
8895 memcpy (indices + i + 2, indices + kh, *size - kh);
8896 *size -= kh - i - 2;
8899 else if (high < indices[i])
8903 if (*size == max_size)
8904 error (_("Internal error: miscounted aggregate components."));
8906 for (j = *size-1; j >= i+2; j -= 1)
8907 indices[j] = indices[j - 2];
8909 indices[i + 1] = high;
8912 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8915 static struct value *
8916 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8918 if (type == ada_check_typedef (value_type (arg2)))
8921 if (ada_is_fixed_point_type (type))
8922 return (cast_to_fixed (type, arg2));
8924 if (ada_is_fixed_point_type (value_type (arg2)))
8925 return cast_from_fixed (type, arg2);
8927 return value_cast (type, arg2);
8930 /* Evaluating Ada expressions, and printing their result.
8931 ------------------------------------------------------
8936 We usually evaluate an Ada expression in order to print its value.
8937 We also evaluate an expression in order to print its type, which
8938 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8939 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8940 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8941 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8944 Evaluating expressions is a little more complicated for Ada entities
8945 than it is for entities in languages such as C. The main reason for
8946 this is that Ada provides types whose definition might be dynamic.
8947 One example of such types is variant records. Or another example
8948 would be an array whose bounds can only be known at run time.
8950 The following description is a general guide as to what should be
8951 done (and what should NOT be done) in order to evaluate an expression
8952 involving such types, and when. This does not cover how the semantic
8953 information is encoded by GNAT as this is covered separatly. For the
8954 document used as the reference for the GNAT encoding, see exp_dbug.ads
8955 in the GNAT sources.
8957 Ideally, we should embed each part of this description next to its
8958 associated code. Unfortunately, the amount of code is so vast right
8959 now that it's hard to see whether the code handling a particular
8960 situation might be duplicated or not. One day, when the code is
8961 cleaned up, this guide might become redundant with the comments
8962 inserted in the code, and we might want to remove it.
8964 2. ``Fixing'' an Entity, the Simple Case:
8965 -----------------------------------------
8967 When evaluating Ada expressions, the tricky issue is that they may
8968 reference entities whose type contents and size are not statically
8969 known. Consider for instance a variant record:
8971 type Rec (Empty : Boolean := True) is record
8974 when False => Value : Integer;
8977 Yes : Rec := (Empty => False, Value => 1);
8978 No : Rec := (empty => True);
8980 The size and contents of that record depends on the value of the
8981 descriminant (Rec.Empty). At this point, neither the debugging
8982 information nor the associated type structure in GDB are able to
8983 express such dynamic types. So what the debugger does is to create
8984 "fixed" versions of the type that applies to the specific object.
8985 We also informally refer to this opperation as "fixing" an object,
8986 which means creating its associated fixed type.
8988 Example: when printing the value of variable "Yes" above, its fixed
8989 type would look like this:
8996 On the other hand, if we printed the value of "No", its fixed type
9003 Things become a little more complicated when trying to fix an entity
9004 with a dynamic type that directly contains another dynamic type,
9005 such as an array of variant records, for instance. There are
9006 two possible cases: Arrays, and records.
9008 3. ``Fixing'' Arrays:
9009 ---------------------
9011 The type structure in GDB describes an array in terms of its bounds,
9012 and the type of its elements. By design, all elements in the array
9013 have the same type and we cannot represent an array of variant elements
9014 using the current type structure in GDB. When fixing an array,
9015 we cannot fix the array element, as we would potentially need one
9016 fixed type per element of the array. As a result, the best we can do
9017 when fixing an array is to produce an array whose bounds and size
9018 are correct (allowing us to read it from memory), but without having
9019 touched its element type. Fixing each element will be done later,
9020 when (if) necessary.
9022 Arrays are a little simpler to handle than records, because the same
9023 amount of memory is allocated for each element of the array, even if
9024 the amount of space actually used by each element differs from element
9025 to element. Consider for instance the following array of type Rec:
9027 type Rec_Array is array (1 .. 2) of Rec;
9029 The actual amount of memory occupied by each element might be different
9030 from element to element, depending on the value of their discriminant.
9031 But the amount of space reserved for each element in the array remains
9032 fixed regardless. So we simply need to compute that size using
9033 the debugging information available, from which we can then determine
9034 the array size (we multiply the number of elements of the array by
9035 the size of each element).
9037 The simplest case is when we have an array of a constrained element
9038 type. For instance, consider the following type declarations:
9040 type Bounded_String (Max_Size : Integer) is
9042 Buffer : String (1 .. Max_Size);
9044 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9046 In this case, the compiler describes the array as an array of
9047 variable-size elements (identified by its XVS suffix) for which
9048 the size can be read in the parallel XVZ variable.
9050 In the case of an array of an unconstrained element type, the compiler
9051 wraps the array element inside a private PAD type. This type should not
9052 be shown to the user, and must be "unwrap"'ed before printing. Note
9053 that we also use the adjective "aligner" in our code to designate
9054 these wrapper types.
9056 In some cases, the size allocated for each element is statically
9057 known. In that case, the PAD type already has the correct size,
9058 and the array element should remain unfixed.
9060 But there are cases when this size is not statically known.
9061 For instance, assuming that "Five" is an integer variable:
9063 type Dynamic is array (1 .. Five) of Integer;
9064 type Wrapper (Has_Length : Boolean := False) is record
9067 when True => Length : Integer;
9071 type Wrapper_Array is array (1 .. 2) of Wrapper;
9073 Hello : Wrapper_Array := (others => (Has_Length => True,
9074 Data => (others => 17),
9078 The debugging info would describe variable Hello as being an
9079 array of a PAD type. The size of that PAD type is not statically
9080 known, but can be determined using a parallel XVZ variable.
9081 In that case, a copy of the PAD type with the correct size should
9082 be used for the fixed array.
9084 3. ``Fixing'' record type objects:
9085 ----------------------------------
9087 Things are slightly different from arrays in the case of dynamic
9088 record types. In this case, in order to compute the associated
9089 fixed type, we need to determine the size and offset of each of
9090 its components. This, in turn, requires us to compute the fixed
9091 type of each of these components.
9093 Consider for instance the example:
9095 type Bounded_String (Max_Size : Natural) is record
9096 Str : String (1 .. Max_Size);
9099 My_String : Bounded_String (Max_Size => 10);
9101 In that case, the position of field "Length" depends on the size
9102 of field Str, which itself depends on the value of the Max_Size
9103 discriminant. In order to fix the type of variable My_String,
9104 we need to fix the type of field Str. Therefore, fixing a variant
9105 record requires us to fix each of its components.
9107 However, if a component does not have a dynamic size, the component
9108 should not be fixed. In particular, fields that use a PAD type
9109 should not fixed. Here is an example where this might happen
9110 (assuming type Rec above):
9112 type Container (Big : Boolean) is record
9116 when True => Another : Integer;
9120 My_Container : Container := (Big => False,
9121 First => (Empty => True),
9124 In that example, the compiler creates a PAD type for component First,
9125 whose size is constant, and then positions the component After just
9126 right after it. The offset of component After is therefore constant
9129 The debugger computes the position of each field based on an algorithm
9130 that uses, among other things, the actual position and size of the field
9131 preceding it. Let's now imagine that the user is trying to print
9132 the value of My_Container. If the type fixing was recursive, we would
9133 end up computing the offset of field After based on the size of the
9134 fixed version of field First. And since in our example First has
9135 only one actual field, the size of the fixed type is actually smaller
9136 than the amount of space allocated to that field, and thus we would
9137 compute the wrong offset of field After.
9139 To make things more complicated, we need to watch out for dynamic
9140 components of variant records (identified by the ___XVL suffix in
9141 the component name). Even if the target type is a PAD type, the size
9142 of that type might not be statically known. So the PAD type needs
9143 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9144 we might end up with the wrong size for our component. This can be
9145 observed with the following type declarations:
9147 type Octal is new Integer range 0 .. 7;
9148 type Octal_Array is array (Positive range <>) of Octal;
9149 pragma Pack (Octal_Array);
9151 type Octal_Buffer (Size : Positive) is record
9152 Buffer : Octal_Array (1 .. Size);
9156 In that case, Buffer is a PAD type whose size is unset and needs
9157 to be computed by fixing the unwrapped type.
9159 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9160 ----------------------------------------------------------
9162 Lastly, when should the sub-elements of an entity that remained unfixed
9163 thus far, be actually fixed?
9165 The answer is: Only when referencing that element. For instance
9166 when selecting one component of a record, this specific component
9167 should be fixed at that point in time. Or when printing the value
9168 of a record, each component should be fixed before its value gets
9169 printed. Similarly for arrays, the element of the array should be
9170 fixed when printing each element of the array, or when extracting
9171 one element out of that array. On the other hand, fixing should
9172 not be performed on the elements when taking a slice of an array!
9174 Note that one of the side-effects of miscomputing the offset and
9175 size of each field is that we end up also miscomputing the size
9176 of the containing type. This can have adverse results when computing
9177 the value of an entity. GDB fetches the value of an entity based
9178 on the size of its type, and thus a wrong size causes GDB to fetch
9179 the wrong amount of memory. In the case where the computed size is
9180 too small, GDB fetches too little data to print the value of our
9181 entiry. Results in this case as unpredicatble, as we usually read
9182 past the buffer containing the data =:-o. */
9184 /* Implement the evaluate_exp routine in the exp_descriptor structure
9185 for the Ada language. */
9187 static struct value *
9188 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
9189 int *pos, enum noside noside)
9194 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
9197 struct value **argvec;
9201 op = exp->elts[pc].opcode;
9207 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9208 arg1 = unwrap_value (arg1);
9210 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9211 then we need to perform the conversion manually, because
9212 evaluate_subexp_standard doesn't do it. This conversion is
9213 necessary in Ada because the different kinds of float/fixed
9214 types in Ada have different representations.
9216 Similarly, we need to perform the conversion from OP_LONG
9218 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
9219 arg1 = ada_value_cast (expect_type, arg1, noside);
9225 struct value *result;
9228 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
9229 /* The result type will have code OP_STRING, bashed there from
9230 OP_ARRAY. Bash it back. */
9231 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
9232 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
9238 type = exp->elts[pc + 1].type;
9239 arg1 = evaluate_subexp (type, exp, pos, noside);
9240 if (noside == EVAL_SKIP)
9242 arg1 = ada_value_cast (type, arg1, noside);
9247 type = exp->elts[pc + 1].type;
9248 return ada_evaluate_subexp (type, exp, pos, noside);
9251 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9252 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9254 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
9255 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9257 return ada_value_assign (arg1, arg1);
9259 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9260 except if the lhs of our assignment is a convenience variable.
9261 In the case of assigning to a convenience variable, the lhs
9262 should be exactly the result of the evaluation of the rhs. */
9263 type = value_type (arg1);
9264 if (VALUE_LVAL (arg1) == lval_internalvar)
9266 arg2 = evaluate_subexp (type, exp, pos, noside);
9267 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9269 if (ada_is_fixed_point_type (value_type (arg1)))
9270 arg2 = cast_to_fixed (value_type (arg1), arg2);
9271 else if (ada_is_fixed_point_type (value_type (arg2)))
9273 (_("Fixed-point values must be assigned to fixed-point variables"));
9275 arg2 = coerce_for_assign (value_type (arg1), arg2);
9276 return ada_value_assign (arg1, arg2);
9279 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9280 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9281 if (noside == EVAL_SKIP)
9283 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9284 return (value_from_longest
9286 value_as_long (arg1) + value_as_long (arg2)));
9287 if ((ada_is_fixed_point_type (value_type (arg1))
9288 || ada_is_fixed_point_type (value_type (arg2)))
9289 && value_type (arg1) != value_type (arg2))
9290 error (_("Operands of fixed-point addition must have the same type"));
9291 /* Do the addition, and cast the result to the type of the first
9292 argument. We cannot cast the result to a reference type, so if
9293 ARG1 is a reference type, find its underlying type. */
9294 type = value_type (arg1);
9295 while (TYPE_CODE (type) == TYPE_CODE_REF)
9296 type = TYPE_TARGET_TYPE (type);
9297 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9298 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
9301 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9302 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9303 if (noside == EVAL_SKIP)
9305 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9306 return (value_from_longest
9308 value_as_long (arg1) - value_as_long (arg2)));
9309 if ((ada_is_fixed_point_type (value_type (arg1))
9310 || ada_is_fixed_point_type (value_type (arg2)))
9311 && value_type (arg1) != value_type (arg2))
9312 error (_("Operands of fixed-point subtraction "
9313 "must have the same type"));
9314 /* Do the substraction, and cast the result to the type of the first
9315 argument. We cannot cast the result to a reference type, so if
9316 ARG1 is a reference type, find its underlying type. */
9317 type = value_type (arg1);
9318 while (TYPE_CODE (type) == TYPE_CODE_REF)
9319 type = TYPE_TARGET_TYPE (type);
9320 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9321 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
9327 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9328 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9329 if (noside == EVAL_SKIP)
9331 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9333 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9334 return value_zero (value_type (arg1), not_lval);
9338 type = builtin_type (exp->gdbarch)->builtin_double;
9339 if (ada_is_fixed_point_type (value_type (arg1)))
9340 arg1 = cast_from_fixed (type, arg1);
9341 if (ada_is_fixed_point_type (value_type (arg2)))
9342 arg2 = cast_from_fixed (type, arg2);
9343 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9344 return ada_value_binop (arg1, arg2, op);
9348 case BINOP_NOTEQUAL:
9349 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9350 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
9351 if (noside == EVAL_SKIP)
9353 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9357 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9358 tem = ada_value_equal (arg1, arg2);
9360 if (op == BINOP_NOTEQUAL)
9362 type = language_bool_type (exp->language_defn, exp->gdbarch);
9363 return value_from_longest (type, (LONGEST) tem);
9366 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9367 if (noside == EVAL_SKIP)
9369 else if (ada_is_fixed_point_type (value_type (arg1)))
9370 return value_cast (value_type (arg1), value_neg (arg1));
9373 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9374 return value_neg (arg1);
9377 case BINOP_LOGICAL_AND:
9378 case BINOP_LOGICAL_OR:
9379 case UNOP_LOGICAL_NOT:
9384 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9385 type = language_bool_type (exp->language_defn, exp->gdbarch);
9386 return value_cast (type, val);
9389 case BINOP_BITWISE_AND:
9390 case BINOP_BITWISE_IOR:
9391 case BINOP_BITWISE_XOR:
9395 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9397 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9399 return value_cast (value_type (arg1), val);
9405 if (noside == EVAL_SKIP)
9410 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
9411 /* Only encountered when an unresolved symbol occurs in a
9412 context other than a function call, in which case, it is
9414 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9415 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
9416 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9418 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
9419 /* Check to see if this is a tagged type. We also need to handle
9420 the case where the type is a reference to a tagged type, but
9421 we have to be careful to exclude pointers to tagged types.
9422 The latter should be shown as usual (as a pointer), whereas
9423 a reference should mostly be transparent to the user. */
9424 if (ada_is_tagged_type (type, 0)
9425 || (TYPE_CODE(type) == TYPE_CODE_REF
9426 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
9428 /* Tagged types are a little special in the fact that the real
9429 type is dynamic and can only be determined by inspecting the
9430 object's tag. This means that we need to get the object's
9431 value first (EVAL_NORMAL) and then extract the actual object
9434 Note that we cannot skip the final step where we extract
9435 the object type from its tag, because the EVAL_NORMAL phase
9436 results in dynamic components being resolved into fixed ones.
9437 This can cause problems when trying to print the type
9438 description of tagged types whose parent has a dynamic size:
9439 We use the type name of the "_parent" component in order
9440 to print the name of the ancestor type in the type description.
9441 If that component had a dynamic size, the resolution into
9442 a fixed type would result in the loss of that type name,
9443 thus preventing us from printing the name of the ancestor
9444 type in the type description. */
9445 struct type *actual_type;
9447 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
9448 actual_type = type_from_tag (ada_value_tag (arg1));
9449 if (actual_type == NULL)
9450 /* If, for some reason, we were unable to determine
9451 the actual type from the tag, then use the static
9452 approximation that we just computed as a fallback.
9453 This can happen if the debugging information is
9454 incomplete, for instance. */
9457 return value_zero (actual_type, not_lval);
9462 (to_static_fixed_type
9463 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
9468 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9469 arg1 = unwrap_value (arg1);
9470 return ada_to_fixed_value (arg1);
9476 /* Allocate arg vector, including space for the function to be
9477 called in argvec[0] and a terminating NULL. */
9478 nargs = longest_to_int (exp->elts[pc + 1].longconst);
9480 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
9482 if (exp->elts[*pos].opcode == OP_VAR_VALUE
9483 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
9484 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9485 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
9488 for (tem = 0; tem <= nargs; tem += 1)
9489 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9492 if (noside == EVAL_SKIP)
9496 if (ada_is_constrained_packed_array_type
9497 (desc_base_type (value_type (argvec[0]))))
9498 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
9499 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9500 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
9501 /* This is a packed array that has already been fixed, and
9502 therefore already coerced to a simple array. Nothing further
9505 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
9506 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9507 && VALUE_LVAL (argvec[0]) == lval_memory))
9508 argvec[0] = value_addr (argvec[0]);
9510 type = ada_check_typedef (value_type (argvec[0]));
9512 /* Ada allows us to implicitly dereference arrays when subscripting
9513 them. So, if this is an array typedef (encoding use for array
9514 access types encoded as fat pointers), strip it now. */
9515 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
9516 type = ada_typedef_target_type (type);
9518 if (TYPE_CODE (type) == TYPE_CODE_PTR)
9520 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
9522 case TYPE_CODE_FUNC:
9523 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9525 case TYPE_CODE_ARRAY:
9527 case TYPE_CODE_STRUCT:
9528 if (noside != EVAL_AVOID_SIDE_EFFECTS)
9529 argvec[0] = ada_value_ind (argvec[0]);
9530 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9533 error (_("cannot subscript or call something of type `%s'"),
9534 ada_type_name (value_type (argvec[0])));
9539 switch (TYPE_CODE (type))
9541 case TYPE_CODE_FUNC:
9542 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9543 return allocate_value (TYPE_TARGET_TYPE (type));
9544 return call_function_by_hand (argvec[0], nargs, argvec + 1);
9545 case TYPE_CODE_STRUCT:
9549 arity = ada_array_arity (type);
9550 type = ada_array_element_type (type, nargs);
9552 error (_("cannot subscript or call a record"));
9554 error (_("wrong number of subscripts; expecting %d"), arity);
9555 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9556 return value_zero (ada_aligned_type (type), lval_memory);
9558 unwrap_value (ada_value_subscript
9559 (argvec[0], nargs, argvec + 1));
9561 case TYPE_CODE_ARRAY:
9562 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9564 type = ada_array_element_type (type, nargs);
9566 error (_("element type of array unknown"));
9568 return value_zero (ada_aligned_type (type), lval_memory);
9571 unwrap_value (ada_value_subscript
9572 (ada_coerce_to_simple_array (argvec[0]),
9573 nargs, argvec + 1));
9574 case TYPE_CODE_PTR: /* Pointer to array */
9575 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
9576 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9578 type = ada_array_element_type (type, nargs);
9580 error (_("element type of array unknown"));
9582 return value_zero (ada_aligned_type (type), lval_memory);
9585 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
9586 nargs, argvec + 1));
9589 error (_("Attempt to index or call something other than an "
9590 "array or function"));
9595 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9596 struct value *low_bound_val =
9597 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9598 struct value *high_bound_val =
9599 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9603 low_bound_val = coerce_ref (low_bound_val);
9604 high_bound_val = coerce_ref (high_bound_val);
9605 low_bound = pos_atr (low_bound_val);
9606 high_bound = pos_atr (high_bound_val);
9608 if (noside == EVAL_SKIP)
9611 /* If this is a reference to an aligner type, then remove all
9613 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9614 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
9615 TYPE_TARGET_TYPE (value_type (array)) =
9616 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
9618 if (ada_is_constrained_packed_array_type (value_type (array)))
9619 error (_("cannot slice a packed array"));
9621 /* If this is a reference to an array or an array lvalue,
9622 convert to a pointer. */
9623 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9624 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
9625 && VALUE_LVAL (array) == lval_memory))
9626 array = value_addr (array);
9628 if (noside == EVAL_AVOID_SIDE_EFFECTS
9629 && ada_is_array_descriptor_type (ada_check_typedef
9630 (value_type (array))))
9631 return empty_array (ada_type_of_array (array, 0), low_bound);
9633 array = ada_coerce_to_simple_array_ptr (array);
9635 /* If we have more than one level of pointer indirection,
9636 dereference the value until we get only one level. */
9637 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
9638 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
9640 array = value_ind (array);
9642 /* Make sure we really do have an array type before going further,
9643 to avoid a SEGV when trying to get the index type or the target
9644 type later down the road if the debug info generated by
9645 the compiler is incorrect or incomplete. */
9646 if (!ada_is_simple_array_type (value_type (array)))
9647 error (_("cannot take slice of non-array"));
9649 if (TYPE_CODE (ada_check_typedef (value_type (array)))
9652 struct type *type0 = ada_check_typedef (value_type (array));
9654 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
9655 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
9658 struct type *arr_type0 =
9659 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
9661 return ada_value_slice_from_ptr (array, arr_type0,
9662 longest_to_int (low_bound),
9663 longest_to_int (high_bound));
9666 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9668 else if (high_bound < low_bound)
9669 return empty_array (value_type (array), low_bound);
9671 return ada_value_slice (array, longest_to_int (low_bound),
9672 longest_to_int (high_bound));
9677 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9678 type = check_typedef (exp->elts[pc + 1].type);
9680 if (noside == EVAL_SKIP)
9683 switch (TYPE_CODE (type))
9686 lim_warning (_("Membership test incompletely implemented; "
9687 "always returns true"));
9688 type = language_bool_type (exp->language_defn, exp->gdbarch);
9689 return value_from_longest (type, (LONGEST) 1);
9691 case TYPE_CODE_RANGE:
9692 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
9693 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
9694 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9695 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9696 type = language_bool_type (exp->language_defn, exp->gdbarch);
9698 value_from_longest (type,
9699 (value_less (arg1, arg3)
9700 || value_equal (arg1, arg3))
9701 && (value_less (arg2, arg1)
9702 || value_equal (arg2, arg1)));
9705 case BINOP_IN_BOUNDS:
9707 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9708 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9710 if (noside == EVAL_SKIP)
9713 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9715 type = language_bool_type (exp->language_defn, exp->gdbarch);
9716 return value_zero (type, not_lval);
9719 tem = longest_to_int (exp->elts[pc + 1].longconst);
9721 type = ada_index_type (value_type (arg2), tem, "range");
9723 type = value_type (arg1);
9725 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
9726 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
9728 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9729 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9730 type = language_bool_type (exp->language_defn, exp->gdbarch);
9732 value_from_longest (type,
9733 (value_less (arg1, arg3)
9734 || value_equal (arg1, arg3))
9735 && (value_less (arg2, arg1)
9736 || value_equal (arg2, arg1)));
9738 case TERNOP_IN_RANGE:
9739 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9740 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9741 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9743 if (noside == EVAL_SKIP)
9746 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9747 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9748 type = language_bool_type (exp->language_defn, exp->gdbarch);
9750 value_from_longest (type,
9751 (value_less (arg1, arg3)
9752 || value_equal (arg1, arg3))
9753 && (value_less (arg2, arg1)
9754 || value_equal (arg2, arg1)));
9760 struct type *type_arg;
9762 if (exp->elts[*pos].opcode == OP_TYPE)
9764 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9766 type_arg = check_typedef (exp->elts[pc + 2].type);
9770 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9774 if (exp->elts[*pos].opcode != OP_LONG)
9775 error (_("Invalid operand to '%s"), ada_attribute_name (op));
9776 tem = longest_to_int (exp->elts[*pos + 2].longconst);
9779 if (noside == EVAL_SKIP)
9782 if (type_arg == NULL)
9784 arg1 = ada_coerce_ref (arg1);
9786 if (ada_is_constrained_packed_array_type (value_type (arg1)))
9787 arg1 = ada_coerce_to_simple_array (arg1);
9789 type = ada_index_type (value_type (arg1), tem,
9790 ada_attribute_name (op));
9792 type = builtin_type (exp->gdbarch)->builtin_int;
9794 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9795 return allocate_value (type);
9799 default: /* Should never happen. */
9800 error (_("unexpected attribute encountered"));
9802 return value_from_longest
9803 (type, ada_array_bound (arg1, tem, 0));
9805 return value_from_longest
9806 (type, ada_array_bound (arg1, tem, 1));
9808 return value_from_longest
9809 (type, ada_array_length (arg1, tem));
9812 else if (discrete_type_p (type_arg))
9814 struct type *range_type;
9815 char *name = ada_type_name (type_arg);
9818 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
9819 range_type = to_fixed_range_type (type_arg, NULL);
9820 if (range_type == NULL)
9821 range_type = type_arg;
9825 error (_("unexpected attribute encountered"));
9827 return value_from_longest
9828 (range_type, ada_discrete_type_low_bound (range_type));
9830 return value_from_longest
9831 (range_type, ada_discrete_type_high_bound (range_type));
9833 error (_("the 'length attribute applies only to array types"));
9836 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
9837 error (_("unimplemented type attribute"));
9842 if (ada_is_constrained_packed_array_type (type_arg))
9843 type_arg = decode_constrained_packed_array_type (type_arg);
9845 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
9847 type = builtin_type (exp->gdbarch)->builtin_int;
9849 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9850 return allocate_value (type);
9855 error (_("unexpected attribute encountered"));
9857 low = ada_array_bound_from_type (type_arg, tem, 0);
9858 return value_from_longest (type, low);
9860 high = ada_array_bound_from_type (type_arg, tem, 1);
9861 return value_from_longest (type, high);
9863 low = ada_array_bound_from_type (type_arg, tem, 0);
9864 high = ada_array_bound_from_type (type_arg, tem, 1);
9865 return value_from_longest (type, high - low + 1);
9871 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9872 if (noside == EVAL_SKIP)
9875 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9876 return value_zero (ada_tag_type (arg1), not_lval);
9878 return ada_value_tag (arg1);
9882 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9883 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9884 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9885 if (noside == EVAL_SKIP)
9887 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9888 return value_zero (value_type (arg1), not_lval);
9891 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9892 return value_binop (arg1, arg2,
9893 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
9896 case OP_ATR_MODULUS:
9898 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
9900 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9901 if (noside == EVAL_SKIP)
9904 if (!ada_is_modular_type (type_arg))
9905 error (_("'modulus must be applied to modular type"));
9907 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
9908 ada_modulus (type_arg));
9913 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9914 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9915 if (noside == EVAL_SKIP)
9917 type = builtin_type (exp->gdbarch)->builtin_int;
9918 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9919 return value_zero (type, not_lval);
9921 return value_pos_atr (type, arg1);
9924 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9925 type = value_type (arg1);
9927 /* If the argument is a reference, then dereference its type, since
9928 the user is really asking for the size of the actual object,
9929 not the size of the pointer. */
9930 if (TYPE_CODE (type) == TYPE_CODE_REF)
9931 type = TYPE_TARGET_TYPE (type);
9933 if (noside == EVAL_SKIP)
9935 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9936 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
9938 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
9939 TARGET_CHAR_BIT * TYPE_LENGTH (type));
9942 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9943 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9944 type = exp->elts[pc + 2].type;
9945 if (noside == EVAL_SKIP)
9947 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9948 return value_zero (type, not_lval);
9950 return value_val_atr (type, arg1);
9953 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9954 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9955 if (noside == EVAL_SKIP)
9957 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9958 return value_zero (value_type (arg1), not_lval);
9961 /* For integer exponentiation operations,
9962 only promote the first argument. */
9963 if (is_integral_type (value_type (arg2)))
9964 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9966 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9968 return value_binop (arg1, arg2, op);
9972 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9973 if (noside == EVAL_SKIP)
9979 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9980 if (noside == EVAL_SKIP)
9982 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9983 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
9984 return value_neg (arg1);
9989 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9990 if (noside == EVAL_SKIP)
9992 type = ada_check_typedef (value_type (arg1));
9993 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9995 if (ada_is_array_descriptor_type (type))
9996 /* GDB allows dereferencing GNAT array descriptors. */
9998 struct type *arrType = ada_type_of_array (arg1, 0);
10000 if (arrType == NULL)
10001 error (_("Attempt to dereference null array pointer."));
10002 return value_at_lazy (arrType, 0);
10004 else if (TYPE_CODE (type) == TYPE_CODE_PTR
10005 || TYPE_CODE (type) == TYPE_CODE_REF
10006 /* In C you can dereference an array to get the 1st elt. */
10007 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
10009 type = to_static_fixed_type
10011 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
10013 return value_zero (type, lval_memory);
10015 else if (TYPE_CODE (type) == TYPE_CODE_INT)
10017 /* GDB allows dereferencing an int. */
10018 if (expect_type == NULL)
10019 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10024 to_static_fixed_type (ada_aligned_type (expect_type));
10025 return value_zero (expect_type, lval_memory);
10029 error (_("Attempt to take contents of a non-pointer value."));
10031 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
10032 type = ada_check_typedef (value_type (arg1));
10034 if (TYPE_CODE (type) == TYPE_CODE_INT)
10035 /* GDB allows dereferencing an int. If we were given
10036 the expect_type, then use that as the target type.
10037 Otherwise, assume that the target type is an int. */
10039 if (expect_type != NULL)
10040 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
10043 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
10044 (CORE_ADDR) value_as_address (arg1));
10047 if (ada_is_array_descriptor_type (type))
10048 /* GDB allows dereferencing GNAT array descriptors. */
10049 return ada_coerce_to_simple_array (arg1);
10051 return ada_value_ind (arg1);
10053 case STRUCTOP_STRUCT:
10054 tem = longest_to_int (exp->elts[pc + 1].longconst);
10055 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
10056 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10057 if (noside == EVAL_SKIP)
10059 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10061 struct type *type1 = value_type (arg1);
10063 if (ada_is_tagged_type (type1, 1))
10065 type = ada_lookup_struct_elt_type (type1,
10066 &exp->elts[pc + 2].string,
10069 /* In this case, we assume that the field COULD exist
10070 in some extension of the type. Return an object of
10071 "type" void, which will match any formal
10072 (see ada_type_match). */
10073 return value_zero (builtin_type (exp->gdbarch)->builtin_void,
10078 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
10081 return value_zero (ada_aligned_type (type), lval_memory);
10084 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
10085 arg1 = unwrap_value (arg1);
10086 return ada_to_fixed_value (arg1);
10089 /* The value is not supposed to be used. This is here to make it
10090 easier to accommodate expressions that contain types. */
10092 if (noside == EVAL_SKIP)
10094 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10095 return allocate_value (exp->elts[pc + 1].type);
10097 error (_("Attempt to use a type name as an expression"));
10102 case OP_DISCRETE_RANGE:
10103 case OP_POSITIONAL:
10105 if (noside == EVAL_NORMAL)
10109 error (_("Undefined name, ambiguous name, or renaming used in "
10110 "component association: %s."), &exp->elts[pc+2].string);
10112 error (_("Aggregates only allowed on the right of an assignment"));
10114 internal_error (__FILE__, __LINE__,
10115 _("aggregate apparently mangled"));
10118 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10120 for (tem = 0; tem < nargs; tem += 1)
10121 ada_evaluate_subexp (NULL, exp, pos, noside);
10126 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
10132 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10133 type name that encodes the 'small and 'delta information.
10134 Otherwise, return NULL. */
10136 static const char *
10137 fixed_type_info (struct type *type)
10139 const char *name = ada_type_name (type);
10140 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
10142 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
10144 const char *tail = strstr (name, "___XF_");
10151 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
10152 return fixed_type_info (TYPE_TARGET_TYPE (type));
10157 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10160 ada_is_fixed_point_type (struct type *type)
10162 return fixed_type_info (type) != NULL;
10165 /* Return non-zero iff TYPE represents a System.Address type. */
10168 ada_is_system_address_type (struct type *type)
10170 return (TYPE_NAME (type)
10171 && strcmp (TYPE_NAME (type), "system__address") == 0);
10174 /* Assuming that TYPE is the representation of an Ada fixed-point
10175 type, return its delta, or -1 if the type is malformed and the
10176 delta cannot be determined. */
10179 ada_delta (struct type *type)
10181 const char *encoding = fixed_type_info (type);
10184 /* Strictly speaking, num and den are encoded as integer. However,
10185 they may not fit into a long, and they will have to be converted
10186 to DOUBLEST anyway. So scan them as DOUBLEST. */
10187 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10194 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10195 factor ('SMALL value) associated with the type. */
10198 scaling_factor (struct type *type)
10200 const char *encoding = fixed_type_info (type);
10201 DOUBLEST num0, den0, num1, den1;
10204 /* Strictly speaking, num's and den's are encoded as integer. However,
10205 they may not fit into a long, and they will have to be converted
10206 to DOUBLEST anyway. So scan them as DOUBLEST. */
10207 n = sscanf (encoding,
10208 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
10209 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10210 &num0, &den0, &num1, &den1);
10215 return num1 / den1;
10217 return num0 / den0;
10221 /* Assuming that X is the representation of a value of fixed-point
10222 type TYPE, return its floating-point equivalent. */
10225 ada_fixed_to_float (struct type *type, LONGEST x)
10227 return (DOUBLEST) x *scaling_factor (type);
10230 /* The representation of a fixed-point value of type TYPE
10231 corresponding to the value X. */
10234 ada_float_to_fixed (struct type *type, DOUBLEST x)
10236 return (LONGEST) (x / scaling_factor (type) + 0.5);
10243 /* Scan STR beginning at position K for a discriminant name, and
10244 return the value of that discriminant field of DVAL in *PX. If
10245 PNEW_K is not null, put the position of the character beyond the
10246 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10247 not alter *PX and *PNEW_K if unsuccessful. */
10250 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
10253 static char *bound_buffer = NULL;
10254 static size_t bound_buffer_len = 0;
10257 struct value *bound_val;
10259 if (dval == NULL || str == NULL || str[k] == '\0')
10262 pend = strstr (str + k, "__");
10266 k += strlen (bound);
10270 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
10271 bound = bound_buffer;
10272 strncpy (bound_buffer, str + k, pend - (str + k));
10273 bound[pend - (str + k)] = '\0';
10277 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
10278 if (bound_val == NULL)
10281 *px = value_as_long (bound_val);
10282 if (pnew_k != NULL)
10287 /* Value of variable named NAME in the current environment. If
10288 no such variable found, then if ERR_MSG is null, returns 0, and
10289 otherwise causes an error with message ERR_MSG. */
10291 static struct value *
10292 get_var_value (char *name, char *err_msg)
10294 struct ada_symbol_info *syms;
10297 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
10302 if (err_msg == NULL)
10305 error (("%s"), err_msg);
10308 return value_of_variable (syms[0].sym, syms[0].block);
10311 /* Value of integer variable named NAME in the current environment. If
10312 no such variable found, returns 0, and sets *FLAG to 0. If
10313 successful, sets *FLAG to 1. */
10316 get_int_var_value (char *name, int *flag)
10318 struct value *var_val = get_var_value (name, 0);
10330 return value_as_long (var_val);
10335 /* Return a range type whose base type is that of the range type named
10336 NAME in the current environment, and whose bounds are calculated
10337 from NAME according to the GNAT range encoding conventions.
10338 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10339 corresponding range type from debug information; fall back to using it
10340 if symbol lookup fails. If a new type must be created, allocate it
10341 like ORIG_TYPE was. The bounds information, in general, is encoded
10342 in NAME, the base type given in the named range type. */
10344 static struct type *
10345 to_fixed_range_type (struct type *raw_type, struct value *dval)
10348 struct type *base_type;
10349 char *subtype_info;
10351 gdb_assert (raw_type != NULL);
10352 gdb_assert (TYPE_NAME (raw_type) != NULL);
10354 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
10355 base_type = TYPE_TARGET_TYPE (raw_type);
10357 base_type = raw_type;
10359 name = TYPE_NAME (raw_type);
10360 subtype_info = strstr (name, "___XD");
10361 if (subtype_info == NULL)
10363 LONGEST L = ada_discrete_type_low_bound (raw_type);
10364 LONGEST U = ada_discrete_type_high_bound (raw_type);
10366 if (L < INT_MIN || U > INT_MAX)
10369 return create_range_type (alloc_type_copy (raw_type), raw_type,
10370 ada_discrete_type_low_bound (raw_type),
10371 ada_discrete_type_high_bound (raw_type));
10375 static char *name_buf = NULL;
10376 static size_t name_len = 0;
10377 int prefix_len = subtype_info - name;
10383 GROW_VECT (name_buf, name_len, prefix_len + 5);
10384 strncpy (name_buf, name, prefix_len);
10385 name_buf[prefix_len] = '\0';
10388 bounds_str = strchr (subtype_info, '_');
10391 if (*subtype_info == 'L')
10393 if (!ada_scan_number (bounds_str, n, &L, &n)
10394 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
10396 if (bounds_str[n] == '_')
10398 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
10406 strcpy (name_buf + prefix_len, "___L");
10407 L = get_int_var_value (name_buf, &ok);
10410 lim_warning (_("Unknown lower bound, using 1."));
10415 if (*subtype_info == 'U')
10417 if (!ada_scan_number (bounds_str, n, &U, &n)
10418 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
10425 strcpy (name_buf + prefix_len, "___U");
10426 U = get_int_var_value (name_buf, &ok);
10429 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
10434 type = create_range_type (alloc_type_copy (raw_type), base_type, L, U);
10435 TYPE_NAME (type) = name;
10440 /* True iff NAME is the name of a range type. */
10443 ada_is_range_type_name (const char *name)
10445 return (name != NULL && strstr (name, "___XD"));
10449 /* Modular types */
10451 /* True iff TYPE is an Ada modular type. */
10454 ada_is_modular_type (struct type *type)
10456 struct type *subranged_type = base_type (type);
10458 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
10459 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
10460 && TYPE_UNSIGNED (subranged_type));
10463 /* Try to determine the lower and upper bounds of the given modular type
10464 using the type name only. Return non-zero and set L and U as the lower
10465 and upper bounds (respectively) if successful. */
10468 ada_modulus_from_name (struct type *type, ULONGEST *modulus)
10470 char *name = ada_type_name (type);
10478 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10479 we are looking for static bounds, which means an __XDLU suffix.
10480 Moreover, we know that the lower bound of modular types is always
10481 zero, so the actual suffix should start with "__XDLU_0__", and
10482 then be followed by the upper bound value. */
10483 suffix = strstr (name, "__XDLU_0__");
10484 if (suffix == NULL)
10487 if (!ada_scan_number (suffix, k, &U, NULL))
10490 *modulus = (ULONGEST) U + 1;
10494 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10497 ada_modulus (struct type *type)
10499 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
10503 /* Ada exception catchpoint support:
10504 ---------------------------------
10506 We support 3 kinds of exception catchpoints:
10507 . catchpoints on Ada exceptions
10508 . catchpoints on unhandled Ada exceptions
10509 . catchpoints on failed assertions
10511 Exceptions raised during failed assertions, or unhandled exceptions
10512 could perfectly be caught with the general catchpoint on Ada exceptions.
10513 However, we can easily differentiate these two special cases, and having
10514 the option to distinguish these two cases from the rest can be useful
10515 to zero-in on certain situations.
10517 Exception catchpoints are a specialized form of breakpoint,
10518 since they rely on inserting breakpoints inside known routines
10519 of the GNAT runtime. The implementation therefore uses a standard
10520 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10523 Support in the runtime for exception catchpoints have been changed
10524 a few times already, and these changes affect the implementation
10525 of these catchpoints. In order to be able to support several
10526 variants of the runtime, we use a sniffer that will determine
10527 the runtime variant used by the program being debugged. */
10529 /* The different types of catchpoints that we introduced for catching
10532 enum exception_catchpoint_kind
10534 ex_catch_exception,
10535 ex_catch_exception_unhandled,
10539 /* Ada's standard exceptions. */
10541 static char *standard_exc[] = {
10542 "constraint_error",
10548 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
10550 /* A structure that describes how to support exception catchpoints
10551 for a given executable. */
10553 struct exception_support_info
10555 /* The name of the symbol to break on in order to insert
10556 a catchpoint on exceptions. */
10557 const char *catch_exception_sym;
10559 /* The name of the symbol to break on in order to insert
10560 a catchpoint on unhandled exceptions. */
10561 const char *catch_exception_unhandled_sym;
10563 /* The name of the symbol to break on in order to insert
10564 a catchpoint on failed assertions. */
10565 const char *catch_assert_sym;
10567 /* Assuming that the inferior just triggered an unhandled exception
10568 catchpoint, this function is responsible for returning the address
10569 in inferior memory where the name of that exception is stored.
10570 Return zero if the address could not be computed. */
10571 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
10574 static CORE_ADDR ada_unhandled_exception_name_addr (void);
10575 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
10577 /* The following exception support info structure describes how to
10578 implement exception catchpoints with the latest version of the
10579 Ada runtime (as of 2007-03-06). */
10581 static const struct exception_support_info default_exception_support_info =
10583 "__gnat_debug_raise_exception", /* catch_exception_sym */
10584 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10585 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10586 ada_unhandled_exception_name_addr
10589 /* The following exception support info structure describes how to
10590 implement exception catchpoints with a slightly older version
10591 of the Ada runtime. */
10593 static const struct exception_support_info exception_support_info_fallback =
10595 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10596 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10597 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10598 ada_unhandled_exception_name_addr_from_raise
10601 /* For each executable, we sniff which exception info structure to use
10602 and cache it in the following global variable. */
10604 static const struct exception_support_info *exception_info = NULL;
10606 /* Inspect the Ada runtime and determine which exception info structure
10607 should be used to provide support for exception catchpoints.
10609 This function will always set exception_info, or raise an error. */
10612 ada_exception_support_info_sniffer (void)
10614 struct symbol *sym;
10616 /* If the exception info is already known, then no need to recompute it. */
10617 if (exception_info != NULL)
10620 /* Check the latest (default) exception support info. */
10621 sym = standard_lookup (default_exception_support_info.catch_exception_sym,
10625 exception_info = &default_exception_support_info;
10629 /* Try our fallback exception suport info. */
10630 sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
10634 exception_info = &exception_support_info_fallback;
10638 /* Sometimes, it is normal for us to not be able to find the routine
10639 we are looking for. This happens when the program is linked with
10640 the shared version of the GNAT runtime, and the program has not been
10641 started yet. Inform the user of these two possible causes if
10644 if (ada_update_initial_language (language_unknown) != language_ada)
10645 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10647 /* If the symbol does not exist, then check that the program is
10648 already started, to make sure that shared libraries have been
10649 loaded. If it is not started, this may mean that the symbol is
10650 in a shared library. */
10652 if (ptid_get_pid (inferior_ptid) == 0)
10653 error (_("Unable to insert catchpoint. Try to start the program first."));
10655 /* At this point, we know that we are debugging an Ada program and
10656 that the inferior has been started, but we still are not able to
10657 find the run-time symbols. That can mean that we are in
10658 configurable run time mode, or that a-except as been optimized
10659 out by the linker... In any case, at this point it is not worth
10660 supporting this feature. */
10662 error (_("Cannot insert catchpoints in this configuration."));
10665 /* An observer of "executable_changed" events.
10666 Its role is to clear certain cached values that need to be recomputed
10667 each time a new executable is loaded by GDB. */
10670 ada_executable_changed_observer (void)
10672 /* If the executable changed, then it is possible that the Ada runtime
10673 is different. So we need to invalidate the exception support info
10675 exception_info = NULL;
10678 /* True iff FRAME is very likely to be that of a function that is
10679 part of the runtime system. This is all very heuristic, but is
10680 intended to be used as advice as to what frames are uninteresting
10684 is_known_support_routine (struct frame_info *frame)
10686 struct symtab_and_line sal;
10688 enum language func_lang;
10691 /* If this code does not have any debugging information (no symtab),
10692 This cannot be any user code. */
10694 find_frame_sal (frame, &sal);
10695 if (sal.symtab == NULL)
10698 /* If there is a symtab, but the associated source file cannot be
10699 located, then assume this is not user code: Selecting a frame
10700 for which we cannot display the code would not be very helpful
10701 for the user. This should also take care of case such as VxWorks
10702 where the kernel has some debugging info provided for a few units. */
10704 if (symtab_to_fullname (sal.symtab) == NULL)
10707 /* Check the unit filename againt the Ada runtime file naming.
10708 We also check the name of the objfile against the name of some
10709 known system libraries that sometimes come with debugging info
10712 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
10714 re_comp (known_runtime_file_name_patterns[i]);
10715 if (re_exec (sal.symtab->filename))
10717 if (sal.symtab->objfile != NULL
10718 && re_exec (sal.symtab->objfile->name))
10722 /* Check whether the function is a GNAT-generated entity. */
10724 find_frame_funname (frame, &func_name, &func_lang, NULL);
10725 if (func_name == NULL)
10728 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
10730 re_comp (known_auxiliary_function_name_patterns[i]);
10731 if (re_exec (func_name))
10738 /* Find the first frame that contains debugging information and that is not
10739 part of the Ada run-time, starting from FI and moving upward. */
10742 ada_find_printable_frame (struct frame_info *fi)
10744 for (; fi != NULL; fi = get_prev_frame (fi))
10746 if (!is_known_support_routine (fi))
10755 /* Assuming that the inferior just triggered an unhandled exception
10756 catchpoint, return the address in inferior memory where the name
10757 of the exception is stored.
10759 Return zero if the address could not be computed. */
10762 ada_unhandled_exception_name_addr (void)
10764 return parse_and_eval_address ("e.full_name");
10767 /* Same as ada_unhandled_exception_name_addr, except that this function
10768 should be used when the inferior uses an older version of the runtime,
10769 where the exception name needs to be extracted from a specific frame
10770 several frames up in the callstack. */
10773 ada_unhandled_exception_name_addr_from_raise (void)
10776 struct frame_info *fi;
10778 /* To determine the name of this exception, we need to select
10779 the frame corresponding to RAISE_SYM_NAME. This frame is
10780 at least 3 levels up, so we simply skip the first 3 frames
10781 without checking the name of their associated function. */
10782 fi = get_current_frame ();
10783 for (frame_level = 0; frame_level < 3; frame_level += 1)
10785 fi = get_prev_frame (fi);
10790 enum language func_lang;
10792 find_frame_funname (fi, &func_name, &func_lang, NULL);
10793 if (func_name != NULL
10794 && strcmp (func_name, exception_info->catch_exception_sym) == 0)
10795 break; /* We found the frame we were looking for... */
10796 fi = get_prev_frame (fi);
10803 return parse_and_eval_address ("id.full_name");
10806 /* Assuming the inferior just triggered an Ada exception catchpoint
10807 (of any type), return the address in inferior memory where the name
10808 of the exception is stored, if applicable.
10810 Return zero if the address could not be computed, or if not relevant. */
10813 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
10814 struct breakpoint *b)
10818 case ex_catch_exception:
10819 return (parse_and_eval_address ("e.full_name"));
10822 case ex_catch_exception_unhandled:
10823 return exception_info->unhandled_exception_name_addr ();
10826 case ex_catch_assert:
10827 return 0; /* Exception name is not relevant in this case. */
10831 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10835 return 0; /* Should never be reached. */
10838 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10839 any error that ada_exception_name_addr_1 might cause to be thrown.
10840 When an error is intercepted, a warning with the error message is printed,
10841 and zero is returned. */
10844 ada_exception_name_addr (enum exception_catchpoint_kind ex,
10845 struct breakpoint *b)
10847 struct gdb_exception e;
10848 CORE_ADDR result = 0;
10850 TRY_CATCH (e, RETURN_MASK_ERROR)
10852 result = ada_exception_name_addr_1 (ex, b);
10857 warning (_("failed to get exception name: %s"), e.message);
10864 static struct symtab_and_line ada_exception_sal (enum exception_catchpoint_kind,
10866 const struct breakpoint_ops **);
10867 static char *ada_exception_catchpoint_cond_string (const char *excep_string);
10869 /* Ada catchpoints.
10871 In the case of catchpoints on Ada exceptions, the catchpoint will
10872 stop the target on every exception the program throws. When a user
10873 specifies the name of a specific exception, we translate this
10874 request into a condition expression (in text form), and then parse
10875 it into an expression stored in each of the catchpoint's locations.
10876 We then use this condition to check whether the exception that was
10877 raised is the one the user is interested in. If not, then the
10878 target is resumed again. We store the name of the requested
10879 exception, in order to be able to re-set the condition expression
10880 when symbols change. */
10882 /* An instance of this type is used to represent an Ada catchpoint
10883 breakpoint location. It includes a "struct bp_location" as a kind
10884 of base class; users downcast to "struct bp_location *" when
10887 struct ada_catchpoint_location
10889 /* The base class. */
10890 struct bp_location base;
10892 /* The condition that checks whether the exception that was raised
10893 is the specific exception the user specified on catchpoint
10895 struct expression *excep_cond_expr;
10898 /* Implement the DTOR method in the bp_location_ops structure for all
10899 Ada exception catchpoint kinds. */
10902 ada_catchpoint_location_dtor (struct bp_location *bl)
10904 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
10906 xfree (al->excep_cond_expr);
10909 /* The vtable to be used in Ada catchpoint locations. */
10911 static const struct bp_location_ops ada_catchpoint_location_ops =
10913 ada_catchpoint_location_dtor
10916 /* An instance of this type is used to represent an Ada catchpoint.
10917 It includes a "struct breakpoint" as a kind of base class; users
10918 downcast to "struct breakpoint *" when needed. */
10920 struct ada_catchpoint
10922 /* The base class. */
10923 struct breakpoint base;
10925 /* The name of the specific exception the user specified. */
10926 char *excep_string;
10929 /* Parse the exception condition string in the context of each of the
10930 catchpoint's locations, and store them for later evaluation. */
10933 create_excep_cond_exprs (struct ada_catchpoint *c)
10935 struct cleanup *old_chain;
10936 struct bp_location *bl;
10939 /* Nothing to do if there's no specific exception to catch. */
10940 if (c->excep_string == NULL)
10943 /* Same if there are no locations... */
10944 if (c->base.loc == NULL)
10947 /* Compute the condition expression in text form, from the specific
10948 expection we want to catch. */
10949 cond_string = ada_exception_catchpoint_cond_string (c->excep_string);
10950 old_chain = make_cleanup (xfree, cond_string);
10952 /* Iterate over all the catchpoint's locations, and parse an
10953 expression for each. */
10954 for (bl = c->base.loc; bl != NULL; bl = bl->next)
10956 struct ada_catchpoint_location *ada_loc
10957 = (struct ada_catchpoint_location *) bl;
10958 struct expression *exp = NULL;
10960 if (!bl->shlib_disabled)
10962 volatile struct gdb_exception e;
10966 TRY_CATCH (e, RETURN_MASK_ERROR)
10968 exp = parse_exp_1 (&s, block_for_pc (bl->address), 0);
10971 warning (_("failed to reevaluate internal exception condition "
10972 "for catchpoint %d: %s"),
10973 c->base.number, e.message);
10976 ada_loc->excep_cond_expr = exp;
10979 do_cleanups (old_chain);
10982 /* Implement the DTOR method in the breakpoint_ops structure for all
10983 exception catchpoint kinds. */
10986 dtor_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
10988 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
10990 xfree (c->excep_string);
10992 bkpt_breakpoint_ops.dtor (b);
10995 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
10996 structure for all exception catchpoint kinds. */
10998 static struct bp_location *
10999 allocate_location_exception (enum exception_catchpoint_kind ex,
11000 struct breakpoint *self)
11002 struct ada_catchpoint_location *loc;
11004 loc = XNEW (struct ada_catchpoint_location);
11005 init_bp_location (&loc->base, &ada_catchpoint_location_ops, self);
11006 loc->excep_cond_expr = NULL;
11010 /* Implement the RE_SET method in the breakpoint_ops structure for all
11011 exception catchpoint kinds. */
11014 re_set_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
11016 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11018 /* Call the base class's method. This updates the catchpoint's
11020 bkpt_breakpoint_ops.re_set (b);
11022 /* Reparse the exception conditional expressions. One for each
11024 create_excep_cond_exprs (c);
11027 /* Returns true if we should stop for this breakpoint hit. If the
11028 user specified a specific exception, we only want to cause a stop
11029 if the program thrown that exception. */
11032 should_stop_exception (const struct bp_location *bl)
11034 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
11035 const struct ada_catchpoint_location *ada_loc
11036 = (const struct ada_catchpoint_location *) bl;
11037 volatile struct gdb_exception ex;
11040 /* With no specific exception, should always stop. */
11041 if (c->excep_string == NULL)
11044 if (ada_loc->excep_cond_expr == NULL)
11046 /* We will have a NULL expression if back when we were creating
11047 the expressions, this location's had failed to parse. */
11052 TRY_CATCH (ex, RETURN_MASK_ALL)
11054 struct value *mark;
11056 mark = value_mark ();
11057 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr));
11058 value_free_to_mark (mark);
11061 exception_fprintf (gdb_stderr, ex,
11062 _("Error in testing exception condition:\n"));
11066 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11067 for all exception catchpoint kinds. */
11070 check_status_exception (enum exception_catchpoint_kind ex, bpstat bs)
11072 bs->stop = should_stop_exception (bs->bp_location_at);
11075 /* Implement the PRINT_IT method in the breakpoint_ops structure
11076 for all exception catchpoint kinds. */
11078 static enum print_stop_action
11079 print_it_exception (enum exception_catchpoint_kind ex, bpstat bs)
11081 struct ui_out *uiout = current_uiout;
11082 struct breakpoint *b = bs->breakpoint_at;
11084 annotate_catchpoint (b->number);
11086 if (ui_out_is_mi_like_p (uiout))
11088 ui_out_field_string (uiout, "reason",
11089 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
11090 ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition));
11093 ui_out_text (uiout,
11094 b->disposition == disp_del ? "\nTemporary catchpoint "
11095 : "\nCatchpoint ");
11096 ui_out_field_int (uiout, "bkptno", b->number);
11097 ui_out_text (uiout, ", ");
11101 case ex_catch_exception:
11102 case ex_catch_exception_unhandled:
11104 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
11105 char exception_name[256];
11109 read_memory (addr, exception_name, sizeof (exception_name) - 1);
11110 exception_name [sizeof (exception_name) - 1] = '\0';
11114 /* For some reason, we were unable to read the exception
11115 name. This could happen if the Runtime was compiled
11116 without debugging info, for instance. In that case,
11117 just replace the exception name by the generic string
11118 "exception" - it will read as "an exception" in the
11119 notification we are about to print. */
11120 memcpy (exception_name, "exception", sizeof ("exception"));
11122 /* In the case of unhandled exception breakpoints, we print
11123 the exception name as "unhandled EXCEPTION_NAME", to make
11124 it clearer to the user which kind of catchpoint just got
11125 hit. We used ui_out_text to make sure that this extra
11126 info does not pollute the exception name in the MI case. */
11127 if (ex == ex_catch_exception_unhandled)
11128 ui_out_text (uiout, "unhandled ");
11129 ui_out_field_string (uiout, "exception-name", exception_name);
11132 case ex_catch_assert:
11133 /* In this case, the name of the exception is not really
11134 important. Just print "failed assertion" to make it clearer
11135 that his program just hit an assertion-failure catchpoint.
11136 We used ui_out_text because this info does not belong in
11138 ui_out_text (uiout, "failed assertion");
11141 ui_out_text (uiout, " at ");
11142 ada_find_printable_frame (get_current_frame ());
11144 return PRINT_SRC_AND_LOC;
11147 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11148 for all exception catchpoint kinds. */
11151 print_one_exception (enum exception_catchpoint_kind ex,
11152 struct breakpoint *b, struct bp_location **last_loc)
11154 struct ui_out *uiout = current_uiout;
11155 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11156 struct value_print_options opts;
11158 get_user_print_options (&opts);
11159 if (opts.addressprint)
11161 annotate_field (4);
11162 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
11165 annotate_field (5);
11166 *last_loc = b->loc;
11169 case ex_catch_exception:
11170 if (c->excep_string != NULL)
11172 char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11174 ui_out_field_string (uiout, "what", msg);
11178 ui_out_field_string (uiout, "what", "all Ada exceptions");
11182 case ex_catch_exception_unhandled:
11183 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
11186 case ex_catch_assert:
11187 ui_out_field_string (uiout, "what", "failed Ada assertions");
11191 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11196 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11197 for all exception catchpoint kinds. */
11200 print_mention_exception (enum exception_catchpoint_kind ex,
11201 struct breakpoint *b)
11203 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11204 struct ui_out *uiout = current_uiout;
11206 ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ")
11207 : _("Catchpoint "));
11208 ui_out_field_int (uiout, "bkptno", b->number);
11209 ui_out_text (uiout, ": ");
11213 case ex_catch_exception:
11214 if (c->excep_string != NULL)
11216 char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11217 struct cleanup *old_chain = make_cleanup (xfree, info);
11219 ui_out_text (uiout, info);
11220 do_cleanups (old_chain);
11223 ui_out_text (uiout, _("all Ada exceptions"));
11226 case ex_catch_exception_unhandled:
11227 ui_out_text (uiout, _("unhandled Ada exceptions"));
11230 case ex_catch_assert:
11231 ui_out_text (uiout, _("failed Ada assertions"));
11235 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11240 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11241 for all exception catchpoint kinds. */
11244 print_recreate_exception (enum exception_catchpoint_kind ex,
11245 struct breakpoint *b, struct ui_file *fp)
11247 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11251 case ex_catch_exception:
11252 fprintf_filtered (fp, "catch exception");
11253 if (c->excep_string != NULL)
11254 fprintf_filtered (fp, " %s", c->excep_string);
11257 case ex_catch_exception_unhandled:
11258 fprintf_filtered (fp, "catch exception unhandled");
11261 case ex_catch_assert:
11262 fprintf_filtered (fp, "catch assert");
11266 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11268 print_recreate_thread (b, fp);
11271 /* Virtual table for "catch exception" breakpoints. */
11274 dtor_catch_exception (struct breakpoint *b)
11276 dtor_exception (ex_catch_exception, b);
11279 static struct bp_location *
11280 allocate_location_catch_exception (struct breakpoint *self)
11282 return allocate_location_exception (ex_catch_exception, self);
11286 re_set_catch_exception (struct breakpoint *b)
11288 re_set_exception (ex_catch_exception, b);
11292 check_status_catch_exception (bpstat bs)
11294 check_status_exception (ex_catch_exception, bs);
11297 static enum print_stop_action
11298 print_it_catch_exception (bpstat bs)
11300 return print_it_exception (ex_catch_exception, bs);
11304 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
11306 print_one_exception (ex_catch_exception, b, last_loc);
11310 print_mention_catch_exception (struct breakpoint *b)
11312 print_mention_exception (ex_catch_exception, b);
11316 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
11318 print_recreate_exception (ex_catch_exception, b, fp);
11321 static struct breakpoint_ops catch_exception_breakpoint_ops;
11323 /* Virtual table for "catch exception unhandled" breakpoints. */
11326 dtor_catch_exception_unhandled (struct breakpoint *b)
11328 dtor_exception (ex_catch_exception_unhandled, b);
11331 static struct bp_location *
11332 allocate_location_catch_exception_unhandled (struct breakpoint *self)
11334 return allocate_location_exception (ex_catch_exception_unhandled, self);
11338 re_set_catch_exception_unhandled (struct breakpoint *b)
11340 re_set_exception (ex_catch_exception_unhandled, b);
11344 check_status_catch_exception_unhandled (bpstat bs)
11346 check_status_exception (ex_catch_exception_unhandled, bs);
11349 static enum print_stop_action
11350 print_it_catch_exception_unhandled (bpstat bs)
11352 return print_it_exception (ex_catch_exception_unhandled, bs);
11356 print_one_catch_exception_unhandled (struct breakpoint *b,
11357 struct bp_location **last_loc)
11359 print_one_exception (ex_catch_exception_unhandled, b, last_loc);
11363 print_mention_catch_exception_unhandled (struct breakpoint *b)
11365 print_mention_exception (ex_catch_exception_unhandled, b);
11369 print_recreate_catch_exception_unhandled (struct breakpoint *b,
11370 struct ui_file *fp)
11372 print_recreate_exception (ex_catch_exception_unhandled, b, fp);
11375 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
11377 /* Virtual table for "catch assert" breakpoints. */
11380 dtor_catch_assert (struct breakpoint *b)
11382 dtor_exception (ex_catch_assert, b);
11385 static struct bp_location *
11386 allocate_location_catch_assert (struct breakpoint *self)
11388 return allocate_location_exception (ex_catch_assert, self);
11392 re_set_catch_assert (struct breakpoint *b)
11394 return re_set_exception (ex_catch_assert, b);
11398 check_status_catch_assert (bpstat bs)
11400 check_status_exception (ex_catch_assert, bs);
11403 static enum print_stop_action
11404 print_it_catch_assert (bpstat bs)
11406 return print_it_exception (ex_catch_assert, bs);
11410 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
11412 print_one_exception (ex_catch_assert, b, last_loc);
11416 print_mention_catch_assert (struct breakpoint *b)
11418 print_mention_exception (ex_catch_assert, b);
11422 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
11424 print_recreate_exception (ex_catch_assert, b, fp);
11427 static struct breakpoint_ops catch_assert_breakpoint_ops;
11429 /* Return a newly allocated copy of the first space-separated token
11430 in ARGSP, and then adjust ARGSP to point immediately after that
11433 Return NULL if ARGPS does not contain any more tokens. */
11436 ada_get_next_arg (char **argsp)
11438 char *args = *argsp;
11442 /* Skip any leading white space. */
11444 while (isspace (*args))
11447 if (args[0] == '\0')
11448 return NULL; /* No more arguments. */
11450 /* Find the end of the current argument. */
11453 while (*end != '\0' && !isspace (*end))
11456 /* Adjust ARGSP to point to the start of the next argument. */
11460 /* Make a copy of the current argument and return it. */
11462 result = xmalloc (end - args + 1);
11463 strncpy (result, args, end - args);
11464 result[end - args] = '\0';
11469 /* Split the arguments specified in a "catch exception" command.
11470 Set EX to the appropriate catchpoint type.
11471 Set EXCEP_STRING to the name of the specific exception if
11472 specified by the user. */
11475 catch_ada_exception_command_split (char *args,
11476 enum exception_catchpoint_kind *ex,
11477 char **excep_string)
11479 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
11480 char *exception_name;
11482 exception_name = ada_get_next_arg (&args);
11483 make_cleanup (xfree, exception_name);
11485 /* Check that we do not have any more arguments. Anything else
11488 while (isspace (*args))
11491 if (args[0] != '\0')
11492 error (_("Junk at end of expression"));
11494 discard_cleanups (old_chain);
11496 if (exception_name == NULL)
11498 /* Catch all exceptions. */
11499 *ex = ex_catch_exception;
11500 *excep_string = NULL;
11502 else if (strcmp (exception_name, "unhandled") == 0)
11504 /* Catch unhandled exceptions. */
11505 *ex = ex_catch_exception_unhandled;
11506 *excep_string = NULL;
11510 /* Catch a specific exception. */
11511 *ex = ex_catch_exception;
11512 *excep_string = exception_name;
11516 /* Return the name of the symbol on which we should break in order to
11517 implement a catchpoint of the EX kind. */
11519 static const char *
11520 ada_exception_sym_name (enum exception_catchpoint_kind ex)
11522 gdb_assert (exception_info != NULL);
11526 case ex_catch_exception:
11527 return (exception_info->catch_exception_sym);
11529 case ex_catch_exception_unhandled:
11530 return (exception_info->catch_exception_unhandled_sym);
11532 case ex_catch_assert:
11533 return (exception_info->catch_assert_sym);
11536 internal_error (__FILE__, __LINE__,
11537 _("unexpected catchpoint kind (%d)"), ex);
11541 /* Return the breakpoint ops "virtual table" used for catchpoints
11544 static const struct breakpoint_ops *
11545 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
11549 case ex_catch_exception:
11550 return (&catch_exception_breakpoint_ops);
11552 case ex_catch_exception_unhandled:
11553 return (&catch_exception_unhandled_breakpoint_ops);
11555 case ex_catch_assert:
11556 return (&catch_assert_breakpoint_ops);
11559 internal_error (__FILE__, __LINE__,
11560 _("unexpected catchpoint kind (%d)"), ex);
11564 /* Return the condition that will be used to match the current exception
11565 being raised with the exception that the user wants to catch. This
11566 assumes that this condition is used when the inferior just triggered
11567 an exception catchpoint.
11569 The string returned is a newly allocated string that needs to be
11570 deallocated later. */
11573 ada_exception_catchpoint_cond_string (const char *excep_string)
11577 /* The standard exceptions are a special case. They are defined in
11578 runtime units that have been compiled without debugging info; if
11579 EXCEP_STRING is the not-fully-qualified name of a standard
11580 exception (e.g. "constraint_error") then, during the evaluation
11581 of the condition expression, the symbol lookup on this name would
11582 *not* return this standard exception. The catchpoint condition
11583 may then be set only on user-defined exceptions which have the
11584 same not-fully-qualified name (e.g. my_package.constraint_error).
11586 To avoid this unexcepted behavior, these standard exceptions are
11587 systematically prefixed by "standard". This means that "catch
11588 exception constraint_error" is rewritten into "catch exception
11589 standard.constraint_error".
11591 If an exception named contraint_error is defined in another package of
11592 the inferior program, then the only way to specify this exception as a
11593 breakpoint condition is to use its fully-qualified named:
11594 e.g. my_package.constraint_error. */
11596 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
11598 if (strcmp (standard_exc [i], excep_string) == 0)
11600 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11604 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string);
11607 /* Return the symtab_and_line that should be used to insert an exception
11608 catchpoint of the TYPE kind.
11610 EXCEP_STRING should contain the name of a specific exception that
11611 the catchpoint should catch, or NULL otherwise.
11613 ADDR_STRING returns the name of the function where the real
11614 breakpoint that implements the catchpoints is set, depending on the
11615 type of catchpoint we need to create. */
11617 static struct symtab_and_line
11618 ada_exception_sal (enum exception_catchpoint_kind ex, char *excep_string,
11619 char **addr_string, const struct breakpoint_ops **ops)
11621 const char *sym_name;
11622 struct symbol *sym;
11623 struct symtab_and_line sal;
11625 /* First, find out which exception support info to use. */
11626 ada_exception_support_info_sniffer ();
11628 /* Then lookup the function on which we will break in order to catch
11629 the Ada exceptions requested by the user. */
11631 sym_name = ada_exception_sym_name (ex);
11632 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
11634 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11635 that should be compiled with debugging information. As a result, we
11636 expect to find that symbol in the symtabs. If we don't find it, then
11637 the target most likely does not support Ada exceptions, or we cannot
11638 insert exception breakpoints yet, because the GNAT runtime hasn't been
11641 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
11642 in such a way that no debugging information is produced for the symbol
11643 we are looking for. In this case, we could search the minimal symbols
11644 as a fall-back mechanism. This would still be operating in degraded
11645 mode, however, as we would still be missing the debugging information
11646 that is needed in order to extract the name of the exception being
11647 raised (this name is printed in the catchpoint message, and is also
11648 used when trying to catch a specific exception). We do not handle
11649 this case for now. */
11652 error (_("Unable to break on '%s' in this configuration."), sym_name);
11654 /* Make sure that the symbol we found corresponds to a function. */
11655 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
11656 error (_("Symbol \"%s\" is not a function (class = %d)"),
11657 sym_name, SYMBOL_CLASS (sym));
11659 sal = find_function_start_sal (sym, 1);
11661 /* Set ADDR_STRING. */
11663 *addr_string = xstrdup (sym_name);
11666 *ops = ada_exception_breakpoint_ops (ex);
11671 /* Parse the arguments (ARGS) of the "catch exception" command.
11673 If the user asked the catchpoint to catch only a specific
11674 exception, then save the exception name in ADDR_STRING.
11676 See ada_exception_sal for a description of all the remaining
11677 function arguments of this function. */
11679 static struct symtab_and_line
11680 ada_decode_exception_location (char *args, char **addr_string,
11681 char **excep_string,
11682 const struct breakpoint_ops **ops)
11684 enum exception_catchpoint_kind ex;
11686 catch_ada_exception_command_split (args, &ex, excep_string);
11687 return ada_exception_sal (ex, *excep_string, addr_string, ops);
11690 /* Create an Ada exception catchpoint. */
11693 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
11694 struct symtab_and_line sal,
11696 char *excep_string,
11697 const struct breakpoint_ops *ops,
11701 struct ada_catchpoint *c;
11703 c = XNEW (struct ada_catchpoint);
11704 init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string,
11705 ops, tempflag, from_tty);
11706 c->excep_string = excep_string;
11707 create_excep_cond_exprs (c);
11708 install_breakpoint (0, &c->base, 1);
11711 /* Implement the "catch exception" command. */
11714 catch_ada_exception_command (char *arg, int from_tty,
11715 struct cmd_list_element *command)
11717 struct gdbarch *gdbarch = get_current_arch ();
11719 struct symtab_and_line sal;
11720 char *addr_string = NULL;
11721 char *excep_string = NULL;
11722 const struct breakpoint_ops *ops = NULL;
11724 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
11728 sal = ada_decode_exception_location (arg, &addr_string, &excep_string, &ops);
11729 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
11730 excep_string, ops, tempflag, from_tty);
11733 static struct symtab_and_line
11734 ada_decode_assert_location (char *args, char **addr_string,
11735 const struct breakpoint_ops **ops)
11737 /* Check that no argument where provided at the end of the command. */
11741 while (isspace (*args))
11744 error (_("Junk at end of arguments."));
11747 return ada_exception_sal (ex_catch_assert, NULL, addr_string, ops);
11750 /* Implement the "catch assert" command. */
11753 catch_assert_command (char *arg, int from_tty,
11754 struct cmd_list_element *command)
11756 struct gdbarch *gdbarch = get_current_arch ();
11758 struct symtab_and_line sal;
11759 char *addr_string = NULL;
11760 const struct breakpoint_ops *ops = NULL;
11762 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
11766 sal = ada_decode_assert_location (arg, &addr_string, &ops);
11767 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
11768 NULL, ops, tempflag, from_tty);
11771 /* Information about operators given special treatment in functions
11773 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11775 #define ADA_OPERATORS \
11776 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11777 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11778 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11779 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11780 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11781 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11782 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11783 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11784 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11785 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11786 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11787 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11788 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11789 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11790 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11791 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11792 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11793 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11794 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11797 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
11800 switch (exp->elts[pc - 1].opcode)
11803 operator_length_standard (exp, pc, oplenp, argsp);
11806 #define OP_DEFN(op, len, args, binop) \
11807 case op: *oplenp = len; *argsp = args; break;
11813 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
11818 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
11823 /* Implementation of the exp_descriptor method operator_check. */
11826 ada_operator_check (struct expression *exp, int pos,
11827 int (*objfile_func) (struct objfile *objfile, void *data),
11830 const union exp_element *const elts = exp->elts;
11831 struct type *type = NULL;
11833 switch (elts[pos].opcode)
11835 case UNOP_IN_RANGE:
11837 type = elts[pos + 1].type;
11841 return operator_check_standard (exp, pos, objfile_func, data);
11844 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11846 if (type && TYPE_OBJFILE (type)
11847 && (*objfile_func) (TYPE_OBJFILE (type), data))
11854 ada_op_name (enum exp_opcode opcode)
11859 return op_name_standard (opcode);
11861 #define OP_DEFN(op, len, args, binop) case op: return #op;
11866 return "OP_AGGREGATE";
11868 return "OP_CHOICES";
11874 /* As for operator_length, but assumes PC is pointing at the first
11875 element of the operator, and gives meaningful results only for the
11876 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11879 ada_forward_operator_length (struct expression *exp, int pc,
11880 int *oplenp, int *argsp)
11882 switch (exp->elts[pc].opcode)
11885 *oplenp = *argsp = 0;
11888 #define OP_DEFN(op, len, args, binop) \
11889 case op: *oplenp = len; *argsp = args; break;
11895 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
11900 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
11906 int len = longest_to_int (exp->elts[pc + 1].longconst);
11908 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
11916 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
11918 enum exp_opcode op = exp->elts[elt].opcode;
11923 ada_forward_operator_length (exp, elt, &oplen, &nargs);
11927 /* Ada attributes ('Foo). */
11930 case OP_ATR_LENGTH:
11934 case OP_ATR_MODULUS:
11941 case UNOP_IN_RANGE:
11943 /* XXX: gdb_sprint_host_address, type_sprint */
11944 fprintf_filtered (stream, _("Type @"));
11945 gdb_print_host_address (exp->elts[pc + 1].type, stream);
11946 fprintf_filtered (stream, " (");
11947 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
11948 fprintf_filtered (stream, ")");
11950 case BINOP_IN_BOUNDS:
11951 fprintf_filtered (stream, " (%d)",
11952 longest_to_int (exp->elts[pc + 2].longconst));
11954 case TERNOP_IN_RANGE:
11959 case OP_DISCRETE_RANGE:
11960 case OP_POSITIONAL:
11967 char *name = &exp->elts[elt + 2].string;
11968 int len = longest_to_int (exp->elts[elt + 1].longconst);
11970 fprintf_filtered (stream, "Text: `%.*s'", len, name);
11975 return dump_subexp_body_standard (exp, stream, elt);
11979 for (i = 0; i < nargs; i += 1)
11980 elt = dump_subexp (exp, stream, elt);
11985 /* The Ada extension of print_subexp (q.v.). */
11988 ada_print_subexp (struct expression *exp, int *pos,
11989 struct ui_file *stream, enum precedence prec)
11991 int oplen, nargs, i;
11993 enum exp_opcode op = exp->elts[pc].opcode;
11995 ada_forward_operator_length (exp, pc, &oplen, &nargs);
12002 print_subexp_standard (exp, pos, stream, prec);
12006 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
12009 case BINOP_IN_BOUNDS:
12010 /* XXX: sprint_subexp */
12011 print_subexp (exp, pos, stream, PREC_SUFFIX);
12012 fputs_filtered (" in ", stream);
12013 print_subexp (exp, pos, stream, PREC_SUFFIX);
12014 fputs_filtered ("'range", stream);
12015 if (exp->elts[pc + 1].longconst > 1)
12016 fprintf_filtered (stream, "(%ld)",
12017 (long) exp->elts[pc + 1].longconst);
12020 case TERNOP_IN_RANGE:
12021 if (prec >= PREC_EQUAL)
12022 fputs_filtered ("(", stream);
12023 /* XXX: sprint_subexp */
12024 print_subexp (exp, pos, stream, PREC_SUFFIX);
12025 fputs_filtered (" in ", stream);
12026 print_subexp (exp, pos, stream, PREC_EQUAL);
12027 fputs_filtered (" .. ", stream);
12028 print_subexp (exp, pos, stream, PREC_EQUAL);
12029 if (prec >= PREC_EQUAL)
12030 fputs_filtered (")", stream);
12035 case OP_ATR_LENGTH:
12039 case OP_ATR_MODULUS:
12044 if (exp->elts[*pos].opcode == OP_TYPE)
12046 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
12047 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
12051 print_subexp (exp, pos, stream, PREC_SUFFIX);
12052 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
12057 for (tem = 1; tem < nargs; tem += 1)
12059 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
12060 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
12062 fputs_filtered (")", stream);
12067 type_print (exp->elts[pc + 1].type, "", stream, 0);
12068 fputs_filtered ("'(", stream);
12069 print_subexp (exp, pos, stream, PREC_PREFIX);
12070 fputs_filtered (")", stream);
12073 case UNOP_IN_RANGE:
12074 /* XXX: sprint_subexp */
12075 print_subexp (exp, pos, stream, PREC_SUFFIX);
12076 fputs_filtered (" in ", stream);
12077 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
12080 case OP_DISCRETE_RANGE:
12081 print_subexp (exp, pos, stream, PREC_SUFFIX);
12082 fputs_filtered ("..", stream);
12083 print_subexp (exp, pos, stream, PREC_SUFFIX);
12087 fputs_filtered ("others => ", stream);
12088 print_subexp (exp, pos, stream, PREC_SUFFIX);
12092 for (i = 0; i < nargs-1; i += 1)
12095 fputs_filtered ("|", stream);
12096 print_subexp (exp, pos, stream, PREC_SUFFIX);
12098 fputs_filtered (" => ", stream);
12099 print_subexp (exp, pos, stream, PREC_SUFFIX);
12102 case OP_POSITIONAL:
12103 print_subexp (exp, pos, stream, PREC_SUFFIX);
12107 fputs_filtered ("(", stream);
12108 for (i = 0; i < nargs; i += 1)
12111 fputs_filtered (", ", stream);
12112 print_subexp (exp, pos, stream, PREC_SUFFIX);
12114 fputs_filtered (")", stream);
12119 /* Table mapping opcodes into strings for printing operators
12120 and precedences of the operators. */
12122 static const struct op_print ada_op_print_tab[] = {
12123 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
12124 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
12125 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
12126 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
12127 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
12128 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
12129 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
12130 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
12131 {"<=", BINOP_LEQ, PREC_ORDER, 0},
12132 {">=", BINOP_GEQ, PREC_ORDER, 0},
12133 {">", BINOP_GTR, PREC_ORDER, 0},
12134 {"<", BINOP_LESS, PREC_ORDER, 0},
12135 {">>", BINOP_RSH, PREC_SHIFT, 0},
12136 {"<<", BINOP_LSH, PREC_SHIFT, 0},
12137 {"+", BINOP_ADD, PREC_ADD, 0},
12138 {"-", BINOP_SUB, PREC_ADD, 0},
12139 {"&", BINOP_CONCAT, PREC_ADD, 0},
12140 {"*", BINOP_MUL, PREC_MUL, 0},
12141 {"/", BINOP_DIV, PREC_MUL, 0},
12142 {"rem", BINOP_REM, PREC_MUL, 0},
12143 {"mod", BINOP_MOD, PREC_MUL, 0},
12144 {"**", BINOP_EXP, PREC_REPEAT, 0},
12145 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
12146 {"-", UNOP_NEG, PREC_PREFIX, 0},
12147 {"+", UNOP_PLUS, PREC_PREFIX, 0},
12148 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
12149 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
12150 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
12151 {".all", UNOP_IND, PREC_SUFFIX, 1},
12152 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
12153 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
12157 enum ada_primitive_types {
12158 ada_primitive_type_int,
12159 ada_primitive_type_long,
12160 ada_primitive_type_short,
12161 ada_primitive_type_char,
12162 ada_primitive_type_float,
12163 ada_primitive_type_double,
12164 ada_primitive_type_void,
12165 ada_primitive_type_long_long,
12166 ada_primitive_type_long_double,
12167 ada_primitive_type_natural,
12168 ada_primitive_type_positive,
12169 ada_primitive_type_system_address,
12170 nr_ada_primitive_types
12174 ada_language_arch_info (struct gdbarch *gdbarch,
12175 struct language_arch_info *lai)
12177 const struct builtin_type *builtin = builtin_type (gdbarch);
12179 lai->primitive_type_vector
12180 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
12183 lai->primitive_type_vector [ada_primitive_type_int]
12184 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12186 lai->primitive_type_vector [ada_primitive_type_long]
12187 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
12188 0, "long_integer");
12189 lai->primitive_type_vector [ada_primitive_type_short]
12190 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
12191 0, "short_integer");
12192 lai->string_char_type
12193 = lai->primitive_type_vector [ada_primitive_type_char]
12194 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
12195 lai->primitive_type_vector [ada_primitive_type_float]
12196 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
12198 lai->primitive_type_vector [ada_primitive_type_double]
12199 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12200 "long_float", NULL);
12201 lai->primitive_type_vector [ada_primitive_type_long_long]
12202 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
12203 0, "long_long_integer");
12204 lai->primitive_type_vector [ada_primitive_type_long_double]
12205 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12206 "long_long_float", NULL);
12207 lai->primitive_type_vector [ada_primitive_type_natural]
12208 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12210 lai->primitive_type_vector [ada_primitive_type_positive]
12211 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12213 lai->primitive_type_vector [ada_primitive_type_void]
12214 = builtin->builtin_void;
12216 lai->primitive_type_vector [ada_primitive_type_system_address]
12217 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
12218 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
12219 = "system__address";
12221 lai->bool_type_symbol = NULL;
12222 lai->bool_type_default = builtin->builtin_bool;
12225 /* Language vector */
12227 /* Not really used, but needed in the ada_language_defn. */
12230 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
12232 ada_emit_char (c, type, stream, quoter, 1);
12238 warnings_issued = 0;
12239 return ada_parse ();
12242 static const struct exp_descriptor ada_exp_descriptor = {
12244 ada_operator_length,
12245 ada_operator_check,
12247 ada_dump_subexp_body,
12248 ada_evaluate_subexp
12251 const struct language_defn ada_language_defn = {
12252 "ada", /* Language name */
12256 case_sensitive_on, /* Yes, Ada is case-insensitive, but
12257 that's not quite what this means. */
12259 macro_expansion_no,
12260 &ada_exp_descriptor,
12264 ada_printchar, /* Print a character constant */
12265 ada_printstr, /* Function to print string constant */
12266 emit_char, /* Function to print single char (not used) */
12267 ada_print_type, /* Print a type using appropriate syntax */
12268 ada_print_typedef, /* Print a typedef using appropriate syntax */
12269 ada_val_print, /* Print a value using appropriate syntax */
12270 ada_value_print, /* Print a top-level value */
12271 NULL, /* Language specific skip_trampoline */
12272 NULL, /* name_of_this */
12273 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
12274 basic_lookup_transparent_type, /* lookup_transparent_type */
12275 ada_la_decode, /* Language specific symbol demangler */
12276 NULL, /* Language specific
12277 class_name_from_physname */
12278 ada_op_print_tab, /* expression operators for printing */
12279 0, /* c-style arrays */
12280 1, /* String lower bound */
12281 ada_get_gdb_completer_word_break_characters,
12282 ada_make_symbol_completion_list,
12283 ada_language_arch_info,
12284 ada_print_array_index,
12285 default_pass_by_reference,
12290 /* Provide a prototype to silence -Wmissing-prototypes. */
12291 extern initialize_file_ftype _initialize_ada_language;
12293 /* Command-list for the "set/show ada" prefix command. */
12294 static struct cmd_list_element *set_ada_list;
12295 static struct cmd_list_element *show_ada_list;
12297 /* Implement the "set ada" prefix command. */
12300 set_ada_command (char *arg, int from_tty)
12302 printf_unfiltered (_(\
12303 "\"set ada\" must be followed by the name of a setting.\n"));
12304 help_list (set_ada_list, "set ada ", -1, gdb_stdout);
12307 /* Implement the "show ada" prefix command. */
12310 show_ada_command (char *args, int from_tty)
12312 cmd_show_list (show_ada_list, from_tty, "");
12316 initialize_ada_catchpoint_ops (void)
12318 struct breakpoint_ops *ops;
12320 initialize_breakpoint_ops ();
12322 ops = &catch_exception_breakpoint_ops;
12323 *ops = bkpt_breakpoint_ops;
12324 ops->dtor = dtor_catch_exception;
12325 ops->allocate_location = allocate_location_catch_exception;
12326 ops->re_set = re_set_catch_exception;
12327 ops->check_status = check_status_catch_exception;
12328 ops->print_it = print_it_catch_exception;
12329 ops->print_one = print_one_catch_exception;
12330 ops->print_mention = print_mention_catch_exception;
12331 ops->print_recreate = print_recreate_catch_exception;
12333 ops = &catch_exception_unhandled_breakpoint_ops;
12334 *ops = bkpt_breakpoint_ops;
12335 ops->dtor = dtor_catch_exception_unhandled;
12336 ops->allocate_location = allocate_location_catch_exception_unhandled;
12337 ops->re_set = re_set_catch_exception_unhandled;
12338 ops->check_status = check_status_catch_exception_unhandled;
12339 ops->print_it = print_it_catch_exception_unhandled;
12340 ops->print_one = print_one_catch_exception_unhandled;
12341 ops->print_mention = print_mention_catch_exception_unhandled;
12342 ops->print_recreate = print_recreate_catch_exception_unhandled;
12344 ops = &catch_assert_breakpoint_ops;
12345 *ops = bkpt_breakpoint_ops;
12346 ops->dtor = dtor_catch_assert;
12347 ops->allocate_location = allocate_location_catch_assert;
12348 ops->re_set = re_set_catch_assert;
12349 ops->check_status = check_status_catch_assert;
12350 ops->print_it = print_it_catch_assert;
12351 ops->print_one = print_one_catch_assert;
12352 ops->print_mention = print_mention_catch_assert;
12353 ops->print_recreate = print_recreate_catch_assert;
12357 _initialize_ada_language (void)
12359 add_language (&ada_language_defn);
12361 initialize_ada_catchpoint_ops ();
12363 add_prefix_cmd ("ada", no_class, set_ada_command,
12364 _("Prefix command for changing Ada-specfic settings"),
12365 &set_ada_list, "set ada ", 0, &setlist);
12367 add_prefix_cmd ("ada", no_class, show_ada_command,
12368 _("Generic command for showing Ada-specific settings."),
12369 &show_ada_list, "show ada ", 0, &showlist);
12371 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
12372 &trust_pad_over_xvs, _("\
12373 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12374 Show whether an optimization trusting PAD types over XVS types is activated"),
12376 This is related to the encoding used by the GNAT compiler. The debugger\n\
12377 should normally trust the contents of PAD types, but certain older versions\n\
12378 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12379 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12380 work around this bug. It is always safe to turn this option \"off\", but\n\
12381 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12382 this option to \"off\" unless necessary."),
12383 NULL, NULL, &set_ada_list, &show_ada_list);
12385 add_catch_command ("exception", _("\
12386 Catch Ada exceptions, when raised.\n\
12387 With an argument, catch only exceptions with the given name."),
12388 catch_ada_exception_command,
12392 add_catch_command ("assert", _("\
12393 Catch failed Ada assertions, when raised.\n\
12394 With an argument, catch only exceptions with the given name."),
12395 catch_assert_command,
12400 varsize_limit = 65536;
12402 obstack_init (&symbol_list_obstack);
12404 decoded_names_store = htab_create_alloc
12405 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
12406 NULL, xcalloc, xfree);
12408 observer_attach_executable_changed (ada_executable_changed_observer);
12410 /* Setup per-inferior data. */
12411 observer_attach_inferior_exit (ada_inferior_exit);
12413 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup);