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;
321 /* The exception_support_info data. This data is used to determine
322 how to implement support for Ada exception catchpoints in a given
324 const struct exception_support_info *exception_info;
327 /* Our key to this module's inferior data. */
328 static const struct inferior_data *ada_inferior_data;
330 /* A cleanup routine for our inferior data. */
332 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
334 struct ada_inferior_data *data;
336 data = inferior_data (inf, ada_inferior_data);
341 /* Return our inferior data for the given inferior (INF).
343 This function always returns a valid pointer to an allocated
344 ada_inferior_data structure. If INF's inferior data has not
345 been previously set, this functions creates a new one with all
346 fields set to zero, sets INF's inferior to it, and then returns
347 a pointer to that newly allocated ada_inferior_data. */
349 static struct ada_inferior_data *
350 get_ada_inferior_data (struct inferior *inf)
352 struct ada_inferior_data *data;
354 data = inferior_data (inf, ada_inferior_data);
357 data = XZALLOC (struct ada_inferior_data);
358 set_inferior_data (inf, ada_inferior_data, data);
364 /* Perform all necessary cleanups regarding our module's inferior data
365 that is required after the inferior INF just exited. */
368 ada_inferior_exit (struct inferior *inf)
370 ada_inferior_data_cleanup (inf, NULL);
371 set_inferior_data (inf, ada_inferior_data, NULL);
376 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
377 all typedef layers have been peeled. Otherwise, return TYPE.
379 Normally, we really expect a typedef type to only have 1 typedef layer.
380 In other words, we really expect the target type of a typedef type to be
381 a non-typedef type. This is particularly true for Ada units, because
382 the language does not have a typedef vs not-typedef distinction.
383 In that respect, the Ada compiler has been trying to eliminate as many
384 typedef definitions in the debugging information, since they generally
385 do not bring any extra information (we still use typedef under certain
386 circumstances related mostly to the GNAT encoding).
388 Unfortunately, we have seen situations where the debugging information
389 generated by the compiler leads to such multiple typedef layers. For
390 instance, consider the following example with stabs:
392 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
393 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
395 This is an error in the debugging information which causes type
396 pck__float_array___XUP to be defined twice, and the second time,
397 it is defined as a typedef of a typedef.
399 This is on the fringe of legality as far as debugging information is
400 concerned, and certainly unexpected. But it is easy to handle these
401 situations correctly, so we can afford to be lenient in this case. */
404 ada_typedef_target_type (struct type *type)
406 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
407 type = TYPE_TARGET_TYPE (type);
411 /* Given DECODED_NAME a string holding a symbol name in its
412 decoded form (ie using the Ada dotted notation), returns
413 its unqualified name. */
416 ada_unqualified_name (const char *decoded_name)
418 const char *result = strrchr (decoded_name, '.');
421 result++; /* Skip the dot... */
423 result = decoded_name;
428 /* Return a string starting with '<', followed by STR, and '>'.
429 The result is good until the next call. */
432 add_angle_brackets (const char *str)
434 static char *result = NULL;
437 result = xstrprintf ("<%s>", str);
442 ada_get_gdb_completer_word_break_characters (void)
444 return ada_completer_word_break_characters;
447 /* Print an array element index using the Ada syntax. */
450 ada_print_array_index (struct value *index_value, struct ui_file *stream,
451 const struct value_print_options *options)
453 LA_VALUE_PRINT (index_value, stream, options);
454 fprintf_filtered (stream, " => ");
457 /* Assuming VECT points to an array of *SIZE objects of size
458 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
459 updating *SIZE as necessary and returning the (new) array. */
462 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
464 if (*size < min_size)
467 if (*size < min_size)
469 vect = xrealloc (vect, *size * element_size);
474 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
475 suffix of FIELD_NAME beginning "___". */
478 field_name_match (const char *field_name, const char *target)
480 int len = strlen (target);
483 (strncmp (field_name, target, len) == 0
484 && (field_name[len] == '\0'
485 || (strncmp (field_name + len, "___", 3) == 0
486 && strcmp (field_name + strlen (field_name) - 6,
491 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
492 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
493 and return its index. This function also handles fields whose name
494 have ___ suffixes because the compiler sometimes alters their name
495 by adding such a suffix to represent fields with certain constraints.
496 If the field could not be found, return a negative number if
497 MAYBE_MISSING is set. Otherwise raise an error. */
500 ada_get_field_index (const struct type *type, const char *field_name,
504 struct type *struct_type = check_typedef ((struct type *) type);
506 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
507 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
511 error (_("Unable to find field %s in struct %s. Aborting"),
512 field_name, TYPE_NAME (struct_type));
517 /* The length of the prefix of NAME prior to any "___" suffix. */
520 ada_name_prefix_len (const char *name)
526 const char *p = strstr (name, "___");
529 return strlen (name);
535 /* Return non-zero if SUFFIX is a suffix of STR.
536 Return zero if STR is null. */
539 is_suffix (const char *str, const char *suffix)
546 len2 = strlen (suffix);
547 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
550 /* The contents of value VAL, treated as a value of type TYPE. The
551 result is an lval in memory if VAL is. */
553 static struct value *
554 coerce_unspec_val_to_type (struct value *val, struct type *type)
556 type = ada_check_typedef (type);
557 if (value_type (val) == type)
561 struct value *result;
563 /* Make sure that the object size is not unreasonable before
564 trying to allocate some memory for it. */
568 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
569 result = allocate_value_lazy (type);
572 result = allocate_value (type);
573 memcpy (value_contents_raw (result), value_contents (val),
576 set_value_component_location (result, val);
577 set_value_bitsize (result, value_bitsize (val));
578 set_value_bitpos (result, value_bitpos (val));
579 set_value_address (result, value_address (val));
584 static const gdb_byte *
585 cond_offset_host (const gdb_byte *valaddr, long offset)
590 return valaddr + offset;
594 cond_offset_target (CORE_ADDR address, long offset)
599 return address + offset;
602 /* Issue a warning (as for the definition of warning in utils.c, but
603 with exactly one argument rather than ...), unless the limit on the
604 number of warnings has passed during the evaluation of the current
607 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
608 provided by "complaint". */
609 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
612 lim_warning (const char *format, ...)
616 va_start (args, format);
617 warnings_issued += 1;
618 if (warnings_issued <= warning_limit)
619 vwarning (format, args);
624 /* Issue an error if the size of an object of type T is unreasonable,
625 i.e. if it would be a bad idea to allocate a value of this type in
629 check_size (const struct type *type)
631 if (TYPE_LENGTH (type) > varsize_limit)
632 error (_("object size is larger than varsize-limit"));
635 /* Maximum value of a SIZE-byte signed integer type. */
637 max_of_size (int size)
639 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
641 return top_bit | (top_bit - 1);
644 /* Minimum value of a SIZE-byte signed integer type. */
646 min_of_size (int size)
648 return -max_of_size (size) - 1;
651 /* Maximum value of a SIZE-byte unsigned integer type. */
653 umax_of_size (int size)
655 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
657 return top_bit | (top_bit - 1);
660 /* Maximum value of integral type T, as a signed quantity. */
662 max_of_type (struct type *t)
664 if (TYPE_UNSIGNED (t))
665 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
667 return max_of_size (TYPE_LENGTH (t));
670 /* Minimum value of integral type T, as a signed quantity. */
672 min_of_type (struct type *t)
674 if (TYPE_UNSIGNED (t))
677 return min_of_size (TYPE_LENGTH (t));
680 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
682 ada_discrete_type_high_bound (struct type *type)
684 switch (TYPE_CODE (type))
686 case TYPE_CODE_RANGE:
687 return TYPE_HIGH_BOUND (type);
689 return TYPE_FIELD_BITPOS (type, TYPE_NFIELDS (type) - 1);
694 return max_of_type (type);
696 error (_("Unexpected type in ada_discrete_type_high_bound."));
700 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
702 ada_discrete_type_low_bound (struct type *type)
704 switch (TYPE_CODE (type))
706 case TYPE_CODE_RANGE:
707 return TYPE_LOW_BOUND (type);
709 return TYPE_FIELD_BITPOS (type, 0);
714 return min_of_type (type);
716 error (_("Unexpected type in ada_discrete_type_low_bound."));
720 /* The identity on non-range types. For range types, the underlying
721 non-range scalar type. */
724 get_base_type (struct type *type)
726 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
728 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
730 type = TYPE_TARGET_TYPE (type);
736 /* Language Selection */
738 /* If the main program is in Ada, return language_ada, otherwise return LANG
739 (the main program is in Ada iif the adainit symbol is found). */
742 ada_update_initial_language (enum language lang)
744 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
745 (struct objfile *) NULL) != NULL)
751 /* If the main procedure is written in Ada, then return its name.
752 The result is good until the next call. Return NULL if the main
753 procedure doesn't appear to be in Ada. */
758 struct minimal_symbol *msym;
759 static char *main_program_name = NULL;
761 /* For Ada, the name of the main procedure is stored in a specific
762 string constant, generated by the binder. Look for that symbol,
763 extract its address, and then read that string. If we didn't find
764 that string, then most probably the main procedure is not written
766 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
770 CORE_ADDR main_program_name_addr;
773 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
774 if (main_program_name_addr == 0)
775 error (_("Invalid address for Ada main program name."));
777 xfree (main_program_name);
778 target_read_string (main_program_name_addr, &main_program_name,
783 return main_program_name;
786 /* The main procedure doesn't seem to be in Ada. */
792 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
795 const struct ada_opname_map ada_opname_table[] = {
796 {"Oadd", "\"+\"", BINOP_ADD},
797 {"Osubtract", "\"-\"", BINOP_SUB},
798 {"Omultiply", "\"*\"", BINOP_MUL},
799 {"Odivide", "\"/\"", BINOP_DIV},
800 {"Omod", "\"mod\"", BINOP_MOD},
801 {"Orem", "\"rem\"", BINOP_REM},
802 {"Oexpon", "\"**\"", BINOP_EXP},
803 {"Olt", "\"<\"", BINOP_LESS},
804 {"Ole", "\"<=\"", BINOP_LEQ},
805 {"Ogt", "\">\"", BINOP_GTR},
806 {"Oge", "\">=\"", BINOP_GEQ},
807 {"Oeq", "\"=\"", BINOP_EQUAL},
808 {"One", "\"/=\"", BINOP_NOTEQUAL},
809 {"Oand", "\"and\"", BINOP_BITWISE_AND},
810 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
811 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
812 {"Oconcat", "\"&\"", BINOP_CONCAT},
813 {"Oabs", "\"abs\"", UNOP_ABS},
814 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
815 {"Oadd", "\"+\"", UNOP_PLUS},
816 {"Osubtract", "\"-\"", UNOP_NEG},
820 /* The "encoded" form of DECODED, according to GNAT conventions.
821 The result is valid until the next call to ada_encode. */
824 ada_encode (const char *decoded)
826 static char *encoding_buffer = NULL;
827 static size_t encoding_buffer_size = 0;
834 GROW_VECT (encoding_buffer, encoding_buffer_size,
835 2 * strlen (decoded) + 10);
838 for (p = decoded; *p != '\0'; p += 1)
842 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
847 const struct ada_opname_map *mapping;
849 for (mapping = ada_opname_table;
850 mapping->encoded != NULL
851 && strncmp (mapping->decoded, p,
852 strlen (mapping->decoded)) != 0; mapping += 1)
854 if (mapping->encoded == NULL)
855 error (_("invalid Ada operator name: %s"), p);
856 strcpy (encoding_buffer + k, mapping->encoded);
857 k += strlen (mapping->encoded);
862 encoding_buffer[k] = *p;
867 encoding_buffer[k] = '\0';
868 return encoding_buffer;
871 /* Return NAME folded to lower case, or, if surrounded by single
872 quotes, unfolded, but with the quotes stripped away. Result good
876 ada_fold_name (const char *name)
878 static char *fold_buffer = NULL;
879 static size_t fold_buffer_size = 0;
881 int len = strlen (name);
882 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
886 strncpy (fold_buffer, name + 1, len - 2);
887 fold_buffer[len - 2] = '\000';
893 for (i = 0; i <= len; i += 1)
894 fold_buffer[i] = tolower (name[i]);
900 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
903 is_lower_alphanum (const char c)
905 return (isdigit (c) || (isalpha (c) && islower (c)));
908 /* ENCODED is the linkage name of a symbol and LEN contains its length.
909 This function saves in LEN the length of that same symbol name but
910 without either of these suffixes:
916 These are suffixes introduced by the compiler for entities such as
917 nested subprogram for instance, in order to avoid name clashes.
918 They do not serve any purpose for the debugger. */
921 ada_remove_trailing_digits (const char *encoded, int *len)
923 if (*len > 1 && isdigit (encoded[*len - 1]))
927 while (i > 0 && isdigit (encoded[i]))
929 if (i >= 0 && encoded[i] == '.')
931 else if (i >= 0 && encoded[i] == '$')
933 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
935 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
940 /* Remove the suffix introduced by the compiler for protected object
944 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
946 /* Remove trailing N. */
948 /* Protected entry subprograms are broken into two
949 separate subprograms: The first one is unprotected, and has
950 a 'N' suffix; the second is the protected version, and has
951 the 'P' suffix. The second calls the first one after handling
952 the protection. Since the P subprograms are internally generated,
953 we leave these names undecoded, giving the user a clue that this
954 entity is internal. */
957 && encoded[*len - 1] == 'N'
958 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
962 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
965 ada_remove_Xbn_suffix (const char *encoded, int *len)
969 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
972 if (encoded[i] != 'X')
978 if (isalnum (encoded[i-1]))
982 /* If ENCODED follows the GNAT entity encoding conventions, then return
983 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
986 The resulting string is valid until the next call of ada_decode.
987 If the string is unchanged by decoding, the original string pointer
991 ada_decode (const char *encoded)
998 static char *decoding_buffer = NULL;
999 static size_t decoding_buffer_size = 0;
1001 /* The name of the Ada main procedure starts with "_ada_".
1002 This prefix is not part of the decoded name, so skip this part
1003 if we see this prefix. */
1004 if (strncmp (encoded, "_ada_", 5) == 0)
1007 /* If the name starts with '_', then it is not a properly encoded
1008 name, so do not attempt to decode it. Similarly, if the name
1009 starts with '<', the name should not be decoded. */
1010 if (encoded[0] == '_' || encoded[0] == '<')
1013 len0 = strlen (encoded);
1015 ada_remove_trailing_digits (encoded, &len0);
1016 ada_remove_po_subprogram_suffix (encoded, &len0);
1018 /* Remove the ___X.* suffix if present. Do not forget to verify that
1019 the suffix is located before the current "end" of ENCODED. We want
1020 to avoid re-matching parts of ENCODED that have previously been
1021 marked as discarded (by decrementing LEN0). */
1022 p = strstr (encoded, "___");
1023 if (p != NULL && p - encoded < len0 - 3)
1031 /* Remove any trailing TKB suffix. It tells us that this symbol
1032 is for the body of a task, but that information does not actually
1033 appear in the decoded name. */
1035 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
1038 /* Remove any trailing TB suffix. The TB suffix is slightly different
1039 from the TKB suffix because it is used for non-anonymous task
1042 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
1045 /* Remove trailing "B" suffixes. */
1046 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1048 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
1051 /* Make decoded big enough for possible expansion by operator name. */
1053 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1054 decoded = decoding_buffer;
1056 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1058 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1061 while ((i >= 0 && isdigit (encoded[i]))
1062 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1064 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1066 else if (encoded[i] == '$')
1070 /* The first few characters that are not alphabetic are not part
1071 of any encoding we use, so we can copy them over verbatim. */
1073 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1074 decoded[j] = encoded[i];
1079 /* Is this a symbol function? */
1080 if (at_start_name && encoded[i] == 'O')
1084 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1086 int op_len = strlen (ada_opname_table[k].encoded);
1087 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1089 && !isalnum (encoded[i + op_len]))
1091 strcpy (decoded + j, ada_opname_table[k].decoded);
1094 j += strlen (ada_opname_table[k].decoded);
1098 if (ada_opname_table[k].encoded != NULL)
1103 /* Replace "TK__" with "__", which will eventually be translated
1104 into "." (just below). */
1106 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1109 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1110 be translated into "." (just below). These are internal names
1111 generated for anonymous blocks inside which our symbol is nested. */
1113 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1114 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1115 && isdigit (encoded [i+4]))
1119 while (k < len0 && isdigit (encoded[k]))
1120 k++; /* Skip any extra digit. */
1122 /* Double-check that the "__B_{DIGITS}+" sequence we found
1123 is indeed followed by "__". */
1124 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1128 /* Remove _E{DIGITS}+[sb] */
1130 /* Just as for protected object subprograms, there are 2 categories
1131 of subprograms created by the compiler for each entry. The first
1132 one implements the actual entry code, and has a suffix following
1133 the convention above; the second one implements the barrier and
1134 uses the same convention as above, except that the 'E' is replaced
1137 Just as above, we do not decode the name of barrier functions
1138 to give the user a clue that the code he is debugging has been
1139 internally generated. */
1141 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1142 && isdigit (encoded[i+2]))
1146 while (k < len0 && isdigit (encoded[k]))
1150 && (encoded[k] == 'b' || encoded[k] == 's'))
1153 /* Just as an extra precaution, make sure that if this
1154 suffix is followed by anything else, it is a '_'.
1155 Otherwise, we matched this sequence by accident. */
1157 || (k < len0 && encoded[k] == '_'))
1162 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1163 the GNAT front-end in protected object subprograms. */
1166 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1168 /* Backtrack a bit up until we reach either the begining of
1169 the encoded name, or "__". Make sure that we only find
1170 digits or lowercase characters. */
1171 const char *ptr = encoded + i - 1;
1173 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1176 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1180 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1182 /* This is a X[bn]* sequence not separated from the previous
1183 part of the name with a non-alpha-numeric character (in other
1184 words, immediately following an alpha-numeric character), then
1185 verify that it is placed at the end of the encoded name. If
1186 not, then the encoding is not valid and we should abort the
1187 decoding. Otherwise, just skip it, it is used in body-nested
1191 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1195 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1197 /* Replace '__' by '.'. */
1205 /* It's a character part of the decoded name, so just copy it
1207 decoded[j] = encoded[i];
1212 decoded[j] = '\000';
1214 /* Decoded names should never contain any uppercase character.
1215 Double-check this, and abort the decoding if we find one. */
1217 for (i = 0; decoded[i] != '\0'; i += 1)
1218 if (isupper (decoded[i]) || decoded[i] == ' ')
1221 if (strcmp (decoded, encoded) == 0)
1227 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1228 decoded = decoding_buffer;
1229 if (encoded[0] == '<')
1230 strcpy (decoded, encoded);
1232 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1237 /* Table for keeping permanent unique copies of decoded names. Once
1238 allocated, names in this table are never released. While this is a
1239 storage leak, it should not be significant unless there are massive
1240 changes in the set of decoded names in successive versions of a
1241 symbol table loaded during a single session. */
1242 static struct htab *decoded_names_store;
1244 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1245 in the language-specific part of GSYMBOL, if it has not been
1246 previously computed. Tries to save the decoded name in the same
1247 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1248 in any case, the decoded symbol has a lifetime at least that of
1250 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1251 const, but nevertheless modified to a semantically equivalent form
1252 when a decoded name is cached in it. */
1255 ada_decode_symbol (const struct general_symbol_info *gsymbol)
1258 (char **) &gsymbol->language_specific.mangled_lang.demangled_name;
1260 if (*resultp == NULL)
1262 const char *decoded = ada_decode (gsymbol->name);
1264 if (gsymbol->obj_section != NULL)
1266 struct objfile *objf = gsymbol->obj_section->objfile;
1268 *resultp = obsavestring (decoded, strlen (decoded),
1269 &objf->objfile_obstack);
1271 /* Sometimes, we can't find a corresponding objfile, in which
1272 case, we put the result on the heap. Since we only decode
1273 when needed, we hope this usually does not cause a
1274 significant memory leak (FIXME). */
1275 if (*resultp == NULL)
1277 char **slot = (char **) htab_find_slot (decoded_names_store,
1281 *slot = xstrdup (decoded);
1290 ada_la_decode (const char *encoded, int options)
1292 return xstrdup (ada_decode (encoded));
1295 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1296 suffixes that encode debugging information or leading _ada_ on
1297 SYM_NAME (see is_name_suffix commentary for the debugging
1298 information that is ignored). If WILD, then NAME need only match a
1299 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1300 either argument is NULL. */
1303 match_name (const char *sym_name, const char *name, int wild)
1305 if (sym_name == NULL || name == NULL)
1308 return wild_match (sym_name, name) == 0;
1311 int len_name = strlen (name);
1313 return (strncmp (sym_name, name, len_name) == 0
1314 && is_name_suffix (sym_name + len_name))
1315 || (strncmp (sym_name, "_ada_", 5) == 0
1316 && strncmp (sym_name + 5, name, len_name) == 0
1317 && is_name_suffix (sym_name + len_name + 5));
1324 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1325 generated by the GNAT compiler to describe the index type used
1326 for each dimension of an array, check whether it follows the latest
1327 known encoding. If not, fix it up to conform to the latest encoding.
1328 Otherwise, do nothing. This function also does nothing if
1329 INDEX_DESC_TYPE is NULL.
1331 The GNAT encoding used to describle the array index type evolved a bit.
1332 Initially, the information would be provided through the name of each
1333 field of the structure type only, while the type of these fields was
1334 described as unspecified and irrelevant. The debugger was then expected
1335 to perform a global type lookup using the name of that field in order
1336 to get access to the full index type description. Because these global
1337 lookups can be very expensive, the encoding was later enhanced to make
1338 the global lookup unnecessary by defining the field type as being
1339 the full index type description.
1341 The purpose of this routine is to allow us to support older versions
1342 of the compiler by detecting the use of the older encoding, and by
1343 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1344 we essentially replace each field's meaningless type by the associated
1348 ada_fixup_array_indexes_type (struct type *index_desc_type)
1352 if (index_desc_type == NULL)
1354 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1356 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1357 to check one field only, no need to check them all). If not, return
1360 If our INDEX_DESC_TYPE was generated using the older encoding,
1361 the field type should be a meaningless integer type whose name
1362 is not equal to the field name. */
1363 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1364 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1365 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1368 /* Fixup each field of INDEX_DESC_TYPE. */
1369 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1371 char *name = TYPE_FIELD_NAME (index_desc_type, i);
1372 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1375 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1379 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1381 static char *bound_name[] = {
1382 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1383 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1386 /* Maximum number of array dimensions we are prepared to handle. */
1388 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1391 /* The desc_* routines return primitive portions of array descriptors
1394 /* The descriptor or array type, if any, indicated by TYPE; removes
1395 level of indirection, if needed. */
1397 static struct type *
1398 desc_base_type (struct type *type)
1402 type = ada_check_typedef (type);
1403 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1404 type = ada_typedef_target_type (type);
1407 && (TYPE_CODE (type) == TYPE_CODE_PTR
1408 || TYPE_CODE (type) == TYPE_CODE_REF))
1409 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1414 /* True iff TYPE indicates a "thin" array pointer type. */
1417 is_thin_pntr (struct type *type)
1420 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1421 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1424 /* The descriptor type for thin pointer type TYPE. */
1426 static struct type *
1427 thin_descriptor_type (struct type *type)
1429 struct type *base_type = desc_base_type (type);
1431 if (base_type == NULL)
1433 if (is_suffix (ada_type_name (base_type), "___XVE"))
1437 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1439 if (alt_type == NULL)
1446 /* A pointer to the array data for thin-pointer value VAL. */
1448 static struct value *
1449 thin_data_pntr (struct value *val)
1451 struct type *type = ada_check_typedef (value_type (val));
1452 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1454 data_type = lookup_pointer_type (data_type);
1456 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1457 return value_cast (data_type, value_copy (val));
1459 return value_from_longest (data_type, value_address (val));
1462 /* True iff TYPE indicates a "thick" array pointer type. */
1465 is_thick_pntr (struct type *type)
1467 type = desc_base_type (type);
1468 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1469 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1472 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1473 pointer to one, the type of its bounds data; otherwise, NULL. */
1475 static struct type *
1476 desc_bounds_type (struct type *type)
1480 type = desc_base_type (type);
1484 else if (is_thin_pntr (type))
1486 type = thin_descriptor_type (type);
1489 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1491 return ada_check_typedef (r);
1493 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1495 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1497 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1502 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1503 one, a pointer to its bounds data. Otherwise NULL. */
1505 static struct value *
1506 desc_bounds (struct value *arr)
1508 struct type *type = ada_check_typedef (value_type (arr));
1510 if (is_thin_pntr (type))
1512 struct type *bounds_type =
1513 desc_bounds_type (thin_descriptor_type (type));
1516 if (bounds_type == NULL)
1517 error (_("Bad GNAT array descriptor"));
1519 /* NOTE: The following calculation is not really kosher, but
1520 since desc_type is an XVE-encoded type (and shouldn't be),
1521 the correct calculation is a real pain. FIXME (and fix GCC). */
1522 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1523 addr = value_as_long (arr);
1525 addr = value_address (arr);
1528 value_from_longest (lookup_pointer_type (bounds_type),
1529 addr - TYPE_LENGTH (bounds_type));
1532 else if (is_thick_pntr (type))
1534 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1535 _("Bad GNAT array descriptor"));
1536 struct type *p_bounds_type = value_type (p_bounds);
1539 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1541 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1543 if (TYPE_STUB (target_type))
1544 p_bounds = value_cast (lookup_pointer_type
1545 (ada_check_typedef (target_type)),
1549 error (_("Bad GNAT array descriptor"));
1557 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1558 position of the field containing the address of the bounds data. */
1561 fat_pntr_bounds_bitpos (struct type *type)
1563 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1566 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1567 size of the field containing the address of the bounds data. */
1570 fat_pntr_bounds_bitsize (struct type *type)
1572 type = desc_base_type (type);
1574 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1575 return TYPE_FIELD_BITSIZE (type, 1);
1577 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1580 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1581 pointer to one, the type of its array data (a array-with-no-bounds type);
1582 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1585 static struct type *
1586 desc_data_target_type (struct type *type)
1588 type = desc_base_type (type);
1590 /* NOTE: The following is bogus; see comment in desc_bounds. */
1591 if (is_thin_pntr (type))
1592 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1593 else if (is_thick_pntr (type))
1595 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1598 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1599 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1605 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1608 static struct value *
1609 desc_data (struct value *arr)
1611 struct type *type = value_type (arr);
1613 if (is_thin_pntr (type))
1614 return thin_data_pntr (arr);
1615 else if (is_thick_pntr (type))
1616 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1617 _("Bad GNAT array descriptor"));
1623 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1624 position of the field containing the address of the data. */
1627 fat_pntr_data_bitpos (struct type *type)
1629 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1632 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1633 size of the field containing the address of the data. */
1636 fat_pntr_data_bitsize (struct type *type)
1638 type = desc_base_type (type);
1640 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1641 return TYPE_FIELD_BITSIZE (type, 0);
1643 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1646 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1647 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1648 bound, if WHICH is 1. The first bound is I=1. */
1650 static struct value *
1651 desc_one_bound (struct value *bounds, int i, int which)
1653 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1654 _("Bad GNAT array descriptor bounds"));
1657 /* If BOUNDS is an array-bounds structure type, return the bit position
1658 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1659 bound, if WHICH is 1. The first bound is I=1. */
1662 desc_bound_bitpos (struct type *type, int i, int which)
1664 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1667 /* If BOUNDS is an array-bounds structure type, return the bit field size
1668 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1669 bound, if WHICH is 1. The first bound is I=1. */
1672 desc_bound_bitsize (struct type *type, int i, int which)
1674 type = desc_base_type (type);
1676 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1677 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1679 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1682 /* If TYPE is the type of an array-bounds structure, the type of its
1683 Ith bound (numbering from 1). Otherwise, NULL. */
1685 static struct type *
1686 desc_index_type (struct type *type, int i)
1688 type = desc_base_type (type);
1690 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1691 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1696 /* The number of index positions in the array-bounds type TYPE.
1697 Return 0 if TYPE is NULL. */
1700 desc_arity (struct type *type)
1702 type = desc_base_type (type);
1705 return TYPE_NFIELDS (type) / 2;
1709 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1710 an array descriptor type (representing an unconstrained array
1714 ada_is_direct_array_type (struct type *type)
1718 type = ada_check_typedef (type);
1719 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1720 || ada_is_array_descriptor_type (type));
1723 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1727 ada_is_array_type (struct type *type)
1730 && (TYPE_CODE (type) == TYPE_CODE_PTR
1731 || TYPE_CODE (type) == TYPE_CODE_REF))
1732 type = TYPE_TARGET_TYPE (type);
1733 return ada_is_direct_array_type (type);
1736 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1739 ada_is_simple_array_type (struct type *type)
1743 type = ada_check_typedef (type);
1744 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1745 || (TYPE_CODE (type) == TYPE_CODE_PTR
1746 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1747 == TYPE_CODE_ARRAY));
1750 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1753 ada_is_array_descriptor_type (struct type *type)
1755 struct type *data_type = desc_data_target_type (type);
1759 type = ada_check_typedef (type);
1760 return (data_type != NULL
1761 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1762 && desc_arity (desc_bounds_type (type)) > 0);
1765 /* Non-zero iff type is a partially mal-formed GNAT array
1766 descriptor. FIXME: This is to compensate for some problems with
1767 debugging output from GNAT. Re-examine periodically to see if it
1771 ada_is_bogus_array_descriptor (struct type *type)
1775 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1776 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1777 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1778 && !ada_is_array_descriptor_type (type);
1782 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1783 (fat pointer) returns the type of the array data described---specifically,
1784 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1785 in from the descriptor; otherwise, they are left unspecified. If
1786 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1787 returns NULL. The result is simply the type of ARR if ARR is not
1790 ada_type_of_array (struct value *arr, int bounds)
1792 if (ada_is_constrained_packed_array_type (value_type (arr)))
1793 return decode_constrained_packed_array_type (value_type (arr));
1795 if (!ada_is_array_descriptor_type (value_type (arr)))
1796 return value_type (arr);
1800 struct type *array_type =
1801 ada_check_typedef (desc_data_target_type (value_type (arr)));
1803 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1804 TYPE_FIELD_BITSIZE (array_type, 0) =
1805 decode_packed_array_bitsize (value_type (arr));
1811 struct type *elt_type;
1813 struct value *descriptor;
1815 elt_type = ada_array_element_type (value_type (arr), -1);
1816 arity = ada_array_arity (value_type (arr));
1818 if (elt_type == NULL || arity == 0)
1819 return ada_check_typedef (value_type (arr));
1821 descriptor = desc_bounds (arr);
1822 if (value_as_long (descriptor) == 0)
1826 struct type *range_type = alloc_type_copy (value_type (arr));
1827 struct type *array_type = alloc_type_copy (value_type (arr));
1828 struct value *low = desc_one_bound (descriptor, arity, 0);
1829 struct value *high = desc_one_bound (descriptor, arity, 1);
1832 create_range_type (range_type, value_type (low),
1833 longest_to_int (value_as_long (low)),
1834 longest_to_int (value_as_long (high)));
1835 elt_type = create_array_type (array_type, elt_type, range_type);
1837 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1839 /* We need to store the element packed bitsize, as well as
1840 recompute the array size, because it was previously
1841 computed based on the unpacked element size. */
1842 LONGEST lo = value_as_long (low);
1843 LONGEST hi = value_as_long (high);
1845 TYPE_FIELD_BITSIZE (elt_type, 0) =
1846 decode_packed_array_bitsize (value_type (arr));
1847 /* If the array has no element, then the size is already
1848 zero, and does not need to be recomputed. */
1852 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
1854 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
1859 return lookup_pointer_type (elt_type);
1863 /* If ARR does not represent an array, returns ARR unchanged.
1864 Otherwise, returns either a standard GDB array with bounds set
1865 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1866 GDB array. Returns NULL if ARR is a null fat pointer. */
1869 ada_coerce_to_simple_array_ptr (struct value *arr)
1871 if (ada_is_array_descriptor_type (value_type (arr)))
1873 struct type *arrType = ada_type_of_array (arr, 1);
1875 if (arrType == NULL)
1877 return value_cast (arrType, value_copy (desc_data (arr)));
1879 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1880 return decode_constrained_packed_array (arr);
1885 /* If ARR does not represent an array, returns ARR unchanged.
1886 Otherwise, returns a standard GDB array describing ARR (which may
1887 be ARR itself if it already is in the proper form). */
1890 ada_coerce_to_simple_array (struct value *arr)
1892 if (ada_is_array_descriptor_type (value_type (arr)))
1894 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1897 error (_("Bounds unavailable for null array pointer."));
1898 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1899 return value_ind (arrVal);
1901 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1902 return decode_constrained_packed_array (arr);
1907 /* If TYPE represents a GNAT array type, return it translated to an
1908 ordinary GDB array type (possibly with BITSIZE fields indicating
1909 packing). For other types, is the identity. */
1912 ada_coerce_to_simple_array_type (struct type *type)
1914 if (ada_is_constrained_packed_array_type (type))
1915 return decode_constrained_packed_array_type (type);
1917 if (ada_is_array_descriptor_type (type))
1918 return ada_check_typedef (desc_data_target_type (type));
1923 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1926 ada_is_packed_array_type (struct type *type)
1930 type = desc_base_type (type);
1931 type = ada_check_typedef (type);
1933 ada_type_name (type) != NULL
1934 && strstr (ada_type_name (type), "___XP") != NULL;
1937 /* Non-zero iff TYPE represents a standard GNAT constrained
1938 packed-array type. */
1941 ada_is_constrained_packed_array_type (struct type *type)
1943 return ada_is_packed_array_type (type)
1944 && !ada_is_array_descriptor_type (type);
1947 /* Non-zero iff TYPE represents an array descriptor for a
1948 unconstrained packed-array type. */
1951 ada_is_unconstrained_packed_array_type (struct type *type)
1953 return ada_is_packed_array_type (type)
1954 && ada_is_array_descriptor_type (type);
1957 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1958 return the size of its elements in bits. */
1961 decode_packed_array_bitsize (struct type *type)
1967 /* Access to arrays implemented as fat pointers are encoded as a typedef
1968 of the fat pointer type. We need the name of the fat pointer type
1969 to do the decoding, so strip the typedef layer. */
1970 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1971 type = ada_typedef_target_type (type);
1973 raw_name = ada_type_name (ada_check_typedef (type));
1975 raw_name = ada_type_name (desc_base_type (type));
1980 tail = strstr (raw_name, "___XP");
1981 gdb_assert (tail != NULL);
1983 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1986 (_("could not understand bit size information on packed array"));
1993 /* Given that TYPE is a standard GDB array type with all bounds filled
1994 in, and that the element size of its ultimate scalar constituents
1995 (that is, either its elements, or, if it is an array of arrays, its
1996 elements' elements, etc.) is *ELT_BITS, return an identical type,
1997 but with the bit sizes of its elements (and those of any
1998 constituent arrays) recorded in the BITSIZE components of its
1999 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2002 static struct type *
2003 constrained_packed_array_type (struct type *type, long *elt_bits)
2005 struct type *new_elt_type;
2006 struct type *new_type;
2007 LONGEST low_bound, high_bound;
2009 type = ada_check_typedef (type);
2010 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2013 new_type = alloc_type_copy (type);
2015 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2017 create_array_type (new_type, new_elt_type, TYPE_INDEX_TYPE (type));
2018 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2019 TYPE_NAME (new_type) = ada_type_name (type);
2021 if (get_discrete_bounds (TYPE_INDEX_TYPE (type),
2022 &low_bound, &high_bound) < 0)
2023 low_bound = high_bound = 0;
2024 if (high_bound < low_bound)
2025 *elt_bits = TYPE_LENGTH (new_type) = 0;
2028 *elt_bits *= (high_bound - low_bound + 1);
2029 TYPE_LENGTH (new_type) =
2030 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2033 TYPE_FIXED_INSTANCE (new_type) = 1;
2037 /* The array type encoded by TYPE, where
2038 ada_is_constrained_packed_array_type (TYPE). */
2040 static struct type *
2041 decode_constrained_packed_array_type (struct type *type)
2043 char *raw_name = ada_type_name (ada_check_typedef (type));
2046 struct type *shadow_type;
2050 raw_name = ada_type_name (desc_base_type (type));
2055 name = (char *) alloca (strlen (raw_name) + 1);
2056 tail = strstr (raw_name, "___XP");
2057 type = desc_base_type (type);
2059 memcpy (name, raw_name, tail - raw_name);
2060 name[tail - raw_name] = '\000';
2062 shadow_type = ada_find_parallel_type_with_name (type, name);
2064 if (shadow_type == NULL)
2066 lim_warning (_("could not find bounds information on packed array"));
2069 CHECK_TYPEDEF (shadow_type);
2071 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2073 lim_warning (_("could not understand bounds "
2074 "information on packed array"));
2078 bits = decode_packed_array_bitsize (type);
2079 return constrained_packed_array_type (shadow_type, &bits);
2082 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2083 array, returns a simple array that denotes that array. Its type is a
2084 standard GDB array type except that the BITSIZEs of the array
2085 target types are set to the number of bits in each element, and the
2086 type length is set appropriately. */
2088 static struct value *
2089 decode_constrained_packed_array (struct value *arr)
2093 arr = ada_coerce_ref (arr);
2095 /* If our value is a pointer, then dererence it. Make sure that
2096 this operation does not cause the target type to be fixed, as
2097 this would indirectly cause this array to be decoded. The rest
2098 of the routine assumes that the array hasn't been decoded yet,
2099 so we use the basic "value_ind" routine to perform the dereferencing,
2100 as opposed to using "ada_value_ind". */
2101 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2102 arr = value_ind (arr);
2104 type = decode_constrained_packed_array_type (value_type (arr));
2107 error (_("can't unpack array"));
2111 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2112 && ada_is_modular_type (value_type (arr)))
2114 /* This is a (right-justified) modular type representing a packed
2115 array with no wrapper. In order to interpret the value through
2116 the (left-justified) packed array type we just built, we must
2117 first left-justify it. */
2118 int bit_size, bit_pos;
2121 mod = ada_modulus (value_type (arr)) - 1;
2128 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2129 arr = ada_value_primitive_packed_val (arr, NULL,
2130 bit_pos / HOST_CHAR_BIT,
2131 bit_pos % HOST_CHAR_BIT,
2136 return coerce_unspec_val_to_type (arr, type);
2140 /* The value of the element of packed array ARR at the ARITY indices
2141 given in IND. ARR must be a simple array. */
2143 static struct value *
2144 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2147 int bits, elt_off, bit_off;
2148 long elt_total_bit_offset;
2149 struct type *elt_type;
2153 elt_total_bit_offset = 0;
2154 elt_type = ada_check_typedef (value_type (arr));
2155 for (i = 0; i < arity; i += 1)
2157 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2158 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2160 (_("attempt to do packed indexing of "
2161 "something other than a packed array"));
2164 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2165 LONGEST lowerbound, upperbound;
2168 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2170 lim_warning (_("don't know bounds of array"));
2171 lowerbound = upperbound = 0;
2174 idx = pos_atr (ind[i]);
2175 if (idx < lowerbound || idx > upperbound)
2176 lim_warning (_("packed array index %ld out of bounds"),
2178 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2179 elt_total_bit_offset += (idx - lowerbound) * bits;
2180 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2183 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2184 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2186 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2191 /* Non-zero iff TYPE includes negative integer values. */
2194 has_negatives (struct type *type)
2196 switch (TYPE_CODE (type))
2201 return !TYPE_UNSIGNED (type);
2202 case TYPE_CODE_RANGE:
2203 return TYPE_LOW_BOUND (type) < 0;
2208 /* Create a new value of type TYPE from the contents of OBJ starting
2209 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2210 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2211 assigning through the result will set the field fetched from.
2212 VALADDR is ignored unless OBJ is NULL, in which case,
2213 VALADDR+OFFSET must address the start of storage containing the
2214 packed value. The value returned in this case is never an lval.
2215 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2218 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2219 long offset, int bit_offset, int bit_size,
2223 int src, /* Index into the source area */
2224 targ, /* Index into the target area */
2225 srcBitsLeft, /* Number of source bits left to move */
2226 nsrc, ntarg, /* Number of source and target bytes */
2227 unusedLS, /* Number of bits in next significant
2228 byte of source that are unused */
2229 accumSize; /* Number of meaningful bits in accum */
2230 unsigned char *bytes; /* First byte containing data to unpack */
2231 unsigned char *unpacked;
2232 unsigned long accum; /* Staging area for bits being transferred */
2234 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2235 /* Transmit bytes from least to most significant; delta is the direction
2236 the indices move. */
2237 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
2239 type = ada_check_typedef (type);
2243 v = allocate_value (type);
2244 bytes = (unsigned char *) (valaddr + offset);
2246 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2249 value_address (obj) + offset);
2250 bytes = (unsigned char *) alloca (len);
2251 read_memory (value_address (v), bytes, len);
2255 v = allocate_value (type);
2256 bytes = (unsigned char *) value_contents (obj) + offset;
2263 set_value_component_location (v, obj);
2264 new_addr = value_address (obj) + offset;
2265 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2266 set_value_bitsize (v, bit_size);
2267 if (value_bitpos (v) >= HOST_CHAR_BIT)
2270 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2272 set_value_address (v, new_addr);
2275 set_value_bitsize (v, bit_size);
2276 unpacked = (unsigned char *) value_contents (v);
2278 srcBitsLeft = bit_size;
2280 ntarg = TYPE_LENGTH (type);
2284 memset (unpacked, 0, TYPE_LENGTH (type));
2287 else if (gdbarch_bits_big_endian (get_type_arch (type)))
2290 if (has_negatives (type)
2291 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2295 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2298 switch (TYPE_CODE (type))
2300 case TYPE_CODE_ARRAY:
2301 case TYPE_CODE_UNION:
2302 case TYPE_CODE_STRUCT:
2303 /* Non-scalar values must be aligned at a byte boundary... */
2305 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2306 /* ... And are placed at the beginning (most-significant) bytes
2308 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2313 targ = TYPE_LENGTH (type) - 1;
2319 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2322 unusedLS = bit_offset;
2325 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2332 /* Mask for removing bits of the next source byte that are not
2333 part of the value. */
2334 unsigned int unusedMSMask =
2335 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2337 /* Sign-extend bits for this byte. */
2338 unsigned int signMask = sign & ~unusedMSMask;
2341 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2342 accumSize += HOST_CHAR_BIT - unusedLS;
2343 if (accumSize >= HOST_CHAR_BIT)
2345 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2346 accumSize -= HOST_CHAR_BIT;
2347 accum >>= HOST_CHAR_BIT;
2351 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2358 accum |= sign << accumSize;
2359 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2360 accumSize -= HOST_CHAR_BIT;
2361 accum >>= HOST_CHAR_BIT;
2369 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2370 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2373 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2374 int src_offset, int n, int bits_big_endian_p)
2376 unsigned int accum, mask;
2377 int accum_bits, chunk_size;
2379 target += targ_offset / HOST_CHAR_BIT;
2380 targ_offset %= HOST_CHAR_BIT;
2381 source += src_offset / HOST_CHAR_BIT;
2382 src_offset %= HOST_CHAR_BIT;
2383 if (bits_big_endian_p)
2385 accum = (unsigned char) *source;
2387 accum_bits = HOST_CHAR_BIT - src_offset;
2393 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2394 accum_bits += HOST_CHAR_BIT;
2396 chunk_size = HOST_CHAR_BIT - targ_offset;
2399 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2400 mask = ((1 << chunk_size) - 1) << unused_right;
2403 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2405 accum_bits -= chunk_size;
2412 accum = (unsigned char) *source >> src_offset;
2414 accum_bits = HOST_CHAR_BIT - src_offset;
2418 accum = accum + ((unsigned char) *source << accum_bits);
2419 accum_bits += HOST_CHAR_BIT;
2421 chunk_size = HOST_CHAR_BIT - targ_offset;
2424 mask = ((1 << chunk_size) - 1) << targ_offset;
2425 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2427 accum_bits -= chunk_size;
2428 accum >>= chunk_size;
2435 /* Store the contents of FROMVAL into the location of TOVAL.
2436 Return a new value with the location of TOVAL and contents of
2437 FROMVAL. Handles assignment into packed fields that have
2438 floating-point or non-scalar types. */
2440 static struct value *
2441 ada_value_assign (struct value *toval, struct value *fromval)
2443 struct type *type = value_type (toval);
2444 int bits = value_bitsize (toval);
2446 toval = ada_coerce_ref (toval);
2447 fromval = ada_coerce_ref (fromval);
2449 if (ada_is_direct_array_type (value_type (toval)))
2450 toval = ada_coerce_to_simple_array (toval);
2451 if (ada_is_direct_array_type (value_type (fromval)))
2452 fromval = ada_coerce_to_simple_array (fromval);
2454 if (!deprecated_value_modifiable (toval))
2455 error (_("Left operand of assignment is not a modifiable lvalue."));
2457 if (VALUE_LVAL (toval) == lval_memory
2459 && (TYPE_CODE (type) == TYPE_CODE_FLT
2460 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2462 int len = (value_bitpos (toval)
2463 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2465 char *buffer = (char *) alloca (len);
2467 CORE_ADDR to_addr = value_address (toval);
2469 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2470 fromval = value_cast (type, fromval);
2472 read_memory (to_addr, buffer, len);
2473 from_size = value_bitsize (fromval);
2475 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2476 if (gdbarch_bits_big_endian (get_type_arch (type)))
2477 move_bits (buffer, value_bitpos (toval),
2478 value_contents (fromval), from_size - bits, bits, 1);
2480 move_bits (buffer, value_bitpos (toval),
2481 value_contents (fromval), 0, bits, 0);
2482 write_memory (to_addr, buffer, len);
2483 observer_notify_memory_changed (to_addr, len, buffer);
2485 val = value_copy (toval);
2486 memcpy (value_contents_raw (val), value_contents (fromval),
2487 TYPE_LENGTH (type));
2488 deprecated_set_value_type (val, type);
2493 return value_assign (toval, fromval);
2497 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2498 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2499 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2500 * COMPONENT, and not the inferior's memory. The current contents
2501 * of COMPONENT are ignored. */
2503 value_assign_to_component (struct value *container, struct value *component,
2506 LONGEST offset_in_container =
2507 (LONGEST) (value_address (component) - value_address (container));
2508 int bit_offset_in_container =
2509 value_bitpos (component) - value_bitpos (container);
2512 val = value_cast (value_type (component), val);
2514 if (value_bitsize (component) == 0)
2515 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2517 bits = value_bitsize (component);
2519 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2520 move_bits (value_contents_writeable (container) + offset_in_container,
2521 value_bitpos (container) + bit_offset_in_container,
2522 value_contents (val),
2523 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2526 move_bits (value_contents_writeable (container) + offset_in_container,
2527 value_bitpos (container) + bit_offset_in_container,
2528 value_contents (val), 0, bits, 0);
2531 /* The value of the element of array ARR at the ARITY indices given in IND.
2532 ARR may be either a simple array, GNAT array descriptor, or pointer
2536 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2540 struct type *elt_type;
2542 elt = ada_coerce_to_simple_array (arr);
2544 elt_type = ada_check_typedef (value_type (elt));
2545 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2546 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2547 return value_subscript_packed (elt, arity, ind);
2549 for (k = 0; k < arity; k += 1)
2551 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2552 error (_("too many subscripts (%d expected)"), k);
2553 elt = value_subscript (elt, pos_atr (ind[k]));
2558 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2559 value of the element of *ARR at the ARITY indices given in
2560 IND. Does not read the entire array into memory. */
2562 static struct value *
2563 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2568 for (k = 0; k < arity; k += 1)
2572 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2573 error (_("too many subscripts (%d expected)"), k);
2574 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2576 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2577 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2578 type = TYPE_TARGET_TYPE (type);
2581 return value_ind (arr);
2584 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2585 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2586 elements starting at index LOW. The lower bound of this array is LOW, as
2588 static struct value *
2589 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2592 struct type *type0 = ada_check_typedef (type);
2593 CORE_ADDR base = value_as_address (array_ptr)
2594 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)))
2595 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2596 struct type *index_type =
2597 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)),
2599 struct type *slice_type =
2600 create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type);
2602 return value_at_lazy (slice_type, base);
2606 static struct value *
2607 ada_value_slice (struct value *array, int low, int high)
2609 struct type *type = ada_check_typedef (value_type (array));
2610 struct type *index_type =
2611 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2612 struct type *slice_type =
2613 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2615 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2618 /* If type is a record type in the form of a standard GNAT array
2619 descriptor, returns the number of dimensions for type. If arr is a
2620 simple array, returns the number of "array of"s that prefix its
2621 type designation. Otherwise, returns 0. */
2624 ada_array_arity (struct type *type)
2631 type = desc_base_type (type);
2634 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2635 return desc_arity (desc_bounds_type (type));
2637 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2640 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2646 /* If TYPE is a record type in the form of a standard GNAT array
2647 descriptor or a simple array type, returns the element type for
2648 TYPE after indexing by NINDICES indices, or by all indices if
2649 NINDICES is -1. Otherwise, returns NULL. */
2652 ada_array_element_type (struct type *type, int nindices)
2654 type = desc_base_type (type);
2656 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2659 struct type *p_array_type;
2661 p_array_type = desc_data_target_type (type);
2663 k = ada_array_arity (type);
2667 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2668 if (nindices >= 0 && k > nindices)
2670 while (k > 0 && p_array_type != NULL)
2672 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2675 return p_array_type;
2677 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2679 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2681 type = TYPE_TARGET_TYPE (type);
2690 /* The type of nth index in arrays of given type (n numbering from 1).
2691 Does not examine memory. Throws an error if N is invalid or TYPE
2692 is not an array type. NAME is the name of the Ada attribute being
2693 evaluated ('range, 'first, 'last, or 'length); it is used in building
2694 the error message. */
2696 static struct type *
2697 ada_index_type (struct type *type, int n, const char *name)
2699 struct type *result_type;
2701 type = desc_base_type (type);
2703 if (n < 0 || n > ada_array_arity (type))
2704 error (_("invalid dimension number to '%s"), name);
2706 if (ada_is_simple_array_type (type))
2710 for (i = 1; i < n; i += 1)
2711 type = TYPE_TARGET_TYPE (type);
2712 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2713 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2714 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2715 perhaps stabsread.c would make more sense. */
2716 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2721 result_type = desc_index_type (desc_bounds_type (type), n);
2722 if (result_type == NULL)
2723 error (_("attempt to take bound of something that is not an array"));
2729 /* Given that arr is an array type, returns the lower bound of the
2730 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2731 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2732 array-descriptor type. It works for other arrays with bounds supplied
2733 by run-time quantities other than discriminants. */
2736 ada_array_bound_from_type (struct type * arr_type, int n, int which)
2738 struct type *type, *elt_type, *index_type_desc, *index_type;
2741 gdb_assert (which == 0 || which == 1);
2743 if (ada_is_constrained_packed_array_type (arr_type))
2744 arr_type = decode_constrained_packed_array_type (arr_type);
2746 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2747 return (LONGEST) - which;
2749 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2750 type = TYPE_TARGET_TYPE (arr_type);
2755 for (i = n; i > 1; i--)
2756 elt_type = TYPE_TARGET_TYPE (type);
2758 index_type_desc = ada_find_parallel_type (type, "___XA");
2759 ada_fixup_array_indexes_type (index_type_desc);
2760 if (index_type_desc != NULL)
2761 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2764 index_type = TYPE_INDEX_TYPE (elt_type);
2767 (LONGEST) (which == 0
2768 ? ada_discrete_type_low_bound (index_type)
2769 : ada_discrete_type_high_bound (index_type));
2772 /* Given that arr is an array value, returns the lower bound of the
2773 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2774 WHICH is 1. This routine will also work for arrays with bounds
2775 supplied by run-time quantities other than discriminants. */
2778 ada_array_bound (struct value *arr, int n, int which)
2780 struct type *arr_type = value_type (arr);
2782 if (ada_is_constrained_packed_array_type (arr_type))
2783 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
2784 else if (ada_is_simple_array_type (arr_type))
2785 return ada_array_bound_from_type (arr_type, n, which);
2787 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
2790 /* Given that arr is an array value, returns the length of the
2791 nth index. This routine will also work for arrays with bounds
2792 supplied by run-time quantities other than discriminants.
2793 Does not work for arrays indexed by enumeration types with representation
2794 clauses at the moment. */
2797 ada_array_length (struct value *arr, int n)
2799 struct type *arr_type = ada_check_typedef (value_type (arr));
2801 if (ada_is_constrained_packed_array_type (arr_type))
2802 return ada_array_length (decode_constrained_packed_array (arr), n);
2804 if (ada_is_simple_array_type (arr_type))
2805 return (ada_array_bound_from_type (arr_type, n, 1)
2806 - ada_array_bound_from_type (arr_type, n, 0) + 1);
2808 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2809 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
2812 /* An empty array whose type is that of ARR_TYPE (an array type),
2813 with bounds LOW to LOW-1. */
2815 static struct value *
2816 empty_array (struct type *arr_type, int low)
2818 struct type *arr_type0 = ada_check_typedef (arr_type);
2819 struct type *index_type =
2820 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)),
2822 struct type *elt_type = ada_array_element_type (arr_type0, 1);
2824 return allocate_value (create_array_type (NULL, elt_type, index_type));
2828 /* Name resolution */
2830 /* The "decoded" name for the user-definable Ada operator corresponding
2834 ada_decoded_op_name (enum exp_opcode op)
2838 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2840 if (ada_opname_table[i].op == op)
2841 return ada_opname_table[i].decoded;
2843 error (_("Could not find operator name for opcode"));
2847 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2848 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2849 undefined namespace) and converts operators that are
2850 user-defined into appropriate function calls. If CONTEXT_TYPE is
2851 non-null, it provides a preferred result type [at the moment, only
2852 type void has any effect---causing procedures to be preferred over
2853 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2854 return type is preferred. May change (expand) *EXP. */
2857 resolve (struct expression **expp, int void_context_p)
2859 struct type *context_type = NULL;
2863 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
2865 resolve_subexp (expp, &pc, 1, context_type);
2868 /* Resolve the operator of the subexpression beginning at
2869 position *POS of *EXPP. "Resolving" consists of replacing
2870 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2871 with their resolutions, replacing built-in operators with
2872 function calls to user-defined operators, where appropriate, and,
2873 when DEPROCEDURE_P is non-zero, converting function-valued variables
2874 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2875 are as in ada_resolve, above. */
2877 static struct value *
2878 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2879 struct type *context_type)
2883 struct expression *exp; /* Convenience: == *expp. */
2884 enum exp_opcode op = (*expp)->elts[pc].opcode;
2885 struct value **argvec; /* Vector of operand types (alloca'ed). */
2886 int nargs; /* Number of operands. */
2893 /* Pass one: resolve operands, saving their types and updating *pos,
2898 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2899 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2904 resolve_subexp (expp, pos, 0, NULL);
2906 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2911 resolve_subexp (expp, pos, 0, NULL);
2916 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
2919 case OP_ATR_MODULUS:
2929 case TERNOP_IN_RANGE:
2930 case BINOP_IN_BOUNDS:
2936 case OP_DISCRETE_RANGE:
2938 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2947 arg1 = resolve_subexp (expp, pos, 0, NULL);
2949 resolve_subexp (expp, pos, 1, NULL);
2951 resolve_subexp (expp, pos, 1, value_type (arg1));
2968 case BINOP_LOGICAL_AND:
2969 case BINOP_LOGICAL_OR:
2970 case BINOP_BITWISE_AND:
2971 case BINOP_BITWISE_IOR:
2972 case BINOP_BITWISE_XOR:
2975 case BINOP_NOTEQUAL:
2982 case BINOP_SUBSCRIPT:
2990 case UNOP_LOGICAL_NOT:
3006 case OP_INTERNALVAR:
3016 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3019 case STRUCTOP_STRUCT:
3020 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3033 error (_("Unexpected operator during name resolution"));
3036 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
3037 for (i = 0; i < nargs; i += 1)
3038 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3042 /* Pass two: perform any resolution on principal operator. */
3049 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3051 struct ada_symbol_info *candidates;
3055 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3056 (exp->elts[pc + 2].symbol),
3057 exp->elts[pc + 1].block, VAR_DOMAIN,
3060 if (n_candidates > 1)
3062 /* Types tend to get re-introduced locally, so if there
3063 are any local symbols that are not types, first filter
3066 for (j = 0; j < n_candidates; j += 1)
3067 switch (SYMBOL_CLASS (candidates[j].sym))
3072 case LOC_REGPARM_ADDR:
3080 if (j < n_candidates)
3083 while (j < n_candidates)
3085 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3087 candidates[j] = candidates[n_candidates - 1];
3096 if (n_candidates == 0)
3097 error (_("No definition found for %s"),
3098 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3099 else if (n_candidates == 1)
3101 else if (deprocedure_p
3102 && !is_nonfunction (candidates, n_candidates))
3104 i = ada_resolve_function
3105 (candidates, n_candidates, NULL, 0,
3106 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3109 error (_("Could not find a match for %s"),
3110 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3114 printf_filtered (_("Multiple matches for %s\n"),
3115 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3116 user_select_syms (candidates, n_candidates, 1);
3120 exp->elts[pc + 1].block = candidates[i].block;
3121 exp->elts[pc + 2].symbol = candidates[i].sym;
3122 if (innermost_block == NULL
3123 || contained_in (candidates[i].block, innermost_block))
3124 innermost_block = candidates[i].block;
3128 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3131 replace_operator_with_call (expp, pc, 0, 0,
3132 exp->elts[pc + 2].symbol,
3133 exp->elts[pc + 1].block);
3140 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3141 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3143 struct ada_symbol_info *candidates;
3147 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3148 (exp->elts[pc + 5].symbol),
3149 exp->elts[pc + 4].block, VAR_DOMAIN,
3151 if (n_candidates == 1)
3155 i = ada_resolve_function
3156 (candidates, n_candidates,
3158 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3161 error (_("Could not find a match for %s"),
3162 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3165 exp->elts[pc + 4].block = candidates[i].block;
3166 exp->elts[pc + 5].symbol = candidates[i].sym;
3167 if (innermost_block == NULL
3168 || contained_in (candidates[i].block, innermost_block))
3169 innermost_block = candidates[i].block;
3180 case BINOP_BITWISE_AND:
3181 case BINOP_BITWISE_IOR:
3182 case BINOP_BITWISE_XOR:
3184 case BINOP_NOTEQUAL:
3192 case UNOP_LOGICAL_NOT:
3194 if (possible_user_operator_p (op, argvec))
3196 struct ada_symbol_info *candidates;
3200 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3201 (struct block *) NULL, VAR_DOMAIN,
3203 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
3204 ada_decoded_op_name (op), NULL);
3208 replace_operator_with_call (expp, pc, nargs, 1,
3209 candidates[i].sym, candidates[i].block);
3220 return evaluate_subexp_type (exp, pos);
3223 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3224 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3226 /* The term "match" here is rather loose. The match is heuristic and
3230 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3232 ftype = ada_check_typedef (ftype);
3233 atype = ada_check_typedef (atype);
3235 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3236 ftype = TYPE_TARGET_TYPE (ftype);
3237 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3238 atype = TYPE_TARGET_TYPE (atype);
3240 switch (TYPE_CODE (ftype))
3243 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3245 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3246 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3247 TYPE_TARGET_TYPE (atype), 0);
3250 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3252 case TYPE_CODE_ENUM:
3253 case TYPE_CODE_RANGE:
3254 switch (TYPE_CODE (atype))
3257 case TYPE_CODE_ENUM:
3258 case TYPE_CODE_RANGE:
3264 case TYPE_CODE_ARRAY:
3265 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3266 || ada_is_array_descriptor_type (atype));
3268 case TYPE_CODE_STRUCT:
3269 if (ada_is_array_descriptor_type (ftype))
3270 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3271 || ada_is_array_descriptor_type (atype));
3273 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3274 && !ada_is_array_descriptor_type (atype));
3276 case TYPE_CODE_UNION:
3278 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3282 /* Return non-zero if the formals of FUNC "sufficiently match" the
3283 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3284 may also be an enumeral, in which case it is treated as a 0-
3285 argument function. */
3288 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3291 struct type *func_type = SYMBOL_TYPE (func);
3293 if (SYMBOL_CLASS (func) == LOC_CONST
3294 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3295 return (n_actuals == 0);
3296 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3299 if (TYPE_NFIELDS (func_type) != n_actuals)
3302 for (i = 0; i < n_actuals; i += 1)
3304 if (actuals[i] == NULL)
3308 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3310 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3312 if (!ada_type_match (ftype, atype, 1))
3319 /* False iff function type FUNC_TYPE definitely does not produce a value
3320 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3321 FUNC_TYPE is not a valid function type with a non-null return type
3322 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3325 return_match (struct type *func_type, struct type *context_type)
3327 struct type *return_type;
3329 if (func_type == NULL)
3332 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3333 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
3335 return_type = get_base_type (func_type);
3336 if (return_type == NULL)
3339 context_type = get_base_type (context_type);
3341 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3342 return context_type == NULL || return_type == context_type;
3343 else if (context_type == NULL)
3344 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3346 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3350 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3351 function (if any) that matches the types of the NARGS arguments in
3352 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3353 that returns that type, then eliminate matches that don't. If
3354 CONTEXT_TYPE is void and there is at least one match that does not
3355 return void, eliminate all matches that do.
3357 Asks the user if there is more than one match remaining. Returns -1
3358 if there is no such symbol or none is selected. NAME is used
3359 solely for messages. May re-arrange and modify SYMS in
3360 the process; the index returned is for the modified vector. */
3363 ada_resolve_function (struct ada_symbol_info syms[],
3364 int nsyms, struct value **args, int nargs,
3365 const char *name, struct type *context_type)
3369 int m; /* Number of hits */
3372 /* In the first pass of the loop, we only accept functions matching
3373 context_type. If none are found, we add a second pass of the loop
3374 where every function is accepted. */
3375 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3377 for (k = 0; k < nsyms; k += 1)
3379 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3381 if (ada_args_match (syms[k].sym, args, nargs)
3382 && (fallback || return_match (type, context_type)))
3394 printf_filtered (_("Multiple matches for %s\n"), name);
3395 user_select_syms (syms, m, 1);
3401 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3402 in a listing of choices during disambiguation (see sort_choices, below).
3403 The idea is that overloadings of a subprogram name from the
3404 same package should sort in their source order. We settle for ordering
3405 such symbols by their trailing number (__N or $N). */
3408 encoded_ordered_before (char *N0, char *N1)
3412 else if (N0 == NULL)
3418 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3420 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3422 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3423 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3428 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3431 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3433 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3434 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3436 return (strcmp (N0, N1) < 0);
3440 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3444 sort_choices (struct ada_symbol_info syms[], int nsyms)
3448 for (i = 1; i < nsyms; i += 1)
3450 struct ada_symbol_info sym = syms[i];
3453 for (j = i - 1; j >= 0; j -= 1)
3455 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3456 SYMBOL_LINKAGE_NAME (sym.sym)))
3458 syms[j + 1] = syms[j];
3464 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3465 by asking the user (if necessary), returning the number selected,
3466 and setting the first elements of SYMS items. Error if no symbols
3469 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3470 to be re-integrated one of these days. */
3473 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3476 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3478 int first_choice = (max_results == 1) ? 1 : 2;
3479 const char *select_mode = multiple_symbols_select_mode ();
3481 if (max_results < 1)
3482 error (_("Request to select 0 symbols!"));
3486 if (select_mode == multiple_symbols_cancel)
3488 canceled because the command is ambiguous\n\
3489 See set/show multiple-symbol."));
3491 /* If select_mode is "all", then return all possible symbols.
3492 Only do that if more than one symbol can be selected, of course.
3493 Otherwise, display the menu as usual. */
3494 if (select_mode == multiple_symbols_all && max_results > 1)
3497 printf_unfiltered (_("[0] cancel\n"));
3498 if (max_results > 1)
3499 printf_unfiltered (_("[1] all\n"));
3501 sort_choices (syms, nsyms);
3503 for (i = 0; i < nsyms; i += 1)
3505 if (syms[i].sym == NULL)
3508 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3510 struct symtab_and_line sal =
3511 find_function_start_sal (syms[i].sym, 1);
3513 if (sal.symtab == NULL)
3514 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3516 SYMBOL_PRINT_NAME (syms[i].sym),
3519 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3520 SYMBOL_PRINT_NAME (syms[i].sym),
3521 sal.symtab->filename, sal.line);
3527 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3528 && SYMBOL_TYPE (syms[i].sym) != NULL
3529 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3530 struct symtab *symtab = syms[i].sym->symtab;
3532 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3533 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3535 SYMBOL_PRINT_NAME (syms[i].sym),
3536 symtab->filename, SYMBOL_LINE (syms[i].sym));
3537 else if (is_enumeral
3538 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3540 printf_unfiltered (("[%d] "), i + first_choice);
3541 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3543 printf_unfiltered (_("'(%s) (enumeral)\n"),
3544 SYMBOL_PRINT_NAME (syms[i].sym));
3546 else if (symtab != NULL)
3547 printf_unfiltered (is_enumeral
3548 ? _("[%d] %s in %s (enumeral)\n")
3549 : _("[%d] %s at %s:?\n"),
3551 SYMBOL_PRINT_NAME (syms[i].sym),
3554 printf_unfiltered (is_enumeral
3555 ? _("[%d] %s (enumeral)\n")
3556 : _("[%d] %s at ?\n"),
3558 SYMBOL_PRINT_NAME (syms[i].sym));
3562 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3565 for (i = 0; i < n_chosen; i += 1)
3566 syms[i] = syms[chosen[i]];
3571 /* Read and validate a set of numeric choices from the user in the
3572 range 0 .. N_CHOICES-1. Place the results in increasing
3573 order in CHOICES[0 .. N-1], and return N.
3575 The user types choices as a sequence of numbers on one line
3576 separated by blanks, encoding them as follows:
3578 + A choice of 0 means to cancel the selection, throwing an error.
3579 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3580 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3582 The user is not allowed to choose more than MAX_RESULTS values.
3584 ANNOTATION_SUFFIX, if present, is used to annotate the input
3585 prompts (for use with the -f switch). */
3588 get_selections (int *choices, int n_choices, int max_results,
3589 int is_all_choice, char *annotation_suffix)
3594 int first_choice = is_all_choice ? 2 : 1;
3596 prompt = getenv ("PS2");
3600 args = command_line_input (prompt, 0, annotation_suffix);
3603 error_no_arg (_("one or more choice numbers"));
3607 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3608 order, as given in args. Choices are validated. */
3614 while (isspace (*args))
3616 if (*args == '\0' && n_chosen == 0)
3617 error_no_arg (_("one or more choice numbers"));
3618 else if (*args == '\0')
3621 choice = strtol (args, &args2, 10);
3622 if (args == args2 || choice < 0
3623 || choice > n_choices + first_choice - 1)
3624 error (_("Argument must be choice number"));
3628 error (_("cancelled"));
3630 if (choice < first_choice)
3632 n_chosen = n_choices;
3633 for (j = 0; j < n_choices; j += 1)
3637 choice -= first_choice;
3639 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3643 if (j < 0 || choice != choices[j])
3647 for (k = n_chosen - 1; k > j; k -= 1)
3648 choices[k + 1] = choices[k];
3649 choices[j + 1] = choice;
3654 if (n_chosen > max_results)
3655 error (_("Select no more than %d of the above"), max_results);
3660 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3661 on the function identified by SYM and BLOCK, and taking NARGS
3662 arguments. Update *EXPP as needed to hold more space. */
3665 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3666 int oplen, struct symbol *sym,
3667 struct block *block)
3669 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3670 symbol, -oplen for operator being replaced). */
3671 struct expression *newexp = (struct expression *)
3672 xzalloc (sizeof (struct expression)
3673 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3674 struct expression *exp = *expp;
3676 newexp->nelts = exp->nelts + 7 - oplen;
3677 newexp->language_defn = exp->language_defn;
3678 newexp->gdbarch = exp->gdbarch;
3679 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3680 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3681 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3683 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3684 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3686 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3687 newexp->elts[pc + 4].block = block;
3688 newexp->elts[pc + 5].symbol = sym;
3694 /* Type-class predicates */
3696 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3700 numeric_type_p (struct type *type)
3706 switch (TYPE_CODE (type))
3711 case TYPE_CODE_RANGE:
3712 return (type == TYPE_TARGET_TYPE (type)
3713 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3720 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3723 integer_type_p (struct type *type)
3729 switch (TYPE_CODE (type))
3733 case TYPE_CODE_RANGE:
3734 return (type == TYPE_TARGET_TYPE (type)
3735 || integer_type_p (TYPE_TARGET_TYPE (type)));
3742 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3745 scalar_type_p (struct type *type)
3751 switch (TYPE_CODE (type))
3754 case TYPE_CODE_RANGE:
3755 case TYPE_CODE_ENUM:
3764 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3767 discrete_type_p (struct type *type)
3773 switch (TYPE_CODE (type))
3776 case TYPE_CODE_RANGE:
3777 case TYPE_CODE_ENUM:
3778 case TYPE_CODE_BOOL:
3786 /* Returns non-zero if OP with operands in the vector ARGS could be
3787 a user-defined function. Errs on the side of pre-defined operators
3788 (i.e., result 0). */
3791 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3793 struct type *type0 =
3794 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3795 struct type *type1 =
3796 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3810 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3814 case BINOP_BITWISE_AND:
3815 case BINOP_BITWISE_IOR:
3816 case BINOP_BITWISE_XOR:
3817 return (!(integer_type_p (type0) && integer_type_p (type1)));
3820 case BINOP_NOTEQUAL:
3825 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3828 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3831 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3835 case UNOP_LOGICAL_NOT:
3837 return (!numeric_type_p (type0));
3846 1. In the following, we assume that a renaming type's name may
3847 have an ___XD suffix. It would be nice if this went away at some
3849 2. We handle both the (old) purely type-based representation of
3850 renamings and the (new) variable-based encoding. At some point,
3851 it is devoutly to be hoped that the former goes away
3852 (FIXME: hilfinger-2007-07-09).
3853 3. Subprogram renamings are not implemented, although the XRS
3854 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3856 /* If SYM encodes a renaming,
3858 <renaming> renames <renamed entity>,
3860 sets *LEN to the length of the renamed entity's name,
3861 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3862 the string describing the subcomponent selected from the renamed
3863 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3864 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3865 are undefined). Otherwise, returns a value indicating the category
3866 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3867 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3868 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3869 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3870 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3871 may be NULL, in which case they are not assigned.
3873 [Currently, however, GCC does not generate subprogram renamings.] */
3875 enum ada_renaming_category
3876 ada_parse_renaming (struct symbol *sym,
3877 const char **renamed_entity, int *len,
3878 const char **renaming_expr)
3880 enum ada_renaming_category kind;
3885 return ADA_NOT_RENAMING;
3886 switch (SYMBOL_CLASS (sym))
3889 return ADA_NOT_RENAMING;
3891 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3892 renamed_entity, len, renaming_expr);
3896 case LOC_OPTIMIZED_OUT:
3897 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3899 return ADA_NOT_RENAMING;
3903 kind = ADA_OBJECT_RENAMING;
3907 kind = ADA_EXCEPTION_RENAMING;
3911 kind = ADA_PACKAGE_RENAMING;
3915 kind = ADA_SUBPROGRAM_RENAMING;
3919 return ADA_NOT_RENAMING;
3923 if (renamed_entity != NULL)
3924 *renamed_entity = info;
3925 suffix = strstr (info, "___XE");
3926 if (suffix == NULL || suffix == info)
3927 return ADA_NOT_RENAMING;
3929 *len = strlen (info) - strlen (suffix);
3931 if (renaming_expr != NULL)
3932 *renaming_expr = suffix;
3936 /* Assuming TYPE encodes a renaming according to the old encoding in
3937 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3938 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3939 ADA_NOT_RENAMING otherwise. */
3940 static enum ada_renaming_category
3941 parse_old_style_renaming (struct type *type,
3942 const char **renamed_entity, int *len,
3943 const char **renaming_expr)
3945 enum ada_renaming_category kind;
3950 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3951 || TYPE_NFIELDS (type) != 1)
3952 return ADA_NOT_RENAMING;
3954 name = type_name_no_tag (type);
3956 return ADA_NOT_RENAMING;
3958 name = strstr (name, "___XR");
3960 return ADA_NOT_RENAMING;
3965 kind = ADA_OBJECT_RENAMING;
3968 kind = ADA_EXCEPTION_RENAMING;
3971 kind = ADA_PACKAGE_RENAMING;
3974 kind = ADA_SUBPROGRAM_RENAMING;
3977 return ADA_NOT_RENAMING;
3980 info = TYPE_FIELD_NAME (type, 0);
3982 return ADA_NOT_RENAMING;
3983 if (renamed_entity != NULL)
3984 *renamed_entity = info;
3985 suffix = strstr (info, "___XE");
3986 if (renaming_expr != NULL)
3987 *renaming_expr = suffix + 5;
3988 if (suffix == NULL || suffix == info)
3989 return ADA_NOT_RENAMING;
3991 *len = suffix - info;
3997 /* Evaluation: Function Calls */
3999 /* Return an lvalue containing the value VAL. This is the identity on
4000 lvalues, and otherwise has the side-effect of allocating memory
4001 in the inferior where a copy of the value contents is copied. */
4003 static struct value *
4004 ensure_lval (struct value *val)
4006 if (VALUE_LVAL (val) == not_lval
4007 || VALUE_LVAL (val) == lval_internalvar)
4009 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4010 const CORE_ADDR addr =
4011 value_as_long (value_allocate_space_in_inferior (len));
4013 set_value_address (val, addr);
4014 VALUE_LVAL (val) = lval_memory;
4015 write_memory (addr, value_contents (val), len);
4021 /* Return the value ACTUAL, converted to be an appropriate value for a
4022 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4023 allocating any necessary descriptors (fat pointers), or copies of
4024 values not residing in memory, updating it as needed. */
4027 ada_convert_actual (struct value *actual, struct type *formal_type0)
4029 struct type *actual_type = ada_check_typedef (value_type (actual));
4030 struct type *formal_type = ada_check_typedef (formal_type0);
4031 struct type *formal_target =
4032 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4033 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4034 struct type *actual_target =
4035 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4036 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4038 if (ada_is_array_descriptor_type (formal_target)
4039 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4040 return make_array_descriptor (formal_type, actual);
4041 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4042 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4044 struct value *result;
4046 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4047 && ada_is_array_descriptor_type (actual_target))
4048 result = desc_data (actual);
4049 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4051 if (VALUE_LVAL (actual) != lval_memory)
4055 actual_type = ada_check_typedef (value_type (actual));
4056 val = allocate_value (actual_type);
4057 memcpy ((char *) value_contents_raw (val),
4058 (char *) value_contents (actual),
4059 TYPE_LENGTH (actual_type));
4060 actual = ensure_lval (val);
4062 result = value_addr (actual);
4066 return value_cast_pointers (formal_type, result);
4068 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4069 return ada_value_ind (actual);
4074 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4075 type TYPE. This is usually an inefficient no-op except on some targets
4076 (such as AVR) where the representation of a pointer and an address
4080 value_pointer (struct value *value, struct type *type)
4082 struct gdbarch *gdbarch = get_type_arch (type);
4083 unsigned len = TYPE_LENGTH (type);
4084 gdb_byte *buf = alloca (len);
4087 addr = value_address (value);
4088 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4089 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4094 /* Push a descriptor of type TYPE for array value ARR on the stack at
4095 *SP, updating *SP to reflect the new descriptor. Return either
4096 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4097 to-descriptor type rather than a descriptor type), a struct value *
4098 representing a pointer to this descriptor. */
4100 static struct value *
4101 make_array_descriptor (struct type *type, struct value *arr)
4103 struct type *bounds_type = desc_bounds_type (type);
4104 struct type *desc_type = desc_base_type (type);
4105 struct value *descriptor = allocate_value (desc_type);
4106 struct value *bounds = allocate_value (bounds_type);
4109 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4112 modify_field (value_type (bounds), value_contents_writeable (bounds),
4113 ada_array_bound (arr, i, 0),
4114 desc_bound_bitpos (bounds_type, i, 0),
4115 desc_bound_bitsize (bounds_type, i, 0));
4116 modify_field (value_type (bounds), value_contents_writeable (bounds),
4117 ada_array_bound (arr, i, 1),
4118 desc_bound_bitpos (bounds_type, i, 1),
4119 desc_bound_bitsize (bounds_type, i, 1));
4122 bounds = ensure_lval (bounds);
4124 modify_field (value_type (descriptor),
4125 value_contents_writeable (descriptor),
4126 value_pointer (ensure_lval (arr),
4127 TYPE_FIELD_TYPE (desc_type, 0)),
4128 fat_pntr_data_bitpos (desc_type),
4129 fat_pntr_data_bitsize (desc_type));
4131 modify_field (value_type (descriptor),
4132 value_contents_writeable (descriptor),
4133 value_pointer (bounds,
4134 TYPE_FIELD_TYPE (desc_type, 1)),
4135 fat_pntr_bounds_bitpos (desc_type),
4136 fat_pntr_bounds_bitsize (desc_type));
4138 descriptor = ensure_lval (descriptor);
4140 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4141 return value_addr (descriptor);
4146 /* Dummy definitions for an experimental caching module that is not
4147 * used in the public sources. */
4150 lookup_cached_symbol (const char *name, domain_enum namespace,
4151 struct symbol **sym, struct block **block)
4157 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
4158 struct block *block)
4164 /* Return the result of a standard (literal, C-like) lookup of NAME in
4165 given DOMAIN, visible from lexical block BLOCK. */
4167 static struct symbol *
4168 standard_lookup (const char *name, const struct block *block,
4173 if (lookup_cached_symbol (name, domain, &sym, NULL))
4175 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4176 cache_symbol (name, domain, sym, block_found);
4181 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4182 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4183 since they contend in overloading in the same way. */
4185 is_nonfunction (struct ada_symbol_info syms[], int n)
4189 for (i = 0; i < n; i += 1)
4190 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4191 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4192 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
4198 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4199 struct types. Otherwise, they may not. */
4202 equiv_types (struct type *type0, struct type *type1)
4206 if (type0 == NULL || type1 == NULL
4207 || TYPE_CODE (type0) != TYPE_CODE (type1))
4209 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4210 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4211 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4212 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4218 /* True iff SYM0 represents the same entity as SYM1, or one that is
4219 no more defined than that of SYM1. */
4222 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4226 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4227 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4230 switch (SYMBOL_CLASS (sym0))
4236 struct type *type0 = SYMBOL_TYPE (sym0);
4237 struct type *type1 = SYMBOL_TYPE (sym1);
4238 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4239 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4240 int len0 = strlen (name0);
4243 TYPE_CODE (type0) == TYPE_CODE (type1)
4244 && (equiv_types (type0, type1)
4245 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4246 && strncmp (name1 + len0, "___XV", 5) == 0));
4249 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4250 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4256 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4257 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4260 add_defn_to_vec (struct obstack *obstackp,
4262 struct block *block)
4265 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4267 /* Do not try to complete stub types, as the debugger is probably
4268 already scanning all symbols matching a certain name at the
4269 time when this function is called. Trying to replace the stub
4270 type by its associated full type will cause us to restart a scan
4271 which may lead to an infinite recursion. Instead, the client
4272 collecting the matching symbols will end up collecting several
4273 matches, with at least one of them complete. It can then filter
4274 out the stub ones if needed. */
4276 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4278 if (lesseq_defined_than (sym, prevDefns[i].sym))
4280 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4282 prevDefns[i].sym = sym;
4283 prevDefns[i].block = block;
4289 struct ada_symbol_info info;
4293 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4297 /* Number of ada_symbol_info structures currently collected in
4298 current vector in *OBSTACKP. */
4301 num_defns_collected (struct obstack *obstackp)
4303 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4306 /* Vector of ada_symbol_info structures currently collected in current
4307 vector in *OBSTACKP. If FINISH, close off the vector and return
4308 its final address. */
4310 static struct ada_symbol_info *
4311 defns_collected (struct obstack *obstackp, int finish)
4314 return obstack_finish (obstackp);
4316 return (struct ada_symbol_info *) obstack_base (obstackp);
4319 /* Return a minimal symbol matching NAME according to Ada decoding
4320 rules. Returns NULL if there is no such minimal symbol. Names
4321 prefixed with "standard__" are handled specially: "standard__" is
4322 first stripped off, and only static and global symbols are searched. */
4324 struct minimal_symbol *
4325 ada_lookup_simple_minsym (const char *name)
4327 struct objfile *objfile;
4328 struct minimal_symbol *msymbol;
4331 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4333 name += sizeof ("standard__") - 1;
4337 wild_match = (strstr (name, "__") == NULL);
4339 ALL_MSYMBOLS (objfile, msymbol)
4341 if (match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4342 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4349 /* For all subprograms that statically enclose the subprogram of the
4350 selected frame, add symbols matching identifier NAME in DOMAIN
4351 and their blocks to the list of data in OBSTACKP, as for
4352 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4356 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4357 const char *name, domain_enum namespace,
4362 /* True if TYPE is definitely an artificial type supplied to a symbol
4363 for which no debugging information was given in the symbol file. */
4366 is_nondebugging_type (struct type *type)
4368 char *name = ada_type_name (type);
4370 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4373 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4374 that are deemed "identical" for practical purposes.
4376 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4377 types and that their number of enumerals is identical (in other
4378 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4381 ada_identical_enum_types_p (struct type *type1, struct type *type2)
4385 /* The heuristic we use here is fairly conservative. We consider
4386 that 2 enumerate types are identical if they have the same
4387 number of enumerals and that all enumerals have the same
4388 underlying value and name. */
4390 /* All enums in the type should have an identical underlying value. */
4391 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4392 if (TYPE_FIELD_BITPOS (type1, i) != TYPE_FIELD_BITPOS (type2, i))
4395 /* All enumerals should also have the same name (modulo any numerical
4397 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4399 char *name_1 = TYPE_FIELD_NAME (type1, i);
4400 char *name_2 = TYPE_FIELD_NAME (type2, i);
4401 int len_1 = strlen (name_1);
4402 int len_2 = strlen (name_2);
4404 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
4405 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
4407 || strncmp (TYPE_FIELD_NAME (type1, i),
4408 TYPE_FIELD_NAME (type2, i),
4416 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4417 that are deemed "identical" for practical purposes. Sometimes,
4418 enumerals are not strictly identical, but their types are so similar
4419 that they can be considered identical.
4421 For instance, consider the following code:
4423 type Color is (Black, Red, Green, Blue, White);
4424 type RGB_Color is new Color range Red .. Blue;
4426 Type RGB_Color is a subrange of an implicit type which is a copy
4427 of type Color. If we call that implicit type RGB_ColorB ("B" is
4428 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4429 As a result, when an expression references any of the enumeral
4430 by name (Eg. "print green"), the expression is technically
4431 ambiguous and the user should be asked to disambiguate. But
4432 doing so would only hinder the user, since it wouldn't matter
4433 what choice he makes, the outcome would always be the same.
4434 So, for practical purposes, we consider them as the same. */
4437 symbols_are_identical_enums (struct ada_symbol_info *syms, int nsyms)
4441 /* Before performing a thorough comparison check of each type,
4442 we perform a series of inexpensive checks. We expect that these
4443 checks will quickly fail in the vast majority of cases, and thus
4444 help prevent the unnecessary use of a more expensive comparison.
4445 Said comparison also expects us to make some of these checks
4446 (see ada_identical_enum_types_p). */
4448 /* Quick check: All symbols should have an enum type. */
4449 for (i = 0; i < nsyms; i++)
4450 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM)
4453 /* Quick check: They should all have the same value. */
4454 for (i = 1; i < nsyms; i++)
4455 if (SYMBOL_VALUE (syms[i].sym) != SYMBOL_VALUE (syms[0].sym))
4458 /* Quick check: They should all have the same number of enumerals. */
4459 for (i = 1; i < nsyms; i++)
4460 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].sym))
4461 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].sym)))
4464 /* All the sanity checks passed, so we might have a set of
4465 identical enumeration types. Perform a more complete
4466 comparison of the type of each symbol. */
4467 for (i = 1; i < nsyms; i++)
4468 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].sym),
4469 SYMBOL_TYPE (syms[0].sym)))
4475 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4476 duplicate other symbols in the list (The only case I know of where
4477 this happens is when object files containing stabs-in-ecoff are
4478 linked with files containing ordinary ecoff debugging symbols (or no
4479 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4480 Returns the number of items in the modified list. */
4483 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4487 /* We should never be called with less than 2 symbols, as there
4488 cannot be any extra symbol in that case. But it's easy to
4489 handle, since we have nothing to do in that case. */
4498 /* If two symbols have the same name and one of them is a stub type,
4499 the get rid of the stub. */
4501 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4502 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4504 for (j = 0; j < nsyms; j++)
4507 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4508 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4509 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4510 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4515 /* Two symbols with the same name, same class and same address
4516 should be identical. */
4518 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4519 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4520 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4522 for (j = 0; j < nsyms; j += 1)
4525 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4526 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4527 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4528 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4529 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4530 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4537 for (j = i + 1; j < nsyms; j += 1)
4538 syms[j - 1] = syms[j];
4545 /* If all the remaining symbols are identical enumerals, then
4546 just keep the first one and discard the rest.
4548 Unlike what we did previously, we do not discard any entry
4549 unless they are ALL identical. This is because the symbol
4550 comparison is not a strict comparison, but rather a practical
4551 comparison. If all symbols are considered identical, then
4552 we can just go ahead and use the first one and discard the rest.
4553 But if we cannot reduce the list to a single element, we have
4554 to ask the user to disambiguate anyways. And if we have to
4555 present a multiple-choice menu, it's less confusing if the list
4556 isn't missing some choices that were identical and yet distinct. */
4557 if (symbols_are_identical_enums (syms, nsyms))
4563 /* Given a type that corresponds to a renaming entity, use the type name
4564 to extract the scope (package name or function name, fully qualified,
4565 and following the GNAT encoding convention) where this renaming has been
4566 defined. The string returned needs to be deallocated after use. */
4569 xget_renaming_scope (struct type *renaming_type)
4571 /* The renaming types adhere to the following convention:
4572 <scope>__<rename>___<XR extension>.
4573 So, to extract the scope, we search for the "___XR" extension,
4574 and then backtrack until we find the first "__". */
4576 const char *name = type_name_no_tag (renaming_type);
4577 char *suffix = strstr (name, "___XR");
4582 /* Now, backtrack a bit until we find the first "__". Start looking
4583 at suffix - 3, as the <rename> part is at least one character long. */
4585 for (last = suffix - 3; last > name; last--)
4586 if (last[0] == '_' && last[1] == '_')
4589 /* Make a copy of scope and return it. */
4591 scope_len = last - name;
4592 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4594 strncpy (scope, name, scope_len);
4595 scope[scope_len] = '\0';
4600 /* Return nonzero if NAME corresponds to a package name. */
4603 is_package_name (const char *name)
4605 /* Here, We take advantage of the fact that no symbols are generated
4606 for packages, while symbols are generated for each function.
4607 So the condition for NAME represent a package becomes equivalent
4608 to NAME not existing in our list of symbols. There is only one
4609 small complication with library-level functions (see below). */
4613 /* If it is a function that has not been defined at library level,
4614 then we should be able to look it up in the symbols. */
4615 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4618 /* Library-level function names start with "_ada_". See if function
4619 "_ada_" followed by NAME can be found. */
4621 /* Do a quick check that NAME does not contain "__", since library-level
4622 functions names cannot contain "__" in them. */
4623 if (strstr (name, "__") != NULL)
4626 fun_name = xstrprintf ("_ada_%s", name);
4628 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4631 /* Return nonzero if SYM corresponds to a renaming entity that is
4632 not visible from FUNCTION_NAME. */
4635 old_renaming_is_invisible (const struct symbol *sym, char *function_name)
4639 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4642 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4644 make_cleanup (xfree, scope);
4646 /* If the rename has been defined in a package, then it is visible. */
4647 if (is_package_name (scope))
4650 /* Check that the rename is in the current function scope by checking
4651 that its name starts with SCOPE. */
4653 /* If the function name starts with "_ada_", it means that it is
4654 a library-level function. Strip this prefix before doing the
4655 comparison, as the encoding for the renaming does not contain
4657 if (strncmp (function_name, "_ada_", 5) == 0)
4660 return (strncmp (function_name, scope, strlen (scope)) != 0);
4663 /* Remove entries from SYMS that corresponds to a renaming entity that
4664 is not visible from the function associated with CURRENT_BLOCK or
4665 that is superfluous due to the presence of more specific renaming
4666 information. Places surviving symbols in the initial entries of
4667 SYMS and returns the number of surviving symbols.
4670 First, in cases where an object renaming is implemented as a
4671 reference variable, GNAT may produce both the actual reference
4672 variable and the renaming encoding. In this case, we discard the
4675 Second, GNAT emits a type following a specified encoding for each renaming
4676 entity. Unfortunately, STABS currently does not support the definition
4677 of types that are local to a given lexical block, so all renamings types
4678 are emitted at library level. As a consequence, if an application
4679 contains two renaming entities using the same name, and a user tries to
4680 print the value of one of these entities, the result of the ada symbol
4681 lookup will also contain the wrong renaming type.
4683 This function partially covers for this limitation by attempting to
4684 remove from the SYMS list renaming symbols that should be visible
4685 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4686 method with the current information available. The implementation
4687 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4689 - When the user tries to print a rename in a function while there
4690 is another rename entity defined in a package: Normally, the
4691 rename in the function has precedence over the rename in the
4692 package, so the latter should be removed from the list. This is
4693 currently not the case.
4695 - This function will incorrectly remove valid renames if
4696 the CURRENT_BLOCK corresponds to a function which symbol name
4697 has been changed by an "Export" pragma. As a consequence,
4698 the user will be unable to print such rename entities. */
4701 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4702 int nsyms, const struct block *current_block)
4704 struct symbol *current_function;
4705 char *current_function_name;
4707 int is_new_style_renaming;
4709 /* If there is both a renaming foo___XR... encoded as a variable and
4710 a simple variable foo in the same block, discard the latter.
4711 First, zero out such symbols, then compress. */
4712 is_new_style_renaming = 0;
4713 for (i = 0; i < nsyms; i += 1)
4715 struct symbol *sym = syms[i].sym;
4716 struct block *block = syms[i].block;
4720 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4722 name = SYMBOL_LINKAGE_NAME (sym);
4723 suffix = strstr (name, "___XR");
4727 int name_len = suffix - name;
4730 is_new_style_renaming = 1;
4731 for (j = 0; j < nsyms; j += 1)
4732 if (i != j && syms[j].sym != NULL
4733 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4735 && block == syms[j].block)
4739 if (is_new_style_renaming)
4743 for (j = k = 0; j < nsyms; j += 1)
4744 if (syms[j].sym != NULL)
4752 /* Extract the function name associated to CURRENT_BLOCK.
4753 Abort if unable to do so. */
4755 if (current_block == NULL)
4758 current_function = block_linkage_function (current_block);
4759 if (current_function == NULL)
4762 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4763 if (current_function_name == NULL)
4766 /* Check each of the symbols, and remove it from the list if it is
4767 a type corresponding to a renaming that is out of the scope of
4768 the current block. */
4773 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4774 == ADA_OBJECT_RENAMING
4775 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4779 for (j = i + 1; j < nsyms; j += 1)
4780 syms[j - 1] = syms[j];
4790 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4791 whose name and domain match NAME and DOMAIN respectively.
4792 If no match was found, then extend the search to "enclosing"
4793 routines (in other words, if we're inside a nested function,
4794 search the symbols defined inside the enclosing functions).
4796 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4799 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4800 struct block *block, domain_enum domain,
4803 int block_depth = 0;
4805 while (block != NULL)
4808 ada_add_block_symbols (obstackp, block, name, domain, NULL, wild_match);
4810 /* If we found a non-function match, assume that's the one. */
4811 if (is_nonfunction (defns_collected (obstackp, 0),
4812 num_defns_collected (obstackp)))
4815 block = BLOCK_SUPERBLOCK (block);
4818 /* If no luck so far, try to find NAME as a local symbol in some lexically
4819 enclosing subprogram. */
4820 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4821 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match);
4824 /* An object of this type is used as the user_data argument when
4825 calling the map_matching_symbols method. */
4829 struct objfile *objfile;
4830 struct obstack *obstackp;
4831 struct symbol *arg_sym;
4835 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4836 to a list of symbols. DATA0 is a pointer to a struct match_data *
4837 containing the obstack that collects the symbol list, the file that SYM
4838 must come from, a flag indicating whether a non-argument symbol has
4839 been found in the current block, and the last argument symbol
4840 passed in SYM within the current block (if any). When SYM is null,
4841 marking the end of a block, the argument symbol is added if no
4842 other has been found. */
4845 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
4847 struct match_data *data = (struct match_data *) data0;
4851 if (!data->found_sym && data->arg_sym != NULL)
4852 add_defn_to_vec (data->obstackp,
4853 fixup_symbol_section (data->arg_sym, data->objfile),
4855 data->found_sym = 0;
4856 data->arg_sym = NULL;
4860 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4862 else if (SYMBOL_IS_ARGUMENT (sym))
4863 data->arg_sym = sym;
4866 data->found_sym = 1;
4867 add_defn_to_vec (data->obstackp,
4868 fixup_symbol_section (sym, data->objfile),
4875 /* Compare STRING1 to STRING2, with results as for strcmp.
4876 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4877 implies compare_names (STRING1, STRING2) (they may differ as to
4878 what symbols compare equal). */
4881 compare_names (const char *string1, const char *string2)
4883 while (*string1 != '\0' && *string2 != '\0')
4885 if (isspace (*string1) || isspace (*string2))
4886 return strcmp_iw_ordered (string1, string2);
4887 if (*string1 != *string2)
4895 return strcmp_iw_ordered (string1, string2);
4897 if (*string2 == '\0')
4899 if (is_name_suffix (string1))
4906 if (*string2 == '(')
4907 return strcmp_iw_ordered (string1, string2);
4909 return *string1 - *string2;
4913 /* Add to OBSTACKP all non-local symbols whose name and domain match
4914 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4915 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4918 add_nonlocal_symbols (struct obstack *obstackp, const char *name,
4919 domain_enum domain, int global,
4922 struct objfile *objfile;
4923 struct match_data data;
4925 memset (&data, 0, sizeof data);
4926 data.obstackp = obstackp;
4928 ALL_OBJFILES (objfile)
4930 data.objfile = objfile;
4933 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4934 aux_add_nonlocal_symbols, &data,
4937 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4938 aux_add_nonlocal_symbols, &data,
4939 full_match, compare_names);
4942 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
4944 ALL_OBJFILES (objfile)
4946 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
4947 strcpy (name1, "_ada_");
4948 strcpy (name1 + sizeof ("_ada_") - 1, name);
4949 data.objfile = objfile;
4950 objfile->sf->qf->map_matching_symbols (name1, domain,
4952 aux_add_nonlocal_symbols,
4954 full_match, compare_names);
4959 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4960 scope and in global scopes, returning the number of matches. Sets
4961 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4962 indicating the symbols found and the blocks and symbol tables (if
4963 any) in which they were found. This vector are transient---good only to
4964 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4965 symbol match within the nest of blocks whose innermost member is BLOCK0,
4966 is the one match returned (no other matches in that or
4967 enclosing blocks is returned). If there are any matches in or
4968 surrounding BLOCK0, then these alone are returned. Otherwise, the
4969 search extends to global and file-scope (static) symbol tables.
4970 Names prefixed with "standard__" are handled specially: "standard__"
4971 is first stripped off, and only static and global symbols are searched. */
4974 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4975 domain_enum namespace,
4976 struct ada_symbol_info **results)
4979 struct block *block;
4985 obstack_free (&symbol_list_obstack, NULL);
4986 obstack_init (&symbol_list_obstack);
4990 /* Search specified block and its superiors. */
4992 wild_match = (strstr (name0, "__") == NULL);
4994 block = (struct block *) block0; /* FIXME: No cast ought to be
4995 needed, but adding const will
4996 have a cascade effect. */
4998 /* Special case: If the user specifies a symbol name inside package
4999 Standard, do a non-wild matching of the symbol name without
5000 the "standard__" prefix. This was primarily introduced in order
5001 to allow the user to specifically access the standard exceptions
5002 using, for instance, Standard.Constraint_Error when Constraint_Error
5003 is ambiguous (due to the user defining its own Constraint_Error
5004 entity inside its program). */
5005 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
5009 name = name0 + sizeof ("standard__") - 1;
5012 /* Check the non-global symbols. If we have ANY match, then we're done. */
5014 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
5016 if (num_defns_collected (&symbol_list_obstack) > 0)
5019 /* No non-global symbols found. Check our cache to see if we have
5020 already performed this search before. If we have, then return
5024 if (lookup_cached_symbol (name0, namespace, &sym, &block))
5027 add_defn_to_vec (&symbol_list_obstack, sym, block);
5031 /* Search symbols from all global blocks. */
5033 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
5036 /* Now add symbols from all per-file blocks if we've gotten no hits
5037 (not strictly correct, but perhaps better than an error). */
5039 if (num_defns_collected (&symbol_list_obstack) == 0)
5040 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
5044 ndefns = num_defns_collected (&symbol_list_obstack);
5045 *results = defns_collected (&symbol_list_obstack, 1);
5047 ndefns = remove_extra_symbols (*results, ndefns);
5050 cache_symbol (name0, namespace, NULL, NULL);
5052 if (ndefns == 1 && cacheIfUnique)
5053 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
5055 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
5060 /* If NAME is the name of an entity, return a string that should
5061 be used to look that entity up in Ada units. This string should
5062 be deallocated after use using xfree.
5064 NAME can have any form that the "break" or "print" commands might
5065 recognize. In other words, it does not have to be the "natural"
5066 name, or the "encoded" name. */
5069 ada_name_for_lookup (const char *name)
5072 int nlen = strlen (name);
5074 if (name[0] == '<' && name[nlen - 1] == '>')
5076 canon = xmalloc (nlen - 1);
5077 memcpy (canon, name + 1, nlen - 2);
5078 canon[nlen - 2] = '\0';
5081 canon = xstrdup (ada_encode (ada_fold_name (name)));
5085 /* Implementation of the la_iterate_over_symbols method. */
5088 ada_iterate_over_symbols (const struct block *block,
5089 const char *name, domain_enum domain,
5090 int (*callback) (struct symbol *, void *),
5094 struct ada_symbol_info *results;
5096 ndefs = ada_lookup_symbol_list (name, block, domain, &results);
5097 for (i = 0; i < ndefs; ++i)
5099 if (! (*callback) (results[i].sym, data))
5105 ada_lookup_encoded_symbol (const char *name, const struct block *block0,
5106 domain_enum namespace, struct block **block_found)
5108 struct ada_symbol_info *candidates;
5111 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
5113 if (n_candidates == 0)
5116 if (block_found != NULL)
5117 *block_found = candidates[0].block;
5119 return fixup_symbol_section (candidates[0].sym, NULL);
5122 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5123 scope and in global scopes, or NULL if none. NAME is folded and
5124 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5125 choosing the first symbol if there are multiple choices.
5126 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
5127 table in which the symbol was found (in both cases, these
5128 assignments occur only if the pointers are non-null). */
5130 ada_lookup_symbol (const char *name, const struct block *block0,
5131 domain_enum namespace, int *is_a_field_of_this)
5133 if (is_a_field_of_this != NULL)
5134 *is_a_field_of_this = 0;
5137 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
5138 block0, namespace, NULL);
5141 static struct symbol *
5142 ada_lookup_symbol_nonlocal (const char *name,
5143 const struct block *block,
5144 const domain_enum domain)
5146 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5150 /* True iff STR is a possible encoded suffix of a normal Ada name
5151 that is to be ignored for matching purposes. Suffixes of parallel
5152 names (e.g., XVE) are not included here. Currently, the possible suffixes
5153 are given by any of the regular expressions:
5155 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5156 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5157 TKB [subprogram suffix for task bodies]
5158 _E[0-9]+[bs]$ [protected object entry suffixes]
5159 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5161 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5162 match is performed. This sequence is used to differentiate homonyms,
5163 is an optional part of a valid name suffix. */
5166 is_name_suffix (const char *str)
5169 const char *matching;
5170 const int len = strlen (str);
5172 /* Skip optional leading __[0-9]+. */
5174 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5177 while (isdigit (str[0]))
5183 if (str[0] == '.' || str[0] == '$')
5186 while (isdigit (matching[0]))
5188 if (matching[0] == '\0')
5194 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5197 while (isdigit (matching[0]))
5199 if (matching[0] == '\0')
5203 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5205 if (strcmp (str, "TKB") == 0)
5209 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5210 with a N at the end. Unfortunately, the compiler uses the same
5211 convention for other internal types it creates. So treating
5212 all entity names that end with an "N" as a name suffix causes
5213 some regressions. For instance, consider the case of an enumerated
5214 type. To support the 'Image attribute, it creates an array whose
5216 Having a single character like this as a suffix carrying some
5217 information is a bit risky. Perhaps we should change the encoding
5218 to be something like "_N" instead. In the meantime, do not do
5219 the following check. */
5220 /* Protected Object Subprograms */
5221 if (len == 1 && str [0] == 'N')
5226 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
5229 while (isdigit (matching[0]))
5231 if ((matching[0] == 'b' || matching[0] == 's')
5232 && matching [1] == '\0')
5236 /* ??? We should not modify STR directly, as we are doing below. This
5237 is fine in this case, but may become problematic later if we find
5238 that this alternative did not work, and want to try matching
5239 another one from the begining of STR. Since we modified it, we
5240 won't be able to find the begining of the string anymore! */
5244 while (str[0] != '_' && str[0] != '\0')
5246 if (str[0] != 'n' && str[0] != 'b')
5252 if (str[0] == '\000')
5257 if (str[1] != '_' || str[2] == '\000')
5261 if (strcmp (str + 3, "JM") == 0)
5263 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5264 the LJM suffix in favor of the JM one. But we will
5265 still accept LJM as a valid suffix for a reasonable
5266 amount of time, just to allow ourselves to debug programs
5267 compiled using an older version of GNAT. */
5268 if (strcmp (str + 3, "LJM") == 0)
5272 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5273 || str[4] == 'U' || str[4] == 'P')
5275 if (str[4] == 'R' && str[5] != 'T')
5279 if (!isdigit (str[2]))
5281 for (k = 3; str[k] != '\0'; k += 1)
5282 if (!isdigit (str[k]) && str[k] != '_')
5286 if (str[0] == '$' && isdigit (str[1]))
5288 for (k = 2; str[k] != '\0'; k += 1)
5289 if (!isdigit (str[k]) && str[k] != '_')
5296 /* Return non-zero if the string starting at NAME and ending before
5297 NAME_END contains no capital letters. */
5300 is_valid_name_for_wild_match (const char *name0)
5302 const char *decoded_name = ada_decode (name0);
5305 /* If the decoded name starts with an angle bracket, it means that
5306 NAME0 does not follow the GNAT encoding format. It should then
5307 not be allowed as a possible wild match. */
5308 if (decoded_name[0] == '<')
5311 for (i=0; decoded_name[i] != '\0'; i++)
5312 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5318 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5319 that could start a simple name. Assumes that *NAMEP points into
5320 the string beginning at NAME0. */
5323 advance_wild_match (const char **namep, const char *name0, int target0)
5325 const char *name = *namep;
5335 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5338 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5343 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5344 || name[2] == target0))
5352 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5362 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5363 informational suffixes of NAME (i.e., for which is_name_suffix is
5364 true). Assumes that PATN is a lower-cased Ada simple name. */
5367 wild_match (const char *name, const char *patn)
5370 const char *name0 = name;
5374 const char *match = name;
5378 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5381 if (*p == '\0' && is_name_suffix (name))
5382 return match != name0 && !is_valid_name_for_wild_match (name0);
5384 if (name[-1] == '_')
5387 if (!advance_wild_match (&name, name0, *patn))
5392 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5393 informational suffix. */
5396 full_match (const char *sym_name, const char *search_name)
5398 return !match_name (sym_name, search_name, 0);
5402 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5403 vector *defn_symbols, updating the list of symbols in OBSTACKP
5404 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5405 OBJFILE is the section containing BLOCK.
5406 SYMTAB is recorded with each symbol added. */
5409 ada_add_block_symbols (struct obstack *obstackp,
5410 struct block *block, const char *name,
5411 domain_enum domain, struct objfile *objfile,
5414 struct dict_iterator iter;
5415 int name_len = strlen (name);
5416 /* A matching argument symbol, if any. */
5417 struct symbol *arg_sym;
5418 /* Set true when we find a matching non-argument symbol. */
5426 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5428 sym != NULL; sym = dict_iter_match_next (name, wild_match, &iter))
5430 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5431 SYMBOL_DOMAIN (sym), domain)
5432 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
5434 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5436 else if (SYMBOL_IS_ARGUMENT (sym))
5441 add_defn_to_vec (obstackp,
5442 fixup_symbol_section (sym, objfile),
5450 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5452 sym != NULL; sym = dict_iter_match_next (name, full_match, &iter))
5454 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5455 SYMBOL_DOMAIN (sym), domain))
5457 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5459 if (SYMBOL_IS_ARGUMENT (sym))
5464 add_defn_to_vec (obstackp,
5465 fixup_symbol_section (sym, objfile),
5473 if (!found_sym && arg_sym != NULL)
5475 add_defn_to_vec (obstackp,
5476 fixup_symbol_section (arg_sym, objfile),
5485 ALL_BLOCK_SYMBOLS (block, iter, sym)
5487 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5488 SYMBOL_DOMAIN (sym), domain))
5492 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5495 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5497 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5502 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5504 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5506 if (SYMBOL_IS_ARGUMENT (sym))
5511 add_defn_to_vec (obstackp,
5512 fixup_symbol_section (sym, objfile),
5520 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5521 They aren't parameters, right? */
5522 if (!found_sym && arg_sym != NULL)
5524 add_defn_to_vec (obstackp,
5525 fixup_symbol_section (arg_sym, objfile),
5532 /* Symbol Completion */
5534 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5535 name in a form that's appropriate for the completion. The result
5536 does not need to be deallocated, but is only good until the next call.
5538 TEXT_LEN is equal to the length of TEXT.
5539 Perform a wild match if WILD_MATCH is set.
5540 ENCODED should be set if TEXT represents the start of a symbol name
5541 in its encoded form. */
5544 symbol_completion_match (const char *sym_name,
5545 const char *text, int text_len,
5546 int wild_match, int encoded)
5548 const int verbatim_match = (text[0] == '<');
5553 /* Strip the leading angle bracket. */
5558 /* First, test against the fully qualified name of the symbol. */
5560 if (strncmp (sym_name, text, text_len) == 0)
5563 if (match && !encoded)
5565 /* One needed check before declaring a positive match is to verify
5566 that iff we are doing a verbatim match, the decoded version
5567 of the symbol name starts with '<'. Otherwise, this symbol name
5568 is not a suitable completion. */
5569 const char *sym_name_copy = sym_name;
5570 int has_angle_bracket;
5572 sym_name = ada_decode (sym_name);
5573 has_angle_bracket = (sym_name[0] == '<');
5574 match = (has_angle_bracket == verbatim_match);
5575 sym_name = sym_name_copy;
5578 if (match && !verbatim_match)
5580 /* When doing non-verbatim match, another check that needs to
5581 be done is to verify that the potentially matching symbol name
5582 does not include capital letters, because the ada-mode would
5583 not be able to understand these symbol names without the
5584 angle bracket notation. */
5587 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5592 /* Second: Try wild matching... */
5594 if (!match && wild_match)
5596 /* Since we are doing wild matching, this means that TEXT
5597 may represent an unqualified symbol name. We therefore must
5598 also compare TEXT against the unqualified name of the symbol. */
5599 sym_name = ada_unqualified_name (ada_decode (sym_name));
5601 if (strncmp (sym_name, text, text_len) == 0)
5605 /* Finally: If we found a mach, prepare the result to return. */
5611 sym_name = add_angle_brackets (sym_name);
5614 sym_name = ada_decode (sym_name);
5619 DEF_VEC_P (char_ptr);
5621 /* A companion function to ada_make_symbol_completion_list().
5622 Check if SYM_NAME represents a symbol which name would be suitable
5623 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5624 it is appended at the end of the given string vector SV.
5626 ORIG_TEXT is the string original string from the user command
5627 that needs to be completed. WORD is the entire command on which
5628 completion should be performed. These two parameters are used to
5629 determine which part of the symbol name should be added to the
5631 if WILD_MATCH is set, then wild matching is performed.
5632 ENCODED should be set if TEXT represents a symbol name in its
5633 encoded formed (in which case the completion should also be
5637 symbol_completion_add (VEC(char_ptr) **sv,
5638 const char *sym_name,
5639 const char *text, int text_len,
5640 const char *orig_text, const char *word,
5641 int wild_match, int encoded)
5643 const char *match = symbol_completion_match (sym_name, text, text_len,
5644 wild_match, encoded);
5650 /* We found a match, so add the appropriate completion to the given
5653 if (word == orig_text)
5655 completion = xmalloc (strlen (match) + 5);
5656 strcpy (completion, match);
5658 else if (word > orig_text)
5660 /* Return some portion of sym_name. */
5661 completion = xmalloc (strlen (match) + 5);
5662 strcpy (completion, match + (word - orig_text));
5666 /* Return some of ORIG_TEXT plus sym_name. */
5667 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5668 strncpy (completion, word, orig_text - word);
5669 completion[orig_text - word] = '\0';
5670 strcat (completion, match);
5673 VEC_safe_push (char_ptr, *sv, completion);
5676 /* An object of this type is passed as the user_data argument to the
5677 expand_partial_symbol_names method. */
5678 struct add_partial_datum
5680 VEC(char_ptr) **completions;
5689 /* A callback for expand_partial_symbol_names. */
5691 ada_expand_partial_symbol_name (const struct language_defn *language,
5692 const char *name, void *user_data)
5694 struct add_partial_datum *data = user_data;
5696 return symbol_completion_match (name, data->text, data->text_len,
5697 data->wild_match, data->encoded) != NULL;
5700 /* Return a list of possible symbol names completing TEXT0. The list
5701 is NULL terminated. WORD is the entire command on which completion
5705 ada_make_symbol_completion_list (char *text0, char *word)
5711 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5714 struct minimal_symbol *msymbol;
5715 struct objfile *objfile;
5716 struct block *b, *surrounding_static_block = 0;
5718 struct dict_iterator iter;
5720 if (text0[0] == '<')
5722 text = xstrdup (text0);
5723 make_cleanup (xfree, text);
5724 text_len = strlen (text);
5730 text = xstrdup (ada_encode (text0));
5731 make_cleanup (xfree, text);
5732 text_len = strlen (text);
5733 for (i = 0; i < text_len; i++)
5734 text[i] = tolower (text[i]);
5736 encoded = (strstr (text0, "__") != NULL);
5737 /* If the name contains a ".", then the user is entering a fully
5738 qualified entity name, and the match must not be done in wild
5739 mode. Similarly, if the user wants to complete what looks like
5740 an encoded name, the match must not be done in wild mode. */
5741 wild_match = (strchr (text0, '.') == NULL && !encoded);
5744 /* First, look at the partial symtab symbols. */
5746 struct add_partial_datum data;
5748 data.completions = &completions;
5750 data.text_len = text_len;
5753 data.wild_match = wild_match;
5754 data.encoded = encoded;
5755 expand_partial_symbol_names (ada_expand_partial_symbol_name, &data);
5758 /* At this point scan through the misc symbol vectors and add each
5759 symbol you find to the list. Eventually we want to ignore
5760 anything that isn't a text symbol (everything else will be
5761 handled by the psymtab code above). */
5763 ALL_MSYMBOLS (objfile, msymbol)
5766 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5767 text, text_len, text0, word, wild_match, encoded);
5770 /* Search upwards from currently selected frame (so that we can
5771 complete on local vars. */
5773 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5775 if (!BLOCK_SUPERBLOCK (b))
5776 surrounding_static_block = b; /* For elmin of dups */
5778 ALL_BLOCK_SYMBOLS (b, iter, sym)
5780 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5781 text, text_len, text0, word,
5782 wild_match, encoded);
5786 /* Go through the symtabs and check the externs and statics for
5787 symbols which match. */
5789 ALL_SYMTABS (objfile, s)
5792 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5793 ALL_BLOCK_SYMBOLS (b, iter, sym)
5795 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5796 text, text_len, text0, word,
5797 wild_match, encoded);
5801 ALL_SYMTABS (objfile, s)
5804 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5805 /* Don't do this block twice. */
5806 if (b == surrounding_static_block)
5808 ALL_BLOCK_SYMBOLS (b, iter, sym)
5810 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5811 text, text_len, text0, word,
5812 wild_match, encoded);
5816 /* Append the closing NULL entry. */
5817 VEC_safe_push (char_ptr, completions, NULL);
5819 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5820 return the copy. It's unfortunate that we have to make a copy
5821 of an array that we're about to destroy, but there is nothing much
5822 we can do about it. Fortunately, it's typically not a very large
5825 const size_t completions_size =
5826 VEC_length (char_ptr, completions) * sizeof (char *);
5827 char **result = xmalloc (completions_size);
5829 memcpy (result, VEC_address (char_ptr, completions), completions_size);
5831 VEC_free (char_ptr, completions);
5838 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5839 for tagged types. */
5842 ada_is_dispatch_table_ptr_type (struct type *type)
5846 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5849 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5853 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5856 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5857 to be invisible to users. */
5860 ada_is_ignored_field (struct type *type, int field_num)
5862 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5865 /* Check the name of that field. */
5867 const char *name = TYPE_FIELD_NAME (type, field_num);
5869 /* Anonymous field names should not be printed.
5870 brobecker/2007-02-20: I don't think this can actually happen
5871 but we don't want to print the value of annonymous fields anyway. */
5875 /* A field named "_parent" is internally generated by GNAT for
5876 tagged types, and should not be printed either. */
5877 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5881 /* If this is the dispatch table of a tagged type, then ignore. */
5882 if (ada_is_tagged_type (type, 1)
5883 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5886 /* Not a special field, so it should not be ignored. */
5890 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5891 pointer or reference type whose ultimate target has a tag field. */
5894 ada_is_tagged_type (struct type *type, int refok)
5896 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5899 /* True iff TYPE represents the type of X'Tag */
5902 ada_is_tag_type (struct type *type)
5904 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5908 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5910 return (name != NULL
5911 && strcmp (name, "ada__tags__dispatch_table") == 0);
5915 /* The type of the tag on VAL. */
5918 ada_tag_type (struct value *val)
5920 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
5923 /* The value of the tag on VAL. */
5926 ada_value_tag (struct value *val)
5928 return ada_value_struct_elt (val, "_tag", 0);
5931 /* The value of the tag on the object of type TYPE whose contents are
5932 saved at VALADDR, if it is non-null, or is at memory address
5935 static struct value *
5936 value_tag_from_contents_and_address (struct type *type,
5937 const gdb_byte *valaddr,
5940 int tag_byte_offset;
5941 struct type *tag_type;
5943 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5946 const gdb_byte *valaddr1 = ((valaddr == NULL)
5948 : valaddr + tag_byte_offset);
5949 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5951 return value_from_contents_and_address (tag_type, valaddr1, address1);
5956 static struct type *
5957 type_from_tag (struct value *tag)
5959 const char *type_name = ada_tag_name (tag);
5961 if (type_name != NULL)
5962 return ada_find_any_type (ada_encode (type_name));
5973 static int ada_tag_name_1 (void *);
5974 static int ada_tag_name_2 (struct tag_args *);
5976 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5977 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5978 The value stored in ARGS->name is valid until the next call to
5982 ada_tag_name_1 (void *args0)
5984 struct tag_args *args = (struct tag_args *) args0;
5985 static char name[1024];
5990 val = ada_value_struct_elt (args->tag, "tsd", 1);
5992 return ada_tag_name_2 (args);
5993 val = ada_value_struct_elt (val, "expanded_name", 1);
5996 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5997 for (p = name; *p != '\0'; p += 1)
6004 /* Return the "ada__tags__type_specific_data" type. */
6006 static struct type *
6007 ada_get_tsd_type (struct inferior *inf)
6009 struct ada_inferior_data *data = get_ada_inferior_data (inf);
6011 if (data->tsd_type == 0)
6012 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6013 return data->tsd_type;
6016 /* Utility function for ada_tag_name_1 that tries the second
6017 representation for the dispatch table (in which there is no
6018 explicit 'tsd' field in the referent of the tag pointer, and instead
6019 the tsd pointer is stored just before the dispatch table. */
6022 ada_tag_name_2 (struct tag_args *args)
6024 struct type *info_type;
6025 static char name[1024];
6027 struct value *val, *valp;
6030 info_type = ada_get_tsd_type (current_inferior());
6031 if (info_type == NULL)
6033 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
6034 valp = value_cast (info_type, args->tag);
6037 val = value_ind (value_ptradd (valp, -1));
6040 val = ada_value_struct_elt (val, "expanded_name", 1);
6043 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6044 for (p = name; *p != '\0'; p += 1)
6051 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6055 ada_tag_name (struct value *tag)
6057 struct tag_args args;
6059 if (!ada_is_tag_type (value_type (tag)))
6063 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
6067 /* The parent type of TYPE, or NULL if none. */
6070 ada_parent_type (struct type *type)
6074 type = ada_check_typedef (type);
6076 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6079 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6080 if (ada_is_parent_field (type, i))
6082 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6084 /* If the _parent field is a pointer, then dereference it. */
6085 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6086 parent_type = TYPE_TARGET_TYPE (parent_type);
6087 /* If there is a parallel XVS type, get the actual base type. */
6088 parent_type = ada_get_base_type (parent_type);
6090 return ada_check_typedef (parent_type);
6096 /* True iff field number FIELD_NUM of structure type TYPE contains the
6097 parent-type (inherited) fields of a derived type. Assumes TYPE is
6098 a structure type with at least FIELD_NUM+1 fields. */
6101 ada_is_parent_field (struct type *type, int field_num)
6103 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6105 return (name != NULL
6106 && (strncmp (name, "PARENT", 6) == 0
6107 || strncmp (name, "_parent", 7) == 0));
6110 /* True iff field number FIELD_NUM of structure type TYPE is a
6111 transparent wrapper field (which should be silently traversed when doing
6112 field selection and flattened when printing). Assumes TYPE is a
6113 structure type with at least FIELD_NUM+1 fields. Such fields are always
6117 ada_is_wrapper_field (struct type *type, int field_num)
6119 const char *name = TYPE_FIELD_NAME (type, field_num);
6121 return (name != NULL
6122 && (strncmp (name, "PARENT", 6) == 0
6123 || strcmp (name, "REP") == 0
6124 || strncmp (name, "_parent", 7) == 0
6125 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6128 /* True iff field number FIELD_NUM of structure or union type TYPE
6129 is a variant wrapper. Assumes TYPE is a structure type with at least
6130 FIELD_NUM+1 fields. */
6133 ada_is_variant_part (struct type *type, int field_num)
6135 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6137 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6138 || (is_dynamic_field (type, field_num)
6139 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6140 == TYPE_CODE_UNION)));
6143 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6144 whose discriminants are contained in the record type OUTER_TYPE,
6145 returns the type of the controlling discriminant for the variant.
6146 May return NULL if the type could not be found. */
6149 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6151 char *name = ada_variant_discrim_name (var_type);
6153 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
6156 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6157 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6158 represents a 'when others' clause; otherwise 0. */
6161 ada_is_others_clause (struct type *type, int field_num)
6163 const char *name = TYPE_FIELD_NAME (type, field_num);
6165 return (name != NULL && name[0] == 'O');
6168 /* Assuming that TYPE0 is the type of the variant part of a record,
6169 returns the name of the discriminant controlling the variant.
6170 The value is valid until the next call to ada_variant_discrim_name. */
6173 ada_variant_discrim_name (struct type *type0)
6175 static char *result = NULL;
6176 static size_t result_len = 0;
6179 const char *discrim_end;
6180 const char *discrim_start;
6182 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
6183 type = TYPE_TARGET_TYPE (type0);
6187 name = ada_type_name (type);
6189 if (name == NULL || name[0] == '\000')
6192 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
6195 if (strncmp (discrim_end, "___XVN", 6) == 0)
6198 if (discrim_end == name)
6201 for (discrim_start = discrim_end; discrim_start != name + 3;
6204 if (discrim_start == name + 1)
6206 if ((discrim_start > name + 3
6207 && strncmp (discrim_start - 3, "___", 3) == 0)
6208 || discrim_start[-1] == '.')
6212 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
6213 strncpy (result, discrim_start, discrim_end - discrim_start);
6214 result[discrim_end - discrim_start] = '\0';
6218 /* Scan STR for a subtype-encoded number, beginning at position K.
6219 Put the position of the character just past the number scanned in
6220 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6221 Return 1 if there was a valid number at the given position, and 0
6222 otherwise. A "subtype-encoded" number consists of the absolute value
6223 in decimal, followed by the letter 'm' to indicate a negative number.
6224 Assumes 0m does not occur. */
6227 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
6231 if (!isdigit (str[k]))
6234 /* Do it the hard way so as not to make any assumption about
6235 the relationship of unsigned long (%lu scan format code) and
6238 while (isdigit (str[k]))
6240 RU = RU * 10 + (str[k] - '0');
6247 *R = (-(LONGEST) (RU - 1)) - 1;
6253 /* NOTE on the above: Technically, C does not say what the results of
6254 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6255 number representable as a LONGEST (although either would probably work
6256 in most implementations). When RU>0, the locution in the then branch
6257 above is always equivalent to the negative of RU. */
6264 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6265 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6266 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6269 ada_in_variant (LONGEST val, struct type *type, int field_num)
6271 const char *name = TYPE_FIELD_NAME (type, field_num);
6285 if (!ada_scan_number (name, p + 1, &W, &p))
6295 if (!ada_scan_number (name, p + 1, &L, &p)
6296 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6298 if (val >= L && val <= U)
6310 /* FIXME: Lots of redundancy below. Try to consolidate. */
6312 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6313 ARG_TYPE, extract and return the value of one of its (non-static)
6314 fields. FIELDNO says which field. Differs from value_primitive_field
6315 only in that it can handle packed values of arbitrary type. */
6317 static struct value *
6318 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
6319 struct type *arg_type)
6323 arg_type = ada_check_typedef (arg_type);
6324 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6326 /* Handle packed fields. */
6328 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6330 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6331 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
6333 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
6334 offset + bit_pos / 8,
6335 bit_pos % 8, bit_size, type);
6338 return value_primitive_field (arg1, offset, fieldno, arg_type);
6341 /* Find field with name NAME in object of type TYPE. If found,
6342 set the following for each argument that is non-null:
6343 - *FIELD_TYPE_P to the field's type;
6344 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6345 an object of that type;
6346 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6347 - *BIT_SIZE_P to its size in bits if the field is packed, and
6349 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6350 fields up to but not including the desired field, or by the total
6351 number of fields if not found. A NULL value of NAME never
6352 matches; the function just counts visible fields in this case.
6354 Returns 1 if found, 0 otherwise. */
6357 find_struct_field (char *name, struct type *type, int offset,
6358 struct type **field_type_p,
6359 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6364 type = ada_check_typedef (type);
6366 if (field_type_p != NULL)
6367 *field_type_p = NULL;
6368 if (byte_offset_p != NULL)
6370 if (bit_offset_p != NULL)
6372 if (bit_size_p != NULL)
6375 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6377 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6378 int fld_offset = offset + bit_pos / 8;
6379 char *t_field_name = TYPE_FIELD_NAME (type, i);
6381 if (t_field_name == NULL)
6384 else if (name != NULL && field_name_match (t_field_name, name))
6386 int bit_size = TYPE_FIELD_BITSIZE (type, i);
6388 if (field_type_p != NULL)
6389 *field_type_p = TYPE_FIELD_TYPE (type, i);
6390 if (byte_offset_p != NULL)
6391 *byte_offset_p = fld_offset;
6392 if (bit_offset_p != NULL)
6393 *bit_offset_p = bit_pos % 8;
6394 if (bit_size_p != NULL)
6395 *bit_size_p = bit_size;
6398 else if (ada_is_wrapper_field (type, i))
6400 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6401 field_type_p, byte_offset_p, bit_offset_p,
6402 bit_size_p, index_p))
6405 else if (ada_is_variant_part (type, i))
6407 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6410 struct type *field_type
6411 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6413 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6415 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6417 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6418 field_type_p, byte_offset_p,
6419 bit_offset_p, bit_size_p, index_p))
6423 else if (index_p != NULL)
6429 /* Number of user-visible fields in record type TYPE. */
6432 num_visible_fields (struct type *type)
6437 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6441 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6442 and search in it assuming it has (class) type TYPE.
6443 If found, return value, else return NULL.
6445 Searches recursively through wrapper fields (e.g., '_parent'). */
6447 static struct value *
6448 ada_search_struct_field (char *name, struct value *arg, int offset,
6453 type = ada_check_typedef (type);
6454 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6456 char *t_field_name = TYPE_FIELD_NAME (type, i);
6458 if (t_field_name == NULL)
6461 else if (field_name_match (t_field_name, name))
6462 return ada_value_primitive_field (arg, offset, i, type);
6464 else if (ada_is_wrapper_field (type, i))
6466 struct value *v = /* Do not let indent join lines here. */
6467 ada_search_struct_field (name, arg,
6468 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6469 TYPE_FIELD_TYPE (type, i));
6475 else if (ada_is_variant_part (type, i))
6477 /* PNH: Do we ever get here? See find_struct_field. */
6479 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6481 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6483 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6485 struct value *v = ada_search_struct_field /* Force line
6488 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6489 TYPE_FIELD_TYPE (field_type, j));
6499 static struct value *ada_index_struct_field_1 (int *, struct value *,
6500 int, struct type *);
6503 /* Return field #INDEX in ARG, where the index is that returned by
6504 * find_struct_field through its INDEX_P argument. Adjust the address
6505 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6506 * If found, return value, else return NULL. */
6508 static struct value *
6509 ada_index_struct_field (int index, struct value *arg, int offset,
6512 return ada_index_struct_field_1 (&index, arg, offset, type);
6516 /* Auxiliary function for ada_index_struct_field. Like
6517 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6520 static struct value *
6521 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6525 type = ada_check_typedef (type);
6527 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6529 if (TYPE_FIELD_NAME (type, i) == NULL)
6531 else if (ada_is_wrapper_field (type, i))
6533 struct value *v = /* Do not let indent join lines here. */
6534 ada_index_struct_field_1 (index_p, arg,
6535 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6536 TYPE_FIELD_TYPE (type, i));
6542 else if (ada_is_variant_part (type, i))
6544 /* PNH: Do we ever get here? See ada_search_struct_field,
6545 find_struct_field. */
6546 error (_("Cannot assign this kind of variant record"));
6548 else if (*index_p == 0)
6549 return ada_value_primitive_field (arg, offset, i, type);
6556 /* Given ARG, a value of type (pointer or reference to a)*
6557 structure/union, extract the component named NAME from the ultimate
6558 target structure/union and return it as a value with its
6561 The routine searches for NAME among all members of the structure itself
6562 and (recursively) among all members of any wrapper members
6565 If NO_ERR, then simply return NULL in case of error, rather than
6569 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6571 struct type *t, *t1;
6575 t1 = t = ada_check_typedef (value_type (arg));
6576 if (TYPE_CODE (t) == TYPE_CODE_REF)
6578 t1 = TYPE_TARGET_TYPE (t);
6581 t1 = ada_check_typedef (t1);
6582 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6584 arg = coerce_ref (arg);
6589 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6591 t1 = TYPE_TARGET_TYPE (t);
6594 t1 = ada_check_typedef (t1);
6595 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6597 arg = value_ind (arg);
6604 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6608 v = ada_search_struct_field (name, arg, 0, t);
6611 int bit_offset, bit_size, byte_offset;
6612 struct type *field_type;
6615 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6616 address = value_as_address (arg);
6618 address = unpack_pointer (t, value_contents (arg));
6620 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6621 if (find_struct_field (name, t1, 0,
6622 &field_type, &byte_offset, &bit_offset,
6627 if (TYPE_CODE (t) == TYPE_CODE_REF)
6628 arg = ada_coerce_ref (arg);
6630 arg = ada_value_ind (arg);
6631 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6632 bit_offset, bit_size,
6636 v = value_at_lazy (field_type, address + byte_offset);
6640 if (v != NULL || no_err)
6643 error (_("There is no member named %s."), name);
6649 error (_("Attempt to extract a component of "
6650 "a value that is not a record."));
6653 /* Given a type TYPE, look up the type of the component of type named NAME.
6654 If DISPP is non-null, add its byte displacement from the beginning of a
6655 structure (pointed to by a value) of type TYPE to *DISPP (does not
6656 work for packed fields).
6658 Matches any field whose name has NAME as a prefix, possibly
6661 TYPE can be either a struct or union. If REFOK, TYPE may also
6662 be a (pointer or reference)+ to a struct or union, and the
6663 ultimate target type will be searched.
6665 Looks recursively into variant clauses and parent types.
6667 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6668 TYPE is not a type of the right kind. */
6670 static struct type *
6671 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6672 int noerr, int *dispp)
6679 if (refok && type != NULL)
6682 type = ada_check_typedef (type);
6683 if (TYPE_CODE (type) != TYPE_CODE_PTR
6684 && TYPE_CODE (type) != TYPE_CODE_REF)
6686 type = TYPE_TARGET_TYPE (type);
6690 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6691 && TYPE_CODE (type) != TYPE_CODE_UNION))
6697 target_terminal_ours ();
6698 gdb_flush (gdb_stdout);
6700 error (_("Type (null) is not a structure or union type"));
6703 /* XXX: type_sprint */
6704 fprintf_unfiltered (gdb_stderr, _("Type "));
6705 type_print (type, "", gdb_stderr, -1);
6706 error (_(" is not a structure or union type"));
6711 type = to_static_fixed_type (type);
6713 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6715 char *t_field_name = TYPE_FIELD_NAME (type, i);
6719 if (t_field_name == NULL)
6722 else if (field_name_match (t_field_name, name))
6725 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
6726 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6729 else if (ada_is_wrapper_field (type, i))
6732 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6737 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6742 else if (ada_is_variant_part (type, i))
6745 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6748 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6750 /* FIXME pnh 2008/01/26: We check for a field that is
6751 NOT wrapped in a struct, since the compiler sometimes
6752 generates these for unchecked variant types. Revisit
6753 if the compiler changes this practice. */
6754 char *v_field_name = TYPE_FIELD_NAME (field_type, j);
6756 if (v_field_name != NULL
6757 && field_name_match (v_field_name, name))
6758 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6760 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
6767 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6778 target_terminal_ours ();
6779 gdb_flush (gdb_stdout);
6782 /* XXX: type_sprint */
6783 fprintf_unfiltered (gdb_stderr, _("Type "));
6784 type_print (type, "", gdb_stderr, -1);
6785 error (_(" has no component named <null>"));
6789 /* XXX: type_sprint */
6790 fprintf_unfiltered (gdb_stderr, _("Type "));
6791 type_print (type, "", gdb_stderr, -1);
6792 error (_(" has no component named %s"), name);
6799 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6800 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6801 represents an unchecked union (that is, the variant part of a
6802 record that is named in an Unchecked_Union pragma). */
6805 is_unchecked_variant (struct type *var_type, struct type *outer_type)
6807 char *discrim_name = ada_variant_discrim_name (var_type);
6809 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6814 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6815 within a value of type OUTER_TYPE that is stored in GDB at
6816 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6817 numbering from 0) is applicable. Returns -1 if none are. */
6820 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
6821 const gdb_byte *outer_valaddr)
6825 char *discrim_name = ada_variant_discrim_name (var_type);
6826 struct value *outer;
6827 struct value *discrim;
6828 LONGEST discrim_val;
6830 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6831 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6832 if (discrim == NULL)
6834 discrim_val = value_as_long (discrim);
6837 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6839 if (ada_is_others_clause (var_type, i))
6841 else if (ada_in_variant (discrim_val, var_type, i))
6845 return others_clause;
6850 /* Dynamic-Sized Records */
6852 /* Strategy: The type ostensibly attached to a value with dynamic size
6853 (i.e., a size that is not statically recorded in the debugging
6854 data) does not accurately reflect the size or layout of the value.
6855 Our strategy is to convert these values to values with accurate,
6856 conventional types that are constructed on the fly. */
6858 /* There is a subtle and tricky problem here. In general, we cannot
6859 determine the size of dynamic records without its data. However,
6860 the 'struct value' data structure, which GDB uses to represent
6861 quantities in the inferior process (the target), requires the size
6862 of the type at the time of its allocation in order to reserve space
6863 for GDB's internal copy of the data. That's why the
6864 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6865 rather than struct value*s.
6867 However, GDB's internal history variables ($1, $2, etc.) are
6868 struct value*s containing internal copies of the data that are not, in
6869 general, the same as the data at their corresponding addresses in
6870 the target. Fortunately, the types we give to these values are all
6871 conventional, fixed-size types (as per the strategy described
6872 above), so that we don't usually have to perform the
6873 'to_fixed_xxx_type' conversions to look at their values.
6874 Unfortunately, there is one exception: if one of the internal
6875 history variables is an array whose elements are unconstrained
6876 records, then we will need to create distinct fixed types for each
6877 element selected. */
6879 /* The upshot of all of this is that many routines take a (type, host
6880 address, target address) triple as arguments to represent a value.
6881 The host address, if non-null, is supposed to contain an internal
6882 copy of the relevant data; otherwise, the program is to consult the
6883 target at the target address. */
6885 /* Assuming that VAL0 represents a pointer value, the result of
6886 dereferencing it. Differs from value_ind in its treatment of
6887 dynamic-sized types. */
6890 ada_value_ind (struct value *val0)
6892 struct value *val = unwrap_value (value_ind (val0));
6894 return ada_to_fixed_value (val);
6897 /* The value resulting from dereferencing any "reference to"
6898 qualifiers on VAL0. */
6900 static struct value *
6901 ada_coerce_ref (struct value *val0)
6903 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
6905 struct value *val = val0;
6907 val = coerce_ref (val);
6908 val = unwrap_value (val);
6909 return ada_to_fixed_value (val);
6915 /* Return OFF rounded upward if necessary to a multiple of
6916 ALIGNMENT (a power of 2). */
6919 align_value (unsigned int off, unsigned int alignment)
6921 return (off + alignment - 1) & ~(alignment - 1);
6924 /* Return the bit alignment required for field #F of template type TYPE. */
6927 field_alignment (struct type *type, int f)
6929 const char *name = TYPE_FIELD_NAME (type, f);
6933 /* The field name should never be null, unless the debugging information
6934 is somehow malformed. In this case, we assume the field does not
6935 require any alignment. */
6939 len = strlen (name);
6941 if (!isdigit (name[len - 1]))
6944 if (isdigit (name[len - 2]))
6945 align_offset = len - 2;
6947 align_offset = len - 1;
6949 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
6950 return TARGET_CHAR_BIT;
6952 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6955 /* Find a symbol named NAME. Ignores ambiguity. */
6958 ada_find_any_symbol (const char *name)
6962 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6963 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6966 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6970 /* Find a type named NAME. Ignores ambiguity. This routine will look
6971 solely for types defined by debug info, it will not search the GDB
6975 ada_find_any_type (const char *name)
6977 struct symbol *sym = ada_find_any_symbol (name);
6980 return SYMBOL_TYPE (sym);
6985 /* Given NAME and an associated BLOCK, search all symbols for
6986 NAME suffixed with "___XR", which is the ``renaming'' symbol
6987 associated to NAME. Return this symbol if found, return
6991 ada_find_renaming_symbol (const char *name, struct block *block)
6995 sym = find_old_style_renaming_symbol (name, block);
7000 /* Not right yet. FIXME pnh 7/20/2007. */
7001 sym = ada_find_any_symbol (name);
7002 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
7008 static struct symbol *
7009 find_old_style_renaming_symbol (const char *name, struct block *block)
7011 const struct symbol *function_sym = block_linkage_function (block);
7014 if (function_sym != NULL)
7016 /* If the symbol is defined inside a function, NAME is not fully
7017 qualified. This means we need to prepend the function name
7018 as well as adding the ``___XR'' suffix to build the name of
7019 the associated renaming symbol. */
7020 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
7021 /* Function names sometimes contain suffixes used
7022 for instance to qualify nested subprograms. When building
7023 the XR type name, we need to make sure that this suffix is
7024 not included. So do not include any suffix in the function
7025 name length below. */
7026 int function_name_len = ada_name_prefix_len (function_name);
7027 const int rename_len = function_name_len + 2 /* "__" */
7028 + strlen (name) + 6 /* "___XR\0" */ ;
7030 /* Strip the suffix if necessary. */
7031 ada_remove_trailing_digits (function_name, &function_name_len);
7032 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
7033 ada_remove_Xbn_suffix (function_name, &function_name_len);
7035 /* Library-level functions are a special case, as GNAT adds
7036 a ``_ada_'' prefix to the function name to avoid namespace
7037 pollution. However, the renaming symbols themselves do not
7038 have this prefix, so we need to skip this prefix if present. */
7039 if (function_name_len > 5 /* "_ada_" */
7040 && strstr (function_name, "_ada_") == function_name)
7043 function_name_len -= 5;
7046 rename = (char *) alloca (rename_len * sizeof (char));
7047 strncpy (rename, function_name, function_name_len);
7048 xsnprintf (rename + function_name_len, rename_len - function_name_len,
7053 const int rename_len = strlen (name) + 6;
7055 rename = (char *) alloca (rename_len * sizeof (char));
7056 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
7059 return ada_find_any_symbol (rename);
7062 /* Because of GNAT encoding conventions, several GDB symbols may match a
7063 given type name. If the type denoted by TYPE0 is to be preferred to
7064 that of TYPE1 for purposes of type printing, return non-zero;
7065 otherwise return 0. */
7068 ada_prefer_type (struct type *type0, struct type *type1)
7072 else if (type0 == NULL)
7074 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
7076 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
7078 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
7080 else if (ada_is_constrained_packed_array_type (type0))
7082 else if (ada_is_array_descriptor_type (type0)
7083 && !ada_is_array_descriptor_type (type1))
7087 const char *type0_name = type_name_no_tag (type0);
7088 const char *type1_name = type_name_no_tag (type1);
7090 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
7091 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
7097 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7098 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7101 ada_type_name (struct type *type)
7105 else if (TYPE_NAME (type) != NULL)
7106 return TYPE_NAME (type);
7108 return TYPE_TAG_NAME (type);
7111 /* Search the list of "descriptive" types associated to TYPE for a type
7112 whose name is NAME. */
7114 static struct type *
7115 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
7117 struct type *result;
7119 /* If there no descriptive-type info, then there is no parallel type
7121 if (!HAVE_GNAT_AUX_INFO (type))
7124 result = TYPE_DESCRIPTIVE_TYPE (type);
7125 while (result != NULL)
7127 char *result_name = ada_type_name (result);
7129 if (result_name == NULL)
7131 warning (_("unexpected null name on descriptive type"));
7135 /* If the names match, stop. */
7136 if (strcmp (result_name, name) == 0)
7139 /* Otherwise, look at the next item on the list, if any. */
7140 if (HAVE_GNAT_AUX_INFO (result))
7141 result = TYPE_DESCRIPTIVE_TYPE (result);
7146 /* If we didn't find a match, see whether this is a packed array. With
7147 older compilers, the descriptive type information is either absent or
7148 irrelevant when it comes to packed arrays so the above lookup fails.
7149 Fall back to using a parallel lookup by name in this case. */
7150 if (result == NULL && ada_is_constrained_packed_array_type (type))
7151 return ada_find_any_type (name);
7156 /* Find a parallel type to TYPE with the specified NAME, using the
7157 descriptive type taken from the debugging information, if available,
7158 and otherwise using the (slower) name-based method. */
7160 static struct type *
7161 ada_find_parallel_type_with_name (struct type *type, const char *name)
7163 struct type *result = NULL;
7165 if (HAVE_GNAT_AUX_INFO (type))
7166 result = find_parallel_type_by_descriptive_type (type, name);
7168 result = ada_find_any_type (name);
7173 /* Same as above, but specify the name of the parallel type by appending
7174 SUFFIX to the name of TYPE. */
7177 ada_find_parallel_type (struct type *type, const char *suffix)
7179 char *name, *typename = ada_type_name (type);
7182 if (typename == NULL)
7185 len = strlen (typename);
7187 name = (char *) alloca (len + strlen (suffix) + 1);
7189 strcpy (name, typename);
7190 strcpy (name + len, suffix);
7192 return ada_find_parallel_type_with_name (type, name);
7195 /* If TYPE is a variable-size record type, return the corresponding template
7196 type describing its fields. Otherwise, return NULL. */
7198 static struct type *
7199 dynamic_template_type (struct type *type)
7201 type = ada_check_typedef (type);
7203 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
7204 || ada_type_name (type) == NULL)
7208 int len = strlen (ada_type_name (type));
7210 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
7213 return ada_find_parallel_type (type, "___XVE");
7217 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7218 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7221 is_dynamic_field (struct type *templ_type, int field_num)
7223 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
7226 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
7227 && strstr (name, "___XVL") != NULL;
7230 /* The index of the variant field of TYPE, or -1 if TYPE does not
7231 represent a variant record type. */
7234 variant_field_index (struct type *type)
7238 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
7241 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
7243 if (ada_is_variant_part (type, f))
7249 /* A record type with no fields. */
7251 static struct type *
7252 empty_record (struct type *template)
7254 struct type *type = alloc_type_copy (template);
7256 TYPE_CODE (type) = TYPE_CODE_STRUCT;
7257 TYPE_NFIELDS (type) = 0;
7258 TYPE_FIELDS (type) = NULL;
7259 INIT_CPLUS_SPECIFIC (type);
7260 TYPE_NAME (type) = "<empty>";
7261 TYPE_TAG_NAME (type) = NULL;
7262 TYPE_LENGTH (type) = 0;
7266 /* An ordinary record type (with fixed-length fields) that describes
7267 the value of type TYPE at VALADDR or ADDRESS (see comments at
7268 the beginning of this section) VAL according to GNAT conventions.
7269 DVAL0 should describe the (portion of a) record that contains any
7270 necessary discriminants. It should be NULL if value_type (VAL) is
7271 an outer-level type (i.e., as opposed to a branch of a variant.) A
7272 variant field (unless unchecked) is replaced by a particular branch
7275 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7276 length are not statically known are discarded. As a consequence,
7277 VALADDR, ADDRESS and DVAL0 are ignored.
7279 NOTE: Limitations: For now, we assume that dynamic fields and
7280 variants occupy whole numbers of bytes. However, they need not be
7284 ada_template_to_fixed_record_type_1 (struct type *type,
7285 const gdb_byte *valaddr,
7286 CORE_ADDR address, struct value *dval0,
7287 int keep_dynamic_fields)
7289 struct value *mark = value_mark ();
7292 int nfields, bit_len;
7298 /* Compute the number of fields in this record type that are going
7299 to be processed: unless keep_dynamic_fields, this includes only
7300 fields whose position and length are static will be processed. */
7301 if (keep_dynamic_fields)
7302 nfields = TYPE_NFIELDS (type);
7306 while (nfields < TYPE_NFIELDS (type)
7307 && !ada_is_variant_part (type, nfields)
7308 && !is_dynamic_field (type, nfields))
7312 rtype = alloc_type_copy (type);
7313 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7314 INIT_CPLUS_SPECIFIC (rtype);
7315 TYPE_NFIELDS (rtype) = nfields;
7316 TYPE_FIELDS (rtype) = (struct field *)
7317 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7318 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7319 TYPE_NAME (rtype) = ada_type_name (type);
7320 TYPE_TAG_NAME (rtype) = NULL;
7321 TYPE_FIXED_INSTANCE (rtype) = 1;
7327 for (f = 0; f < nfields; f += 1)
7329 off = align_value (off, field_alignment (type, f))
7330 + TYPE_FIELD_BITPOS (type, f);
7331 TYPE_FIELD_BITPOS (rtype, f) = off;
7332 TYPE_FIELD_BITSIZE (rtype, f) = 0;
7334 if (ada_is_variant_part (type, f))
7339 else if (is_dynamic_field (type, f))
7341 const gdb_byte *field_valaddr = valaddr;
7342 CORE_ADDR field_address = address;
7343 struct type *field_type =
7344 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7348 /* rtype's length is computed based on the run-time
7349 value of discriminants. If the discriminants are not
7350 initialized, the type size may be completely bogus and
7351 GDB may fail to allocate a value for it. So check the
7352 size first before creating the value. */
7354 dval = value_from_contents_and_address (rtype, valaddr, address);
7359 /* If the type referenced by this field is an aligner type, we need
7360 to unwrap that aligner type, because its size might not be set.
7361 Keeping the aligner type would cause us to compute the wrong
7362 size for this field, impacting the offset of the all the fields
7363 that follow this one. */
7364 if (ada_is_aligner_type (field_type))
7366 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7368 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7369 field_address = cond_offset_target (field_address, field_offset);
7370 field_type = ada_aligned_type (field_type);
7373 field_valaddr = cond_offset_host (field_valaddr,
7374 off / TARGET_CHAR_BIT);
7375 field_address = cond_offset_target (field_address,
7376 off / TARGET_CHAR_BIT);
7378 /* Get the fixed type of the field. Note that, in this case,
7379 we do not want to get the real type out of the tag: if
7380 the current field is the parent part of a tagged record,
7381 we will get the tag of the object. Clearly wrong: the real
7382 type of the parent is not the real type of the child. We
7383 would end up in an infinite loop. */
7384 field_type = ada_get_base_type (field_type);
7385 field_type = ada_to_fixed_type (field_type, field_valaddr,
7386 field_address, dval, 0);
7387 /* If the field size is already larger than the maximum
7388 object size, then the record itself will necessarily
7389 be larger than the maximum object size. We need to make
7390 this check now, because the size might be so ridiculously
7391 large (due to an uninitialized variable in the inferior)
7392 that it would cause an overflow when adding it to the
7394 check_size (field_type);
7396 TYPE_FIELD_TYPE (rtype, f) = field_type;
7397 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7398 /* The multiplication can potentially overflow. But because
7399 the field length has been size-checked just above, and
7400 assuming that the maximum size is a reasonable value,
7401 an overflow should not happen in practice. So rather than
7402 adding overflow recovery code to this already complex code,
7403 we just assume that it's not going to happen. */
7405 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7409 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7411 /* If our field is a typedef type (most likely a typedef of
7412 a fat pointer, encoding an array access), then we need to
7413 look at its target type to determine its characteristics.
7414 In particular, we would miscompute the field size if we took
7415 the size of the typedef (zero), instead of the size of
7417 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
7418 field_type = ada_typedef_target_type (field_type);
7420 TYPE_FIELD_TYPE (rtype, f) = field_type;
7421 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7422 if (TYPE_FIELD_BITSIZE (type, f) > 0)
7424 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7427 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
7429 if (off + fld_bit_len > bit_len)
7430 bit_len = off + fld_bit_len;
7432 TYPE_LENGTH (rtype) =
7433 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7436 /* We handle the variant part, if any, at the end because of certain
7437 odd cases in which it is re-ordered so as NOT to be the last field of
7438 the record. This can happen in the presence of representation
7440 if (variant_field >= 0)
7442 struct type *branch_type;
7444 off = TYPE_FIELD_BITPOS (rtype, variant_field);
7447 dval = value_from_contents_and_address (rtype, valaddr, address);
7452 to_fixed_variant_branch_type
7453 (TYPE_FIELD_TYPE (type, variant_field),
7454 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
7455 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
7456 if (branch_type == NULL)
7458 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
7459 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7460 TYPE_NFIELDS (rtype) -= 1;
7464 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7465 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7467 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
7469 if (off + fld_bit_len > bit_len)
7470 bit_len = off + fld_bit_len;
7471 TYPE_LENGTH (rtype) =
7472 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7476 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7477 should contain the alignment of that record, which should be a strictly
7478 positive value. If null or negative, then something is wrong, most
7479 probably in the debug info. In that case, we don't round up the size
7480 of the resulting type. If this record is not part of another structure,
7481 the current RTYPE length might be good enough for our purposes. */
7482 if (TYPE_LENGTH (type) <= 0)
7484 if (TYPE_NAME (rtype))
7485 warning (_("Invalid type size for `%s' detected: %d."),
7486 TYPE_NAME (rtype), TYPE_LENGTH (type));
7488 warning (_("Invalid type size for <unnamed> detected: %d."),
7489 TYPE_LENGTH (type));
7493 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
7494 TYPE_LENGTH (type));
7497 value_free_to_mark (mark);
7498 if (TYPE_LENGTH (rtype) > varsize_limit)
7499 error (_("record type with dynamic size is larger than varsize-limit"));
7503 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7506 static struct type *
7507 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
7508 CORE_ADDR address, struct value *dval0)
7510 return ada_template_to_fixed_record_type_1 (type, valaddr,
7514 /* An ordinary record type in which ___XVL-convention fields and
7515 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7516 static approximations, containing all possible fields. Uses
7517 no runtime values. Useless for use in values, but that's OK,
7518 since the results are used only for type determinations. Works on both
7519 structs and unions. Representation note: to save space, we memorize
7520 the result of this function in the TYPE_TARGET_TYPE of the
7523 static struct type *
7524 template_to_static_fixed_type (struct type *type0)
7530 if (TYPE_TARGET_TYPE (type0) != NULL)
7531 return TYPE_TARGET_TYPE (type0);
7533 nfields = TYPE_NFIELDS (type0);
7536 for (f = 0; f < nfields; f += 1)
7538 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
7539 struct type *new_type;
7541 if (is_dynamic_field (type0, f))
7542 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
7544 new_type = static_unwrap_type (field_type);
7545 if (type == type0 && new_type != field_type)
7547 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
7548 TYPE_CODE (type) = TYPE_CODE (type0);
7549 INIT_CPLUS_SPECIFIC (type);
7550 TYPE_NFIELDS (type) = nfields;
7551 TYPE_FIELDS (type) = (struct field *)
7552 TYPE_ALLOC (type, nfields * sizeof (struct field));
7553 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7554 sizeof (struct field) * nfields);
7555 TYPE_NAME (type) = ada_type_name (type0);
7556 TYPE_TAG_NAME (type) = NULL;
7557 TYPE_FIXED_INSTANCE (type) = 1;
7558 TYPE_LENGTH (type) = 0;
7560 TYPE_FIELD_TYPE (type, f) = new_type;
7561 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
7566 /* Given an object of type TYPE whose contents are at VALADDR and
7567 whose address in memory is ADDRESS, returns a revision of TYPE,
7568 which should be a non-dynamic-sized record, in which the variant
7569 part, if any, is replaced with the appropriate branch. Looks
7570 for discriminant values in DVAL0, which can be NULL if the record
7571 contains the necessary discriminant values. */
7573 static struct type *
7574 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
7575 CORE_ADDR address, struct value *dval0)
7577 struct value *mark = value_mark ();
7580 struct type *branch_type;
7581 int nfields = TYPE_NFIELDS (type);
7582 int variant_field = variant_field_index (type);
7584 if (variant_field == -1)
7588 dval = value_from_contents_and_address (type, valaddr, address);
7592 rtype = alloc_type_copy (type);
7593 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7594 INIT_CPLUS_SPECIFIC (rtype);
7595 TYPE_NFIELDS (rtype) = nfields;
7596 TYPE_FIELDS (rtype) =
7597 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7598 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7599 sizeof (struct field) * nfields);
7600 TYPE_NAME (rtype) = ada_type_name (type);
7601 TYPE_TAG_NAME (rtype) = NULL;
7602 TYPE_FIXED_INSTANCE (rtype) = 1;
7603 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7605 branch_type = to_fixed_variant_branch_type
7606 (TYPE_FIELD_TYPE (type, variant_field),
7607 cond_offset_host (valaddr,
7608 TYPE_FIELD_BITPOS (type, variant_field)
7610 cond_offset_target (address,
7611 TYPE_FIELD_BITPOS (type, variant_field)
7612 / TARGET_CHAR_BIT), dval);
7613 if (branch_type == NULL)
7617 for (f = variant_field + 1; f < nfields; f += 1)
7618 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7619 TYPE_NFIELDS (rtype) -= 1;
7623 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7624 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7625 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7626 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7628 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7630 value_free_to_mark (mark);
7634 /* An ordinary record type (with fixed-length fields) that describes
7635 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7636 beginning of this section]. Any necessary discriminants' values
7637 should be in DVAL, a record value; it may be NULL if the object
7638 at ADDR itself contains any necessary discriminant values.
7639 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7640 values from the record are needed. Except in the case that DVAL,
7641 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7642 unchecked) is replaced by a particular branch of the variant.
7644 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7645 is questionable and may be removed. It can arise during the
7646 processing of an unconstrained-array-of-record type where all the
7647 variant branches have exactly the same size. This is because in
7648 such cases, the compiler does not bother to use the XVS convention
7649 when encoding the record. I am currently dubious of this
7650 shortcut and suspect the compiler should be altered. FIXME. */
7652 static struct type *
7653 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7654 CORE_ADDR address, struct value *dval)
7656 struct type *templ_type;
7658 if (TYPE_FIXED_INSTANCE (type0))
7661 templ_type = dynamic_template_type (type0);
7663 if (templ_type != NULL)
7664 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
7665 else if (variant_field_index (type0) >= 0)
7667 if (dval == NULL && valaddr == NULL && address == 0)
7669 return to_record_with_fixed_variant_part (type0, valaddr, address,
7674 TYPE_FIXED_INSTANCE (type0) = 1;
7680 /* An ordinary record type (with fixed-length fields) that describes
7681 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7682 union type. Any necessary discriminants' values should be in DVAL,
7683 a record value. That is, this routine selects the appropriate
7684 branch of the union at ADDR according to the discriminant value
7685 indicated in the union's type name. Returns VAR_TYPE0 itself if
7686 it represents a variant subject to a pragma Unchecked_Union. */
7688 static struct type *
7689 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
7690 CORE_ADDR address, struct value *dval)
7693 struct type *templ_type;
7694 struct type *var_type;
7696 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7697 var_type = TYPE_TARGET_TYPE (var_type0);
7699 var_type = var_type0;
7701 templ_type = ada_find_parallel_type (var_type, "___XVU");
7703 if (templ_type != NULL)
7704 var_type = templ_type;
7706 if (is_unchecked_variant (var_type, value_type (dval)))
7709 ada_which_variant_applies (var_type,
7710 value_type (dval), value_contents (dval));
7713 return empty_record (var_type);
7714 else if (is_dynamic_field (var_type, which))
7715 return to_fixed_record_type
7716 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7717 valaddr, address, dval);
7718 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
7720 to_fixed_record_type
7721 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
7723 return TYPE_FIELD_TYPE (var_type, which);
7726 /* Assuming that TYPE0 is an array type describing the type of a value
7727 at ADDR, and that DVAL describes a record containing any
7728 discriminants used in TYPE0, returns a type for the value that
7729 contains no dynamic components (that is, no components whose sizes
7730 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7731 true, gives an error message if the resulting type's size is over
7734 static struct type *
7735 to_fixed_array_type (struct type *type0, struct value *dval,
7738 struct type *index_type_desc;
7739 struct type *result;
7740 int constrained_packed_array_p;
7742 type0 = ada_check_typedef (type0);
7743 if (TYPE_FIXED_INSTANCE (type0))
7746 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
7747 if (constrained_packed_array_p)
7748 type0 = decode_constrained_packed_array_type (type0);
7750 index_type_desc = ada_find_parallel_type (type0, "___XA");
7751 ada_fixup_array_indexes_type (index_type_desc);
7752 if (index_type_desc == NULL)
7754 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
7756 /* NOTE: elt_type---the fixed version of elt_type0---should never
7757 depend on the contents of the array in properly constructed
7759 /* Create a fixed version of the array element type.
7760 We're not providing the address of an element here,
7761 and thus the actual object value cannot be inspected to do
7762 the conversion. This should not be a problem, since arrays of
7763 unconstrained objects are not allowed. In particular, all
7764 the elements of an array of a tagged type should all be of
7765 the same type specified in the debugging info. No need to
7766 consult the object tag. */
7767 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
7769 /* Make sure we always create a new array type when dealing with
7770 packed array types, since we're going to fix-up the array
7771 type length and element bitsize a little further down. */
7772 if (elt_type0 == elt_type && !constrained_packed_array_p)
7775 result = create_array_type (alloc_type_copy (type0),
7776 elt_type, TYPE_INDEX_TYPE (type0));
7781 struct type *elt_type0;
7784 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
7785 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7787 /* NOTE: result---the fixed version of elt_type0---should never
7788 depend on the contents of the array in properly constructed
7790 /* Create a fixed version of the array element type.
7791 We're not providing the address of an element here,
7792 and thus the actual object value cannot be inspected to do
7793 the conversion. This should not be a problem, since arrays of
7794 unconstrained objects are not allowed. In particular, all
7795 the elements of an array of a tagged type should all be of
7796 the same type specified in the debugging info. No need to
7797 consult the object tag. */
7799 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
7802 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
7804 struct type *range_type =
7805 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
7807 result = create_array_type (alloc_type_copy (elt_type0),
7808 result, range_type);
7809 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7811 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
7812 error (_("array type with dynamic size is larger than varsize-limit"));
7815 if (constrained_packed_array_p)
7817 /* So far, the resulting type has been created as if the original
7818 type was a regular (non-packed) array type. As a result, the
7819 bitsize of the array elements needs to be set again, and the array
7820 length needs to be recomputed based on that bitsize. */
7821 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
7822 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
7824 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
7825 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
7826 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
7827 TYPE_LENGTH (result)++;
7830 TYPE_FIXED_INSTANCE (result) = 1;
7835 /* A standard type (containing no dynamically sized components)
7836 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7837 DVAL describes a record containing any discriminants used in TYPE0,
7838 and may be NULL if there are none, or if the object of type TYPE at
7839 ADDRESS or in VALADDR contains these discriminants.
7841 If CHECK_TAG is not null, in the case of tagged types, this function
7842 attempts to locate the object's tag and use it to compute the actual
7843 type. However, when ADDRESS is null, we cannot use it to determine the
7844 location of the tag, and therefore compute the tagged type's actual type.
7845 So we return the tagged type without consulting the tag. */
7847 static struct type *
7848 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
7849 CORE_ADDR address, struct value *dval, int check_tag)
7851 type = ada_check_typedef (type);
7852 switch (TYPE_CODE (type))
7856 case TYPE_CODE_STRUCT:
7858 struct type *static_type = to_static_fixed_type (type);
7859 struct type *fixed_record_type =
7860 to_fixed_record_type (type, valaddr, address, NULL);
7862 /* If STATIC_TYPE is a tagged type and we know the object's address,
7863 then we can determine its tag, and compute the object's actual
7864 type from there. Note that we have to use the fixed record
7865 type (the parent part of the record may have dynamic fields
7866 and the way the location of _tag is expressed may depend on
7869 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
7871 struct type *real_type =
7872 type_from_tag (value_tag_from_contents_and_address
7877 if (real_type != NULL)
7878 return to_fixed_record_type (real_type, valaddr, address, NULL);
7881 /* Check to see if there is a parallel ___XVZ variable.
7882 If there is, then it provides the actual size of our type. */
7883 else if (ada_type_name (fixed_record_type) != NULL)
7885 char *name = ada_type_name (fixed_record_type);
7886 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
7890 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
7891 size = get_int_var_value (xvz_name, &xvz_found);
7892 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
7894 fixed_record_type = copy_type (fixed_record_type);
7895 TYPE_LENGTH (fixed_record_type) = size;
7897 /* The FIXED_RECORD_TYPE may have be a stub. We have
7898 observed this when the debugging info is STABS, and
7899 apparently it is something that is hard to fix.
7901 In practice, we don't need the actual type definition
7902 at all, because the presence of the XVZ variable allows us
7903 to assume that there must be a XVS type as well, which we
7904 should be able to use later, when we need the actual type
7907 In the meantime, pretend that the "fixed" type we are
7908 returning is NOT a stub, because this can cause trouble
7909 when using this type to create new types targeting it.
7910 Indeed, the associated creation routines often check
7911 whether the target type is a stub and will try to replace
7912 it, thus using a type with the wrong size. This, in turn,
7913 might cause the new type to have the wrong size too.
7914 Consider the case of an array, for instance, where the size
7915 of the array is computed from the number of elements in
7916 our array multiplied by the size of its element. */
7917 TYPE_STUB (fixed_record_type) = 0;
7920 return fixed_record_type;
7922 case TYPE_CODE_ARRAY:
7923 return to_fixed_array_type (type, dval, 1);
7924 case TYPE_CODE_UNION:
7928 return to_fixed_variant_branch_type (type, valaddr, address, dval);
7932 /* The same as ada_to_fixed_type_1, except that it preserves the type
7933 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7935 The typedef layer needs be preserved in order to differentiate between
7936 arrays and array pointers when both types are implemented using the same
7937 fat pointer. In the array pointer case, the pointer is encoded as
7938 a typedef of the pointer type. For instance, considering:
7940 type String_Access is access String;
7941 S1 : String_Access := null;
7943 To the debugger, S1 is defined as a typedef of type String. But
7944 to the user, it is a pointer. So if the user tries to print S1,
7945 we should not dereference the array, but print the array address
7948 If we didn't preserve the typedef layer, we would lose the fact that
7949 the type is to be presented as a pointer (needs de-reference before
7950 being printed). And we would also use the source-level type name. */
7953 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7954 CORE_ADDR address, struct value *dval, int check_tag)
7957 struct type *fixed_type =
7958 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7960 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
7961 then preserve the typedef layer.
7963 Implementation note: We can only check the main-type portion of
7964 the TYPE and FIXED_TYPE, because eliminating the typedef layer
7965 from TYPE now returns a type that has the same instance flags
7966 as TYPE. For instance, if TYPE is a "typedef const", and its
7967 target type is a "struct", then the typedef elimination will return
7968 a "const" version of the target type. See check_typedef for more
7969 details about how the typedef layer elimination is done.
7971 brobecker/2010-11-19: It seems to me that the only case where it is
7972 useful to preserve the typedef layer is when dealing with fat pointers.
7973 Perhaps, we could add a check for that and preserve the typedef layer
7974 only in that situation. But this seems unecessary so far, probably
7975 because we call check_typedef/ada_check_typedef pretty much everywhere.
7977 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7978 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
7979 == TYPE_MAIN_TYPE (fixed_type)))
7985 /* A standard (static-sized) type corresponding as well as possible to
7986 TYPE0, but based on no runtime data. */
7988 static struct type *
7989 to_static_fixed_type (struct type *type0)
7996 if (TYPE_FIXED_INSTANCE (type0))
7999 type0 = ada_check_typedef (type0);
8001 switch (TYPE_CODE (type0))
8005 case TYPE_CODE_STRUCT:
8006 type = dynamic_template_type (type0);
8008 return template_to_static_fixed_type (type);
8010 return template_to_static_fixed_type (type0);
8011 case TYPE_CODE_UNION:
8012 type = ada_find_parallel_type (type0, "___XVU");
8014 return template_to_static_fixed_type (type);
8016 return template_to_static_fixed_type (type0);
8020 /* A static approximation of TYPE with all type wrappers removed. */
8022 static struct type *
8023 static_unwrap_type (struct type *type)
8025 if (ada_is_aligner_type (type))
8027 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
8028 if (ada_type_name (type1) == NULL)
8029 TYPE_NAME (type1) = ada_type_name (type);
8031 return static_unwrap_type (type1);
8035 struct type *raw_real_type = ada_get_base_type (type);
8037 if (raw_real_type == type)
8040 return to_static_fixed_type (raw_real_type);
8044 /* In some cases, incomplete and private types require
8045 cross-references that are not resolved as records (for example,
8047 type FooP is access Foo;
8049 type Foo is array ...;
8050 ). In these cases, since there is no mechanism for producing
8051 cross-references to such types, we instead substitute for FooP a
8052 stub enumeration type that is nowhere resolved, and whose tag is
8053 the name of the actual type. Call these types "non-record stubs". */
8055 /* A type equivalent to TYPE that is not a non-record stub, if one
8056 exists, otherwise TYPE. */
8059 ada_check_typedef (struct type *type)
8064 /* If our type is a typedef type of a fat pointer, then we're done.
8065 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8066 what allows us to distinguish between fat pointers that represent
8067 array types, and fat pointers that represent array access types
8068 (in both cases, the compiler implements them as fat pointers). */
8069 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8070 && is_thick_pntr (ada_typedef_target_type (type)))
8073 CHECK_TYPEDEF (type);
8074 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
8075 || !TYPE_STUB (type)
8076 || TYPE_TAG_NAME (type) == NULL)
8080 char *name = TYPE_TAG_NAME (type);
8081 struct type *type1 = ada_find_any_type (name);
8086 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8087 stubs pointing to arrays, as we don't create symbols for array
8088 types, only for the typedef-to-array types). If that's the case,
8089 strip the typedef layer. */
8090 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
8091 type1 = ada_check_typedef (type1);
8097 /* A value representing the data at VALADDR/ADDRESS as described by
8098 type TYPE0, but with a standard (static-sized) type that correctly
8099 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8100 type, then return VAL0 [this feature is simply to avoid redundant
8101 creation of struct values]. */
8103 static struct value *
8104 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
8107 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
8109 if (type == type0 && val0 != NULL)
8112 return value_from_contents_and_address (type, 0, address);
8115 /* A value representing VAL, but with a standard (static-sized) type
8116 that correctly describes it. Does not necessarily create a new
8120 ada_to_fixed_value (struct value *val)
8122 return ada_to_fixed_value_create (value_type (val),
8123 value_address (val),
8130 /* Table mapping attribute numbers to names.
8131 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8133 static const char *attribute_names[] = {
8151 ada_attribute_name (enum exp_opcode n)
8153 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
8154 return attribute_names[n - OP_ATR_FIRST + 1];
8156 return attribute_names[0];
8159 /* Evaluate the 'POS attribute applied to ARG. */
8162 pos_atr (struct value *arg)
8164 struct value *val = coerce_ref (arg);
8165 struct type *type = value_type (val);
8167 if (!discrete_type_p (type))
8168 error (_("'POS only defined on discrete types"));
8170 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8173 LONGEST v = value_as_long (val);
8175 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
8177 if (v == TYPE_FIELD_BITPOS (type, i))
8180 error (_("enumeration value is invalid: can't find 'POS"));
8183 return value_as_long (val);
8186 static struct value *
8187 value_pos_atr (struct type *type, struct value *arg)
8189 return value_from_longest (type, pos_atr (arg));
8192 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8194 static struct value *
8195 value_val_atr (struct type *type, struct value *arg)
8197 if (!discrete_type_p (type))
8198 error (_("'VAL only defined on discrete types"));
8199 if (!integer_type_p (value_type (arg)))
8200 error (_("'VAL requires integral argument"));
8202 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8204 long pos = value_as_long (arg);
8206 if (pos < 0 || pos >= TYPE_NFIELDS (type))
8207 error (_("argument to 'VAL out of range"));
8208 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
8211 return value_from_longest (type, value_as_long (arg));
8217 /* True if TYPE appears to be an Ada character type.
8218 [At the moment, this is true only for Character and Wide_Character;
8219 It is a heuristic test that could stand improvement]. */
8222 ada_is_character_type (struct type *type)
8226 /* If the type code says it's a character, then assume it really is,
8227 and don't check any further. */
8228 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
8231 /* Otherwise, assume it's a character type iff it is a discrete type
8232 with a known character type name. */
8233 name = ada_type_name (type);
8234 return (name != NULL
8235 && (TYPE_CODE (type) == TYPE_CODE_INT
8236 || TYPE_CODE (type) == TYPE_CODE_RANGE)
8237 && (strcmp (name, "character") == 0
8238 || strcmp (name, "wide_character") == 0
8239 || strcmp (name, "wide_wide_character") == 0
8240 || strcmp (name, "unsigned char") == 0));
8243 /* True if TYPE appears to be an Ada string type. */
8246 ada_is_string_type (struct type *type)
8248 type = ada_check_typedef (type);
8250 && TYPE_CODE (type) != TYPE_CODE_PTR
8251 && (ada_is_simple_array_type (type)
8252 || ada_is_array_descriptor_type (type))
8253 && ada_array_arity (type) == 1)
8255 struct type *elttype = ada_array_element_type (type, 1);
8257 return ada_is_character_type (elttype);
8263 /* The compiler sometimes provides a parallel XVS type for a given
8264 PAD type. Normally, it is safe to follow the PAD type directly,
8265 but older versions of the compiler have a bug that causes the offset
8266 of its "F" field to be wrong. Following that field in that case
8267 would lead to incorrect results, but this can be worked around
8268 by ignoring the PAD type and using the associated XVS type instead.
8270 Set to True if the debugger should trust the contents of PAD types.
8271 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8272 static int trust_pad_over_xvs = 1;
8274 /* True if TYPE is a struct type introduced by the compiler to force the
8275 alignment of a value. Such types have a single field with a
8276 distinctive name. */
8279 ada_is_aligner_type (struct type *type)
8281 type = ada_check_typedef (type);
8283 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
8286 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
8287 && TYPE_NFIELDS (type) == 1
8288 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
8291 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8292 the parallel type. */
8295 ada_get_base_type (struct type *raw_type)
8297 struct type *real_type_namer;
8298 struct type *raw_real_type;
8300 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
8303 if (ada_is_aligner_type (raw_type))
8304 /* The encoding specifies that we should always use the aligner type.
8305 So, even if this aligner type has an associated XVS type, we should
8308 According to the compiler gurus, an XVS type parallel to an aligner
8309 type may exist because of a stabs limitation. In stabs, aligner
8310 types are empty because the field has a variable-sized type, and
8311 thus cannot actually be used as an aligner type. As a result,
8312 we need the associated parallel XVS type to decode the type.
8313 Since the policy in the compiler is to not change the internal
8314 representation based on the debugging info format, we sometimes
8315 end up having a redundant XVS type parallel to the aligner type. */
8318 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
8319 if (real_type_namer == NULL
8320 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
8321 || TYPE_NFIELDS (real_type_namer) != 1)
8324 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
8326 /* This is an older encoding form where the base type needs to be
8327 looked up by name. We prefer the newer enconding because it is
8329 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
8330 if (raw_real_type == NULL)
8333 return raw_real_type;
8336 /* The field in our XVS type is a reference to the base type. */
8337 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
8340 /* The type of value designated by TYPE, with all aligners removed. */
8343 ada_aligned_type (struct type *type)
8345 if (ada_is_aligner_type (type))
8346 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
8348 return ada_get_base_type (type);
8352 /* The address of the aligned value in an object at address VALADDR
8353 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8356 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
8358 if (ada_is_aligner_type (type))
8359 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
8361 TYPE_FIELD_BITPOS (type,
8362 0) / TARGET_CHAR_BIT);
8369 /* The printed representation of an enumeration literal with encoded
8370 name NAME. The value is good to the next call of ada_enum_name. */
8372 ada_enum_name (const char *name)
8374 static char *result;
8375 static size_t result_len = 0;
8378 /* First, unqualify the enumeration name:
8379 1. Search for the last '.' character. If we find one, then skip
8380 all the preceding characters, the unqualified name starts
8381 right after that dot.
8382 2. Otherwise, we may be debugging on a target where the compiler
8383 translates dots into "__". Search forward for double underscores,
8384 but stop searching when we hit an overloading suffix, which is
8385 of the form "__" followed by digits. */
8387 tmp = strrchr (name, '.');
8392 while ((tmp = strstr (name, "__")) != NULL)
8394 if (isdigit (tmp[2]))
8405 if (name[1] == 'U' || name[1] == 'W')
8407 if (sscanf (name + 2, "%x", &v) != 1)
8413 GROW_VECT (result, result_len, 16);
8414 if (isascii (v) && isprint (v))
8415 xsnprintf (result, result_len, "'%c'", v);
8416 else if (name[1] == 'U')
8417 xsnprintf (result, result_len, "[\"%02x\"]", v);
8419 xsnprintf (result, result_len, "[\"%04x\"]", v);
8425 tmp = strstr (name, "__");
8427 tmp = strstr (name, "$");
8430 GROW_VECT (result, result_len, tmp - name + 1);
8431 strncpy (result, name, tmp - name);
8432 result[tmp - name] = '\0';
8440 /* Evaluate the subexpression of EXP starting at *POS as for
8441 evaluate_type, updating *POS to point just past the evaluated
8444 static struct value *
8445 evaluate_subexp_type (struct expression *exp, int *pos)
8447 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8450 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8453 static struct value *
8454 unwrap_value (struct value *val)
8456 struct type *type = ada_check_typedef (value_type (val));
8458 if (ada_is_aligner_type (type))
8460 struct value *v = ada_value_struct_elt (val, "F", 0);
8461 struct type *val_type = ada_check_typedef (value_type (v));
8463 if (ada_type_name (val_type) == NULL)
8464 TYPE_NAME (val_type) = ada_type_name (type);
8466 return unwrap_value (v);
8470 struct type *raw_real_type =
8471 ada_check_typedef (ada_get_base_type (type));
8473 /* If there is no parallel XVS or XVE type, then the value is
8474 already unwrapped. Return it without further modification. */
8475 if ((type == raw_real_type)
8476 && ada_find_parallel_type (type, "___XVE") == NULL)
8480 coerce_unspec_val_to_type
8481 (val, ada_to_fixed_type (raw_real_type, 0,
8482 value_address (val),
8487 static struct value *
8488 cast_to_fixed (struct type *type, struct value *arg)
8492 if (type == value_type (arg))
8494 else if (ada_is_fixed_point_type (value_type (arg)))
8495 val = ada_float_to_fixed (type,
8496 ada_fixed_to_float (value_type (arg),
8497 value_as_long (arg)));
8500 DOUBLEST argd = value_as_double (arg);
8502 val = ada_float_to_fixed (type, argd);
8505 return value_from_longest (type, val);
8508 static struct value *
8509 cast_from_fixed (struct type *type, struct value *arg)
8511 DOUBLEST val = ada_fixed_to_float (value_type (arg),
8512 value_as_long (arg));
8514 return value_from_double (type, val);
8517 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8518 return the converted value. */
8520 static struct value *
8521 coerce_for_assign (struct type *type, struct value *val)
8523 struct type *type2 = value_type (val);
8528 type2 = ada_check_typedef (type2);
8529 type = ada_check_typedef (type);
8531 if (TYPE_CODE (type2) == TYPE_CODE_PTR
8532 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8534 val = ada_value_ind (val);
8535 type2 = value_type (val);
8538 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
8539 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8541 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
8542 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8543 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
8544 error (_("Incompatible types in assignment"));
8545 deprecated_set_value_type (val, type);
8550 static struct value *
8551 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
8554 struct type *type1, *type2;
8557 arg1 = coerce_ref (arg1);
8558 arg2 = coerce_ref (arg2);
8559 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
8560 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
8562 if (TYPE_CODE (type1) != TYPE_CODE_INT
8563 || TYPE_CODE (type2) != TYPE_CODE_INT)
8564 return value_binop (arg1, arg2, op);
8573 return value_binop (arg1, arg2, op);
8576 v2 = value_as_long (arg2);
8578 error (_("second operand of %s must not be zero."), op_string (op));
8580 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
8581 return value_binop (arg1, arg2, op);
8583 v1 = value_as_long (arg1);
8588 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
8589 v += v > 0 ? -1 : 1;
8597 /* Should not reach this point. */
8601 val = allocate_value (type1);
8602 store_unsigned_integer (value_contents_raw (val),
8603 TYPE_LENGTH (value_type (val)),
8604 gdbarch_byte_order (get_type_arch (type1)), v);
8609 ada_value_equal (struct value *arg1, struct value *arg2)
8611 if (ada_is_direct_array_type (value_type (arg1))
8612 || ada_is_direct_array_type (value_type (arg2)))
8614 /* Automatically dereference any array reference before
8615 we attempt to perform the comparison. */
8616 arg1 = ada_coerce_ref (arg1);
8617 arg2 = ada_coerce_ref (arg2);
8619 arg1 = ada_coerce_to_simple_array (arg1);
8620 arg2 = ada_coerce_to_simple_array (arg2);
8621 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
8622 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
8623 error (_("Attempt to compare array with non-array"));
8624 /* FIXME: The following works only for types whose
8625 representations use all bits (no padding or undefined bits)
8626 and do not have user-defined equality. */
8628 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
8629 && memcmp (value_contents (arg1), value_contents (arg2),
8630 TYPE_LENGTH (value_type (arg1))) == 0;
8632 return value_equal (arg1, arg2);
8635 /* Total number of component associations in the aggregate starting at
8636 index PC in EXP. Assumes that index PC is the start of an
8640 num_component_specs (struct expression *exp, int pc)
8644 m = exp->elts[pc + 1].longconst;
8647 for (i = 0; i < m; i += 1)
8649 switch (exp->elts[pc].opcode)
8655 n += exp->elts[pc + 1].longconst;
8658 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8663 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8664 component of LHS (a simple array or a record), updating *POS past
8665 the expression, assuming that LHS is contained in CONTAINER. Does
8666 not modify the inferior's memory, nor does it modify LHS (unless
8667 LHS == CONTAINER). */
8670 assign_component (struct value *container, struct value *lhs, LONGEST index,
8671 struct expression *exp, int *pos)
8673 struct value *mark = value_mark ();
8676 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8678 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
8679 struct value *index_val = value_from_longest (index_type, index);
8681 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8685 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
8686 elt = ada_to_fixed_value (unwrap_value (elt));
8689 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8690 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8692 value_assign_to_component (container, elt,
8693 ada_evaluate_subexp (NULL, exp, pos,
8696 value_free_to_mark (mark);
8699 /* Assuming that LHS represents an lvalue having a record or array
8700 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8701 of that aggregate's value to LHS, advancing *POS past the
8702 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8703 lvalue containing LHS (possibly LHS itself). Does not modify
8704 the inferior's memory, nor does it modify the contents of
8705 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8707 static struct value *
8708 assign_aggregate (struct value *container,
8709 struct value *lhs, struct expression *exp,
8710 int *pos, enum noside noside)
8712 struct type *lhs_type;
8713 int n = exp->elts[*pos+1].longconst;
8714 LONGEST low_index, high_index;
8717 int max_indices, num_indices;
8718 int is_array_aggregate;
8722 if (noside != EVAL_NORMAL)
8724 for (i = 0; i < n; i += 1)
8725 ada_evaluate_subexp (NULL, exp, pos, noside);
8729 container = ada_coerce_ref (container);
8730 if (ada_is_direct_array_type (value_type (container)))
8731 container = ada_coerce_to_simple_array (container);
8732 lhs = ada_coerce_ref (lhs);
8733 if (!deprecated_value_modifiable (lhs))
8734 error (_("Left operand of assignment is not a modifiable lvalue."));
8736 lhs_type = value_type (lhs);
8737 if (ada_is_direct_array_type (lhs_type))
8739 lhs = ada_coerce_to_simple_array (lhs);
8740 lhs_type = value_type (lhs);
8741 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8742 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8743 is_array_aggregate = 1;
8745 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8748 high_index = num_visible_fields (lhs_type) - 1;
8749 is_array_aggregate = 0;
8752 error (_("Left-hand side must be array or record."));
8754 num_specs = num_component_specs (exp, *pos - 3);
8755 max_indices = 4 * num_specs + 4;
8756 indices = alloca (max_indices * sizeof (indices[0]));
8757 indices[0] = indices[1] = low_index - 1;
8758 indices[2] = indices[3] = high_index + 1;
8761 for (i = 0; i < n; i += 1)
8763 switch (exp->elts[*pos].opcode)
8766 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8767 &num_indices, max_indices,
8768 low_index, high_index);
8771 aggregate_assign_positional (container, lhs, exp, pos, indices,
8772 &num_indices, max_indices,
8773 low_index, high_index);
8777 error (_("Misplaced 'others' clause"));
8778 aggregate_assign_others (container, lhs, exp, pos, indices,
8779 num_indices, low_index, high_index);
8782 error (_("Internal error: bad aggregate clause"));
8789 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8790 construct at *POS, updating *POS past the construct, given that
8791 the positions are relative to lower bound LOW, where HIGH is the
8792 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8793 updating *NUM_INDICES as needed. CONTAINER is as for
8794 assign_aggregate. */
8796 aggregate_assign_positional (struct value *container,
8797 struct value *lhs, struct expression *exp,
8798 int *pos, LONGEST *indices, int *num_indices,
8799 int max_indices, LONGEST low, LONGEST high)
8801 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8803 if (ind - 1 == high)
8804 warning (_("Extra components in aggregate ignored."));
8807 add_component_interval (ind, ind, indices, num_indices, max_indices);
8809 assign_component (container, lhs, ind, exp, pos);
8812 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8815 /* Assign into the components of LHS indexed by the OP_CHOICES
8816 construct at *POS, updating *POS past the construct, given that
8817 the allowable indices are LOW..HIGH. Record the indices assigned
8818 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8819 needed. CONTAINER is as for assign_aggregate. */
8821 aggregate_assign_from_choices (struct value *container,
8822 struct value *lhs, struct expression *exp,
8823 int *pos, LONGEST *indices, int *num_indices,
8824 int max_indices, LONGEST low, LONGEST high)
8827 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
8828 int choice_pos, expr_pc;
8829 int is_array = ada_is_direct_array_type (value_type (lhs));
8831 choice_pos = *pos += 3;
8833 for (j = 0; j < n_choices; j += 1)
8834 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8836 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8838 for (j = 0; j < n_choices; j += 1)
8840 LONGEST lower, upper;
8841 enum exp_opcode op = exp->elts[choice_pos].opcode;
8843 if (op == OP_DISCRETE_RANGE)
8846 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8848 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8853 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8865 name = &exp->elts[choice_pos + 2].string;
8868 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8871 error (_("Invalid record component association."));
8873 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8875 if (! find_struct_field (name, value_type (lhs), 0,
8876 NULL, NULL, NULL, NULL, &ind))
8877 error (_("Unknown component name: %s."), name);
8878 lower = upper = ind;
8881 if (lower <= upper && (lower < low || upper > high))
8882 error (_("Index in component association out of bounds."));
8884 add_component_interval (lower, upper, indices, num_indices,
8886 while (lower <= upper)
8891 assign_component (container, lhs, lower, exp, &pos1);
8897 /* Assign the value of the expression in the OP_OTHERS construct in
8898 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8899 have not been previously assigned. The index intervals already assigned
8900 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8901 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
8903 aggregate_assign_others (struct value *container,
8904 struct value *lhs, struct expression *exp,
8905 int *pos, LONGEST *indices, int num_indices,
8906 LONGEST low, LONGEST high)
8909 int expr_pc = *pos + 1;
8911 for (i = 0; i < num_indices - 2; i += 2)
8915 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8920 assign_component (container, lhs, ind, exp, &localpos);
8923 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8926 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8927 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8928 modifying *SIZE as needed. It is an error if *SIZE exceeds
8929 MAX_SIZE. The resulting intervals do not overlap. */
8931 add_component_interval (LONGEST low, LONGEST high,
8932 LONGEST* indices, int *size, int max_size)
8936 for (i = 0; i < *size; i += 2) {
8937 if (high >= indices[i] && low <= indices[i + 1])
8941 for (kh = i + 2; kh < *size; kh += 2)
8942 if (high < indices[kh])
8944 if (low < indices[i])
8946 indices[i + 1] = indices[kh - 1];
8947 if (high > indices[i + 1])
8948 indices[i + 1] = high;
8949 memcpy (indices + i + 2, indices + kh, *size - kh);
8950 *size -= kh - i - 2;
8953 else if (high < indices[i])
8957 if (*size == max_size)
8958 error (_("Internal error: miscounted aggregate components."));
8960 for (j = *size-1; j >= i+2; j -= 1)
8961 indices[j] = indices[j - 2];
8963 indices[i + 1] = high;
8966 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8969 static struct value *
8970 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8972 if (type == ada_check_typedef (value_type (arg2)))
8975 if (ada_is_fixed_point_type (type))
8976 return (cast_to_fixed (type, arg2));
8978 if (ada_is_fixed_point_type (value_type (arg2)))
8979 return cast_from_fixed (type, arg2);
8981 return value_cast (type, arg2);
8984 /* Evaluating Ada expressions, and printing their result.
8985 ------------------------------------------------------
8990 We usually evaluate an Ada expression in order to print its value.
8991 We also evaluate an expression in order to print its type, which
8992 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8993 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8994 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8995 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8998 Evaluating expressions is a little more complicated for Ada entities
8999 than it is for entities in languages such as C. The main reason for
9000 this is that Ada provides types whose definition might be dynamic.
9001 One example of such types is variant records. Or another example
9002 would be an array whose bounds can only be known at run time.
9004 The following description is a general guide as to what should be
9005 done (and what should NOT be done) in order to evaluate an expression
9006 involving such types, and when. This does not cover how the semantic
9007 information is encoded by GNAT as this is covered separatly. For the
9008 document used as the reference for the GNAT encoding, see exp_dbug.ads
9009 in the GNAT sources.
9011 Ideally, we should embed each part of this description next to its
9012 associated code. Unfortunately, the amount of code is so vast right
9013 now that it's hard to see whether the code handling a particular
9014 situation might be duplicated or not. One day, when the code is
9015 cleaned up, this guide might become redundant with the comments
9016 inserted in the code, and we might want to remove it.
9018 2. ``Fixing'' an Entity, the Simple Case:
9019 -----------------------------------------
9021 When evaluating Ada expressions, the tricky issue is that they may
9022 reference entities whose type contents and size are not statically
9023 known. Consider for instance a variant record:
9025 type Rec (Empty : Boolean := True) is record
9028 when False => Value : Integer;
9031 Yes : Rec := (Empty => False, Value => 1);
9032 No : Rec := (empty => True);
9034 The size and contents of that record depends on the value of the
9035 descriminant (Rec.Empty). At this point, neither the debugging
9036 information nor the associated type structure in GDB are able to
9037 express such dynamic types. So what the debugger does is to create
9038 "fixed" versions of the type that applies to the specific object.
9039 We also informally refer to this opperation as "fixing" an object,
9040 which means creating its associated fixed type.
9042 Example: when printing the value of variable "Yes" above, its fixed
9043 type would look like this:
9050 On the other hand, if we printed the value of "No", its fixed type
9057 Things become a little more complicated when trying to fix an entity
9058 with a dynamic type that directly contains another dynamic type,
9059 such as an array of variant records, for instance. There are
9060 two possible cases: Arrays, and records.
9062 3. ``Fixing'' Arrays:
9063 ---------------------
9065 The type structure in GDB describes an array in terms of its bounds,
9066 and the type of its elements. By design, all elements in the array
9067 have the same type and we cannot represent an array of variant elements
9068 using the current type structure in GDB. When fixing an array,
9069 we cannot fix the array element, as we would potentially need one
9070 fixed type per element of the array. As a result, the best we can do
9071 when fixing an array is to produce an array whose bounds and size
9072 are correct (allowing us to read it from memory), but without having
9073 touched its element type. Fixing each element will be done later,
9074 when (if) necessary.
9076 Arrays are a little simpler to handle than records, because the same
9077 amount of memory is allocated for each element of the array, even if
9078 the amount of space actually used by each element differs from element
9079 to element. Consider for instance the following array of type Rec:
9081 type Rec_Array is array (1 .. 2) of Rec;
9083 The actual amount of memory occupied by each element might be different
9084 from element to element, depending on the value of their discriminant.
9085 But the amount of space reserved for each element in the array remains
9086 fixed regardless. So we simply need to compute that size using
9087 the debugging information available, from which we can then determine
9088 the array size (we multiply the number of elements of the array by
9089 the size of each element).
9091 The simplest case is when we have an array of a constrained element
9092 type. For instance, consider the following type declarations:
9094 type Bounded_String (Max_Size : Integer) is
9096 Buffer : String (1 .. Max_Size);
9098 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9100 In this case, the compiler describes the array as an array of
9101 variable-size elements (identified by its XVS suffix) for which
9102 the size can be read in the parallel XVZ variable.
9104 In the case of an array of an unconstrained element type, the compiler
9105 wraps the array element inside a private PAD type. This type should not
9106 be shown to the user, and must be "unwrap"'ed before printing. Note
9107 that we also use the adjective "aligner" in our code to designate
9108 these wrapper types.
9110 In some cases, the size allocated for each element is statically
9111 known. In that case, the PAD type already has the correct size,
9112 and the array element should remain unfixed.
9114 But there are cases when this size is not statically known.
9115 For instance, assuming that "Five" is an integer variable:
9117 type Dynamic is array (1 .. Five) of Integer;
9118 type Wrapper (Has_Length : Boolean := False) is record
9121 when True => Length : Integer;
9125 type Wrapper_Array is array (1 .. 2) of Wrapper;
9127 Hello : Wrapper_Array := (others => (Has_Length => True,
9128 Data => (others => 17),
9132 The debugging info would describe variable Hello as being an
9133 array of a PAD type. The size of that PAD type is not statically
9134 known, but can be determined using a parallel XVZ variable.
9135 In that case, a copy of the PAD type with the correct size should
9136 be used for the fixed array.
9138 3. ``Fixing'' record type objects:
9139 ----------------------------------
9141 Things are slightly different from arrays in the case of dynamic
9142 record types. In this case, in order to compute the associated
9143 fixed type, we need to determine the size and offset of each of
9144 its components. This, in turn, requires us to compute the fixed
9145 type of each of these components.
9147 Consider for instance the example:
9149 type Bounded_String (Max_Size : Natural) is record
9150 Str : String (1 .. Max_Size);
9153 My_String : Bounded_String (Max_Size => 10);
9155 In that case, the position of field "Length" depends on the size
9156 of field Str, which itself depends on the value of the Max_Size
9157 discriminant. In order to fix the type of variable My_String,
9158 we need to fix the type of field Str. Therefore, fixing a variant
9159 record requires us to fix each of its components.
9161 However, if a component does not have a dynamic size, the component
9162 should not be fixed. In particular, fields that use a PAD type
9163 should not fixed. Here is an example where this might happen
9164 (assuming type Rec above):
9166 type Container (Big : Boolean) is record
9170 when True => Another : Integer;
9174 My_Container : Container := (Big => False,
9175 First => (Empty => True),
9178 In that example, the compiler creates a PAD type for component First,
9179 whose size is constant, and then positions the component After just
9180 right after it. The offset of component After is therefore constant
9183 The debugger computes the position of each field based on an algorithm
9184 that uses, among other things, the actual position and size of the field
9185 preceding it. Let's now imagine that the user is trying to print
9186 the value of My_Container. If the type fixing was recursive, we would
9187 end up computing the offset of field After based on the size of the
9188 fixed version of field First. And since in our example First has
9189 only one actual field, the size of the fixed type is actually smaller
9190 than the amount of space allocated to that field, and thus we would
9191 compute the wrong offset of field After.
9193 To make things more complicated, we need to watch out for dynamic
9194 components of variant records (identified by the ___XVL suffix in
9195 the component name). Even if the target type is a PAD type, the size
9196 of that type might not be statically known. So the PAD type needs
9197 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9198 we might end up with the wrong size for our component. This can be
9199 observed with the following type declarations:
9201 type Octal is new Integer range 0 .. 7;
9202 type Octal_Array is array (Positive range <>) of Octal;
9203 pragma Pack (Octal_Array);
9205 type Octal_Buffer (Size : Positive) is record
9206 Buffer : Octal_Array (1 .. Size);
9210 In that case, Buffer is a PAD type whose size is unset and needs
9211 to be computed by fixing the unwrapped type.
9213 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9214 ----------------------------------------------------------
9216 Lastly, when should the sub-elements of an entity that remained unfixed
9217 thus far, be actually fixed?
9219 The answer is: Only when referencing that element. For instance
9220 when selecting one component of a record, this specific component
9221 should be fixed at that point in time. Or when printing the value
9222 of a record, each component should be fixed before its value gets
9223 printed. Similarly for arrays, the element of the array should be
9224 fixed when printing each element of the array, or when extracting
9225 one element out of that array. On the other hand, fixing should
9226 not be performed on the elements when taking a slice of an array!
9228 Note that one of the side-effects of miscomputing the offset and
9229 size of each field is that we end up also miscomputing the size
9230 of the containing type. This can have adverse results when computing
9231 the value of an entity. GDB fetches the value of an entity based
9232 on the size of its type, and thus a wrong size causes GDB to fetch
9233 the wrong amount of memory. In the case where the computed size is
9234 too small, GDB fetches too little data to print the value of our
9235 entiry. Results in this case as unpredicatble, as we usually read
9236 past the buffer containing the data =:-o. */
9238 /* Implement the evaluate_exp routine in the exp_descriptor structure
9239 for the Ada language. */
9241 static struct value *
9242 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
9243 int *pos, enum noside noside)
9248 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
9251 struct value **argvec;
9255 op = exp->elts[pc].opcode;
9261 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9262 arg1 = unwrap_value (arg1);
9264 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9265 then we need to perform the conversion manually, because
9266 evaluate_subexp_standard doesn't do it. This conversion is
9267 necessary in Ada because the different kinds of float/fixed
9268 types in Ada have different representations.
9270 Similarly, we need to perform the conversion from OP_LONG
9272 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
9273 arg1 = ada_value_cast (expect_type, arg1, noside);
9279 struct value *result;
9282 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
9283 /* The result type will have code OP_STRING, bashed there from
9284 OP_ARRAY. Bash it back. */
9285 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
9286 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
9292 type = exp->elts[pc + 1].type;
9293 arg1 = evaluate_subexp (type, exp, pos, noside);
9294 if (noside == EVAL_SKIP)
9296 arg1 = ada_value_cast (type, arg1, noside);
9301 type = exp->elts[pc + 1].type;
9302 return ada_evaluate_subexp (type, exp, pos, noside);
9305 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9306 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9308 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
9309 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9311 return ada_value_assign (arg1, arg1);
9313 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9314 except if the lhs of our assignment is a convenience variable.
9315 In the case of assigning to a convenience variable, the lhs
9316 should be exactly the result of the evaluation of the rhs. */
9317 type = value_type (arg1);
9318 if (VALUE_LVAL (arg1) == lval_internalvar)
9320 arg2 = evaluate_subexp (type, exp, pos, noside);
9321 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9323 if (ada_is_fixed_point_type (value_type (arg1)))
9324 arg2 = cast_to_fixed (value_type (arg1), arg2);
9325 else if (ada_is_fixed_point_type (value_type (arg2)))
9327 (_("Fixed-point values must be assigned to fixed-point variables"));
9329 arg2 = coerce_for_assign (value_type (arg1), arg2);
9330 return ada_value_assign (arg1, arg2);
9333 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9334 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9335 if (noside == EVAL_SKIP)
9337 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9338 return (value_from_longest
9340 value_as_long (arg1) + value_as_long (arg2)));
9341 if ((ada_is_fixed_point_type (value_type (arg1))
9342 || ada_is_fixed_point_type (value_type (arg2)))
9343 && value_type (arg1) != value_type (arg2))
9344 error (_("Operands of fixed-point addition must have the same type"));
9345 /* Do the addition, and cast the result to the type of the first
9346 argument. We cannot cast the result to a reference type, so if
9347 ARG1 is a reference type, find its underlying type. */
9348 type = value_type (arg1);
9349 while (TYPE_CODE (type) == TYPE_CODE_REF)
9350 type = TYPE_TARGET_TYPE (type);
9351 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9352 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
9355 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9356 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9357 if (noside == EVAL_SKIP)
9359 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9360 return (value_from_longest
9362 value_as_long (arg1) - value_as_long (arg2)));
9363 if ((ada_is_fixed_point_type (value_type (arg1))
9364 || ada_is_fixed_point_type (value_type (arg2)))
9365 && value_type (arg1) != value_type (arg2))
9366 error (_("Operands of fixed-point subtraction "
9367 "must have the same type"));
9368 /* Do the substraction, and cast the result to the type of the first
9369 argument. We cannot cast the result to a reference type, so if
9370 ARG1 is a reference type, find its underlying type. */
9371 type = value_type (arg1);
9372 while (TYPE_CODE (type) == TYPE_CODE_REF)
9373 type = TYPE_TARGET_TYPE (type);
9374 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9375 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
9381 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9382 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9383 if (noside == EVAL_SKIP)
9385 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9387 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9388 return value_zero (value_type (arg1), not_lval);
9392 type = builtin_type (exp->gdbarch)->builtin_double;
9393 if (ada_is_fixed_point_type (value_type (arg1)))
9394 arg1 = cast_from_fixed (type, arg1);
9395 if (ada_is_fixed_point_type (value_type (arg2)))
9396 arg2 = cast_from_fixed (type, arg2);
9397 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9398 return ada_value_binop (arg1, arg2, op);
9402 case BINOP_NOTEQUAL:
9403 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9404 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
9405 if (noside == EVAL_SKIP)
9407 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9411 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9412 tem = ada_value_equal (arg1, arg2);
9414 if (op == BINOP_NOTEQUAL)
9416 type = language_bool_type (exp->language_defn, exp->gdbarch);
9417 return value_from_longest (type, (LONGEST) tem);
9420 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9421 if (noside == EVAL_SKIP)
9423 else if (ada_is_fixed_point_type (value_type (arg1)))
9424 return value_cast (value_type (arg1), value_neg (arg1));
9427 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9428 return value_neg (arg1);
9431 case BINOP_LOGICAL_AND:
9432 case BINOP_LOGICAL_OR:
9433 case UNOP_LOGICAL_NOT:
9438 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9439 type = language_bool_type (exp->language_defn, exp->gdbarch);
9440 return value_cast (type, val);
9443 case BINOP_BITWISE_AND:
9444 case BINOP_BITWISE_IOR:
9445 case BINOP_BITWISE_XOR:
9449 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9451 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9453 return value_cast (value_type (arg1), val);
9459 if (noside == EVAL_SKIP)
9464 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
9465 /* Only encountered when an unresolved symbol occurs in a
9466 context other than a function call, in which case, it is
9468 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9469 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
9470 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9472 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
9473 /* Check to see if this is a tagged type. We also need to handle
9474 the case where the type is a reference to a tagged type, but
9475 we have to be careful to exclude pointers to tagged types.
9476 The latter should be shown as usual (as a pointer), whereas
9477 a reference should mostly be transparent to the user. */
9478 if (ada_is_tagged_type (type, 0)
9479 || (TYPE_CODE(type) == TYPE_CODE_REF
9480 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
9482 /* Tagged types are a little special in the fact that the real
9483 type is dynamic and can only be determined by inspecting the
9484 object's tag. This means that we need to get the object's
9485 value first (EVAL_NORMAL) and then extract the actual object
9488 Note that we cannot skip the final step where we extract
9489 the object type from its tag, because the EVAL_NORMAL phase
9490 results in dynamic components being resolved into fixed ones.
9491 This can cause problems when trying to print the type
9492 description of tagged types whose parent has a dynamic size:
9493 We use the type name of the "_parent" component in order
9494 to print the name of the ancestor type in the type description.
9495 If that component had a dynamic size, the resolution into
9496 a fixed type would result in the loss of that type name,
9497 thus preventing us from printing the name of the ancestor
9498 type in the type description. */
9499 struct type *actual_type;
9501 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
9502 actual_type = type_from_tag (ada_value_tag (arg1));
9503 if (actual_type == NULL)
9504 /* If, for some reason, we were unable to determine
9505 the actual type from the tag, then use the static
9506 approximation that we just computed as a fallback.
9507 This can happen if the debugging information is
9508 incomplete, for instance. */
9511 return value_zero (actual_type, not_lval);
9516 (to_static_fixed_type
9517 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
9522 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9523 arg1 = unwrap_value (arg1);
9524 return ada_to_fixed_value (arg1);
9530 /* Allocate arg vector, including space for the function to be
9531 called in argvec[0] and a terminating NULL. */
9532 nargs = longest_to_int (exp->elts[pc + 1].longconst);
9534 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
9536 if (exp->elts[*pos].opcode == OP_VAR_VALUE
9537 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
9538 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9539 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
9542 for (tem = 0; tem <= nargs; tem += 1)
9543 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9546 if (noside == EVAL_SKIP)
9550 if (ada_is_constrained_packed_array_type
9551 (desc_base_type (value_type (argvec[0]))))
9552 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
9553 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9554 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
9555 /* This is a packed array that has already been fixed, and
9556 therefore already coerced to a simple array. Nothing further
9559 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
9560 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9561 && VALUE_LVAL (argvec[0]) == lval_memory))
9562 argvec[0] = value_addr (argvec[0]);
9564 type = ada_check_typedef (value_type (argvec[0]));
9566 /* Ada allows us to implicitly dereference arrays when subscripting
9567 them. So, if this is an array typedef (encoding use for array
9568 access types encoded as fat pointers), strip it now. */
9569 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
9570 type = ada_typedef_target_type (type);
9572 if (TYPE_CODE (type) == TYPE_CODE_PTR)
9574 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
9576 case TYPE_CODE_FUNC:
9577 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9579 case TYPE_CODE_ARRAY:
9581 case TYPE_CODE_STRUCT:
9582 if (noside != EVAL_AVOID_SIDE_EFFECTS)
9583 argvec[0] = ada_value_ind (argvec[0]);
9584 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9587 error (_("cannot subscript or call something of type `%s'"),
9588 ada_type_name (value_type (argvec[0])));
9593 switch (TYPE_CODE (type))
9595 case TYPE_CODE_FUNC:
9596 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9597 return allocate_value (TYPE_TARGET_TYPE (type));
9598 return call_function_by_hand (argvec[0], nargs, argvec + 1);
9599 case TYPE_CODE_STRUCT:
9603 arity = ada_array_arity (type);
9604 type = ada_array_element_type (type, nargs);
9606 error (_("cannot subscript or call a record"));
9608 error (_("wrong number of subscripts; expecting %d"), arity);
9609 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9610 return value_zero (ada_aligned_type (type), lval_memory);
9612 unwrap_value (ada_value_subscript
9613 (argvec[0], nargs, argvec + 1));
9615 case TYPE_CODE_ARRAY:
9616 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9618 type = ada_array_element_type (type, nargs);
9620 error (_("element type of array unknown"));
9622 return value_zero (ada_aligned_type (type), lval_memory);
9625 unwrap_value (ada_value_subscript
9626 (ada_coerce_to_simple_array (argvec[0]),
9627 nargs, argvec + 1));
9628 case TYPE_CODE_PTR: /* Pointer to array */
9629 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
9630 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9632 type = ada_array_element_type (type, nargs);
9634 error (_("element type of array unknown"));
9636 return value_zero (ada_aligned_type (type), lval_memory);
9639 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
9640 nargs, argvec + 1));
9643 error (_("Attempt to index or call something other than an "
9644 "array or function"));
9649 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9650 struct value *low_bound_val =
9651 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9652 struct value *high_bound_val =
9653 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9657 low_bound_val = coerce_ref (low_bound_val);
9658 high_bound_val = coerce_ref (high_bound_val);
9659 low_bound = pos_atr (low_bound_val);
9660 high_bound = pos_atr (high_bound_val);
9662 if (noside == EVAL_SKIP)
9665 /* If this is a reference to an aligner type, then remove all
9667 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9668 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
9669 TYPE_TARGET_TYPE (value_type (array)) =
9670 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
9672 if (ada_is_constrained_packed_array_type (value_type (array)))
9673 error (_("cannot slice a packed array"));
9675 /* If this is a reference to an array or an array lvalue,
9676 convert to a pointer. */
9677 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9678 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
9679 && VALUE_LVAL (array) == lval_memory))
9680 array = value_addr (array);
9682 if (noside == EVAL_AVOID_SIDE_EFFECTS
9683 && ada_is_array_descriptor_type (ada_check_typedef
9684 (value_type (array))))
9685 return empty_array (ada_type_of_array (array, 0), low_bound);
9687 array = ada_coerce_to_simple_array_ptr (array);
9689 /* If we have more than one level of pointer indirection,
9690 dereference the value until we get only one level. */
9691 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
9692 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
9694 array = value_ind (array);
9696 /* Make sure we really do have an array type before going further,
9697 to avoid a SEGV when trying to get the index type or the target
9698 type later down the road if the debug info generated by
9699 the compiler is incorrect or incomplete. */
9700 if (!ada_is_simple_array_type (value_type (array)))
9701 error (_("cannot take slice of non-array"));
9703 if (TYPE_CODE (ada_check_typedef (value_type (array)))
9706 struct type *type0 = ada_check_typedef (value_type (array));
9708 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
9709 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
9712 struct type *arr_type0 =
9713 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
9715 return ada_value_slice_from_ptr (array, arr_type0,
9716 longest_to_int (low_bound),
9717 longest_to_int (high_bound));
9720 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9722 else if (high_bound < low_bound)
9723 return empty_array (value_type (array), low_bound);
9725 return ada_value_slice (array, longest_to_int (low_bound),
9726 longest_to_int (high_bound));
9731 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9732 type = check_typedef (exp->elts[pc + 1].type);
9734 if (noside == EVAL_SKIP)
9737 switch (TYPE_CODE (type))
9740 lim_warning (_("Membership test incompletely implemented; "
9741 "always returns true"));
9742 type = language_bool_type (exp->language_defn, exp->gdbarch);
9743 return value_from_longest (type, (LONGEST) 1);
9745 case TYPE_CODE_RANGE:
9746 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
9747 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
9748 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9749 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9750 type = language_bool_type (exp->language_defn, exp->gdbarch);
9752 value_from_longest (type,
9753 (value_less (arg1, arg3)
9754 || value_equal (arg1, arg3))
9755 && (value_less (arg2, arg1)
9756 || value_equal (arg2, arg1)));
9759 case BINOP_IN_BOUNDS:
9761 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9762 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9764 if (noside == EVAL_SKIP)
9767 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9769 type = language_bool_type (exp->language_defn, exp->gdbarch);
9770 return value_zero (type, not_lval);
9773 tem = longest_to_int (exp->elts[pc + 1].longconst);
9775 type = ada_index_type (value_type (arg2), tem, "range");
9777 type = value_type (arg1);
9779 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
9780 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
9782 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9783 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9784 type = language_bool_type (exp->language_defn, exp->gdbarch);
9786 value_from_longest (type,
9787 (value_less (arg1, arg3)
9788 || value_equal (arg1, arg3))
9789 && (value_less (arg2, arg1)
9790 || value_equal (arg2, arg1)));
9792 case TERNOP_IN_RANGE:
9793 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9794 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9795 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9797 if (noside == EVAL_SKIP)
9800 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9801 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9802 type = language_bool_type (exp->language_defn, exp->gdbarch);
9804 value_from_longest (type,
9805 (value_less (arg1, arg3)
9806 || value_equal (arg1, arg3))
9807 && (value_less (arg2, arg1)
9808 || value_equal (arg2, arg1)));
9814 struct type *type_arg;
9816 if (exp->elts[*pos].opcode == OP_TYPE)
9818 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9820 type_arg = check_typedef (exp->elts[pc + 2].type);
9824 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9828 if (exp->elts[*pos].opcode != OP_LONG)
9829 error (_("Invalid operand to '%s"), ada_attribute_name (op));
9830 tem = longest_to_int (exp->elts[*pos + 2].longconst);
9833 if (noside == EVAL_SKIP)
9836 if (type_arg == NULL)
9838 arg1 = ada_coerce_ref (arg1);
9840 if (ada_is_constrained_packed_array_type (value_type (arg1)))
9841 arg1 = ada_coerce_to_simple_array (arg1);
9843 type = ada_index_type (value_type (arg1), tem,
9844 ada_attribute_name (op));
9846 type = builtin_type (exp->gdbarch)->builtin_int;
9848 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9849 return allocate_value (type);
9853 default: /* Should never happen. */
9854 error (_("unexpected attribute encountered"));
9856 return value_from_longest
9857 (type, ada_array_bound (arg1, tem, 0));
9859 return value_from_longest
9860 (type, ada_array_bound (arg1, tem, 1));
9862 return value_from_longest
9863 (type, ada_array_length (arg1, tem));
9866 else if (discrete_type_p (type_arg))
9868 struct type *range_type;
9869 char *name = ada_type_name (type_arg);
9872 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
9873 range_type = to_fixed_range_type (type_arg, NULL);
9874 if (range_type == NULL)
9875 range_type = type_arg;
9879 error (_("unexpected attribute encountered"));
9881 return value_from_longest
9882 (range_type, ada_discrete_type_low_bound (range_type));
9884 return value_from_longest
9885 (range_type, ada_discrete_type_high_bound (range_type));
9887 error (_("the 'length attribute applies only to array types"));
9890 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
9891 error (_("unimplemented type attribute"));
9896 if (ada_is_constrained_packed_array_type (type_arg))
9897 type_arg = decode_constrained_packed_array_type (type_arg);
9899 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
9901 type = builtin_type (exp->gdbarch)->builtin_int;
9903 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9904 return allocate_value (type);
9909 error (_("unexpected attribute encountered"));
9911 low = ada_array_bound_from_type (type_arg, tem, 0);
9912 return value_from_longest (type, low);
9914 high = ada_array_bound_from_type (type_arg, tem, 1);
9915 return value_from_longest (type, high);
9917 low = ada_array_bound_from_type (type_arg, tem, 0);
9918 high = ada_array_bound_from_type (type_arg, tem, 1);
9919 return value_from_longest (type, high - low + 1);
9925 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9926 if (noside == EVAL_SKIP)
9929 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9930 return value_zero (ada_tag_type (arg1), not_lval);
9932 return ada_value_tag (arg1);
9936 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9937 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9938 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9939 if (noside == EVAL_SKIP)
9941 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9942 return value_zero (value_type (arg1), not_lval);
9945 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9946 return value_binop (arg1, arg2,
9947 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
9950 case OP_ATR_MODULUS:
9952 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
9954 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9955 if (noside == EVAL_SKIP)
9958 if (!ada_is_modular_type (type_arg))
9959 error (_("'modulus must be applied to modular type"));
9961 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
9962 ada_modulus (type_arg));
9967 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9968 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9969 if (noside == EVAL_SKIP)
9971 type = builtin_type (exp->gdbarch)->builtin_int;
9972 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9973 return value_zero (type, not_lval);
9975 return value_pos_atr (type, arg1);
9978 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9979 type = value_type (arg1);
9981 /* If the argument is a reference, then dereference its type, since
9982 the user is really asking for the size of the actual object,
9983 not the size of the pointer. */
9984 if (TYPE_CODE (type) == TYPE_CODE_REF)
9985 type = TYPE_TARGET_TYPE (type);
9987 if (noside == EVAL_SKIP)
9989 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9990 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
9992 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
9993 TARGET_CHAR_BIT * TYPE_LENGTH (type));
9996 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9997 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9998 type = exp->elts[pc + 2].type;
9999 if (noside == EVAL_SKIP)
10001 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10002 return value_zero (type, not_lval);
10004 return value_val_atr (type, arg1);
10007 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10008 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10009 if (noside == EVAL_SKIP)
10011 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10012 return value_zero (value_type (arg1), not_lval);
10015 /* For integer exponentiation operations,
10016 only promote the first argument. */
10017 if (is_integral_type (value_type (arg2)))
10018 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10020 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10022 return value_binop (arg1, arg2, op);
10026 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10027 if (noside == EVAL_SKIP)
10033 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10034 if (noside == EVAL_SKIP)
10036 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10037 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
10038 return value_neg (arg1);
10043 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10044 if (noside == EVAL_SKIP)
10046 type = ada_check_typedef (value_type (arg1));
10047 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10049 if (ada_is_array_descriptor_type (type))
10050 /* GDB allows dereferencing GNAT array descriptors. */
10052 struct type *arrType = ada_type_of_array (arg1, 0);
10054 if (arrType == NULL)
10055 error (_("Attempt to dereference null array pointer."));
10056 return value_at_lazy (arrType, 0);
10058 else if (TYPE_CODE (type) == TYPE_CODE_PTR
10059 || TYPE_CODE (type) == TYPE_CODE_REF
10060 /* In C you can dereference an array to get the 1st elt. */
10061 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
10063 type = to_static_fixed_type
10065 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
10067 return value_zero (type, lval_memory);
10069 else if (TYPE_CODE (type) == TYPE_CODE_INT)
10071 /* GDB allows dereferencing an int. */
10072 if (expect_type == NULL)
10073 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10078 to_static_fixed_type (ada_aligned_type (expect_type));
10079 return value_zero (expect_type, lval_memory);
10083 error (_("Attempt to take contents of a non-pointer value."));
10085 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
10086 type = ada_check_typedef (value_type (arg1));
10088 if (TYPE_CODE (type) == TYPE_CODE_INT)
10089 /* GDB allows dereferencing an int. If we were given
10090 the expect_type, then use that as the target type.
10091 Otherwise, assume that the target type is an int. */
10093 if (expect_type != NULL)
10094 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
10097 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
10098 (CORE_ADDR) value_as_address (arg1));
10101 if (ada_is_array_descriptor_type (type))
10102 /* GDB allows dereferencing GNAT array descriptors. */
10103 return ada_coerce_to_simple_array (arg1);
10105 return ada_value_ind (arg1);
10107 case STRUCTOP_STRUCT:
10108 tem = longest_to_int (exp->elts[pc + 1].longconst);
10109 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
10110 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10111 if (noside == EVAL_SKIP)
10113 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10115 struct type *type1 = value_type (arg1);
10117 if (ada_is_tagged_type (type1, 1))
10119 type = ada_lookup_struct_elt_type (type1,
10120 &exp->elts[pc + 2].string,
10123 /* In this case, we assume that the field COULD exist
10124 in some extension of the type. Return an object of
10125 "type" void, which will match any formal
10126 (see ada_type_match). */
10127 return value_zero (builtin_type (exp->gdbarch)->builtin_void,
10132 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
10135 return value_zero (ada_aligned_type (type), lval_memory);
10138 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
10139 arg1 = unwrap_value (arg1);
10140 return ada_to_fixed_value (arg1);
10143 /* The value is not supposed to be used. This is here to make it
10144 easier to accommodate expressions that contain types. */
10146 if (noside == EVAL_SKIP)
10148 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10149 return allocate_value (exp->elts[pc + 1].type);
10151 error (_("Attempt to use a type name as an expression"));
10156 case OP_DISCRETE_RANGE:
10157 case OP_POSITIONAL:
10159 if (noside == EVAL_NORMAL)
10163 error (_("Undefined name, ambiguous name, or renaming used in "
10164 "component association: %s."), &exp->elts[pc+2].string);
10166 error (_("Aggregates only allowed on the right of an assignment"));
10168 internal_error (__FILE__, __LINE__,
10169 _("aggregate apparently mangled"));
10172 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10174 for (tem = 0; tem < nargs; tem += 1)
10175 ada_evaluate_subexp (NULL, exp, pos, noside);
10180 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
10186 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10187 type name that encodes the 'small and 'delta information.
10188 Otherwise, return NULL. */
10190 static const char *
10191 fixed_type_info (struct type *type)
10193 const char *name = ada_type_name (type);
10194 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
10196 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
10198 const char *tail = strstr (name, "___XF_");
10205 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
10206 return fixed_type_info (TYPE_TARGET_TYPE (type));
10211 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10214 ada_is_fixed_point_type (struct type *type)
10216 return fixed_type_info (type) != NULL;
10219 /* Return non-zero iff TYPE represents a System.Address type. */
10222 ada_is_system_address_type (struct type *type)
10224 return (TYPE_NAME (type)
10225 && strcmp (TYPE_NAME (type), "system__address") == 0);
10228 /* Assuming that TYPE is the representation of an Ada fixed-point
10229 type, return its delta, or -1 if the type is malformed and the
10230 delta cannot be determined. */
10233 ada_delta (struct type *type)
10235 const char *encoding = fixed_type_info (type);
10238 /* Strictly speaking, num and den are encoded as integer. However,
10239 they may not fit into a long, and they will have to be converted
10240 to DOUBLEST anyway. So scan them as DOUBLEST. */
10241 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10248 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10249 factor ('SMALL value) associated with the type. */
10252 scaling_factor (struct type *type)
10254 const char *encoding = fixed_type_info (type);
10255 DOUBLEST num0, den0, num1, den1;
10258 /* Strictly speaking, num's and den's are encoded as integer. However,
10259 they may not fit into a long, and they will have to be converted
10260 to DOUBLEST anyway. So scan them as DOUBLEST. */
10261 n = sscanf (encoding,
10262 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
10263 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10264 &num0, &den0, &num1, &den1);
10269 return num1 / den1;
10271 return num0 / den0;
10275 /* Assuming that X is the representation of a value of fixed-point
10276 type TYPE, return its floating-point equivalent. */
10279 ada_fixed_to_float (struct type *type, LONGEST x)
10281 return (DOUBLEST) x *scaling_factor (type);
10284 /* The representation of a fixed-point value of type TYPE
10285 corresponding to the value X. */
10288 ada_float_to_fixed (struct type *type, DOUBLEST x)
10290 return (LONGEST) (x / scaling_factor (type) + 0.5);
10297 /* Scan STR beginning at position K for a discriminant name, and
10298 return the value of that discriminant field of DVAL in *PX. If
10299 PNEW_K is not null, put the position of the character beyond the
10300 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10301 not alter *PX and *PNEW_K if unsuccessful. */
10304 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
10307 static char *bound_buffer = NULL;
10308 static size_t bound_buffer_len = 0;
10311 struct value *bound_val;
10313 if (dval == NULL || str == NULL || str[k] == '\0')
10316 pend = strstr (str + k, "__");
10320 k += strlen (bound);
10324 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
10325 bound = bound_buffer;
10326 strncpy (bound_buffer, str + k, pend - (str + k));
10327 bound[pend - (str + k)] = '\0';
10331 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
10332 if (bound_val == NULL)
10335 *px = value_as_long (bound_val);
10336 if (pnew_k != NULL)
10341 /* Value of variable named NAME in the current environment. If
10342 no such variable found, then if ERR_MSG is null, returns 0, and
10343 otherwise causes an error with message ERR_MSG. */
10345 static struct value *
10346 get_var_value (char *name, char *err_msg)
10348 struct ada_symbol_info *syms;
10351 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
10356 if (err_msg == NULL)
10359 error (("%s"), err_msg);
10362 return value_of_variable (syms[0].sym, syms[0].block);
10365 /* Value of integer variable named NAME in the current environment. If
10366 no such variable found, returns 0, and sets *FLAG to 0. If
10367 successful, sets *FLAG to 1. */
10370 get_int_var_value (char *name, int *flag)
10372 struct value *var_val = get_var_value (name, 0);
10384 return value_as_long (var_val);
10389 /* Return a range type whose base type is that of the range type named
10390 NAME in the current environment, and whose bounds are calculated
10391 from NAME according to the GNAT range encoding conventions.
10392 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10393 corresponding range type from debug information; fall back to using it
10394 if symbol lookup fails. If a new type must be created, allocate it
10395 like ORIG_TYPE was. The bounds information, in general, is encoded
10396 in NAME, the base type given in the named range type. */
10398 static struct type *
10399 to_fixed_range_type (struct type *raw_type, struct value *dval)
10402 struct type *base_type;
10403 char *subtype_info;
10405 gdb_assert (raw_type != NULL);
10406 gdb_assert (TYPE_NAME (raw_type) != NULL);
10408 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
10409 base_type = TYPE_TARGET_TYPE (raw_type);
10411 base_type = raw_type;
10413 name = TYPE_NAME (raw_type);
10414 subtype_info = strstr (name, "___XD");
10415 if (subtype_info == NULL)
10417 LONGEST L = ada_discrete_type_low_bound (raw_type);
10418 LONGEST U = ada_discrete_type_high_bound (raw_type);
10420 if (L < INT_MIN || U > INT_MAX)
10423 return create_range_type (alloc_type_copy (raw_type), raw_type,
10424 ada_discrete_type_low_bound (raw_type),
10425 ada_discrete_type_high_bound (raw_type));
10429 static char *name_buf = NULL;
10430 static size_t name_len = 0;
10431 int prefix_len = subtype_info - name;
10437 GROW_VECT (name_buf, name_len, prefix_len + 5);
10438 strncpy (name_buf, name, prefix_len);
10439 name_buf[prefix_len] = '\0';
10442 bounds_str = strchr (subtype_info, '_');
10445 if (*subtype_info == 'L')
10447 if (!ada_scan_number (bounds_str, n, &L, &n)
10448 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
10450 if (bounds_str[n] == '_')
10452 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
10460 strcpy (name_buf + prefix_len, "___L");
10461 L = get_int_var_value (name_buf, &ok);
10464 lim_warning (_("Unknown lower bound, using 1."));
10469 if (*subtype_info == 'U')
10471 if (!ada_scan_number (bounds_str, n, &U, &n)
10472 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
10479 strcpy (name_buf + prefix_len, "___U");
10480 U = get_int_var_value (name_buf, &ok);
10483 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
10488 type = create_range_type (alloc_type_copy (raw_type), base_type, L, U);
10489 TYPE_NAME (type) = name;
10494 /* True iff NAME is the name of a range type. */
10497 ada_is_range_type_name (const char *name)
10499 return (name != NULL && strstr (name, "___XD"));
10503 /* Modular types */
10505 /* True iff TYPE is an Ada modular type. */
10508 ada_is_modular_type (struct type *type)
10510 struct type *subranged_type = get_base_type (type);
10512 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
10513 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
10514 && TYPE_UNSIGNED (subranged_type));
10517 /* Try to determine the lower and upper bounds of the given modular type
10518 using the type name only. Return non-zero and set L and U as the lower
10519 and upper bounds (respectively) if successful. */
10522 ada_modulus_from_name (struct type *type, ULONGEST *modulus)
10524 char *name = ada_type_name (type);
10532 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10533 we are looking for static bounds, which means an __XDLU suffix.
10534 Moreover, we know that the lower bound of modular types is always
10535 zero, so the actual suffix should start with "__XDLU_0__", and
10536 then be followed by the upper bound value. */
10537 suffix = strstr (name, "__XDLU_0__");
10538 if (suffix == NULL)
10541 if (!ada_scan_number (suffix, k, &U, NULL))
10544 *modulus = (ULONGEST) U + 1;
10548 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10551 ada_modulus (struct type *type)
10553 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
10557 /* Ada exception catchpoint support:
10558 ---------------------------------
10560 We support 3 kinds of exception catchpoints:
10561 . catchpoints on Ada exceptions
10562 . catchpoints on unhandled Ada exceptions
10563 . catchpoints on failed assertions
10565 Exceptions raised during failed assertions, or unhandled exceptions
10566 could perfectly be caught with the general catchpoint on Ada exceptions.
10567 However, we can easily differentiate these two special cases, and having
10568 the option to distinguish these two cases from the rest can be useful
10569 to zero-in on certain situations.
10571 Exception catchpoints are a specialized form of breakpoint,
10572 since they rely on inserting breakpoints inside known routines
10573 of the GNAT runtime. The implementation therefore uses a standard
10574 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10577 Support in the runtime for exception catchpoints have been changed
10578 a few times already, and these changes affect the implementation
10579 of these catchpoints. In order to be able to support several
10580 variants of the runtime, we use a sniffer that will determine
10581 the runtime variant used by the program being debugged. */
10583 /* The different types of catchpoints that we introduced for catching
10586 enum exception_catchpoint_kind
10588 ex_catch_exception,
10589 ex_catch_exception_unhandled,
10593 /* Ada's standard exceptions. */
10595 static char *standard_exc[] = {
10596 "constraint_error",
10602 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
10604 /* A structure that describes how to support exception catchpoints
10605 for a given executable. */
10607 struct exception_support_info
10609 /* The name of the symbol to break on in order to insert
10610 a catchpoint on exceptions. */
10611 const char *catch_exception_sym;
10613 /* The name of the symbol to break on in order to insert
10614 a catchpoint on unhandled exceptions. */
10615 const char *catch_exception_unhandled_sym;
10617 /* The name of the symbol to break on in order to insert
10618 a catchpoint on failed assertions. */
10619 const char *catch_assert_sym;
10621 /* Assuming that the inferior just triggered an unhandled exception
10622 catchpoint, this function is responsible for returning the address
10623 in inferior memory where the name of that exception is stored.
10624 Return zero if the address could not be computed. */
10625 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
10628 static CORE_ADDR ada_unhandled_exception_name_addr (void);
10629 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
10631 /* The following exception support info structure describes how to
10632 implement exception catchpoints with the latest version of the
10633 Ada runtime (as of 2007-03-06). */
10635 static const struct exception_support_info default_exception_support_info =
10637 "__gnat_debug_raise_exception", /* catch_exception_sym */
10638 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10639 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10640 ada_unhandled_exception_name_addr
10643 /* The following exception support info structure describes how to
10644 implement exception catchpoints with a slightly older version
10645 of the Ada runtime. */
10647 static const struct exception_support_info exception_support_info_fallback =
10649 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10650 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10651 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10652 ada_unhandled_exception_name_addr_from_raise
10655 /* Return nonzero if we can detect the exception support routines
10656 described in EINFO.
10658 This function errors out if an abnormal situation is detected
10659 (for instance, if we find the exception support routines, but
10660 that support is found to be incomplete). */
10663 ada_has_this_exception_support (const struct exception_support_info *einfo)
10665 struct symbol *sym;
10667 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10668 that should be compiled with debugging information. As a result, we
10669 expect to find that symbol in the symtabs. */
10671 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
10674 /* Perhaps we did not find our symbol because the Ada runtime was
10675 compiled without debugging info, or simply stripped of it.
10676 It happens on some GNU/Linux distributions for instance, where
10677 users have to install a separate debug package in order to get
10678 the runtime's debugging info. In that situation, let the user
10679 know why we cannot insert an Ada exception catchpoint.
10681 Note: Just for the purpose of inserting our Ada exception
10682 catchpoint, we could rely purely on the associated minimal symbol.
10683 But we would be operating in degraded mode anyway, since we are
10684 still lacking the debugging info needed later on to extract
10685 the name of the exception being raised (this name is printed in
10686 the catchpoint message, and is also used when trying to catch
10687 a specific exception). We do not handle this case for now. */
10688 if (lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL))
10689 error (_("Your Ada runtime appears to be missing some debugging "
10690 "information.\nCannot insert Ada exception catchpoint "
10691 "in this configuration."));
10696 /* Make sure that the symbol we found corresponds to a function. */
10698 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
10699 error (_("Symbol \"%s\" is not a function (class = %d)"),
10700 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
10705 /* Inspect the Ada runtime and determine which exception info structure
10706 should be used to provide support for exception catchpoints.
10708 This function will always set the per-inferior exception_info,
10709 or raise an error. */
10712 ada_exception_support_info_sniffer (void)
10714 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
10715 struct symbol *sym;
10717 /* If the exception info is already known, then no need to recompute it. */
10718 if (data->exception_info != NULL)
10721 /* Check the latest (default) exception support info. */
10722 if (ada_has_this_exception_support (&default_exception_support_info))
10724 data->exception_info = &default_exception_support_info;
10728 /* Try our fallback exception suport info. */
10729 if (ada_has_this_exception_support (&exception_support_info_fallback))
10731 data->exception_info = &exception_support_info_fallback;
10735 /* Sometimes, it is normal for us to not be able to find the routine
10736 we are looking for. This happens when the program is linked with
10737 the shared version of the GNAT runtime, and the program has not been
10738 started yet. Inform the user of these two possible causes if
10741 if (ada_update_initial_language (language_unknown) != language_ada)
10742 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10744 /* If the symbol does not exist, then check that the program is
10745 already started, to make sure that shared libraries have been
10746 loaded. If it is not started, this may mean that the symbol is
10747 in a shared library. */
10749 if (ptid_get_pid (inferior_ptid) == 0)
10750 error (_("Unable to insert catchpoint. Try to start the program first."));
10752 /* At this point, we know that we are debugging an Ada program and
10753 that the inferior has been started, but we still are not able to
10754 find the run-time symbols. That can mean that we are in
10755 configurable run time mode, or that a-except as been optimized
10756 out by the linker... In any case, at this point it is not worth
10757 supporting this feature. */
10759 error (_("Cannot insert Ada exception catchpoints in this configuration."));
10762 /* True iff FRAME is very likely to be that of a function that is
10763 part of the runtime system. This is all very heuristic, but is
10764 intended to be used as advice as to what frames are uninteresting
10768 is_known_support_routine (struct frame_info *frame)
10770 struct symtab_and_line sal;
10772 enum language func_lang;
10775 /* If this code does not have any debugging information (no symtab),
10776 This cannot be any user code. */
10778 find_frame_sal (frame, &sal);
10779 if (sal.symtab == NULL)
10782 /* If there is a symtab, but the associated source file cannot be
10783 located, then assume this is not user code: Selecting a frame
10784 for which we cannot display the code would not be very helpful
10785 for the user. This should also take care of case such as VxWorks
10786 where the kernel has some debugging info provided for a few units. */
10788 if (symtab_to_fullname (sal.symtab) == NULL)
10791 /* Check the unit filename againt the Ada runtime file naming.
10792 We also check the name of the objfile against the name of some
10793 known system libraries that sometimes come with debugging info
10796 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
10798 re_comp (known_runtime_file_name_patterns[i]);
10799 if (re_exec (sal.symtab->filename))
10801 if (sal.symtab->objfile != NULL
10802 && re_exec (sal.symtab->objfile->name))
10806 /* Check whether the function is a GNAT-generated entity. */
10808 find_frame_funname (frame, &func_name, &func_lang, NULL);
10809 if (func_name == NULL)
10812 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
10814 re_comp (known_auxiliary_function_name_patterns[i]);
10815 if (re_exec (func_name))
10822 /* Find the first frame that contains debugging information and that is not
10823 part of the Ada run-time, starting from FI and moving upward. */
10826 ada_find_printable_frame (struct frame_info *fi)
10828 for (; fi != NULL; fi = get_prev_frame (fi))
10830 if (!is_known_support_routine (fi))
10839 /* Assuming that the inferior just triggered an unhandled exception
10840 catchpoint, return the address in inferior memory where the name
10841 of the exception is stored.
10843 Return zero if the address could not be computed. */
10846 ada_unhandled_exception_name_addr (void)
10848 return parse_and_eval_address ("e.full_name");
10851 /* Same as ada_unhandled_exception_name_addr, except that this function
10852 should be used when the inferior uses an older version of the runtime,
10853 where the exception name needs to be extracted from a specific frame
10854 several frames up in the callstack. */
10857 ada_unhandled_exception_name_addr_from_raise (void)
10860 struct frame_info *fi;
10861 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
10863 /* To determine the name of this exception, we need to select
10864 the frame corresponding to RAISE_SYM_NAME. This frame is
10865 at least 3 levels up, so we simply skip the first 3 frames
10866 without checking the name of their associated function. */
10867 fi = get_current_frame ();
10868 for (frame_level = 0; frame_level < 3; frame_level += 1)
10870 fi = get_prev_frame (fi);
10875 enum language func_lang;
10877 find_frame_funname (fi, &func_name, &func_lang, NULL);
10878 if (func_name != NULL
10879 && strcmp (func_name, data->exception_info->catch_exception_sym) == 0)
10880 break; /* We found the frame we were looking for... */
10881 fi = get_prev_frame (fi);
10888 return parse_and_eval_address ("id.full_name");
10891 /* Assuming the inferior just triggered an Ada exception catchpoint
10892 (of any type), return the address in inferior memory where the name
10893 of the exception is stored, if applicable.
10895 Return zero if the address could not be computed, or if not relevant. */
10898 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
10899 struct breakpoint *b)
10901 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
10905 case ex_catch_exception:
10906 return (parse_and_eval_address ("e.full_name"));
10909 case ex_catch_exception_unhandled:
10910 return data->exception_info->unhandled_exception_name_addr ();
10913 case ex_catch_assert:
10914 return 0; /* Exception name is not relevant in this case. */
10918 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10922 return 0; /* Should never be reached. */
10925 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10926 any error that ada_exception_name_addr_1 might cause to be thrown.
10927 When an error is intercepted, a warning with the error message is printed,
10928 and zero is returned. */
10931 ada_exception_name_addr (enum exception_catchpoint_kind ex,
10932 struct breakpoint *b)
10934 struct gdb_exception e;
10935 CORE_ADDR result = 0;
10937 TRY_CATCH (e, RETURN_MASK_ERROR)
10939 result = ada_exception_name_addr_1 (ex, b);
10944 warning (_("failed to get exception name: %s"), e.message);
10951 static struct symtab_and_line ada_exception_sal (enum exception_catchpoint_kind,
10953 const struct breakpoint_ops **);
10954 static char *ada_exception_catchpoint_cond_string (const char *excep_string);
10956 /* Ada catchpoints.
10958 In the case of catchpoints on Ada exceptions, the catchpoint will
10959 stop the target on every exception the program throws. When a user
10960 specifies the name of a specific exception, we translate this
10961 request into a condition expression (in text form), and then parse
10962 it into an expression stored in each of the catchpoint's locations.
10963 We then use this condition to check whether the exception that was
10964 raised is the one the user is interested in. If not, then the
10965 target is resumed again. We store the name of the requested
10966 exception, in order to be able to re-set the condition expression
10967 when symbols change. */
10969 /* An instance of this type is used to represent an Ada catchpoint
10970 breakpoint location. It includes a "struct bp_location" as a kind
10971 of base class; users downcast to "struct bp_location *" when
10974 struct ada_catchpoint_location
10976 /* The base class. */
10977 struct bp_location base;
10979 /* The condition that checks whether the exception that was raised
10980 is the specific exception the user specified on catchpoint
10982 struct expression *excep_cond_expr;
10985 /* Implement the DTOR method in the bp_location_ops structure for all
10986 Ada exception catchpoint kinds. */
10989 ada_catchpoint_location_dtor (struct bp_location *bl)
10991 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
10993 xfree (al->excep_cond_expr);
10996 /* The vtable to be used in Ada catchpoint locations. */
10998 static const struct bp_location_ops ada_catchpoint_location_ops =
11000 ada_catchpoint_location_dtor
11003 /* An instance of this type is used to represent an Ada catchpoint.
11004 It includes a "struct breakpoint" as a kind of base class; users
11005 downcast to "struct breakpoint *" when needed. */
11007 struct ada_catchpoint
11009 /* The base class. */
11010 struct breakpoint base;
11012 /* The name of the specific exception the user specified. */
11013 char *excep_string;
11016 /* Parse the exception condition string in the context of each of the
11017 catchpoint's locations, and store them for later evaluation. */
11020 create_excep_cond_exprs (struct ada_catchpoint *c)
11022 struct cleanup *old_chain;
11023 struct bp_location *bl;
11026 /* Nothing to do if there's no specific exception to catch. */
11027 if (c->excep_string == NULL)
11030 /* Same if there are no locations... */
11031 if (c->base.loc == NULL)
11034 /* Compute the condition expression in text form, from the specific
11035 expection we want to catch. */
11036 cond_string = ada_exception_catchpoint_cond_string (c->excep_string);
11037 old_chain = make_cleanup (xfree, cond_string);
11039 /* Iterate over all the catchpoint's locations, and parse an
11040 expression for each. */
11041 for (bl = c->base.loc; bl != NULL; bl = bl->next)
11043 struct ada_catchpoint_location *ada_loc
11044 = (struct ada_catchpoint_location *) bl;
11045 struct expression *exp = NULL;
11047 if (!bl->shlib_disabled)
11049 volatile struct gdb_exception e;
11053 TRY_CATCH (e, RETURN_MASK_ERROR)
11055 exp = parse_exp_1 (&s, block_for_pc (bl->address), 0);
11058 warning (_("failed to reevaluate internal exception condition "
11059 "for catchpoint %d: %s"),
11060 c->base.number, e.message);
11063 ada_loc->excep_cond_expr = exp;
11066 do_cleanups (old_chain);
11069 /* Implement the DTOR method in the breakpoint_ops structure for all
11070 exception catchpoint kinds. */
11073 dtor_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
11075 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11077 xfree (c->excep_string);
11079 bkpt_breakpoint_ops.dtor (b);
11082 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11083 structure for all exception catchpoint kinds. */
11085 static struct bp_location *
11086 allocate_location_exception (enum exception_catchpoint_kind ex,
11087 struct breakpoint *self)
11089 struct ada_catchpoint_location *loc;
11091 loc = XNEW (struct ada_catchpoint_location);
11092 init_bp_location (&loc->base, &ada_catchpoint_location_ops, self);
11093 loc->excep_cond_expr = NULL;
11097 /* Implement the RE_SET method in the breakpoint_ops structure for all
11098 exception catchpoint kinds. */
11101 re_set_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
11103 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11105 /* Call the base class's method. This updates the catchpoint's
11107 bkpt_breakpoint_ops.re_set (b);
11109 /* Reparse the exception conditional expressions. One for each
11111 create_excep_cond_exprs (c);
11114 /* Returns true if we should stop for this breakpoint hit. If the
11115 user specified a specific exception, we only want to cause a stop
11116 if the program thrown that exception. */
11119 should_stop_exception (const struct bp_location *bl)
11121 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
11122 const struct ada_catchpoint_location *ada_loc
11123 = (const struct ada_catchpoint_location *) bl;
11124 volatile struct gdb_exception ex;
11127 /* With no specific exception, should always stop. */
11128 if (c->excep_string == NULL)
11131 if (ada_loc->excep_cond_expr == NULL)
11133 /* We will have a NULL expression if back when we were creating
11134 the expressions, this location's had failed to parse. */
11139 TRY_CATCH (ex, RETURN_MASK_ALL)
11141 struct value *mark;
11143 mark = value_mark ();
11144 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr));
11145 value_free_to_mark (mark);
11148 exception_fprintf (gdb_stderr, ex,
11149 _("Error in testing exception condition:\n"));
11153 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11154 for all exception catchpoint kinds. */
11157 check_status_exception (enum exception_catchpoint_kind ex, bpstat bs)
11159 bs->stop = should_stop_exception (bs->bp_location_at);
11162 /* Implement the PRINT_IT method in the breakpoint_ops structure
11163 for all exception catchpoint kinds. */
11165 static enum print_stop_action
11166 print_it_exception (enum exception_catchpoint_kind ex, bpstat bs)
11168 struct ui_out *uiout = current_uiout;
11169 struct breakpoint *b = bs->breakpoint_at;
11171 annotate_catchpoint (b->number);
11173 if (ui_out_is_mi_like_p (uiout))
11175 ui_out_field_string (uiout, "reason",
11176 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
11177 ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition));
11180 ui_out_text (uiout,
11181 b->disposition == disp_del ? "\nTemporary catchpoint "
11182 : "\nCatchpoint ");
11183 ui_out_field_int (uiout, "bkptno", b->number);
11184 ui_out_text (uiout, ", ");
11188 case ex_catch_exception:
11189 case ex_catch_exception_unhandled:
11191 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
11192 char exception_name[256];
11196 read_memory (addr, exception_name, sizeof (exception_name) - 1);
11197 exception_name [sizeof (exception_name) - 1] = '\0';
11201 /* For some reason, we were unable to read the exception
11202 name. This could happen if the Runtime was compiled
11203 without debugging info, for instance. In that case,
11204 just replace the exception name by the generic string
11205 "exception" - it will read as "an exception" in the
11206 notification we are about to print. */
11207 memcpy (exception_name, "exception", sizeof ("exception"));
11209 /* In the case of unhandled exception breakpoints, we print
11210 the exception name as "unhandled EXCEPTION_NAME", to make
11211 it clearer to the user which kind of catchpoint just got
11212 hit. We used ui_out_text to make sure that this extra
11213 info does not pollute the exception name in the MI case. */
11214 if (ex == ex_catch_exception_unhandled)
11215 ui_out_text (uiout, "unhandled ");
11216 ui_out_field_string (uiout, "exception-name", exception_name);
11219 case ex_catch_assert:
11220 /* In this case, the name of the exception is not really
11221 important. Just print "failed assertion" to make it clearer
11222 that his program just hit an assertion-failure catchpoint.
11223 We used ui_out_text because this info does not belong in
11225 ui_out_text (uiout, "failed assertion");
11228 ui_out_text (uiout, " at ");
11229 ada_find_printable_frame (get_current_frame ());
11231 return PRINT_SRC_AND_LOC;
11234 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11235 for all exception catchpoint kinds. */
11238 print_one_exception (enum exception_catchpoint_kind ex,
11239 struct breakpoint *b, struct bp_location **last_loc)
11241 struct ui_out *uiout = current_uiout;
11242 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11243 struct value_print_options opts;
11245 get_user_print_options (&opts);
11246 if (opts.addressprint)
11248 annotate_field (4);
11249 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
11252 annotate_field (5);
11253 *last_loc = b->loc;
11256 case ex_catch_exception:
11257 if (c->excep_string != NULL)
11259 char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11261 ui_out_field_string (uiout, "what", msg);
11265 ui_out_field_string (uiout, "what", "all Ada exceptions");
11269 case ex_catch_exception_unhandled:
11270 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
11273 case ex_catch_assert:
11274 ui_out_field_string (uiout, "what", "failed Ada assertions");
11278 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11283 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11284 for all exception catchpoint kinds. */
11287 print_mention_exception (enum exception_catchpoint_kind ex,
11288 struct breakpoint *b)
11290 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11291 struct ui_out *uiout = current_uiout;
11293 ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ")
11294 : _("Catchpoint "));
11295 ui_out_field_int (uiout, "bkptno", b->number);
11296 ui_out_text (uiout, ": ");
11300 case ex_catch_exception:
11301 if (c->excep_string != NULL)
11303 char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11304 struct cleanup *old_chain = make_cleanup (xfree, info);
11306 ui_out_text (uiout, info);
11307 do_cleanups (old_chain);
11310 ui_out_text (uiout, _("all Ada exceptions"));
11313 case ex_catch_exception_unhandled:
11314 ui_out_text (uiout, _("unhandled Ada exceptions"));
11317 case ex_catch_assert:
11318 ui_out_text (uiout, _("failed Ada assertions"));
11322 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11327 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11328 for all exception catchpoint kinds. */
11331 print_recreate_exception (enum exception_catchpoint_kind ex,
11332 struct breakpoint *b, struct ui_file *fp)
11334 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11338 case ex_catch_exception:
11339 fprintf_filtered (fp, "catch exception");
11340 if (c->excep_string != NULL)
11341 fprintf_filtered (fp, " %s", c->excep_string);
11344 case ex_catch_exception_unhandled:
11345 fprintf_filtered (fp, "catch exception unhandled");
11348 case ex_catch_assert:
11349 fprintf_filtered (fp, "catch assert");
11353 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11355 print_recreate_thread (b, fp);
11358 /* Virtual table for "catch exception" breakpoints. */
11361 dtor_catch_exception (struct breakpoint *b)
11363 dtor_exception (ex_catch_exception, b);
11366 static struct bp_location *
11367 allocate_location_catch_exception (struct breakpoint *self)
11369 return allocate_location_exception (ex_catch_exception, self);
11373 re_set_catch_exception (struct breakpoint *b)
11375 re_set_exception (ex_catch_exception, b);
11379 check_status_catch_exception (bpstat bs)
11381 check_status_exception (ex_catch_exception, bs);
11384 static enum print_stop_action
11385 print_it_catch_exception (bpstat bs)
11387 return print_it_exception (ex_catch_exception, bs);
11391 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
11393 print_one_exception (ex_catch_exception, b, last_loc);
11397 print_mention_catch_exception (struct breakpoint *b)
11399 print_mention_exception (ex_catch_exception, b);
11403 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
11405 print_recreate_exception (ex_catch_exception, b, fp);
11408 static struct breakpoint_ops catch_exception_breakpoint_ops;
11410 /* Virtual table for "catch exception unhandled" breakpoints. */
11413 dtor_catch_exception_unhandled (struct breakpoint *b)
11415 dtor_exception (ex_catch_exception_unhandled, b);
11418 static struct bp_location *
11419 allocate_location_catch_exception_unhandled (struct breakpoint *self)
11421 return allocate_location_exception (ex_catch_exception_unhandled, self);
11425 re_set_catch_exception_unhandled (struct breakpoint *b)
11427 re_set_exception (ex_catch_exception_unhandled, b);
11431 check_status_catch_exception_unhandled (bpstat bs)
11433 check_status_exception (ex_catch_exception_unhandled, bs);
11436 static enum print_stop_action
11437 print_it_catch_exception_unhandled (bpstat bs)
11439 return print_it_exception (ex_catch_exception_unhandled, bs);
11443 print_one_catch_exception_unhandled (struct breakpoint *b,
11444 struct bp_location **last_loc)
11446 print_one_exception (ex_catch_exception_unhandled, b, last_loc);
11450 print_mention_catch_exception_unhandled (struct breakpoint *b)
11452 print_mention_exception (ex_catch_exception_unhandled, b);
11456 print_recreate_catch_exception_unhandled (struct breakpoint *b,
11457 struct ui_file *fp)
11459 print_recreate_exception (ex_catch_exception_unhandled, b, fp);
11462 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
11464 /* Virtual table for "catch assert" breakpoints. */
11467 dtor_catch_assert (struct breakpoint *b)
11469 dtor_exception (ex_catch_assert, b);
11472 static struct bp_location *
11473 allocate_location_catch_assert (struct breakpoint *self)
11475 return allocate_location_exception (ex_catch_assert, self);
11479 re_set_catch_assert (struct breakpoint *b)
11481 return re_set_exception (ex_catch_assert, b);
11485 check_status_catch_assert (bpstat bs)
11487 check_status_exception (ex_catch_assert, bs);
11490 static enum print_stop_action
11491 print_it_catch_assert (bpstat bs)
11493 return print_it_exception (ex_catch_assert, bs);
11497 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
11499 print_one_exception (ex_catch_assert, b, last_loc);
11503 print_mention_catch_assert (struct breakpoint *b)
11505 print_mention_exception (ex_catch_assert, b);
11509 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
11511 print_recreate_exception (ex_catch_assert, b, fp);
11514 static struct breakpoint_ops catch_assert_breakpoint_ops;
11516 /* Return a newly allocated copy of the first space-separated token
11517 in ARGSP, and then adjust ARGSP to point immediately after that
11520 Return NULL if ARGPS does not contain any more tokens. */
11523 ada_get_next_arg (char **argsp)
11525 char *args = *argsp;
11529 /* Skip any leading white space. */
11531 while (isspace (*args))
11534 if (args[0] == '\0')
11535 return NULL; /* No more arguments. */
11537 /* Find the end of the current argument. */
11540 while (*end != '\0' && !isspace (*end))
11543 /* Adjust ARGSP to point to the start of the next argument. */
11547 /* Make a copy of the current argument and return it. */
11549 result = xmalloc (end - args + 1);
11550 strncpy (result, args, end - args);
11551 result[end - args] = '\0';
11556 /* Split the arguments specified in a "catch exception" command.
11557 Set EX to the appropriate catchpoint type.
11558 Set EXCEP_STRING to the name of the specific exception if
11559 specified by the user. */
11562 catch_ada_exception_command_split (char *args,
11563 enum exception_catchpoint_kind *ex,
11564 char **excep_string)
11566 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
11567 char *exception_name;
11569 exception_name = ada_get_next_arg (&args);
11570 make_cleanup (xfree, exception_name);
11572 /* Check that we do not have any more arguments. Anything else
11575 while (isspace (*args))
11578 if (args[0] != '\0')
11579 error (_("Junk at end of expression"));
11581 discard_cleanups (old_chain);
11583 if (exception_name == NULL)
11585 /* Catch all exceptions. */
11586 *ex = ex_catch_exception;
11587 *excep_string = NULL;
11589 else if (strcmp (exception_name, "unhandled") == 0)
11591 /* Catch unhandled exceptions. */
11592 *ex = ex_catch_exception_unhandled;
11593 *excep_string = NULL;
11597 /* Catch a specific exception. */
11598 *ex = ex_catch_exception;
11599 *excep_string = exception_name;
11603 /* Return the name of the symbol on which we should break in order to
11604 implement a catchpoint of the EX kind. */
11606 static const char *
11607 ada_exception_sym_name (enum exception_catchpoint_kind ex)
11609 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11611 gdb_assert (data->exception_info != NULL);
11615 case ex_catch_exception:
11616 return (data->exception_info->catch_exception_sym);
11618 case ex_catch_exception_unhandled:
11619 return (data->exception_info->catch_exception_unhandled_sym);
11621 case ex_catch_assert:
11622 return (data->exception_info->catch_assert_sym);
11625 internal_error (__FILE__, __LINE__,
11626 _("unexpected catchpoint kind (%d)"), ex);
11630 /* Return the breakpoint ops "virtual table" used for catchpoints
11633 static const struct breakpoint_ops *
11634 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
11638 case ex_catch_exception:
11639 return (&catch_exception_breakpoint_ops);
11641 case ex_catch_exception_unhandled:
11642 return (&catch_exception_unhandled_breakpoint_ops);
11644 case ex_catch_assert:
11645 return (&catch_assert_breakpoint_ops);
11648 internal_error (__FILE__, __LINE__,
11649 _("unexpected catchpoint kind (%d)"), ex);
11653 /* Return the condition that will be used to match the current exception
11654 being raised with the exception that the user wants to catch. This
11655 assumes that this condition is used when the inferior just triggered
11656 an exception catchpoint.
11658 The string returned is a newly allocated string that needs to be
11659 deallocated later. */
11662 ada_exception_catchpoint_cond_string (const char *excep_string)
11666 /* The standard exceptions are a special case. They are defined in
11667 runtime units that have been compiled without debugging info; if
11668 EXCEP_STRING is the not-fully-qualified name of a standard
11669 exception (e.g. "constraint_error") then, during the evaluation
11670 of the condition expression, the symbol lookup on this name would
11671 *not* return this standard exception. The catchpoint condition
11672 may then be set only on user-defined exceptions which have the
11673 same not-fully-qualified name (e.g. my_package.constraint_error).
11675 To avoid this unexcepted behavior, these standard exceptions are
11676 systematically prefixed by "standard". This means that "catch
11677 exception constraint_error" is rewritten into "catch exception
11678 standard.constraint_error".
11680 If an exception named contraint_error is defined in another package of
11681 the inferior program, then the only way to specify this exception as a
11682 breakpoint condition is to use its fully-qualified named:
11683 e.g. my_package.constraint_error. */
11685 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
11687 if (strcmp (standard_exc [i], excep_string) == 0)
11689 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11693 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string);
11696 /* Return the symtab_and_line that should be used to insert an exception
11697 catchpoint of the TYPE kind.
11699 EXCEP_STRING should contain the name of a specific exception that
11700 the catchpoint should catch, or NULL otherwise.
11702 ADDR_STRING returns the name of the function where the real
11703 breakpoint that implements the catchpoints is set, depending on the
11704 type of catchpoint we need to create. */
11706 static struct symtab_and_line
11707 ada_exception_sal (enum exception_catchpoint_kind ex, char *excep_string,
11708 char **addr_string, const struct breakpoint_ops **ops)
11710 const char *sym_name;
11711 struct symbol *sym;
11713 /* First, find out which exception support info to use. */
11714 ada_exception_support_info_sniffer ();
11716 /* Then lookup the function on which we will break in order to catch
11717 the Ada exceptions requested by the user. */
11718 sym_name = ada_exception_sym_name (ex);
11719 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
11721 /* We can assume that SYM is not NULL at this stage. If the symbol
11722 did not exist, ada_exception_support_info_sniffer would have
11723 raised an exception.
11725 Also, ada_exception_support_info_sniffer should have already
11726 verified that SYM is a function symbol. */
11727 gdb_assert (sym != NULL);
11728 gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK);
11730 /* Set ADDR_STRING. */
11731 *addr_string = xstrdup (sym_name);
11734 *ops = ada_exception_breakpoint_ops (ex);
11736 return find_function_start_sal (sym, 1);
11739 /* Parse the arguments (ARGS) of the "catch exception" command.
11741 If the user asked the catchpoint to catch only a specific
11742 exception, then save the exception name in ADDR_STRING.
11744 See ada_exception_sal for a description of all the remaining
11745 function arguments of this function. */
11747 static struct symtab_and_line
11748 ada_decode_exception_location (char *args, char **addr_string,
11749 char **excep_string,
11750 const struct breakpoint_ops **ops)
11752 enum exception_catchpoint_kind ex;
11754 catch_ada_exception_command_split (args, &ex, excep_string);
11755 return ada_exception_sal (ex, *excep_string, addr_string, ops);
11758 /* Create an Ada exception catchpoint. */
11761 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
11762 struct symtab_and_line sal,
11764 char *excep_string,
11765 const struct breakpoint_ops *ops,
11769 struct ada_catchpoint *c;
11771 c = XNEW (struct ada_catchpoint);
11772 init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string,
11773 ops, tempflag, from_tty);
11774 c->excep_string = excep_string;
11775 create_excep_cond_exprs (c);
11776 install_breakpoint (0, &c->base, 1);
11779 /* Implement the "catch exception" command. */
11782 catch_ada_exception_command (char *arg, int from_tty,
11783 struct cmd_list_element *command)
11785 struct gdbarch *gdbarch = get_current_arch ();
11787 struct symtab_and_line sal;
11788 char *addr_string = NULL;
11789 char *excep_string = NULL;
11790 const struct breakpoint_ops *ops = NULL;
11792 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
11796 sal = ada_decode_exception_location (arg, &addr_string, &excep_string, &ops);
11797 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
11798 excep_string, ops, tempflag, from_tty);
11801 static struct symtab_and_line
11802 ada_decode_assert_location (char *args, char **addr_string,
11803 const struct breakpoint_ops **ops)
11805 /* Check that no argument where provided at the end of the command. */
11809 while (isspace (*args))
11812 error (_("Junk at end of arguments."));
11815 return ada_exception_sal (ex_catch_assert, NULL, addr_string, ops);
11818 /* Implement the "catch assert" command. */
11821 catch_assert_command (char *arg, int from_tty,
11822 struct cmd_list_element *command)
11824 struct gdbarch *gdbarch = get_current_arch ();
11826 struct symtab_and_line sal;
11827 char *addr_string = NULL;
11828 const struct breakpoint_ops *ops = NULL;
11830 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
11834 sal = ada_decode_assert_location (arg, &addr_string, &ops);
11835 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
11836 NULL, ops, tempflag, from_tty);
11839 /* Information about operators given special treatment in functions
11841 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11843 #define ADA_OPERATORS \
11844 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11845 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11846 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11847 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11848 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11849 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11850 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11851 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11852 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11853 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11854 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11855 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11856 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11857 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11858 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11859 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11860 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11861 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11862 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11865 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
11868 switch (exp->elts[pc - 1].opcode)
11871 operator_length_standard (exp, pc, oplenp, argsp);
11874 #define OP_DEFN(op, len, args, binop) \
11875 case op: *oplenp = len; *argsp = args; break;
11881 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
11886 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
11891 /* Implementation of the exp_descriptor method operator_check. */
11894 ada_operator_check (struct expression *exp, int pos,
11895 int (*objfile_func) (struct objfile *objfile, void *data),
11898 const union exp_element *const elts = exp->elts;
11899 struct type *type = NULL;
11901 switch (elts[pos].opcode)
11903 case UNOP_IN_RANGE:
11905 type = elts[pos + 1].type;
11909 return operator_check_standard (exp, pos, objfile_func, data);
11912 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11914 if (type && TYPE_OBJFILE (type)
11915 && (*objfile_func) (TYPE_OBJFILE (type), data))
11922 ada_op_name (enum exp_opcode opcode)
11927 return op_name_standard (opcode);
11929 #define OP_DEFN(op, len, args, binop) case op: return #op;
11934 return "OP_AGGREGATE";
11936 return "OP_CHOICES";
11942 /* As for operator_length, but assumes PC is pointing at the first
11943 element of the operator, and gives meaningful results only for the
11944 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11947 ada_forward_operator_length (struct expression *exp, int pc,
11948 int *oplenp, int *argsp)
11950 switch (exp->elts[pc].opcode)
11953 *oplenp = *argsp = 0;
11956 #define OP_DEFN(op, len, args, binop) \
11957 case op: *oplenp = len; *argsp = args; break;
11963 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
11968 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
11974 int len = longest_to_int (exp->elts[pc + 1].longconst);
11976 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
11984 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
11986 enum exp_opcode op = exp->elts[elt].opcode;
11991 ada_forward_operator_length (exp, elt, &oplen, &nargs);
11995 /* Ada attributes ('Foo). */
11998 case OP_ATR_LENGTH:
12002 case OP_ATR_MODULUS:
12009 case UNOP_IN_RANGE:
12011 /* XXX: gdb_sprint_host_address, type_sprint */
12012 fprintf_filtered (stream, _("Type @"));
12013 gdb_print_host_address (exp->elts[pc + 1].type, stream);
12014 fprintf_filtered (stream, " (");
12015 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
12016 fprintf_filtered (stream, ")");
12018 case BINOP_IN_BOUNDS:
12019 fprintf_filtered (stream, " (%d)",
12020 longest_to_int (exp->elts[pc + 2].longconst));
12022 case TERNOP_IN_RANGE:
12027 case OP_DISCRETE_RANGE:
12028 case OP_POSITIONAL:
12035 char *name = &exp->elts[elt + 2].string;
12036 int len = longest_to_int (exp->elts[elt + 1].longconst);
12038 fprintf_filtered (stream, "Text: `%.*s'", len, name);
12043 return dump_subexp_body_standard (exp, stream, elt);
12047 for (i = 0; i < nargs; i += 1)
12048 elt = dump_subexp (exp, stream, elt);
12053 /* The Ada extension of print_subexp (q.v.). */
12056 ada_print_subexp (struct expression *exp, int *pos,
12057 struct ui_file *stream, enum precedence prec)
12059 int oplen, nargs, i;
12061 enum exp_opcode op = exp->elts[pc].opcode;
12063 ada_forward_operator_length (exp, pc, &oplen, &nargs);
12070 print_subexp_standard (exp, pos, stream, prec);
12074 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
12077 case BINOP_IN_BOUNDS:
12078 /* XXX: sprint_subexp */
12079 print_subexp (exp, pos, stream, PREC_SUFFIX);
12080 fputs_filtered (" in ", stream);
12081 print_subexp (exp, pos, stream, PREC_SUFFIX);
12082 fputs_filtered ("'range", stream);
12083 if (exp->elts[pc + 1].longconst > 1)
12084 fprintf_filtered (stream, "(%ld)",
12085 (long) exp->elts[pc + 1].longconst);
12088 case TERNOP_IN_RANGE:
12089 if (prec >= PREC_EQUAL)
12090 fputs_filtered ("(", stream);
12091 /* XXX: sprint_subexp */
12092 print_subexp (exp, pos, stream, PREC_SUFFIX);
12093 fputs_filtered (" in ", stream);
12094 print_subexp (exp, pos, stream, PREC_EQUAL);
12095 fputs_filtered (" .. ", stream);
12096 print_subexp (exp, pos, stream, PREC_EQUAL);
12097 if (prec >= PREC_EQUAL)
12098 fputs_filtered (")", stream);
12103 case OP_ATR_LENGTH:
12107 case OP_ATR_MODULUS:
12112 if (exp->elts[*pos].opcode == OP_TYPE)
12114 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
12115 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
12119 print_subexp (exp, pos, stream, PREC_SUFFIX);
12120 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
12125 for (tem = 1; tem < nargs; tem += 1)
12127 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
12128 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
12130 fputs_filtered (")", stream);
12135 type_print (exp->elts[pc + 1].type, "", stream, 0);
12136 fputs_filtered ("'(", stream);
12137 print_subexp (exp, pos, stream, PREC_PREFIX);
12138 fputs_filtered (")", stream);
12141 case UNOP_IN_RANGE:
12142 /* XXX: sprint_subexp */
12143 print_subexp (exp, pos, stream, PREC_SUFFIX);
12144 fputs_filtered (" in ", stream);
12145 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
12148 case OP_DISCRETE_RANGE:
12149 print_subexp (exp, pos, stream, PREC_SUFFIX);
12150 fputs_filtered ("..", stream);
12151 print_subexp (exp, pos, stream, PREC_SUFFIX);
12155 fputs_filtered ("others => ", stream);
12156 print_subexp (exp, pos, stream, PREC_SUFFIX);
12160 for (i = 0; i < nargs-1; i += 1)
12163 fputs_filtered ("|", stream);
12164 print_subexp (exp, pos, stream, PREC_SUFFIX);
12166 fputs_filtered (" => ", stream);
12167 print_subexp (exp, pos, stream, PREC_SUFFIX);
12170 case OP_POSITIONAL:
12171 print_subexp (exp, pos, stream, PREC_SUFFIX);
12175 fputs_filtered ("(", stream);
12176 for (i = 0; i < nargs; i += 1)
12179 fputs_filtered (", ", stream);
12180 print_subexp (exp, pos, stream, PREC_SUFFIX);
12182 fputs_filtered (")", stream);
12187 /* Table mapping opcodes into strings for printing operators
12188 and precedences of the operators. */
12190 static const struct op_print ada_op_print_tab[] = {
12191 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
12192 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
12193 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
12194 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
12195 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
12196 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
12197 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
12198 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
12199 {"<=", BINOP_LEQ, PREC_ORDER, 0},
12200 {">=", BINOP_GEQ, PREC_ORDER, 0},
12201 {">", BINOP_GTR, PREC_ORDER, 0},
12202 {"<", BINOP_LESS, PREC_ORDER, 0},
12203 {">>", BINOP_RSH, PREC_SHIFT, 0},
12204 {"<<", BINOP_LSH, PREC_SHIFT, 0},
12205 {"+", BINOP_ADD, PREC_ADD, 0},
12206 {"-", BINOP_SUB, PREC_ADD, 0},
12207 {"&", BINOP_CONCAT, PREC_ADD, 0},
12208 {"*", BINOP_MUL, PREC_MUL, 0},
12209 {"/", BINOP_DIV, PREC_MUL, 0},
12210 {"rem", BINOP_REM, PREC_MUL, 0},
12211 {"mod", BINOP_MOD, PREC_MUL, 0},
12212 {"**", BINOP_EXP, PREC_REPEAT, 0},
12213 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
12214 {"-", UNOP_NEG, PREC_PREFIX, 0},
12215 {"+", UNOP_PLUS, PREC_PREFIX, 0},
12216 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
12217 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
12218 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
12219 {".all", UNOP_IND, PREC_SUFFIX, 1},
12220 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
12221 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
12225 enum ada_primitive_types {
12226 ada_primitive_type_int,
12227 ada_primitive_type_long,
12228 ada_primitive_type_short,
12229 ada_primitive_type_char,
12230 ada_primitive_type_float,
12231 ada_primitive_type_double,
12232 ada_primitive_type_void,
12233 ada_primitive_type_long_long,
12234 ada_primitive_type_long_double,
12235 ada_primitive_type_natural,
12236 ada_primitive_type_positive,
12237 ada_primitive_type_system_address,
12238 nr_ada_primitive_types
12242 ada_language_arch_info (struct gdbarch *gdbarch,
12243 struct language_arch_info *lai)
12245 const struct builtin_type *builtin = builtin_type (gdbarch);
12247 lai->primitive_type_vector
12248 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
12251 lai->primitive_type_vector [ada_primitive_type_int]
12252 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12254 lai->primitive_type_vector [ada_primitive_type_long]
12255 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
12256 0, "long_integer");
12257 lai->primitive_type_vector [ada_primitive_type_short]
12258 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
12259 0, "short_integer");
12260 lai->string_char_type
12261 = lai->primitive_type_vector [ada_primitive_type_char]
12262 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
12263 lai->primitive_type_vector [ada_primitive_type_float]
12264 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
12266 lai->primitive_type_vector [ada_primitive_type_double]
12267 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12268 "long_float", NULL);
12269 lai->primitive_type_vector [ada_primitive_type_long_long]
12270 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
12271 0, "long_long_integer");
12272 lai->primitive_type_vector [ada_primitive_type_long_double]
12273 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12274 "long_long_float", NULL);
12275 lai->primitive_type_vector [ada_primitive_type_natural]
12276 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12278 lai->primitive_type_vector [ada_primitive_type_positive]
12279 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12281 lai->primitive_type_vector [ada_primitive_type_void]
12282 = builtin->builtin_void;
12284 lai->primitive_type_vector [ada_primitive_type_system_address]
12285 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
12286 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
12287 = "system__address";
12289 lai->bool_type_symbol = NULL;
12290 lai->bool_type_default = builtin->builtin_bool;
12293 /* Language vector */
12295 /* Not really used, but needed in the ada_language_defn. */
12298 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
12300 ada_emit_char (c, type, stream, quoter, 1);
12306 warnings_issued = 0;
12307 return ada_parse ();
12310 static const struct exp_descriptor ada_exp_descriptor = {
12312 ada_operator_length,
12313 ada_operator_check,
12315 ada_dump_subexp_body,
12316 ada_evaluate_subexp
12319 const struct language_defn ada_language_defn = {
12320 "ada", /* Language name */
12324 case_sensitive_on, /* Yes, Ada is case-insensitive, but
12325 that's not quite what this means. */
12327 macro_expansion_no,
12328 &ada_exp_descriptor,
12332 ada_printchar, /* Print a character constant */
12333 ada_printstr, /* Function to print string constant */
12334 emit_char, /* Function to print single char (not used) */
12335 ada_print_type, /* Print a type using appropriate syntax */
12336 ada_print_typedef, /* Print a typedef using appropriate syntax */
12337 ada_val_print, /* Print a value using appropriate syntax */
12338 ada_value_print, /* Print a top-level value */
12339 NULL, /* Language specific skip_trampoline */
12340 NULL, /* name_of_this */
12341 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
12342 basic_lookup_transparent_type, /* lookup_transparent_type */
12343 ada_la_decode, /* Language specific symbol demangler */
12344 NULL, /* Language specific
12345 class_name_from_physname */
12346 ada_op_print_tab, /* expression operators for printing */
12347 0, /* c-style arrays */
12348 1, /* String lower bound */
12349 ada_get_gdb_completer_word_break_characters,
12350 ada_make_symbol_completion_list,
12351 ada_language_arch_info,
12352 ada_print_array_index,
12353 default_pass_by_reference,
12356 ada_iterate_over_symbols,
12360 /* Provide a prototype to silence -Wmissing-prototypes. */
12361 extern initialize_file_ftype _initialize_ada_language;
12363 /* Command-list for the "set/show ada" prefix command. */
12364 static struct cmd_list_element *set_ada_list;
12365 static struct cmd_list_element *show_ada_list;
12367 /* Implement the "set ada" prefix command. */
12370 set_ada_command (char *arg, int from_tty)
12372 printf_unfiltered (_(\
12373 "\"set ada\" must be followed by the name of a setting.\n"));
12374 help_list (set_ada_list, "set ada ", -1, gdb_stdout);
12377 /* Implement the "show ada" prefix command. */
12380 show_ada_command (char *args, int from_tty)
12382 cmd_show_list (show_ada_list, from_tty, "");
12386 initialize_ada_catchpoint_ops (void)
12388 struct breakpoint_ops *ops;
12390 initialize_breakpoint_ops ();
12392 ops = &catch_exception_breakpoint_ops;
12393 *ops = bkpt_breakpoint_ops;
12394 ops->dtor = dtor_catch_exception;
12395 ops->allocate_location = allocate_location_catch_exception;
12396 ops->re_set = re_set_catch_exception;
12397 ops->check_status = check_status_catch_exception;
12398 ops->print_it = print_it_catch_exception;
12399 ops->print_one = print_one_catch_exception;
12400 ops->print_mention = print_mention_catch_exception;
12401 ops->print_recreate = print_recreate_catch_exception;
12403 ops = &catch_exception_unhandled_breakpoint_ops;
12404 *ops = bkpt_breakpoint_ops;
12405 ops->dtor = dtor_catch_exception_unhandled;
12406 ops->allocate_location = allocate_location_catch_exception_unhandled;
12407 ops->re_set = re_set_catch_exception_unhandled;
12408 ops->check_status = check_status_catch_exception_unhandled;
12409 ops->print_it = print_it_catch_exception_unhandled;
12410 ops->print_one = print_one_catch_exception_unhandled;
12411 ops->print_mention = print_mention_catch_exception_unhandled;
12412 ops->print_recreate = print_recreate_catch_exception_unhandled;
12414 ops = &catch_assert_breakpoint_ops;
12415 *ops = bkpt_breakpoint_ops;
12416 ops->dtor = dtor_catch_assert;
12417 ops->allocate_location = allocate_location_catch_assert;
12418 ops->re_set = re_set_catch_assert;
12419 ops->check_status = check_status_catch_assert;
12420 ops->print_it = print_it_catch_assert;
12421 ops->print_one = print_one_catch_assert;
12422 ops->print_mention = print_mention_catch_assert;
12423 ops->print_recreate = print_recreate_catch_assert;
12427 _initialize_ada_language (void)
12429 add_language (&ada_language_defn);
12431 initialize_ada_catchpoint_ops ();
12433 add_prefix_cmd ("ada", no_class, set_ada_command,
12434 _("Prefix command for changing Ada-specfic settings"),
12435 &set_ada_list, "set ada ", 0, &setlist);
12437 add_prefix_cmd ("ada", no_class, show_ada_command,
12438 _("Generic command for showing Ada-specific settings."),
12439 &show_ada_list, "show ada ", 0, &showlist);
12441 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
12442 &trust_pad_over_xvs, _("\
12443 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12444 Show whether an optimization trusting PAD types over XVS types is activated"),
12446 This is related to the encoding used by the GNAT compiler. The debugger\n\
12447 should normally trust the contents of PAD types, but certain older versions\n\
12448 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12449 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12450 work around this bug. It is always safe to turn this option \"off\", but\n\
12451 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12452 this option to \"off\" unless necessary."),
12453 NULL, NULL, &set_ada_list, &show_ada_list);
12455 add_catch_command ("exception", _("\
12456 Catch Ada exceptions, when raised.\n\
12457 With an argument, catch only exceptions with the given name."),
12458 catch_ada_exception_command,
12462 add_catch_command ("assert", _("\
12463 Catch failed Ada assertions, when raised.\n\
12464 With an argument, catch only exceptions with the given name."),
12465 catch_assert_command,
12470 varsize_limit = 65536;
12472 obstack_init (&symbol_list_obstack);
12474 decoded_names_store = htab_create_alloc
12475 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
12476 NULL, xcalloc, xfree);
12478 /* Setup per-inferior data. */
12479 observer_attach_inferior_exit (ada_inferior_exit);
12481 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup);