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"
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static struct type *desc_base_type (struct type *);
74 static struct type *desc_bounds_type (struct type *);
76 static struct value *desc_bounds (struct value *);
78 static int fat_pntr_bounds_bitpos (struct type *);
80 static int fat_pntr_bounds_bitsize (struct type *);
82 static struct type *desc_data_target_type (struct type *);
84 static struct value *desc_data (struct value *);
86 static int fat_pntr_data_bitpos (struct type *);
88 static int fat_pntr_data_bitsize (struct type *);
90 static struct value *desc_one_bound (struct value *, int, int);
92 static int desc_bound_bitpos (struct type *, int, int);
94 static int desc_bound_bitsize (struct type *, int, int);
96 static struct type *desc_index_type (struct type *, int);
98 static int desc_arity (struct type *);
100 static int ada_type_match (struct type *, struct type *, int);
102 static int ada_args_match (struct symbol *, struct value **, int);
104 static int full_match (const char *, const char *);
106 static struct value *make_array_descriptor (struct type *, struct value *);
108 static void ada_add_block_symbols (struct obstack *,
109 struct block *, const char *,
110 domain_enum, struct objfile *, int);
112 static int is_nonfunction (struct ada_symbol_info *, int);
114 static void add_defn_to_vec (struct obstack *, struct symbol *,
117 static int num_defns_collected (struct obstack *);
119 static struct ada_symbol_info *defns_collected (struct obstack *, int);
121 static struct value *resolve_subexp (struct expression **, int *, int,
124 static void replace_operator_with_call (struct expression **, int, int, int,
125 struct symbol *, struct block *);
127 static int possible_user_operator_p (enum exp_opcode, struct value **);
129 static char *ada_op_name (enum exp_opcode);
131 static const char *ada_decoded_op_name (enum exp_opcode);
133 static int numeric_type_p (struct type *);
135 static int integer_type_p (struct type *);
137 static int scalar_type_p (struct type *);
139 static int discrete_type_p (struct type *);
141 static enum ada_renaming_category parse_old_style_renaming (struct type *,
146 static struct symbol *find_old_style_renaming_symbol (const char *,
149 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
152 static struct value *evaluate_subexp_type (struct expression *, int *);
154 static struct type *ada_find_parallel_type_with_name (struct type *,
157 static int is_dynamic_field (struct type *, int);
159 static struct type *to_fixed_variant_branch_type (struct type *,
161 CORE_ADDR, struct value *);
163 static struct type *to_fixed_array_type (struct type *, struct value *, int);
165 static struct type *to_fixed_range_type (struct type *, struct value *);
167 static struct type *to_static_fixed_type (struct type *);
168 static struct type *static_unwrap_type (struct type *type);
170 static struct value *unwrap_value (struct value *);
172 static struct type *constrained_packed_array_type (struct type *, long *);
174 static struct type *decode_constrained_packed_array_type (struct type *);
176 static long decode_packed_array_bitsize (struct type *);
178 static struct value *decode_constrained_packed_array (struct value *);
180 static int ada_is_packed_array_type (struct type *);
182 static int ada_is_unconstrained_packed_array_type (struct type *);
184 static struct value *value_subscript_packed (struct value *, int,
187 static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int);
189 static struct value *coerce_unspec_val_to_type (struct value *,
192 static struct value *get_var_value (char *, char *);
194 static int lesseq_defined_than (struct symbol *, struct symbol *);
196 static int equiv_types (struct type *, struct type *);
198 static int is_name_suffix (const char *);
200 static int advance_wild_match (const char **, const char *, int);
202 static int wild_match (const char *, const char *);
204 static struct value *ada_coerce_ref (struct value *);
206 static LONGEST pos_atr (struct value *);
208 static struct value *value_pos_atr (struct type *, struct value *);
210 static struct value *value_val_atr (struct type *, struct value *);
212 static struct symbol *standard_lookup (const char *, const struct block *,
215 static struct value *ada_search_struct_field (char *, struct value *, int,
218 static struct value *ada_value_primitive_field (struct value *, int, int,
221 static int find_struct_field (char *, struct type *, int,
222 struct type **, int *, int *, int *, int *);
224 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
227 static int ada_resolve_function (struct ada_symbol_info *, int,
228 struct value **, int, const char *,
231 static struct value *ada_coerce_to_simple_array (struct value *);
233 static int ada_is_direct_array_type (struct type *);
235 static void ada_language_arch_info (struct gdbarch *,
236 struct language_arch_info *);
238 static void check_size (const struct type *);
240 static struct value *ada_index_struct_field (int, struct value *, int,
243 static struct value *assign_aggregate (struct value *, struct value *,
244 struct expression *, int *, enum noside);
246 static void aggregate_assign_from_choices (struct value *, struct value *,
248 int *, LONGEST *, int *,
249 int, LONGEST, LONGEST);
251 static void aggregate_assign_positional (struct value *, struct value *,
253 int *, LONGEST *, int *, int,
257 static void aggregate_assign_others (struct value *, struct value *,
259 int *, LONGEST *, int, LONGEST, LONGEST);
262 static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
265 static struct value *ada_evaluate_subexp (struct type *, struct expression *,
268 static void ada_forward_operator_length (struct expression *, int, int *,
273 /* Maximum-sized dynamic type. */
274 static unsigned int varsize_limit;
276 /* FIXME: brobecker/2003-09-17: No longer a const because it is
277 returned by a function that does not return a const char *. */
278 static char *ada_completer_word_break_characters =
280 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
282 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
285 /* The name of the symbol to use to get the name of the main subprogram. */
286 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
287 = "__gnat_ada_main_program_name";
289 /* Limit on the number of warnings to raise per expression evaluation. */
290 static int warning_limit = 2;
292 /* Number of warning messages issued; reset to 0 by cleanups after
293 expression evaluation. */
294 static int warnings_issued = 0;
296 static const char *known_runtime_file_name_patterns[] = {
297 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
300 static const char *known_auxiliary_function_name_patterns[] = {
301 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
304 /* Space for allocating results of ada_lookup_symbol_list. */
305 static struct obstack symbol_list_obstack;
307 /* Inferior-specific data. */
309 /* Per-inferior data for this module. */
311 struct ada_inferior_data
313 /* The ada__tags__type_specific_data type, which is used when decoding
314 tagged types. With older versions of GNAT, this type was directly
315 accessible through a component ("tsd") in the object tag. But this
316 is no longer the case, so we cache it for each inferior. */
317 struct type *tsd_type;
320 /* Our key to this module's inferior data. */
321 static const struct inferior_data *ada_inferior_data;
323 /* A cleanup routine for our inferior data. */
325 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
327 struct ada_inferior_data *data;
329 data = inferior_data (inf, ada_inferior_data);
334 /* Return our inferior data for the given inferior (INF).
336 This function always returns a valid pointer to an allocated
337 ada_inferior_data structure. If INF's inferior data has not
338 been previously set, this functions creates a new one with all
339 fields set to zero, sets INF's inferior to it, and then returns
340 a pointer to that newly allocated ada_inferior_data. */
342 static struct ada_inferior_data *
343 get_ada_inferior_data (struct inferior *inf)
345 struct ada_inferior_data *data;
347 data = inferior_data (inf, ada_inferior_data);
350 data = XZALLOC (struct ada_inferior_data);
351 set_inferior_data (inf, ada_inferior_data, data);
357 /* Perform all necessary cleanups regarding our module's inferior data
358 that is required after the inferior INF just exited. */
361 ada_inferior_exit (struct inferior *inf)
363 ada_inferior_data_cleanup (inf, NULL);
364 set_inferior_data (inf, ada_inferior_data, NULL);
369 /* Given DECODED_NAME a string holding a symbol name in its
370 decoded form (ie using the Ada dotted notation), returns
371 its unqualified name. */
374 ada_unqualified_name (const char *decoded_name)
376 const char *result = strrchr (decoded_name, '.');
379 result++; /* Skip the dot... */
381 result = decoded_name;
386 /* Return a string starting with '<', followed by STR, and '>'.
387 The result is good until the next call. */
390 add_angle_brackets (const char *str)
392 static char *result = NULL;
395 result = xstrprintf ("<%s>", str);
400 ada_get_gdb_completer_word_break_characters (void)
402 return ada_completer_word_break_characters;
405 /* Print an array element index using the Ada syntax. */
408 ada_print_array_index (struct value *index_value, struct ui_file *stream,
409 const struct value_print_options *options)
411 LA_VALUE_PRINT (index_value, stream, options);
412 fprintf_filtered (stream, " => ");
415 /* Assuming VECT points to an array of *SIZE objects of size
416 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
417 updating *SIZE as necessary and returning the (new) array. */
420 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
422 if (*size < min_size)
425 if (*size < min_size)
427 vect = xrealloc (vect, *size * element_size);
432 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
433 suffix of FIELD_NAME beginning "___". */
436 field_name_match (const char *field_name, const char *target)
438 int len = strlen (target);
441 (strncmp (field_name, target, len) == 0
442 && (field_name[len] == '\0'
443 || (strncmp (field_name + len, "___", 3) == 0
444 && strcmp (field_name + strlen (field_name) - 6,
449 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
450 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
451 and return its index. This function also handles fields whose name
452 have ___ suffixes because the compiler sometimes alters their name
453 by adding such a suffix to represent fields with certain constraints.
454 If the field could not be found, return a negative number if
455 MAYBE_MISSING is set. Otherwise raise an error. */
458 ada_get_field_index (const struct type *type, const char *field_name,
462 struct type *struct_type = check_typedef ((struct type *) type);
464 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
465 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
469 error (_("Unable to find field %s in struct %s. Aborting"),
470 field_name, TYPE_NAME (struct_type));
475 /* The length of the prefix of NAME prior to any "___" suffix. */
478 ada_name_prefix_len (const char *name)
484 const char *p = strstr (name, "___");
487 return strlen (name);
493 /* Return non-zero if SUFFIX is a suffix of STR.
494 Return zero if STR is null. */
497 is_suffix (const char *str, const char *suffix)
504 len2 = strlen (suffix);
505 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
508 /* The contents of value VAL, treated as a value of type TYPE. The
509 result is an lval in memory if VAL is. */
511 static struct value *
512 coerce_unspec_val_to_type (struct value *val, struct type *type)
514 type = ada_check_typedef (type);
515 if (value_type (val) == type)
519 struct value *result;
521 /* Make sure that the object size is not unreasonable before
522 trying to allocate some memory for it. */
525 result = allocate_value (type);
526 set_value_component_location (result, val);
527 set_value_bitsize (result, value_bitsize (val));
528 set_value_bitpos (result, value_bitpos (val));
529 set_value_address (result, value_address (val));
531 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
532 set_value_lazy (result, 1);
534 memcpy (value_contents_raw (result), value_contents (val),
540 static const gdb_byte *
541 cond_offset_host (const gdb_byte *valaddr, long offset)
546 return valaddr + offset;
550 cond_offset_target (CORE_ADDR address, long offset)
555 return address + offset;
558 /* Issue a warning (as for the definition of warning in utils.c, but
559 with exactly one argument rather than ...), unless the limit on the
560 number of warnings has passed during the evaluation of the current
563 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
564 provided by "complaint". */
565 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
568 lim_warning (const char *format, ...)
572 va_start (args, format);
573 warnings_issued += 1;
574 if (warnings_issued <= warning_limit)
575 vwarning (format, args);
580 /* Issue an error if the size of an object of type T is unreasonable,
581 i.e. if it would be a bad idea to allocate a value of this type in
585 check_size (const struct type *type)
587 if (TYPE_LENGTH (type) > varsize_limit)
588 error (_("object size is larger than varsize-limit"));
591 /* Maximum value of a SIZE-byte signed integer type. */
593 max_of_size (int size)
595 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
597 return top_bit | (top_bit - 1);
600 /* Minimum value of a SIZE-byte signed integer type. */
602 min_of_size (int size)
604 return -max_of_size (size) - 1;
607 /* Maximum value of a SIZE-byte unsigned integer type. */
609 umax_of_size (int size)
611 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
613 return top_bit | (top_bit - 1);
616 /* Maximum value of integral type T, as a signed quantity. */
618 max_of_type (struct type *t)
620 if (TYPE_UNSIGNED (t))
621 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
623 return max_of_size (TYPE_LENGTH (t));
626 /* Minimum value of integral type T, as a signed quantity. */
628 min_of_type (struct type *t)
630 if (TYPE_UNSIGNED (t))
633 return min_of_size (TYPE_LENGTH (t));
636 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
638 ada_discrete_type_high_bound (struct type *type)
640 switch (TYPE_CODE (type))
642 case TYPE_CODE_RANGE:
643 return TYPE_HIGH_BOUND (type);
645 return TYPE_FIELD_BITPOS (type, TYPE_NFIELDS (type) - 1);
650 return max_of_type (type);
652 error (_("Unexpected type in ada_discrete_type_high_bound."));
656 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
658 ada_discrete_type_low_bound (struct type *type)
660 switch (TYPE_CODE (type))
662 case TYPE_CODE_RANGE:
663 return TYPE_LOW_BOUND (type);
665 return TYPE_FIELD_BITPOS (type, 0);
670 return min_of_type (type);
672 error (_("Unexpected type in ada_discrete_type_low_bound."));
676 /* The identity on non-range types. For range types, the underlying
677 non-range scalar type. */
680 base_type (struct type *type)
682 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
684 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
686 type = TYPE_TARGET_TYPE (type);
692 /* Language Selection */
694 /* If the main program is in Ada, return language_ada, otherwise return LANG
695 (the main program is in Ada iif the adainit symbol is found). */
698 ada_update_initial_language (enum language lang)
700 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
701 (struct objfile *) NULL) != NULL)
707 /* If the main procedure is written in Ada, then return its name.
708 The result is good until the next call. Return NULL if the main
709 procedure doesn't appear to be in Ada. */
714 struct minimal_symbol *msym;
715 static char *main_program_name = NULL;
717 /* For Ada, the name of the main procedure is stored in a specific
718 string constant, generated by the binder. Look for that symbol,
719 extract its address, and then read that string. If we didn't find
720 that string, then most probably the main procedure is not written
722 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
726 CORE_ADDR main_program_name_addr;
729 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
730 if (main_program_name_addr == 0)
731 error (_("Invalid address for Ada main program name."));
733 xfree (main_program_name);
734 target_read_string (main_program_name_addr, &main_program_name,
739 return main_program_name;
742 /* The main procedure doesn't seem to be in Ada. */
748 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
751 const struct ada_opname_map ada_opname_table[] = {
752 {"Oadd", "\"+\"", BINOP_ADD},
753 {"Osubtract", "\"-\"", BINOP_SUB},
754 {"Omultiply", "\"*\"", BINOP_MUL},
755 {"Odivide", "\"/\"", BINOP_DIV},
756 {"Omod", "\"mod\"", BINOP_MOD},
757 {"Orem", "\"rem\"", BINOP_REM},
758 {"Oexpon", "\"**\"", BINOP_EXP},
759 {"Olt", "\"<\"", BINOP_LESS},
760 {"Ole", "\"<=\"", BINOP_LEQ},
761 {"Ogt", "\">\"", BINOP_GTR},
762 {"Oge", "\">=\"", BINOP_GEQ},
763 {"Oeq", "\"=\"", BINOP_EQUAL},
764 {"One", "\"/=\"", BINOP_NOTEQUAL},
765 {"Oand", "\"and\"", BINOP_BITWISE_AND},
766 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
767 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
768 {"Oconcat", "\"&\"", BINOP_CONCAT},
769 {"Oabs", "\"abs\"", UNOP_ABS},
770 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
771 {"Oadd", "\"+\"", UNOP_PLUS},
772 {"Osubtract", "\"-\"", UNOP_NEG},
776 /* The "encoded" form of DECODED, according to GNAT conventions.
777 The result is valid until the next call to ada_encode. */
780 ada_encode (const char *decoded)
782 static char *encoding_buffer = NULL;
783 static size_t encoding_buffer_size = 0;
790 GROW_VECT (encoding_buffer, encoding_buffer_size,
791 2 * strlen (decoded) + 10);
794 for (p = decoded; *p != '\0'; p += 1)
798 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
803 const struct ada_opname_map *mapping;
805 for (mapping = ada_opname_table;
806 mapping->encoded != NULL
807 && strncmp (mapping->decoded, p,
808 strlen (mapping->decoded)) != 0; mapping += 1)
810 if (mapping->encoded == NULL)
811 error (_("invalid Ada operator name: %s"), p);
812 strcpy (encoding_buffer + k, mapping->encoded);
813 k += strlen (mapping->encoded);
818 encoding_buffer[k] = *p;
823 encoding_buffer[k] = '\0';
824 return encoding_buffer;
827 /* Return NAME folded to lower case, or, if surrounded by single
828 quotes, unfolded, but with the quotes stripped away. Result good
832 ada_fold_name (const char *name)
834 static char *fold_buffer = NULL;
835 static size_t fold_buffer_size = 0;
837 int len = strlen (name);
838 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
842 strncpy (fold_buffer, name + 1, len - 2);
843 fold_buffer[len - 2] = '\000';
849 for (i = 0; i <= len; i += 1)
850 fold_buffer[i] = tolower (name[i]);
856 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
859 is_lower_alphanum (const char c)
861 return (isdigit (c) || (isalpha (c) && islower (c)));
864 /* Remove either of these suffixes:
869 These are suffixes introduced by the compiler for entities such as
870 nested subprogram for instance, in order to avoid name clashes.
871 They do not serve any purpose for the debugger. */
874 ada_remove_trailing_digits (const char *encoded, int *len)
876 if (*len > 1 && isdigit (encoded[*len - 1]))
880 while (i > 0 && isdigit (encoded[i]))
882 if (i >= 0 && encoded[i] == '.')
884 else if (i >= 0 && encoded[i] == '$')
886 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
888 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
893 /* Remove the suffix introduced by the compiler for protected object
897 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
899 /* Remove trailing N. */
901 /* Protected entry subprograms are broken into two
902 separate subprograms: The first one is unprotected, and has
903 a 'N' suffix; the second is the protected version, and has
904 the 'P' suffix. The second calls the first one after handling
905 the protection. Since the P subprograms are internally generated,
906 we leave these names undecoded, giving the user a clue that this
907 entity is internal. */
910 && encoded[*len - 1] == 'N'
911 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
915 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
918 ada_remove_Xbn_suffix (const char *encoded, int *len)
922 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
925 if (encoded[i] != 'X')
931 if (isalnum (encoded[i-1]))
935 /* If ENCODED follows the GNAT entity encoding conventions, then return
936 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
939 The resulting string is valid until the next call of ada_decode.
940 If the string is unchanged by decoding, the original string pointer
944 ada_decode (const char *encoded)
951 static char *decoding_buffer = NULL;
952 static size_t decoding_buffer_size = 0;
954 /* The name of the Ada main procedure starts with "_ada_".
955 This prefix is not part of the decoded name, so skip this part
956 if we see this prefix. */
957 if (strncmp (encoded, "_ada_", 5) == 0)
960 /* If the name starts with '_', then it is not a properly encoded
961 name, so do not attempt to decode it. Similarly, if the name
962 starts with '<', the name should not be decoded. */
963 if (encoded[0] == '_' || encoded[0] == '<')
966 len0 = strlen (encoded);
968 ada_remove_trailing_digits (encoded, &len0);
969 ada_remove_po_subprogram_suffix (encoded, &len0);
971 /* Remove the ___X.* suffix if present. Do not forget to verify that
972 the suffix is located before the current "end" of ENCODED. We want
973 to avoid re-matching parts of ENCODED that have previously been
974 marked as discarded (by decrementing LEN0). */
975 p = strstr (encoded, "___");
976 if (p != NULL && p - encoded < len0 - 3)
984 /* Remove any trailing TKB suffix. It tells us that this symbol
985 is for the body of a task, but that information does not actually
986 appear in the decoded name. */
988 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
991 /* Remove any trailing TB suffix. The TB suffix is slightly different
992 from the TKB suffix because it is used for non-anonymous task
995 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
998 /* Remove trailing "B" suffixes. */
999 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1001 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
1004 /* Make decoded big enough for possible expansion by operator name. */
1006 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1007 decoded = decoding_buffer;
1009 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1011 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1014 while ((i >= 0 && isdigit (encoded[i]))
1015 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1017 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1019 else if (encoded[i] == '$')
1023 /* The first few characters that are not alphabetic are not part
1024 of any encoding we use, so we can copy them over verbatim. */
1026 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1027 decoded[j] = encoded[i];
1032 /* Is this a symbol function? */
1033 if (at_start_name && encoded[i] == 'O')
1037 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1039 int op_len = strlen (ada_opname_table[k].encoded);
1040 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1042 && !isalnum (encoded[i + op_len]))
1044 strcpy (decoded + j, ada_opname_table[k].decoded);
1047 j += strlen (ada_opname_table[k].decoded);
1051 if (ada_opname_table[k].encoded != NULL)
1056 /* Replace "TK__" with "__", which will eventually be translated
1057 into "." (just below). */
1059 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1062 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1063 be translated into "." (just below). These are internal names
1064 generated for anonymous blocks inside which our symbol is nested. */
1066 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1067 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1068 && isdigit (encoded [i+4]))
1072 while (k < len0 && isdigit (encoded[k]))
1073 k++; /* Skip any extra digit. */
1075 /* Double-check that the "__B_{DIGITS}+" sequence we found
1076 is indeed followed by "__". */
1077 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1081 /* Remove _E{DIGITS}+[sb] */
1083 /* Just as for protected object subprograms, there are 2 categories
1084 of subprograms created by the compiler for each entry. The first
1085 one implements the actual entry code, and has a suffix following
1086 the convention above; the second one implements the barrier and
1087 uses the same convention as above, except that the 'E' is replaced
1090 Just as above, we do not decode the name of barrier functions
1091 to give the user a clue that the code he is debugging has been
1092 internally generated. */
1094 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1095 && isdigit (encoded[i+2]))
1099 while (k < len0 && isdigit (encoded[k]))
1103 && (encoded[k] == 'b' || encoded[k] == 's'))
1106 /* Just as an extra precaution, make sure that if this
1107 suffix is followed by anything else, it is a '_'.
1108 Otherwise, we matched this sequence by accident. */
1110 || (k < len0 && encoded[k] == '_'))
1115 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1116 the GNAT front-end in protected object subprograms. */
1119 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1121 /* Backtrack a bit up until we reach either the begining of
1122 the encoded name, or "__". Make sure that we only find
1123 digits or lowercase characters. */
1124 const char *ptr = encoded + i - 1;
1126 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1129 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1133 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1135 /* This is a X[bn]* sequence not separated from the previous
1136 part of the name with a non-alpha-numeric character (in other
1137 words, immediately following an alpha-numeric character), then
1138 verify that it is placed at the end of the encoded name. If
1139 not, then the encoding is not valid and we should abort the
1140 decoding. Otherwise, just skip it, it is used in body-nested
1144 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1148 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1150 /* Replace '__' by '.'. */
1158 /* It's a character part of the decoded name, so just copy it
1160 decoded[j] = encoded[i];
1165 decoded[j] = '\000';
1167 /* Decoded names should never contain any uppercase character.
1168 Double-check this, and abort the decoding if we find one. */
1170 for (i = 0; decoded[i] != '\0'; i += 1)
1171 if (isupper (decoded[i]) || decoded[i] == ' ')
1174 if (strcmp (decoded, encoded) == 0)
1180 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1181 decoded = decoding_buffer;
1182 if (encoded[0] == '<')
1183 strcpy (decoded, encoded);
1185 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1190 /* Table for keeping permanent unique copies of decoded names. Once
1191 allocated, names in this table are never released. While this is a
1192 storage leak, it should not be significant unless there are massive
1193 changes in the set of decoded names in successive versions of a
1194 symbol table loaded during a single session. */
1195 static struct htab *decoded_names_store;
1197 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1198 in the language-specific part of GSYMBOL, if it has not been
1199 previously computed. Tries to save the decoded name in the same
1200 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1201 in any case, the decoded symbol has a lifetime at least that of
1203 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1204 const, but nevertheless modified to a semantically equivalent form
1205 when a decoded name is cached in it.
1209 ada_decode_symbol (const struct general_symbol_info *gsymbol)
1212 (char **) &gsymbol->language_specific.mangled_lang.demangled_name;
1214 if (*resultp == NULL)
1216 const char *decoded = ada_decode (gsymbol->name);
1218 if (gsymbol->obj_section != NULL)
1220 struct objfile *objf = gsymbol->obj_section->objfile;
1222 *resultp = obsavestring (decoded, strlen (decoded),
1223 &objf->objfile_obstack);
1225 /* Sometimes, we can't find a corresponding objfile, in which
1226 case, we put the result on the heap. Since we only decode
1227 when needed, we hope this usually does not cause a
1228 significant memory leak (FIXME). */
1229 if (*resultp == NULL)
1231 char **slot = (char **) htab_find_slot (decoded_names_store,
1235 *slot = xstrdup (decoded);
1244 ada_la_decode (const char *encoded, int options)
1246 return xstrdup (ada_decode (encoded));
1249 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1250 suffixes that encode debugging information or leading _ada_ on
1251 SYM_NAME (see is_name_suffix commentary for the debugging
1252 information that is ignored). If WILD, then NAME need only match a
1253 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1254 either argument is NULL. */
1257 match_name (const char *sym_name, const char *name, int wild)
1259 if (sym_name == NULL || name == NULL)
1262 return wild_match (sym_name, name) == 0;
1265 int len_name = strlen (name);
1267 return (strncmp (sym_name, name, len_name) == 0
1268 && is_name_suffix (sym_name + len_name))
1269 || (strncmp (sym_name, "_ada_", 5) == 0
1270 && strncmp (sym_name + 5, name, len_name) == 0
1271 && is_name_suffix (sym_name + len_name + 5));
1278 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1279 generated by the GNAT compiler to describe the index type used
1280 for each dimension of an array, check whether it follows the latest
1281 known encoding. If not, fix it up to conform to the latest encoding.
1282 Otherwise, do nothing. This function also does nothing if
1283 INDEX_DESC_TYPE is NULL.
1285 The GNAT encoding used to describle the array index type evolved a bit.
1286 Initially, the information would be provided through the name of each
1287 field of the structure type only, while the type of these fields was
1288 described as unspecified and irrelevant. The debugger was then expected
1289 to perform a global type lookup using the name of that field in order
1290 to get access to the full index type description. Because these global
1291 lookups can be very expensive, the encoding was later enhanced to make
1292 the global lookup unnecessary by defining the field type as being
1293 the full index type description.
1295 The purpose of this routine is to allow us to support older versions
1296 of the compiler by detecting the use of the older encoding, and by
1297 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1298 we essentially replace each field's meaningless type by the associated
1302 ada_fixup_array_indexes_type (struct type *index_desc_type)
1306 if (index_desc_type == NULL)
1308 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1310 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1311 to check one field only, no need to check them all). If not, return
1314 If our INDEX_DESC_TYPE was generated using the older encoding,
1315 the field type should be a meaningless integer type whose name
1316 is not equal to the field name. */
1317 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1318 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1319 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1322 /* Fixup each field of INDEX_DESC_TYPE. */
1323 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1325 char *name = TYPE_FIELD_NAME (index_desc_type, i);
1326 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1329 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1333 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1335 static char *bound_name[] = {
1336 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1337 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1340 /* Maximum number of array dimensions we are prepared to handle. */
1342 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1345 /* The desc_* routines return primitive portions of array descriptors
1348 /* The descriptor or array type, if any, indicated by TYPE; removes
1349 level of indirection, if needed. */
1351 static struct type *
1352 desc_base_type (struct type *type)
1356 type = ada_check_typedef (type);
1358 && (TYPE_CODE (type) == TYPE_CODE_PTR
1359 || TYPE_CODE (type) == TYPE_CODE_REF))
1360 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1365 /* True iff TYPE indicates a "thin" array pointer type. */
1368 is_thin_pntr (struct type *type)
1371 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1372 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1375 /* The descriptor type for thin pointer type TYPE. */
1377 static struct type *
1378 thin_descriptor_type (struct type *type)
1380 struct type *base_type = desc_base_type (type);
1382 if (base_type == NULL)
1384 if (is_suffix (ada_type_name (base_type), "___XVE"))
1388 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1390 if (alt_type == NULL)
1397 /* A pointer to the array data for thin-pointer value VAL. */
1399 static struct value *
1400 thin_data_pntr (struct value *val)
1402 struct type *type = value_type (val);
1403 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1405 data_type = lookup_pointer_type (data_type);
1407 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1408 return value_cast (data_type, value_copy (val));
1410 return value_from_longest (data_type, value_address (val));
1413 /* True iff TYPE indicates a "thick" array pointer type. */
1416 is_thick_pntr (struct type *type)
1418 type = desc_base_type (type);
1419 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1420 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1423 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1424 pointer to one, the type of its bounds data; otherwise, NULL. */
1426 static struct type *
1427 desc_bounds_type (struct type *type)
1431 type = desc_base_type (type);
1435 else if (is_thin_pntr (type))
1437 type = thin_descriptor_type (type);
1440 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1442 return ada_check_typedef (r);
1444 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1446 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1448 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1453 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1454 one, a pointer to its bounds data. Otherwise NULL. */
1456 static struct value *
1457 desc_bounds (struct value *arr)
1459 struct type *type = ada_check_typedef (value_type (arr));
1461 if (is_thin_pntr (type))
1463 struct type *bounds_type =
1464 desc_bounds_type (thin_descriptor_type (type));
1467 if (bounds_type == NULL)
1468 error (_("Bad GNAT array descriptor"));
1470 /* NOTE: The following calculation is not really kosher, but
1471 since desc_type is an XVE-encoded type (and shouldn't be),
1472 the correct calculation is a real pain. FIXME (and fix GCC). */
1473 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1474 addr = value_as_long (arr);
1476 addr = value_address (arr);
1479 value_from_longest (lookup_pointer_type (bounds_type),
1480 addr - TYPE_LENGTH (bounds_type));
1483 else if (is_thick_pntr (type))
1485 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1486 _("Bad GNAT array descriptor"));
1487 struct type *p_bounds_type = value_type (p_bounds);
1490 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1492 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1494 if (TYPE_STUB (target_type))
1495 p_bounds = value_cast (lookup_pointer_type
1496 (ada_check_typedef (target_type)),
1500 error (_("Bad GNAT array descriptor"));
1508 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1509 position of the field containing the address of the bounds data. */
1512 fat_pntr_bounds_bitpos (struct type *type)
1514 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1517 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1518 size of the field containing the address of the bounds data. */
1521 fat_pntr_bounds_bitsize (struct type *type)
1523 type = desc_base_type (type);
1525 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1526 return TYPE_FIELD_BITSIZE (type, 1);
1528 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1531 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1532 pointer to one, the type of its array data (a array-with-no-bounds type);
1533 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1536 static struct type *
1537 desc_data_target_type (struct type *type)
1539 type = desc_base_type (type);
1541 /* NOTE: The following is bogus; see comment in desc_bounds. */
1542 if (is_thin_pntr (type))
1543 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1544 else if (is_thick_pntr (type))
1546 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1549 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1550 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1556 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1559 static struct value *
1560 desc_data (struct value *arr)
1562 struct type *type = value_type (arr);
1564 if (is_thin_pntr (type))
1565 return thin_data_pntr (arr);
1566 else if (is_thick_pntr (type))
1567 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1568 _("Bad GNAT array descriptor"));
1574 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1575 position of the field containing the address of the data. */
1578 fat_pntr_data_bitpos (struct type *type)
1580 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1583 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1584 size of the field containing the address of the data. */
1587 fat_pntr_data_bitsize (struct type *type)
1589 type = desc_base_type (type);
1591 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1592 return TYPE_FIELD_BITSIZE (type, 0);
1594 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1597 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1598 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1599 bound, if WHICH is 1. The first bound is I=1. */
1601 static struct value *
1602 desc_one_bound (struct value *bounds, int i, int which)
1604 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1605 _("Bad GNAT array descriptor bounds"));
1608 /* If BOUNDS is an array-bounds structure type, return the bit position
1609 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1610 bound, if WHICH is 1. The first bound is I=1. */
1613 desc_bound_bitpos (struct type *type, int i, int which)
1615 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1618 /* If BOUNDS is an array-bounds structure type, return the bit field size
1619 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1620 bound, if WHICH is 1. The first bound is I=1. */
1623 desc_bound_bitsize (struct type *type, int i, int which)
1625 type = desc_base_type (type);
1627 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1628 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1630 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1633 /* If TYPE is the type of an array-bounds structure, the type of its
1634 Ith bound (numbering from 1). Otherwise, NULL. */
1636 static struct type *
1637 desc_index_type (struct type *type, int i)
1639 type = desc_base_type (type);
1641 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1642 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1647 /* The number of index positions in the array-bounds type TYPE.
1648 Return 0 if TYPE is NULL. */
1651 desc_arity (struct type *type)
1653 type = desc_base_type (type);
1656 return TYPE_NFIELDS (type) / 2;
1660 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1661 an array descriptor type (representing an unconstrained array
1665 ada_is_direct_array_type (struct type *type)
1669 type = ada_check_typedef (type);
1670 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1671 || ada_is_array_descriptor_type (type));
1674 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1678 ada_is_array_type (struct type *type)
1681 && (TYPE_CODE (type) == TYPE_CODE_PTR
1682 || TYPE_CODE (type) == TYPE_CODE_REF))
1683 type = TYPE_TARGET_TYPE (type);
1684 return ada_is_direct_array_type (type);
1687 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1690 ada_is_simple_array_type (struct type *type)
1694 type = ada_check_typedef (type);
1695 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1696 || (TYPE_CODE (type) == TYPE_CODE_PTR
1697 && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
1700 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1703 ada_is_array_descriptor_type (struct type *type)
1705 struct type *data_type = desc_data_target_type (type);
1709 type = ada_check_typedef (type);
1710 return (data_type != NULL
1711 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1712 && desc_arity (desc_bounds_type (type)) > 0);
1715 /* Non-zero iff type is a partially mal-formed GNAT array
1716 descriptor. FIXME: This is to compensate for some problems with
1717 debugging output from GNAT. Re-examine periodically to see if it
1721 ada_is_bogus_array_descriptor (struct type *type)
1725 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1726 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1727 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1728 && !ada_is_array_descriptor_type (type);
1732 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1733 (fat pointer) returns the type of the array data described---specifically,
1734 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1735 in from the descriptor; otherwise, they are left unspecified. If
1736 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1737 returns NULL. The result is simply the type of ARR if ARR is not
1740 ada_type_of_array (struct value *arr, int bounds)
1742 if (ada_is_constrained_packed_array_type (value_type (arr)))
1743 return decode_constrained_packed_array_type (value_type (arr));
1745 if (!ada_is_array_descriptor_type (value_type (arr)))
1746 return value_type (arr);
1750 struct type *array_type =
1751 ada_check_typedef (desc_data_target_type (value_type (arr)));
1753 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1754 TYPE_FIELD_BITSIZE (array_type, 0) =
1755 decode_packed_array_bitsize (value_type (arr));
1761 struct type *elt_type;
1763 struct value *descriptor;
1765 elt_type = ada_array_element_type (value_type (arr), -1);
1766 arity = ada_array_arity (value_type (arr));
1768 if (elt_type == NULL || arity == 0)
1769 return ada_check_typedef (value_type (arr));
1771 descriptor = desc_bounds (arr);
1772 if (value_as_long (descriptor) == 0)
1776 struct type *range_type = alloc_type_copy (value_type (arr));
1777 struct type *array_type = alloc_type_copy (value_type (arr));
1778 struct value *low = desc_one_bound (descriptor, arity, 0);
1779 struct value *high = desc_one_bound (descriptor, arity, 1);
1782 create_range_type (range_type, value_type (low),
1783 longest_to_int (value_as_long (low)),
1784 longest_to_int (value_as_long (high)));
1785 elt_type = create_array_type (array_type, elt_type, range_type);
1787 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1788 TYPE_FIELD_BITSIZE (elt_type, 0) =
1789 decode_packed_array_bitsize (value_type (arr));
1792 return lookup_pointer_type (elt_type);
1796 /* If ARR does not represent an array, returns ARR unchanged.
1797 Otherwise, returns either a standard GDB array with bounds set
1798 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1799 GDB array. Returns NULL if ARR is a null fat pointer. */
1802 ada_coerce_to_simple_array_ptr (struct value *arr)
1804 if (ada_is_array_descriptor_type (value_type (arr)))
1806 struct type *arrType = ada_type_of_array (arr, 1);
1808 if (arrType == NULL)
1810 return value_cast (arrType, value_copy (desc_data (arr)));
1812 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1813 return decode_constrained_packed_array (arr);
1818 /* If ARR does not represent an array, returns ARR unchanged.
1819 Otherwise, returns a standard GDB array describing ARR (which may
1820 be ARR itself if it already is in the proper form). */
1822 static struct value *
1823 ada_coerce_to_simple_array (struct value *arr)
1825 if (ada_is_array_descriptor_type (value_type (arr)))
1827 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1830 error (_("Bounds unavailable for null array pointer."));
1831 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1832 return value_ind (arrVal);
1834 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1835 return decode_constrained_packed_array (arr);
1840 /* If TYPE represents a GNAT array type, return it translated to an
1841 ordinary GDB array type (possibly with BITSIZE fields indicating
1842 packing). For other types, is the identity. */
1845 ada_coerce_to_simple_array_type (struct type *type)
1847 if (ada_is_constrained_packed_array_type (type))
1848 return decode_constrained_packed_array_type (type);
1850 if (ada_is_array_descriptor_type (type))
1851 return ada_check_typedef (desc_data_target_type (type));
1856 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1859 ada_is_packed_array_type (struct type *type)
1863 type = desc_base_type (type);
1864 type = ada_check_typedef (type);
1866 ada_type_name (type) != NULL
1867 && strstr (ada_type_name (type), "___XP") != NULL;
1870 /* Non-zero iff TYPE represents a standard GNAT constrained
1871 packed-array type. */
1874 ada_is_constrained_packed_array_type (struct type *type)
1876 return ada_is_packed_array_type (type)
1877 && !ada_is_array_descriptor_type (type);
1880 /* Non-zero iff TYPE represents an array descriptor for a
1881 unconstrained packed-array type. */
1884 ada_is_unconstrained_packed_array_type (struct type *type)
1886 return ada_is_packed_array_type (type)
1887 && ada_is_array_descriptor_type (type);
1890 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1891 return the size of its elements in bits. */
1894 decode_packed_array_bitsize (struct type *type)
1896 char *raw_name = ada_type_name (ada_check_typedef (type));
1901 raw_name = ada_type_name (desc_base_type (type));
1906 tail = strstr (raw_name, "___XP");
1908 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1911 (_("could not understand bit size information on packed array"));
1918 /* Given that TYPE is a standard GDB array type with all bounds filled
1919 in, and that the element size of its ultimate scalar constituents
1920 (that is, either its elements, or, if it is an array of arrays, its
1921 elements' elements, etc.) is *ELT_BITS, return an identical type,
1922 but with the bit sizes of its elements (and those of any
1923 constituent arrays) recorded in the BITSIZE components of its
1924 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1927 static struct type *
1928 constrained_packed_array_type (struct type *type, long *elt_bits)
1930 struct type *new_elt_type;
1931 struct type *new_type;
1932 LONGEST low_bound, high_bound;
1934 type = ada_check_typedef (type);
1935 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
1938 new_type = alloc_type_copy (type);
1940 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
1942 create_array_type (new_type, new_elt_type, TYPE_INDEX_TYPE (type));
1943 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
1944 TYPE_NAME (new_type) = ada_type_name (type);
1946 if (get_discrete_bounds (TYPE_INDEX_TYPE (type),
1947 &low_bound, &high_bound) < 0)
1948 low_bound = high_bound = 0;
1949 if (high_bound < low_bound)
1950 *elt_bits = TYPE_LENGTH (new_type) = 0;
1953 *elt_bits *= (high_bound - low_bound + 1);
1954 TYPE_LENGTH (new_type) =
1955 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
1958 TYPE_FIXED_INSTANCE (new_type) = 1;
1962 /* The array type encoded by TYPE, where
1963 ada_is_constrained_packed_array_type (TYPE). */
1965 static struct type *
1966 decode_constrained_packed_array_type (struct type *type)
1968 char *raw_name = ada_type_name (ada_check_typedef (type));
1971 struct type *shadow_type;
1975 raw_name = ada_type_name (desc_base_type (type));
1980 name = (char *) alloca (strlen (raw_name) + 1);
1981 tail = strstr (raw_name, "___XP");
1982 type = desc_base_type (type);
1984 memcpy (name, raw_name, tail - raw_name);
1985 name[tail - raw_name] = '\000';
1987 shadow_type = ada_find_parallel_type_with_name (type, name);
1989 if (shadow_type == NULL)
1991 lim_warning (_("could not find bounds information on packed array"));
1994 CHECK_TYPEDEF (shadow_type);
1996 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
1998 lim_warning (_("could not understand bounds information on packed array"));
2002 bits = decode_packed_array_bitsize (type);
2003 return constrained_packed_array_type (shadow_type, &bits);
2006 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2007 array, returns a simple array that denotes that array. Its type is a
2008 standard GDB array type except that the BITSIZEs of the array
2009 target types are set to the number of bits in each element, and the
2010 type length is set appropriately. */
2012 static struct value *
2013 decode_constrained_packed_array (struct value *arr)
2017 arr = ada_coerce_ref (arr);
2019 /* If our value is a pointer, then dererence it. Make sure that
2020 this operation does not cause the target type to be fixed, as
2021 this would indirectly cause this array to be decoded. The rest
2022 of the routine assumes that the array hasn't been decoded yet,
2023 so we use the basic "value_ind" routine to perform the dereferencing,
2024 as opposed to using "ada_value_ind". */
2025 if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
2026 arr = value_ind (arr);
2028 type = decode_constrained_packed_array_type (value_type (arr));
2031 error (_("can't unpack array"));
2035 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2036 && ada_is_modular_type (value_type (arr)))
2038 /* This is a (right-justified) modular type representing a packed
2039 array with no wrapper. In order to interpret the value through
2040 the (left-justified) packed array type we just built, we must
2041 first left-justify it. */
2042 int bit_size, bit_pos;
2045 mod = ada_modulus (value_type (arr)) - 1;
2052 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2053 arr = ada_value_primitive_packed_val (arr, NULL,
2054 bit_pos / HOST_CHAR_BIT,
2055 bit_pos % HOST_CHAR_BIT,
2060 return coerce_unspec_val_to_type (arr, type);
2064 /* The value of the element of packed array ARR at the ARITY indices
2065 given in IND. ARR must be a simple array. */
2067 static struct value *
2068 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2071 int bits, elt_off, bit_off;
2072 long elt_total_bit_offset;
2073 struct type *elt_type;
2077 elt_total_bit_offset = 0;
2078 elt_type = ada_check_typedef (value_type (arr));
2079 for (i = 0; i < arity; i += 1)
2081 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2082 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2084 (_("attempt to do packed indexing of something other than a packed array"));
2087 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2088 LONGEST lowerbound, upperbound;
2091 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2093 lim_warning (_("don't know bounds of array"));
2094 lowerbound = upperbound = 0;
2097 idx = pos_atr (ind[i]);
2098 if (idx < lowerbound || idx > upperbound)
2099 lim_warning (_("packed array index %ld out of bounds"), (long) idx);
2100 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2101 elt_total_bit_offset += (idx - lowerbound) * bits;
2102 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2105 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2106 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2108 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2113 /* Non-zero iff TYPE includes negative integer values. */
2116 has_negatives (struct type *type)
2118 switch (TYPE_CODE (type))
2123 return !TYPE_UNSIGNED (type);
2124 case TYPE_CODE_RANGE:
2125 return TYPE_LOW_BOUND (type) < 0;
2130 /* Create a new value of type TYPE from the contents of OBJ starting
2131 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2132 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2133 assigning through the result will set the field fetched from.
2134 VALADDR is ignored unless OBJ is NULL, in which case,
2135 VALADDR+OFFSET must address the start of storage containing the
2136 packed value. The value returned in this case is never an lval.
2137 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2140 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2141 long offset, int bit_offset, int bit_size,
2145 int src, /* Index into the source area */
2146 targ, /* Index into the target area */
2147 srcBitsLeft, /* Number of source bits left to move */
2148 nsrc, ntarg, /* Number of source and target bytes */
2149 unusedLS, /* Number of bits in next significant
2150 byte of source that are unused */
2151 accumSize; /* Number of meaningful bits in accum */
2152 unsigned char *bytes; /* First byte containing data to unpack */
2153 unsigned char *unpacked;
2154 unsigned long accum; /* Staging area for bits being transferred */
2156 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2157 /* Transmit bytes from least to most significant; delta is the direction
2158 the indices move. */
2159 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
2161 type = ada_check_typedef (type);
2165 v = allocate_value (type);
2166 bytes = (unsigned char *) (valaddr + offset);
2168 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2171 value_address (obj) + offset);
2172 bytes = (unsigned char *) alloca (len);
2173 read_memory (value_address (v), bytes, len);
2177 v = allocate_value (type);
2178 bytes = (unsigned char *) value_contents (obj) + offset;
2185 set_value_component_location (v, obj);
2186 new_addr = value_address (obj) + offset;
2187 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2188 set_value_bitsize (v, bit_size);
2189 if (value_bitpos (v) >= HOST_CHAR_BIT)
2192 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2194 set_value_address (v, new_addr);
2197 set_value_bitsize (v, bit_size);
2198 unpacked = (unsigned char *) value_contents (v);
2200 srcBitsLeft = bit_size;
2202 ntarg = TYPE_LENGTH (type);
2206 memset (unpacked, 0, TYPE_LENGTH (type));
2209 else if (gdbarch_bits_big_endian (get_type_arch (type)))
2212 if (has_negatives (type)
2213 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2217 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2220 switch (TYPE_CODE (type))
2222 case TYPE_CODE_ARRAY:
2223 case TYPE_CODE_UNION:
2224 case TYPE_CODE_STRUCT:
2225 /* Non-scalar values must be aligned at a byte boundary... */
2227 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2228 /* ... And are placed at the beginning (most-significant) bytes
2230 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2235 targ = TYPE_LENGTH (type) - 1;
2241 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2244 unusedLS = bit_offset;
2247 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2254 /* Mask for removing bits of the next source byte that are not
2255 part of the value. */
2256 unsigned int unusedMSMask =
2257 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2259 /* Sign-extend bits for this byte. */
2260 unsigned int signMask = sign & ~unusedMSMask;
2263 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2264 accumSize += HOST_CHAR_BIT - unusedLS;
2265 if (accumSize >= HOST_CHAR_BIT)
2267 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2268 accumSize -= HOST_CHAR_BIT;
2269 accum >>= HOST_CHAR_BIT;
2273 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2280 accum |= sign << accumSize;
2281 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2282 accumSize -= HOST_CHAR_BIT;
2283 accum >>= HOST_CHAR_BIT;
2291 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2292 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2295 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2296 int src_offset, int n, int bits_big_endian_p)
2298 unsigned int accum, mask;
2299 int accum_bits, chunk_size;
2301 target += targ_offset / HOST_CHAR_BIT;
2302 targ_offset %= HOST_CHAR_BIT;
2303 source += src_offset / HOST_CHAR_BIT;
2304 src_offset %= HOST_CHAR_BIT;
2305 if (bits_big_endian_p)
2307 accum = (unsigned char) *source;
2309 accum_bits = HOST_CHAR_BIT - src_offset;
2315 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2316 accum_bits += HOST_CHAR_BIT;
2318 chunk_size = HOST_CHAR_BIT - targ_offset;
2321 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2322 mask = ((1 << chunk_size) - 1) << unused_right;
2325 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2327 accum_bits -= chunk_size;
2334 accum = (unsigned char) *source >> src_offset;
2336 accum_bits = HOST_CHAR_BIT - src_offset;
2340 accum = accum + ((unsigned char) *source << accum_bits);
2341 accum_bits += HOST_CHAR_BIT;
2343 chunk_size = HOST_CHAR_BIT - targ_offset;
2346 mask = ((1 << chunk_size) - 1) << targ_offset;
2347 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2349 accum_bits -= chunk_size;
2350 accum >>= chunk_size;
2357 /* Store the contents of FROMVAL into the location of TOVAL.
2358 Return a new value with the location of TOVAL and contents of
2359 FROMVAL. Handles assignment into packed fields that have
2360 floating-point or non-scalar types. */
2362 static struct value *
2363 ada_value_assign (struct value *toval, struct value *fromval)
2365 struct type *type = value_type (toval);
2366 int bits = value_bitsize (toval);
2368 toval = ada_coerce_ref (toval);
2369 fromval = ada_coerce_ref (fromval);
2371 if (ada_is_direct_array_type (value_type (toval)))
2372 toval = ada_coerce_to_simple_array (toval);
2373 if (ada_is_direct_array_type (value_type (fromval)))
2374 fromval = ada_coerce_to_simple_array (fromval);
2376 if (!deprecated_value_modifiable (toval))
2377 error (_("Left operand of assignment is not a modifiable lvalue."));
2379 if (VALUE_LVAL (toval) == lval_memory
2381 && (TYPE_CODE (type) == TYPE_CODE_FLT
2382 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2384 int len = (value_bitpos (toval)
2385 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2387 char *buffer = (char *) alloca (len);
2389 CORE_ADDR to_addr = value_address (toval);
2391 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2392 fromval = value_cast (type, fromval);
2394 read_memory (to_addr, buffer, len);
2395 from_size = value_bitsize (fromval);
2397 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2398 if (gdbarch_bits_big_endian (get_type_arch (type)))
2399 move_bits (buffer, value_bitpos (toval),
2400 value_contents (fromval), from_size - bits, bits, 1);
2402 move_bits (buffer, value_bitpos (toval),
2403 value_contents (fromval), 0, bits, 0);
2404 write_memory (to_addr, buffer, len);
2405 observer_notify_memory_changed (to_addr, len, buffer);
2407 val = value_copy (toval);
2408 memcpy (value_contents_raw (val), value_contents (fromval),
2409 TYPE_LENGTH (type));
2410 deprecated_set_value_type (val, type);
2415 return value_assign (toval, fromval);
2419 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2420 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2421 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2422 * COMPONENT, and not the inferior's memory. The current contents
2423 * of COMPONENT are ignored. */
2425 value_assign_to_component (struct value *container, struct value *component,
2428 LONGEST offset_in_container =
2429 (LONGEST) (value_address (component) - value_address (container));
2430 int bit_offset_in_container =
2431 value_bitpos (component) - value_bitpos (container);
2434 val = value_cast (value_type (component), val);
2436 if (value_bitsize (component) == 0)
2437 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2439 bits = value_bitsize (component);
2441 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2442 move_bits (value_contents_writeable (container) + offset_in_container,
2443 value_bitpos (container) + bit_offset_in_container,
2444 value_contents (val),
2445 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2448 move_bits (value_contents_writeable (container) + offset_in_container,
2449 value_bitpos (container) + bit_offset_in_container,
2450 value_contents (val), 0, bits, 0);
2453 /* The value of the element of array ARR at the ARITY indices given in IND.
2454 ARR may be either a simple array, GNAT array descriptor, or pointer
2458 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2462 struct type *elt_type;
2464 elt = ada_coerce_to_simple_array (arr);
2466 elt_type = ada_check_typedef (value_type (elt));
2467 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2468 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2469 return value_subscript_packed (elt, arity, ind);
2471 for (k = 0; k < arity; k += 1)
2473 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2474 error (_("too many subscripts (%d expected)"), k);
2475 elt = value_subscript (elt, pos_atr (ind[k]));
2480 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2481 value of the element of *ARR at the ARITY indices given in
2482 IND. Does not read the entire array into memory. */
2484 static struct value *
2485 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2490 for (k = 0; k < arity; k += 1)
2494 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2495 error (_("too many subscripts (%d expected)"), k);
2496 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2498 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2499 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2500 type = TYPE_TARGET_TYPE (type);
2503 return value_ind (arr);
2506 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2507 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2508 elements starting at index LOW. The lower bound of this array is LOW, as
2510 static struct value *
2511 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2514 CORE_ADDR base = value_as_address (array_ptr)
2515 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type)))
2516 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
2517 struct type *index_type =
2518 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
2520 struct type *slice_type =
2521 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2523 return value_at_lazy (slice_type, base);
2527 static struct value *
2528 ada_value_slice (struct value *array, int low, int high)
2530 struct type *type = value_type (array);
2531 struct type *index_type =
2532 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2533 struct type *slice_type =
2534 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2536 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2539 /* If type is a record type in the form of a standard GNAT array
2540 descriptor, returns the number of dimensions for type. If arr is a
2541 simple array, returns the number of "array of"s that prefix its
2542 type designation. Otherwise, returns 0. */
2545 ada_array_arity (struct type *type)
2552 type = desc_base_type (type);
2555 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2556 return desc_arity (desc_bounds_type (type));
2558 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2561 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2567 /* If TYPE is a record type in the form of a standard GNAT array
2568 descriptor or a simple array type, returns the element type for
2569 TYPE after indexing by NINDICES indices, or by all indices if
2570 NINDICES is -1. Otherwise, returns NULL. */
2573 ada_array_element_type (struct type *type, int nindices)
2575 type = desc_base_type (type);
2577 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2580 struct type *p_array_type;
2582 p_array_type = desc_data_target_type (type);
2584 k = ada_array_arity (type);
2588 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2589 if (nindices >= 0 && k > nindices)
2591 while (k > 0 && p_array_type != NULL)
2593 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2596 return p_array_type;
2598 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2600 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2602 type = TYPE_TARGET_TYPE (type);
2611 /* The type of nth index in arrays of given type (n numbering from 1).
2612 Does not examine memory. Throws an error if N is invalid or TYPE
2613 is not an array type. NAME is the name of the Ada attribute being
2614 evaluated ('range, 'first, 'last, or 'length); it is used in building
2615 the error message. */
2617 static struct type *
2618 ada_index_type (struct type *type, int n, const char *name)
2620 struct type *result_type;
2622 type = desc_base_type (type);
2624 if (n < 0 || n > ada_array_arity (type))
2625 error (_("invalid dimension number to '%s"), name);
2627 if (ada_is_simple_array_type (type))
2631 for (i = 1; i < n; i += 1)
2632 type = TYPE_TARGET_TYPE (type);
2633 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2634 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2635 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2636 perhaps stabsread.c would make more sense. */
2637 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2642 result_type = desc_index_type (desc_bounds_type (type), n);
2643 if (result_type == NULL)
2644 error (_("attempt to take bound of something that is not an array"));
2650 /* Given that arr is an array type, returns the lower bound of the
2651 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2652 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2653 array-descriptor type. It works for other arrays with bounds supplied
2654 by run-time quantities other than discriminants. */
2657 ada_array_bound_from_type (struct type * arr_type, int n, int which)
2659 struct type *type, *elt_type, *index_type_desc, *index_type;
2662 gdb_assert (which == 0 || which == 1);
2664 if (ada_is_constrained_packed_array_type (arr_type))
2665 arr_type = decode_constrained_packed_array_type (arr_type);
2667 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2668 return (LONGEST) - which;
2670 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2671 type = TYPE_TARGET_TYPE (arr_type);
2676 for (i = n; i > 1; i--)
2677 elt_type = TYPE_TARGET_TYPE (type);
2679 index_type_desc = ada_find_parallel_type (type, "___XA");
2680 ada_fixup_array_indexes_type (index_type_desc);
2681 if (index_type_desc != NULL)
2682 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2685 index_type = TYPE_INDEX_TYPE (elt_type);
2688 (LONGEST) (which == 0
2689 ? ada_discrete_type_low_bound (index_type)
2690 : ada_discrete_type_high_bound (index_type));
2693 /* Given that arr is an array value, returns the lower bound of the
2694 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2695 WHICH is 1. This routine will also work for arrays with bounds
2696 supplied by run-time quantities other than discriminants. */
2699 ada_array_bound (struct value *arr, int n, int which)
2701 struct type *arr_type = value_type (arr);
2703 if (ada_is_constrained_packed_array_type (arr_type))
2704 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
2705 else if (ada_is_simple_array_type (arr_type))
2706 return ada_array_bound_from_type (arr_type, n, which);
2708 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
2711 /* Given that arr is an array value, returns the length of the
2712 nth index. This routine will also work for arrays with bounds
2713 supplied by run-time quantities other than discriminants.
2714 Does not work for arrays indexed by enumeration types with representation
2715 clauses at the moment. */
2718 ada_array_length (struct value *arr, int n)
2720 struct type *arr_type = ada_check_typedef (value_type (arr));
2722 if (ada_is_constrained_packed_array_type (arr_type))
2723 return ada_array_length (decode_constrained_packed_array (arr), n);
2725 if (ada_is_simple_array_type (arr_type))
2726 return (ada_array_bound_from_type (arr_type, n, 1)
2727 - ada_array_bound_from_type (arr_type, n, 0) + 1);
2729 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2730 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
2733 /* An empty array whose type is that of ARR_TYPE (an array type),
2734 with bounds LOW to LOW-1. */
2736 static struct value *
2737 empty_array (struct type *arr_type, int low)
2739 struct type *index_type =
2740 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
2742 struct type *elt_type = ada_array_element_type (arr_type, 1);
2744 return allocate_value (create_array_type (NULL, elt_type, index_type));
2748 /* Name resolution */
2750 /* The "decoded" name for the user-definable Ada operator corresponding
2754 ada_decoded_op_name (enum exp_opcode op)
2758 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2760 if (ada_opname_table[i].op == op)
2761 return ada_opname_table[i].decoded;
2763 error (_("Could not find operator name for opcode"));
2767 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2768 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2769 undefined namespace) and converts operators that are
2770 user-defined into appropriate function calls. If CONTEXT_TYPE is
2771 non-null, it provides a preferred result type [at the moment, only
2772 type void has any effect---causing procedures to be preferred over
2773 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2774 return type is preferred. May change (expand) *EXP. */
2777 resolve (struct expression **expp, int void_context_p)
2779 struct type *context_type = NULL;
2783 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
2785 resolve_subexp (expp, &pc, 1, context_type);
2788 /* Resolve the operator of the subexpression beginning at
2789 position *POS of *EXPP. "Resolving" consists of replacing
2790 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2791 with their resolutions, replacing built-in operators with
2792 function calls to user-defined operators, where appropriate, and,
2793 when DEPROCEDURE_P is non-zero, converting function-valued variables
2794 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2795 are as in ada_resolve, above. */
2797 static struct value *
2798 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2799 struct type *context_type)
2803 struct expression *exp; /* Convenience: == *expp. */
2804 enum exp_opcode op = (*expp)->elts[pc].opcode;
2805 struct value **argvec; /* Vector of operand types (alloca'ed). */
2806 int nargs; /* Number of operands. */
2813 /* Pass one: resolve operands, saving their types and updating *pos,
2818 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2819 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2824 resolve_subexp (expp, pos, 0, NULL);
2826 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2831 resolve_subexp (expp, pos, 0, NULL);
2836 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
2839 case OP_ATR_MODULUS:
2849 case TERNOP_IN_RANGE:
2850 case BINOP_IN_BOUNDS:
2856 case OP_DISCRETE_RANGE:
2858 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2867 arg1 = resolve_subexp (expp, pos, 0, NULL);
2869 resolve_subexp (expp, pos, 1, NULL);
2871 resolve_subexp (expp, pos, 1, value_type (arg1));
2888 case BINOP_LOGICAL_AND:
2889 case BINOP_LOGICAL_OR:
2890 case BINOP_BITWISE_AND:
2891 case BINOP_BITWISE_IOR:
2892 case BINOP_BITWISE_XOR:
2895 case BINOP_NOTEQUAL:
2902 case BINOP_SUBSCRIPT:
2910 case UNOP_LOGICAL_NOT:
2926 case OP_INTERNALVAR:
2936 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2939 case STRUCTOP_STRUCT:
2940 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2953 error (_("Unexpected operator during name resolution"));
2956 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
2957 for (i = 0; i < nargs; i += 1)
2958 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
2962 /* Pass two: perform any resolution on principal operator. */
2969 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
2971 struct ada_symbol_info *candidates;
2975 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2976 (exp->elts[pc + 2].symbol),
2977 exp->elts[pc + 1].block, VAR_DOMAIN,
2980 if (n_candidates > 1)
2982 /* Types tend to get re-introduced locally, so if there
2983 are any local symbols that are not types, first filter
2986 for (j = 0; j < n_candidates; j += 1)
2987 switch (SYMBOL_CLASS (candidates[j].sym))
2992 case LOC_REGPARM_ADDR:
3000 if (j < n_candidates)
3003 while (j < n_candidates)
3005 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3007 candidates[j] = candidates[n_candidates - 1];
3016 if (n_candidates == 0)
3017 error (_("No definition found for %s"),
3018 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3019 else if (n_candidates == 1)
3021 else if (deprocedure_p
3022 && !is_nonfunction (candidates, n_candidates))
3024 i = ada_resolve_function
3025 (candidates, n_candidates, NULL, 0,
3026 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3029 error (_("Could not find a match for %s"),
3030 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3034 printf_filtered (_("Multiple matches for %s\n"),
3035 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3036 user_select_syms (candidates, n_candidates, 1);
3040 exp->elts[pc + 1].block = candidates[i].block;
3041 exp->elts[pc + 2].symbol = candidates[i].sym;
3042 if (innermost_block == NULL
3043 || contained_in (candidates[i].block, innermost_block))
3044 innermost_block = candidates[i].block;
3048 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3051 replace_operator_with_call (expp, pc, 0, 0,
3052 exp->elts[pc + 2].symbol,
3053 exp->elts[pc + 1].block);
3060 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3061 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3063 struct ada_symbol_info *candidates;
3067 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3068 (exp->elts[pc + 5].symbol),
3069 exp->elts[pc + 4].block, VAR_DOMAIN,
3071 if (n_candidates == 1)
3075 i = ada_resolve_function
3076 (candidates, n_candidates,
3078 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3081 error (_("Could not find a match for %s"),
3082 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3085 exp->elts[pc + 4].block = candidates[i].block;
3086 exp->elts[pc + 5].symbol = candidates[i].sym;
3087 if (innermost_block == NULL
3088 || contained_in (candidates[i].block, innermost_block))
3089 innermost_block = candidates[i].block;
3100 case BINOP_BITWISE_AND:
3101 case BINOP_BITWISE_IOR:
3102 case BINOP_BITWISE_XOR:
3104 case BINOP_NOTEQUAL:
3112 case UNOP_LOGICAL_NOT:
3114 if (possible_user_operator_p (op, argvec))
3116 struct ada_symbol_info *candidates;
3120 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3121 (struct block *) NULL, VAR_DOMAIN,
3123 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
3124 ada_decoded_op_name (op), NULL);
3128 replace_operator_with_call (expp, pc, nargs, 1,
3129 candidates[i].sym, candidates[i].block);
3140 return evaluate_subexp_type (exp, pos);
3143 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3144 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3146 /* The term "match" here is rather loose. The match is heuristic and
3150 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3152 ftype = ada_check_typedef (ftype);
3153 atype = ada_check_typedef (atype);
3155 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3156 ftype = TYPE_TARGET_TYPE (ftype);
3157 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3158 atype = TYPE_TARGET_TYPE (atype);
3160 switch (TYPE_CODE (ftype))
3163 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3165 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3166 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3167 TYPE_TARGET_TYPE (atype), 0);
3170 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3172 case TYPE_CODE_ENUM:
3173 case TYPE_CODE_RANGE:
3174 switch (TYPE_CODE (atype))
3177 case TYPE_CODE_ENUM:
3178 case TYPE_CODE_RANGE:
3184 case TYPE_CODE_ARRAY:
3185 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3186 || ada_is_array_descriptor_type (atype));
3188 case TYPE_CODE_STRUCT:
3189 if (ada_is_array_descriptor_type (ftype))
3190 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3191 || ada_is_array_descriptor_type (atype));
3193 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3194 && !ada_is_array_descriptor_type (atype));
3196 case TYPE_CODE_UNION:
3198 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3202 /* Return non-zero if the formals of FUNC "sufficiently match" the
3203 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3204 may also be an enumeral, in which case it is treated as a 0-
3205 argument function. */
3208 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3211 struct type *func_type = SYMBOL_TYPE (func);
3213 if (SYMBOL_CLASS (func) == LOC_CONST
3214 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3215 return (n_actuals == 0);
3216 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3219 if (TYPE_NFIELDS (func_type) != n_actuals)
3222 for (i = 0; i < n_actuals; i += 1)
3224 if (actuals[i] == NULL)
3228 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3230 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3232 if (!ada_type_match (ftype, atype, 1))
3239 /* False iff function type FUNC_TYPE definitely does not produce a value
3240 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3241 FUNC_TYPE is not a valid function type with a non-null return type
3242 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3245 return_match (struct type *func_type, struct type *context_type)
3247 struct type *return_type;
3249 if (func_type == NULL)
3252 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3253 return_type = base_type (TYPE_TARGET_TYPE (func_type));
3255 return_type = base_type (func_type);
3256 if (return_type == NULL)
3259 context_type = base_type (context_type);
3261 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3262 return context_type == NULL || return_type == context_type;
3263 else if (context_type == NULL)
3264 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3266 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3270 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3271 function (if any) that matches the types of the NARGS arguments in
3272 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3273 that returns that type, then eliminate matches that don't. If
3274 CONTEXT_TYPE is void and there is at least one match that does not
3275 return void, eliminate all matches that do.
3277 Asks the user if there is more than one match remaining. Returns -1
3278 if there is no such symbol or none is selected. NAME is used
3279 solely for messages. May re-arrange and modify SYMS in
3280 the process; the index returned is for the modified vector. */
3283 ada_resolve_function (struct ada_symbol_info syms[],
3284 int nsyms, struct value **args, int nargs,
3285 const char *name, struct type *context_type)
3289 int m; /* Number of hits */
3292 /* In the first pass of the loop, we only accept functions matching
3293 context_type. If none are found, we add a second pass of the loop
3294 where every function is accepted. */
3295 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3297 for (k = 0; k < nsyms; k += 1)
3299 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3301 if (ada_args_match (syms[k].sym, args, nargs)
3302 && (fallback || return_match (type, context_type)))
3314 printf_filtered (_("Multiple matches for %s\n"), name);
3315 user_select_syms (syms, m, 1);
3321 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3322 in a listing of choices during disambiguation (see sort_choices, below).
3323 The idea is that overloadings of a subprogram name from the
3324 same package should sort in their source order. We settle for ordering
3325 such symbols by their trailing number (__N or $N). */
3328 encoded_ordered_before (char *N0, char *N1)
3332 else if (N0 == NULL)
3338 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3340 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3342 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3343 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3348 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3351 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3353 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3354 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3356 return (strcmp (N0, N1) < 0);
3360 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3364 sort_choices (struct ada_symbol_info syms[], int nsyms)
3368 for (i = 1; i < nsyms; i += 1)
3370 struct ada_symbol_info sym = syms[i];
3373 for (j = i - 1; j >= 0; j -= 1)
3375 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3376 SYMBOL_LINKAGE_NAME (sym.sym)))
3378 syms[j + 1] = syms[j];
3384 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3385 by asking the user (if necessary), returning the number selected,
3386 and setting the first elements of SYMS items. Error if no symbols
3389 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3390 to be re-integrated one of these days. */
3393 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3396 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3398 int first_choice = (max_results == 1) ? 1 : 2;
3399 const char *select_mode = multiple_symbols_select_mode ();
3401 if (max_results < 1)
3402 error (_("Request to select 0 symbols!"));
3406 if (select_mode == multiple_symbols_cancel)
3408 canceled because the command is ambiguous\n\
3409 See set/show multiple-symbol."));
3411 /* If select_mode is "all", then return all possible symbols.
3412 Only do that if more than one symbol can be selected, of course.
3413 Otherwise, display the menu as usual. */
3414 if (select_mode == multiple_symbols_all && max_results > 1)
3417 printf_unfiltered (_("[0] cancel\n"));
3418 if (max_results > 1)
3419 printf_unfiltered (_("[1] all\n"));
3421 sort_choices (syms, nsyms);
3423 for (i = 0; i < nsyms; i += 1)
3425 if (syms[i].sym == NULL)
3428 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3430 struct symtab_and_line sal =
3431 find_function_start_sal (syms[i].sym, 1);
3433 if (sal.symtab == NULL)
3434 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3436 SYMBOL_PRINT_NAME (syms[i].sym),
3439 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3440 SYMBOL_PRINT_NAME (syms[i].sym),
3441 sal.symtab->filename, sal.line);
3447 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3448 && SYMBOL_TYPE (syms[i].sym) != NULL
3449 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3450 struct symtab *symtab = syms[i].sym->symtab;
3452 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3453 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3455 SYMBOL_PRINT_NAME (syms[i].sym),
3456 symtab->filename, SYMBOL_LINE (syms[i].sym));
3457 else if (is_enumeral
3458 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3460 printf_unfiltered (("[%d] "), i + first_choice);
3461 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3463 printf_unfiltered (_("'(%s) (enumeral)\n"),
3464 SYMBOL_PRINT_NAME (syms[i].sym));
3466 else if (symtab != NULL)
3467 printf_unfiltered (is_enumeral
3468 ? _("[%d] %s in %s (enumeral)\n")
3469 : _("[%d] %s at %s:?\n"),
3471 SYMBOL_PRINT_NAME (syms[i].sym),
3474 printf_unfiltered (is_enumeral
3475 ? _("[%d] %s (enumeral)\n")
3476 : _("[%d] %s at ?\n"),
3478 SYMBOL_PRINT_NAME (syms[i].sym));
3482 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3485 for (i = 0; i < n_chosen; i += 1)
3486 syms[i] = syms[chosen[i]];
3491 /* Read and validate a set of numeric choices from the user in the
3492 range 0 .. N_CHOICES-1. Place the results in increasing
3493 order in CHOICES[0 .. N-1], and return N.
3495 The user types choices as a sequence of numbers on one line
3496 separated by blanks, encoding them as follows:
3498 + A choice of 0 means to cancel the selection, throwing an error.
3499 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3500 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3502 The user is not allowed to choose more than MAX_RESULTS values.
3504 ANNOTATION_SUFFIX, if present, is used to annotate the input
3505 prompts (for use with the -f switch). */
3508 get_selections (int *choices, int n_choices, int max_results,
3509 int is_all_choice, char *annotation_suffix)
3514 int first_choice = is_all_choice ? 2 : 1;
3516 prompt = getenv ("PS2");
3520 args = command_line_input (prompt, 0, annotation_suffix);
3523 error_no_arg (_("one or more choice numbers"));
3527 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3528 order, as given in args. Choices are validated. */
3534 while (isspace (*args))
3536 if (*args == '\0' && n_chosen == 0)
3537 error_no_arg (_("one or more choice numbers"));
3538 else if (*args == '\0')
3541 choice = strtol (args, &args2, 10);
3542 if (args == args2 || choice < 0
3543 || choice > n_choices + first_choice - 1)
3544 error (_("Argument must be choice number"));
3548 error (_("cancelled"));
3550 if (choice < first_choice)
3552 n_chosen = n_choices;
3553 for (j = 0; j < n_choices; j += 1)
3557 choice -= first_choice;
3559 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3563 if (j < 0 || choice != choices[j])
3567 for (k = n_chosen - 1; k > j; k -= 1)
3568 choices[k + 1] = choices[k];
3569 choices[j + 1] = choice;
3574 if (n_chosen > max_results)
3575 error (_("Select no more than %d of the above"), max_results);
3580 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3581 on the function identified by SYM and BLOCK, and taking NARGS
3582 arguments. Update *EXPP as needed to hold more space. */
3585 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3586 int oplen, struct symbol *sym,
3587 struct block *block)
3589 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3590 symbol, -oplen for operator being replaced). */
3591 struct expression *newexp = (struct expression *)
3592 xmalloc (sizeof (struct expression)
3593 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3594 struct expression *exp = *expp;
3596 newexp->nelts = exp->nelts + 7 - oplen;
3597 newexp->language_defn = exp->language_defn;
3598 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3599 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3600 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3602 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3603 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3605 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3606 newexp->elts[pc + 4].block = block;
3607 newexp->elts[pc + 5].symbol = sym;
3613 /* Type-class predicates */
3615 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3619 numeric_type_p (struct type *type)
3625 switch (TYPE_CODE (type))
3630 case TYPE_CODE_RANGE:
3631 return (type == TYPE_TARGET_TYPE (type)
3632 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3639 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3642 integer_type_p (struct type *type)
3648 switch (TYPE_CODE (type))
3652 case TYPE_CODE_RANGE:
3653 return (type == TYPE_TARGET_TYPE (type)
3654 || integer_type_p (TYPE_TARGET_TYPE (type)));
3661 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3664 scalar_type_p (struct type *type)
3670 switch (TYPE_CODE (type))
3673 case TYPE_CODE_RANGE:
3674 case TYPE_CODE_ENUM:
3683 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3686 discrete_type_p (struct type *type)
3692 switch (TYPE_CODE (type))
3695 case TYPE_CODE_RANGE:
3696 case TYPE_CODE_ENUM:
3697 case TYPE_CODE_BOOL:
3705 /* Returns non-zero if OP with operands in the vector ARGS could be
3706 a user-defined function. Errs on the side of pre-defined operators
3707 (i.e., result 0). */
3710 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3712 struct type *type0 =
3713 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3714 struct type *type1 =
3715 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3729 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3733 case BINOP_BITWISE_AND:
3734 case BINOP_BITWISE_IOR:
3735 case BINOP_BITWISE_XOR:
3736 return (!(integer_type_p (type0) && integer_type_p (type1)));
3739 case BINOP_NOTEQUAL:
3744 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3747 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3750 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3754 case UNOP_LOGICAL_NOT:
3756 return (!numeric_type_p (type0));
3765 1. In the following, we assume that a renaming type's name may
3766 have an ___XD suffix. It would be nice if this went away at some
3768 2. We handle both the (old) purely type-based representation of
3769 renamings and the (new) variable-based encoding. At some point,
3770 it is devoutly to be hoped that the former goes away
3771 (FIXME: hilfinger-2007-07-09).
3772 3. Subprogram renamings are not implemented, although the XRS
3773 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3775 /* If SYM encodes a renaming,
3777 <renaming> renames <renamed entity>,
3779 sets *LEN to the length of the renamed entity's name,
3780 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3781 the string describing the subcomponent selected from the renamed
3782 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3783 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3784 are undefined). Otherwise, returns a value indicating the category
3785 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3786 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3787 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3788 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3789 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3790 may be NULL, in which case they are not assigned.
3792 [Currently, however, GCC does not generate subprogram renamings.] */
3794 enum ada_renaming_category
3795 ada_parse_renaming (struct symbol *sym,
3796 const char **renamed_entity, int *len,
3797 const char **renaming_expr)
3799 enum ada_renaming_category kind;
3804 return ADA_NOT_RENAMING;
3805 switch (SYMBOL_CLASS (sym))
3808 return ADA_NOT_RENAMING;
3810 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3811 renamed_entity, len, renaming_expr);
3815 case LOC_OPTIMIZED_OUT:
3816 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3818 return ADA_NOT_RENAMING;
3822 kind = ADA_OBJECT_RENAMING;
3826 kind = ADA_EXCEPTION_RENAMING;
3830 kind = ADA_PACKAGE_RENAMING;
3834 kind = ADA_SUBPROGRAM_RENAMING;
3838 return ADA_NOT_RENAMING;
3842 if (renamed_entity != NULL)
3843 *renamed_entity = info;
3844 suffix = strstr (info, "___XE");
3845 if (suffix == NULL || suffix == info)
3846 return ADA_NOT_RENAMING;
3848 *len = strlen (info) - strlen (suffix);
3850 if (renaming_expr != NULL)
3851 *renaming_expr = suffix;
3855 /* Assuming TYPE encodes a renaming according to the old encoding in
3856 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3857 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3858 ADA_NOT_RENAMING otherwise. */
3859 static enum ada_renaming_category
3860 parse_old_style_renaming (struct type *type,
3861 const char **renamed_entity, int *len,
3862 const char **renaming_expr)
3864 enum ada_renaming_category kind;
3869 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3870 || TYPE_NFIELDS (type) != 1)
3871 return ADA_NOT_RENAMING;
3873 name = type_name_no_tag (type);
3875 return ADA_NOT_RENAMING;
3877 name = strstr (name, "___XR");
3879 return ADA_NOT_RENAMING;
3884 kind = ADA_OBJECT_RENAMING;
3887 kind = ADA_EXCEPTION_RENAMING;
3890 kind = ADA_PACKAGE_RENAMING;
3893 kind = ADA_SUBPROGRAM_RENAMING;
3896 return ADA_NOT_RENAMING;
3899 info = TYPE_FIELD_NAME (type, 0);
3901 return ADA_NOT_RENAMING;
3902 if (renamed_entity != NULL)
3903 *renamed_entity = info;
3904 suffix = strstr (info, "___XE");
3905 if (renaming_expr != NULL)
3906 *renaming_expr = suffix + 5;
3907 if (suffix == NULL || suffix == info)
3908 return ADA_NOT_RENAMING;
3910 *len = suffix - info;
3916 /* Evaluation: Function Calls */
3918 /* Return an lvalue containing the value VAL. This is the identity on
3919 lvalues, and otherwise has the side-effect of allocating memory
3920 in the inferior where a copy of the value contents is copied. */
3922 static struct value *
3923 ensure_lval (struct value *val)
3925 if (VALUE_LVAL (val) == not_lval
3926 || VALUE_LVAL (val) == lval_internalvar)
3928 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
3929 const CORE_ADDR addr =
3930 value_as_long (value_allocate_space_in_inferior (len));
3932 set_value_address (val, addr);
3933 VALUE_LVAL (val) = lval_memory;
3934 write_memory (addr, value_contents (val), len);
3940 /* Return the value ACTUAL, converted to be an appropriate value for a
3941 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3942 allocating any necessary descriptors (fat pointers), or copies of
3943 values not residing in memory, updating it as needed. */
3946 ada_convert_actual (struct value *actual, struct type *formal_type0)
3948 struct type *actual_type = ada_check_typedef (value_type (actual));
3949 struct type *formal_type = ada_check_typedef (formal_type0);
3950 struct type *formal_target =
3951 TYPE_CODE (formal_type) == TYPE_CODE_PTR
3952 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
3953 struct type *actual_target =
3954 TYPE_CODE (actual_type) == TYPE_CODE_PTR
3955 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
3957 if (ada_is_array_descriptor_type (formal_target)
3958 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
3959 return make_array_descriptor (formal_type, actual);
3960 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
3961 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
3963 struct value *result;
3965 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
3966 && ada_is_array_descriptor_type (actual_target))
3967 result = desc_data (actual);
3968 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
3970 if (VALUE_LVAL (actual) != lval_memory)
3974 actual_type = ada_check_typedef (value_type (actual));
3975 val = allocate_value (actual_type);
3976 memcpy ((char *) value_contents_raw (val),
3977 (char *) value_contents (actual),
3978 TYPE_LENGTH (actual_type));
3979 actual = ensure_lval (val);
3981 result = value_addr (actual);
3985 return value_cast_pointers (formal_type, result);
3987 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
3988 return ada_value_ind (actual);
3993 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
3994 type TYPE. This is usually an inefficient no-op except on some targets
3995 (such as AVR) where the representation of a pointer and an address
3999 value_pointer (struct value *value, struct type *type)
4001 struct gdbarch *gdbarch = get_type_arch (type);
4002 unsigned len = TYPE_LENGTH (type);
4003 gdb_byte *buf = alloca (len);
4006 addr = value_address (value);
4007 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4008 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4013 /* Push a descriptor of type TYPE for array value ARR on the stack at
4014 *SP, updating *SP to reflect the new descriptor. Return either
4015 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4016 to-descriptor type rather than a descriptor type), a struct value *
4017 representing a pointer to this descriptor. */
4019 static struct value *
4020 make_array_descriptor (struct type *type, struct value *arr)
4022 struct type *bounds_type = desc_bounds_type (type);
4023 struct type *desc_type = desc_base_type (type);
4024 struct value *descriptor = allocate_value (desc_type);
4025 struct value *bounds = allocate_value (bounds_type);
4028 for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
4030 modify_field (value_type (bounds), value_contents_writeable (bounds),
4031 ada_array_bound (arr, i, 0),
4032 desc_bound_bitpos (bounds_type, i, 0),
4033 desc_bound_bitsize (bounds_type, i, 0));
4034 modify_field (value_type (bounds), value_contents_writeable (bounds),
4035 ada_array_bound (arr, i, 1),
4036 desc_bound_bitpos (bounds_type, i, 1),
4037 desc_bound_bitsize (bounds_type, i, 1));
4040 bounds = ensure_lval (bounds);
4042 modify_field (value_type (descriptor),
4043 value_contents_writeable (descriptor),
4044 value_pointer (ensure_lval (arr),
4045 TYPE_FIELD_TYPE (desc_type, 0)),
4046 fat_pntr_data_bitpos (desc_type),
4047 fat_pntr_data_bitsize (desc_type));
4049 modify_field (value_type (descriptor),
4050 value_contents_writeable (descriptor),
4051 value_pointer (bounds,
4052 TYPE_FIELD_TYPE (desc_type, 1)),
4053 fat_pntr_bounds_bitpos (desc_type),
4054 fat_pntr_bounds_bitsize (desc_type));
4056 descriptor = ensure_lval (descriptor);
4058 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4059 return value_addr (descriptor);
4064 /* Dummy definitions for an experimental caching module that is not
4065 * used in the public sources. */
4068 lookup_cached_symbol (const char *name, domain_enum namespace,
4069 struct symbol **sym, struct block **block)
4075 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
4076 struct block *block)
4082 /* Return the result of a standard (literal, C-like) lookup of NAME in
4083 given DOMAIN, visible from lexical block BLOCK. */
4085 static struct symbol *
4086 standard_lookup (const char *name, const struct block *block,
4091 if (lookup_cached_symbol (name, domain, &sym, NULL))
4093 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4094 cache_symbol (name, domain, sym, block_found);
4099 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4100 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4101 since they contend in overloading in the same way. */
4103 is_nonfunction (struct ada_symbol_info syms[], int n)
4107 for (i = 0; i < n; i += 1)
4108 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4109 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4110 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
4116 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4117 struct types. Otherwise, they may not. */
4120 equiv_types (struct type *type0, struct type *type1)
4124 if (type0 == NULL || type1 == NULL
4125 || TYPE_CODE (type0) != TYPE_CODE (type1))
4127 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4128 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4129 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4130 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4136 /* True iff SYM0 represents the same entity as SYM1, or one that is
4137 no more defined than that of SYM1. */
4140 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4144 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4145 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4148 switch (SYMBOL_CLASS (sym0))
4154 struct type *type0 = SYMBOL_TYPE (sym0);
4155 struct type *type1 = SYMBOL_TYPE (sym1);
4156 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4157 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4158 int len0 = strlen (name0);
4161 TYPE_CODE (type0) == TYPE_CODE (type1)
4162 && (equiv_types (type0, type1)
4163 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4164 && strncmp (name1 + len0, "___XV", 5) == 0));
4167 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4168 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4174 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4175 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4178 add_defn_to_vec (struct obstack *obstackp,
4180 struct block *block)
4183 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4185 /* Do not try to complete stub types, as the debugger is probably
4186 already scanning all symbols matching a certain name at the
4187 time when this function is called. Trying to replace the stub
4188 type by its associated full type will cause us to restart a scan
4189 which may lead to an infinite recursion. Instead, the client
4190 collecting the matching symbols will end up collecting several
4191 matches, with at least one of them complete. It can then filter
4192 out the stub ones if needed. */
4194 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4196 if (lesseq_defined_than (sym, prevDefns[i].sym))
4198 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4200 prevDefns[i].sym = sym;
4201 prevDefns[i].block = block;
4207 struct ada_symbol_info info;
4211 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4215 /* Number of ada_symbol_info structures currently collected in
4216 current vector in *OBSTACKP. */
4219 num_defns_collected (struct obstack *obstackp)
4221 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4224 /* Vector of ada_symbol_info structures currently collected in current
4225 vector in *OBSTACKP. If FINISH, close off the vector and return
4226 its final address. */
4228 static struct ada_symbol_info *
4229 defns_collected (struct obstack *obstackp, int finish)
4232 return obstack_finish (obstackp);
4234 return (struct ada_symbol_info *) obstack_base (obstackp);
4237 /* Return a minimal symbol matching NAME according to Ada decoding
4238 rules. Returns NULL if there is no such minimal symbol. Names
4239 prefixed with "standard__" are handled specially: "standard__" is
4240 first stripped off, and only static and global symbols are searched. */
4242 struct minimal_symbol *
4243 ada_lookup_simple_minsym (const char *name)
4245 struct objfile *objfile;
4246 struct minimal_symbol *msymbol;
4249 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4251 name += sizeof ("standard__") - 1;
4255 wild_match = (strstr (name, "__") == NULL);
4257 ALL_MSYMBOLS (objfile, msymbol)
4259 if (match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4260 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4267 /* For all subprograms that statically enclose the subprogram of the
4268 selected frame, add symbols matching identifier NAME in DOMAIN
4269 and their blocks to the list of data in OBSTACKP, as for
4270 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4274 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4275 const char *name, domain_enum namespace,
4280 /* True if TYPE is definitely an artificial type supplied to a symbol
4281 for which no debugging information was given in the symbol file. */
4284 is_nondebugging_type (struct type *type)
4286 char *name = ada_type_name (type);
4288 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4291 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4292 duplicate other symbols in the list (The only case I know of where
4293 this happens is when object files containing stabs-in-ecoff are
4294 linked with files containing ordinary ecoff debugging symbols (or no
4295 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4296 Returns the number of items in the modified list. */
4299 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4308 /* If two symbols have the same name and one of them is a stub type,
4309 the get rid of the stub. */
4311 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4312 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4314 for (j = 0; j < nsyms; j++)
4317 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4318 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4319 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4320 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4325 /* Two symbols with the same name, same class and same address
4326 should be identical. */
4328 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4329 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4330 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4332 for (j = 0; j < nsyms; j += 1)
4335 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4336 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4337 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4338 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4339 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4340 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4347 for (j = i + 1; j < nsyms; j += 1)
4348 syms[j - 1] = syms[j];
4357 /* Given a type that corresponds to a renaming entity, use the type name
4358 to extract the scope (package name or function name, fully qualified,
4359 and following the GNAT encoding convention) where this renaming has been
4360 defined. The string returned needs to be deallocated after use. */
4363 xget_renaming_scope (struct type *renaming_type)
4365 /* The renaming types adhere to the following convention:
4366 <scope>__<rename>___<XR extension>.
4367 So, to extract the scope, we search for the "___XR" extension,
4368 and then backtrack until we find the first "__". */
4370 const char *name = type_name_no_tag (renaming_type);
4371 char *suffix = strstr (name, "___XR");
4376 /* Now, backtrack a bit until we find the first "__". Start looking
4377 at suffix - 3, as the <rename> part is at least one character long. */
4379 for (last = suffix - 3; last > name; last--)
4380 if (last[0] == '_' && last[1] == '_')
4383 /* Make a copy of scope and return it. */
4385 scope_len = last - name;
4386 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4388 strncpy (scope, name, scope_len);
4389 scope[scope_len] = '\0';
4394 /* Return nonzero if NAME corresponds to a package name. */
4397 is_package_name (const char *name)
4399 /* Here, We take advantage of the fact that no symbols are generated
4400 for packages, while symbols are generated for each function.
4401 So the condition for NAME represent a package becomes equivalent
4402 to NAME not existing in our list of symbols. There is only one
4403 small complication with library-level functions (see below). */
4407 /* If it is a function that has not been defined at library level,
4408 then we should be able to look it up in the symbols. */
4409 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4412 /* Library-level function names start with "_ada_". See if function
4413 "_ada_" followed by NAME can be found. */
4415 /* Do a quick check that NAME does not contain "__", since library-level
4416 functions names cannot contain "__" in them. */
4417 if (strstr (name, "__") != NULL)
4420 fun_name = xstrprintf ("_ada_%s", name);
4422 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4425 /* Return nonzero if SYM corresponds to a renaming entity that is
4426 not visible from FUNCTION_NAME. */
4429 old_renaming_is_invisible (const struct symbol *sym, char *function_name)
4433 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4436 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4438 make_cleanup (xfree, scope);
4440 /* If the rename has been defined in a package, then it is visible. */
4441 if (is_package_name (scope))
4444 /* Check that the rename is in the current function scope by checking
4445 that its name starts with SCOPE. */
4447 /* If the function name starts with "_ada_", it means that it is
4448 a library-level function. Strip this prefix before doing the
4449 comparison, as the encoding for the renaming does not contain
4451 if (strncmp (function_name, "_ada_", 5) == 0)
4454 return (strncmp (function_name, scope, strlen (scope)) != 0);
4457 /* Remove entries from SYMS that corresponds to a renaming entity that
4458 is not visible from the function associated with CURRENT_BLOCK or
4459 that is superfluous due to the presence of more specific renaming
4460 information. Places surviving symbols in the initial entries of
4461 SYMS and returns the number of surviving symbols.
4464 First, in cases where an object renaming is implemented as a
4465 reference variable, GNAT may produce both the actual reference
4466 variable and the renaming encoding. In this case, we discard the
4469 Second, GNAT emits a type following a specified encoding for each renaming
4470 entity. Unfortunately, STABS currently does not support the definition
4471 of types that are local to a given lexical block, so all renamings types
4472 are emitted at library level. As a consequence, if an application
4473 contains two renaming entities using the same name, and a user tries to
4474 print the value of one of these entities, the result of the ada symbol
4475 lookup will also contain the wrong renaming type.
4477 This function partially covers for this limitation by attempting to
4478 remove from the SYMS list renaming symbols that should be visible
4479 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4480 method with the current information available. The implementation
4481 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4483 - When the user tries to print a rename in a function while there
4484 is another rename entity defined in a package: Normally, the
4485 rename in the function has precedence over the rename in the
4486 package, so the latter should be removed from the list. This is
4487 currently not the case.
4489 - This function will incorrectly remove valid renames if
4490 the CURRENT_BLOCK corresponds to a function which symbol name
4491 has been changed by an "Export" pragma. As a consequence,
4492 the user will be unable to print such rename entities. */
4495 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4496 int nsyms, const struct block *current_block)
4498 struct symbol *current_function;
4499 char *current_function_name;
4501 int is_new_style_renaming;
4503 /* If there is both a renaming foo___XR... encoded as a variable and
4504 a simple variable foo in the same block, discard the latter.
4505 First, zero out such symbols, then compress. */
4506 is_new_style_renaming = 0;
4507 for (i = 0; i < nsyms; i += 1)
4509 struct symbol *sym = syms[i].sym;
4510 struct block *block = syms[i].block;
4514 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4516 name = SYMBOL_LINKAGE_NAME (sym);
4517 suffix = strstr (name, "___XR");
4521 int name_len = suffix - name;
4524 is_new_style_renaming = 1;
4525 for (j = 0; j < nsyms; j += 1)
4526 if (i != j && syms[j].sym != NULL
4527 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4529 && block == syms[j].block)
4533 if (is_new_style_renaming)
4537 for (j = k = 0; j < nsyms; j += 1)
4538 if (syms[j].sym != NULL)
4546 /* Extract the function name associated to CURRENT_BLOCK.
4547 Abort if unable to do so. */
4549 if (current_block == NULL)
4552 current_function = block_linkage_function (current_block);
4553 if (current_function == NULL)
4556 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4557 if (current_function_name == NULL)
4560 /* Check each of the symbols, and remove it from the list if it is
4561 a type corresponding to a renaming that is out of the scope of
4562 the current block. */
4567 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4568 == ADA_OBJECT_RENAMING
4569 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4573 for (j = i + 1; j < nsyms; j += 1)
4574 syms[j - 1] = syms[j];
4584 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4585 whose name and domain match NAME and DOMAIN respectively.
4586 If no match was found, then extend the search to "enclosing"
4587 routines (in other words, if we're inside a nested function,
4588 search the symbols defined inside the enclosing functions).
4590 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4593 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4594 struct block *block, domain_enum domain,
4597 int block_depth = 0;
4599 while (block != NULL)
4602 ada_add_block_symbols (obstackp, block, name, domain, NULL, wild_match);
4604 /* If we found a non-function match, assume that's the one. */
4605 if (is_nonfunction (defns_collected (obstackp, 0),
4606 num_defns_collected (obstackp)))
4609 block = BLOCK_SUPERBLOCK (block);
4612 /* If no luck so far, try to find NAME as a local symbol in some lexically
4613 enclosing subprogram. */
4614 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4615 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match);
4618 /* An object of this type is used as the user_data argument when
4619 calling the map_matching_symbols method. */
4623 struct objfile *objfile;
4624 struct obstack *obstackp;
4625 struct symbol *arg_sym;
4629 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4630 to a list of symbols. DATA0 is a pointer to a struct match_data *
4631 containing the obstack that collects the symbol list, the file that SYM
4632 must come from, a flag indicating whether a non-argument symbol has
4633 been found in the current block, and the last argument symbol
4634 passed in SYM within the current block (if any). When SYM is null,
4635 marking the end of a block, the argument symbol is added if no
4636 other has been found. */
4639 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
4641 struct match_data *data = (struct match_data *) data0;
4645 if (!data->found_sym && data->arg_sym != NULL)
4646 add_defn_to_vec (data->obstackp,
4647 fixup_symbol_section (data->arg_sym, data->objfile),
4649 data->found_sym = 0;
4650 data->arg_sym = NULL;
4654 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4656 else if (SYMBOL_IS_ARGUMENT (sym))
4657 data->arg_sym = sym;
4660 data->found_sym = 1;
4661 add_defn_to_vec (data->obstackp,
4662 fixup_symbol_section (sym, data->objfile),
4669 /* Compare STRING1 to STRING2, with results as for strcmp.
4670 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4671 implies compare_names (STRING1, STRING2) (they may differ as to
4672 what symbols compare equal). */
4675 compare_names (const char *string1, const char *string2)
4677 while (*string1 != '\0' && *string2 != '\0')
4679 if (isspace (*string1) || isspace (*string2))
4680 return strcmp_iw_ordered (string1, string2);
4681 if (*string1 != *string2)
4689 return strcmp_iw_ordered (string1, string2);
4691 if (*string2 == '\0')
4693 if (is_name_suffix (string2))
4699 if (*string2 == '(')
4700 return strcmp_iw_ordered (string1, string2);
4702 return *string1 - *string2;
4706 /* Add to OBSTACKP all non-local symbols whose name and domain match
4707 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4708 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4711 add_nonlocal_symbols (struct obstack *obstackp, const char *name,
4712 domain_enum domain, int global,
4715 struct objfile *objfile;
4716 struct match_data data;
4718 data.obstackp = obstackp;
4719 data.arg_sym = NULL;
4721 ALL_OBJFILES (objfile)
4723 data.objfile = objfile;
4726 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4727 aux_add_nonlocal_symbols, &data,
4730 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
4731 aux_add_nonlocal_symbols, &data,
4732 full_match, compare_names);
4735 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
4737 ALL_OBJFILES (objfile)
4739 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
4740 strcpy (name1, "_ada_");
4741 strcpy (name1 + sizeof ("_ada_") - 1, name);
4742 data.objfile = objfile;
4743 objfile->sf->qf->map_matching_symbols (name1, domain, objfile, global,
4744 aux_add_nonlocal_symbols, &data,
4745 full_match, compare_names);
4750 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4751 scope and in global scopes, returning the number of matches. Sets
4752 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4753 indicating the symbols found and the blocks and symbol tables (if
4754 any) in which they were found. This vector are transient---good only to
4755 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4756 symbol match within the nest of blocks whose innermost member is BLOCK0,
4757 is the one match returned (no other matches in that or
4758 enclosing blocks is returned). If there are any matches in or
4759 surrounding BLOCK0, then these alone are returned. Otherwise, the
4760 search extends to global and file-scope (static) symbol tables.
4761 Names prefixed with "standard__" are handled specially: "standard__"
4762 is first stripped off, and only static and global symbols are searched. */
4765 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4766 domain_enum namespace,
4767 struct ada_symbol_info **results)
4770 struct block *block;
4776 obstack_free (&symbol_list_obstack, NULL);
4777 obstack_init (&symbol_list_obstack);
4781 /* Search specified block and its superiors. */
4783 wild_match = (strstr (name0, "__") == NULL);
4785 block = (struct block *) block0; /* FIXME: No cast ought to be
4786 needed, but adding const will
4787 have a cascade effect. */
4789 /* Special case: If the user specifies a symbol name inside package
4790 Standard, do a non-wild matching of the symbol name without
4791 the "standard__" prefix. This was primarily introduced in order
4792 to allow the user to specifically access the standard exceptions
4793 using, for instance, Standard.Constraint_Error when Constraint_Error
4794 is ambiguous (due to the user defining its own Constraint_Error
4795 entity inside its program). */
4796 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
4800 name = name0 + sizeof ("standard__") - 1;
4803 /* Check the non-global symbols. If we have ANY match, then we're done. */
4805 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
4807 if (num_defns_collected (&symbol_list_obstack) > 0)
4810 /* No non-global symbols found. Check our cache to see if we have
4811 already performed this search before. If we have, then return
4815 if (lookup_cached_symbol (name0, namespace, &sym, &block))
4818 add_defn_to_vec (&symbol_list_obstack, sym, block);
4822 /* Search symbols from all global blocks. */
4824 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
4827 /* Now add symbols from all per-file blocks if we've gotten no hits
4828 (not strictly correct, but perhaps better than an error). */
4830 if (num_defns_collected (&symbol_list_obstack) == 0)
4831 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
4835 ndefns = num_defns_collected (&symbol_list_obstack);
4836 *results = defns_collected (&symbol_list_obstack, 1);
4838 ndefns = remove_extra_symbols (*results, ndefns);
4841 cache_symbol (name0, namespace, NULL, NULL);
4843 if (ndefns == 1 && cacheIfUnique)
4844 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
4846 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
4852 ada_lookup_encoded_symbol (const char *name, const struct block *block0,
4853 domain_enum namespace, struct block **block_found)
4855 struct ada_symbol_info *candidates;
4858 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
4860 if (n_candidates == 0)
4863 if (block_found != NULL)
4864 *block_found = candidates[0].block;
4866 return fixup_symbol_section (candidates[0].sym, NULL);
4869 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4870 scope and in global scopes, or NULL if none. NAME is folded and
4871 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4872 choosing the first symbol if there are multiple choices.
4873 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4874 table in which the symbol was found (in both cases, these
4875 assignments occur only if the pointers are non-null). */
4877 ada_lookup_symbol (const char *name, const struct block *block0,
4878 domain_enum namespace, int *is_a_field_of_this)
4880 if (is_a_field_of_this != NULL)
4881 *is_a_field_of_this = 0;
4884 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
4885 block0, namespace, NULL);
4888 static struct symbol *
4889 ada_lookup_symbol_nonlocal (const char *name,
4890 const struct block *block,
4891 const domain_enum domain)
4893 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
4897 /* True iff STR is a possible encoded suffix of a normal Ada name
4898 that is to be ignored for matching purposes. Suffixes of parallel
4899 names (e.g., XVE) are not included here. Currently, the possible suffixes
4900 are given by any of the regular expressions:
4902 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4903 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4904 _E[0-9]+[bs]$ [protected object entry suffixes]
4905 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4907 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4908 match is performed. This sequence is used to differentiate homonyms,
4909 is an optional part of a valid name suffix. */
4912 is_name_suffix (const char *str)
4915 const char *matching;
4916 const int len = strlen (str);
4918 /* Skip optional leading __[0-9]+. */
4920 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
4923 while (isdigit (str[0]))
4929 if (str[0] == '.' || str[0] == '$')
4932 while (isdigit (matching[0]))
4934 if (matching[0] == '\0')
4940 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
4943 while (isdigit (matching[0]))
4945 if (matching[0] == '\0')
4950 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4951 with a N at the end. Unfortunately, the compiler uses the same
4952 convention for other internal types it creates. So treating
4953 all entity names that end with an "N" as a name suffix causes
4954 some regressions. For instance, consider the case of an enumerated
4955 type. To support the 'Image attribute, it creates an array whose
4957 Having a single character like this as a suffix carrying some
4958 information is a bit risky. Perhaps we should change the encoding
4959 to be something like "_N" instead. In the meantime, do not do
4960 the following check. */
4961 /* Protected Object Subprograms */
4962 if (len == 1 && str [0] == 'N')
4967 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
4970 while (isdigit (matching[0]))
4972 if ((matching[0] == 'b' || matching[0] == 's')
4973 && matching [1] == '\0')
4977 /* ??? We should not modify STR directly, as we are doing below. This
4978 is fine in this case, but may become problematic later if we find
4979 that this alternative did not work, and want to try matching
4980 another one from the begining of STR. Since we modified it, we
4981 won't be able to find the begining of the string anymore! */
4985 while (str[0] != '_' && str[0] != '\0')
4987 if (str[0] != 'n' && str[0] != 'b')
4993 if (str[0] == '\000')
4998 if (str[1] != '_' || str[2] == '\000')
5002 if (strcmp (str + 3, "JM") == 0)
5004 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5005 the LJM suffix in favor of the JM one. But we will
5006 still accept LJM as a valid suffix for a reasonable
5007 amount of time, just to allow ourselves to debug programs
5008 compiled using an older version of GNAT. */
5009 if (strcmp (str + 3, "LJM") == 0)
5013 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5014 || str[4] == 'U' || str[4] == 'P')
5016 if (str[4] == 'R' && str[5] != 'T')
5020 if (!isdigit (str[2]))
5022 for (k = 3; str[k] != '\0'; k += 1)
5023 if (!isdigit (str[k]) && str[k] != '_')
5027 if (str[0] == '$' && isdigit (str[1]))
5029 for (k = 2; str[k] != '\0'; k += 1)
5030 if (!isdigit (str[k]) && str[k] != '_')
5037 /* Return non-zero if the string starting at NAME and ending before
5038 NAME_END contains no capital letters. */
5041 is_valid_name_for_wild_match (const char *name0)
5043 const char *decoded_name = ada_decode (name0);
5046 /* If the decoded name starts with an angle bracket, it means that
5047 NAME0 does not follow the GNAT encoding format. It should then
5048 not be allowed as a possible wild match. */
5049 if (decoded_name[0] == '<')
5052 for (i=0; decoded_name[i] != '\0'; i++)
5053 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5059 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5060 that could start a simple name. Assumes that *NAMEP points into
5061 the string beginning at NAME0. */
5064 advance_wild_match (const char **namep, const char *name0, int target0)
5066 const char *name = *namep;
5076 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5079 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5084 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5085 || name[2] == target0))
5093 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5103 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5104 informational suffixes of NAME (i.e., for which is_name_suffix is
5105 true). Assumes that PATN is a lower-cased Ada simple name. */
5108 wild_match (const char *name, const char *patn)
5111 const char *name0 = name;
5115 const char *match = name;
5119 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5122 if (*p == '\0' && is_name_suffix (name))
5123 return match != name0 && !is_valid_name_for_wild_match (name0);
5125 if (name[-1] == '_')
5128 if (!advance_wild_match (&name, name0, *patn))
5133 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5134 informational suffix. */
5137 full_match (const char *sym_name, const char *search_name)
5139 return !match_name (sym_name, search_name, 0);
5143 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5144 vector *defn_symbols, updating the list of symbols in OBSTACKP
5145 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5146 OBJFILE is the section containing BLOCK.
5147 SYMTAB is recorded with each symbol added. */
5150 ada_add_block_symbols (struct obstack *obstackp,
5151 struct block *block, const char *name,
5152 domain_enum domain, struct objfile *objfile,
5155 struct dict_iterator iter;
5156 int name_len = strlen (name);
5157 /* A matching argument symbol, if any. */
5158 struct symbol *arg_sym;
5159 /* Set true when we find a matching non-argument symbol. */
5167 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5169 sym != NULL; sym = dict_iter_match_next (name, wild_match, &iter))
5171 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5172 SYMBOL_DOMAIN (sym), domain)
5173 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
5175 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5177 else if (SYMBOL_IS_ARGUMENT (sym))
5182 add_defn_to_vec (obstackp,
5183 fixup_symbol_section (sym, objfile),
5191 for (sym = dict_iter_match_first (BLOCK_DICT (block), name,
5193 sym != NULL; sym = dict_iter_match_next (name, full_match, &iter))
5195 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5196 SYMBOL_DOMAIN (sym), domain))
5198 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5200 if (SYMBOL_IS_ARGUMENT (sym))
5205 add_defn_to_vec (obstackp,
5206 fixup_symbol_section (sym, objfile),
5214 if (!found_sym && arg_sym != NULL)
5216 add_defn_to_vec (obstackp,
5217 fixup_symbol_section (arg_sym, objfile),
5226 ALL_BLOCK_SYMBOLS (block, iter, sym)
5228 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5229 SYMBOL_DOMAIN (sym), domain))
5233 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5236 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5238 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5243 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5245 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5247 if (SYMBOL_IS_ARGUMENT (sym))
5252 add_defn_to_vec (obstackp,
5253 fixup_symbol_section (sym, objfile),
5261 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5262 They aren't parameters, right? */
5263 if (!found_sym && arg_sym != NULL)
5265 add_defn_to_vec (obstackp,
5266 fixup_symbol_section (arg_sym, objfile),
5273 /* Symbol Completion */
5275 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5276 name in a form that's appropriate for the completion. The result
5277 does not need to be deallocated, but is only good until the next call.
5279 TEXT_LEN is equal to the length of TEXT.
5280 Perform a wild match if WILD_MATCH is set.
5281 ENCODED should be set if TEXT represents the start of a symbol name
5282 in its encoded form. */
5285 symbol_completion_match (const char *sym_name,
5286 const char *text, int text_len,
5287 int wild_match, int encoded)
5289 const int verbatim_match = (text[0] == '<');
5294 /* Strip the leading angle bracket. */
5299 /* First, test against the fully qualified name of the symbol. */
5301 if (strncmp (sym_name, text, text_len) == 0)
5304 if (match && !encoded)
5306 /* One needed check before declaring a positive match is to verify
5307 that iff we are doing a verbatim match, the decoded version
5308 of the symbol name starts with '<'. Otherwise, this symbol name
5309 is not a suitable completion. */
5310 const char *sym_name_copy = sym_name;
5311 int has_angle_bracket;
5313 sym_name = ada_decode (sym_name);
5314 has_angle_bracket = (sym_name[0] == '<');
5315 match = (has_angle_bracket == verbatim_match);
5316 sym_name = sym_name_copy;
5319 if (match && !verbatim_match)
5321 /* When doing non-verbatim match, another check that needs to
5322 be done is to verify that the potentially matching symbol name
5323 does not include capital letters, because the ada-mode would
5324 not be able to understand these symbol names without the
5325 angle bracket notation. */
5328 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5333 /* Second: Try wild matching... */
5335 if (!match && wild_match)
5337 /* Since we are doing wild matching, this means that TEXT
5338 may represent an unqualified symbol name. We therefore must
5339 also compare TEXT against the unqualified name of the symbol. */
5340 sym_name = ada_unqualified_name (ada_decode (sym_name));
5342 if (strncmp (sym_name, text, text_len) == 0)
5346 /* Finally: If we found a mach, prepare the result to return. */
5352 sym_name = add_angle_brackets (sym_name);
5355 sym_name = ada_decode (sym_name);
5360 DEF_VEC_P (char_ptr);
5362 /* A companion function to ada_make_symbol_completion_list().
5363 Check if SYM_NAME represents a symbol which name would be suitable
5364 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5365 it is appended at the end of the given string vector SV.
5367 ORIG_TEXT is the string original string from the user command
5368 that needs to be completed. WORD is the entire command on which
5369 completion should be performed. These two parameters are used to
5370 determine which part of the symbol name should be added to the
5372 if WILD_MATCH is set, then wild matching is performed.
5373 ENCODED should be set if TEXT represents a symbol name in its
5374 encoded formed (in which case the completion should also be
5378 symbol_completion_add (VEC(char_ptr) **sv,
5379 const char *sym_name,
5380 const char *text, int text_len,
5381 const char *orig_text, const char *word,
5382 int wild_match, int encoded)
5384 const char *match = symbol_completion_match (sym_name, text, text_len,
5385 wild_match, encoded);
5391 /* We found a match, so add the appropriate completion to the given
5394 if (word == orig_text)
5396 completion = xmalloc (strlen (match) + 5);
5397 strcpy (completion, match);
5399 else if (word > orig_text)
5401 /* Return some portion of sym_name. */
5402 completion = xmalloc (strlen (match) + 5);
5403 strcpy (completion, match + (word - orig_text));
5407 /* Return some of ORIG_TEXT plus sym_name. */
5408 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5409 strncpy (completion, word, orig_text - word);
5410 completion[orig_text - word] = '\0';
5411 strcat (completion, match);
5414 VEC_safe_push (char_ptr, *sv, completion);
5417 /* An object of this type is passed as the user_data argument to the
5418 map_partial_symbol_names method. */
5419 struct add_partial_datum
5421 VEC(char_ptr) **completions;
5430 /* A callback for map_partial_symbol_names. */
5432 ada_add_partial_symbol_completions (const char *name, void *user_data)
5434 struct add_partial_datum *data = user_data;
5436 symbol_completion_add (data->completions, name,
5437 data->text, data->text_len, data->text0, data->word,
5438 data->wild_match, data->encoded);
5441 /* Return a list of possible symbol names completing TEXT0. The list
5442 is NULL terminated. WORD is the entire command on which completion
5446 ada_make_symbol_completion_list (char *text0, char *word)
5452 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5455 struct minimal_symbol *msymbol;
5456 struct objfile *objfile;
5457 struct block *b, *surrounding_static_block = 0;
5459 struct dict_iterator iter;
5461 if (text0[0] == '<')
5463 text = xstrdup (text0);
5464 make_cleanup (xfree, text);
5465 text_len = strlen (text);
5471 text = xstrdup (ada_encode (text0));
5472 make_cleanup (xfree, text);
5473 text_len = strlen (text);
5474 for (i = 0; i < text_len; i++)
5475 text[i] = tolower (text[i]);
5477 encoded = (strstr (text0, "__") != NULL);
5478 /* If the name contains a ".", then the user is entering a fully
5479 qualified entity name, and the match must not be done in wild
5480 mode. Similarly, if the user wants to complete what looks like
5481 an encoded name, the match must not be done in wild mode. */
5482 wild_match = (strchr (text0, '.') == NULL && !encoded);
5485 /* First, look at the partial symtab symbols. */
5487 struct add_partial_datum data;
5489 data.completions = &completions;
5491 data.text_len = text_len;
5494 data.wild_match = wild_match;
5495 data.encoded = encoded;
5496 map_partial_symbol_names (ada_add_partial_symbol_completions, &data);
5499 /* At this point scan through the misc symbol vectors and add each
5500 symbol you find to the list. Eventually we want to ignore
5501 anything that isn't a text symbol (everything else will be
5502 handled by the psymtab code above). */
5504 ALL_MSYMBOLS (objfile, msymbol)
5507 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5508 text, text_len, text0, word, wild_match, encoded);
5511 /* Search upwards from currently selected frame (so that we can
5512 complete on local vars. */
5514 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5516 if (!BLOCK_SUPERBLOCK (b))
5517 surrounding_static_block = b; /* For elmin of dups */
5519 ALL_BLOCK_SYMBOLS (b, iter, sym)
5521 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5522 text, text_len, text0, word,
5523 wild_match, encoded);
5527 /* Go through the symtabs and check the externs and statics for
5528 symbols which match. */
5530 ALL_SYMTABS (objfile, s)
5533 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5534 ALL_BLOCK_SYMBOLS (b, iter, sym)
5536 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5537 text, text_len, text0, word,
5538 wild_match, encoded);
5542 ALL_SYMTABS (objfile, s)
5545 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5546 /* Don't do this block twice. */
5547 if (b == surrounding_static_block)
5549 ALL_BLOCK_SYMBOLS (b, iter, sym)
5551 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5552 text, text_len, text0, word,
5553 wild_match, encoded);
5557 /* Append the closing NULL entry. */
5558 VEC_safe_push (char_ptr, completions, NULL);
5560 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5561 return the copy. It's unfortunate that we have to make a copy
5562 of an array that we're about to destroy, but there is nothing much
5563 we can do about it. Fortunately, it's typically not a very large
5566 const size_t completions_size =
5567 VEC_length (char_ptr, completions) * sizeof (char *);
5568 char **result = malloc (completions_size);
5570 memcpy (result, VEC_address (char_ptr, completions), completions_size);
5572 VEC_free (char_ptr, completions);
5579 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5580 for tagged types. */
5583 ada_is_dispatch_table_ptr_type (struct type *type)
5587 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5590 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5594 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5597 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5598 to be invisible to users. */
5601 ada_is_ignored_field (struct type *type, int field_num)
5603 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5606 /* Check the name of that field. */
5608 const char *name = TYPE_FIELD_NAME (type, field_num);
5610 /* Anonymous field names should not be printed.
5611 brobecker/2007-02-20: I don't think this can actually happen
5612 but we don't want to print the value of annonymous fields anyway. */
5616 /* A field named "_parent" is internally generated by GNAT for
5617 tagged types, and should not be printed either. */
5618 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5622 /* If this is the dispatch table of a tagged type, then ignore. */
5623 if (ada_is_tagged_type (type, 1)
5624 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5627 /* Not a special field, so it should not be ignored. */
5631 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5632 pointer or reference type whose ultimate target has a tag field. */
5635 ada_is_tagged_type (struct type *type, int refok)
5637 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5640 /* True iff TYPE represents the type of X'Tag */
5643 ada_is_tag_type (struct type *type)
5645 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5649 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5651 return (name != NULL
5652 && strcmp (name, "ada__tags__dispatch_table") == 0);
5656 /* The type of the tag on VAL. */
5659 ada_tag_type (struct value *val)
5661 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
5664 /* The value of the tag on VAL. */
5667 ada_value_tag (struct value *val)
5669 return ada_value_struct_elt (val, "_tag", 0);
5672 /* The value of the tag on the object of type TYPE whose contents are
5673 saved at VALADDR, if it is non-null, or is at memory address
5676 static struct value *
5677 value_tag_from_contents_and_address (struct type *type,
5678 const gdb_byte *valaddr,
5681 int tag_byte_offset;
5682 struct type *tag_type;
5684 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5687 const gdb_byte *valaddr1 = ((valaddr == NULL)
5689 : valaddr + tag_byte_offset);
5690 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5692 return value_from_contents_and_address (tag_type, valaddr1, address1);
5697 static struct type *
5698 type_from_tag (struct value *tag)
5700 const char *type_name = ada_tag_name (tag);
5702 if (type_name != NULL)
5703 return ada_find_any_type (ada_encode (type_name));
5714 static int ada_tag_name_1 (void *);
5715 static int ada_tag_name_2 (struct tag_args *);
5717 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5718 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5719 The value stored in ARGS->name is valid until the next call to
5723 ada_tag_name_1 (void *args0)
5725 struct tag_args *args = (struct tag_args *) args0;
5726 static char name[1024];
5731 val = ada_value_struct_elt (args->tag, "tsd", 1);
5733 return ada_tag_name_2 (args);
5734 val = ada_value_struct_elt (val, "expanded_name", 1);
5737 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5738 for (p = name; *p != '\0'; p += 1)
5745 /* Return the "ada__tags__type_specific_data" type. */
5747 static struct type *
5748 ada_get_tsd_type (struct inferior *inf)
5750 struct ada_inferior_data *data = get_ada_inferior_data (inf);
5752 if (data->tsd_type == 0)
5753 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
5754 return data->tsd_type;
5757 /* Utility function for ada_tag_name_1 that tries the second
5758 representation for the dispatch table (in which there is no
5759 explicit 'tsd' field in the referent of the tag pointer, and instead
5760 the tsd pointer is stored just before the dispatch table. */
5763 ada_tag_name_2 (struct tag_args *args)
5765 struct type *info_type;
5766 static char name[1024];
5768 struct value *val, *valp;
5771 info_type = ada_get_tsd_type (current_inferior());
5772 if (info_type == NULL)
5774 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
5775 valp = value_cast (info_type, args->tag);
5778 val = value_ind (value_ptradd (valp, -1));
5781 val = ada_value_struct_elt (val, "expanded_name", 1);
5784 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5785 for (p = name; *p != '\0'; p += 1)
5792 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5796 ada_tag_name (struct value *tag)
5798 struct tag_args args;
5800 if (!ada_is_tag_type (value_type (tag)))
5804 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
5808 /* The parent type of TYPE, or NULL if none. */
5811 ada_parent_type (struct type *type)
5815 type = ada_check_typedef (type);
5817 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
5820 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5821 if (ada_is_parent_field (type, i))
5823 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
5825 /* If the _parent field is a pointer, then dereference it. */
5826 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
5827 parent_type = TYPE_TARGET_TYPE (parent_type);
5828 /* If there is a parallel XVS type, get the actual base type. */
5829 parent_type = ada_get_base_type (parent_type);
5831 return ada_check_typedef (parent_type);
5837 /* True iff field number FIELD_NUM of structure type TYPE contains the
5838 parent-type (inherited) fields of a derived type. Assumes TYPE is
5839 a structure type with at least FIELD_NUM+1 fields. */
5842 ada_is_parent_field (struct type *type, int field_num)
5844 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5846 return (name != NULL
5847 && (strncmp (name, "PARENT", 6) == 0
5848 || strncmp (name, "_parent", 7) == 0));
5851 /* True iff field number FIELD_NUM of structure type TYPE is a
5852 transparent wrapper field (which should be silently traversed when doing
5853 field selection and flattened when printing). Assumes TYPE is a
5854 structure type with at least FIELD_NUM+1 fields. Such fields are always
5858 ada_is_wrapper_field (struct type *type, int field_num)
5860 const char *name = TYPE_FIELD_NAME (type, field_num);
5862 return (name != NULL
5863 && (strncmp (name, "PARENT", 6) == 0
5864 || strcmp (name, "REP") == 0
5865 || strncmp (name, "_parent", 7) == 0
5866 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
5869 /* True iff field number FIELD_NUM of structure or union type TYPE
5870 is a variant wrapper. Assumes TYPE is a structure type with at least
5871 FIELD_NUM+1 fields. */
5874 ada_is_variant_part (struct type *type, int field_num)
5876 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5878 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
5879 || (is_dynamic_field (type, field_num)
5880 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
5881 == TYPE_CODE_UNION)));
5884 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5885 whose discriminants are contained in the record type OUTER_TYPE,
5886 returns the type of the controlling discriminant for the variant.
5887 May return NULL if the type could not be found. */
5890 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
5892 char *name = ada_variant_discrim_name (var_type);
5894 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
5897 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5898 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5899 represents a 'when others' clause; otherwise 0. */
5902 ada_is_others_clause (struct type *type, int field_num)
5904 const char *name = TYPE_FIELD_NAME (type, field_num);
5906 return (name != NULL && name[0] == 'O');
5909 /* Assuming that TYPE0 is the type of the variant part of a record,
5910 returns the name of the discriminant controlling the variant.
5911 The value is valid until the next call to ada_variant_discrim_name. */
5914 ada_variant_discrim_name (struct type *type0)
5916 static char *result = NULL;
5917 static size_t result_len = 0;
5920 const char *discrim_end;
5921 const char *discrim_start;
5923 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
5924 type = TYPE_TARGET_TYPE (type0);
5928 name = ada_type_name (type);
5930 if (name == NULL || name[0] == '\000')
5933 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
5936 if (strncmp (discrim_end, "___XVN", 6) == 0)
5939 if (discrim_end == name)
5942 for (discrim_start = discrim_end; discrim_start != name + 3;
5945 if (discrim_start == name + 1)
5947 if ((discrim_start > name + 3
5948 && strncmp (discrim_start - 3, "___", 3) == 0)
5949 || discrim_start[-1] == '.')
5953 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
5954 strncpy (result, discrim_start, discrim_end - discrim_start);
5955 result[discrim_end - discrim_start] = '\0';
5959 /* Scan STR for a subtype-encoded number, beginning at position K.
5960 Put the position of the character just past the number scanned in
5961 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5962 Return 1 if there was a valid number at the given position, and 0
5963 otherwise. A "subtype-encoded" number consists of the absolute value
5964 in decimal, followed by the letter 'm' to indicate a negative number.
5965 Assumes 0m does not occur. */
5968 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
5972 if (!isdigit (str[k]))
5975 /* Do it the hard way so as not to make any assumption about
5976 the relationship of unsigned long (%lu scan format code) and
5979 while (isdigit (str[k]))
5981 RU = RU * 10 + (str[k] - '0');
5988 *R = (-(LONGEST) (RU - 1)) - 1;
5994 /* NOTE on the above: Technically, C does not say what the results of
5995 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5996 number representable as a LONGEST (although either would probably work
5997 in most implementations). When RU>0, the locution in the then branch
5998 above is always equivalent to the negative of RU. */
6005 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6006 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6007 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6010 ada_in_variant (LONGEST val, struct type *type, int field_num)
6012 const char *name = TYPE_FIELD_NAME (type, field_num);
6026 if (!ada_scan_number (name, p + 1, &W, &p))
6036 if (!ada_scan_number (name, p + 1, &L, &p)
6037 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6039 if (val >= L && val <= U)
6051 /* FIXME: Lots of redundancy below. Try to consolidate. */
6053 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6054 ARG_TYPE, extract and return the value of one of its (non-static)
6055 fields. FIELDNO says which field. Differs from value_primitive_field
6056 only in that it can handle packed values of arbitrary type. */
6058 static struct value *
6059 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
6060 struct type *arg_type)
6064 arg_type = ada_check_typedef (arg_type);
6065 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6067 /* Handle packed fields. */
6069 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6071 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6072 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
6074 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
6075 offset + bit_pos / 8,
6076 bit_pos % 8, bit_size, type);
6079 return value_primitive_field (arg1, offset, fieldno, arg_type);
6082 /* Find field with name NAME in object of type TYPE. If found,
6083 set the following for each argument that is non-null:
6084 - *FIELD_TYPE_P to the field's type;
6085 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6086 an object of that type;
6087 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6088 - *BIT_SIZE_P to its size in bits if the field is packed, and
6090 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6091 fields up to but not including the desired field, or by the total
6092 number of fields if not found. A NULL value of NAME never
6093 matches; the function just counts visible fields in this case.
6095 Returns 1 if found, 0 otherwise. */
6098 find_struct_field (char *name, struct type *type, int offset,
6099 struct type **field_type_p,
6100 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6105 type = ada_check_typedef (type);
6107 if (field_type_p != NULL)
6108 *field_type_p = NULL;
6109 if (byte_offset_p != NULL)
6111 if (bit_offset_p != NULL)
6113 if (bit_size_p != NULL)
6116 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6118 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6119 int fld_offset = offset + bit_pos / 8;
6120 char *t_field_name = TYPE_FIELD_NAME (type, i);
6122 if (t_field_name == NULL)
6125 else if (name != NULL && field_name_match (t_field_name, name))
6127 int bit_size = TYPE_FIELD_BITSIZE (type, i);
6129 if (field_type_p != NULL)
6130 *field_type_p = TYPE_FIELD_TYPE (type, i);
6131 if (byte_offset_p != NULL)
6132 *byte_offset_p = fld_offset;
6133 if (bit_offset_p != NULL)
6134 *bit_offset_p = bit_pos % 8;
6135 if (bit_size_p != NULL)
6136 *bit_size_p = bit_size;
6139 else if (ada_is_wrapper_field (type, i))
6141 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6142 field_type_p, byte_offset_p, bit_offset_p,
6143 bit_size_p, index_p))
6146 else if (ada_is_variant_part (type, i))
6148 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6151 struct type *field_type
6152 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6154 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6156 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6158 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6159 field_type_p, byte_offset_p,
6160 bit_offset_p, bit_size_p, index_p))
6164 else if (index_p != NULL)
6170 /* Number of user-visible fields in record type TYPE. */
6173 num_visible_fields (struct type *type)
6178 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6182 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6183 and search in it assuming it has (class) type TYPE.
6184 If found, return value, else return NULL.
6186 Searches recursively through wrapper fields (e.g., '_parent'). */
6188 static struct value *
6189 ada_search_struct_field (char *name, struct value *arg, int offset,
6194 type = ada_check_typedef (type);
6195 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6197 char *t_field_name = TYPE_FIELD_NAME (type, i);
6199 if (t_field_name == NULL)
6202 else if (field_name_match (t_field_name, name))
6203 return ada_value_primitive_field (arg, offset, i, type);
6205 else if (ada_is_wrapper_field (type, i))
6207 struct value *v = /* Do not let indent join lines here. */
6208 ada_search_struct_field (name, arg,
6209 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6210 TYPE_FIELD_TYPE (type, i));
6216 else if (ada_is_variant_part (type, i))
6218 /* PNH: Do we ever get here? See find_struct_field. */
6220 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6222 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6224 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6226 struct value *v = ada_search_struct_field /* Force line break. */
6228 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6229 TYPE_FIELD_TYPE (field_type, j));
6239 static struct value *ada_index_struct_field_1 (int *, struct value *,
6240 int, struct type *);
6243 /* Return field #INDEX in ARG, where the index is that returned by
6244 * find_struct_field through its INDEX_P argument. Adjust the address
6245 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6246 * If found, return value, else return NULL. */
6248 static struct value *
6249 ada_index_struct_field (int index, struct value *arg, int offset,
6252 return ada_index_struct_field_1 (&index, arg, offset, type);
6256 /* Auxiliary function for ada_index_struct_field. Like
6257 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6260 static struct value *
6261 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6265 type = ada_check_typedef (type);
6267 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6269 if (TYPE_FIELD_NAME (type, i) == NULL)
6271 else if (ada_is_wrapper_field (type, i))
6273 struct value *v = /* Do not let indent join lines here. */
6274 ada_index_struct_field_1 (index_p, arg,
6275 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6276 TYPE_FIELD_TYPE (type, i));
6282 else if (ada_is_variant_part (type, i))
6284 /* PNH: Do we ever get here? See ada_search_struct_field,
6285 find_struct_field. */
6286 error (_("Cannot assign this kind of variant record"));
6288 else if (*index_p == 0)
6289 return ada_value_primitive_field (arg, offset, i, type);
6296 /* Given ARG, a value of type (pointer or reference to a)*
6297 structure/union, extract the component named NAME from the ultimate
6298 target structure/union and return it as a value with its
6301 The routine searches for NAME among all members of the structure itself
6302 and (recursively) among all members of any wrapper members
6305 If NO_ERR, then simply return NULL in case of error, rather than
6309 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6311 struct type *t, *t1;
6315 t1 = t = ada_check_typedef (value_type (arg));
6316 if (TYPE_CODE (t) == TYPE_CODE_REF)
6318 t1 = TYPE_TARGET_TYPE (t);
6321 t1 = ada_check_typedef (t1);
6322 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6324 arg = coerce_ref (arg);
6329 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6331 t1 = TYPE_TARGET_TYPE (t);
6334 t1 = ada_check_typedef (t1);
6335 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6337 arg = value_ind (arg);
6344 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6348 v = ada_search_struct_field (name, arg, 0, t);
6351 int bit_offset, bit_size, byte_offset;
6352 struct type *field_type;
6355 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6356 address = value_as_address (arg);
6358 address = unpack_pointer (t, value_contents (arg));
6360 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6361 if (find_struct_field (name, t1, 0,
6362 &field_type, &byte_offset, &bit_offset,
6367 if (TYPE_CODE (t) == TYPE_CODE_REF)
6368 arg = ada_coerce_ref (arg);
6370 arg = ada_value_ind (arg);
6371 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6372 bit_offset, bit_size,
6376 v = value_at_lazy (field_type, address + byte_offset);
6380 if (v != NULL || no_err)
6383 error (_("There is no member named %s."), name);
6389 error (_("Attempt to extract a component of a value that is not a record."));
6392 /* Given a type TYPE, look up the type of the component of type named NAME.
6393 If DISPP is non-null, add its byte displacement from the beginning of a
6394 structure (pointed to by a value) of type TYPE to *DISPP (does not
6395 work for packed fields).
6397 Matches any field whose name has NAME as a prefix, possibly
6400 TYPE can be either a struct or union. If REFOK, TYPE may also
6401 be a (pointer or reference)+ to a struct or union, and the
6402 ultimate target type will be searched.
6404 Looks recursively into variant clauses and parent types.
6406 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6407 TYPE is not a type of the right kind. */
6409 static struct type *
6410 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6411 int noerr, int *dispp)
6418 if (refok && type != NULL)
6421 type = ada_check_typedef (type);
6422 if (TYPE_CODE (type) != TYPE_CODE_PTR
6423 && TYPE_CODE (type) != TYPE_CODE_REF)
6425 type = TYPE_TARGET_TYPE (type);
6429 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6430 && TYPE_CODE (type) != TYPE_CODE_UNION))
6436 target_terminal_ours ();
6437 gdb_flush (gdb_stdout);
6439 error (_("Type (null) is not a structure or union type"));
6442 /* XXX: type_sprint */
6443 fprintf_unfiltered (gdb_stderr, _("Type "));
6444 type_print (type, "", gdb_stderr, -1);
6445 error (_(" is not a structure or union type"));
6450 type = to_static_fixed_type (type);
6452 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6454 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))
6464 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
6465 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6468 else if (ada_is_wrapper_field (type, i))
6471 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6476 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6481 else if (ada_is_variant_part (type, i))
6484 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6487 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6489 /* FIXME pnh 2008/01/26: We check for a field that is
6490 NOT wrapped in a struct, since the compiler sometimes
6491 generates these for unchecked variant types. Revisit
6492 if the compiler changes this practice. */
6493 char *v_field_name = TYPE_FIELD_NAME (field_type, j);
6495 if (v_field_name != NULL
6496 && field_name_match (v_field_name, name))
6497 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6499 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
6505 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6516 target_terminal_ours ();
6517 gdb_flush (gdb_stdout);
6520 /* XXX: type_sprint */
6521 fprintf_unfiltered (gdb_stderr, _("Type "));
6522 type_print (type, "", gdb_stderr, -1);
6523 error (_(" has no component named <null>"));
6527 /* XXX: type_sprint */
6528 fprintf_unfiltered (gdb_stderr, _("Type "));
6529 type_print (type, "", gdb_stderr, -1);
6530 error (_(" has no component named %s"), name);
6537 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6538 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6539 represents an unchecked union (that is, the variant part of a
6540 record that is named in an Unchecked_Union pragma). */
6543 is_unchecked_variant (struct type *var_type, struct type *outer_type)
6545 char *discrim_name = ada_variant_discrim_name (var_type);
6547 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6552 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6553 within a value of type OUTER_TYPE that is stored in GDB at
6554 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6555 numbering from 0) is applicable. Returns -1 if none are. */
6558 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
6559 const gdb_byte *outer_valaddr)
6563 char *discrim_name = ada_variant_discrim_name (var_type);
6564 struct value *outer;
6565 struct value *discrim;
6566 LONGEST discrim_val;
6568 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6569 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6570 if (discrim == NULL)
6572 discrim_val = value_as_long (discrim);
6575 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6577 if (ada_is_others_clause (var_type, i))
6579 else if (ada_in_variant (discrim_val, var_type, i))
6583 return others_clause;
6588 /* Dynamic-Sized Records */
6590 /* Strategy: The type ostensibly attached to a value with dynamic size
6591 (i.e., a size that is not statically recorded in the debugging
6592 data) does not accurately reflect the size or layout of the value.
6593 Our strategy is to convert these values to values with accurate,
6594 conventional types that are constructed on the fly. */
6596 /* There is a subtle and tricky problem here. In general, we cannot
6597 determine the size of dynamic records without its data. However,
6598 the 'struct value' data structure, which GDB uses to represent
6599 quantities in the inferior process (the target), requires the size
6600 of the type at the time of its allocation in order to reserve space
6601 for GDB's internal copy of the data. That's why the
6602 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6603 rather than struct value*s.
6605 However, GDB's internal history variables ($1, $2, etc.) are
6606 struct value*s containing internal copies of the data that are not, in
6607 general, the same as the data at their corresponding addresses in
6608 the target. Fortunately, the types we give to these values are all
6609 conventional, fixed-size types (as per the strategy described
6610 above), so that we don't usually have to perform the
6611 'to_fixed_xxx_type' conversions to look at their values.
6612 Unfortunately, there is one exception: if one of the internal
6613 history variables is an array whose elements are unconstrained
6614 records, then we will need to create distinct fixed types for each
6615 element selected. */
6617 /* The upshot of all of this is that many routines take a (type, host
6618 address, target address) triple as arguments to represent a value.
6619 The host address, if non-null, is supposed to contain an internal
6620 copy of the relevant data; otherwise, the program is to consult the
6621 target at the target address. */
6623 /* Assuming that VAL0 represents a pointer value, the result of
6624 dereferencing it. Differs from value_ind in its treatment of
6625 dynamic-sized types. */
6628 ada_value_ind (struct value *val0)
6630 struct value *val = unwrap_value (value_ind (val0));
6632 return ada_to_fixed_value (val);
6635 /* The value resulting from dereferencing any "reference to"
6636 qualifiers on VAL0. */
6638 static struct value *
6639 ada_coerce_ref (struct value *val0)
6641 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
6643 struct value *val = val0;
6645 val = coerce_ref (val);
6646 val = unwrap_value (val);
6647 return ada_to_fixed_value (val);
6653 /* Return OFF rounded upward if necessary to a multiple of
6654 ALIGNMENT (a power of 2). */
6657 align_value (unsigned int off, unsigned int alignment)
6659 return (off + alignment - 1) & ~(alignment - 1);
6662 /* Return the bit alignment required for field #F of template type TYPE. */
6665 field_alignment (struct type *type, int f)
6667 const char *name = TYPE_FIELD_NAME (type, f);
6671 /* The field name should never be null, unless the debugging information
6672 is somehow malformed. In this case, we assume the field does not
6673 require any alignment. */
6677 len = strlen (name);
6679 if (!isdigit (name[len - 1]))
6682 if (isdigit (name[len - 2]))
6683 align_offset = len - 2;
6685 align_offset = len - 1;
6687 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
6688 return TARGET_CHAR_BIT;
6690 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6693 /* Find a symbol named NAME. Ignores ambiguity. */
6696 ada_find_any_symbol (const char *name)
6700 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6701 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6704 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6708 /* Find a type named NAME. Ignores ambiguity. This routine will look
6709 solely for types defined by debug info, it will not search the GDB
6713 ada_find_any_type (const char *name)
6715 struct symbol *sym = ada_find_any_symbol (name);
6718 return SYMBOL_TYPE (sym);
6723 /* Given NAME and an associated BLOCK, search all symbols for
6724 NAME suffixed with "___XR", which is the ``renaming'' symbol
6725 associated to NAME. Return this symbol if found, return
6729 ada_find_renaming_symbol (const char *name, struct block *block)
6733 sym = find_old_style_renaming_symbol (name, block);
6738 /* Not right yet. FIXME pnh 7/20/2007. */
6739 sym = ada_find_any_symbol (name);
6740 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
6746 static struct symbol *
6747 find_old_style_renaming_symbol (const char *name, struct block *block)
6749 const struct symbol *function_sym = block_linkage_function (block);
6752 if (function_sym != NULL)
6754 /* If the symbol is defined inside a function, NAME is not fully
6755 qualified. This means we need to prepend the function name
6756 as well as adding the ``___XR'' suffix to build the name of
6757 the associated renaming symbol. */
6758 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
6759 /* Function names sometimes contain suffixes used
6760 for instance to qualify nested subprograms. When building
6761 the XR type name, we need to make sure that this suffix is
6762 not included. So do not include any suffix in the function
6763 name length below. */
6764 int function_name_len = ada_name_prefix_len (function_name);
6765 const int rename_len = function_name_len + 2 /* "__" */
6766 + strlen (name) + 6 /* "___XR\0" */ ;
6768 /* Strip the suffix if necessary. */
6769 ada_remove_trailing_digits (function_name, &function_name_len);
6770 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
6771 ada_remove_Xbn_suffix (function_name, &function_name_len);
6773 /* Library-level functions are a special case, as GNAT adds
6774 a ``_ada_'' prefix to the function name to avoid namespace
6775 pollution. However, the renaming symbols themselves do not
6776 have this prefix, so we need to skip this prefix if present. */
6777 if (function_name_len > 5 /* "_ada_" */
6778 && strstr (function_name, "_ada_") == function_name)
6781 function_name_len -= 5;
6784 rename = (char *) alloca (rename_len * sizeof (char));
6785 strncpy (rename, function_name, function_name_len);
6786 xsnprintf (rename + function_name_len, rename_len - function_name_len,
6791 const int rename_len = strlen (name) + 6;
6793 rename = (char *) alloca (rename_len * sizeof (char));
6794 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
6797 return ada_find_any_symbol (rename);
6800 /* Because of GNAT encoding conventions, several GDB symbols may match a
6801 given type name. If the type denoted by TYPE0 is to be preferred to
6802 that of TYPE1 for purposes of type printing, return non-zero;
6803 otherwise return 0. */
6806 ada_prefer_type (struct type *type0, struct type *type1)
6810 else if (type0 == NULL)
6812 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
6814 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
6816 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
6818 else if (ada_is_constrained_packed_array_type (type0))
6820 else if (ada_is_array_descriptor_type (type0)
6821 && !ada_is_array_descriptor_type (type1))
6825 const char *type0_name = type_name_no_tag (type0);
6826 const char *type1_name = type_name_no_tag (type1);
6828 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
6829 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
6835 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6836 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6839 ada_type_name (struct type *type)
6843 else if (TYPE_NAME (type) != NULL)
6844 return TYPE_NAME (type);
6846 return TYPE_TAG_NAME (type);
6849 /* Search the list of "descriptive" types associated to TYPE for a type
6850 whose name is NAME. */
6852 static struct type *
6853 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
6855 struct type *result;
6857 /* If there no descriptive-type info, then there is no parallel type
6859 if (!HAVE_GNAT_AUX_INFO (type))
6862 result = TYPE_DESCRIPTIVE_TYPE (type);
6863 while (result != NULL)
6865 char *result_name = ada_type_name (result);
6867 if (result_name == NULL)
6869 warning (_("unexpected null name on descriptive type"));
6873 /* If the names match, stop. */
6874 if (strcmp (result_name, name) == 0)
6877 /* Otherwise, look at the next item on the list, if any. */
6878 if (HAVE_GNAT_AUX_INFO (result))
6879 result = TYPE_DESCRIPTIVE_TYPE (result);
6884 /* If we didn't find a match, see whether this is a packed array. With
6885 older compilers, the descriptive type information is either absent or
6886 irrelevant when it comes to packed arrays so the above lookup fails.
6887 Fall back to using a parallel lookup by name in this case. */
6888 if (result == NULL && ada_is_constrained_packed_array_type (type))
6889 return ada_find_any_type (name);
6894 /* Find a parallel type to TYPE with the specified NAME, using the
6895 descriptive type taken from the debugging information, if available,
6896 and otherwise using the (slower) name-based method. */
6898 static struct type *
6899 ada_find_parallel_type_with_name (struct type *type, const char *name)
6901 struct type *result = NULL;
6903 if (HAVE_GNAT_AUX_INFO (type))
6904 result = find_parallel_type_by_descriptive_type (type, name);
6906 result = ada_find_any_type (name);
6911 /* Same as above, but specify the name of the parallel type by appending
6912 SUFFIX to the name of TYPE. */
6915 ada_find_parallel_type (struct type *type, const char *suffix)
6917 char *name, *typename = ada_type_name (type);
6920 if (typename == NULL)
6923 len = strlen (typename);
6925 name = (char *) alloca (len + strlen (suffix) + 1);
6927 strcpy (name, typename);
6928 strcpy (name + len, suffix);
6930 return ada_find_parallel_type_with_name (type, name);
6933 /* If TYPE is a variable-size record type, return the corresponding template
6934 type describing its fields. Otherwise, return NULL. */
6936 static struct type *
6937 dynamic_template_type (struct type *type)
6939 type = ada_check_typedef (type);
6941 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
6942 || ada_type_name (type) == NULL)
6946 int len = strlen (ada_type_name (type));
6948 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
6951 return ada_find_parallel_type (type, "___XVE");
6955 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6956 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6959 is_dynamic_field (struct type *templ_type, int field_num)
6961 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
6964 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
6965 && strstr (name, "___XVL") != NULL;
6968 /* The index of the variant field of TYPE, or -1 if TYPE does not
6969 represent a variant record type. */
6972 variant_field_index (struct type *type)
6976 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6979 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
6981 if (ada_is_variant_part (type, f))
6987 /* A record type with no fields. */
6989 static struct type *
6990 empty_record (struct type *template)
6992 struct type *type = alloc_type_copy (template);
6994 TYPE_CODE (type) = TYPE_CODE_STRUCT;
6995 TYPE_NFIELDS (type) = 0;
6996 TYPE_FIELDS (type) = NULL;
6997 INIT_CPLUS_SPECIFIC (type);
6998 TYPE_NAME (type) = "<empty>";
6999 TYPE_TAG_NAME (type) = NULL;
7000 TYPE_LENGTH (type) = 0;
7004 /* An ordinary record type (with fixed-length fields) that describes
7005 the value of type TYPE at VALADDR or ADDRESS (see comments at
7006 the beginning of this section) VAL according to GNAT conventions.
7007 DVAL0 should describe the (portion of a) record that contains any
7008 necessary discriminants. It should be NULL if value_type (VAL) is
7009 an outer-level type (i.e., as opposed to a branch of a variant.) A
7010 variant field (unless unchecked) is replaced by a particular branch
7013 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7014 length are not statically known are discarded. As a consequence,
7015 VALADDR, ADDRESS and DVAL0 are ignored.
7017 NOTE: Limitations: For now, we assume that dynamic fields and
7018 variants occupy whole numbers of bytes. However, they need not be
7022 ada_template_to_fixed_record_type_1 (struct type *type,
7023 const gdb_byte *valaddr,
7024 CORE_ADDR address, struct value *dval0,
7025 int keep_dynamic_fields)
7027 struct value *mark = value_mark ();
7030 int nfields, bit_len;
7033 int fld_bit_len, bit_incr;
7036 /* Compute the number of fields in this record type that are going
7037 to be processed: unless keep_dynamic_fields, this includes only
7038 fields whose position and length are static will be processed. */
7039 if (keep_dynamic_fields)
7040 nfields = TYPE_NFIELDS (type);
7044 while (nfields < TYPE_NFIELDS (type)
7045 && !ada_is_variant_part (type, nfields)
7046 && !is_dynamic_field (type, nfields))
7050 rtype = alloc_type_copy (type);
7051 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7052 INIT_CPLUS_SPECIFIC (rtype);
7053 TYPE_NFIELDS (rtype) = nfields;
7054 TYPE_FIELDS (rtype) = (struct field *)
7055 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7056 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7057 TYPE_NAME (rtype) = ada_type_name (type);
7058 TYPE_TAG_NAME (rtype) = NULL;
7059 TYPE_FIXED_INSTANCE (rtype) = 1;
7065 for (f = 0; f < nfields; f += 1)
7067 off = align_value (off, field_alignment (type, f))
7068 + TYPE_FIELD_BITPOS (type, f);
7069 TYPE_FIELD_BITPOS (rtype, f) = off;
7070 TYPE_FIELD_BITSIZE (rtype, f) = 0;
7072 if (ada_is_variant_part (type, f))
7075 fld_bit_len = bit_incr = 0;
7077 else if (is_dynamic_field (type, f))
7079 const gdb_byte *field_valaddr = valaddr;
7080 CORE_ADDR field_address = address;
7081 struct type *field_type =
7082 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7086 /* rtype's length is computed based on the run-time
7087 value of discriminants. If the discriminants are not
7088 initialized, the type size may be completely bogus and
7089 GDB may fail to allocate a value for it. So check the
7090 size first before creating the value. */
7092 dval = value_from_contents_and_address (rtype, valaddr, address);
7097 /* If the type referenced by this field is an aligner type, we need
7098 to unwrap that aligner type, because its size might not be set.
7099 Keeping the aligner type would cause us to compute the wrong
7100 size for this field, impacting the offset of the all the fields
7101 that follow this one. */
7102 if (ada_is_aligner_type (field_type))
7104 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7106 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7107 field_address = cond_offset_target (field_address, field_offset);
7108 field_type = ada_aligned_type (field_type);
7111 field_valaddr = cond_offset_host (field_valaddr,
7112 off / TARGET_CHAR_BIT);
7113 field_address = cond_offset_target (field_address,
7114 off / TARGET_CHAR_BIT);
7116 /* Get the fixed type of the field. Note that, in this case,
7117 we do not want to get the real type out of the tag: if
7118 the current field is the parent part of a tagged record,
7119 we will get the tag of the object. Clearly wrong: the real
7120 type of the parent is not the real type of the child. We
7121 would end up in an infinite loop. */
7122 field_type = ada_get_base_type (field_type);
7123 field_type = ada_to_fixed_type (field_type, field_valaddr,
7124 field_address, dval, 0);
7126 TYPE_FIELD_TYPE (rtype, f) = field_type;
7127 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7128 bit_incr = fld_bit_len =
7129 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7133 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7135 TYPE_FIELD_TYPE (rtype, f) = field_type;
7136 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7137 if (TYPE_FIELD_BITSIZE (type, f) > 0)
7138 bit_incr = fld_bit_len =
7139 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7141 bit_incr = fld_bit_len =
7142 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
7144 if (off + fld_bit_len > bit_len)
7145 bit_len = off + fld_bit_len;
7147 TYPE_LENGTH (rtype) =
7148 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7151 /* We handle the variant part, if any, at the end because of certain
7152 odd cases in which it is re-ordered so as NOT to be the last field of
7153 the record. This can happen in the presence of representation
7155 if (variant_field >= 0)
7157 struct type *branch_type;
7159 off = TYPE_FIELD_BITPOS (rtype, variant_field);
7162 dval = value_from_contents_and_address (rtype, valaddr, address);
7167 to_fixed_variant_branch_type
7168 (TYPE_FIELD_TYPE (type, variant_field),
7169 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
7170 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
7171 if (branch_type == NULL)
7173 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
7174 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7175 TYPE_NFIELDS (rtype) -= 1;
7179 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7180 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7182 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
7184 if (off + fld_bit_len > bit_len)
7185 bit_len = off + fld_bit_len;
7186 TYPE_LENGTH (rtype) =
7187 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7191 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7192 should contain the alignment of that record, which should be a strictly
7193 positive value. If null or negative, then something is wrong, most
7194 probably in the debug info. In that case, we don't round up the size
7195 of the resulting type. If this record is not part of another structure,
7196 the current RTYPE length might be good enough for our purposes. */
7197 if (TYPE_LENGTH (type) <= 0)
7199 if (TYPE_NAME (rtype))
7200 warning (_("Invalid type size for `%s' detected: %d."),
7201 TYPE_NAME (rtype), TYPE_LENGTH (type));
7203 warning (_("Invalid type size for <unnamed> detected: %d."),
7204 TYPE_LENGTH (type));
7208 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
7209 TYPE_LENGTH (type));
7212 value_free_to_mark (mark);
7213 if (TYPE_LENGTH (rtype) > varsize_limit)
7214 error (_("record type with dynamic size is larger than varsize-limit"));
7218 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7221 static struct type *
7222 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
7223 CORE_ADDR address, struct value *dval0)
7225 return ada_template_to_fixed_record_type_1 (type, valaddr,
7229 /* An ordinary record type in which ___XVL-convention fields and
7230 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7231 static approximations, containing all possible fields. Uses
7232 no runtime values. Useless for use in values, but that's OK,
7233 since the results are used only for type determinations. Works on both
7234 structs and unions. Representation note: to save space, we memorize
7235 the result of this function in the TYPE_TARGET_TYPE of the
7238 static struct type *
7239 template_to_static_fixed_type (struct type *type0)
7245 if (TYPE_TARGET_TYPE (type0) != NULL)
7246 return TYPE_TARGET_TYPE (type0);
7248 nfields = TYPE_NFIELDS (type0);
7251 for (f = 0; f < nfields; f += 1)
7253 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
7254 struct type *new_type;
7256 if (is_dynamic_field (type0, f))
7257 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
7259 new_type = static_unwrap_type (field_type);
7260 if (type == type0 && new_type != field_type)
7262 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
7263 TYPE_CODE (type) = TYPE_CODE (type0);
7264 INIT_CPLUS_SPECIFIC (type);
7265 TYPE_NFIELDS (type) = nfields;
7266 TYPE_FIELDS (type) = (struct field *)
7267 TYPE_ALLOC (type, nfields * sizeof (struct field));
7268 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7269 sizeof (struct field) * nfields);
7270 TYPE_NAME (type) = ada_type_name (type0);
7271 TYPE_TAG_NAME (type) = NULL;
7272 TYPE_FIXED_INSTANCE (type) = 1;
7273 TYPE_LENGTH (type) = 0;
7275 TYPE_FIELD_TYPE (type, f) = new_type;
7276 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
7281 /* Given an object of type TYPE whose contents are at VALADDR and
7282 whose address in memory is ADDRESS, returns a revision of TYPE,
7283 which should be a non-dynamic-sized record, in which the variant
7284 part, if any, is replaced with the appropriate branch. Looks
7285 for discriminant values in DVAL0, which can be NULL if the record
7286 contains the necessary discriminant values. */
7288 static struct type *
7289 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
7290 CORE_ADDR address, struct value *dval0)
7292 struct value *mark = value_mark ();
7295 struct type *branch_type;
7296 int nfields = TYPE_NFIELDS (type);
7297 int variant_field = variant_field_index (type);
7299 if (variant_field == -1)
7303 dval = value_from_contents_and_address (type, valaddr, address);
7307 rtype = alloc_type_copy (type);
7308 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7309 INIT_CPLUS_SPECIFIC (rtype);
7310 TYPE_NFIELDS (rtype) = nfields;
7311 TYPE_FIELDS (rtype) =
7312 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7313 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7314 sizeof (struct field) * nfields);
7315 TYPE_NAME (rtype) = ada_type_name (type);
7316 TYPE_TAG_NAME (rtype) = NULL;
7317 TYPE_FIXED_INSTANCE (rtype) = 1;
7318 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7320 branch_type = to_fixed_variant_branch_type
7321 (TYPE_FIELD_TYPE (type, variant_field),
7322 cond_offset_host (valaddr,
7323 TYPE_FIELD_BITPOS (type, variant_field)
7325 cond_offset_target (address,
7326 TYPE_FIELD_BITPOS (type, variant_field)
7327 / TARGET_CHAR_BIT), dval);
7328 if (branch_type == NULL)
7332 for (f = variant_field + 1; f < nfields; f += 1)
7333 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7334 TYPE_NFIELDS (rtype) -= 1;
7338 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7339 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7340 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7341 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7343 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7345 value_free_to_mark (mark);
7349 /* An ordinary record type (with fixed-length fields) that describes
7350 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7351 beginning of this section]. Any necessary discriminants' values
7352 should be in DVAL, a record value; it may be NULL if the object
7353 at ADDR itself contains any necessary discriminant values.
7354 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7355 values from the record are needed. Except in the case that DVAL,
7356 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7357 unchecked) is replaced by a particular branch of the variant.
7359 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7360 is questionable and may be removed. It can arise during the
7361 processing of an unconstrained-array-of-record type where all the
7362 variant branches have exactly the same size. This is because in
7363 such cases, the compiler does not bother to use the XVS convention
7364 when encoding the record. I am currently dubious of this
7365 shortcut and suspect the compiler should be altered. FIXME. */
7367 static struct type *
7368 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7369 CORE_ADDR address, struct value *dval)
7371 struct type *templ_type;
7373 if (TYPE_FIXED_INSTANCE (type0))
7376 templ_type = dynamic_template_type (type0);
7378 if (templ_type != NULL)
7379 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
7380 else if (variant_field_index (type0) >= 0)
7382 if (dval == NULL && valaddr == NULL && address == 0)
7384 return to_record_with_fixed_variant_part (type0, valaddr, address,
7389 TYPE_FIXED_INSTANCE (type0) = 1;
7395 /* An ordinary record type (with fixed-length fields) that describes
7396 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7397 union type. Any necessary discriminants' values should be in DVAL,
7398 a record value. That is, this routine selects the appropriate
7399 branch of the union at ADDR according to the discriminant value
7400 indicated in the union's type name. Returns VAR_TYPE0 itself if
7401 it represents a variant subject to a pragma Unchecked_Union. */
7403 static struct type *
7404 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
7405 CORE_ADDR address, struct value *dval)
7408 struct type *templ_type;
7409 struct type *var_type;
7411 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7412 var_type = TYPE_TARGET_TYPE (var_type0);
7414 var_type = var_type0;
7416 templ_type = ada_find_parallel_type (var_type, "___XVU");
7418 if (templ_type != NULL)
7419 var_type = templ_type;
7421 if (is_unchecked_variant (var_type, value_type (dval)))
7424 ada_which_variant_applies (var_type,
7425 value_type (dval), value_contents (dval));
7428 return empty_record (var_type);
7429 else if (is_dynamic_field (var_type, which))
7430 return to_fixed_record_type
7431 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7432 valaddr, address, dval);
7433 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
7435 to_fixed_record_type
7436 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
7438 return TYPE_FIELD_TYPE (var_type, which);
7441 /* Assuming that TYPE0 is an array type describing the type of a value
7442 at ADDR, and that DVAL describes a record containing any
7443 discriminants used in TYPE0, returns a type for the value that
7444 contains no dynamic components (that is, no components whose sizes
7445 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7446 true, gives an error message if the resulting type's size is over
7449 static struct type *
7450 to_fixed_array_type (struct type *type0, struct value *dval,
7453 struct type *index_type_desc;
7454 struct type *result;
7455 int constrained_packed_array_p;
7457 if (TYPE_FIXED_INSTANCE (type0))
7460 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
7461 if (constrained_packed_array_p)
7462 type0 = decode_constrained_packed_array_type (type0);
7464 index_type_desc = ada_find_parallel_type (type0, "___XA");
7465 ada_fixup_array_indexes_type (index_type_desc);
7466 if (index_type_desc == NULL)
7468 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
7470 /* NOTE: elt_type---the fixed version of elt_type0---should never
7471 depend on the contents of the array in properly constructed
7473 /* Create a fixed version of the array element type.
7474 We're not providing the address of an element here,
7475 and thus the actual object value cannot be inspected to do
7476 the conversion. This should not be a problem, since arrays of
7477 unconstrained objects are not allowed. In particular, all
7478 the elements of an array of a tagged type should all be of
7479 the same type specified in the debugging info. No need to
7480 consult the object tag. */
7481 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
7483 /* Make sure we always create a new array type when dealing with
7484 packed array types, since we're going to fix-up the array
7485 type length and element bitsize a little further down. */
7486 if (elt_type0 == elt_type && !constrained_packed_array_p)
7489 result = create_array_type (alloc_type_copy (type0),
7490 elt_type, TYPE_INDEX_TYPE (type0));
7495 struct type *elt_type0;
7498 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
7499 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7501 /* NOTE: result---the fixed version of elt_type0---should never
7502 depend on the contents of the array in properly constructed
7504 /* Create a fixed version of the array element type.
7505 We're not providing the address of an element here,
7506 and thus the actual object value cannot be inspected to do
7507 the conversion. This should not be a problem, since arrays of
7508 unconstrained objects are not allowed. In particular, all
7509 the elements of an array of a tagged type should all be of
7510 the same type specified in the debugging info. No need to
7511 consult the object tag. */
7513 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
7516 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
7518 struct type *range_type =
7519 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
7521 result = create_array_type (alloc_type_copy (elt_type0),
7522 result, range_type);
7523 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7525 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
7526 error (_("array type with dynamic size is larger than varsize-limit"));
7529 if (constrained_packed_array_p)
7531 /* So far, the resulting type has been created as if the original
7532 type was a regular (non-packed) array type. As a result, the
7533 bitsize of the array elements needs to be set again, and the array
7534 length needs to be recomputed based on that bitsize. */
7535 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
7536 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
7538 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
7539 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
7540 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
7541 TYPE_LENGTH (result)++;
7544 TYPE_FIXED_INSTANCE (result) = 1;
7549 /* A standard type (containing no dynamically sized components)
7550 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7551 DVAL describes a record containing any discriminants used in TYPE0,
7552 and may be NULL if there are none, or if the object of type TYPE at
7553 ADDRESS or in VALADDR contains these discriminants.
7555 If CHECK_TAG is not null, in the case of tagged types, this function
7556 attempts to locate the object's tag and use it to compute the actual
7557 type. However, when ADDRESS is null, we cannot use it to determine the
7558 location of the tag, and therefore compute the tagged type's actual type.
7559 So we return the tagged type without consulting the tag. */
7561 static struct type *
7562 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
7563 CORE_ADDR address, struct value *dval, int check_tag)
7565 type = ada_check_typedef (type);
7566 switch (TYPE_CODE (type))
7570 case TYPE_CODE_STRUCT:
7572 struct type *static_type = to_static_fixed_type (type);
7573 struct type *fixed_record_type =
7574 to_fixed_record_type (type, valaddr, address, NULL);
7576 /* If STATIC_TYPE is a tagged type and we know the object's address,
7577 then we can determine its tag, and compute the object's actual
7578 type from there. Note that we have to use the fixed record
7579 type (the parent part of the record may have dynamic fields
7580 and the way the location of _tag is expressed may depend on
7583 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
7585 struct type *real_type =
7586 type_from_tag (value_tag_from_contents_and_address
7591 if (real_type != NULL)
7592 return to_fixed_record_type (real_type, valaddr, address, NULL);
7595 /* Check to see if there is a parallel ___XVZ variable.
7596 If there is, then it provides the actual size of our type. */
7597 else if (ada_type_name (fixed_record_type) != NULL)
7599 char *name = ada_type_name (fixed_record_type);
7600 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
7604 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
7605 size = get_int_var_value (xvz_name, &xvz_found);
7606 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
7608 fixed_record_type = copy_type (fixed_record_type);
7609 TYPE_LENGTH (fixed_record_type) = size;
7611 /* The FIXED_RECORD_TYPE may have be a stub. We have
7612 observed this when the debugging info is STABS, and
7613 apparently it is something that is hard to fix.
7615 In practice, we don't need the actual type definition
7616 at all, because the presence of the XVZ variable allows us
7617 to assume that there must be a XVS type as well, which we
7618 should be able to use later, when we need the actual type
7621 In the meantime, pretend that the "fixed" type we are
7622 returning is NOT a stub, because this can cause trouble
7623 when using this type to create new types targeting it.
7624 Indeed, the associated creation routines often check
7625 whether the target type is a stub and will try to replace
7626 it, thus using a type with the wrong size. This, in turn,
7627 might cause the new type to have the wrong size too.
7628 Consider the case of an array, for instance, where the size
7629 of the array is computed from the number of elements in
7630 our array multiplied by the size of its element. */
7631 TYPE_STUB (fixed_record_type) = 0;
7634 return fixed_record_type;
7636 case TYPE_CODE_ARRAY:
7637 return to_fixed_array_type (type, dval, 1);
7638 case TYPE_CODE_UNION:
7642 return to_fixed_variant_branch_type (type, valaddr, address, dval);
7646 /* The same as ada_to_fixed_type_1, except that it preserves the type
7647 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7648 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7651 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7652 CORE_ADDR address, struct value *dval, int check_tag)
7655 struct type *fixed_type =
7656 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7658 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7659 && TYPE_TARGET_TYPE (type) == fixed_type)
7665 /* A standard (static-sized) type corresponding as well as possible to
7666 TYPE0, but based on no runtime data. */
7668 static struct type *
7669 to_static_fixed_type (struct type *type0)
7676 if (TYPE_FIXED_INSTANCE (type0))
7679 type0 = ada_check_typedef (type0);
7681 switch (TYPE_CODE (type0))
7685 case TYPE_CODE_STRUCT:
7686 type = dynamic_template_type (type0);
7688 return template_to_static_fixed_type (type);
7690 return template_to_static_fixed_type (type0);
7691 case TYPE_CODE_UNION:
7692 type = ada_find_parallel_type (type0, "___XVU");
7694 return template_to_static_fixed_type (type);
7696 return template_to_static_fixed_type (type0);
7700 /* A static approximation of TYPE with all type wrappers removed. */
7702 static struct type *
7703 static_unwrap_type (struct type *type)
7705 if (ada_is_aligner_type (type))
7707 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
7708 if (ada_type_name (type1) == NULL)
7709 TYPE_NAME (type1) = ada_type_name (type);
7711 return static_unwrap_type (type1);
7715 struct type *raw_real_type = ada_get_base_type (type);
7717 if (raw_real_type == type)
7720 return to_static_fixed_type (raw_real_type);
7724 /* In some cases, incomplete and private types require
7725 cross-references that are not resolved as records (for example,
7727 type FooP is access Foo;
7729 type Foo is array ...;
7730 ). In these cases, since there is no mechanism for producing
7731 cross-references to such types, we instead substitute for FooP a
7732 stub enumeration type that is nowhere resolved, and whose tag is
7733 the name of the actual type. Call these types "non-record stubs". */
7735 /* A type equivalent to TYPE that is not a non-record stub, if one
7736 exists, otherwise TYPE. */
7739 ada_check_typedef (struct type *type)
7744 CHECK_TYPEDEF (type);
7745 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
7746 || !TYPE_STUB (type)
7747 || TYPE_TAG_NAME (type) == NULL)
7751 char *name = TYPE_TAG_NAME (type);
7752 struct type *type1 = ada_find_any_type (name);
7757 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
7758 stubs pointing to arrays, as we don't create symbols for array
7759 types, only for the typedef-to-array types). This is why
7760 we process TYPE1 with ada_check_typedef before returning
7762 return ada_check_typedef (type1);
7766 /* A value representing the data at VALADDR/ADDRESS as described by
7767 type TYPE0, but with a standard (static-sized) type that correctly
7768 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7769 type, then return VAL0 [this feature is simply to avoid redundant
7770 creation of struct values]. */
7772 static struct value *
7773 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
7776 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
7778 if (type == type0 && val0 != NULL)
7781 return value_from_contents_and_address (type, 0, address);
7784 /* A value representing VAL, but with a standard (static-sized) type
7785 that correctly describes it. Does not necessarily create a new
7789 ada_to_fixed_value (struct value *val)
7791 return ada_to_fixed_value_create (value_type (val),
7792 value_address (val),
7799 /* Table mapping attribute numbers to names.
7800 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7802 static const char *attribute_names[] = {
7820 ada_attribute_name (enum exp_opcode n)
7822 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
7823 return attribute_names[n - OP_ATR_FIRST + 1];
7825 return attribute_names[0];
7828 /* Evaluate the 'POS attribute applied to ARG. */
7831 pos_atr (struct value *arg)
7833 struct value *val = coerce_ref (arg);
7834 struct type *type = value_type (val);
7836 if (!discrete_type_p (type))
7837 error (_("'POS only defined on discrete types"));
7839 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7842 LONGEST v = value_as_long (val);
7844 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7846 if (v == TYPE_FIELD_BITPOS (type, i))
7849 error (_("enumeration value is invalid: can't find 'POS"));
7852 return value_as_long (val);
7855 static struct value *
7856 value_pos_atr (struct type *type, struct value *arg)
7858 return value_from_longest (type, pos_atr (arg));
7861 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7863 static struct value *
7864 value_val_atr (struct type *type, struct value *arg)
7866 if (!discrete_type_p (type))
7867 error (_("'VAL only defined on discrete types"));
7868 if (!integer_type_p (value_type (arg)))
7869 error (_("'VAL requires integral argument"));
7871 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7873 long pos = value_as_long (arg);
7875 if (pos < 0 || pos >= TYPE_NFIELDS (type))
7876 error (_("argument to 'VAL out of range"));
7877 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
7880 return value_from_longest (type, value_as_long (arg));
7886 /* True if TYPE appears to be an Ada character type.
7887 [At the moment, this is true only for Character and Wide_Character;
7888 It is a heuristic test that could stand improvement]. */
7891 ada_is_character_type (struct type *type)
7895 /* If the type code says it's a character, then assume it really is,
7896 and don't check any further. */
7897 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
7900 /* Otherwise, assume it's a character type iff it is a discrete type
7901 with a known character type name. */
7902 name = ada_type_name (type);
7903 return (name != NULL
7904 && (TYPE_CODE (type) == TYPE_CODE_INT
7905 || TYPE_CODE (type) == TYPE_CODE_RANGE)
7906 && (strcmp (name, "character") == 0
7907 || strcmp (name, "wide_character") == 0
7908 || strcmp (name, "wide_wide_character") == 0
7909 || strcmp (name, "unsigned char") == 0));
7912 /* True if TYPE appears to be an Ada string type. */
7915 ada_is_string_type (struct type *type)
7917 type = ada_check_typedef (type);
7919 && TYPE_CODE (type) != TYPE_CODE_PTR
7920 && (ada_is_simple_array_type (type)
7921 || ada_is_array_descriptor_type (type))
7922 && ada_array_arity (type) == 1)
7924 struct type *elttype = ada_array_element_type (type, 1);
7926 return ada_is_character_type (elttype);
7932 /* The compiler sometimes provides a parallel XVS type for a given
7933 PAD type. Normally, it is safe to follow the PAD type directly,
7934 but older versions of the compiler have a bug that causes the offset
7935 of its "F" field to be wrong. Following that field in that case
7936 would lead to incorrect results, but this can be worked around
7937 by ignoring the PAD type and using the associated XVS type instead.
7939 Set to True if the debugger should trust the contents of PAD types.
7940 Otherwise, ignore the PAD type if there is a parallel XVS type. */
7941 static int trust_pad_over_xvs = 1;
7943 /* True if TYPE is a struct type introduced by the compiler to force the
7944 alignment of a value. Such types have a single field with a
7945 distinctive name. */
7948 ada_is_aligner_type (struct type *type)
7950 type = ada_check_typedef (type);
7952 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
7955 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
7956 && TYPE_NFIELDS (type) == 1
7957 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
7960 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7961 the parallel type. */
7964 ada_get_base_type (struct type *raw_type)
7966 struct type *real_type_namer;
7967 struct type *raw_real_type;
7969 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
7972 if (ada_is_aligner_type (raw_type))
7973 /* The encoding specifies that we should always use the aligner type.
7974 So, even if this aligner type has an associated XVS type, we should
7977 According to the compiler gurus, an XVS type parallel to an aligner
7978 type may exist because of a stabs limitation. In stabs, aligner
7979 types are empty because the field has a variable-sized type, and
7980 thus cannot actually be used as an aligner type. As a result,
7981 we need the associated parallel XVS type to decode the type.
7982 Since the policy in the compiler is to not change the internal
7983 representation based on the debugging info format, we sometimes
7984 end up having a redundant XVS type parallel to the aligner type. */
7987 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
7988 if (real_type_namer == NULL
7989 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
7990 || TYPE_NFIELDS (real_type_namer) != 1)
7993 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
7995 /* This is an older encoding form where the base type needs to be
7996 looked up by name. We prefer the newer enconding because it is
7998 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
7999 if (raw_real_type == NULL)
8002 return raw_real_type;
8005 /* The field in our XVS type is a reference to the base type. */
8006 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
8009 /* The type of value designated by TYPE, with all aligners removed. */
8012 ada_aligned_type (struct type *type)
8014 if (ada_is_aligner_type (type))
8015 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
8017 return ada_get_base_type (type);
8021 /* The address of the aligned value in an object at address VALADDR
8022 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8025 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
8027 if (ada_is_aligner_type (type))
8028 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
8030 TYPE_FIELD_BITPOS (type,
8031 0) / TARGET_CHAR_BIT);
8038 /* The printed representation of an enumeration literal with encoded
8039 name NAME. The value is good to the next call of ada_enum_name. */
8041 ada_enum_name (const char *name)
8043 static char *result;
8044 static size_t result_len = 0;
8047 /* First, unqualify the enumeration name:
8048 1. Search for the last '.' character. If we find one, then skip
8049 all the preceeding characters, the unqualified name starts
8050 right after that dot.
8051 2. Otherwise, we may be debugging on a target where the compiler
8052 translates dots into "__". Search forward for double underscores,
8053 but stop searching when we hit an overloading suffix, which is
8054 of the form "__" followed by digits. */
8056 tmp = strrchr (name, '.');
8061 while ((tmp = strstr (name, "__")) != NULL)
8063 if (isdigit (tmp[2]))
8074 if (name[1] == 'U' || name[1] == 'W')
8076 if (sscanf (name + 2, "%x", &v) != 1)
8082 GROW_VECT (result, result_len, 16);
8083 if (isascii (v) && isprint (v))
8084 xsnprintf (result, result_len, "'%c'", v);
8085 else if (name[1] == 'U')
8086 xsnprintf (result, result_len, "[\"%02x\"]", v);
8088 xsnprintf (result, result_len, "[\"%04x\"]", v);
8094 tmp = strstr (name, "__");
8096 tmp = strstr (name, "$");
8099 GROW_VECT (result, result_len, tmp - name + 1);
8100 strncpy (result, name, tmp - name);
8101 result[tmp - name] = '\0';
8109 /* Evaluate the subexpression of EXP starting at *POS as for
8110 evaluate_type, updating *POS to point just past the evaluated
8113 static struct value *
8114 evaluate_subexp_type (struct expression *exp, int *pos)
8116 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8119 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8122 static struct value *
8123 unwrap_value (struct value *val)
8125 struct type *type = ada_check_typedef (value_type (val));
8127 if (ada_is_aligner_type (type))
8129 struct value *v = ada_value_struct_elt (val, "F", 0);
8130 struct type *val_type = ada_check_typedef (value_type (v));
8132 if (ada_type_name (val_type) == NULL)
8133 TYPE_NAME (val_type) = ada_type_name (type);
8135 return unwrap_value (v);
8139 struct type *raw_real_type =
8140 ada_check_typedef (ada_get_base_type (type));
8142 /* If there is no parallel XVS or XVE type, then the value is
8143 already unwrapped. Return it without further modification. */
8144 if ((type == raw_real_type)
8145 && ada_find_parallel_type (type, "___XVE") == NULL)
8149 coerce_unspec_val_to_type
8150 (val, ada_to_fixed_type (raw_real_type, 0,
8151 value_address (val),
8156 static struct value *
8157 cast_to_fixed (struct type *type, struct value *arg)
8161 if (type == value_type (arg))
8163 else if (ada_is_fixed_point_type (value_type (arg)))
8164 val = ada_float_to_fixed (type,
8165 ada_fixed_to_float (value_type (arg),
8166 value_as_long (arg)));
8169 DOUBLEST argd = value_as_double (arg);
8171 val = ada_float_to_fixed (type, argd);
8174 return value_from_longest (type, val);
8177 static struct value *
8178 cast_from_fixed (struct type *type, struct value *arg)
8180 DOUBLEST val = ada_fixed_to_float (value_type (arg),
8181 value_as_long (arg));
8183 return value_from_double (type, val);
8186 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8187 return the converted value. */
8189 static struct value *
8190 coerce_for_assign (struct type *type, struct value *val)
8192 struct type *type2 = value_type (val);
8197 type2 = ada_check_typedef (type2);
8198 type = ada_check_typedef (type);
8200 if (TYPE_CODE (type2) == TYPE_CODE_PTR
8201 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8203 val = ada_value_ind (val);
8204 type2 = value_type (val);
8207 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
8208 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8210 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
8211 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8212 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
8213 error (_("Incompatible types in assignment"));
8214 deprecated_set_value_type (val, type);
8219 static struct value *
8220 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
8223 struct type *type1, *type2;
8226 arg1 = coerce_ref (arg1);
8227 arg2 = coerce_ref (arg2);
8228 type1 = base_type (ada_check_typedef (value_type (arg1)));
8229 type2 = base_type (ada_check_typedef (value_type (arg2)));
8231 if (TYPE_CODE (type1) != TYPE_CODE_INT
8232 || TYPE_CODE (type2) != TYPE_CODE_INT)
8233 return value_binop (arg1, arg2, op);
8242 return value_binop (arg1, arg2, op);
8245 v2 = value_as_long (arg2);
8247 error (_("second operand of %s must not be zero."), op_string (op));
8249 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
8250 return value_binop (arg1, arg2, op);
8252 v1 = value_as_long (arg1);
8257 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
8258 v += v > 0 ? -1 : 1;
8266 /* Should not reach this point. */
8270 val = allocate_value (type1);
8271 store_unsigned_integer (value_contents_raw (val),
8272 TYPE_LENGTH (value_type (val)),
8273 gdbarch_byte_order (get_type_arch (type1)), v);
8278 ada_value_equal (struct value *arg1, struct value *arg2)
8280 if (ada_is_direct_array_type (value_type (arg1))
8281 || ada_is_direct_array_type (value_type (arg2)))
8283 /* Automatically dereference any array reference before
8284 we attempt to perform the comparison. */
8285 arg1 = ada_coerce_ref (arg1);
8286 arg2 = ada_coerce_ref (arg2);
8288 arg1 = ada_coerce_to_simple_array (arg1);
8289 arg2 = ada_coerce_to_simple_array (arg2);
8290 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
8291 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
8292 error (_("Attempt to compare array with non-array"));
8293 /* FIXME: The following works only for types whose
8294 representations use all bits (no padding or undefined bits)
8295 and do not have user-defined equality. */
8297 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
8298 && memcmp (value_contents (arg1), value_contents (arg2),
8299 TYPE_LENGTH (value_type (arg1))) == 0;
8301 return value_equal (arg1, arg2);
8304 /* Total number of component associations in the aggregate starting at
8305 index PC in EXP. Assumes that index PC is the start of an
8309 num_component_specs (struct expression *exp, int pc)
8313 m = exp->elts[pc + 1].longconst;
8316 for (i = 0; i < m; i += 1)
8318 switch (exp->elts[pc].opcode)
8324 n += exp->elts[pc + 1].longconst;
8327 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8332 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8333 component of LHS (a simple array or a record), updating *POS past
8334 the expression, assuming that LHS is contained in CONTAINER. Does
8335 not modify the inferior's memory, nor does it modify LHS (unless
8336 LHS == CONTAINER). */
8339 assign_component (struct value *container, struct value *lhs, LONGEST index,
8340 struct expression *exp, int *pos)
8342 struct value *mark = value_mark ();
8345 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8347 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
8348 struct value *index_val = value_from_longest (index_type, index);
8350 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8354 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
8355 elt = ada_to_fixed_value (unwrap_value (elt));
8358 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8359 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8361 value_assign_to_component (container, elt,
8362 ada_evaluate_subexp (NULL, exp, pos,
8365 value_free_to_mark (mark);
8368 /* Assuming that LHS represents an lvalue having a record or array
8369 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8370 of that aggregate's value to LHS, advancing *POS past the
8371 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8372 lvalue containing LHS (possibly LHS itself). Does not modify
8373 the inferior's memory, nor does it modify the contents of
8374 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8376 static struct value *
8377 assign_aggregate (struct value *container,
8378 struct value *lhs, struct expression *exp,
8379 int *pos, enum noside noside)
8381 struct type *lhs_type;
8382 int n = exp->elts[*pos+1].longconst;
8383 LONGEST low_index, high_index;
8386 int max_indices, num_indices;
8387 int is_array_aggregate;
8391 if (noside != EVAL_NORMAL)
8395 for (i = 0; i < n; i += 1)
8396 ada_evaluate_subexp (NULL, exp, pos, noside);
8400 container = ada_coerce_ref (container);
8401 if (ada_is_direct_array_type (value_type (container)))
8402 container = ada_coerce_to_simple_array (container);
8403 lhs = ada_coerce_ref (lhs);
8404 if (!deprecated_value_modifiable (lhs))
8405 error (_("Left operand of assignment is not a modifiable lvalue."));
8407 lhs_type = value_type (lhs);
8408 if (ada_is_direct_array_type (lhs_type))
8410 lhs = ada_coerce_to_simple_array (lhs);
8411 lhs_type = value_type (lhs);
8412 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8413 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8414 is_array_aggregate = 1;
8416 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8419 high_index = num_visible_fields (lhs_type) - 1;
8420 is_array_aggregate = 0;
8423 error (_("Left-hand side must be array or record."));
8425 num_specs = num_component_specs (exp, *pos - 3);
8426 max_indices = 4 * num_specs + 4;
8427 indices = alloca (max_indices * sizeof (indices[0]));
8428 indices[0] = indices[1] = low_index - 1;
8429 indices[2] = indices[3] = high_index + 1;
8432 for (i = 0; i < n; i += 1)
8434 switch (exp->elts[*pos].opcode)
8437 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8438 &num_indices, max_indices,
8439 low_index, high_index);
8442 aggregate_assign_positional (container, lhs, exp, pos, indices,
8443 &num_indices, max_indices,
8444 low_index, high_index);
8448 error (_("Misplaced 'others' clause"));
8449 aggregate_assign_others (container, lhs, exp, pos, indices,
8450 num_indices, low_index, high_index);
8453 error (_("Internal error: bad aggregate clause"));
8460 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8461 construct at *POS, updating *POS past the construct, given that
8462 the positions are relative to lower bound LOW, where HIGH is the
8463 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8464 updating *NUM_INDICES as needed. CONTAINER is as for
8465 assign_aggregate. */
8467 aggregate_assign_positional (struct value *container,
8468 struct value *lhs, struct expression *exp,
8469 int *pos, LONGEST *indices, int *num_indices,
8470 int max_indices, LONGEST low, LONGEST high)
8472 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8474 if (ind - 1 == high)
8475 warning (_("Extra components in aggregate ignored."));
8478 add_component_interval (ind, ind, indices, num_indices, max_indices);
8480 assign_component (container, lhs, ind, exp, pos);
8483 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8486 /* Assign into the components of LHS indexed by the OP_CHOICES
8487 construct at *POS, updating *POS past the construct, given that
8488 the allowable indices are LOW..HIGH. Record the indices assigned
8489 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8490 needed. CONTAINER is as for assign_aggregate. */
8492 aggregate_assign_from_choices (struct value *container,
8493 struct value *lhs, struct expression *exp,
8494 int *pos, LONGEST *indices, int *num_indices,
8495 int max_indices, LONGEST low, LONGEST high)
8498 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
8499 int choice_pos, expr_pc;
8500 int is_array = ada_is_direct_array_type (value_type (lhs));
8502 choice_pos = *pos += 3;
8504 for (j = 0; j < n_choices; j += 1)
8505 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8507 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8509 for (j = 0; j < n_choices; j += 1)
8511 LONGEST lower, upper;
8512 enum exp_opcode op = exp->elts[choice_pos].opcode;
8514 if (op == OP_DISCRETE_RANGE)
8517 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8519 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8524 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8536 name = &exp->elts[choice_pos + 2].string;
8539 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8542 error (_("Invalid record component association."));
8544 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8546 if (! find_struct_field (name, value_type (lhs), 0,
8547 NULL, NULL, NULL, NULL, &ind))
8548 error (_("Unknown component name: %s."), name);
8549 lower = upper = ind;
8552 if (lower <= upper && (lower < low || upper > high))
8553 error (_("Index in component association out of bounds."));
8555 add_component_interval (lower, upper, indices, num_indices,
8557 while (lower <= upper)
8562 assign_component (container, lhs, lower, exp, &pos1);
8568 /* Assign the value of the expression in the OP_OTHERS construct in
8569 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8570 have not been previously assigned. The index intervals already assigned
8571 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8572 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8574 aggregate_assign_others (struct value *container,
8575 struct value *lhs, struct expression *exp,
8576 int *pos, LONGEST *indices, int num_indices,
8577 LONGEST low, LONGEST high)
8580 int expr_pc = *pos+1;
8582 for (i = 0; i < num_indices - 2; i += 2)
8586 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8591 assign_component (container, lhs, ind, exp, &pos);
8594 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8597 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8598 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8599 modifying *SIZE as needed. It is an error if *SIZE exceeds
8600 MAX_SIZE. The resulting intervals do not overlap. */
8602 add_component_interval (LONGEST low, LONGEST high,
8603 LONGEST* indices, int *size, int max_size)
8607 for (i = 0; i < *size; i += 2) {
8608 if (high >= indices[i] && low <= indices[i + 1])
8612 for (kh = i + 2; kh < *size; kh += 2)
8613 if (high < indices[kh])
8615 if (low < indices[i])
8617 indices[i + 1] = indices[kh - 1];
8618 if (high > indices[i + 1])
8619 indices[i + 1] = high;
8620 memcpy (indices + i + 2, indices + kh, *size - kh);
8621 *size -= kh - i - 2;
8624 else if (high < indices[i])
8628 if (*size == max_size)
8629 error (_("Internal error: miscounted aggregate components."));
8631 for (j = *size-1; j >= i+2; j -= 1)
8632 indices[j] = indices[j - 2];
8634 indices[i + 1] = high;
8637 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8640 static struct value *
8641 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8643 if (type == ada_check_typedef (value_type (arg2)))
8646 if (ada_is_fixed_point_type (type))
8647 return (cast_to_fixed (type, arg2));
8649 if (ada_is_fixed_point_type (value_type (arg2)))
8650 return cast_from_fixed (type, arg2);
8652 return value_cast (type, arg2);
8655 /* Evaluating Ada expressions, and printing their result.
8656 ------------------------------------------------------
8661 We usually evaluate an Ada expression in order to print its value.
8662 We also evaluate an expression in order to print its type, which
8663 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8664 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8665 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8666 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8669 Evaluating expressions is a little more complicated for Ada entities
8670 than it is for entities in languages such as C. The main reason for
8671 this is that Ada provides types whose definition might be dynamic.
8672 One example of such types is variant records. Or another example
8673 would be an array whose bounds can only be known at run time.
8675 The following description is a general guide as to what should be
8676 done (and what should NOT be done) in order to evaluate an expression
8677 involving such types, and when. This does not cover how the semantic
8678 information is encoded by GNAT as this is covered separatly. For the
8679 document used as the reference for the GNAT encoding, see exp_dbug.ads
8680 in the GNAT sources.
8682 Ideally, we should embed each part of this description next to its
8683 associated code. Unfortunately, the amount of code is so vast right
8684 now that it's hard to see whether the code handling a particular
8685 situation might be duplicated or not. One day, when the code is
8686 cleaned up, this guide might become redundant with the comments
8687 inserted in the code, and we might want to remove it.
8689 2. ``Fixing'' an Entity, the Simple Case:
8690 -----------------------------------------
8692 When evaluating Ada expressions, the tricky issue is that they may
8693 reference entities whose type contents and size are not statically
8694 known. Consider for instance a variant record:
8696 type Rec (Empty : Boolean := True) is record
8699 when False => Value : Integer;
8702 Yes : Rec := (Empty => False, Value => 1);
8703 No : Rec := (empty => True);
8705 The size and contents of that record depends on the value of the
8706 descriminant (Rec.Empty). At this point, neither the debugging
8707 information nor the associated type structure in GDB are able to
8708 express such dynamic types. So what the debugger does is to create
8709 "fixed" versions of the type that applies to the specific object.
8710 We also informally refer to this opperation as "fixing" an object,
8711 which means creating its associated fixed type.
8713 Example: when printing the value of variable "Yes" above, its fixed
8714 type would look like this:
8721 On the other hand, if we printed the value of "No", its fixed type
8728 Things become a little more complicated when trying to fix an entity
8729 with a dynamic type that directly contains another dynamic type,
8730 such as an array of variant records, for instance. There are
8731 two possible cases: Arrays, and records.
8733 3. ``Fixing'' Arrays:
8734 ---------------------
8736 The type structure in GDB describes an array in terms of its bounds,
8737 and the type of its elements. By design, all elements in the array
8738 have the same type and we cannot represent an array of variant elements
8739 using the current type structure in GDB. When fixing an array,
8740 we cannot fix the array element, as we would potentially need one
8741 fixed type per element of the array. As a result, the best we can do
8742 when fixing an array is to produce an array whose bounds and size
8743 are correct (allowing us to read it from memory), but without having
8744 touched its element type. Fixing each element will be done later,
8745 when (if) necessary.
8747 Arrays are a little simpler to handle than records, because the same
8748 amount of memory is allocated for each element of the array, even if
8749 the amount of space actually used by each element differs from element
8750 to element. Consider for instance the following array of type Rec:
8752 type Rec_Array is array (1 .. 2) of Rec;
8754 The actual amount of memory occupied by each element might be different
8755 from element to element, depending on the value of their discriminant.
8756 But the amount of space reserved for each element in the array remains
8757 fixed regardless. So we simply need to compute that size using
8758 the debugging information available, from which we can then determine
8759 the array size (we multiply the number of elements of the array by
8760 the size of each element).
8762 The simplest case is when we have an array of a constrained element
8763 type. For instance, consider the following type declarations:
8765 type Bounded_String (Max_Size : Integer) is
8767 Buffer : String (1 .. Max_Size);
8769 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8771 In this case, the compiler describes the array as an array of
8772 variable-size elements (identified by its XVS suffix) for which
8773 the size can be read in the parallel XVZ variable.
8775 In the case of an array of an unconstrained element type, the compiler
8776 wraps the array element inside a private PAD type. This type should not
8777 be shown to the user, and must be "unwrap"'ed before printing. Note
8778 that we also use the adjective "aligner" in our code to designate
8779 these wrapper types.
8781 In some cases, the size allocated for each element is statically
8782 known. In that case, the PAD type already has the correct size,
8783 and the array element should remain unfixed.
8785 But there are cases when this size is not statically known.
8786 For instance, assuming that "Five" is an integer variable:
8788 type Dynamic is array (1 .. Five) of Integer;
8789 type Wrapper (Has_Length : Boolean := False) is record
8792 when True => Length : Integer;
8796 type Wrapper_Array is array (1 .. 2) of Wrapper;
8798 Hello : Wrapper_Array := (others => (Has_Length => True,
8799 Data => (others => 17),
8803 The debugging info would describe variable Hello as being an
8804 array of a PAD type. The size of that PAD type is not statically
8805 known, but can be determined using a parallel XVZ variable.
8806 In that case, a copy of the PAD type with the correct size should
8807 be used for the fixed array.
8809 3. ``Fixing'' record type objects:
8810 ----------------------------------
8812 Things are slightly different from arrays in the case of dynamic
8813 record types. In this case, in order to compute the associated
8814 fixed type, we need to determine the size and offset of each of
8815 its components. This, in turn, requires us to compute the fixed
8816 type of each of these components.
8818 Consider for instance the example:
8820 type Bounded_String (Max_Size : Natural) is record
8821 Str : String (1 .. Max_Size);
8824 My_String : Bounded_String (Max_Size => 10);
8826 In that case, the position of field "Length" depends on the size
8827 of field Str, which itself depends on the value of the Max_Size
8828 discriminant. In order to fix the type of variable My_String,
8829 we need to fix the type of field Str. Therefore, fixing a variant
8830 record requires us to fix each of its components.
8832 However, if a component does not have a dynamic size, the component
8833 should not be fixed. In particular, fields that use a PAD type
8834 should not fixed. Here is an example where this might happen
8835 (assuming type Rec above):
8837 type Container (Big : Boolean) is record
8841 when True => Another : Integer;
8845 My_Container : Container := (Big => False,
8846 First => (Empty => True),
8849 In that example, the compiler creates a PAD type for component First,
8850 whose size is constant, and then positions the component After just
8851 right after it. The offset of component After is therefore constant
8854 The debugger computes the position of each field based on an algorithm
8855 that uses, among other things, the actual position and size of the field
8856 preceding it. Let's now imagine that the user is trying to print
8857 the value of My_Container. If the type fixing was recursive, we would
8858 end up computing the offset of field After based on the size of the
8859 fixed version of field First. And since in our example First has
8860 only one actual field, the size of the fixed type is actually smaller
8861 than the amount of space allocated to that field, and thus we would
8862 compute the wrong offset of field After.
8864 To make things more complicated, we need to watch out for dynamic
8865 components of variant records (identified by the ___XVL suffix in
8866 the component name). Even if the target type is a PAD type, the size
8867 of that type might not be statically known. So the PAD type needs
8868 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8869 we might end up with the wrong size for our component. This can be
8870 observed with the following type declarations:
8872 type Octal is new Integer range 0 .. 7;
8873 type Octal_Array is array (Positive range <>) of Octal;
8874 pragma Pack (Octal_Array);
8876 type Octal_Buffer (Size : Positive) is record
8877 Buffer : Octal_Array (1 .. Size);
8881 In that case, Buffer is a PAD type whose size is unset and needs
8882 to be computed by fixing the unwrapped type.
8884 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
8885 ----------------------------------------------------------
8887 Lastly, when should the sub-elements of an entity that remained unfixed
8888 thus far, be actually fixed?
8890 The answer is: Only when referencing that element. For instance
8891 when selecting one component of a record, this specific component
8892 should be fixed at that point in time. Or when printing the value
8893 of a record, each component should be fixed before its value gets
8894 printed. Similarly for arrays, the element of the array should be
8895 fixed when printing each element of the array, or when extracting
8896 one element out of that array. On the other hand, fixing should
8897 not be performed on the elements when taking a slice of an array!
8899 Note that one of the side-effects of miscomputing the offset and
8900 size of each field is that we end up also miscomputing the size
8901 of the containing type. This can have adverse results when computing
8902 the value of an entity. GDB fetches the value of an entity based
8903 on the size of its type, and thus a wrong size causes GDB to fetch
8904 the wrong amount of memory. In the case where the computed size is
8905 too small, GDB fetches too little data to print the value of our
8906 entiry. Results in this case as unpredicatble, as we usually read
8907 past the buffer containing the data =:-o. */
8909 /* Implement the evaluate_exp routine in the exp_descriptor structure
8910 for the Ada language. */
8912 static struct value *
8913 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
8914 int *pos, enum noside noside)
8919 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
8922 struct value **argvec;
8926 op = exp->elts[pc].opcode;
8932 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
8933 arg1 = unwrap_value (arg1);
8935 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8936 then we need to perform the conversion manually, because
8937 evaluate_subexp_standard doesn't do it. This conversion is
8938 necessary in Ada because the different kinds of float/fixed
8939 types in Ada have different representations.
8941 Similarly, we need to perform the conversion from OP_LONG
8943 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
8944 arg1 = ada_value_cast (expect_type, arg1, noside);
8950 struct value *result;
8953 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
8954 /* The result type will have code OP_STRING, bashed there from
8955 OP_ARRAY. Bash it back. */
8956 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
8957 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
8963 type = exp->elts[pc + 1].type;
8964 arg1 = evaluate_subexp (type, exp, pos, noside);
8965 if (noside == EVAL_SKIP)
8967 arg1 = ada_value_cast (type, arg1, noside);
8972 type = exp->elts[pc + 1].type;
8973 return ada_evaluate_subexp (type, exp, pos, noside);
8976 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8977 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8979 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
8980 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8982 return ada_value_assign (arg1, arg1);
8984 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8985 except if the lhs of our assignment is a convenience variable.
8986 In the case of assigning to a convenience variable, the lhs
8987 should be exactly the result of the evaluation of the rhs. */
8988 type = value_type (arg1);
8989 if (VALUE_LVAL (arg1) == lval_internalvar)
8991 arg2 = evaluate_subexp (type, exp, pos, noside);
8992 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8994 if (ada_is_fixed_point_type (value_type (arg1)))
8995 arg2 = cast_to_fixed (value_type (arg1), arg2);
8996 else if (ada_is_fixed_point_type (value_type (arg2)))
8998 (_("Fixed-point values must be assigned to fixed-point variables"));
9000 arg2 = coerce_for_assign (value_type (arg1), arg2);
9001 return ada_value_assign (arg1, arg2);
9004 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9005 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9006 if (noside == EVAL_SKIP)
9008 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9009 return (value_from_longest
9011 value_as_long (arg1) + value_as_long (arg2)));
9012 if ((ada_is_fixed_point_type (value_type (arg1))
9013 || ada_is_fixed_point_type (value_type (arg2)))
9014 && value_type (arg1) != value_type (arg2))
9015 error (_("Operands of fixed-point addition must have the same type"));
9016 /* Do the addition, and cast the result to the type of the first
9017 argument. We cannot cast the result to a reference type, so if
9018 ARG1 is a reference type, find its underlying type. */
9019 type = value_type (arg1);
9020 while (TYPE_CODE (type) == TYPE_CODE_REF)
9021 type = TYPE_TARGET_TYPE (type);
9022 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9023 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
9026 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9027 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9028 if (noside == EVAL_SKIP)
9030 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9031 return (value_from_longest
9033 value_as_long (arg1) - value_as_long (arg2)));
9034 if ((ada_is_fixed_point_type (value_type (arg1))
9035 || ada_is_fixed_point_type (value_type (arg2)))
9036 && value_type (arg1) != value_type (arg2))
9037 error (_("Operands of fixed-point subtraction must have the same type"));
9038 /* Do the substraction, and cast the result to the type of the first
9039 argument. We cannot cast the result to a reference type, so if
9040 ARG1 is a reference type, find its underlying type. */
9041 type = value_type (arg1);
9042 while (TYPE_CODE (type) == TYPE_CODE_REF)
9043 type = TYPE_TARGET_TYPE (type);
9044 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9045 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
9051 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9052 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9053 if (noside == EVAL_SKIP)
9055 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9057 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9058 return value_zero (value_type (arg1), not_lval);
9062 type = builtin_type (exp->gdbarch)->builtin_double;
9063 if (ada_is_fixed_point_type (value_type (arg1)))
9064 arg1 = cast_from_fixed (type, arg1);
9065 if (ada_is_fixed_point_type (value_type (arg2)))
9066 arg2 = cast_from_fixed (type, arg2);
9067 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9068 return ada_value_binop (arg1, arg2, op);
9072 case BINOP_NOTEQUAL:
9073 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9074 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
9075 if (noside == EVAL_SKIP)
9077 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9081 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9082 tem = ada_value_equal (arg1, arg2);
9084 if (op == BINOP_NOTEQUAL)
9086 type = language_bool_type (exp->language_defn, exp->gdbarch);
9087 return value_from_longest (type, (LONGEST) tem);
9090 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9091 if (noside == EVAL_SKIP)
9093 else if (ada_is_fixed_point_type (value_type (arg1)))
9094 return value_cast (value_type (arg1), value_neg (arg1));
9097 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9098 return value_neg (arg1);
9101 case BINOP_LOGICAL_AND:
9102 case BINOP_LOGICAL_OR:
9103 case UNOP_LOGICAL_NOT:
9108 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9109 type = language_bool_type (exp->language_defn, exp->gdbarch);
9110 return value_cast (type, val);
9113 case BINOP_BITWISE_AND:
9114 case BINOP_BITWISE_IOR:
9115 case BINOP_BITWISE_XOR:
9119 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9121 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9123 return value_cast (value_type (arg1), val);
9129 if (noside == EVAL_SKIP)
9134 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
9135 /* Only encountered when an unresolved symbol occurs in a
9136 context other than a function call, in which case, it is
9138 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9139 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
9140 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9142 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
9143 /* Check to see if this is a tagged type. We also need to handle
9144 the case where the type is a reference to a tagged type, but
9145 we have to be careful to exclude pointers to tagged types.
9146 The latter should be shown as usual (as a pointer), whereas
9147 a reference should mostly be transparent to the user. */
9148 if (ada_is_tagged_type (type, 0)
9149 || (TYPE_CODE(type) == TYPE_CODE_REF
9150 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
9152 /* Tagged types are a little special in the fact that the real
9153 type is dynamic and can only be determined by inspecting the
9154 object's tag. This means that we need to get the object's
9155 value first (EVAL_NORMAL) and then extract the actual object
9158 Note that we cannot skip the final step where we extract
9159 the object type from its tag, because the EVAL_NORMAL phase
9160 results in dynamic components being resolved into fixed ones.
9161 This can cause problems when trying to print the type
9162 description of tagged types whose parent has a dynamic size:
9163 We use the type name of the "_parent" component in order
9164 to print the name of the ancestor type in the type description.
9165 If that component had a dynamic size, the resolution into
9166 a fixed type would result in the loss of that type name,
9167 thus preventing us from printing the name of the ancestor
9168 type in the type description. */
9169 struct type *actual_type;
9171 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
9172 actual_type = type_from_tag (ada_value_tag (arg1));
9173 if (actual_type == NULL)
9174 /* If, for some reason, we were unable to determine
9175 the actual type from the tag, then use the static
9176 approximation that we just computed as a fallback.
9177 This can happen if the debugging information is
9178 incomplete, for instance. */
9181 return value_zero (actual_type, not_lval);
9186 (to_static_fixed_type
9187 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
9192 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9193 arg1 = unwrap_value (arg1);
9194 return ada_to_fixed_value (arg1);
9200 /* Allocate arg vector, including space for the function to be
9201 called in argvec[0] and a terminating NULL. */
9202 nargs = longest_to_int (exp->elts[pc + 1].longconst);
9204 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
9206 if (exp->elts[*pos].opcode == OP_VAR_VALUE
9207 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
9208 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9209 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
9212 for (tem = 0; tem <= nargs; tem += 1)
9213 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9216 if (noside == EVAL_SKIP)
9220 if (ada_is_constrained_packed_array_type
9221 (desc_base_type (value_type (argvec[0]))))
9222 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
9223 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9224 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
9225 /* This is a packed array that has already been fixed, and
9226 therefore already coerced to a simple array. Nothing further
9229 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
9230 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9231 && VALUE_LVAL (argvec[0]) == lval_memory))
9232 argvec[0] = value_addr (argvec[0]);
9234 type = ada_check_typedef (value_type (argvec[0]));
9235 if (TYPE_CODE (type) == TYPE_CODE_PTR)
9237 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
9239 case TYPE_CODE_FUNC:
9240 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9242 case TYPE_CODE_ARRAY:
9244 case TYPE_CODE_STRUCT:
9245 if (noside != EVAL_AVOID_SIDE_EFFECTS)
9246 argvec[0] = ada_value_ind (argvec[0]);
9247 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
9250 error (_("cannot subscript or call something of type `%s'"),
9251 ada_type_name (value_type (argvec[0])));
9256 switch (TYPE_CODE (type))
9258 case TYPE_CODE_FUNC:
9259 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9260 return allocate_value (TYPE_TARGET_TYPE (type));
9261 return call_function_by_hand (argvec[0], nargs, argvec + 1);
9262 case TYPE_CODE_STRUCT:
9266 arity = ada_array_arity (type);
9267 type = ada_array_element_type (type, nargs);
9269 error (_("cannot subscript or call a record"));
9271 error (_("wrong number of subscripts; expecting %d"), arity);
9272 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9273 return value_zero (ada_aligned_type (type), lval_memory);
9275 unwrap_value (ada_value_subscript
9276 (argvec[0], nargs, argvec + 1));
9278 case TYPE_CODE_ARRAY:
9279 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9281 type = ada_array_element_type (type, nargs);
9283 error (_("element type of array unknown"));
9285 return value_zero (ada_aligned_type (type), lval_memory);
9288 unwrap_value (ada_value_subscript
9289 (ada_coerce_to_simple_array (argvec[0]),
9290 nargs, argvec + 1));
9291 case TYPE_CODE_PTR: /* Pointer to array */
9292 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
9293 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9295 type = ada_array_element_type (type, nargs);
9297 error (_("element type of array unknown"));
9299 return value_zero (ada_aligned_type (type), lval_memory);
9302 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
9303 nargs, argvec + 1));
9306 error (_("Attempt to index or call something other than an "
9307 "array or function"));
9312 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9313 struct value *low_bound_val =
9314 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9315 struct value *high_bound_val =
9316 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9320 low_bound_val = coerce_ref (low_bound_val);
9321 high_bound_val = coerce_ref (high_bound_val);
9322 low_bound = pos_atr (low_bound_val);
9323 high_bound = pos_atr (high_bound_val);
9325 if (noside == EVAL_SKIP)
9328 /* If this is a reference to an aligner type, then remove all
9330 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9331 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
9332 TYPE_TARGET_TYPE (value_type (array)) =
9333 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
9335 if (ada_is_constrained_packed_array_type (value_type (array)))
9336 error (_("cannot slice a packed array"));
9338 /* If this is a reference to an array or an array lvalue,
9339 convert to a pointer. */
9340 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9341 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
9342 && VALUE_LVAL (array) == lval_memory))
9343 array = value_addr (array);
9345 if (noside == EVAL_AVOID_SIDE_EFFECTS
9346 && ada_is_array_descriptor_type (ada_check_typedef
9347 (value_type (array))))
9348 return empty_array (ada_type_of_array (array, 0), low_bound);
9350 array = ada_coerce_to_simple_array_ptr (array);
9352 /* If we have more than one level of pointer indirection,
9353 dereference the value until we get only one level. */
9354 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
9355 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
9357 array = value_ind (array);
9359 /* Make sure we really do have an array type before going further,
9360 to avoid a SEGV when trying to get the index type or the target
9361 type later down the road if the debug info generated by
9362 the compiler is incorrect or incomplete. */
9363 if (!ada_is_simple_array_type (value_type (array)))
9364 error (_("cannot take slice of non-array"));
9366 if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
9368 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
9369 return empty_array (TYPE_TARGET_TYPE (value_type (array)),
9373 struct type *arr_type0 =
9374 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
9377 return ada_value_slice_from_ptr (array, arr_type0,
9378 longest_to_int (low_bound),
9379 longest_to_int (high_bound));
9382 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9384 else if (high_bound < low_bound)
9385 return empty_array (value_type (array), low_bound);
9387 return ada_value_slice (array, longest_to_int (low_bound),
9388 longest_to_int (high_bound));
9393 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9394 type = check_typedef (exp->elts[pc + 1].type);
9396 if (noside == EVAL_SKIP)
9399 switch (TYPE_CODE (type))
9402 lim_warning (_("Membership test incompletely implemented; "
9403 "always returns true"));
9404 type = language_bool_type (exp->language_defn, exp->gdbarch);
9405 return value_from_longest (type, (LONGEST) 1);
9407 case TYPE_CODE_RANGE:
9408 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
9409 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
9410 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9411 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9412 type = language_bool_type (exp->language_defn, exp->gdbarch);
9414 value_from_longest (type,
9415 (value_less (arg1, arg3)
9416 || value_equal (arg1, arg3))
9417 && (value_less (arg2, arg1)
9418 || value_equal (arg2, arg1)));
9421 case BINOP_IN_BOUNDS:
9423 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9424 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9426 if (noside == EVAL_SKIP)
9429 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9431 type = language_bool_type (exp->language_defn, exp->gdbarch);
9432 return value_zero (type, not_lval);
9435 tem = longest_to_int (exp->elts[pc + 1].longconst);
9437 type = ada_index_type (value_type (arg2), tem, "range");
9439 type = value_type (arg1);
9441 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
9442 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
9444 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9445 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9446 type = language_bool_type (exp->language_defn, exp->gdbarch);
9448 value_from_longest (type,
9449 (value_less (arg1, arg3)
9450 || value_equal (arg1, arg3))
9451 && (value_less (arg2, arg1)
9452 || value_equal (arg2, arg1)));
9454 case TERNOP_IN_RANGE:
9455 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9456 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9457 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9459 if (noside == EVAL_SKIP)
9462 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9463 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9464 type = language_bool_type (exp->language_defn, exp->gdbarch);
9466 value_from_longest (type,
9467 (value_less (arg1, arg3)
9468 || value_equal (arg1, arg3))
9469 && (value_less (arg2, arg1)
9470 || value_equal (arg2, arg1)));
9476 struct type *type_arg;
9478 if (exp->elts[*pos].opcode == OP_TYPE)
9480 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9482 type_arg = check_typedef (exp->elts[pc + 2].type);
9486 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9490 if (exp->elts[*pos].opcode != OP_LONG)
9491 error (_("Invalid operand to '%s"), ada_attribute_name (op));
9492 tem = longest_to_int (exp->elts[*pos + 2].longconst);
9495 if (noside == EVAL_SKIP)
9498 if (type_arg == NULL)
9500 arg1 = ada_coerce_ref (arg1);
9502 if (ada_is_constrained_packed_array_type (value_type (arg1)))
9503 arg1 = ada_coerce_to_simple_array (arg1);
9505 type = ada_index_type (value_type (arg1), tem,
9506 ada_attribute_name (op));
9508 type = builtin_type (exp->gdbarch)->builtin_int;
9510 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9511 return allocate_value (type);
9515 default: /* Should never happen. */
9516 error (_("unexpected attribute encountered"));
9518 return value_from_longest
9519 (type, ada_array_bound (arg1, tem, 0));
9521 return value_from_longest
9522 (type, ada_array_bound (arg1, tem, 1));
9524 return value_from_longest
9525 (type, ada_array_length (arg1, tem));
9528 else if (discrete_type_p (type_arg))
9530 struct type *range_type;
9531 char *name = ada_type_name (type_arg);
9534 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
9535 range_type = to_fixed_range_type (type_arg, NULL);
9536 if (range_type == NULL)
9537 range_type = type_arg;
9541 error (_("unexpected attribute encountered"));
9543 return value_from_longest
9544 (range_type, ada_discrete_type_low_bound (range_type));
9546 return value_from_longest
9547 (range_type, ada_discrete_type_high_bound (range_type));
9549 error (_("the 'length attribute applies only to array types"));
9552 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
9553 error (_("unimplemented type attribute"));
9558 if (ada_is_constrained_packed_array_type (type_arg))
9559 type_arg = decode_constrained_packed_array_type (type_arg);
9561 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
9563 type = builtin_type (exp->gdbarch)->builtin_int;
9565 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9566 return allocate_value (type);
9571 error (_("unexpected attribute encountered"));
9573 low = ada_array_bound_from_type (type_arg, tem, 0);
9574 return value_from_longest (type, low);
9576 high = ada_array_bound_from_type (type_arg, tem, 1);
9577 return value_from_longest (type, high);
9579 low = ada_array_bound_from_type (type_arg, tem, 0);
9580 high = ada_array_bound_from_type (type_arg, tem, 1);
9581 return value_from_longest (type, high - low + 1);
9587 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9588 if (noside == EVAL_SKIP)
9591 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9592 return value_zero (ada_tag_type (arg1), not_lval);
9594 return ada_value_tag (arg1);
9598 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9599 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9600 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9601 if (noside == EVAL_SKIP)
9603 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9604 return value_zero (value_type (arg1), not_lval);
9607 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9608 return value_binop (arg1, arg2,
9609 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
9612 case OP_ATR_MODULUS:
9614 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
9616 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9617 if (noside == EVAL_SKIP)
9620 if (!ada_is_modular_type (type_arg))
9621 error (_("'modulus must be applied to modular type"));
9623 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
9624 ada_modulus (type_arg));
9629 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9630 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9631 if (noside == EVAL_SKIP)
9633 type = builtin_type (exp->gdbarch)->builtin_int;
9634 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9635 return value_zero (type, not_lval);
9637 return value_pos_atr (type, arg1);
9640 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9641 type = value_type (arg1);
9643 /* If the argument is a reference, then dereference its type, since
9644 the user is really asking for the size of the actual object,
9645 not the size of the pointer. */
9646 if (TYPE_CODE (type) == TYPE_CODE_REF)
9647 type = TYPE_TARGET_TYPE (type);
9649 if (noside == EVAL_SKIP)
9651 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9652 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
9654 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
9655 TARGET_CHAR_BIT * TYPE_LENGTH (type));
9658 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9659 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9660 type = exp->elts[pc + 2].type;
9661 if (noside == EVAL_SKIP)
9663 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9664 return value_zero (type, not_lval);
9666 return value_val_atr (type, arg1);
9669 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9670 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9671 if (noside == EVAL_SKIP)
9673 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9674 return value_zero (value_type (arg1), not_lval);
9677 /* For integer exponentiation operations,
9678 only promote the first argument. */
9679 if (is_integral_type (value_type (arg2)))
9680 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9682 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9684 return value_binop (arg1, arg2, op);
9688 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9689 if (noside == EVAL_SKIP)
9695 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9696 if (noside == EVAL_SKIP)
9698 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9699 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
9700 return value_neg (arg1);
9705 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9706 if (noside == EVAL_SKIP)
9708 type = ada_check_typedef (value_type (arg1));
9709 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9711 if (ada_is_array_descriptor_type (type))
9712 /* GDB allows dereferencing GNAT array descriptors. */
9714 struct type *arrType = ada_type_of_array (arg1, 0);
9716 if (arrType == NULL)
9717 error (_("Attempt to dereference null array pointer."));
9718 return value_at_lazy (arrType, 0);
9720 else if (TYPE_CODE (type) == TYPE_CODE_PTR
9721 || TYPE_CODE (type) == TYPE_CODE_REF
9722 /* In C you can dereference an array to get the 1st elt. */
9723 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
9725 type = to_static_fixed_type
9727 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
9729 return value_zero (type, lval_memory);
9731 else if (TYPE_CODE (type) == TYPE_CODE_INT)
9733 /* GDB allows dereferencing an int. */
9734 if (expect_type == NULL)
9735 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
9740 to_static_fixed_type (ada_aligned_type (expect_type));
9741 return value_zero (expect_type, lval_memory);
9745 error (_("Attempt to take contents of a non-pointer value."));
9747 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
9748 type = ada_check_typedef (value_type (arg1));
9750 if (TYPE_CODE (type) == TYPE_CODE_INT)
9751 /* GDB allows dereferencing an int. If we were given
9752 the expect_type, then use that as the target type.
9753 Otherwise, assume that the target type is an int. */
9755 if (expect_type != NULL)
9756 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
9759 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
9760 (CORE_ADDR) value_as_address (arg1));
9763 if (ada_is_array_descriptor_type (type))
9764 /* GDB allows dereferencing GNAT array descriptors. */
9765 return ada_coerce_to_simple_array (arg1);
9767 return ada_value_ind (arg1);
9769 case STRUCTOP_STRUCT:
9770 tem = longest_to_int (exp->elts[pc + 1].longconst);
9771 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
9772 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9773 if (noside == EVAL_SKIP)
9775 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9777 struct type *type1 = value_type (arg1);
9779 if (ada_is_tagged_type (type1, 1))
9781 type = ada_lookup_struct_elt_type (type1,
9782 &exp->elts[pc + 2].string,
9785 /* In this case, we assume that the field COULD exist
9786 in some extension of the type. Return an object of
9787 "type" void, which will match any formal
9788 (see ada_type_match). */
9789 return value_zero (builtin_type (exp->gdbarch)->builtin_void,
9794 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
9797 return value_zero (ada_aligned_type (type), lval_memory);
9800 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
9801 arg1 = unwrap_value (arg1);
9802 return ada_to_fixed_value (arg1);
9805 /* The value is not supposed to be used. This is here to make it
9806 easier to accommodate expressions that contain types. */
9808 if (noside == EVAL_SKIP)
9810 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9811 return allocate_value (exp->elts[pc + 1].type);
9813 error (_("Attempt to use a type name as an expression"));
9818 case OP_DISCRETE_RANGE:
9821 if (noside == EVAL_NORMAL)
9825 error (_("Undefined name, ambiguous name, or renaming used in "
9826 "component association: %s."), &exp->elts[pc+2].string);
9828 error (_("Aggregates only allowed on the right of an assignment"));
9830 internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
9833 ada_forward_operator_length (exp, pc, &oplen, &nargs);
9835 for (tem = 0; tem < nargs; tem += 1)
9836 ada_evaluate_subexp (NULL, exp, pos, noside);
9841 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
9847 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9848 type name that encodes the 'small and 'delta information.
9849 Otherwise, return NULL. */
9852 fixed_type_info (struct type *type)
9854 const char *name = ada_type_name (type);
9855 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
9857 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
9859 const char *tail = strstr (name, "___XF_");
9866 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
9867 return fixed_type_info (TYPE_TARGET_TYPE (type));
9872 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9875 ada_is_fixed_point_type (struct type *type)
9877 return fixed_type_info (type) != NULL;
9880 /* Return non-zero iff TYPE represents a System.Address type. */
9883 ada_is_system_address_type (struct type *type)
9885 return (TYPE_NAME (type)
9886 && strcmp (TYPE_NAME (type), "system__address") == 0);
9889 /* Assuming that TYPE is the representation of an Ada fixed-point
9890 type, return its delta, or -1 if the type is malformed and the
9891 delta cannot be determined. */
9894 ada_delta (struct type *type)
9896 const char *encoding = fixed_type_info (type);
9899 /* Strictly speaking, num and den are encoded as integer. However,
9900 they may not fit into a long, and they will have to be converted
9901 to DOUBLEST anyway. So scan them as DOUBLEST. */
9902 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
9909 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9910 factor ('SMALL value) associated with the type. */
9913 scaling_factor (struct type *type)
9915 const char *encoding = fixed_type_info (type);
9916 DOUBLEST num0, den0, num1, den1;
9919 /* Strictly speaking, num's and den's are encoded as integer. However,
9920 they may not fit into a long, and they will have to be converted
9921 to DOUBLEST anyway. So scan them as DOUBLEST. */
9922 n = sscanf (encoding,
9923 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
9924 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
9925 &num0, &den0, &num1, &den1);
9936 /* Assuming that X is the representation of a value of fixed-point
9937 type TYPE, return its floating-point equivalent. */
9940 ada_fixed_to_float (struct type *type, LONGEST x)
9942 return (DOUBLEST) x *scaling_factor (type);
9945 /* The representation of a fixed-point value of type TYPE
9946 corresponding to the value X. */
9949 ada_float_to_fixed (struct type *type, DOUBLEST x)
9951 return (LONGEST) (x / scaling_factor (type) + 0.5);
9958 /* Scan STR beginning at position K for a discriminant name, and
9959 return the value of that discriminant field of DVAL in *PX. If
9960 PNEW_K is not null, put the position of the character beyond the
9961 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9962 not alter *PX and *PNEW_K if unsuccessful. */
9965 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
9968 static char *bound_buffer = NULL;
9969 static size_t bound_buffer_len = 0;
9972 struct value *bound_val;
9974 if (dval == NULL || str == NULL || str[k] == '\0')
9977 pend = strstr (str + k, "__");
9981 k += strlen (bound);
9985 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
9986 bound = bound_buffer;
9987 strncpy (bound_buffer, str + k, pend - (str + k));
9988 bound[pend - (str + k)] = '\0';
9992 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
9993 if (bound_val == NULL)
9996 *px = value_as_long (bound_val);
10002 /* Value of variable named NAME in the current environment. If
10003 no such variable found, then if ERR_MSG is null, returns 0, and
10004 otherwise causes an error with message ERR_MSG. */
10006 static struct value *
10007 get_var_value (char *name, char *err_msg)
10009 struct ada_symbol_info *syms;
10012 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
10017 if (err_msg == NULL)
10020 error (("%s"), err_msg);
10023 return value_of_variable (syms[0].sym, syms[0].block);
10026 /* Value of integer variable named NAME in the current environment. If
10027 no such variable found, returns 0, and sets *FLAG to 0. If
10028 successful, sets *FLAG to 1. */
10031 get_int_var_value (char *name, int *flag)
10033 struct value *var_val = get_var_value (name, 0);
10045 return value_as_long (var_val);
10050 /* Return a range type whose base type is that of the range type named
10051 NAME in the current environment, and whose bounds are calculated
10052 from NAME according to the GNAT range encoding conventions.
10053 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10054 corresponding range type from debug information; fall back to using it
10055 if symbol lookup fails. If a new type must be created, allocate it
10056 like ORIG_TYPE was. The bounds information, in general, is encoded
10057 in NAME, the base type given in the named range type. */
10059 static struct type *
10060 to_fixed_range_type (struct type *raw_type, struct value *dval)
10063 struct type *base_type;
10064 char *subtype_info;
10066 gdb_assert (raw_type != NULL);
10067 gdb_assert (TYPE_NAME (raw_type) != NULL);
10069 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
10070 base_type = TYPE_TARGET_TYPE (raw_type);
10072 base_type = raw_type;
10074 name = TYPE_NAME (raw_type);
10075 subtype_info = strstr (name, "___XD");
10076 if (subtype_info == NULL)
10078 LONGEST L = ada_discrete_type_low_bound (raw_type);
10079 LONGEST U = ada_discrete_type_high_bound (raw_type);
10081 if (L < INT_MIN || U > INT_MAX)
10084 return create_range_type (alloc_type_copy (raw_type), raw_type,
10085 ada_discrete_type_low_bound (raw_type),
10086 ada_discrete_type_high_bound (raw_type));
10090 static char *name_buf = NULL;
10091 static size_t name_len = 0;
10092 int prefix_len = subtype_info - name;
10098 GROW_VECT (name_buf, name_len, prefix_len + 5);
10099 strncpy (name_buf, name, prefix_len);
10100 name_buf[prefix_len] = '\0';
10103 bounds_str = strchr (subtype_info, '_');
10106 if (*subtype_info == 'L')
10108 if (!ada_scan_number (bounds_str, n, &L, &n)
10109 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
10111 if (bounds_str[n] == '_')
10113 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
10121 strcpy (name_buf + prefix_len, "___L");
10122 L = get_int_var_value (name_buf, &ok);
10125 lim_warning (_("Unknown lower bound, using 1."));
10130 if (*subtype_info == 'U')
10132 if (!ada_scan_number (bounds_str, n, &U, &n)
10133 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
10140 strcpy (name_buf + prefix_len, "___U");
10141 U = get_int_var_value (name_buf, &ok);
10144 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
10149 type = create_range_type (alloc_type_copy (raw_type), base_type, L, U);
10150 TYPE_NAME (type) = name;
10155 /* True iff NAME is the name of a range type. */
10158 ada_is_range_type_name (const char *name)
10160 return (name != NULL && strstr (name, "___XD"));
10164 /* Modular types */
10166 /* True iff TYPE is an Ada modular type. */
10169 ada_is_modular_type (struct type *type)
10171 struct type *subranged_type = base_type (type);
10173 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
10174 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
10175 && TYPE_UNSIGNED (subranged_type));
10178 /* Try to determine the lower and upper bounds of the given modular type
10179 using the type name only. Return non-zero and set L and U as the lower
10180 and upper bounds (respectively) if successful. */
10183 ada_modulus_from_name (struct type *type, ULONGEST *modulus)
10185 char *name = ada_type_name (type);
10193 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10194 we are looking for static bounds, which means an __XDLU suffix.
10195 Moreover, we know that the lower bound of modular types is always
10196 zero, so the actual suffix should start with "__XDLU_0__", and
10197 then be followed by the upper bound value. */
10198 suffix = strstr (name, "__XDLU_0__");
10199 if (suffix == NULL)
10202 if (!ada_scan_number (suffix, k, &U, NULL))
10205 *modulus = (ULONGEST) U + 1;
10209 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10212 ada_modulus (struct type *type)
10214 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
10218 /* Ada exception catchpoint support:
10219 ---------------------------------
10221 We support 3 kinds of exception catchpoints:
10222 . catchpoints on Ada exceptions
10223 . catchpoints on unhandled Ada exceptions
10224 . catchpoints on failed assertions
10226 Exceptions raised during failed assertions, or unhandled exceptions
10227 could perfectly be caught with the general catchpoint on Ada exceptions.
10228 However, we can easily differentiate these two special cases, and having
10229 the option to distinguish these two cases from the rest can be useful
10230 to zero-in on certain situations.
10232 Exception catchpoints are a specialized form of breakpoint,
10233 since they rely on inserting breakpoints inside known routines
10234 of the GNAT runtime. The implementation therefore uses a standard
10235 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10238 Support in the runtime for exception catchpoints have been changed
10239 a few times already, and these changes affect the implementation
10240 of these catchpoints. In order to be able to support several
10241 variants of the runtime, we use a sniffer that will determine
10242 the runtime variant used by the program being debugged.
10244 At this time, we do not support the use of conditions on Ada exception
10245 catchpoints. The COND and COND_STRING fields are therefore set
10246 to NULL (most of the time, see below).
10248 Conditions where EXP_STRING, COND, and COND_STRING are used:
10250 When a user specifies the name of a specific exception in the case
10251 of catchpoints on Ada exceptions, we store the name of that exception
10252 in the EXP_STRING. We then translate this request into an actual
10253 condition stored in COND_STRING, and then parse it into an expression
10256 /* The different types of catchpoints that we introduced for catching
10259 enum exception_catchpoint_kind
10261 ex_catch_exception,
10262 ex_catch_exception_unhandled,
10266 /* Ada's standard exceptions. */
10268 static char *standard_exc[] = {
10269 "constraint_error",
10275 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
10277 /* A structure that describes how to support exception catchpoints
10278 for a given executable. */
10280 struct exception_support_info
10282 /* The name of the symbol to break on in order to insert
10283 a catchpoint on exceptions. */
10284 const char *catch_exception_sym;
10286 /* The name of the symbol to break on in order to insert
10287 a catchpoint on unhandled exceptions. */
10288 const char *catch_exception_unhandled_sym;
10290 /* The name of the symbol to break on in order to insert
10291 a catchpoint on failed assertions. */
10292 const char *catch_assert_sym;
10294 /* Assuming that the inferior just triggered an unhandled exception
10295 catchpoint, this function is responsible for returning the address
10296 in inferior memory where the name of that exception is stored.
10297 Return zero if the address could not be computed. */
10298 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
10301 static CORE_ADDR ada_unhandled_exception_name_addr (void);
10302 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
10304 /* The following exception support info structure describes how to
10305 implement exception catchpoints with the latest version of the
10306 Ada runtime (as of 2007-03-06). */
10308 static const struct exception_support_info default_exception_support_info =
10310 "__gnat_debug_raise_exception", /* catch_exception_sym */
10311 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10312 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10313 ada_unhandled_exception_name_addr
10316 /* The following exception support info structure describes how to
10317 implement exception catchpoints with a slightly older version
10318 of the Ada runtime. */
10320 static const struct exception_support_info exception_support_info_fallback =
10322 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10323 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10324 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10325 ada_unhandled_exception_name_addr_from_raise
10328 /* For each executable, we sniff which exception info structure to use
10329 and cache it in the following global variable. */
10331 static const struct exception_support_info *exception_info = NULL;
10333 /* Inspect the Ada runtime and determine which exception info structure
10334 should be used to provide support for exception catchpoints.
10336 This function will always set exception_info, or raise an error. */
10339 ada_exception_support_info_sniffer (void)
10341 struct symbol *sym;
10343 /* If the exception info is already known, then no need to recompute it. */
10344 if (exception_info != NULL)
10347 /* Check the latest (default) exception support info. */
10348 sym = standard_lookup (default_exception_support_info.catch_exception_sym,
10352 exception_info = &default_exception_support_info;
10356 /* Try our fallback exception suport info. */
10357 sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
10361 exception_info = &exception_support_info_fallback;
10365 /* Sometimes, it is normal for us to not be able to find the routine
10366 we are looking for. This happens when the program is linked with
10367 the shared version of the GNAT runtime, and the program has not been
10368 started yet. Inform the user of these two possible causes if
10371 if (ada_update_initial_language (language_unknown) != language_ada)
10372 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10374 /* If the symbol does not exist, then check that the program is
10375 already started, to make sure that shared libraries have been
10376 loaded. If it is not started, this may mean that the symbol is
10377 in a shared library. */
10379 if (ptid_get_pid (inferior_ptid) == 0)
10380 error (_("Unable to insert catchpoint. Try to start the program first."));
10382 /* At this point, we know that we are debugging an Ada program and
10383 that the inferior has been started, but we still are not able to
10384 find the run-time symbols. That can mean that we are in
10385 configurable run time mode, or that a-except as been optimized
10386 out by the linker... In any case, at this point it is not worth
10387 supporting this feature. */
10389 error (_("Cannot insert catchpoints in this configuration."));
10392 /* An observer of "executable_changed" events.
10393 Its role is to clear certain cached values that need to be recomputed
10394 each time a new executable is loaded by GDB. */
10397 ada_executable_changed_observer (void)
10399 /* If the executable changed, then it is possible that the Ada runtime
10400 is different. So we need to invalidate the exception support info
10402 exception_info = NULL;
10405 /* True iff FRAME is very likely to be that of a function that is
10406 part of the runtime system. This is all very heuristic, but is
10407 intended to be used as advice as to what frames are uninteresting
10411 is_known_support_routine (struct frame_info *frame)
10413 struct symtab_and_line sal;
10415 enum language func_lang;
10418 /* If this code does not have any debugging information (no symtab),
10419 This cannot be any user code. */
10421 find_frame_sal (frame, &sal);
10422 if (sal.symtab == NULL)
10425 /* If there is a symtab, but the associated source file cannot be
10426 located, then assume this is not user code: Selecting a frame
10427 for which we cannot display the code would not be very helpful
10428 for the user. This should also take care of case such as VxWorks
10429 where the kernel has some debugging info provided for a few units. */
10431 if (symtab_to_fullname (sal.symtab) == NULL)
10434 /* Check the unit filename againt the Ada runtime file naming.
10435 We also check the name of the objfile against the name of some
10436 known system libraries that sometimes come with debugging info
10439 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
10441 re_comp (known_runtime_file_name_patterns[i]);
10442 if (re_exec (sal.symtab->filename))
10444 if (sal.symtab->objfile != NULL
10445 && re_exec (sal.symtab->objfile->name))
10449 /* Check whether the function is a GNAT-generated entity. */
10451 find_frame_funname (frame, &func_name, &func_lang, NULL);
10452 if (func_name == NULL)
10455 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
10457 re_comp (known_auxiliary_function_name_patterns[i]);
10458 if (re_exec (func_name))
10465 /* Find the first frame that contains debugging information and that is not
10466 part of the Ada run-time, starting from FI and moving upward. */
10469 ada_find_printable_frame (struct frame_info *fi)
10471 for (; fi != NULL; fi = get_prev_frame (fi))
10473 if (!is_known_support_routine (fi))
10482 /* Assuming that the inferior just triggered an unhandled exception
10483 catchpoint, return the address in inferior memory where the name
10484 of the exception is stored.
10486 Return zero if the address could not be computed. */
10489 ada_unhandled_exception_name_addr (void)
10491 return parse_and_eval_address ("e.full_name");
10494 /* Same as ada_unhandled_exception_name_addr, except that this function
10495 should be used when the inferior uses an older version of the runtime,
10496 where the exception name needs to be extracted from a specific frame
10497 several frames up in the callstack. */
10500 ada_unhandled_exception_name_addr_from_raise (void)
10503 struct frame_info *fi;
10505 /* To determine the name of this exception, we need to select
10506 the frame corresponding to RAISE_SYM_NAME. This frame is
10507 at least 3 levels up, so we simply skip the first 3 frames
10508 without checking the name of their associated function. */
10509 fi = get_current_frame ();
10510 for (frame_level = 0; frame_level < 3; frame_level += 1)
10512 fi = get_prev_frame (fi);
10517 enum language func_lang;
10519 find_frame_funname (fi, &func_name, &func_lang, NULL);
10520 if (func_name != NULL
10521 && strcmp (func_name, exception_info->catch_exception_sym) == 0)
10522 break; /* We found the frame we were looking for... */
10523 fi = get_prev_frame (fi);
10530 return parse_and_eval_address ("id.full_name");
10533 /* Assuming the inferior just triggered an Ada exception catchpoint
10534 (of any type), return the address in inferior memory where the name
10535 of the exception is stored, if applicable.
10537 Return zero if the address could not be computed, or if not relevant. */
10540 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
10541 struct breakpoint *b)
10545 case ex_catch_exception:
10546 return (parse_and_eval_address ("e.full_name"));
10549 case ex_catch_exception_unhandled:
10550 return exception_info->unhandled_exception_name_addr ();
10553 case ex_catch_assert:
10554 return 0; /* Exception name is not relevant in this case. */
10558 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10562 return 0; /* Should never be reached. */
10565 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10566 any error that ada_exception_name_addr_1 might cause to be thrown.
10567 When an error is intercepted, a warning with the error message is printed,
10568 and zero is returned. */
10571 ada_exception_name_addr (enum exception_catchpoint_kind ex,
10572 struct breakpoint *b)
10574 struct gdb_exception e;
10575 CORE_ADDR result = 0;
10577 TRY_CATCH (e, RETURN_MASK_ERROR)
10579 result = ada_exception_name_addr_1 (ex, b);
10584 warning (_("failed to get exception name: %s"), e.message);
10591 /* Implement the PRINT_IT method in the breakpoint_ops structure
10592 for all exception catchpoint kinds. */
10594 static enum print_stop_action
10595 print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
10597 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
10598 char exception_name[256];
10602 read_memory (addr, exception_name, sizeof (exception_name) - 1);
10603 exception_name [sizeof (exception_name) - 1] = '\0';
10606 ada_find_printable_frame (get_current_frame ());
10608 annotate_catchpoint (b->number);
10611 case ex_catch_exception:
10613 printf_filtered (_("\nCatchpoint %d, %s at "),
10614 b->number, exception_name);
10616 printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
10618 case ex_catch_exception_unhandled:
10620 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10621 b->number, exception_name);
10623 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10626 case ex_catch_assert:
10627 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10632 return PRINT_SRC_AND_LOC;
10635 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10636 for all exception catchpoint kinds. */
10639 print_one_exception (enum exception_catchpoint_kind ex,
10640 struct breakpoint *b, struct bp_location **last_loc)
10642 struct value_print_options opts;
10644 get_user_print_options (&opts);
10645 if (opts.addressprint)
10647 annotate_field (4);
10648 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
10651 annotate_field (5);
10652 *last_loc = b->loc;
10655 case ex_catch_exception:
10656 if (b->exp_string != NULL)
10658 char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
10660 ui_out_field_string (uiout, "what", msg);
10664 ui_out_field_string (uiout, "what", "all Ada exceptions");
10668 case ex_catch_exception_unhandled:
10669 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
10672 case ex_catch_assert:
10673 ui_out_field_string (uiout, "what", "failed Ada assertions");
10677 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10682 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10683 for all exception catchpoint kinds. */
10686 print_mention_exception (enum exception_catchpoint_kind ex,
10687 struct breakpoint *b)
10691 case ex_catch_exception:
10692 if (b->exp_string != NULL)
10693 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10694 b->number, b->exp_string);
10696 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
10700 case ex_catch_exception_unhandled:
10701 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10705 case ex_catch_assert:
10706 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
10710 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10715 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
10716 for all exception catchpoint kinds. */
10719 print_recreate_exception (enum exception_catchpoint_kind ex,
10720 struct breakpoint *b, struct ui_file *fp)
10724 case ex_catch_exception:
10725 fprintf_filtered (fp, "catch exception");
10726 if (b->exp_string != NULL)
10727 fprintf_filtered (fp, " %s", b->exp_string);
10730 case ex_catch_exception_unhandled:
10731 fprintf_filtered (fp, "catch exception unhandled");
10734 case ex_catch_assert:
10735 fprintf_filtered (fp, "catch assert");
10739 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10743 /* Virtual table for "catch exception" breakpoints. */
10745 static enum print_stop_action
10746 print_it_catch_exception (struct breakpoint *b)
10748 return print_it_exception (ex_catch_exception, b);
10752 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
10754 print_one_exception (ex_catch_exception, b, last_loc);
10758 print_mention_catch_exception (struct breakpoint *b)
10760 print_mention_exception (ex_catch_exception, b);
10764 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
10766 print_recreate_exception (ex_catch_exception, b, fp);
10769 static struct breakpoint_ops catch_exception_breakpoint_ops =
10773 NULL, /* breakpoint_hit */
10774 print_it_catch_exception,
10775 print_one_catch_exception,
10776 print_mention_catch_exception,
10777 print_recreate_catch_exception
10780 /* Virtual table for "catch exception unhandled" breakpoints. */
10782 static enum print_stop_action
10783 print_it_catch_exception_unhandled (struct breakpoint *b)
10785 return print_it_exception (ex_catch_exception_unhandled, b);
10789 print_one_catch_exception_unhandled (struct breakpoint *b,
10790 struct bp_location **last_loc)
10792 print_one_exception (ex_catch_exception_unhandled, b, last_loc);
10796 print_mention_catch_exception_unhandled (struct breakpoint *b)
10798 print_mention_exception (ex_catch_exception_unhandled, b);
10802 print_recreate_catch_exception_unhandled (struct breakpoint *b,
10803 struct ui_file *fp)
10805 print_recreate_exception (ex_catch_exception_unhandled, b, fp);
10808 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
10811 NULL, /* breakpoint_hit */
10812 print_it_catch_exception_unhandled,
10813 print_one_catch_exception_unhandled,
10814 print_mention_catch_exception_unhandled,
10815 print_recreate_catch_exception_unhandled
10818 /* Virtual table for "catch assert" breakpoints. */
10820 static enum print_stop_action
10821 print_it_catch_assert (struct breakpoint *b)
10823 return print_it_exception (ex_catch_assert, b);
10827 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
10829 print_one_exception (ex_catch_assert, b, last_loc);
10833 print_mention_catch_assert (struct breakpoint *b)
10835 print_mention_exception (ex_catch_assert, b);
10839 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
10841 print_recreate_exception (ex_catch_assert, b, fp);
10844 static struct breakpoint_ops catch_assert_breakpoint_ops = {
10847 NULL, /* breakpoint_hit */
10848 print_it_catch_assert,
10849 print_one_catch_assert,
10850 print_mention_catch_assert,
10851 print_recreate_catch_assert
10854 /* Return non-zero if B is an Ada exception catchpoint. */
10857 ada_exception_catchpoint_p (struct breakpoint *b)
10859 return (b->ops == &catch_exception_breakpoint_ops
10860 || b->ops == &catch_exception_unhandled_breakpoint_ops
10861 || b->ops == &catch_assert_breakpoint_ops);
10864 /* Return a newly allocated copy of the first space-separated token
10865 in ARGSP, and then adjust ARGSP to point immediately after that
10868 Return NULL if ARGPS does not contain any more tokens. */
10871 ada_get_next_arg (char **argsp)
10873 char *args = *argsp;
10877 /* Skip any leading white space. */
10879 while (isspace (*args))
10882 if (args[0] == '\0')
10883 return NULL; /* No more arguments. */
10885 /* Find the end of the current argument. */
10888 while (*end != '\0' && !isspace (*end))
10891 /* Adjust ARGSP to point to the start of the next argument. */
10895 /* Make a copy of the current argument and return it. */
10897 result = xmalloc (end - args + 1);
10898 strncpy (result, args, end - args);
10899 result[end - args] = '\0';
10904 /* Split the arguments specified in a "catch exception" command.
10905 Set EX to the appropriate catchpoint type.
10906 Set EXP_STRING to the name of the specific exception if
10907 specified by the user. */
10910 catch_ada_exception_command_split (char *args,
10911 enum exception_catchpoint_kind *ex,
10914 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
10915 char *exception_name;
10917 exception_name = ada_get_next_arg (&args);
10918 make_cleanup (xfree, exception_name);
10920 /* Check that we do not have any more arguments. Anything else
10923 while (isspace (*args))
10926 if (args[0] != '\0')
10927 error (_("Junk at end of expression"));
10929 discard_cleanups (old_chain);
10931 if (exception_name == NULL)
10933 /* Catch all exceptions. */
10934 *ex = ex_catch_exception;
10935 *exp_string = NULL;
10937 else if (strcmp (exception_name, "unhandled") == 0)
10939 /* Catch unhandled exceptions. */
10940 *ex = ex_catch_exception_unhandled;
10941 *exp_string = NULL;
10945 /* Catch a specific exception. */
10946 *ex = ex_catch_exception;
10947 *exp_string = exception_name;
10951 /* Return the name of the symbol on which we should break in order to
10952 implement a catchpoint of the EX kind. */
10954 static const char *
10955 ada_exception_sym_name (enum exception_catchpoint_kind ex)
10957 gdb_assert (exception_info != NULL);
10961 case ex_catch_exception:
10962 return (exception_info->catch_exception_sym);
10964 case ex_catch_exception_unhandled:
10965 return (exception_info->catch_exception_unhandled_sym);
10967 case ex_catch_assert:
10968 return (exception_info->catch_assert_sym);
10971 internal_error (__FILE__, __LINE__,
10972 _("unexpected catchpoint kind (%d)"), ex);
10976 /* Return the breakpoint ops "virtual table" used for catchpoints
10979 static struct breakpoint_ops *
10980 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
10984 case ex_catch_exception:
10985 return (&catch_exception_breakpoint_ops);
10987 case ex_catch_exception_unhandled:
10988 return (&catch_exception_unhandled_breakpoint_ops);
10990 case ex_catch_assert:
10991 return (&catch_assert_breakpoint_ops);
10994 internal_error (__FILE__, __LINE__,
10995 _("unexpected catchpoint kind (%d)"), ex);
10999 /* Return the condition that will be used to match the current exception
11000 being raised with the exception that the user wants to catch. This
11001 assumes that this condition is used when the inferior just triggered
11002 an exception catchpoint.
11004 The string returned is a newly allocated string that needs to be
11005 deallocated later. */
11008 ada_exception_catchpoint_cond_string (const char *exp_string)
11012 /* The standard exceptions are a special case. They are defined in
11013 runtime units that have been compiled without debugging info; if
11014 EXP_STRING is the not-fully-qualified name of a standard
11015 exception (e.g. "constraint_error") then, during the evaluation
11016 of the condition expression, the symbol lookup on this name would
11017 *not* return this standard exception. The catchpoint condition
11018 may then be set only on user-defined exceptions which have the
11019 same not-fully-qualified name (e.g. my_package.constraint_error).
11021 To avoid this unexcepted behavior, these standard exceptions are
11022 systematically prefixed by "standard". This means that "catch
11023 exception constraint_error" is rewritten into "catch exception
11024 standard.constraint_error".
11026 If an exception named contraint_error is defined in another package of
11027 the inferior program, then the only way to specify this exception as a
11028 breakpoint condition is to use its fully-qualified named:
11029 e.g. my_package.constraint_error. */
11031 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
11033 if (strcmp (standard_exc [i], exp_string) == 0)
11035 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11039 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
11042 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
11044 static struct expression *
11045 ada_parse_catchpoint_condition (char *cond_string,
11046 struct symtab_and_line sal)
11048 return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
11051 /* Return the symtab_and_line that should be used to insert an exception
11052 catchpoint of the TYPE kind.
11054 EX_STRING should contain the name of a specific exception
11055 that the catchpoint should catch, or NULL otherwise.
11057 The idea behind all the remaining parameters is that their names match
11058 the name of certain fields in the breakpoint structure that are used to
11059 handle exception catchpoints. This function returns the value to which
11060 these fields should be set, depending on the type of catchpoint we need
11063 If COND and COND_STRING are both non-NULL, any value they might
11064 hold will be free'ed, and then replaced by newly allocated ones.
11065 These parameters are left untouched otherwise. */
11067 static struct symtab_and_line
11068 ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
11069 char **addr_string, char **cond_string,
11070 struct expression **cond, struct breakpoint_ops **ops)
11072 const char *sym_name;
11073 struct symbol *sym;
11074 struct symtab_and_line sal;
11076 /* First, find out which exception support info to use. */
11077 ada_exception_support_info_sniffer ();
11079 /* Then lookup the function on which we will break in order to catch
11080 the Ada exceptions requested by the user. */
11082 sym_name = ada_exception_sym_name (ex);
11083 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
11085 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11086 that should be compiled with debugging information. As a result, we
11087 expect to find that symbol in the symtabs. If we don't find it, then
11088 the target most likely does not support Ada exceptions, or we cannot
11089 insert exception breakpoints yet, because the GNAT runtime hasn't been
11092 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
11093 in such a way that no debugging information is produced for the symbol
11094 we are looking for. In this case, we could search the minimal symbols
11095 as a fall-back mechanism. This would still be operating in degraded
11096 mode, however, as we would still be missing the debugging information
11097 that is needed in order to extract the name of the exception being
11098 raised (this name is printed in the catchpoint message, and is also
11099 used when trying to catch a specific exception). We do not handle
11100 this case for now. */
11103 error (_("Unable to break on '%s' in this configuration."), sym_name);
11105 /* Make sure that the symbol we found corresponds to a function. */
11106 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
11107 error (_("Symbol \"%s\" is not a function (class = %d)"),
11108 sym_name, SYMBOL_CLASS (sym));
11110 sal = find_function_start_sal (sym, 1);
11112 /* Set ADDR_STRING. */
11114 *addr_string = xstrdup (sym_name);
11116 /* Set the COND and COND_STRING (if not NULL). */
11118 if (cond_string != NULL && cond != NULL)
11120 if (*cond_string != NULL)
11122 xfree (*cond_string);
11123 *cond_string = NULL;
11130 if (exp_string != NULL)
11132 *cond_string = ada_exception_catchpoint_cond_string (exp_string);
11133 *cond = ada_parse_catchpoint_condition (*cond_string, sal);
11138 *ops = ada_exception_breakpoint_ops (ex);
11143 /* Parse the arguments (ARGS) of the "catch exception" command.
11145 Set TYPE to the appropriate exception catchpoint type.
11146 If the user asked the catchpoint to catch only a specific
11147 exception, then save the exception name in ADDR_STRING.
11149 See ada_exception_sal for a description of all the remaining
11150 function arguments of this function. */
11152 struct symtab_and_line
11153 ada_decode_exception_location (char *args, char **addr_string,
11154 char **exp_string, char **cond_string,
11155 struct expression **cond,
11156 struct breakpoint_ops **ops)
11158 enum exception_catchpoint_kind ex;
11160 catch_ada_exception_command_split (args, &ex, exp_string);
11161 return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
11165 struct symtab_and_line
11166 ada_decode_assert_location (char *args, char **addr_string,
11167 struct breakpoint_ops **ops)
11169 /* Check that no argument where provided at the end of the command. */
11173 while (isspace (*args))
11176 error (_("Junk at end of arguments."));
11179 return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
11184 /* Information about operators given special treatment in functions
11186 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11188 #define ADA_OPERATORS \
11189 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11190 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11191 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11192 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11193 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11194 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11195 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11196 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11197 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11198 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11199 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11200 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11201 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11202 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11203 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11204 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11205 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11206 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11207 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11210 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
11213 switch (exp->elts[pc - 1].opcode)
11216 operator_length_standard (exp, pc, oplenp, argsp);
11219 #define OP_DEFN(op, len, args, binop) \
11220 case op: *oplenp = len; *argsp = args; break;
11226 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
11231 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
11236 /* Implementation of the exp_descriptor method operator_check. */
11239 ada_operator_check (struct expression *exp, int pos,
11240 int (*objfile_func) (struct objfile *objfile, void *data),
11243 const union exp_element *const elts = exp->elts;
11244 struct type *type = NULL;
11246 switch (elts[pos].opcode)
11248 case UNOP_IN_RANGE:
11250 type = elts[pos + 1].type;
11254 return operator_check_standard (exp, pos, objfile_func, data);
11257 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11259 if (type && TYPE_OBJFILE (type)
11260 && (*objfile_func) (TYPE_OBJFILE (type), data))
11267 ada_op_name (enum exp_opcode opcode)
11272 return op_name_standard (opcode);
11274 #define OP_DEFN(op, len, args, binop) case op: return #op;
11279 return "OP_AGGREGATE";
11281 return "OP_CHOICES";
11287 /* As for operator_length, but assumes PC is pointing at the first
11288 element of the operator, and gives meaningful results only for the
11289 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11292 ada_forward_operator_length (struct expression *exp, int pc,
11293 int *oplenp, int *argsp)
11295 switch (exp->elts[pc].opcode)
11298 *oplenp = *argsp = 0;
11301 #define OP_DEFN(op, len, args, binop) \
11302 case op: *oplenp = len; *argsp = args; break;
11308 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
11313 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
11319 int len = longest_to_int (exp->elts[pc + 1].longconst);
11321 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
11329 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
11331 enum exp_opcode op = exp->elts[elt].opcode;
11336 ada_forward_operator_length (exp, elt, &oplen, &nargs);
11340 /* Ada attributes ('Foo). */
11343 case OP_ATR_LENGTH:
11347 case OP_ATR_MODULUS:
11354 case UNOP_IN_RANGE:
11356 /* XXX: gdb_sprint_host_address, type_sprint */
11357 fprintf_filtered (stream, _("Type @"));
11358 gdb_print_host_address (exp->elts[pc + 1].type, stream);
11359 fprintf_filtered (stream, " (");
11360 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
11361 fprintf_filtered (stream, ")");
11363 case BINOP_IN_BOUNDS:
11364 fprintf_filtered (stream, " (%d)",
11365 longest_to_int (exp->elts[pc + 2].longconst));
11367 case TERNOP_IN_RANGE:
11372 case OP_DISCRETE_RANGE:
11373 case OP_POSITIONAL:
11380 char *name = &exp->elts[elt + 2].string;
11381 int len = longest_to_int (exp->elts[elt + 1].longconst);
11383 fprintf_filtered (stream, "Text: `%.*s'", len, name);
11388 return dump_subexp_body_standard (exp, stream, elt);
11392 for (i = 0; i < nargs; i += 1)
11393 elt = dump_subexp (exp, stream, elt);
11398 /* The Ada extension of print_subexp (q.v.). */
11401 ada_print_subexp (struct expression *exp, int *pos,
11402 struct ui_file *stream, enum precedence prec)
11404 int oplen, nargs, i;
11406 enum exp_opcode op = exp->elts[pc].opcode;
11408 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11415 print_subexp_standard (exp, pos, stream, prec);
11419 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
11422 case BINOP_IN_BOUNDS:
11423 /* XXX: sprint_subexp */
11424 print_subexp (exp, pos, stream, PREC_SUFFIX);
11425 fputs_filtered (" in ", stream);
11426 print_subexp (exp, pos, stream, PREC_SUFFIX);
11427 fputs_filtered ("'range", stream);
11428 if (exp->elts[pc + 1].longconst > 1)
11429 fprintf_filtered (stream, "(%ld)",
11430 (long) exp->elts[pc + 1].longconst);
11433 case TERNOP_IN_RANGE:
11434 if (prec >= PREC_EQUAL)
11435 fputs_filtered ("(", stream);
11436 /* XXX: sprint_subexp */
11437 print_subexp (exp, pos, stream, PREC_SUFFIX);
11438 fputs_filtered (" in ", stream);
11439 print_subexp (exp, pos, stream, PREC_EQUAL);
11440 fputs_filtered (" .. ", stream);
11441 print_subexp (exp, pos, stream, PREC_EQUAL);
11442 if (prec >= PREC_EQUAL)
11443 fputs_filtered (")", stream);
11448 case OP_ATR_LENGTH:
11452 case OP_ATR_MODULUS:
11457 if (exp->elts[*pos].opcode == OP_TYPE)
11459 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
11460 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
11464 print_subexp (exp, pos, stream, PREC_SUFFIX);
11465 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
11470 for (tem = 1; tem < nargs; tem += 1)
11472 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
11473 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
11475 fputs_filtered (")", stream);
11480 type_print (exp->elts[pc + 1].type, "", stream, 0);
11481 fputs_filtered ("'(", stream);
11482 print_subexp (exp, pos, stream, PREC_PREFIX);
11483 fputs_filtered (")", stream);
11486 case UNOP_IN_RANGE:
11487 /* XXX: sprint_subexp */
11488 print_subexp (exp, pos, stream, PREC_SUFFIX);
11489 fputs_filtered (" in ", stream);
11490 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
11493 case OP_DISCRETE_RANGE:
11494 print_subexp (exp, pos, stream, PREC_SUFFIX);
11495 fputs_filtered ("..", stream);
11496 print_subexp (exp, pos, stream, PREC_SUFFIX);
11500 fputs_filtered ("others => ", stream);
11501 print_subexp (exp, pos, stream, PREC_SUFFIX);
11505 for (i = 0; i < nargs-1; i += 1)
11508 fputs_filtered ("|", stream);
11509 print_subexp (exp, pos, stream, PREC_SUFFIX);
11511 fputs_filtered (" => ", stream);
11512 print_subexp (exp, pos, stream, PREC_SUFFIX);
11515 case OP_POSITIONAL:
11516 print_subexp (exp, pos, stream, PREC_SUFFIX);
11520 fputs_filtered ("(", stream);
11521 for (i = 0; i < nargs; i += 1)
11524 fputs_filtered (", ", stream);
11525 print_subexp (exp, pos, stream, PREC_SUFFIX);
11527 fputs_filtered (")", stream);
11532 /* Table mapping opcodes into strings for printing operators
11533 and precedences of the operators. */
11535 static const struct op_print ada_op_print_tab[] = {
11536 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
11537 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
11538 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
11539 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
11540 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
11541 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
11542 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
11543 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
11544 {"<=", BINOP_LEQ, PREC_ORDER, 0},
11545 {">=", BINOP_GEQ, PREC_ORDER, 0},
11546 {">", BINOP_GTR, PREC_ORDER, 0},
11547 {"<", BINOP_LESS, PREC_ORDER, 0},
11548 {">>", BINOP_RSH, PREC_SHIFT, 0},
11549 {"<<", BINOP_LSH, PREC_SHIFT, 0},
11550 {"+", BINOP_ADD, PREC_ADD, 0},
11551 {"-", BINOP_SUB, PREC_ADD, 0},
11552 {"&", BINOP_CONCAT, PREC_ADD, 0},
11553 {"*", BINOP_MUL, PREC_MUL, 0},
11554 {"/", BINOP_DIV, PREC_MUL, 0},
11555 {"rem", BINOP_REM, PREC_MUL, 0},
11556 {"mod", BINOP_MOD, PREC_MUL, 0},
11557 {"**", BINOP_EXP, PREC_REPEAT, 0},
11558 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
11559 {"-", UNOP_NEG, PREC_PREFIX, 0},
11560 {"+", UNOP_PLUS, PREC_PREFIX, 0},
11561 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
11562 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
11563 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
11564 {".all", UNOP_IND, PREC_SUFFIX, 1},
11565 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
11566 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
11570 enum ada_primitive_types {
11571 ada_primitive_type_int,
11572 ada_primitive_type_long,
11573 ada_primitive_type_short,
11574 ada_primitive_type_char,
11575 ada_primitive_type_float,
11576 ada_primitive_type_double,
11577 ada_primitive_type_void,
11578 ada_primitive_type_long_long,
11579 ada_primitive_type_long_double,
11580 ada_primitive_type_natural,
11581 ada_primitive_type_positive,
11582 ada_primitive_type_system_address,
11583 nr_ada_primitive_types
11587 ada_language_arch_info (struct gdbarch *gdbarch,
11588 struct language_arch_info *lai)
11590 const struct builtin_type *builtin = builtin_type (gdbarch);
11592 lai->primitive_type_vector
11593 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
11596 lai->primitive_type_vector [ada_primitive_type_int]
11597 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
11599 lai->primitive_type_vector [ada_primitive_type_long]
11600 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
11601 0, "long_integer");
11602 lai->primitive_type_vector [ada_primitive_type_short]
11603 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
11604 0, "short_integer");
11605 lai->string_char_type
11606 = lai->primitive_type_vector [ada_primitive_type_char]
11607 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
11608 lai->primitive_type_vector [ada_primitive_type_float]
11609 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
11611 lai->primitive_type_vector [ada_primitive_type_double]
11612 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
11613 "long_float", NULL);
11614 lai->primitive_type_vector [ada_primitive_type_long_long]
11615 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
11616 0, "long_long_integer");
11617 lai->primitive_type_vector [ada_primitive_type_long_double]
11618 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
11619 "long_long_float", NULL);
11620 lai->primitive_type_vector [ada_primitive_type_natural]
11621 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
11623 lai->primitive_type_vector [ada_primitive_type_positive]
11624 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
11626 lai->primitive_type_vector [ada_primitive_type_void]
11627 = builtin->builtin_void;
11629 lai->primitive_type_vector [ada_primitive_type_system_address]
11630 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
11631 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
11632 = "system__address";
11634 lai->bool_type_symbol = NULL;
11635 lai->bool_type_default = builtin->builtin_bool;
11638 /* Language vector */
11640 /* Not really used, but needed in the ada_language_defn. */
11643 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
11645 ada_emit_char (c, type, stream, quoter, 1);
11651 warnings_issued = 0;
11652 return ada_parse ();
11655 static const struct exp_descriptor ada_exp_descriptor = {
11657 ada_operator_length,
11658 ada_operator_check,
11660 ada_dump_subexp_body,
11661 ada_evaluate_subexp
11664 const struct language_defn ada_language_defn = {
11665 "ada", /* Language name */
11669 case_sensitive_on, /* Yes, Ada is case-insensitive, but
11670 that's not quite what this means. */
11672 macro_expansion_no,
11673 &ada_exp_descriptor,
11677 ada_printchar, /* Print a character constant */
11678 ada_printstr, /* Function to print string constant */
11679 emit_char, /* Function to print single char (not used) */
11680 ada_print_type, /* Print a type using appropriate syntax */
11681 ada_print_typedef, /* Print a typedef using appropriate syntax */
11682 ada_val_print, /* Print a value using appropriate syntax */
11683 ada_value_print, /* Print a top-level value */
11684 NULL, /* Language specific skip_trampoline */
11685 NULL, /* name_of_this */
11686 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
11687 basic_lookup_transparent_type, /* lookup_transparent_type */
11688 ada_la_decode, /* Language specific symbol demangler */
11689 NULL, /* Language specific class_name_from_physname */
11690 ada_op_print_tab, /* expression operators for printing */
11691 0, /* c-style arrays */
11692 1, /* String lower bound */
11693 ada_get_gdb_completer_word_break_characters,
11694 ada_make_symbol_completion_list,
11695 ada_language_arch_info,
11696 ada_print_array_index,
11697 default_pass_by_reference,
11702 /* Provide a prototype to silence -Wmissing-prototypes. */
11703 extern initialize_file_ftype _initialize_ada_language;
11705 /* Command-list for the "set/show ada" prefix command. */
11706 static struct cmd_list_element *set_ada_list;
11707 static struct cmd_list_element *show_ada_list;
11709 /* Implement the "set ada" prefix command. */
11712 set_ada_command (char *arg, int from_tty)
11714 printf_unfiltered (_(\
11715 "\"set ada\" must be followed by the name of a setting.\n"));
11716 help_list (set_ada_list, "set ada ", -1, gdb_stdout);
11719 /* Implement the "show ada" prefix command. */
11722 show_ada_command (char *args, int from_tty)
11724 cmd_show_list (show_ada_list, from_tty, "");
11728 _initialize_ada_language (void)
11730 add_language (&ada_language_defn);
11732 add_prefix_cmd ("ada", no_class, set_ada_command,
11733 _("Prefix command for changing Ada-specfic settings"),
11734 &set_ada_list, "set ada ", 0, &setlist);
11736 add_prefix_cmd ("ada", no_class, show_ada_command,
11737 _("Generic command for showing Ada-specific settings."),
11738 &show_ada_list, "show ada ", 0, &showlist);
11740 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
11741 &trust_pad_over_xvs, _("\
11742 Enable or disable an optimization trusting PAD types over XVS types"), _("\
11743 Show whether an optimization trusting PAD types over XVS types is activated"),
11745 This is related to the encoding used by the GNAT compiler. The debugger\n\
11746 should normally trust the contents of PAD types, but certain older versions\n\
11747 of GNAT have a bug that sometimes causes the information in the PAD type\n\
11748 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
11749 work around this bug. It is always safe to turn this option \"off\", but\n\
11750 this incurs a slight performance penalty, so it is recommended to NOT change\n\
11751 this option to \"off\" unless necessary."),
11752 NULL, NULL, &set_ada_list, &show_ada_list);
11754 varsize_limit = 65536;
11756 obstack_init (&symbol_list_obstack);
11758 decoded_names_store = htab_create_alloc
11759 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
11760 NULL, xcalloc, xfree);
11762 observer_attach_executable_changed (ada_executable_changed_observer);
11764 /* Setup per-inferior data. */
11765 observer_attach_inferior_exit (ada_inferior_exit);
11767 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup);