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"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr, char *buf);
70 static void modify_general_field (char *, LONGEST, int, int);
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 struct value *ensure_lval (struct value *, CORE_ADDR *);
106 static struct value *convert_actual (struct value *, struct type *,
109 static struct value *make_array_descriptor (struct type *, struct value *,
112 static void ada_add_block_symbols (struct obstack *,
113 struct block *, const char *,
114 domain_enum, struct objfile *, int);
116 static int is_nonfunction (struct ada_symbol_info *, int);
118 static void add_defn_to_vec (struct obstack *, struct symbol *,
121 static int num_defns_collected (struct obstack *);
123 static struct ada_symbol_info *defns_collected (struct obstack *, int);
125 static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab
126 *, const char *, int,
129 static struct value *resolve_subexp (struct expression **, int *, int,
132 static void replace_operator_with_call (struct expression **, int, int, int,
133 struct symbol *, struct block *);
135 static int possible_user_operator_p (enum exp_opcode, struct value **);
137 static char *ada_op_name (enum exp_opcode);
139 static const char *ada_decoded_op_name (enum exp_opcode);
141 static int numeric_type_p (struct type *);
143 static int integer_type_p (struct type *);
145 static int scalar_type_p (struct type *);
147 static int discrete_type_p (struct type *);
149 static enum ada_renaming_category parse_old_style_renaming (struct type *,
154 static struct symbol *find_old_style_renaming_symbol (const char *,
157 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
160 static struct value *evaluate_subexp_type (struct expression *, int *);
162 static int is_dynamic_field (struct type *, int);
164 static struct type *to_fixed_variant_branch_type (struct type *,
166 CORE_ADDR, struct value *);
168 static struct type *to_fixed_array_type (struct type *, struct value *, int);
170 static struct type *to_fixed_range_type (char *, struct value *,
173 static struct type *to_static_fixed_type (struct type *);
174 static struct type *static_unwrap_type (struct type *type);
176 static struct value *unwrap_value (struct value *);
178 static struct type *packed_array_type (struct type *, long *);
180 static struct type *decode_packed_array_type (struct type *);
182 static struct value *decode_packed_array (struct value *);
184 static struct value *value_subscript_packed (struct value *, int,
187 static void move_bits (gdb_byte *, int, const gdb_byte *, 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 wild_match (const char *, int, const char *);
202 static struct value *ada_coerce_ref (struct value *);
204 static LONGEST pos_atr (struct value *);
206 static struct value *value_pos_atr (struct type *, struct value *);
208 static struct value *value_val_atr (struct type *, struct value *);
210 static struct symbol *standard_lookup (const char *, const struct block *,
213 static struct value *ada_search_struct_field (char *, struct value *, int,
216 static struct value *ada_value_primitive_field (struct value *, int, int,
219 static int find_struct_field (char *, struct type *, int,
220 struct type **, int *, int *, int *, int *);
222 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
225 static struct value *ada_to_fixed_value (struct value *);
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;
309 /* Given DECODED_NAME a string holding a symbol name in its
310 decoded form (ie using the Ada dotted notation), returns
311 its unqualified name. */
314 ada_unqualified_name (const char *decoded_name)
316 const char *result = strrchr (decoded_name, '.');
319 result++; /* Skip the dot... */
321 result = decoded_name;
326 /* Return a string starting with '<', followed by STR, and '>'.
327 The result is good until the next call. */
330 add_angle_brackets (const char *str)
332 static char *result = NULL;
335 result = xstrprintf ("<%s>", str);
340 ada_get_gdb_completer_word_break_characters (void)
342 return ada_completer_word_break_characters;
345 /* Print an array element index using the Ada syntax. */
348 ada_print_array_index (struct value *index_value, struct ui_file *stream,
349 const struct value_print_options *options)
351 LA_VALUE_PRINT (index_value, stream, options);
352 fprintf_filtered (stream, " => ");
355 /* Read the string located at ADDR from the inferior and store the
359 extract_string (CORE_ADDR addr, char *buf)
363 /* Loop, reading one byte at a time, until we reach the '\000'
364 end-of-string marker. */
367 target_read_memory (addr + char_index * sizeof (char),
368 buf + char_index * sizeof (char), sizeof (char));
371 while (buf[char_index - 1] != '\000');
374 /* Assuming VECT points to an array of *SIZE objects of size
375 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
376 updating *SIZE as necessary and returning the (new) array. */
379 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
381 if (*size < min_size)
384 if (*size < min_size)
386 vect = xrealloc (vect, *size * element_size);
391 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
392 suffix of FIELD_NAME beginning "___". */
395 field_name_match (const char *field_name, const char *target)
397 int len = strlen (target);
399 (strncmp (field_name, target, len) == 0
400 && (field_name[len] == '\0'
401 || (strncmp (field_name + len, "___", 3) == 0
402 && strcmp (field_name + strlen (field_name) - 6,
407 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
408 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
409 and return its index. This function also handles fields whose name
410 have ___ suffixes because the compiler sometimes alters their name
411 by adding such a suffix to represent fields with certain constraints.
412 If the field could not be found, return a negative number if
413 MAYBE_MISSING is set. Otherwise raise an error. */
416 ada_get_field_index (const struct type *type, const char *field_name,
420 struct type *struct_type = check_typedef ((struct type *) type);
422 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
423 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
427 error (_("Unable to find field %s in struct %s. Aborting"),
428 field_name, TYPE_NAME (struct_type));
433 /* The length of the prefix of NAME prior to any "___" suffix. */
436 ada_name_prefix_len (const char *name)
442 const char *p = strstr (name, "___");
444 return strlen (name);
450 /* Return non-zero if SUFFIX is a suffix of STR.
451 Return zero if STR is null. */
454 is_suffix (const char *str, const char *suffix)
460 len2 = strlen (suffix);
461 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
464 /* The contents of value VAL, treated as a value of type TYPE. The
465 result is an lval in memory if VAL is. */
467 static struct value *
468 coerce_unspec_val_to_type (struct value *val, struct type *type)
470 type = ada_check_typedef (type);
471 if (value_type (val) == type)
475 struct value *result;
477 /* Make sure that the object size is not unreasonable before
478 trying to allocate some memory for it. */
481 result = allocate_value (type);
482 set_value_component_location (result, val);
483 set_value_bitsize (result, value_bitsize (val));
484 set_value_bitpos (result, value_bitpos (val));
485 set_value_address (result, value_address (val));
487 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
488 set_value_lazy (result, 1);
490 memcpy (value_contents_raw (result), value_contents (val),
496 static const gdb_byte *
497 cond_offset_host (const gdb_byte *valaddr, long offset)
502 return valaddr + offset;
506 cond_offset_target (CORE_ADDR address, long offset)
511 return address + offset;
514 /* Issue a warning (as for the definition of warning in utils.c, but
515 with exactly one argument rather than ...), unless the limit on the
516 number of warnings has passed during the evaluation of the current
519 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
520 provided by "complaint". */
521 static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
524 lim_warning (const char *format, ...)
527 va_start (args, format);
529 warnings_issued += 1;
530 if (warnings_issued <= warning_limit)
531 vwarning (format, args);
536 /* Issue an error if the size of an object of type T is unreasonable,
537 i.e. if it would be a bad idea to allocate a value of this type in
541 check_size (const struct type *type)
543 if (TYPE_LENGTH (type) > varsize_limit)
544 error (_("object size is larger than varsize-limit"));
548 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
549 gdbtypes.h, but some of the necessary definitions in that file
550 seem to have gone missing. */
552 /* Maximum value of a SIZE-byte signed integer type. */
554 max_of_size (int size)
556 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
557 return top_bit | (top_bit - 1);
560 /* Minimum value of a SIZE-byte signed integer type. */
562 min_of_size (int size)
564 return -max_of_size (size) - 1;
567 /* Maximum value of a SIZE-byte unsigned integer type. */
569 umax_of_size (int size)
571 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
572 return top_bit | (top_bit - 1);
575 /* Maximum value of integral type T, as a signed quantity. */
577 max_of_type (struct type *t)
579 if (TYPE_UNSIGNED (t))
580 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
582 return max_of_size (TYPE_LENGTH (t));
585 /* Minimum value of integral type T, as a signed quantity. */
587 min_of_type (struct type *t)
589 if (TYPE_UNSIGNED (t))
592 return min_of_size (TYPE_LENGTH (t));
595 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
597 discrete_type_high_bound (struct type *type)
599 switch (TYPE_CODE (type))
601 case TYPE_CODE_RANGE:
602 return TYPE_HIGH_BOUND (type);
604 return TYPE_FIELD_BITPOS (type, TYPE_NFIELDS (type) - 1);
609 return max_of_type (type);
611 error (_("Unexpected type in discrete_type_high_bound."));
615 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
617 discrete_type_low_bound (struct type *type)
619 switch (TYPE_CODE (type))
621 case TYPE_CODE_RANGE:
622 return TYPE_LOW_BOUND (type);
624 return TYPE_FIELD_BITPOS (type, 0);
629 return min_of_type (type);
631 error (_("Unexpected type in discrete_type_low_bound."));
635 /* The identity on non-range types. For range types, the underlying
636 non-range scalar type. */
639 base_type (struct type *type)
641 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
643 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
645 type = TYPE_TARGET_TYPE (type);
651 /* Language Selection */
653 /* If the main program is in Ada, return language_ada, otherwise return LANG
654 (the main program is in Ada iif the adainit symbol is found).
656 MAIN_PST is not used. */
659 ada_update_initial_language (enum language lang,
660 struct partial_symtab *main_pst)
662 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
663 (struct objfile *) NULL) != NULL)
669 /* If the main procedure is written in Ada, then return its name.
670 The result is good until the next call. Return NULL if the main
671 procedure doesn't appear to be in Ada. */
676 struct minimal_symbol *msym;
677 static char *main_program_name = NULL;
679 /* For Ada, the name of the main procedure is stored in a specific
680 string constant, generated by the binder. Look for that symbol,
681 extract its address, and then read that string. If we didn't find
682 that string, then most probably the main procedure is not written
684 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
688 CORE_ADDR main_program_name_addr;
691 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
692 if (main_program_name_addr == 0)
693 error (_("Invalid address for Ada main program name."));
695 xfree (main_program_name);
696 target_read_string (main_program_name_addr, &main_program_name,
701 return main_program_name;
704 /* The main procedure doesn't seem to be in Ada. */
710 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
713 const struct ada_opname_map ada_opname_table[] = {
714 {"Oadd", "\"+\"", BINOP_ADD},
715 {"Osubtract", "\"-\"", BINOP_SUB},
716 {"Omultiply", "\"*\"", BINOP_MUL},
717 {"Odivide", "\"/\"", BINOP_DIV},
718 {"Omod", "\"mod\"", BINOP_MOD},
719 {"Orem", "\"rem\"", BINOP_REM},
720 {"Oexpon", "\"**\"", BINOP_EXP},
721 {"Olt", "\"<\"", BINOP_LESS},
722 {"Ole", "\"<=\"", BINOP_LEQ},
723 {"Ogt", "\">\"", BINOP_GTR},
724 {"Oge", "\">=\"", BINOP_GEQ},
725 {"Oeq", "\"=\"", BINOP_EQUAL},
726 {"One", "\"/=\"", BINOP_NOTEQUAL},
727 {"Oand", "\"and\"", BINOP_BITWISE_AND},
728 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
729 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
730 {"Oconcat", "\"&\"", BINOP_CONCAT},
731 {"Oabs", "\"abs\"", UNOP_ABS},
732 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
733 {"Oadd", "\"+\"", UNOP_PLUS},
734 {"Osubtract", "\"-\"", UNOP_NEG},
738 /* The "encoded" form of DECODED, according to GNAT conventions.
739 The result is valid until the next call to ada_encode. */
742 ada_encode (const char *decoded)
744 static char *encoding_buffer = NULL;
745 static size_t encoding_buffer_size = 0;
752 GROW_VECT (encoding_buffer, encoding_buffer_size,
753 2 * strlen (decoded) + 10);
756 for (p = decoded; *p != '\0'; p += 1)
760 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
765 const struct ada_opname_map *mapping;
767 for (mapping = ada_opname_table;
768 mapping->encoded != NULL
769 && strncmp (mapping->decoded, p,
770 strlen (mapping->decoded)) != 0; mapping += 1)
772 if (mapping->encoded == NULL)
773 error (_("invalid Ada operator name: %s"), p);
774 strcpy (encoding_buffer + k, mapping->encoded);
775 k += strlen (mapping->encoded);
780 encoding_buffer[k] = *p;
785 encoding_buffer[k] = '\0';
786 return encoding_buffer;
789 /* Return NAME folded to lower case, or, if surrounded by single
790 quotes, unfolded, but with the quotes stripped away. Result good
794 ada_fold_name (const char *name)
796 static char *fold_buffer = NULL;
797 static size_t fold_buffer_size = 0;
799 int len = strlen (name);
800 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
804 strncpy (fold_buffer, name + 1, len - 2);
805 fold_buffer[len - 2] = '\000';
810 for (i = 0; i <= len; i += 1)
811 fold_buffer[i] = tolower (name[i]);
817 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
820 is_lower_alphanum (const char c)
822 return (isdigit (c) || (isalpha (c) && islower (c)));
825 /* Remove either of these suffixes:
830 These are suffixes introduced by the compiler for entities such as
831 nested subprogram for instance, in order to avoid name clashes.
832 They do not serve any purpose for the debugger. */
835 ada_remove_trailing_digits (const char *encoded, int *len)
837 if (*len > 1 && isdigit (encoded[*len - 1]))
840 while (i > 0 && isdigit (encoded[i]))
842 if (i >= 0 && encoded[i] == '.')
844 else if (i >= 0 && encoded[i] == '$')
846 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
848 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
853 /* Remove the suffix introduced by the compiler for protected object
857 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
859 /* Remove trailing N. */
861 /* Protected entry subprograms are broken into two
862 separate subprograms: The first one is unprotected, and has
863 a 'N' suffix; the second is the protected version, and has
864 the 'P' suffix. The second calls the first one after handling
865 the protection. Since the P subprograms are internally generated,
866 we leave these names undecoded, giving the user a clue that this
867 entity is internal. */
870 && encoded[*len - 1] == 'N'
871 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
875 /* If ENCODED follows the GNAT entity encoding conventions, then return
876 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
879 The resulting string is valid until the next call of ada_decode.
880 If the string is unchanged by decoding, the original string pointer
884 ada_decode (const char *encoded)
891 static char *decoding_buffer = NULL;
892 static size_t decoding_buffer_size = 0;
894 /* The name of the Ada main procedure starts with "_ada_".
895 This prefix is not part of the decoded name, so skip this part
896 if we see this prefix. */
897 if (strncmp (encoded, "_ada_", 5) == 0)
900 /* If the name starts with '_', then it is not a properly encoded
901 name, so do not attempt to decode it. Similarly, if the name
902 starts with '<', the name should not be decoded. */
903 if (encoded[0] == '_' || encoded[0] == '<')
906 len0 = strlen (encoded);
908 ada_remove_trailing_digits (encoded, &len0);
909 ada_remove_po_subprogram_suffix (encoded, &len0);
911 /* Remove the ___X.* suffix if present. Do not forget to verify that
912 the suffix is located before the current "end" of ENCODED. We want
913 to avoid re-matching parts of ENCODED that have previously been
914 marked as discarded (by decrementing LEN0). */
915 p = strstr (encoded, "___");
916 if (p != NULL && p - encoded < len0 - 3)
924 /* Remove any trailing TKB suffix. It tells us that this symbol
925 is for the body of a task, but that information does not actually
926 appear in the decoded name. */
928 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
931 /* Remove trailing "B" suffixes. */
932 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
934 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
937 /* Make decoded big enough for possible expansion by operator name. */
939 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
940 decoded = decoding_buffer;
942 /* Remove trailing __{digit}+ or trailing ${digit}+. */
944 if (len0 > 1 && isdigit (encoded[len0 - 1]))
947 while ((i >= 0 && isdigit (encoded[i]))
948 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
950 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
952 else if (encoded[i] == '$')
956 /* The first few characters that are not alphabetic are not part
957 of any encoding we use, so we can copy them over verbatim. */
959 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
960 decoded[j] = encoded[i];
965 /* Is this a symbol function? */
966 if (at_start_name && encoded[i] == 'O')
969 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
971 int op_len = strlen (ada_opname_table[k].encoded);
972 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
974 && !isalnum (encoded[i + op_len]))
976 strcpy (decoded + j, ada_opname_table[k].decoded);
979 j += strlen (ada_opname_table[k].decoded);
983 if (ada_opname_table[k].encoded != NULL)
988 /* Replace "TK__" with "__", which will eventually be translated
989 into "." (just below). */
991 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
994 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
995 be translated into "." (just below). These are internal names
996 generated for anonymous blocks inside which our symbol is nested. */
998 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
999 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1000 && isdigit (encoded [i+4]))
1004 while (k < len0 && isdigit (encoded[k]))
1005 k++; /* Skip any extra digit. */
1007 /* Double-check that the "__B_{DIGITS}+" sequence we found
1008 is indeed followed by "__". */
1009 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1013 /* Remove _E{DIGITS}+[sb] */
1015 /* Just as for protected object subprograms, there are 2 categories
1016 of subprograms created by the compiler for each entry. The first
1017 one implements the actual entry code, and has a suffix following
1018 the convention above; the second one implements the barrier and
1019 uses the same convention as above, except that the 'E' is replaced
1022 Just as above, we do not decode the name of barrier functions
1023 to give the user a clue that the code he is debugging has been
1024 internally generated. */
1026 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1027 && isdigit (encoded[i+2]))
1031 while (k < len0 && isdigit (encoded[k]))
1035 && (encoded[k] == 'b' || encoded[k] == 's'))
1038 /* Just as an extra precaution, make sure that if this
1039 suffix is followed by anything else, it is a '_'.
1040 Otherwise, we matched this sequence by accident. */
1042 || (k < len0 && encoded[k] == '_'))
1047 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1048 the GNAT front-end in protected object subprograms. */
1051 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1053 /* Backtrack a bit up until we reach either the begining of
1054 the encoded name, or "__". Make sure that we only find
1055 digits or lowercase characters. */
1056 const char *ptr = encoded + i - 1;
1058 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1061 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1065 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1067 /* This is a X[bn]* sequence not separated from the previous
1068 part of the name with a non-alpha-numeric character (in other
1069 words, immediately following an alpha-numeric character), then
1070 verify that it is placed at the end of the encoded name. If
1071 not, then the encoding is not valid and we should abort the
1072 decoding. Otherwise, just skip it, it is used in body-nested
1076 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1080 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1082 /* Replace '__' by '.'. */
1090 /* It's a character part of the decoded name, so just copy it
1092 decoded[j] = encoded[i];
1097 decoded[j] = '\000';
1099 /* Decoded names should never contain any uppercase character.
1100 Double-check this, and abort the decoding if we find one. */
1102 for (i = 0; decoded[i] != '\0'; i += 1)
1103 if (isupper (decoded[i]) || decoded[i] == ' ')
1106 if (strcmp (decoded, encoded) == 0)
1112 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1113 decoded = decoding_buffer;
1114 if (encoded[0] == '<')
1115 strcpy (decoded, encoded);
1117 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1122 /* Table for keeping permanent unique copies of decoded names. Once
1123 allocated, names in this table are never released. While this is a
1124 storage leak, it should not be significant unless there are massive
1125 changes in the set of decoded names in successive versions of a
1126 symbol table loaded during a single session. */
1127 static struct htab *decoded_names_store;
1129 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1130 in the language-specific part of GSYMBOL, if it has not been
1131 previously computed. Tries to save the decoded name in the same
1132 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1133 in any case, the decoded symbol has a lifetime at least that of
1135 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1136 const, but nevertheless modified to a semantically equivalent form
1137 when a decoded name is cached in it.
1141 ada_decode_symbol (const struct general_symbol_info *gsymbol)
1144 (char **) &gsymbol->language_specific.cplus_specific.demangled_name;
1145 if (*resultp == NULL)
1147 const char *decoded = ada_decode (gsymbol->name);
1148 if (gsymbol->obj_section != NULL)
1150 struct objfile *objf = gsymbol->obj_section->objfile;
1151 *resultp = obsavestring (decoded, strlen (decoded),
1152 &objf->objfile_obstack);
1154 /* Sometimes, we can't find a corresponding objfile, in which
1155 case, we put the result on the heap. Since we only decode
1156 when needed, we hope this usually does not cause a
1157 significant memory leak (FIXME). */
1158 if (*resultp == NULL)
1160 char **slot = (char **) htab_find_slot (decoded_names_store,
1163 *slot = xstrdup (decoded);
1172 ada_la_decode (const char *encoded, int options)
1174 return xstrdup (ada_decode (encoded));
1177 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1178 suffixes that encode debugging information or leading _ada_ on
1179 SYM_NAME (see is_name_suffix commentary for the debugging
1180 information that is ignored). If WILD, then NAME need only match a
1181 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1182 either argument is NULL. */
1185 ada_match_name (const char *sym_name, const char *name, int wild)
1187 if (sym_name == NULL || name == NULL)
1190 return wild_match (name, strlen (name), sym_name);
1193 int len_name = strlen (name);
1194 return (strncmp (sym_name, name, len_name) == 0
1195 && is_name_suffix (sym_name + len_name))
1196 || (strncmp (sym_name, "_ada_", 5) == 0
1197 && strncmp (sym_name + 5, name, len_name) == 0
1198 && is_name_suffix (sym_name + len_name + 5));
1205 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1207 static char *bound_name[] = {
1208 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1209 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1212 /* Maximum number of array dimensions we are prepared to handle. */
1214 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1216 /* Like modify_field, but allows bitpos > wordlength. */
1219 modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
1221 modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
1225 /* The desc_* routines return primitive portions of array descriptors
1228 /* The descriptor or array type, if any, indicated by TYPE; removes
1229 level of indirection, if needed. */
1231 static struct type *
1232 desc_base_type (struct type *type)
1236 type = ada_check_typedef (type);
1238 && (TYPE_CODE (type) == TYPE_CODE_PTR
1239 || TYPE_CODE (type) == TYPE_CODE_REF))
1240 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1245 /* True iff TYPE indicates a "thin" array pointer type. */
1248 is_thin_pntr (struct type *type)
1251 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1252 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1255 /* The descriptor type for thin pointer type TYPE. */
1257 static struct type *
1258 thin_descriptor_type (struct type *type)
1260 struct type *base_type = desc_base_type (type);
1261 if (base_type == NULL)
1263 if (is_suffix (ada_type_name (base_type), "___XVE"))
1267 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1268 if (alt_type == NULL)
1275 /* A pointer to the array data for thin-pointer value VAL. */
1277 static struct value *
1278 thin_data_pntr (struct value *val)
1280 struct type *type = value_type (val);
1281 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1282 data_type = lookup_pointer_type (data_type);
1284 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1285 return value_cast (data_type, value_copy (val));
1287 return value_from_longest (data_type, value_address (val));
1290 /* True iff TYPE indicates a "thick" array pointer type. */
1293 is_thick_pntr (struct type *type)
1295 type = desc_base_type (type);
1296 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1297 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1300 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1301 pointer to one, the type of its bounds data; otherwise, NULL. */
1303 static struct type *
1304 desc_bounds_type (struct type *type)
1308 type = desc_base_type (type);
1312 else if (is_thin_pntr (type))
1314 type = thin_descriptor_type (type);
1317 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1319 return ada_check_typedef (r);
1321 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1323 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1325 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1330 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1331 one, a pointer to its bounds data. Otherwise NULL. */
1333 static struct value *
1334 desc_bounds (struct value *arr)
1336 struct type *type = ada_check_typedef (value_type (arr));
1337 if (is_thin_pntr (type))
1339 struct type *bounds_type =
1340 desc_bounds_type (thin_descriptor_type (type));
1343 if (bounds_type == NULL)
1344 error (_("Bad GNAT array descriptor"));
1346 /* NOTE: The following calculation is not really kosher, but
1347 since desc_type is an XVE-encoded type (and shouldn't be),
1348 the correct calculation is a real pain. FIXME (and fix GCC). */
1349 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1350 addr = value_as_long (arr);
1352 addr = value_address (arr);
1355 value_from_longest (lookup_pointer_type (bounds_type),
1356 addr - TYPE_LENGTH (bounds_type));
1359 else if (is_thick_pntr (type))
1360 return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1361 _("Bad GNAT array descriptor"));
1366 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1367 position of the field containing the address of the bounds data. */
1370 fat_pntr_bounds_bitpos (struct type *type)
1372 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1375 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1376 size of the field containing the address of the bounds data. */
1379 fat_pntr_bounds_bitsize (struct type *type)
1381 type = desc_base_type (type);
1383 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1384 return TYPE_FIELD_BITSIZE (type, 1);
1386 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1389 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1390 pointer to one, the type of its array data (a array-with-no-bounds type);
1391 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1394 static struct type *
1395 desc_data_target_type (struct type *type)
1397 type = desc_base_type (type);
1399 /* NOTE: The following is bogus; see comment in desc_bounds. */
1400 if (is_thin_pntr (type))
1401 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1402 else if (is_thick_pntr (type))
1404 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1407 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1408 return TYPE_TARGET_TYPE (data_type);
1414 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1417 static struct value *
1418 desc_data (struct value *arr)
1420 struct type *type = value_type (arr);
1421 if (is_thin_pntr (type))
1422 return thin_data_pntr (arr);
1423 else if (is_thick_pntr (type))
1424 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1425 _("Bad GNAT array descriptor"));
1431 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1432 position of the field containing the address of the data. */
1435 fat_pntr_data_bitpos (struct type *type)
1437 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1440 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1441 size of the field containing the address of the data. */
1444 fat_pntr_data_bitsize (struct type *type)
1446 type = desc_base_type (type);
1448 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1449 return TYPE_FIELD_BITSIZE (type, 0);
1451 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1454 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1455 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1456 bound, if WHICH is 1. The first bound is I=1. */
1458 static struct value *
1459 desc_one_bound (struct value *bounds, int i, int which)
1461 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1462 _("Bad GNAT array descriptor bounds"));
1465 /* If BOUNDS is an array-bounds structure type, return the bit position
1466 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1467 bound, if WHICH is 1. The first bound is I=1. */
1470 desc_bound_bitpos (struct type *type, int i, int which)
1472 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1475 /* If BOUNDS is an array-bounds structure type, return the bit field size
1476 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1477 bound, if WHICH is 1. The first bound is I=1. */
1480 desc_bound_bitsize (struct type *type, int i, int which)
1482 type = desc_base_type (type);
1484 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1485 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1487 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1490 /* If TYPE is the type of an array-bounds structure, the type of its
1491 Ith bound (numbering from 1). Otherwise, NULL. */
1493 static struct type *
1494 desc_index_type (struct type *type, int i)
1496 type = desc_base_type (type);
1498 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1499 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1504 /* The number of index positions in the array-bounds type TYPE.
1505 Return 0 if TYPE is NULL. */
1508 desc_arity (struct type *type)
1510 type = desc_base_type (type);
1513 return TYPE_NFIELDS (type) / 2;
1517 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1518 an array descriptor type (representing an unconstrained array
1522 ada_is_direct_array_type (struct type *type)
1526 type = ada_check_typedef (type);
1527 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1528 || ada_is_array_descriptor_type (type));
1531 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1535 ada_is_array_type (struct type *type)
1538 && (TYPE_CODE (type) == TYPE_CODE_PTR
1539 || TYPE_CODE (type) == TYPE_CODE_REF))
1540 type = TYPE_TARGET_TYPE (type);
1541 return ada_is_direct_array_type (type);
1544 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1547 ada_is_simple_array_type (struct type *type)
1551 type = ada_check_typedef (type);
1552 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1553 || (TYPE_CODE (type) == TYPE_CODE_PTR
1554 && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
1557 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1560 ada_is_array_descriptor_type (struct type *type)
1562 struct type *data_type = desc_data_target_type (type);
1566 type = ada_check_typedef (type);
1567 return (data_type != NULL
1568 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1569 && desc_arity (desc_bounds_type (type)) > 0);
1572 /* Non-zero iff type is a partially mal-formed GNAT array
1573 descriptor. FIXME: This is to compensate for some problems with
1574 debugging output from GNAT. Re-examine periodically to see if it
1578 ada_is_bogus_array_descriptor (struct type *type)
1582 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1583 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1584 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1585 && !ada_is_array_descriptor_type (type);
1589 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1590 (fat pointer) returns the type of the array data described---specifically,
1591 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1592 in from the descriptor; otherwise, they are left unspecified. If
1593 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1594 returns NULL. The result is simply the type of ARR if ARR is not
1597 ada_type_of_array (struct value *arr, int bounds)
1599 if (ada_is_packed_array_type (value_type (arr)))
1600 return decode_packed_array_type (value_type (arr));
1602 if (!ada_is_array_descriptor_type (value_type (arr)))
1603 return value_type (arr);
1607 ada_check_typedef (desc_data_target_type (value_type (arr)));
1610 struct type *elt_type;
1612 struct value *descriptor;
1613 struct objfile *objf = TYPE_OBJFILE (value_type (arr));
1615 elt_type = ada_array_element_type (value_type (arr), -1);
1616 arity = ada_array_arity (value_type (arr));
1618 if (elt_type == NULL || arity == 0)
1619 return ada_check_typedef (value_type (arr));
1621 descriptor = desc_bounds (arr);
1622 if (value_as_long (descriptor) == 0)
1626 struct type *range_type = alloc_type (objf);
1627 struct type *array_type = alloc_type (objf);
1628 struct value *low = desc_one_bound (descriptor, arity, 0);
1629 struct value *high = desc_one_bound (descriptor, arity, 1);
1632 create_range_type (range_type, value_type (low),
1633 longest_to_int (value_as_long (low)),
1634 longest_to_int (value_as_long (high)));
1635 elt_type = create_array_type (array_type, elt_type, range_type);
1638 return lookup_pointer_type (elt_type);
1642 /* If ARR does not represent an array, returns ARR unchanged.
1643 Otherwise, returns either a standard GDB array with bounds set
1644 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1645 GDB array. Returns NULL if ARR is a null fat pointer. */
1648 ada_coerce_to_simple_array_ptr (struct value *arr)
1650 if (ada_is_array_descriptor_type (value_type (arr)))
1652 struct type *arrType = ada_type_of_array (arr, 1);
1653 if (arrType == NULL)
1655 return value_cast (arrType, value_copy (desc_data (arr)));
1657 else if (ada_is_packed_array_type (value_type (arr)))
1658 return decode_packed_array (arr);
1663 /* If ARR does not represent an array, returns ARR unchanged.
1664 Otherwise, returns a standard GDB array describing ARR (which may
1665 be ARR itself if it already is in the proper form). */
1667 static struct value *
1668 ada_coerce_to_simple_array (struct value *arr)
1670 if (ada_is_array_descriptor_type (value_type (arr)))
1672 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1674 error (_("Bounds unavailable for null array pointer."));
1675 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1676 return value_ind (arrVal);
1678 else if (ada_is_packed_array_type (value_type (arr)))
1679 return decode_packed_array (arr);
1684 /* If TYPE represents a GNAT array type, return it translated to an
1685 ordinary GDB array type (possibly with BITSIZE fields indicating
1686 packing). For other types, is the identity. */
1689 ada_coerce_to_simple_array_type (struct type *type)
1691 if (ada_is_packed_array_type (type))
1692 return decode_packed_array_type (type);
1694 if (ada_is_array_descriptor_type (type))
1695 return ada_check_typedef (desc_data_target_type (type));
1700 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1703 ada_is_packed_array_type (struct type *type)
1707 type = desc_base_type (type);
1708 type = ada_check_typedef (type);
1710 ada_type_name (type) != NULL
1711 && strstr (ada_type_name (type), "___XP") != NULL;
1714 /* Given that TYPE is a standard GDB array type with all bounds filled
1715 in, and that the element size of its ultimate scalar constituents
1716 (that is, either its elements, or, if it is an array of arrays, its
1717 elements' elements, etc.) is *ELT_BITS, return an identical type,
1718 but with the bit sizes of its elements (and those of any
1719 constituent arrays) recorded in the BITSIZE components of its
1720 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1723 static struct type *
1724 packed_array_type (struct type *type, long *elt_bits)
1726 struct type *new_elt_type;
1727 struct type *new_type;
1728 LONGEST low_bound, high_bound;
1730 type = ada_check_typedef (type);
1731 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
1734 new_type = alloc_type (TYPE_OBJFILE (type));
1735 new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
1737 create_array_type (new_type, new_elt_type, TYPE_INDEX_TYPE (type));
1738 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
1739 TYPE_NAME (new_type) = ada_type_name (type);
1741 if (get_discrete_bounds (TYPE_INDEX_TYPE (type),
1742 &low_bound, &high_bound) < 0)
1743 low_bound = high_bound = 0;
1744 if (high_bound < low_bound)
1745 *elt_bits = TYPE_LENGTH (new_type) = 0;
1748 *elt_bits *= (high_bound - low_bound + 1);
1749 TYPE_LENGTH (new_type) =
1750 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
1753 TYPE_FIXED_INSTANCE (new_type) = 1;
1757 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1759 static struct type *
1760 decode_packed_array_type (struct type *type)
1763 struct block **blocks;
1764 char *raw_name = ada_type_name (ada_check_typedef (type));
1767 struct type *shadow_type;
1772 raw_name = ada_type_name (desc_base_type (type));
1777 name = (char *) alloca (strlen (raw_name) + 1);
1778 tail = strstr (raw_name, "___XP");
1779 type = desc_base_type (type);
1781 memcpy (name, raw_name, tail - raw_name);
1782 name[tail - raw_name] = '\000';
1784 sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
1785 if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
1787 lim_warning (_("could not find bounds information on packed array"));
1790 shadow_type = SYMBOL_TYPE (sym);
1791 CHECK_TYPEDEF (shadow_type);
1793 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
1795 lim_warning (_("could not understand bounds information on packed array"));
1799 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1802 (_("could not understand bit size information on packed array"));
1806 return packed_array_type (shadow_type, &bits);
1809 /* Given that ARR is a struct value *indicating a GNAT packed array,
1810 returns a simple array that denotes that array. Its type is a
1811 standard GDB array type except that the BITSIZEs of the array
1812 target types are set to the number of bits in each element, and the
1813 type length is set appropriately. */
1815 static struct value *
1816 decode_packed_array (struct value *arr)
1820 arr = ada_coerce_ref (arr);
1822 /* If our value is a pointer, then dererence it. Make sure that
1823 this operation does not cause the target type to be fixed, as
1824 this would indirectly cause this array to be decoded. The rest
1825 of the routine assumes that the array hasn't been decoded yet,
1826 so we use the basic "value_ind" routine to perform the dereferencing,
1827 as opposed to using "ada_value_ind". */
1828 if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
1829 arr = value_ind (arr);
1831 type = decode_packed_array_type (value_type (arr));
1834 error (_("can't unpack array"));
1838 if (gdbarch_bits_big_endian (current_gdbarch)
1839 && ada_is_modular_type (value_type (arr)))
1841 /* This is a (right-justified) modular type representing a packed
1842 array with no wrapper. In order to interpret the value through
1843 the (left-justified) packed array type we just built, we must
1844 first left-justify it. */
1845 int bit_size, bit_pos;
1848 mod = ada_modulus (value_type (arr)) - 1;
1855 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
1856 arr = ada_value_primitive_packed_val (arr, NULL,
1857 bit_pos / HOST_CHAR_BIT,
1858 bit_pos % HOST_CHAR_BIT,
1863 return coerce_unspec_val_to_type (arr, type);
1867 /* The value of the element of packed array ARR at the ARITY indices
1868 given in IND. ARR must be a simple array. */
1870 static struct value *
1871 value_subscript_packed (struct value *arr, int arity, struct value **ind)
1874 int bits, elt_off, bit_off;
1875 long elt_total_bit_offset;
1876 struct type *elt_type;
1880 elt_total_bit_offset = 0;
1881 elt_type = ada_check_typedef (value_type (arr));
1882 for (i = 0; i < arity; i += 1)
1884 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
1885 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
1887 (_("attempt to do packed indexing of something other than a packed array"));
1890 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
1891 LONGEST lowerbound, upperbound;
1894 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
1896 lim_warning (_("don't know bounds of array"));
1897 lowerbound = upperbound = 0;
1900 idx = pos_atr (ind[i]);
1901 if (idx < lowerbound || idx > upperbound)
1902 lim_warning (_("packed array index %ld out of bounds"), (long) idx);
1903 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
1904 elt_total_bit_offset += (idx - lowerbound) * bits;
1905 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
1908 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
1909 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
1911 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
1916 /* Non-zero iff TYPE includes negative integer values. */
1919 has_negatives (struct type *type)
1921 switch (TYPE_CODE (type))
1926 return !TYPE_UNSIGNED (type);
1927 case TYPE_CODE_RANGE:
1928 return TYPE_LOW_BOUND (type) < 0;
1933 /* Create a new value of type TYPE from the contents of OBJ starting
1934 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1935 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1936 assigning through the result will set the field fetched from.
1937 VALADDR is ignored unless OBJ is NULL, in which case,
1938 VALADDR+OFFSET must address the start of storage containing the
1939 packed value. The value returned in this case is never an lval.
1940 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1943 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
1944 long offset, int bit_offset, int bit_size,
1948 int src, /* Index into the source area */
1949 targ, /* Index into the target area */
1950 srcBitsLeft, /* Number of source bits left to move */
1951 nsrc, ntarg, /* Number of source and target bytes */
1952 unusedLS, /* Number of bits in next significant
1953 byte of source that are unused */
1954 accumSize; /* Number of meaningful bits in accum */
1955 unsigned char *bytes; /* First byte containing data to unpack */
1956 unsigned char *unpacked;
1957 unsigned long accum; /* Staging area for bits being transferred */
1959 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
1960 /* Transmit bytes from least to most significant; delta is the direction
1961 the indices move. */
1962 int delta = gdbarch_bits_big_endian (current_gdbarch) ? -1 : 1;
1964 type = ada_check_typedef (type);
1968 v = allocate_value (type);
1969 bytes = (unsigned char *) (valaddr + offset);
1971 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
1974 value_address (obj) + offset);
1975 bytes = (unsigned char *) alloca (len);
1976 read_memory (value_address (v), bytes, len);
1980 v = allocate_value (type);
1981 bytes = (unsigned char *) value_contents (obj) + offset;
1987 set_value_component_location (v, obj);
1988 new_addr = value_address (obj) + offset;
1989 set_value_bitpos (v, bit_offset + value_bitpos (obj));
1990 set_value_bitsize (v, bit_size);
1991 if (value_bitpos (v) >= HOST_CHAR_BIT)
1994 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
1996 set_value_address (v, new_addr);
1999 set_value_bitsize (v, bit_size);
2000 unpacked = (unsigned char *) value_contents (v);
2002 srcBitsLeft = bit_size;
2004 ntarg = TYPE_LENGTH (type);
2008 memset (unpacked, 0, TYPE_LENGTH (type));
2011 else if (gdbarch_bits_big_endian (current_gdbarch))
2014 if (has_negatives (type)
2015 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2019 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2022 switch (TYPE_CODE (type))
2024 case TYPE_CODE_ARRAY:
2025 case TYPE_CODE_UNION:
2026 case TYPE_CODE_STRUCT:
2027 /* Non-scalar values must be aligned at a byte boundary... */
2029 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2030 /* ... And are placed at the beginning (most-significant) bytes
2032 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2037 targ = TYPE_LENGTH (type) - 1;
2043 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2046 unusedLS = bit_offset;
2049 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2056 /* Mask for removing bits of the next source byte that are not
2057 part of the value. */
2058 unsigned int unusedMSMask =
2059 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2061 /* Sign-extend bits for this byte. */
2062 unsigned int signMask = sign & ~unusedMSMask;
2064 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2065 accumSize += HOST_CHAR_BIT - unusedLS;
2066 if (accumSize >= HOST_CHAR_BIT)
2068 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2069 accumSize -= HOST_CHAR_BIT;
2070 accum >>= HOST_CHAR_BIT;
2074 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2081 accum |= sign << accumSize;
2082 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2083 accumSize -= HOST_CHAR_BIT;
2084 accum >>= HOST_CHAR_BIT;
2092 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2093 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2096 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2097 int src_offset, int n)
2099 unsigned int accum, mask;
2100 int accum_bits, chunk_size;
2102 target += targ_offset / HOST_CHAR_BIT;
2103 targ_offset %= HOST_CHAR_BIT;
2104 source += src_offset / HOST_CHAR_BIT;
2105 src_offset %= HOST_CHAR_BIT;
2106 if (gdbarch_bits_big_endian (current_gdbarch))
2108 accum = (unsigned char) *source;
2110 accum_bits = HOST_CHAR_BIT - src_offset;
2115 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2116 accum_bits += HOST_CHAR_BIT;
2118 chunk_size = HOST_CHAR_BIT - targ_offset;
2121 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2122 mask = ((1 << chunk_size) - 1) << unused_right;
2125 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2127 accum_bits -= chunk_size;
2134 accum = (unsigned char) *source >> src_offset;
2136 accum_bits = HOST_CHAR_BIT - src_offset;
2140 accum = accum + ((unsigned char) *source << accum_bits);
2141 accum_bits += HOST_CHAR_BIT;
2143 chunk_size = HOST_CHAR_BIT - targ_offset;
2146 mask = ((1 << chunk_size) - 1) << targ_offset;
2147 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2149 accum_bits -= chunk_size;
2150 accum >>= chunk_size;
2157 /* Store the contents of FROMVAL into the location of TOVAL.
2158 Return a new value with the location of TOVAL and contents of
2159 FROMVAL. Handles assignment into packed fields that have
2160 floating-point or non-scalar types. */
2162 static struct value *
2163 ada_value_assign (struct value *toval, struct value *fromval)
2165 struct type *type = value_type (toval);
2166 int bits = value_bitsize (toval);
2168 toval = ada_coerce_ref (toval);
2169 fromval = ada_coerce_ref (fromval);
2171 if (ada_is_direct_array_type (value_type (toval)))
2172 toval = ada_coerce_to_simple_array (toval);
2173 if (ada_is_direct_array_type (value_type (fromval)))
2174 fromval = ada_coerce_to_simple_array (fromval);
2176 if (!deprecated_value_modifiable (toval))
2177 error (_("Left operand of assignment is not a modifiable lvalue."));
2179 if (VALUE_LVAL (toval) == lval_memory
2181 && (TYPE_CODE (type) == TYPE_CODE_FLT
2182 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2184 int len = (value_bitpos (toval)
2185 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2187 char *buffer = (char *) alloca (len);
2189 CORE_ADDR to_addr = value_address (toval);
2191 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2192 fromval = value_cast (type, fromval);
2194 read_memory (to_addr, buffer, len);
2195 from_size = value_bitsize (fromval);
2197 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2198 if (gdbarch_bits_big_endian (current_gdbarch))
2199 move_bits (buffer, value_bitpos (toval),
2200 value_contents (fromval), from_size - bits, bits);
2202 move_bits (buffer, value_bitpos (toval), value_contents (fromval),
2204 write_memory (to_addr, buffer, len);
2205 if (deprecated_memory_changed_hook)
2206 deprecated_memory_changed_hook (to_addr, len);
2208 val = value_copy (toval);
2209 memcpy (value_contents_raw (val), value_contents (fromval),
2210 TYPE_LENGTH (type));
2211 deprecated_set_value_type (val, type);
2216 return value_assign (toval, fromval);
2220 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2221 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2222 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2223 * COMPONENT, and not the inferior's memory. The current contents
2224 * of COMPONENT are ignored. */
2226 value_assign_to_component (struct value *container, struct value *component,
2229 LONGEST offset_in_container =
2230 (LONGEST) (value_address (component) - value_address (container));
2231 int bit_offset_in_container =
2232 value_bitpos (component) - value_bitpos (container);
2235 val = value_cast (value_type (component), val);
2237 if (value_bitsize (component) == 0)
2238 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2240 bits = value_bitsize (component);
2242 if (gdbarch_bits_big_endian (current_gdbarch))
2243 move_bits (value_contents_writeable (container) + offset_in_container,
2244 value_bitpos (container) + bit_offset_in_container,
2245 value_contents (val),
2246 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2249 move_bits (value_contents_writeable (container) + offset_in_container,
2250 value_bitpos (container) + bit_offset_in_container,
2251 value_contents (val), 0, bits);
2254 /* The value of the element of array ARR at the ARITY indices given in IND.
2255 ARR may be either a simple array, GNAT array descriptor, or pointer
2259 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2263 struct type *elt_type;
2265 elt = ada_coerce_to_simple_array (arr);
2267 elt_type = ada_check_typedef (value_type (elt));
2268 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2269 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2270 return value_subscript_packed (elt, arity, ind);
2272 for (k = 0; k < arity; k += 1)
2274 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2275 error (_("too many subscripts (%d expected)"), k);
2276 elt = value_subscript (elt, pos_atr (ind[k]));
2281 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2282 value of the element of *ARR at the ARITY indices given in
2283 IND. Does not read the entire array into memory. */
2285 static struct value *
2286 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2291 for (k = 0; k < arity; k += 1)
2295 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2296 error (_("too many subscripts (%d expected)"), k);
2297 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2299 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2300 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2301 type = TYPE_TARGET_TYPE (type);
2304 return value_ind (arr);
2307 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2308 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2309 elements starting at index LOW. The lower bound of this array is LOW, as
2311 static struct value *
2312 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2315 CORE_ADDR base = value_as_address (array_ptr)
2316 + ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
2317 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
2318 struct type *index_type =
2319 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
2321 struct type *slice_type =
2322 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2323 return value_at_lazy (slice_type, base);
2327 static struct value *
2328 ada_value_slice (struct value *array, int low, int high)
2330 struct type *type = value_type (array);
2331 struct type *index_type =
2332 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2333 struct type *slice_type =
2334 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2335 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2338 /* If type is a record type in the form of a standard GNAT array
2339 descriptor, returns the number of dimensions for type. If arr is a
2340 simple array, returns the number of "array of"s that prefix its
2341 type designation. Otherwise, returns 0. */
2344 ada_array_arity (struct type *type)
2351 type = desc_base_type (type);
2354 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2355 return desc_arity (desc_bounds_type (type));
2357 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2360 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2366 /* If TYPE is a record type in the form of a standard GNAT array
2367 descriptor or a simple array type, returns the element type for
2368 TYPE after indexing by NINDICES indices, or by all indices if
2369 NINDICES is -1. Otherwise, returns NULL. */
2372 ada_array_element_type (struct type *type, int nindices)
2374 type = desc_base_type (type);
2376 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2379 struct type *p_array_type;
2381 p_array_type = desc_data_target_type (type);
2383 k = ada_array_arity (type);
2387 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2388 if (nindices >= 0 && k > nindices)
2390 while (k > 0 && p_array_type != NULL)
2392 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2395 return p_array_type;
2397 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2399 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2401 type = TYPE_TARGET_TYPE (type);
2410 /* The type of nth index in arrays of given type (n numbering from 1).
2411 Does not examine memory. */
2414 ada_index_type (struct type *type, int n)
2416 struct type *result_type;
2418 type = desc_base_type (type);
2420 if (n > ada_array_arity (type))
2423 if (ada_is_simple_array_type (type))
2427 for (i = 1; i < n; i += 1)
2428 type = TYPE_TARGET_TYPE (type);
2429 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2430 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2431 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2432 perhaps stabsread.c would make more sense. */
2433 if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2434 result_type = builtin_type_int32;
2439 return desc_index_type (desc_bounds_type (type), n);
2442 /* Given that arr is an array type, returns the lower bound of the
2443 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2444 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2445 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2446 bounds type. It works for other arrays with bounds supplied by
2447 run-time quantities other than discriminants. */
2450 ada_array_bound_from_type (struct type * arr_type, int n, int which,
2451 struct type ** typep)
2453 struct type *type, *index_type_desc, *index_type;
2456 gdb_assert (which == 0 || which == 1);
2458 if (ada_is_packed_array_type (arr_type))
2459 arr_type = decode_packed_array_type (arr_type);
2461 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2464 *typep = builtin_type_int32;
2465 return (LONGEST) - which;
2468 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2469 type = TYPE_TARGET_TYPE (arr_type);
2473 index_type_desc = ada_find_parallel_type (type, "___XA");
2474 if (index_type_desc != NULL)
2475 index_type = to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
2476 NULL, TYPE_OBJFILE (arr_type));
2481 type = TYPE_TARGET_TYPE (type);
2485 index_type = TYPE_INDEX_TYPE (type);
2488 switch (TYPE_CODE (index_type))
2490 case TYPE_CODE_RANGE:
2491 retval = which == 0 ? TYPE_LOW_BOUND (index_type)
2492 : TYPE_HIGH_BOUND (index_type);
2494 case TYPE_CODE_ENUM:
2495 retval = which == 0 ? TYPE_FIELD_BITPOS (index_type, 0)
2496 : TYPE_FIELD_BITPOS (index_type,
2497 TYPE_NFIELDS (index_type) - 1);
2500 internal_error (__FILE__, __LINE__, _("invalid type code of index type"));
2504 *typep = index_type;
2509 /* Given that arr is an array value, returns the lower bound of the
2510 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2511 WHICH is 1. This routine will also work for arrays with bounds
2512 supplied by run-time quantities other than discriminants. */
2515 ada_array_bound (struct value *arr, int n, int which)
2517 struct type *arr_type = value_type (arr);
2519 if (ada_is_packed_array_type (arr_type))
2520 return ada_array_bound (decode_packed_array (arr), n, which);
2521 else if (ada_is_simple_array_type (arr_type))
2524 LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
2525 return value_from_longest (type, v);
2528 return desc_one_bound (desc_bounds (arr), n, which);
2531 /* Given that arr is an array value, returns the length of the
2532 nth index. This routine will also work for arrays with bounds
2533 supplied by run-time quantities other than discriminants.
2534 Does not work for arrays indexed by enumeration types with representation
2535 clauses at the moment. */
2537 static struct value *
2538 ada_array_length (struct value *arr, int n)
2540 struct type *arr_type = ada_check_typedef (value_type (arr));
2542 if (ada_is_packed_array_type (arr_type))
2543 return ada_array_length (decode_packed_array (arr), n);
2545 if (ada_is_simple_array_type (arr_type))
2549 ada_array_bound_from_type (arr_type, n, 1, &type) -
2550 ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
2551 return value_from_longest (type, v);
2555 value_from_longest (builtin_type_int32,
2556 value_as_long (desc_one_bound (desc_bounds (arr),
2558 - value_as_long (desc_one_bound (desc_bounds (arr),
2562 /* An empty array whose type is that of ARR_TYPE (an array type),
2563 with bounds LOW to LOW-1. */
2565 static struct value *
2566 empty_array (struct type *arr_type, int low)
2568 struct type *index_type =
2569 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
2571 struct type *elt_type = ada_array_element_type (arr_type, 1);
2572 return allocate_value (create_array_type (NULL, elt_type, index_type));
2576 /* Name resolution */
2578 /* The "decoded" name for the user-definable Ada operator corresponding
2582 ada_decoded_op_name (enum exp_opcode op)
2586 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2588 if (ada_opname_table[i].op == op)
2589 return ada_opname_table[i].decoded;
2591 error (_("Could not find operator name for opcode"));
2595 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2596 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2597 undefined namespace) and converts operators that are
2598 user-defined into appropriate function calls. If CONTEXT_TYPE is
2599 non-null, it provides a preferred result type [at the moment, only
2600 type void has any effect---causing procedures to be preferred over
2601 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2602 return type is preferred. May change (expand) *EXP. */
2605 resolve (struct expression **expp, int void_context_p)
2609 resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
2612 /* Resolve the operator of the subexpression beginning at
2613 position *POS of *EXPP. "Resolving" consists of replacing
2614 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2615 with their resolutions, replacing built-in operators with
2616 function calls to user-defined operators, where appropriate, and,
2617 when DEPROCEDURE_P is non-zero, converting function-valued variables
2618 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2619 are as in ada_resolve, above. */
2621 static struct value *
2622 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2623 struct type *context_type)
2627 struct expression *exp; /* Convenience: == *expp. */
2628 enum exp_opcode op = (*expp)->elts[pc].opcode;
2629 struct value **argvec; /* Vector of operand types (alloca'ed). */
2630 int nargs; /* Number of operands. */
2637 /* Pass one: resolve operands, saving their types and updating *pos,
2642 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2643 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2648 resolve_subexp (expp, pos, 0, NULL);
2650 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2655 resolve_subexp (expp, pos, 0, NULL);
2660 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
2663 case OP_ATR_MODULUS:
2673 case TERNOP_IN_RANGE:
2674 case BINOP_IN_BOUNDS:
2680 case OP_DISCRETE_RANGE:
2682 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2691 arg1 = resolve_subexp (expp, pos, 0, NULL);
2693 resolve_subexp (expp, pos, 1, NULL);
2695 resolve_subexp (expp, pos, 1, value_type (arg1));
2712 case BINOP_LOGICAL_AND:
2713 case BINOP_LOGICAL_OR:
2714 case BINOP_BITWISE_AND:
2715 case BINOP_BITWISE_IOR:
2716 case BINOP_BITWISE_XOR:
2719 case BINOP_NOTEQUAL:
2726 case BINOP_SUBSCRIPT:
2734 case UNOP_LOGICAL_NOT:
2750 case OP_INTERNALVAR:
2760 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2763 case STRUCTOP_STRUCT:
2764 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2777 error (_("Unexpected operator during name resolution"));
2780 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
2781 for (i = 0; i < nargs; i += 1)
2782 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
2786 /* Pass two: perform any resolution on principal operator. */
2793 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
2795 struct ada_symbol_info *candidates;
2799 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2800 (exp->elts[pc + 2].symbol),
2801 exp->elts[pc + 1].block, VAR_DOMAIN,
2804 if (n_candidates > 1)
2806 /* Types tend to get re-introduced locally, so if there
2807 are any local symbols that are not types, first filter
2810 for (j = 0; j < n_candidates; j += 1)
2811 switch (SYMBOL_CLASS (candidates[j].sym))
2816 case LOC_REGPARM_ADDR:
2824 if (j < n_candidates)
2827 while (j < n_candidates)
2829 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
2831 candidates[j] = candidates[n_candidates - 1];
2840 if (n_candidates == 0)
2841 error (_("No definition found for %s"),
2842 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2843 else if (n_candidates == 1)
2845 else if (deprocedure_p
2846 && !is_nonfunction (candidates, n_candidates))
2848 i = ada_resolve_function
2849 (candidates, n_candidates, NULL, 0,
2850 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
2853 error (_("Could not find a match for %s"),
2854 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2858 printf_filtered (_("Multiple matches for %s\n"),
2859 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2860 user_select_syms (candidates, n_candidates, 1);
2864 exp->elts[pc + 1].block = candidates[i].block;
2865 exp->elts[pc + 2].symbol = candidates[i].sym;
2866 if (innermost_block == NULL
2867 || contained_in (candidates[i].block, innermost_block))
2868 innermost_block = candidates[i].block;
2872 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
2875 replace_operator_with_call (expp, pc, 0, 0,
2876 exp->elts[pc + 2].symbol,
2877 exp->elts[pc + 1].block);
2884 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2885 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2887 struct ada_symbol_info *candidates;
2891 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2892 (exp->elts[pc + 5].symbol),
2893 exp->elts[pc + 4].block, VAR_DOMAIN,
2895 if (n_candidates == 1)
2899 i = ada_resolve_function
2900 (candidates, n_candidates,
2902 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
2905 error (_("Could not find a match for %s"),
2906 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
2909 exp->elts[pc + 4].block = candidates[i].block;
2910 exp->elts[pc + 5].symbol = candidates[i].sym;
2911 if (innermost_block == NULL
2912 || contained_in (candidates[i].block, innermost_block))
2913 innermost_block = candidates[i].block;
2924 case BINOP_BITWISE_AND:
2925 case BINOP_BITWISE_IOR:
2926 case BINOP_BITWISE_XOR:
2928 case BINOP_NOTEQUAL:
2936 case UNOP_LOGICAL_NOT:
2938 if (possible_user_operator_p (op, argvec))
2940 struct ada_symbol_info *candidates;
2944 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
2945 (struct block *) NULL, VAR_DOMAIN,
2947 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
2948 ada_decoded_op_name (op), NULL);
2952 replace_operator_with_call (expp, pc, nargs, 1,
2953 candidates[i].sym, candidates[i].block);
2964 return evaluate_subexp_type (exp, pos);
2967 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2968 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2969 a non-pointer. A type of 'void' (which is never a valid expression type)
2970 by convention matches anything. */
2971 /* The term "match" here is rather loose. The match is heuristic and
2972 liberal. FIXME: TOO liberal, in fact. */
2975 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
2977 ftype = ada_check_typedef (ftype);
2978 atype = ada_check_typedef (atype);
2980 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
2981 ftype = TYPE_TARGET_TYPE (ftype);
2982 if (TYPE_CODE (atype) == TYPE_CODE_REF)
2983 atype = TYPE_TARGET_TYPE (atype);
2985 if (TYPE_CODE (ftype) == TYPE_CODE_VOID
2986 || TYPE_CODE (atype) == TYPE_CODE_VOID)
2989 switch (TYPE_CODE (ftype))
2994 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
2995 return ada_type_match (TYPE_TARGET_TYPE (ftype),
2996 TYPE_TARGET_TYPE (atype), 0);
2999 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3001 case TYPE_CODE_ENUM:
3002 case TYPE_CODE_RANGE:
3003 switch (TYPE_CODE (atype))
3006 case TYPE_CODE_ENUM:
3007 case TYPE_CODE_RANGE:
3013 case TYPE_CODE_ARRAY:
3014 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3015 || ada_is_array_descriptor_type (atype));
3017 case TYPE_CODE_STRUCT:
3018 if (ada_is_array_descriptor_type (ftype))
3019 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3020 || ada_is_array_descriptor_type (atype));
3022 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3023 && !ada_is_array_descriptor_type (atype));
3025 case TYPE_CODE_UNION:
3027 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3031 /* Return non-zero if the formals of FUNC "sufficiently match" the
3032 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3033 may also be an enumeral, in which case it is treated as a 0-
3034 argument function. */
3037 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3040 struct type *func_type = SYMBOL_TYPE (func);
3042 if (SYMBOL_CLASS (func) == LOC_CONST
3043 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3044 return (n_actuals == 0);
3045 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3048 if (TYPE_NFIELDS (func_type) != n_actuals)
3051 for (i = 0; i < n_actuals; i += 1)
3053 if (actuals[i] == NULL)
3057 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
3058 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3060 if (!ada_type_match (ftype, atype, 1))
3067 /* False iff function type FUNC_TYPE definitely does not produce a value
3068 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3069 FUNC_TYPE is not a valid function type with a non-null return type
3070 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3073 return_match (struct type *func_type, struct type *context_type)
3075 struct type *return_type;
3077 if (func_type == NULL)
3080 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3081 return_type = base_type (TYPE_TARGET_TYPE (func_type));
3083 return_type = base_type (func_type);
3084 if (return_type == NULL)
3087 context_type = base_type (context_type);
3089 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3090 return context_type == NULL || return_type == context_type;
3091 else if (context_type == NULL)
3092 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3094 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3098 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3099 function (if any) that matches the types of the NARGS arguments in
3100 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3101 that returns that type, then eliminate matches that don't. If
3102 CONTEXT_TYPE is void and there is at least one match that does not
3103 return void, eliminate all matches that do.
3105 Asks the user if there is more than one match remaining. Returns -1
3106 if there is no such symbol or none is selected. NAME is used
3107 solely for messages. May re-arrange and modify SYMS in
3108 the process; the index returned is for the modified vector. */
3111 ada_resolve_function (struct ada_symbol_info syms[],
3112 int nsyms, struct value **args, int nargs,
3113 const char *name, struct type *context_type)
3116 int m; /* Number of hits */
3117 struct type *fallback;
3118 struct type *return_type;
3120 return_type = context_type;
3121 if (context_type == NULL)
3122 fallback = builtin_type_void;
3129 for (k = 0; k < nsyms; k += 1)
3131 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3133 if (ada_args_match (syms[k].sym, args, nargs)
3134 && return_match (type, return_type))
3140 if (m > 0 || return_type == fallback)
3143 return_type = fallback;
3150 printf_filtered (_("Multiple matches for %s\n"), name);
3151 user_select_syms (syms, m, 1);
3157 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3158 in a listing of choices during disambiguation (see sort_choices, below).
3159 The idea is that overloadings of a subprogram name from the
3160 same package should sort in their source order. We settle for ordering
3161 such symbols by their trailing number (__N or $N). */
3164 encoded_ordered_before (char *N0, char *N1)
3168 else if (N0 == NULL)
3173 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3175 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3177 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3178 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3182 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3185 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3187 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3188 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3190 return (strcmp (N0, N1) < 0);
3194 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3198 sort_choices (struct ada_symbol_info syms[], int nsyms)
3201 for (i = 1; i < nsyms; i += 1)
3203 struct ada_symbol_info sym = syms[i];
3206 for (j = i - 1; j >= 0; j -= 1)
3208 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3209 SYMBOL_LINKAGE_NAME (sym.sym)))
3211 syms[j + 1] = syms[j];
3217 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3218 by asking the user (if necessary), returning the number selected,
3219 and setting the first elements of SYMS items. Error if no symbols
3222 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3223 to be re-integrated one of these days. */
3226 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3229 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3231 int first_choice = (max_results == 1) ? 1 : 2;
3232 const char *select_mode = multiple_symbols_select_mode ();
3234 if (max_results < 1)
3235 error (_("Request to select 0 symbols!"));
3239 if (select_mode == multiple_symbols_cancel)
3241 canceled because the command is ambiguous\n\
3242 See set/show multiple-symbol."));
3244 /* If select_mode is "all", then return all possible symbols.
3245 Only do that if more than one symbol can be selected, of course.
3246 Otherwise, display the menu as usual. */
3247 if (select_mode == multiple_symbols_all && max_results > 1)
3250 printf_unfiltered (_("[0] cancel\n"));
3251 if (max_results > 1)
3252 printf_unfiltered (_("[1] all\n"));
3254 sort_choices (syms, nsyms);
3256 for (i = 0; i < nsyms; i += 1)
3258 if (syms[i].sym == NULL)
3261 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3263 struct symtab_and_line sal =
3264 find_function_start_sal (syms[i].sym, 1);
3265 if (sal.symtab == NULL)
3266 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3268 SYMBOL_PRINT_NAME (syms[i].sym),
3271 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3272 SYMBOL_PRINT_NAME (syms[i].sym),
3273 sal.symtab->filename, sal.line);
3279 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3280 && SYMBOL_TYPE (syms[i].sym) != NULL
3281 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3282 struct symtab *symtab = syms[i].sym->symtab;
3284 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3285 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3287 SYMBOL_PRINT_NAME (syms[i].sym),
3288 symtab->filename, SYMBOL_LINE (syms[i].sym));
3289 else if (is_enumeral
3290 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3292 printf_unfiltered (("[%d] "), i + first_choice);
3293 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3295 printf_unfiltered (_("'(%s) (enumeral)\n"),
3296 SYMBOL_PRINT_NAME (syms[i].sym));
3298 else if (symtab != NULL)
3299 printf_unfiltered (is_enumeral
3300 ? _("[%d] %s in %s (enumeral)\n")
3301 : _("[%d] %s at %s:?\n"),
3303 SYMBOL_PRINT_NAME (syms[i].sym),
3306 printf_unfiltered (is_enumeral
3307 ? _("[%d] %s (enumeral)\n")
3308 : _("[%d] %s at ?\n"),
3310 SYMBOL_PRINT_NAME (syms[i].sym));
3314 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3317 for (i = 0; i < n_chosen; i += 1)
3318 syms[i] = syms[chosen[i]];
3323 /* Read and validate a set of numeric choices from the user in the
3324 range 0 .. N_CHOICES-1. Place the results in increasing
3325 order in CHOICES[0 .. N-1], and return N.
3327 The user types choices as a sequence of numbers on one line
3328 separated by blanks, encoding them as follows:
3330 + A choice of 0 means to cancel the selection, throwing an error.
3331 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3332 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3334 The user is not allowed to choose more than MAX_RESULTS values.
3336 ANNOTATION_SUFFIX, if present, is used to annotate the input
3337 prompts (for use with the -f switch). */
3340 get_selections (int *choices, int n_choices, int max_results,
3341 int is_all_choice, char *annotation_suffix)
3346 int first_choice = is_all_choice ? 2 : 1;
3348 prompt = getenv ("PS2");
3352 args = command_line_input (prompt, 0, annotation_suffix);
3355 error_no_arg (_("one or more choice numbers"));
3359 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3360 order, as given in args. Choices are validated. */
3366 while (isspace (*args))
3368 if (*args == '\0' && n_chosen == 0)
3369 error_no_arg (_("one or more choice numbers"));
3370 else if (*args == '\0')
3373 choice = strtol (args, &args2, 10);
3374 if (args == args2 || choice < 0
3375 || choice > n_choices + first_choice - 1)
3376 error (_("Argument must be choice number"));
3380 error (_("cancelled"));
3382 if (choice < first_choice)
3384 n_chosen = n_choices;
3385 for (j = 0; j < n_choices; j += 1)
3389 choice -= first_choice;
3391 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3395 if (j < 0 || choice != choices[j])
3398 for (k = n_chosen - 1; k > j; k -= 1)
3399 choices[k + 1] = choices[k];
3400 choices[j + 1] = choice;
3405 if (n_chosen > max_results)
3406 error (_("Select no more than %d of the above"), max_results);
3411 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3412 on the function identified by SYM and BLOCK, and taking NARGS
3413 arguments. Update *EXPP as needed to hold more space. */
3416 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3417 int oplen, struct symbol *sym,
3418 struct block *block)
3420 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3421 symbol, -oplen for operator being replaced). */
3422 struct expression *newexp = (struct expression *)
3423 xmalloc (sizeof (struct expression)
3424 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3425 struct expression *exp = *expp;
3427 newexp->nelts = exp->nelts + 7 - oplen;
3428 newexp->language_defn = exp->language_defn;
3429 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3430 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3431 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3433 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3434 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3436 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3437 newexp->elts[pc + 4].block = block;
3438 newexp->elts[pc + 5].symbol = sym;
3444 /* Type-class predicates */
3446 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3450 numeric_type_p (struct type *type)
3456 switch (TYPE_CODE (type))
3461 case TYPE_CODE_RANGE:
3462 return (type == TYPE_TARGET_TYPE (type)
3463 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3470 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3473 integer_type_p (struct type *type)
3479 switch (TYPE_CODE (type))
3483 case TYPE_CODE_RANGE:
3484 return (type == TYPE_TARGET_TYPE (type)
3485 || integer_type_p (TYPE_TARGET_TYPE (type)));
3492 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3495 scalar_type_p (struct type *type)
3501 switch (TYPE_CODE (type))
3504 case TYPE_CODE_RANGE:
3505 case TYPE_CODE_ENUM:
3514 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3517 discrete_type_p (struct type *type)
3523 switch (TYPE_CODE (type))
3526 case TYPE_CODE_RANGE:
3527 case TYPE_CODE_ENUM:
3535 /* Returns non-zero if OP with operands in the vector ARGS could be
3536 a user-defined function. Errs on the side of pre-defined operators
3537 (i.e., result 0). */
3540 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3542 struct type *type0 =
3543 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3544 struct type *type1 =
3545 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3559 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3563 case BINOP_BITWISE_AND:
3564 case BINOP_BITWISE_IOR:
3565 case BINOP_BITWISE_XOR:
3566 return (!(integer_type_p (type0) && integer_type_p (type1)));
3569 case BINOP_NOTEQUAL:
3574 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3577 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3580 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3584 case UNOP_LOGICAL_NOT:
3586 return (!numeric_type_p (type0));
3595 1. In the following, we assume that a renaming type's name may
3596 have an ___XD suffix. It would be nice if this went away at some
3598 2. We handle both the (old) purely type-based representation of
3599 renamings and the (new) variable-based encoding. At some point,
3600 it is devoutly to be hoped that the former goes away
3601 (FIXME: hilfinger-2007-07-09).
3602 3. Subprogram renamings are not implemented, although the XRS
3603 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3605 /* If SYM encodes a renaming,
3607 <renaming> renames <renamed entity>,
3609 sets *LEN to the length of the renamed entity's name,
3610 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3611 the string describing the subcomponent selected from the renamed
3612 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3613 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3614 are undefined). Otherwise, returns a value indicating the category
3615 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3616 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3617 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3618 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3619 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3620 may be NULL, in which case they are not assigned.
3622 [Currently, however, GCC does not generate subprogram renamings.] */
3624 enum ada_renaming_category
3625 ada_parse_renaming (struct symbol *sym,
3626 const char **renamed_entity, int *len,
3627 const char **renaming_expr)
3629 enum ada_renaming_category kind;
3634 return ADA_NOT_RENAMING;
3635 switch (SYMBOL_CLASS (sym))
3638 return ADA_NOT_RENAMING;
3640 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3641 renamed_entity, len, renaming_expr);
3645 case LOC_OPTIMIZED_OUT:
3646 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3648 return ADA_NOT_RENAMING;
3652 kind = ADA_OBJECT_RENAMING;
3656 kind = ADA_EXCEPTION_RENAMING;
3660 kind = ADA_PACKAGE_RENAMING;
3664 kind = ADA_SUBPROGRAM_RENAMING;
3668 return ADA_NOT_RENAMING;
3672 if (renamed_entity != NULL)
3673 *renamed_entity = info;
3674 suffix = strstr (info, "___XE");
3675 if (suffix == NULL || suffix == info)
3676 return ADA_NOT_RENAMING;
3678 *len = strlen (info) - strlen (suffix);
3680 if (renaming_expr != NULL)
3681 *renaming_expr = suffix;
3685 /* Assuming TYPE encodes a renaming according to the old encoding in
3686 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3687 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3688 ADA_NOT_RENAMING otherwise. */
3689 static enum ada_renaming_category
3690 parse_old_style_renaming (struct type *type,
3691 const char **renamed_entity, int *len,
3692 const char **renaming_expr)
3694 enum ada_renaming_category kind;
3699 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3700 || TYPE_NFIELDS (type) != 1)
3701 return ADA_NOT_RENAMING;
3703 name = type_name_no_tag (type);
3705 return ADA_NOT_RENAMING;
3707 name = strstr (name, "___XR");
3709 return ADA_NOT_RENAMING;
3714 kind = ADA_OBJECT_RENAMING;
3717 kind = ADA_EXCEPTION_RENAMING;
3720 kind = ADA_PACKAGE_RENAMING;
3723 kind = ADA_SUBPROGRAM_RENAMING;
3726 return ADA_NOT_RENAMING;
3729 info = TYPE_FIELD_NAME (type, 0);
3731 return ADA_NOT_RENAMING;
3732 if (renamed_entity != NULL)
3733 *renamed_entity = info;
3734 suffix = strstr (info, "___XE");
3735 if (renaming_expr != NULL)
3736 *renaming_expr = suffix + 5;
3737 if (suffix == NULL || suffix == info)
3738 return ADA_NOT_RENAMING;
3740 *len = suffix - info;
3746 /* Evaluation: Function Calls */
3748 /* Return an lvalue containing the value VAL. This is the identity on
3749 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3750 on the stack, using and updating *SP as the stack pointer, and
3751 returning an lvalue whose value_address points to the copy. */
3753 static struct value *
3754 ensure_lval (struct value *val, CORE_ADDR *sp)
3756 if (! VALUE_LVAL (val))
3758 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
3760 /* The following is taken from the structure-return code in
3761 call_function_by_hand. FIXME: Therefore, some refactoring seems
3763 if (gdbarch_inner_than (current_gdbarch, 1, 2))
3765 /* Stack grows downward. Align SP and value_address (val) after
3766 reserving sufficient space. */
3768 if (gdbarch_frame_align_p (current_gdbarch))
3769 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3770 set_value_address (val, *sp);
3774 /* Stack grows upward. Align the frame, allocate space, and
3775 then again, re-align the frame. */
3776 if (gdbarch_frame_align_p (current_gdbarch))
3777 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3778 set_value_address (val, *sp);
3780 if (gdbarch_frame_align_p (current_gdbarch))
3781 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3783 VALUE_LVAL (val) = lval_memory;
3785 write_memory (value_address (val), value_contents_raw (val), len);
3791 /* Return the value ACTUAL, converted to be an appropriate value for a
3792 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3793 allocating any necessary descriptors (fat pointers), or copies of
3794 values not residing in memory, updating it as needed. */
3797 ada_convert_actual (struct value *actual, struct type *formal_type0,
3800 struct type *actual_type = ada_check_typedef (value_type (actual));
3801 struct type *formal_type = ada_check_typedef (formal_type0);
3802 struct type *formal_target =
3803 TYPE_CODE (formal_type) == TYPE_CODE_PTR
3804 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
3805 struct type *actual_target =
3806 TYPE_CODE (actual_type) == TYPE_CODE_PTR
3807 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
3809 if (ada_is_array_descriptor_type (formal_target)
3810 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
3811 return make_array_descriptor (formal_type, actual, sp);
3812 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
3813 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
3815 struct value *result;
3816 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
3817 && ada_is_array_descriptor_type (actual_target))
3818 result = desc_data (actual);
3819 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
3821 if (VALUE_LVAL (actual) != lval_memory)
3824 actual_type = ada_check_typedef (value_type (actual));
3825 val = allocate_value (actual_type);
3826 memcpy ((char *) value_contents_raw (val),
3827 (char *) value_contents (actual),
3828 TYPE_LENGTH (actual_type));
3829 actual = ensure_lval (val, sp);
3831 result = value_addr (actual);
3835 return value_cast_pointers (formal_type, result);
3837 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
3838 return ada_value_ind (actual);
3844 /* Push a descriptor of type TYPE for array value ARR on the stack at
3845 *SP, updating *SP to reflect the new descriptor. Return either
3846 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3847 to-descriptor type rather than a descriptor type), a struct value *
3848 representing a pointer to this descriptor. */
3850 static struct value *
3851 make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
3853 struct type *bounds_type = desc_bounds_type (type);
3854 struct type *desc_type = desc_base_type (type);
3855 struct value *descriptor = allocate_value (desc_type);
3856 struct value *bounds = allocate_value (bounds_type);
3859 for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
3861 modify_general_field (value_contents_writeable (bounds),
3862 value_as_long (ada_array_bound (arr, i, 0)),
3863 desc_bound_bitpos (bounds_type, i, 0),
3864 desc_bound_bitsize (bounds_type, i, 0));
3865 modify_general_field (value_contents_writeable (bounds),
3866 value_as_long (ada_array_bound (arr, i, 1)),
3867 desc_bound_bitpos (bounds_type, i, 1),
3868 desc_bound_bitsize (bounds_type, i, 1));
3871 bounds = ensure_lval (bounds, sp);
3873 modify_general_field (value_contents_writeable (descriptor),
3874 value_address (ensure_lval (arr, sp)),
3875 fat_pntr_data_bitpos (desc_type),
3876 fat_pntr_data_bitsize (desc_type));
3878 modify_general_field (value_contents_writeable (descriptor),
3879 value_address (bounds),
3880 fat_pntr_bounds_bitpos (desc_type),
3881 fat_pntr_bounds_bitsize (desc_type));
3883 descriptor = ensure_lval (descriptor, sp);
3885 if (TYPE_CODE (type) == TYPE_CODE_PTR)
3886 return value_addr (descriptor);
3891 /* Dummy definitions for an experimental caching module that is not
3892 * used in the public sources. */
3895 lookup_cached_symbol (const char *name, domain_enum namespace,
3896 struct symbol **sym, struct block **block)
3902 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
3903 struct block *block)
3909 /* Return the result of a standard (literal, C-like) lookup of NAME in
3910 given DOMAIN, visible from lexical block BLOCK. */
3912 static struct symbol *
3913 standard_lookup (const char *name, const struct block *block,
3918 if (lookup_cached_symbol (name, domain, &sym, NULL))
3920 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
3921 cache_symbol (name, domain, sym, block_found);
3926 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3927 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3928 since they contend in overloading in the same way. */
3930 is_nonfunction (struct ada_symbol_info syms[], int n)
3934 for (i = 0; i < n; i += 1)
3935 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
3936 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
3937 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
3943 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3944 struct types. Otherwise, they may not. */
3947 equiv_types (struct type *type0, struct type *type1)
3951 if (type0 == NULL || type1 == NULL
3952 || TYPE_CODE (type0) != TYPE_CODE (type1))
3954 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
3955 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
3956 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
3957 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
3963 /* True iff SYM0 represents the same entity as SYM1, or one that is
3964 no more defined than that of SYM1. */
3967 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
3971 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
3972 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
3975 switch (SYMBOL_CLASS (sym0))
3981 struct type *type0 = SYMBOL_TYPE (sym0);
3982 struct type *type1 = SYMBOL_TYPE (sym1);
3983 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
3984 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
3985 int len0 = strlen (name0);
3987 TYPE_CODE (type0) == TYPE_CODE (type1)
3988 && (equiv_types (type0, type1)
3989 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
3990 && strncmp (name1 + len0, "___XV", 5) == 0));
3993 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
3994 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4000 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4001 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4004 add_defn_to_vec (struct obstack *obstackp,
4006 struct block *block)
4010 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4012 /* Do not try to complete stub types, as the debugger is probably
4013 already scanning all symbols matching a certain name at the
4014 time when this function is called. Trying to replace the stub
4015 type by its associated full type will cause us to restart a scan
4016 which may lead to an infinite recursion. Instead, the client
4017 collecting the matching symbols will end up collecting several
4018 matches, with at least one of them complete. It can then filter
4019 out the stub ones if needed. */
4021 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4023 if (lesseq_defined_than (sym, prevDefns[i].sym))
4025 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4027 prevDefns[i].sym = sym;
4028 prevDefns[i].block = block;
4034 struct ada_symbol_info info;
4038 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4042 /* Number of ada_symbol_info structures currently collected in
4043 current vector in *OBSTACKP. */
4046 num_defns_collected (struct obstack *obstackp)
4048 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4051 /* Vector of ada_symbol_info structures currently collected in current
4052 vector in *OBSTACKP. If FINISH, close off the vector and return
4053 its final address. */
4055 static struct ada_symbol_info *
4056 defns_collected (struct obstack *obstackp, int finish)
4059 return obstack_finish (obstackp);
4061 return (struct ada_symbol_info *) obstack_base (obstackp);
4064 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4065 Check the global symbols if GLOBAL, the static symbols if not.
4066 Do wild-card match if WILD. */
4068 static struct partial_symbol *
4069 ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
4070 int global, domain_enum namespace, int wild)
4072 struct partial_symbol **start;
4073 int name_len = strlen (name);
4074 int length = (global ? pst->n_global_syms : pst->n_static_syms);
4083 pst->objfile->global_psymbols.list + pst->globals_offset :
4084 pst->objfile->static_psymbols.list + pst->statics_offset);
4088 for (i = 0; i < length; i += 1)
4090 struct partial_symbol *psym = start[i];
4092 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4093 SYMBOL_DOMAIN (psym), namespace)
4094 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
4108 int M = (U + i) >> 1;
4109 struct partial_symbol *psym = start[M];
4110 if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
4112 else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
4114 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
4125 struct partial_symbol *psym = start[i];
4127 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4128 SYMBOL_DOMAIN (psym), namespace))
4130 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
4138 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
4152 int M = (U + i) >> 1;
4153 struct partial_symbol *psym = start[M];
4154 if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
4156 else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
4158 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
4169 struct partial_symbol *psym = start[i];
4171 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4172 SYMBOL_DOMAIN (psym), namespace))
4176 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
4179 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
4181 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
4191 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
4201 /* Return a minimal symbol matching NAME according to Ada decoding
4202 rules. Returns NULL if there is no such minimal symbol. Names
4203 prefixed with "standard__" are handled specially: "standard__" is
4204 first stripped off, and only static and global symbols are searched. */
4206 struct minimal_symbol *
4207 ada_lookup_simple_minsym (const char *name)
4209 struct objfile *objfile;
4210 struct minimal_symbol *msymbol;
4213 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4215 name += sizeof ("standard__") - 1;
4219 wild_match = (strstr (name, "__") == NULL);
4221 ALL_MSYMBOLS (objfile, msymbol)
4223 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4224 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4231 /* For all subprograms that statically enclose the subprogram of the
4232 selected frame, add symbols matching identifier NAME in DOMAIN
4233 and their blocks to the list of data in OBSTACKP, as for
4234 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4238 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4239 const char *name, domain_enum namespace,
4244 /* True if TYPE is definitely an artificial type supplied to a symbol
4245 for which no debugging information was given in the symbol file. */
4248 is_nondebugging_type (struct type *type)
4250 char *name = ada_type_name (type);
4251 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4254 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4255 duplicate other symbols in the list (The only case I know of where
4256 this happens is when object files containing stabs-in-ecoff are
4257 linked with files containing ordinary ecoff debugging symbols (or no
4258 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4259 Returns the number of items in the modified list. */
4262 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4271 /* If two symbols have the same name and one of them is a stub type,
4272 the get rid of the stub. */
4274 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4275 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4277 for (j = 0; j < nsyms; j++)
4280 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4281 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4282 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4283 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4288 /* Two symbols with the same name, same class and same address
4289 should be identical. */
4291 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4292 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4293 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4295 for (j = 0; j < nsyms; j += 1)
4298 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4299 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4300 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4301 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4302 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4303 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4310 for (j = i + 1; j < nsyms; j += 1)
4311 syms[j - 1] = syms[j];
4320 /* Given a type that corresponds to a renaming entity, use the type name
4321 to extract the scope (package name or function name, fully qualified,
4322 and following the GNAT encoding convention) where this renaming has been
4323 defined. The string returned needs to be deallocated after use. */
4326 xget_renaming_scope (struct type *renaming_type)
4328 /* The renaming types adhere to the following convention:
4329 <scope>__<rename>___<XR extension>.
4330 So, to extract the scope, we search for the "___XR" extension,
4331 and then backtrack until we find the first "__". */
4333 const char *name = type_name_no_tag (renaming_type);
4334 char *suffix = strstr (name, "___XR");
4339 /* Now, backtrack a bit until we find the first "__". Start looking
4340 at suffix - 3, as the <rename> part is at least one character long. */
4342 for (last = suffix - 3; last > name; last--)
4343 if (last[0] == '_' && last[1] == '_')
4346 /* Make a copy of scope and return it. */
4348 scope_len = last - name;
4349 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4351 strncpy (scope, name, scope_len);
4352 scope[scope_len] = '\0';
4357 /* Return nonzero if NAME corresponds to a package name. */
4360 is_package_name (const char *name)
4362 /* Here, We take advantage of the fact that no symbols are generated
4363 for packages, while symbols are generated for each function.
4364 So the condition for NAME represent a package becomes equivalent
4365 to NAME not existing in our list of symbols. There is only one
4366 small complication with library-level functions (see below). */
4370 /* If it is a function that has not been defined at library level,
4371 then we should be able to look it up in the symbols. */
4372 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4375 /* Library-level function names start with "_ada_". See if function
4376 "_ada_" followed by NAME can be found. */
4378 /* Do a quick check that NAME does not contain "__", since library-level
4379 functions names cannot contain "__" in them. */
4380 if (strstr (name, "__") != NULL)
4383 fun_name = xstrprintf ("_ada_%s", name);
4385 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4388 /* Return nonzero if SYM corresponds to a renaming entity that is
4389 not visible from FUNCTION_NAME. */
4392 old_renaming_is_invisible (const struct symbol *sym, char *function_name)
4396 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4399 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4401 make_cleanup (xfree, scope);
4403 /* If the rename has been defined in a package, then it is visible. */
4404 if (is_package_name (scope))
4407 /* Check that the rename is in the current function scope by checking
4408 that its name starts with SCOPE. */
4410 /* If the function name starts with "_ada_", it means that it is
4411 a library-level function. Strip this prefix before doing the
4412 comparison, as the encoding for the renaming does not contain
4414 if (strncmp (function_name, "_ada_", 5) == 0)
4417 return (strncmp (function_name, scope, strlen (scope)) != 0);
4420 /* Remove entries from SYMS that corresponds to a renaming entity that
4421 is not visible from the function associated with CURRENT_BLOCK or
4422 that is superfluous due to the presence of more specific renaming
4423 information. Places surviving symbols in the initial entries of
4424 SYMS and returns the number of surviving symbols.
4427 First, in cases where an object renaming is implemented as a
4428 reference variable, GNAT may produce both the actual reference
4429 variable and the renaming encoding. In this case, we discard the
4432 Second, GNAT emits a type following a specified encoding for each renaming
4433 entity. Unfortunately, STABS currently does not support the definition
4434 of types that are local to a given lexical block, so all renamings types
4435 are emitted at library level. As a consequence, if an application
4436 contains two renaming entities using the same name, and a user tries to
4437 print the value of one of these entities, the result of the ada symbol
4438 lookup will also contain the wrong renaming type.
4440 This function partially covers for this limitation by attempting to
4441 remove from the SYMS list renaming symbols that should be visible
4442 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4443 method with the current information available. The implementation
4444 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4446 - When the user tries to print a rename in a function while there
4447 is another rename entity defined in a package: Normally, the
4448 rename in the function has precedence over the rename in the
4449 package, so the latter should be removed from the list. This is
4450 currently not the case.
4452 - This function will incorrectly remove valid renames if
4453 the CURRENT_BLOCK corresponds to a function which symbol name
4454 has been changed by an "Export" pragma. As a consequence,
4455 the user will be unable to print such rename entities. */
4458 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4459 int nsyms, const struct block *current_block)
4461 struct symbol *current_function;
4462 char *current_function_name;
4464 int is_new_style_renaming;
4466 /* If there is both a renaming foo___XR... encoded as a variable and
4467 a simple variable foo in the same block, discard the latter.
4468 First, zero out such symbols, then compress. */
4469 is_new_style_renaming = 0;
4470 for (i = 0; i < nsyms; i += 1)
4472 struct symbol *sym = syms[i].sym;
4473 struct block *block = syms[i].block;
4477 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4479 name = SYMBOL_LINKAGE_NAME (sym);
4480 suffix = strstr (name, "___XR");
4484 int name_len = suffix - name;
4486 is_new_style_renaming = 1;
4487 for (j = 0; j < nsyms; j += 1)
4488 if (i != j && syms[j].sym != NULL
4489 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4491 && block == syms[j].block)
4495 if (is_new_style_renaming)
4499 for (j = k = 0; j < nsyms; j += 1)
4500 if (syms[j].sym != NULL)
4508 /* Extract the function name associated to CURRENT_BLOCK.
4509 Abort if unable to do so. */
4511 if (current_block == NULL)
4514 current_function = block_linkage_function (current_block);
4515 if (current_function == NULL)
4518 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4519 if (current_function_name == NULL)
4522 /* Check each of the symbols, and remove it from the list if it is
4523 a type corresponding to a renaming that is out of the scope of
4524 the current block. */
4529 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4530 == ADA_OBJECT_RENAMING
4531 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4534 for (j = i + 1; j < nsyms; j += 1)
4535 syms[j - 1] = syms[j];
4545 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4546 whose name and domain match NAME and DOMAIN respectively.
4547 If no match was found, then extend the search to "enclosing"
4548 routines (in other words, if we're inside a nested function,
4549 search the symbols defined inside the enclosing functions).
4551 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4554 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4555 struct block *block, domain_enum domain,
4558 int block_depth = 0;
4560 while (block != NULL)
4563 ada_add_block_symbols (obstackp, block, name, domain, NULL, wild_match);
4565 /* If we found a non-function match, assume that's the one. */
4566 if (is_nonfunction (defns_collected (obstackp, 0),
4567 num_defns_collected (obstackp)))
4570 block = BLOCK_SUPERBLOCK (block);
4573 /* If no luck so far, try to find NAME as a local symbol in some lexically
4574 enclosing subprogram. */
4575 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4576 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match);
4579 /* Add to OBSTACKP all non-local symbols whose name and domain match
4580 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4581 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4584 ada_add_non_local_symbols (struct obstack *obstackp, const char *name,
4585 domain_enum domain, int global,
4588 struct objfile *objfile;
4589 struct partial_symtab *ps;
4591 ALL_PSYMTABS (objfile, ps)
4595 || ada_lookup_partial_symbol (ps, name, global, domain, wild_match))
4597 struct symtab *s = PSYMTAB_TO_SYMTAB (ps);
4598 const int block_kind = global ? GLOBAL_BLOCK : STATIC_BLOCK;
4600 if (s == NULL || !s->primary)
4602 ada_add_block_symbols (obstackp,
4603 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), block_kind),
4604 name, domain, objfile, wild_match);
4609 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4610 scope and in global scopes, returning the number of matches. Sets
4611 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4612 indicating the symbols found and the blocks and symbol tables (if
4613 any) in which they were found. This vector are transient---good only to
4614 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4615 symbol match within the nest of blocks whose innermost member is BLOCK0,
4616 is the one match returned (no other matches in that or
4617 enclosing blocks is returned). If there are any matches in or
4618 surrounding BLOCK0, then these alone are returned. Otherwise, the
4619 search extends to global and file-scope (static) symbol tables.
4620 Names prefixed with "standard__" are handled specially: "standard__"
4621 is first stripped off, and only static and global symbols are searched. */
4624 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4625 domain_enum namespace,
4626 struct ada_symbol_info **results)
4629 struct block *block;
4635 obstack_free (&symbol_list_obstack, NULL);
4636 obstack_init (&symbol_list_obstack);
4640 /* Search specified block and its superiors. */
4642 wild_match = (strstr (name0, "__") == NULL);
4644 block = (struct block *) block0; /* FIXME: No cast ought to be
4645 needed, but adding const will
4646 have a cascade effect. */
4648 /* Special case: If the user specifies a symbol name inside package
4649 Standard, do a non-wild matching of the symbol name without
4650 the "standard__" prefix. This was primarily introduced in order
4651 to allow the user to specifically access the standard exceptions
4652 using, for instance, Standard.Constraint_Error when Constraint_Error
4653 is ambiguous (due to the user defining its own Constraint_Error
4654 entity inside its program). */
4655 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
4659 name = name0 + sizeof ("standard__") - 1;
4662 /* Check the non-global symbols. If we have ANY match, then we're done. */
4664 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
4666 if (num_defns_collected (&symbol_list_obstack) > 0)
4669 /* No non-global symbols found. Check our cache to see if we have
4670 already performed this search before. If we have, then return
4674 if (lookup_cached_symbol (name0, namespace, &sym, &block))
4677 add_defn_to_vec (&symbol_list_obstack, sym, block);
4681 /* Search symbols from all global blocks. */
4683 ada_add_non_local_symbols (&symbol_list_obstack, name, namespace, 1,
4686 /* Now add symbols from all per-file blocks if we've gotten no hits
4687 (not strictly correct, but perhaps better than an error). */
4689 if (num_defns_collected (&symbol_list_obstack) == 0)
4690 ada_add_non_local_symbols (&symbol_list_obstack, name, namespace, 0,
4694 ndefns = num_defns_collected (&symbol_list_obstack);
4695 *results = defns_collected (&symbol_list_obstack, 1);
4697 ndefns = remove_extra_symbols (*results, ndefns);
4700 cache_symbol (name0, namespace, NULL, NULL);
4702 if (ndefns == 1 && cacheIfUnique)
4703 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
4705 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
4711 ada_lookup_encoded_symbol (const char *name, const struct block *block0,
4712 domain_enum namespace, struct block **block_found)
4714 struct ada_symbol_info *candidates;
4717 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
4719 if (n_candidates == 0)
4722 if (block_found != NULL)
4723 *block_found = candidates[0].block;
4725 return fixup_symbol_section (candidates[0].sym, NULL);
4728 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4729 scope and in global scopes, or NULL if none. NAME is folded and
4730 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4731 choosing the first symbol if there are multiple choices.
4732 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4733 table in which the symbol was found (in both cases, these
4734 assignments occur only if the pointers are non-null). */
4736 ada_lookup_symbol (const char *name, const struct block *block0,
4737 domain_enum namespace, int *is_a_field_of_this)
4739 if (is_a_field_of_this != NULL)
4740 *is_a_field_of_this = 0;
4743 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
4744 block0, namespace, NULL);
4747 static struct symbol *
4748 ada_lookup_symbol_nonlocal (const char *name,
4749 const char *linkage_name,
4750 const struct block *block,
4751 const domain_enum domain)
4753 if (linkage_name == NULL)
4754 linkage_name = name;
4755 return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
4760 /* True iff STR is a possible encoded suffix of a normal Ada name
4761 that is to be ignored for matching purposes. Suffixes of parallel
4762 names (e.g., XVE) are not included here. Currently, the possible suffixes
4763 are given by any of the regular expressions:
4765 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4766 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4767 _E[0-9]+[bs]$ [protected object entry suffixes]
4768 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4770 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4771 match is performed. This sequence is used to differentiate homonyms,
4772 is an optional part of a valid name suffix. */
4775 is_name_suffix (const char *str)
4778 const char *matching;
4779 const int len = strlen (str);
4781 /* Skip optional leading __[0-9]+. */
4783 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
4786 while (isdigit (str[0]))
4792 if (str[0] == '.' || str[0] == '$')
4795 while (isdigit (matching[0]))
4797 if (matching[0] == '\0')
4803 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
4806 while (isdigit (matching[0]))
4808 if (matching[0] == '\0')
4813 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4814 with a N at the end. Unfortunately, the compiler uses the same
4815 convention for other internal types it creates. So treating
4816 all entity names that end with an "N" as a name suffix causes
4817 some regressions. For instance, consider the case of an enumerated
4818 type. To support the 'Image attribute, it creates an array whose
4820 Having a single character like this as a suffix carrying some
4821 information is a bit risky. Perhaps we should change the encoding
4822 to be something like "_N" instead. In the meantime, do not do
4823 the following check. */
4824 /* Protected Object Subprograms */
4825 if (len == 1 && str [0] == 'N')
4830 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
4833 while (isdigit (matching[0]))
4835 if ((matching[0] == 'b' || matching[0] == 's')
4836 && matching [1] == '\0')
4840 /* ??? We should not modify STR directly, as we are doing below. This
4841 is fine in this case, but may become problematic later if we find
4842 that this alternative did not work, and want to try matching
4843 another one from the begining of STR. Since we modified it, we
4844 won't be able to find the begining of the string anymore! */
4848 while (str[0] != '_' && str[0] != '\0')
4850 if (str[0] != 'n' && str[0] != 'b')
4856 if (str[0] == '\000')
4861 if (str[1] != '_' || str[2] == '\000')
4865 if (strcmp (str + 3, "JM") == 0)
4867 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4868 the LJM suffix in favor of the JM one. But we will
4869 still accept LJM as a valid suffix for a reasonable
4870 amount of time, just to allow ourselves to debug programs
4871 compiled using an older version of GNAT. */
4872 if (strcmp (str + 3, "LJM") == 0)
4876 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
4877 || str[4] == 'U' || str[4] == 'P')
4879 if (str[4] == 'R' && str[5] != 'T')
4883 if (!isdigit (str[2]))
4885 for (k = 3; str[k] != '\0'; k += 1)
4886 if (!isdigit (str[k]) && str[k] != '_')
4890 if (str[0] == '$' && isdigit (str[1]))
4892 for (k = 2; str[k] != '\0'; k += 1)
4893 if (!isdigit (str[k]) && str[k] != '_')
4900 /* Return non-zero if the string starting at NAME and ending before
4901 NAME_END contains no capital letters. */
4904 is_valid_name_for_wild_match (const char *name0)
4906 const char *decoded_name = ada_decode (name0);
4909 /* If the decoded name starts with an angle bracket, it means that
4910 NAME0 does not follow the GNAT encoding format. It should then
4911 not be allowed as a possible wild match. */
4912 if (decoded_name[0] == '<')
4915 for (i=0; decoded_name[i] != '\0'; i++)
4916 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
4922 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4923 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4924 informational suffixes of NAME (i.e., for which is_name_suffix is
4928 wild_match (const char *patn0, int patn_len, const char *name0)
4935 match = strstr (start, patn0);
4940 || (match > name0 + 1 && match[-1] == '_' && match[-2] == '_')
4941 || (match == name0 + 5 && strncmp ("_ada_", name0, 5) == 0))
4942 && is_name_suffix (match + patn_len))
4943 return (match == name0 || is_valid_name_for_wild_match (name0));
4948 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4949 vector *defn_symbols, updating the list of symbols in OBSTACKP
4950 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4951 OBJFILE is the section containing BLOCK.
4952 SYMTAB is recorded with each symbol added. */
4955 ada_add_block_symbols (struct obstack *obstackp,
4956 struct block *block, const char *name,
4957 domain_enum domain, struct objfile *objfile,
4960 struct dict_iterator iter;
4961 int name_len = strlen (name);
4962 /* A matching argument symbol, if any. */
4963 struct symbol *arg_sym;
4964 /* Set true when we find a matching non-argument symbol. */
4973 ALL_BLOCK_SYMBOLS (block, iter, sym)
4975 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
4976 SYMBOL_DOMAIN (sym), domain)
4977 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
4979 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4981 else if (SYMBOL_IS_ARGUMENT (sym))
4986 add_defn_to_vec (obstackp,
4987 fixup_symbol_section (sym, objfile),
4995 ALL_BLOCK_SYMBOLS (block, iter, sym)
4997 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
4998 SYMBOL_DOMAIN (sym), domain))
5000 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
5002 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
5004 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5006 if (SYMBOL_IS_ARGUMENT (sym))
5011 add_defn_to_vec (obstackp,
5012 fixup_symbol_section (sym, objfile),
5021 if (!found_sym && arg_sym != NULL)
5023 add_defn_to_vec (obstackp,
5024 fixup_symbol_section (arg_sym, objfile),
5033 ALL_BLOCK_SYMBOLS (block, iter, sym)
5035 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5036 SYMBOL_DOMAIN (sym), domain))
5040 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5043 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5045 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5050 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5052 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5054 if (SYMBOL_IS_ARGUMENT (sym))
5059 add_defn_to_vec (obstackp,
5060 fixup_symbol_section (sym, objfile),
5068 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5069 They aren't parameters, right? */
5070 if (!found_sym && arg_sym != NULL)
5072 add_defn_to_vec (obstackp,
5073 fixup_symbol_section (arg_sym, objfile),
5080 /* Symbol Completion */
5082 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5083 name in a form that's appropriate for the completion. The result
5084 does not need to be deallocated, but is only good until the next call.
5086 TEXT_LEN is equal to the length of TEXT.
5087 Perform a wild match if WILD_MATCH is set.
5088 ENCODED should be set if TEXT represents the start of a symbol name
5089 in its encoded form. */
5092 symbol_completion_match (const char *sym_name,
5093 const char *text, int text_len,
5094 int wild_match, int encoded)
5097 const int verbatim_match = (text[0] == '<');
5102 /* Strip the leading angle bracket. */
5107 /* First, test against the fully qualified name of the symbol. */
5109 if (strncmp (sym_name, text, text_len) == 0)
5112 if (match && !encoded)
5114 /* One needed check before declaring a positive match is to verify
5115 that iff we are doing a verbatim match, the decoded version
5116 of the symbol name starts with '<'. Otherwise, this symbol name
5117 is not a suitable completion. */
5118 const char *sym_name_copy = sym_name;
5119 int has_angle_bracket;
5121 sym_name = ada_decode (sym_name);
5122 has_angle_bracket = (sym_name[0] == '<');
5123 match = (has_angle_bracket == verbatim_match);
5124 sym_name = sym_name_copy;
5127 if (match && !verbatim_match)
5129 /* When doing non-verbatim match, another check that needs to
5130 be done is to verify that the potentially matching symbol name
5131 does not include capital letters, because the ada-mode would
5132 not be able to understand these symbol names without the
5133 angle bracket notation. */
5136 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5141 /* Second: Try wild matching... */
5143 if (!match && wild_match)
5145 /* Since we are doing wild matching, this means that TEXT
5146 may represent an unqualified symbol name. We therefore must
5147 also compare TEXT against the unqualified name of the symbol. */
5148 sym_name = ada_unqualified_name (ada_decode (sym_name));
5150 if (strncmp (sym_name, text, text_len) == 0)
5154 /* Finally: If we found a mach, prepare the result to return. */
5160 sym_name = add_angle_brackets (sym_name);
5163 sym_name = ada_decode (sym_name);
5168 typedef char *char_ptr;
5169 DEF_VEC_P (char_ptr);
5171 /* A companion function to ada_make_symbol_completion_list().
5172 Check if SYM_NAME represents a symbol which name would be suitable
5173 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5174 it is appended at the end of the given string vector SV.
5176 ORIG_TEXT is the string original string from the user command
5177 that needs to be completed. WORD is the entire command on which
5178 completion should be performed. These two parameters are used to
5179 determine which part of the symbol name should be added to the
5181 if WILD_MATCH is set, then wild matching is performed.
5182 ENCODED should be set if TEXT represents a symbol name in its
5183 encoded formed (in which case the completion should also be
5187 symbol_completion_add (VEC(char_ptr) **sv,
5188 const char *sym_name,
5189 const char *text, int text_len,
5190 const char *orig_text, const char *word,
5191 int wild_match, int encoded)
5193 const char *match = symbol_completion_match (sym_name, text, text_len,
5194 wild_match, encoded);
5200 /* We found a match, so add the appropriate completion to the given
5203 if (word == orig_text)
5205 completion = xmalloc (strlen (match) + 5);
5206 strcpy (completion, match);
5208 else if (word > orig_text)
5210 /* Return some portion of sym_name. */
5211 completion = xmalloc (strlen (match) + 5);
5212 strcpy (completion, match + (word - orig_text));
5216 /* Return some of ORIG_TEXT plus sym_name. */
5217 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5218 strncpy (completion, word, orig_text - word);
5219 completion[orig_text - word] = '\0';
5220 strcat (completion, match);
5223 VEC_safe_push (char_ptr, *sv, completion);
5226 /* Return a list of possible symbol names completing TEXT0. The list
5227 is NULL terminated. WORD is the entire command on which completion
5231 ada_make_symbol_completion_list (char *text0, char *word)
5237 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5240 struct partial_symtab *ps;
5241 struct minimal_symbol *msymbol;
5242 struct objfile *objfile;
5243 struct block *b, *surrounding_static_block = 0;
5245 struct dict_iterator iter;
5247 if (text0[0] == '<')
5249 text = xstrdup (text0);
5250 make_cleanup (xfree, text);
5251 text_len = strlen (text);
5257 text = xstrdup (ada_encode (text0));
5258 make_cleanup (xfree, text);
5259 text_len = strlen (text);
5260 for (i = 0; i < text_len; i++)
5261 text[i] = tolower (text[i]);
5263 encoded = (strstr (text0, "__") != NULL);
5264 /* If the name contains a ".", then the user is entering a fully
5265 qualified entity name, and the match must not be done in wild
5266 mode. Similarly, if the user wants to complete what looks like
5267 an encoded name, the match must not be done in wild mode. */
5268 wild_match = (strchr (text0, '.') == NULL && !encoded);
5271 /* First, look at the partial symtab symbols. */
5272 ALL_PSYMTABS (objfile, ps)
5274 struct partial_symbol **psym;
5276 /* If the psymtab's been read in we'll get it when we search
5277 through the blockvector. */
5281 for (psym = objfile->global_psymbols.list + ps->globals_offset;
5282 psym < (objfile->global_psymbols.list + ps->globals_offset
5283 + ps->n_global_syms); psym++)
5286 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
5287 text, text_len, text0, word,
5288 wild_match, encoded);
5291 for (psym = objfile->static_psymbols.list + ps->statics_offset;
5292 psym < (objfile->static_psymbols.list + ps->statics_offset
5293 + ps->n_static_syms); psym++)
5296 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
5297 text, text_len, text0, word,
5298 wild_match, encoded);
5302 /* At this point scan through the misc symbol vectors and add each
5303 symbol you find to the list. Eventually we want to ignore
5304 anything that isn't a text symbol (everything else will be
5305 handled by the psymtab code above). */
5307 ALL_MSYMBOLS (objfile, msymbol)
5310 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5311 text, text_len, text0, word, wild_match, encoded);
5314 /* Search upwards from currently selected frame (so that we can
5315 complete on local vars. */
5317 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5319 if (!BLOCK_SUPERBLOCK (b))
5320 surrounding_static_block = b; /* For elmin of dups */
5322 ALL_BLOCK_SYMBOLS (b, iter, sym)
5324 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5325 text, text_len, text0, word,
5326 wild_match, encoded);
5330 /* Go through the symtabs and check the externs and statics for
5331 symbols which match. */
5333 ALL_SYMTABS (objfile, s)
5336 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5337 ALL_BLOCK_SYMBOLS (b, iter, sym)
5339 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5340 text, text_len, text0, word,
5341 wild_match, encoded);
5345 ALL_SYMTABS (objfile, s)
5348 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5349 /* Don't do this block twice. */
5350 if (b == surrounding_static_block)
5352 ALL_BLOCK_SYMBOLS (b, iter, sym)
5354 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5355 text, text_len, text0, word,
5356 wild_match, encoded);
5360 /* Append the closing NULL entry. */
5361 VEC_safe_push (char_ptr, completions, NULL);
5363 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5364 return the copy. It's unfortunate that we have to make a copy
5365 of an array that we're about to destroy, but there is nothing much
5366 we can do about it. Fortunately, it's typically not a very large
5369 const size_t completions_size =
5370 VEC_length (char_ptr, completions) * sizeof (char *);
5371 char **result = malloc (completions_size);
5373 memcpy (result, VEC_address (char_ptr, completions), completions_size);
5375 VEC_free (char_ptr, completions);
5382 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5383 for tagged types. */
5386 ada_is_dispatch_table_ptr_type (struct type *type)
5390 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5393 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5397 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5400 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5401 to be invisible to users. */
5404 ada_is_ignored_field (struct type *type, int field_num)
5406 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5409 /* Check the name of that field. */
5411 const char *name = TYPE_FIELD_NAME (type, field_num);
5413 /* Anonymous field names should not be printed.
5414 brobecker/2007-02-20: I don't think this can actually happen
5415 but we don't want to print the value of annonymous fields anyway. */
5419 /* A field named "_parent" is internally generated by GNAT for
5420 tagged types, and should not be printed either. */
5421 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5425 /* If this is the dispatch table of a tagged type, then ignore. */
5426 if (ada_is_tagged_type (type, 1)
5427 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5430 /* Not a special field, so it should not be ignored. */
5434 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5435 pointer or reference type whose ultimate target has a tag field. */
5438 ada_is_tagged_type (struct type *type, int refok)
5440 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5443 /* True iff TYPE represents the type of X'Tag */
5446 ada_is_tag_type (struct type *type)
5448 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5452 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5453 return (name != NULL
5454 && strcmp (name, "ada__tags__dispatch_table") == 0);
5458 /* The type of the tag on VAL. */
5461 ada_tag_type (struct value *val)
5463 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
5466 /* The value of the tag on VAL. */
5469 ada_value_tag (struct value *val)
5471 return ada_value_struct_elt (val, "_tag", 0);
5474 /* The value of the tag on the object of type TYPE whose contents are
5475 saved at VALADDR, if it is non-null, or is at memory address
5478 static struct value *
5479 value_tag_from_contents_and_address (struct type *type,
5480 const gdb_byte *valaddr,
5483 int tag_byte_offset, dummy1, dummy2;
5484 struct type *tag_type;
5485 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5488 const gdb_byte *valaddr1 = ((valaddr == NULL)
5490 : valaddr + tag_byte_offset);
5491 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5493 return value_from_contents_and_address (tag_type, valaddr1, address1);
5498 static struct type *
5499 type_from_tag (struct value *tag)
5501 const char *type_name = ada_tag_name (tag);
5502 if (type_name != NULL)
5503 return ada_find_any_type (ada_encode (type_name));
5514 static int ada_tag_name_1 (void *);
5515 static int ada_tag_name_2 (struct tag_args *);
5517 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5518 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5519 The value stored in ARGS->name is valid until the next call to
5523 ada_tag_name_1 (void *args0)
5525 struct tag_args *args = (struct tag_args *) args0;
5526 static char name[1024];
5530 val = ada_value_struct_elt (args->tag, "tsd", 1);
5532 return ada_tag_name_2 (args);
5533 val = ada_value_struct_elt (val, "expanded_name", 1);
5536 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5537 for (p = name; *p != '\0'; p += 1)
5544 /* Utility function for ada_tag_name_1 that tries the second
5545 representation for the dispatch table (in which there is no
5546 explicit 'tsd' field in the referent of the tag pointer, and instead
5547 the tsd pointer is stored just before the dispatch table. */
5550 ada_tag_name_2 (struct tag_args *args)
5552 struct type *info_type;
5553 static char name[1024];
5555 struct value *val, *valp;
5558 info_type = ada_find_any_type ("ada__tags__type_specific_data");
5559 if (info_type == NULL)
5561 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
5562 valp = value_cast (info_type, args->tag);
5565 val = value_ind (value_ptradd (valp, -1));
5568 val = ada_value_struct_elt (val, "expanded_name", 1);
5571 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5572 for (p = name; *p != '\0'; p += 1)
5579 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5583 ada_tag_name (struct value *tag)
5585 struct tag_args args;
5586 if (!ada_is_tag_type (value_type (tag)))
5590 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
5594 /* The parent type of TYPE, or NULL if none. */
5597 ada_parent_type (struct type *type)
5601 type = ada_check_typedef (type);
5603 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
5606 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5607 if (ada_is_parent_field (type, i))
5609 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
5611 /* If the _parent field is a pointer, then dereference it. */
5612 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
5613 parent_type = TYPE_TARGET_TYPE (parent_type);
5614 /* If there is a parallel XVS type, get the actual base type. */
5615 parent_type = ada_get_base_type (parent_type);
5617 return ada_check_typedef (parent_type);
5623 /* True iff field number FIELD_NUM of structure type TYPE contains the
5624 parent-type (inherited) fields of a derived type. Assumes TYPE is
5625 a structure type with at least FIELD_NUM+1 fields. */
5628 ada_is_parent_field (struct type *type, int field_num)
5630 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5631 return (name != NULL
5632 && (strncmp (name, "PARENT", 6) == 0
5633 || strncmp (name, "_parent", 7) == 0));
5636 /* True iff field number FIELD_NUM of structure type TYPE is a
5637 transparent wrapper field (which should be silently traversed when doing
5638 field selection and flattened when printing). Assumes TYPE is a
5639 structure type with at least FIELD_NUM+1 fields. Such fields are always
5643 ada_is_wrapper_field (struct type *type, int field_num)
5645 const char *name = TYPE_FIELD_NAME (type, field_num);
5646 return (name != NULL
5647 && (strncmp (name, "PARENT", 6) == 0
5648 || strcmp (name, "REP") == 0
5649 || strncmp (name, "_parent", 7) == 0
5650 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
5653 /* True iff field number FIELD_NUM of structure or union type TYPE
5654 is a variant wrapper. Assumes TYPE is a structure type with at least
5655 FIELD_NUM+1 fields. */
5658 ada_is_variant_part (struct type *type, int field_num)
5660 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5661 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
5662 || (is_dynamic_field (type, field_num)
5663 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
5664 == TYPE_CODE_UNION)));
5667 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5668 whose discriminants are contained in the record type OUTER_TYPE,
5669 returns the type of the controlling discriminant for the variant. */
5672 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
5674 char *name = ada_variant_discrim_name (var_type);
5676 ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
5678 return builtin_type_int32;
5683 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5684 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5685 represents a 'when others' clause; otherwise 0. */
5688 ada_is_others_clause (struct type *type, int field_num)
5690 const char *name = TYPE_FIELD_NAME (type, field_num);
5691 return (name != NULL && name[0] == 'O');
5694 /* Assuming that TYPE0 is the type of the variant part of a record,
5695 returns the name of the discriminant controlling the variant.
5696 The value is valid until the next call to ada_variant_discrim_name. */
5699 ada_variant_discrim_name (struct type *type0)
5701 static char *result = NULL;
5702 static size_t result_len = 0;
5705 const char *discrim_end;
5706 const char *discrim_start;
5708 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
5709 type = TYPE_TARGET_TYPE (type0);
5713 name = ada_type_name (type);
5715 if (name == NULL || name[0] == '\000')
5718 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
5721 if (strncmp (discrim_end, "___XVN", 6) == 0)
5724 if (discrim_end == name)
5727 for (discrim_start = discrim_end; discrim_start != name + 3;
5730 if (discrim_start == name + 1)
5732 if ((discrim_start > name + 3
5733 && strncmp (discrim_start - 3, "___", 3) == 0)
5734 || discrim_start[-1] == '.')
5738 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
5739 strncpy (result, discrim_start, discrim_end - discrim_start);
5740 result[discrim_end - discrim_start] = '\0';
5744 /* Scan STR for a subtype-encoded number, beginning at position K.
5745 Put the position of the character just past the number scanned in
5746 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5747 Return 1 if there was a valid number at the given position, and 0
5748 otherwise. A "subtype-encoded" number consists of the absolute value
5749 in decimal, followed by the letter 'm' to indicate a negative number.
5750 Assumes 0m does not occur. */
5753 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
5757 if (!isdigit (str[k]))
5760 /* Do it the hard way so as not to make any assumption about
5761 the relationship of unsigned long (%lu scan format code) and
5764 while (isdigit (str[k]))
5766 RU = RU * 10 + (str[k] - '0');
5773 *R = (-(LONGEST) (RU - 1)) - 1;
5779 /* NOTE on the above: Technically, C does not say what the results of
5780 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5781 number representable as a LONGEST (although either would probably work
5782 in most implementations). When RU>0, the locution in the then branch
5783 above is always equivalent to the negative of RU. */
5790 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5791 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5792 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5795 ada_in_variant (LONGEST val, struct type *type, int field_num)
5797 const char *name = TYPE_FIELD_NAME (type, field_num);
5810 if (!ada_scan_number (name, p + 1, &W, &p))
5819 if (!ada_scan_number (name, p + 1, &L, &p)
5820 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
5822 if (val >= L && val <= U)
5834 /* FIXME: Lots of redundancy below. Try to consolidate. */
5836 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5837 ARG_TYPE, extract and return the value of one of its (non-static)
5838 fields. FIELDNO says which field. Differs from value_primitive_field
5839 only in that it can handle packed values of arbitrary type. */
5841 static struct value *
5842 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
5843 struct type *arg_type)
5847 arg_type = ada_check_typedef (arg_type);
5848 type = TYPE_FIELD_TYPE (arg_type, fieldno);
5850 /* Handle packed fields. */
5852 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
5854 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
5855 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
5857 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
5858 offset + bit_pos / 8,
5859 bit_pos % 8, bit_size, type);
5862 return value_primitive_field (arg1, offset, fieldno, arg_type);
5865 /* Find field with name NAME in object of type TYPE. If found,
5866 set the following for each argument that is non-null:
5867 - *FIELD_TYPE_P to the field's type;
5868 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5869 an object of that type;
5870 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5871 - *BIT_SIZE_P to its size in bits if the field is packed, and
5873 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5874 fields up to but not including the desired field, or by the total
5875 number of fields if not found. A NULL value of NAME never
5876 matches; the function just counts visible fields in this case.
5878 Returns 1 if found, 0 otherwise. */
5881 find_struct_field (char *name, struct type *type, int offset,
5882 struct type **field_type_p,
5883 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
5888 type = ada_check_typedef (type);
5890 if (field_type_p != NULL)
5891 *field_type_p = NULL;
5892 if (byte_offset_p != NULL)
5894 if (bit_offset_p != NULL)
5896 if (bit_size_p != NULL)
5899 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5901 int bit_pos = TYPE_FIELD_BITPOS (type, i);
5902 int fld_offset = offset + bit_pos / 8;
5903 char *t_field_name = TYPE_FIELD_NAME (type, i);
5905 if (t_field_name == NULL)
5908 else if (name != NULL && field_name_match (t_field_name, name))
5910 int bit_size = TYPE_FIELD_BITSIZE (type, i);
5911 if (field_type_p != NULL)
5912 *field_type_p = TYPE_FIELD_TYPE (type, i);
5913 if (byte_offset_p != NULL)
5914 *byte_offset_p = fld_offset;
5915 if (bit_offset_p != NULL)
5916 *bit_offset_p = bit_pos % 8;
5917 if (bit_size_p != NULL)
5918 *bit_size_p = bit_size;
5921 else if (ada_is_wrapper_field (type, i))
5923 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
5924 field_type_p, byte_offset_p, bit_offset_p,
5925 bit_size_p, index_p))
5928 else if (ada_is_variant_part (type, i))
5930 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5933 struct type *field_type
5934 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5936 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
5938 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
5940 + TYPE_FIELD_BITPOS (field_type, j) / 8,
5941 field_type_p, byte_offset_p,
5942 bit_offset_p, bit_size_p, index_p))
5946 else if (index_p != NULL)
5952 /* Number of user-visible fields in record type TYPE. */
5955 num_visible_fields (struct type *type)
5959 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
5963 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5964 and search in it assuming it has (class) type TYPE.
5965 If found, return value, else return NULL.
5967 Searches recursively through wrapper fields (e.g., '_parent'). */
5969 static struct value *
5970 ada_search_struct_field (char *name, struct value *arg, int offset,
5974 type = ada_check_typedef (type);
5976 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5978 char *t_field_name = TYPE_FIELD_NAME (type, i);
5980 if (t_field_name == NULL)
5983 else if (field_name_match (t_field_name, name))
5984 return ada_value_primitive_field (arg, offset, i, type);
5986 else if (ada_is_wrapper_field (type, i))
5988 struct value *v = /* Do not let indent join lines here. */
5989 ada_search_struct_field (name, arg,
5990 offset + TYPE_FIELD_BITPOS (type, i) / 8,
5991 TYPE_FIELD_TYPE (type, i));
5996 else if (ada_is_variant_part (type, i))
5998 /* PNH: Do we ever get here? See find_struct_field. */
6000 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6001 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6003 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6005 struct value *v = ada_search_struct_field /* Force line break. */
6007 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6008 TYPE_FIELD_TYPE (field_type, j));
6017 static struct value *ada_index_struct_field_1 (int *, struct value *,
6018 int, struct type *);
6021 /* Return field #INDEX in ARG, where the index is that returned by
6022 * find_struct_field through its INDEX_P argument. Adjust the address
6023 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6024 * If found, return value, else return NULL. */
6026 static struct value *
6027 ada_index_struct_field (int index, struct value *arg, int offset,
6030 return ada_index_struct_field_1 (&index, arg, offset, type);
6034 /* Auxiliary function for ada_index_struct_field. Like
6035 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6038 static struct value *
6039 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6043 type = ada_check_typedef (type);
6045 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6047 if (TYPE_FIELD_NAME (type, i) == NULL)
6049 else if (ada_is_wrapper_field (type, i))
6051 struct value *v = /* Do not let indent join lines here. */
6052 ada_index_struct_field_1 (index_p, arg,
6053 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6054 TYPE_FIELD_TYPE (type, i));
6059 else if (ada_is_variant_part (type, i))
6061 /* PNH: Do we ever get here? See ada_search_struct_field,
6062 find_struct_field. */
6063 error (_("Cannot assign this kind of variant record"));
6065 else if (*index_p == 0)
6066 return ada_value_primitive_field (arg, offset, i, type);
6073 /* Given ARG, a value of type (pointer or reference to a)*
6074 structure/union, extract the component named NAME from the ultimate
6075 target structure/union and return it as a value with its
6078 The routine searches for NAME among all members of the structure itself
6079 and (recursively) among all members of any wrapper members
6082 If NO_ERR, then simply return NULL in case of error, rather than
6086 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6088 struct type *t, *t1;
6092 t1 = t = ada_check_typedef (value_type (arg));
6093 if (TYPE_CODE (t) == TYPE_CODE_REF)
6095 t1 = TYPE_TARGET_TYPE (t);
6098 t1 = ada_check_typedef (t1);
6099 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6101 arg = coerce_ref (arg);
6106 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6108 t1 = TYPE_TARGET_TYPE (t);
6111 t1 = ada_check_typedef (t1);
6112 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6114 arg = value_ind (arg);
6121 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6125 v = ada_search_struct_field (name, arg, 0, t);
6128 int bit_offset, bit_size, byte_offset;
6129 struct type *field_type;
6132 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6133 address = value_as_address (arg);
6135 address = unpack_pointer (t, value_contents (arg));
6137 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6138 if (find_struct_field (name, t1, 0,
6139 &field_type, &byte_offset, &bit_offset,
6144 if (TYPE_CODE (t) == TYPE_CODE_REF)
6145 arg = ada_coerce_ref (arg);
6147 arg = ada_value_ind (arg);
6148 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6149 bit_offset, bit_size,
6153 v = value_at_lazy (field_type, address + byte_offset);
6157 if (v != NULL || no_err)
6160 error (_("There is no member named %s."), name);
6166 error (_("Attempt to extract a component of a value that is not a record."));
6169 /* Given a type TYPE, look up the type of the component of type named NAME.
6170 If DISPP is non-null, add its byte displacement from the beginning of a
6171 structure (pointed to by a value) of type TYPE to *DISPP (does not
6172 work for packed fields).
6174 Matches any field whose name has NAME as a prefix, possibly
6177 TYPE can be either a struct or union. If REFOK, TYPE may also
6178 be a (pointer or reference)+ to a struct or union, and the
6179 ultimate target type will be searched.
6181 Looks recursively into variant clauses and parent types.
6183 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6184 TYPE is not a type of the right kind. */
6186 static struct type *
6187 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6188 int noerr, int *dispp)
6195 if (refok && type != NULL)
6198 type = ada_check_typedef (type);
6199 if (TYPE_CODE (type) != TYPE_CODE_PTR
6200 && TYPE_CODE (type) != TYPE_CODE_REF)
6202 type = TYPE_TARGET_TYPE (type);
6206 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6207 && TYPE_CODE (type) != TYPE_CODE_UNION))
6213 target_terminal_ours ();
6214 gdb_flush (gdb_stdout);
6216 error (_("Type (null) is not a structure or union type"));
6219 /* XXX: type_sprint */
6220 fprintf_unfiltered (gdb_stderr, _("Type "));
6221 type_print (type, "", gdb_stderr, -1);
6222 error (_(" is not a structure or union type"));
6227 type = to_static_fixed_type (type);
6229 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6231 char *t_field_name = TYPE_FIELD_NAME (type, i);
6235 if (t_field_name == NULL)
6238 else if (field_name_match (t_field_name, name))
6241 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
6242 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6245 else if (ada_is_wrapper_field (type, i))
6248 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6253 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6258 else if (ada_is_variant_part (type, i))
6261 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6263 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6265 /* FIXME pnh 2008/01/26: We check for a field that is
6266 NOT wrapped in a struct, since the compiler sometimes
6267 generates these for unchecked variant types. Revisit
6268 if the compiler changes this practice. */
6269 char *v_field_name = TYPE_FIELD_NAME (field_type, j);
6271 if (v_field_name != NULL
6272 && field_name_match (v_field_name, name))
6273 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6275 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
6281 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6292 target_terminal_ours ();
6293 gdb_flush (gdb_stdout);
6296 /* XXX: type_sprint */
6297 fprintf_unfiltered (gdb_stderr, _("Type "));
6298 type_print (type, "", gdb_stderr, -1);
6299 error (_(" has no component named <null>"));
6303 /* XXX: type_sprint */
6304 fprintf_unfiltered (gdb_stderr, _("Type "));
6305 type_print (type, "", gdb_stderr, -1);
6306 error (_(" has no component named %s"), name);
6313 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6314 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6315 represents an unchecked union (that is, the variant part of a
6316 record that is named in an Unchecked_Union pragma). */
6319 is_unchecked_variant (struct type *var_type, struct type *outer_type)
6321 char *discrim_name = ada_variant_discrim_name (var_type);
6322 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6327 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6328 within a value of type OUTER_TYPE that is stored in GDB at
6329 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6330 numbering from 0) is applicable. Returns -1 if none are. */
6333 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
6334 const gdb_byte *outer_valaddr)
6338 char *discrim_name = ada_variant_discrim_name (var_type);
6339 struct value *outer;
6340 struct value *discrim;
6341 LONGEST discrim_val;
6343 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6344 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6345 if (discrim == NULL)
6347 discrim_val = value_as_long (discrim);
6350 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6352 if (ada_is_others_clause (var_type, i))
6354 else if (ada_in_variant (discrim_val, var_type, i))
6358 return others_clause;
6363 /* Dynamic-Sized Records */
6365 /* Strategy: The type ostensibly attached to a value with dynamic size
6366 (i.e., a size that is not statically recorded in the debugging
6367 data) does not accurately reflect the size or layout of the value.
6368 Our strategy is to convert these values to values with accurate,
6369 conventional types that are constructed on the fly. */
6371 /* There is a subtle and tricky problem here. In general, we cannot
6372 determine the size of dynamic records without its data. However,
6373 the 'struct value' data structure, which GDB uses to represent
6374 quantities in the inferior process (the target), requires the size
6375 of the type at the time of its allocation in order to reserve space
6376 for GDB's internal copy of the data. That's why the
6377 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6378 rather than struct value*s.
6380 However, GDB's internal history variables ($1, $2, etc.) are
6381 struct value*s containing internal copies of the data that are not, in
6382 general, the same as the data at their corresponding addresses in
6383 the target. Fortunately, the types we give to these values are all
6384 conventional, fixed-size types (as per the strategy described
6385 above), so that we don't usually have to perform the
6386 'to_fixed_xxx_type' conversions to look at their values.
6387 Unfortunately, there is one exception: if one of the internal
6388 history variables is an array whose elements are unconstrained
6389 records, then we will need to create distinct fixed types for each
6390 element selected. */
6392 /* The upshot of all of this is that many routines take a (type, host
6393 address, target address) triple as arguments to represent a value.
6394 The host address, if non-null, is supposed to contain an internal
6395 copy of the relevant data; otherwise, the program is to consult the
6396 target at the target address. */
6398 /* Assuming that VAL0 represents a pointer value, the result of
6399 dereferencing it. Differs from value_ind in its treatment of
6400 dynamic-sized types. */
6403 ada_value_ind (struct value *val0)
6405 struct value *val = unwrap_value (value_ind (val0));
6406 return ada_to_fixed_value (val);
6409 /* The value resulting from dereferencing any "reference to"
6410 qualifiers on VAL0. */
6412 static struct value *
6413 ada_coerce_ref (struct value *val0)
6415 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
6417 struct value *val = val0;
6418 val = coerce_ref (val);
6419 val = unwrap_value (val);
6420 return ada_to_fixed_value (val);
6426 /* Return OFF rounded upward if necessary to a multiple of
6427 ALIGNMENT (a power of 2). */
6430 align_value (unsigned int off, unsigned int alignment)
6432 return (off + alignment - 1) & ~(alignment - 1);
6435 /* Return the bit alignment required for field #F of template type TYPE. */
6438 field_alignment (struct type *type, int f)
6440 const char *name = TYPE_FIELD_NAME (type, f);
6444 /* The field name should never be null, unless the debugging information
6445 is somehow malformed. In this case, we assume the field does not
6446 require any alignment. */
6450 len = strlen (name);
6452 if (!isdigit (name[len - 1]))
6455 if (isdigit (name[len - 2]))
6456 align_offset = len - 2;
6458 align_offset = len - 1;
6460 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
6461 return TARGET_CHAR_BIT;
6463 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6466 /* Find a symbol named NAME. Ignores ambiguity. */
6469 ada_find_any_symbol (const char *name)
6473 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6474 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6477 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6481 /* Find a type named NAME. Ignores ambiguity. This routine will look
6482 solely for types defined by debug info, it will not search the GDB
6486 ada_find_any_type (const char *name)
6488 struct symbol *sym = ada_find_any_symbol (name);
6491 return SYMBOL_TYPE (sym);
6496 /* Given NAME and an associated BLOCK, search all symbols for
6497 NAME suffixed with "___XR", which is the ``renaming'' symbol
6498 associated to NAME. Return this symbol if found, return
6502 ada_find_renaming_symbol (const char *name, struct block *block)
6506 sym = find_old_style_renaming_symbol (name, block);
6511 /* Not right yet. FIXME pnh 7/20/2007. */
6512 sym = ada_find_any_symbol (name);
6513 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
6519 static struct symbol *
6520 find_old_style_renaming_symbol (const char *name, struct block *block)
6522 const struct symbol *function_sym = block_linkage_function (block);
6525 if (function_sym != NULL)
6527 /* If the symbol is defined inside a function, NAME is not fully
6528 qualified. This means we need to prepend the function name
6529 as well as adding the ``___XR'' suffix to build the name of
6530 the associated renaming symbol. */
6531 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
6532 /* Function names sometimes contain suffixes used
6533 for instance to qualify nested subprograms. When building
6534 the XR type name, we need to make sure that this suffix is
6535 not included. So do not include any suffix in the function
6536 name length below. */
6537 const int function_name_len = ada_name_prefix_len (function_name);
6538 const int rename_len = function_name_len + 2 /* "__" */
6539 + strlen (name) + 6 /* "___XR\0" */ ;
6541 /* Strip the suffix if necessary. */
6542 function_name[function_name_len] = '\0';
6544 /* Library-level functions are a special case, as GNAT adds
6545 a ``_ada_'' prefix to the function name to avoid namespace
6546 pollution. However, the renaming symbols themselves do not
6547 have this prefix, so we need to skip this prefix if present. */
6548 if (function_name_len > 5 /* "_ada_" */
6549 && strstr (function_name, "_ada_") == function_name)
6550 function_name = function_name + 5;
6552 rename = (char *) alloca (rename_len * sizeof (char));
6553 xsnprintf (rename, rename_len * sizeof (char), "%s__%s___XR",
6554 function_name, name);
6558 const int rename_len = strlen (name) + 6;
6559 rename = (char *) alloca (rename_len * sizeof (char));
6560 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
6563 return ada_find_any_symbol (rename);
6566 /* Because of GNAT encoding conventions, several GDB symbols may match a
6567 given type name. If the type denoted by TYPE0 is to be preferred to
6568 that of TYPE1 for purposes of type printing, return non-zero;
6569 otherwise return 0. */
6572 ada_prefer_type (struct type *type0, struct type *type1)
6576 else if (type0 == NULL)
6578 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
6580 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
6582 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
6584 else if (ada_is_packed_array_type (type0))
6586 else if (ada_is_array_descriptor_type (type0)
6587 && !ada_is_array_descriptor_type (type1))
6591 const char *type0_name = type_name_no_tag (type0);
6592 const char *type1_name = type_name_no_tag (type1);
6594 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
6595 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
6601 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6602 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6605 ada_type_name (struct type *type)
6609 else if (TYPE_NAME (type) != NULL)
6610 return TYPE_NAME (type);
6612 return TYPE_TAG_NAME (type);
6615 /* Find a parallel type to TYPE whose name is formed by appending
6616 SUFFIX to the name of TYPE. */
6619 ada_find_parallel_type (struct type *type, const char *suffix)
6622 static size_t name_len = 0;
6624 char *typename = ada_type_name (type);
6626 if (typename == NULL)
6629 len = strlen (typename);
6631 GROW_VECT (name, name_len, len + strlen (suffix) + 1);
6633 strcpy (name, typename);
6634 strcpy (name + len, suffix);
6636 return ada_find_any_type (name);
6640 /* If TYPE is a variable-size record type, return the corresponding template
6641 type describing its fields. Otherwise, return NULL. */
6643 static struct type *
6644 dynamic_template_type (struct type *type)
6646 type = ada_check_typedef (type);
6648 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
6649 || ada_type_name (type) == NULL)
6653 int len = strlen (ada_type_name (type));
6654 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
6657 return ada_find_parallel_type (type, "___XVE");
6661 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6662 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6665 is_dynamic_field (struct type *templ_type, int field_num)
6667 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
6669 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
6670 && strstr (name, "___XVL") != NULL;
6673 /* The index of the variant field of TYPE, or -1 if TYPE does not
6674 represent a variant record type. */
6677 variant_field_index (struct type *type)
6681 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6684 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
6686 if (ada_is_variant_part (type, f))
6692 /* A record type with no fields. */
6694 static struct type *
6695 empty_record (struct objfile *objfile)
6697 struct type *type = alloc_type (objfile);
6698 TYPE_CODE (type) = TYPE_CODE_STRUCT;
6699 TYPE_NFIELDS (type) = 0;
6700 TYPE_FIELDS (type) = NULL;
6701 INIT_CPLUS_SPECIFIC (type);
6702 TYPE_NAME (type) = "<empty>";
6703 TYPE_TAG_NAME (type) = NULL;
6704 TYPE_LENGTH (type) = 0;
6708 /* An ordinary record type (with fixed-length fields) that describes
6709 the value of type TYPE at VALADDR or ADDRESS (see comments at
6710 the beginning of this section) VAL according to GNAT conventions.
6711 DVAL0 should describe the (portion of a) record that contains any
6712 necessary discriminants. It should be NULL if value_type (VAL) is
6713 an outer-level type (i.e., as opposed to a branch of a variant.) A
6714 variant field (unless unchecked) is replaced by a particular branch
6717 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6718 length are not statically known are discarded. As a consequence,
6719 VALADDR, ADDRESS and DVAL0 are ignored.
6721 NOTE: Limitations: For now, we assume that dynamic fields and
6722 variants occupy whole numbers of bytes. However, they need not be
6726 ada_template_to_fixed_record_type_1 (struct type *type,
6727 const gdb_byte *valaddr,
6728 CORE_ADDR address, struct value *dval0,
6729 int keep_dynamic_fields)
6731 struct value *mark = value_mark ();
6734 int nfields, bit_len;
6737 int fld_bit_len, bit_incr;
6740 /* Compute the number of fields in this record type that are going
6741 to be processed: unless keep_dynamic_fields, this includes only
6742 fields whose position and length are static will be processed. */
6743 if (keep_dynamic_fields)
6744 nfields = TYPE_NFIELDS (type);
6748 while (nfields < TYPE_NFIELDS (type)
6749 && !ada_is_variant_part (type, nfields)
6750 && !is_dynamic_field (type, nfields))
6754 rtype = alloc_type (TYPE_OBJFILE (type));
6755 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
6756 INIT_CPLUS_SPECIFIC (rtype);
6757 TYPE_NFIELDS (rtype) = nfields;
6758 TYPE_FIELDS (rtype) = (struct field *)
6759 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6760 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
6761 TYPE_NAME (rtype) = ada_type_name (type);
6762 TYPE_TAG_NAME (rtype) = NULL;
6763 TYPE_FIXED_INSTANCE (rtype) = 1;
6769 for (f = 0; f < nfields; f += 1)
6771 off = align_value (off, field_alignment (type, f))
6772 + TYPE_FIELD_BITPOS (type, f);
6773 TYPE_FIELD_BITPOS (rtype, f) = off;
6774 TYPE_FIELD_BITSIZE (rtype, f) = 0;
6776 if (ada_is_variant_part (type, f))
6779 fld_bit_len = bit_incr = 0;
6781 else if (is_dynamic_field (type, f))
6783 const gdb_byte *field_valaddr = valaddr;
6784 CORE_ADDR field_address = address;
6785 struct type *field_type =
6786 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
6790 /* rtype's length is computed based on the run-time
6791 value of discriminants. If the discriminants are not
6792 initialized, the type size may be completely bogus and
6793 GDB may fail to allocate a value for it. So check the
6794 size first before creating the value. */
6796 dval = value_from_contents_and_address (rtype, valaddr, address);
6801 /* If the type referenced by this field is an aligner type, we need
6802 to unwrap that aligner type, because its size might not be set.
6803 Keeping the aligner type would cause us to compute the wrong
6804 size for this field, impacting the offset of the all the fields
6805 that follow this one. */
6806 if (ada_is_aligner_type (field_type))
6808 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
6810 field_valaddr = cond_offset_host (field_valaddr, field_offset);
6811 field_address = cond_offset_target (field_address, field_offset);
6812 field_type = ada_aligned_type (field_type);
6815 field_valaddr = cond_offset_host (field_valaddr,
6816 off / TARGET_CHAR_BIT);
6817 field_address = cond_offset_target (field_address,
6818 off / TARGET_CHAR_BIT);
6820 /* Get the fixed type of the field. Note that, in this case,
6821 we do not want to get the real type out of the tag: if
6822 the current field is the parent part of a tagged record,
6823 we will get the tag of the object. Clearly wrong: the real
6824 type of the parent is not the real type of the child. We
6825 would end up in an infinite loop. */
6826 field_type = ada_get_base_type (field_type);
6827 field_type = ada_to_fixed_type (field_type, field_valaddr,
6828 field_address, dval, 0);
6830 TYPE_FIELD_TYPE (rtype, f) = field_type;
6831 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6832 bit_incr = fld_bit_len =
6833 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
6837 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
6838 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6839 if (TYPE_FIELD_BITSIZE (type, f) > 0)
6840 bit_incr = fld_bit_len =
6841 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
6843 bit_incr = fld_bit_len =
6844 TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
6846 if (off + fld_bit_len > bit_len)
6847 bit_len = off + fld_bit_len;
6849 TYPE_LENGTH (rtype) =
6850 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6853 /* We handle the variant part, if any, at the end because of certain
6854 odd cases in which it is re-ordered so as NOT to be the last field of
6855 the record. This can happen in the presence of representation
6857 if (variant_field >= 0)
6859 struct type *branch_type;
6861 off = TYPE_FIELD_BITPOS (rtype, variant_field);
6864 dval = value_from_contents_and_address (rtype, valaddr, address);
6869 to_fixed_variant_branch_type
6870 (TYPE_FIELD_TYPE (type, variant_field),
6871 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6872 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
6873 if (branch_type == NULL)
6875 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
6876 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
6877 TYPE_NFIELDS (rtype) -= 1;
6881 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6882 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6884 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
6886 if (off + fld_bit_len > bit_len)
6887 bit_len = off + fld_bit_len;
6888 TYPE_LENGTH (rtype) =
6889 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6893 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6894 should contain the alignment of that record, which should be a strictly
6895 positive value. If null or negative, then something is wrong, most
6896 probably in the debug info. In that case, we don't round up the size
6897 of the resulting type. If this record is not part of another structure,
6898 the current RTYPE length might be good enough for our purposes. */
6899 if (TYPE_LENGTH (type) <= 0)
6901 if (TYPE_NAME (rtype))
6902 warning (_("Invalid type size for `%s' detected: %d."),
6903 TYPE_NAME (rtype), TYPE_LENGTH (type));
6905 warning (_("Invalid type size for <unnamed> detected: %d."),
6906 TYPE_LENGTH (type));
6910 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
6911 TYPE_LENGTH (type));
6914 value_free_to_mark (mark);
6915 if (TYPE_LENGTH (rtype) > varsize_limit)
6916 error (_("record type with dynamic size is larger than varsize-limit"));
6920 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6923 static struct type *
6924 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
6925 CORE_ADDR address, struct value *dval0)
6927 return ada_template_to_fixed_record_type_1 (type, valaddr,
6931 /* An ordinary record type in which ___XVL-convention fields and
6932 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6933 static approximations, containing all possible fields. Uses
6934 no runtime values. Useless for use in values, but that's OK,
6935 since the results are used only for type determinations. Works on both
6936 structs and unions. Representation note: to save space, we memorize
6937 the result of this function in the TYPE_TARGET_TYPE of the
6940 static struct type *
6941 template_to_static_fixed_type (struct type *type0)
6947 if (TYPE_TARGET_TYPE (type0) != NULL)
6948 return TYPE_TARGET_TYPE (type0);
6950 nfields = TYPE_NFIELDS (type0);
6953 for (f = 0; f < nfields; f += 1)
6955 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
6956 struct type *new_type;
6958 if (is_dynamic_field (type0, f))
6959 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
6961 new_type = static_unwrap_type (field_type);
6962 if (type == type0 && new_type != field_type)
6964 TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
6965 TYPE_CODE (type) = TYPE_CODE (type0);
6966 INIT_CPLUS_SPECIFIC (type);
6967 TYPE_NFIELDS (type) = nfields;
6968 TYPE_FIELDS (type) = (struct field *)
6969 TYPE_ALLOC (type, nfields * sizeof (struct field));
6970 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
6971 sizeof (struct field) * nfields);
6972 TYPE_NAME (type) = ada_type_name (type0);
6973 TYPE_TAG_NAME (type) = NULL;
6974 TYPE_FIXED_INSTANCE (type) = 1;
6975 TYPE_LENGTH (type) = 0;
6977 TYPE_FIELD_TYPE (type, f) = new_type;
6978 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
6983 /* Given an object of type TYPE whose contents are at VALADDR and
6984 whose address in memory is ADDRESS, returns a revision of TYPE,
6985 which should be a non-dynamic-sized record, in which the variant
6986 part, if any, is replaced with the appropriate branch. Looks
6987 for discriminant values in DVAL0, which can be NULL if the record
6988 contains the necessary discriminant values. */
6990 static struct type *
6991 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
6992 CORE_ADDR address, struct value *dval0)
6994 struct value *mark = value_mark ();
6997 struct type *branch_type;
6998 int nfields = TYPE_NFIELDS (type);
6999 int variant_field = variant_field_index (type);
7001 if (variant_field == -1)
7005 dval = value_from_contents_and_address (type, valaddr, address);
7009 rtype = alloc_type (TYPE_OBJFILE (type));
7010 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7011 INIT_CPLUS_SPECIFIC (rtype);
7012 TYPE_NFIELDS (rtype) = nfields;
7013 TYPE_FIELDS (rtype) =
7014 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7015 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7016 sizeof (struct field) * nfields);
7017 TYPE_NAME (rtype) = ada_type_name (type);
7018 TYPE_TAG_NAME (rtype) = NULL;
7019 TYPE_FIXED_INSTANCE (rtype) = 1;
7020 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7022 branch_type = to_fixed_variant_branch_type
7023 (TYPE_FIELD_TYPE (type, variant_field),
7024 cond_offset_host (valaddr,
7025 TYPE_FIELD_BITPOS (type, variant_field)
7027 cond_offset_target (address,
7028 TYPE_FIELD_BITPOS (type, variant_field)
7029 / TARGET_CHAR_BIT), dval);
7030 if (branch_type == NULL)
7033 for (f = variant_field + 1; f < nfields; f += 1)
7034 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7035 TYPE_NFIELDS (rtype) -= 1;
7039 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7040 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7041 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7042 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7044 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7046 value_free_to_mark (mark);
7050 /* An ordinary record type (with fixed-length fields) that describes
7051 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7052 beginning of this section]. Any necessary discriminants' values
7053 should be in DVAL, a record value; it may be NULL if the object
7054 at ADDR itself contains any necessary discriminant values.
7055 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7056 values from the record are needed. Except in the case that DVAL,
7057 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7058 unchecked) is replaced by a particular branch of the variant.
7060 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7061 is questionable and may be removed. It can arise during the
7062 processing of an unconstrained-array-of-record type where all the
7063 variant branches have exactly the same size. This is because in
7064 such cases, the compiler does not bother to use the XVS convention
7065 when encoding the record. I am currently dubious of this
7066 shortcut and suspect the compiler should be altered. FIXME. */
7068 static struct type *
7069 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7070 CORE_ADDR address, struct value *dval)
7072 struct type *templ_type;
7074 if (TYPE_FIXED_INSTANCE (type0))
7077 templ_type = dynamic_template_type (type0);
7079 if (templ_type != NULL)
7080 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
7081 else if (variant_field_index (type0) >= 0)
7083 if (dval == NULL && valaddr == NULL && address == 0)
7085 return to_record_with_fixed_variant_part (type0, valaddr, address,
7090 TYPE_FIXED_INSTANCE (type0) = 1;
7096 /* An ordinary record type (with fixed-length fields) that describes
7097 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7098 union type. Any necessary discriminants' values should be in DVAL,
7099 a record value. That is, this routine selects the appropriate
7100 branch of the union at ADDR according to the discriminant value
7101 indicated in the union's type name. Returns VAR_TYPE0 itself if
7102 it represents a variant subject to a pragma Unchecked_Union. */
7104 static struct type *
7105 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
7106 CORE_ADDR address, struct value *dval)
7109 struct type *templ_type;
7110 struct type *var_type;
7112 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7113 var_type = TYPE_TARGET_TYPE (var_type0);
7115 var_type = var_type0;
7117 templ_type = ada_find_parallel_type (var_type, "___XVU");
7119 if (templ_type != NULL)
7120 var_type = templ_type;
7122 if (is_unchecked_variant (var_type, value_type (dval)))
7125 ada_which_variant_applies (var_type,
7126 value_type (dval), value_contents (dval));
7129 return empty_record (TYPE_OBJFILE (var_type));
7130 else if (is_dynamic_field (var_type, which))
7131 return to_fixed_record_type
7132 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7133 valaddr, address, dval);
7134 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
7136 to_fixed_record_type
7137 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
7139 return TYPE_FIELD_TYPE (var_type, which);
7142 /* Assuming that TYPE0 is an array type describing the type of a value
7143 at ADDR, and that DVAL describes a record containing any
7144 discriminants used in TYPE0, returns a type for the value that
7145 contains no dynamic components (that is, no components whose sizes
7146 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7147 true, gives an error message if the resulting type's size is over
7150 static struct type *
7151 to_fixed_array_type (struct type *type0, struct value *dval,
7154 struct type *index_type_desc;
7155 struct type *result;
7158 if (TYPE_FIXED_INSTANCE (type0))
7161 packed_array_p = ada_is_packed_array_type (type0);
7163 type0 = decode_packed_array_type (type0);
7165 index_type_desc = ada_find_parallel_type (type0, "___XA");
7166 if (index_type_desc == NULL)
7168 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
7169 /* NOTE: elt_type---the fixed version of elt_type0---should never
7170 depend on the contents of the array in properly constructed
7172 /* Create a fixed version of the array element type.
7173 We're not providing the address of an element here,
7174 and thus the actual object value cannot be inspected to do
7175 the conversion. This should not be a problem, since arrays of
7176 unconstrained objects are not allowed. In particular, all
7177 the elements of an array of a tagged type should all be of
7178 the same type specified in the debugging info. No need to
7179 consult the object tag. */
7180 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
7182 /* Make sure we always create a new array type when dealing with
7183 packed array types, since we're going to fix-up the array
7184 type length and element bitsize a little further down. */
7185 if (elt_type0 == elt_type && !packed_array_p)
7188 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7189 elt_type, TYPE_INDEX_TYPE (type0));
7194 struct type *elt_type0;
7197 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
7198 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7200 /* NOTE: result---the fixed version of elt_type0---should never
7201 depend on the contents of the array in properly constructed
7203 /* Create a fixed version of the array element type.
7204 We're not providing the address of an element here,
7205 and thus the actual object value cannot be inspected to do
7206 the conversion. This should not be a problem, since arrays of
7207 unconstrained objects are not allowed. In particular, all
7208 the elements of an array of a tagged type should all be of
7209 the same type specified in the debugging info. No need to
7210 consult the object tag. */
7212 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
7213 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
7215 struct type *range_type =
7216 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
7217 dval, TYPE_OBJFILE (type0));
7218 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7219 result, range_type);
7221 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
7222 error (_("array type with dynamic size is larger than varsize-limit"));
7227 /* So far, the resulting type has been created as if the original
7228 type was a regular (non-packed) array type. As a result, the
7229 bitsize of the array elements needs to be set again, and the array
7230 length needs to be recomputed based on that bitsize. */
7231 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
7232 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
7234 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
7235 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
7236 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
7237 TYPE_LENGTH (result)++;
7240 TYPE_FIXED_INSTANCE (result) = 1;
7245 /* A standard type (containing no dynamically sized components)
7246 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7247 DVAL describes a record containing any discriminants used in TYPE0,
7248 and may be NULL if there are none, or if the object of type TYPE at
7249 ADDRESS or in VALADDR contains these discriminants.
7251 If CHECK_TAG is not null, in the case of tagged types, this function
7252 attempts to locate the object's tag and use it to compute the actual
7253 type. However, when ADDRESS is null, we cannot use it to determine the
7254 location of the tag, and therefore compute the tagged type's actual type.
7255 So we return the tagged type without consulting the tag. */
7257 static struct type *
7258 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
7259 CORE_ADDR address, struct value *dval, int check_tag)
7261 type = ada_check_typedef (type);
7262 switch (TYPE_CODE (type))
7266 case TYPE_CODE_STRUCT:
7268 struct type *static_type = to_static_fixed_type (type);
7269 struct type *fixed_record_type =
7270 to_fixed_record_type (type, valaddr, address, NULL);
7271 /* If STATIC_TYPE is a tagged type and we know the object's address,
7272 then we can determine its tag, and compute the object's actual
7273 type from there. Note that we have to use the fixed record
7274 type (the parent part of the record may have dynamic fields
7275 and the way the location of _tag is expressed may depend on
7278 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
7280 struct type *real_type =
7281 type_from_tag (value_tag_from_contents_and_address
7285 if (real_type != NULL)
7286 return to_fixed_record_type (real_type, valaddr, address, NULL);
7289 /* Check to see if there is a parallel ___XVZ variable.
7290 If there is, then it provides the actual size of our type. */
7291 else if (ada_type_name (fixed_record_type) != NULL)
7293 char *name = ada_type_name (fixed_record_type);
7294 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
7298 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
7299 size = get_int_var_value (xvz_name, &xvz_found);
7300 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
7302 fixed_record_type = copy_type (fixed_record_type);
7303 TYPE_LENGTH (fixed_record_type) = size;
7305 /* The FIXED_RECORD_TYPE may have be a stub. We have
7306 observed this when the debugging info is STABS, and
7307 apparently it is something that is hard to fix.
7309 In practice, we don't need the actual type definition
7310 at all, because the presence of the XVZ variable allows us
7311 to assume that there must be a XVS type as well, which we
7312 should be able to use later, when we need the actual type
7315 In the meantime, pretend that the "fixed" type we are
7316 returning is NOT a stub, because this can cause trouble
7317 when using this type to create new types targeting it.
7318 Indeed, the associated creation routines often check
7319 whether the target type is a stub and will try to replace
7320 it, thus using a type with the wrong size. This, in turn,
7321 might cause the new type to have the wrong size too.
7322 Consider the case of an array, for instance, where the size
7323 of the array is computed from the number of elements in
7324 our array multiplied by the size of its element. */
7325 TYPE_STUB (fixed_record_type) = 0;
7328 return fixed_record_type;
7330 case TYPE_CODE_ARRAY:
7331 return to_fixed_array_type (type, dval, 1);
7332 case TYPE_CODE_UNION:
7336 return to_fixed_variant_branch_type (type, valaddr, address, dval);
7340 /* The same as ada_to_fixed_type_1, except that it preserves the type
7341 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7342 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7345 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7346 CORE_ADDR address, struct value *dval, int check_tag)
7349 struct type *fixed_type =
7350 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7352 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7353 && TYPE_TARGET_TYPE (type) == fixed_type)
7359 /* A standard (static-sized) type corresponding as well as possible to
7360 TYPE0, but based on no runtime data. */
7362 static struct type *
7363 to_static_fixed_type (struct type *type0)
7370 if (TYPE_FIXED_INSTANCE (type0))
7373 type0 = ada_check_typedef (type0);
7375 switch (TYPE_CODE (type0))
7379 case TYPE_CODE_STRUCT:
7380 type = dynamic_template_type (type0);
7382 return template_to_static_fixed_type (type);
7384 return template_to_static_fixed_type (type0);
7385 case TYPE_CODE_UNION:
7386 type = ada_find_parallel_type (type0, "___XVU");
7388 return template_to_static_fixed_type (type);
7390 return template_to_static_fixed_type (type0);
7394 /* A static approximation of TYPE with all type wrappers removed. */
7396 static struct type *
7397 static_unwrap_type (struct type *type)
7399 if (ada_is_aligner_type (type))
7401 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
7402 if (ada_type_name (type1) == NULL)
7403 TYPE_NAME (type1) = ada_type_name (type);
7405 return static_unwrap_type (type1);
7409 struct type *raw_real_type = ada_get_base_type (type);
7410 if (raw_real_type == type)
7413 return to_static_fixed_type (raw_real_type);
7417 /* In some cases, incomplete and private types require
7418 cross-references that are not resolved as records (for example,
7420 type FooP is access Foo;
7422 type Foo is array ...;
7423 ). In these cases, since there is no mechanism for producing
7424 cross-references to such types, we instead substitute for FooP a
7425 stub enumeration type that is nowhere resolved, and whose tag is
7426 the name of the actual type. Call these types "non-record stubs". */
7428 /* A type equivalent to TYPE that is not a non-record stub, if one
7429 exists, otherwise TYPE. */
7432 ada_check_typedef (struct type *type)
7437 CHECK_TYPEDEF (type);
7438 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
7439 || !TYPE_STUB (type)
7440 || TYPE_TAG_NAME (type) == NULL)
7444 char *name = TYPE_TAG_NAME (type);
7445 struct type *type1 = ada_find_any_type (name);
7446 return (type1 == NULL) ? type : type1;
7450 /* A value representing the data at VALADDR/ADDRESS as described by
7451 type TYPE0, but with a standard (static-sized) type that correctly
7452 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7453 type, then return VAL0 [this feature is simply to avoid redundant
7454 creation of struct values]. */
7456 static struct value *
7457 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
7460 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
7461 if (type == type0 && val0 != NULL)
7464 return value_from_contents_and_address (type, 0, address);
7467 /* A value representing VAL, but with a standard (static-sized) type
7468 that correctly describes it. Does not necessarily create a new
7471 static struct value *
7472 ada_to_fixed_value (struct value *val)
7474 return ada_to_fixed_value_create (value_type (val),
7475 value_address (val),
7479 /* A value representing VAL, but with a standard (static-sized) type
7480 chosen to approximate the real type of VAL as well as possible, but
7481 without consulting any runtime values. For Ada dynamic-sized
7482 types, therefore, the type of the result is likely to be inaccurate. */
7484 static struct value *
7485 ada_to_static_fixed_value (struct value *val)
7488 to_static_fixed_type (static_unwrap_type (value_type (val)));
7489 if (type == value_type (val))
7492 return coerce_unspec_val_to_type (val, type);
7498 /* Table mapping attribute numbers to names.
7499 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7501 static const char *attribute_names[] = {
7519 ada_attribute_name (enum exp_opcode n)
7521 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
7522 return attribute_names[n - OP_ATR_FIRST + 1];
7524 return attribute_names[0];
7527 /* Evaluate the 'POS attribute applied to ARG. */
7530 pos_atr (struct value *arg)
7532 struct value *val = coerce_ref (arg);
7533 struct type *type = value_type (val);
7535 if (!discrete_type_p (type))
7536 error (_("'POS only defined on discrete types"));
7538 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7541 LONGEST v = value_as_long (val);
7543 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7545 if (v == TYPE_FIELD_BITPOS (type, i))
7548 error (_("enumeration value is invalid: can't find 'POS"));
7551 return value_as_long (val);
7554 static struct value *
7555 value_pos_atr (struct type *type, struct value *arg)
7557 return value_from_longest (type, pos_atr (arg));
7560 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7562 static struct value *
7563 value_val_atr (struct type *type, struct value *arg)
7565 if (!discrete_type_p (type))
7566 error (_("'VAL only defined on discrete types"));
7567 if (!integer_type_p (value_type (arg)))
7568 error (_("'VAL requires integral argument"));
7570 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7572 long pos = value_as_long (arg);
7573 if (pos < 0 || pos >= TYPE_NFIELDS (type))
7574 error (_("argument to 'VAL out of range"));
7575 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
7578 return value_from_longest (type, value_as_long (arg));
7584 /* True if TYPE appears to be an Ada character type.
7585 [At the moment, this is true only for Character and Wide_Character;
7586 It is a heuristic test that could stand improvement]. */
7589 ada_is_character_type (struct type *type)
7593 /* If the type code says it's a character, then assume it really is,
7594 and don't check any further. */
7595 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
7598 /* Otherwise, assume it's a character type iff it is a discrete type
7599 with a known character type name. */
7600 name = ada_type_name (type);
7601 return (name != NULL
7602 && (TYPE_CODE (type) == TYPE_CODE_INT
7603 || TYPE_CODE (type) == TYPE_CODE_RANGE)
7604 && (strcmp (name, "character") == 0
7605 || strcmp (name, "wide_character") == 0
7606 || strcmp (name, "wide_wide_character") == 0
7607 || strcmp (name, "unsigned char") == 0));
7610 /* True if TYPE appears to be an Ada string type. */
7613 ada_is_string_type (struct type *type)
7615 type = ada_check_typedef (type);
7617 && TYPE_CODE (type) != TYPE_CODE_PTR
7618 && (ada_is_simple_array_type (type)
7619 || ada_is_array_descriptor_type (type))
7620 && ada_array_arity (type) == 1)
7622 struct type *elttype = ada_array_element_type (type, 1);
7624 return ada_is_character_type (elttype);
7631 /* True if TYPE is a struct type introduced by the compiler to force the
7632 alignment of a value. Such types have a single field with a
7633 distinctive name. */
7636 ada_is_aligner_type (struct type *type)
7638 type = ada_check_typedef (type);
7640 /* If we can find a parallel XVS type, then the XVS type should
7641 be used instead of this type. And hence, this is not an aligner
7643 if (ada_find_parallel_type (type, "___XVS") != NULL)
7646 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
7647 && TYPE_NFIELDS (type) == 1
7648 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
7651 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7652 the parallel type. */
7655 ada_get_base_type (struct type *raw_type)
7657 struct type *real_type_namer;
7658 struct type *raw_real_type;
7660 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
7663 if (ada_is_aligner_type (raw_type))
7664 /* The encoding specifies that we should always use the aligner type.
7665 So, even if this aligner type has an associated XVS type, we should
7668 According to the compiler gurus, an XVS type parallel to an aligner
7669 type may exist because of a stabs limitation. In stabs, aligner
7670 types are empty because the field has a variable-sized type, and
7671 thus cannot actually be used as an aligner type. As a result,
7672 we need the associated parallel XVS type to decode the type.
7673 Since the policy in the compiler is to not change the internal
7674 representation based on the debugging info format, we sometimes
7675 end up having a redundant XVS type parallel to the aligner type. */
7678 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
7679 if (real_type_namer == NULL
7680 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
7681 || TYPE_NFIELDS (real_type_namer) != 1)
7684 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
7685 if (raw_real_type == NULL)
7688 return raw_real_type;
7691 /* The type of value designated by TYPE, with all aligners removed. */
7694 ada_aligned_type (struct type *type)
7696 if (ada_is_aligner_type (type))
7697 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
7699 return ada_get_base_type (type);
7703 /* The address of the aligned value in an object at address VALADDR
7704 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7707 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
7709 if (ada_is_aligner_type (type))
7710 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
7712 TYPE_FIELD_BITPOS (type,
7713 0) / TARGET_CHAR_BIT);
7720 /* The printed representation of an enumeration literal with encoded
7721 name NAME. The value is good to the next call of ada_enum_name. */
7723 ada_enum_name (const char *name)
7725 static char *result;
7726 static size_t result_len = 0;
7729 /* First, unqualify the enumeration name:
7730 1. Search for the last '.' character. If we find one, then skip
7731 all the preceeding characters, the unqualified name starts
7732 right after that dot.
7733 2. Otherwise, we may be debugging on a target where the compiler
7734 translates dots into "__". Search forward for double underscores,
7735 but stop searching when we hit an overloading suffix, which is
7736 of the form "__" followed by digits. */
7738 tmp = strrchr (name, '.');
7743 while ((tmp = strstr (name, "__")) != NULL)
7745 if (isdigit (tmp[2]))
7755 if (name[1] == 'U' || name[1] == 'W')
7757 if (sscanf (name + 2, "%x", &v) != 1)
7763 GROW_VECT (result, result_len, 16);
7764 if (isascii (v) && isprint (v))
7765 xsnprintf (result, result_len, "'%c'", v);
7766 else if (name[1] == 'U')
7767 xsnprintf (result, result_len, "[\"%02x\"]", v);
7769 xsnprintf (result, result_len, "[\"%04x\"]", v);
7775 tmp = strstr (name, "__");
7777 tmp = strstr (name, "$");
7780 GROW_VECT (result, result_len, tmp - name + 1);
7781 strncpy (result, name, tmp - name);
7782 result[tmp - name] = '\0';
7790 /* Evaluate the subexpression of EXP starting at *POS as for
7791 evaluate_type, updating *POS to point just past the evaluated
7794 static struct value *
7795 evaluate_subexp_type (struct expression *exp, int *pos)
7797 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
7800 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7803 static struct value *
7804 unwrap_value (struct value *val)
7806 struct type *type = ada_check_typedef (value_type (val));
7807 if (ada_is_aligner_type (type))
7809 struct value *v = ada_value_struct_elt (val, "F", 0);
7810 struct type *val_type = ada_check_typedef (value_type (v));
7811 if (ada_type_name (val_type) == NULL)
7812 TYPE_NAME (val_type) = ada_type_name (type);
7814 return unwrap_value (v);
7818 struct type *raw_real_type =
7819 ada_check_typedef (ada_get_base_type (type));
7821 if (type == raw_real_type)
7825 coerce_unspec_val_to_type
7826 (val, ada_to_fixed_type (raw_real_type, 0,
7827 value_address (val),
7832 static struct value *
7833 cast_to_fixed (struct type *type, struct value *arg)
7837 if (type == value_type (arg))
7839 else if (ada_is_fixed_point_type (value_type (arg)))
7840 val = ada_float_to_fixed (type,
7841 ada_fixed_to_float (value_type (arg),
7842 value_as_long (arg)));
7845 DOUBLEST argd = value_as_double (arg);
7846 val = ada_float_to_fixed (type, argd);
7849 return value_from_longest (type, val);
7852 static struct value *
7853 cast_from_fixed (struct type *type, struct value *arg)
7855 DOUBLEST val = ada_fixed_to_float (value_type (arg),
7856 value_as_long (arg));
7857 return value_from_double (type, val);
7860 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7861 return the converted value. */
7863 static struct value *
7864 coerce_for_assign (struct type *type, struct value *val)
7866 struct type *type2 = value_type (val);
7870 type2 = ada_check_typedef (type2);
7871 type = ada_check_typedef (type);
7873 if (TYPE_CODE (type2) == TYPE_CODE_PTR
7874 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7876 val = ada_value_ind (val);
7877 type2 = value_type (val);
7880 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
7881 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7883 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
7884 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
7885 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
7886 error (_("Incompatible types in assignment"));
7887 deprecated_set_value_type (val, type);
7892 static struct value *
7893 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
7896 struct type *type1, *type2;
7899 arg1 = coerce_ref (arg1);
7900 arg2 = coerce_ref (arg2);
7901 type1 = base_type (ada_check_typedef (value_type (arg1)));
7902 type2 = base_type (ada_check_typedef (value_type (arg2)));
7904 if (TYPE_CODE (type1) != TYPE_CODE_INT
7905 || TYPE_CODE (type2) != TYPE_CODE_INT)
7906 return value_binop (arg1, arg2, op);
7915 return value_binop (arg1, arg2, op);
7918 v2 = value_as_long (arg2);
7920 error (_("second operand of %s must not be zero."), op_string (op));
7922 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
7923 return value_binop (arg1, arg2, op);
7925 v1 = value_as_long (arg1);
7930 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
7931 v += v > 0 ? -1 : 1;
7939 /* Should not reach this point. */
7943 val = allocate_value (type1);
7944 store_unsigned_integer (value_contents_raw (val),
7945 TYPE_LENGTH (value_type (val)), v);
7950 ada_value_equal (struct value *arg1, struct value *arg2)
7952 if (ada_is_direct_array_type (value_type (arg1))
7953 || ada_is_direct_array_type (value_type (arg2)))
7955 /* Automatically dereference any array reference before
7956 we attempt to perform the comparison. */
7957 arg1 = ada_coerce_ref (arg1);
7958 arg2 = ada_coerce_ref (arg2);
7960 arg1 = ada_coerce_to_simple_array (arg1);
7961 arg2 = ada_coerce_to_simple_array (arg2);
7962 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
7963 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
7964 error (_("Attempt to compare array with non-array"));
7965 /* FIXME: The following works only for types whose
7966 representations use all bits (no padding or undefined bits)
7967 and do not have user-defined equality. */
7969 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
7970 && memcmp (value_contents (arg1), value_contents (arg2),
7971 TYPE_LENGTH (value_type (arg1))) == 0;
7973 return value_equal (arg1, arg2);
7976 /* Total number of component associations in the aggregate starting at
7977 index PC in EXP. Assumes that index PC is the start of an
7981 num_component_specs (struct expression *exp, int pc)
7984 m = exp->elts[pc + 1].longconst;
7987 for (i = 0; i < m; i += 1)
7989 switch (exp->elts[pc].opcode)
7995 n += exp->elts[pc + 1].longconst;
7998 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8003 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8004 component of LHS (a simple array or a record), updating *POS past
8005 the expression, assuming that LHS is contained in CONTAINER. Does
8006 not modify the inferior's memory, nor does it modify LHS (unless
8007 LHS == CONTAINER). */
8010 assign_component (struct value *container, struct value *lhs, LONGEST index,
8011 struct expression *exp, int *pos)
8013 struct value *mark = value_mark ();
8015 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8017 struct value *index_val = value_from_longest (builtin_type_int32, index);
8018 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8022 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
8023 elt = ada_to_fixed_value (unwrap_value (elt));
8026 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8027 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8029 value_assign_to_component (container, elt,
8030 ada_evaluate_subexp (NULL, exp, pos,
8033 value_free_to_mark (mark);
8036 /* Assuming that LHS represents an lvalue having a record or array
8037 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8038 of that aggregate's value to LHS, advancing *POS past the
8039 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8040 lvalue containing LHS (possibly LHS itself). Does not modify
8041 the inferior's memory, nor does it modify the contents of
8042 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8044 static struct value *
8045 assign_aggregate (struct value *container,
8046 struct value *lhs, struct expression *exp,
8047 int *pos, enum noside noside)
8049 struct type *lhs_type;
8050 int n = exp->elts[*pos+1].longconst;
8051 LONGEST low_index, high_index;
8054 int max_indices, num_indices;
8055 int is_array_aggregate;
8057 struct value *mark = value_mark ();
8060 if (noside != EVAL_NORMAL)
8063 for (i = 0; i < n; i += 1)
8064 ada_evaluate_subexp (NULL, exp, pos, noside);
8068 container = ada_coerce_ref (container);
8069 if (ada_is_direct_array_type (value_type (container)))
8070 container = ada_coerce_to_simple_array (container);
8071 lhs = ada_coerce_ref (lhs);
8072 if (!deprecated_value_modifiable (lhs))
8073 error (_("Left operand of assignment is not a modifiable lvalue."));
8075 lhs_type = value_type (lhs);
8076 if (ada_is_direct_array_type (lhs_type))
8078 lhs = ada_coerce_to_simple_array (lhs);
8079 lhs_type = value_type (lhs);
8080 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8081 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8082 is_array_aggregate = 1;
8084 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8087 high_index = num_visible_fields (lhs_type) - 1;
8088 is_array_aggregate = 0;
8091 error (_("Left-hand side must be array or record."));
8093 num_specs = num_component_specs (exp, *pos - 3);
8094 max_indices = 4 * num_specs + 4;
8095 indices = alloca (max_indices * sizeof (indices[0]));
8096 indices[0] = indices[1] = low_index - 1;
8097 indices[2] = indices[3] = high_index + 1;
8100 for (i = 0; i < n; i += 1)
8102 switch (exp->elts[*pos].opcode)
8105 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8106 &num_indices, max_indices,
8107 low_index, high_index);
8110 aggregate_assign_positional (container, lhs, exp, pos, indices,
8111 &num_indices, max_indices,
8112 low_index, high_index);
8116 error (_("Misplaced 'others' clause"));
8117 aggregate_assign_others (container, lhs, exp, pos, indices,
8118 num_indices, low_index, high_index);
8121 error (_("Internal error: bad aggregate clause"));
8128 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8129 construct at *POS, updating *POS past the construct, given that
8130 the positions are relative to lower bound LOW, where HIGH is the
8131 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8132 updating *NUM_INDICES as needed. CONTAINER is as for
8133 assign_aggregate. */
8135 aggregate_assign_positional (struct value *container,
8136 struct value *lhs, struct expression *exp,
8137 int *pos, LONGEST *indices, int *num_indices,
8138 int max_indices, LONGEST low, LONGEST high)
8140 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8142 if (ind - 1 == high)
8143 warning (_("Extra components in aggregate ignored."));
8146 add_component_interval (ind, ind, indices, num_indices, max_indices);
8148 assign_component (container, lhs, ind, exp, pos);
8151 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8154 /* Assign into the components of LHS indexed by the OP_CHOICES
8155 construct at *POS, updating *POS past the construct, given that
8156 the allowable indices are LOW..HIGH. Record the indices assigned
8157 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8158 needed. CONTAINER is as for assign_aggregate. */
8160 aggregate_assign_from_choices (struct value *container,
8161 struct value *lhs, struct expression *exp,
8162 int *pos, LONGEST *indices, int *num_indices,
8163 int max_indices, LONGEST low, LONGEST high)
8166 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
8167 int choice_pos, expr_pc;
8168 int is_array = ada_is_direct_array_type (value_type (lhs));
8170 choice_pos = *pos += 3;
8172 for (j = 0; j < n_choices; j += 1)
8173 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8175 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8177 for (j = 0; j < n_choices; j += 1)
8179 LONGEST lower, upper;
8180 enum exp_opcode op = exp->elts[choice_pos].opcode;
8181 if (op == OP_DISCRETE_RANGE)
8184 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8186 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8191 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8202 name = &exp->elts[choice_pos + 2].string;
8205 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8208 error (_("Invalid record component association."));
8210 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8212 if (! find_struct_field (name, value_type (lhs), 0,
8213 NULL, NULL, NULL, NULL, &ind))
8214 error (_("Unknown component name: %s."), name);
8215 lower = upper = ind;
8218 if (lower <= upper && (lower < low || upper > high))
8219 error (_("Index in component association out of bounds."));
8221 add_component_interval (lower, upper, indices, num_indices,
8223 while (lower <= upper)
8227 assign_component (container, lhs, lower, exp, &pos1);
8233 /* Assign the value of the expression in the OP_OTHERS construct in
8234 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8235 have not been previously assigned. The index intervals already assigned
8236 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8237 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8239 aggregate_assign_others (struct value *container,
8240 struct value *lhs, struct expression *exp,
8241 int *pos, LONGEST *indices, int num_indices,
8242 LONGEST low, LONGEST high)
8245 int expr_pc = *pos+1;
8247 for (i = 0; i < num_indices - 2; i += 2)
8250 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8254 assign_component (container, lhs, ind, exp, &pos);
8257 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8260 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8261 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8262 modifying *SIZE as needed. It is an error if *SIZE exceeds
8263 MAX_SIZE. The resulting intervals do not overlap. */
8265 add_component_interval (LONGEST low, LONGEST high,
8266 LONGEST* indices, int *size, int max_size)
8269 for (i = 0; i < *size; i += 2) {
8270 if (high >= indices[i] && low <= indices[i + 1])
8273 for (kh = i + 2; kh < *size; kh += 2)
8274 if (high < indices[kh])
8276 if (low < indices[i])
8278 indices[i + 1] = indices[kh - 1];
8279 if (high > indices[i + 1])
8280 indices[i + 1] = high;
8281 memcpy (indices + i + 2, indices + kh, *size - kh);
8282 *size -= kh - i - 2;
8285 else if (high < indices[i])
8289 if (*size == max_size)
8290 error (_("Internal error: miscounted aggregate components."));
8292 for (j = *size-1; j >= i+2; j -= 1)
8293 indices[j] = indices[j - 2];
8295 indices[i + 1] = high;
8298 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8301 static struct value *
8302 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8304 if (type == ada_check_typedef (value_type (arg2)))
8307 if (ada_is_fixed_point_type (type))
8308 return (cast_to_fixed (type, arg2));
8310 if (ada_is_fixed_point_type (value_type (arg2)))
8311 return cast_from_fixed (type, arg2);
8313 return value_cast (type, arg2);
8316 /* Evaluating Ada expressions, and printing their result.
8317 ------------------------------------------------------
8319 We usually evaluate an Ada expression in order to print its value.
8320 We also evaluate an expression in order to print its type, which
8321 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8322 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8323 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8324 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8327 Evaluating expressions is a little more complicated for Ada entities
8328 than it is for entities in languages such as C. The main reason for
8329 this is that Ada provides types whose definition might be dynamic.
8330 One example of such types is variant records. Or another example
8331 would be an array whose bounds can only be known at run time.
8333 The following description is a general guide as to what should be
8334 done (and what should NOT be done) in order to evaluate an expression
8335 involving such types, and when. This does not cover how the semantic
8336 information is encoded by GNAT as this is covered separatly. For the
8337 document used as the reference for the GNAT encoding, see exp_dbug.ads
8338 in the GNAT sources.
8340 Ideally, we should embed each part of this description next to its
8341 associated code. Unfortunately, the amount of code is so vast right
8342 now that it's hard to see whether the code handling a particular
8343 situation might be duplicated or not. One day, when the code is
8344 cleaned up, this guide might become redundant with the comments
8345 inserted in the code, and we might want to remove it.
8347 When evaluating Ada expressions, the tricky issue is that they may
8348 reference entities whose type contents and size are not statically
8349 known. Consider for instance a variant record:
8351 type Rec (Empty : Boolean := True) is record
8354 when False => Value : Integer;
8357 Yes : Rec := (Empty => False, Value => 1);
8358 No : Rec := (empty => True);
8360 The size and contents of that record depends on the value of the
8361 descriminant (Rec.Empty). At this point, neither the debugging
8362 information nor the associated type structure in GDB are able to
8363 express such dynamic types. So what the debugger does is to create
8364 "fixed" versions of the type that applies to the specific object.
8365 We also informally refer to this opperation as "fixing" an object,
8366 which means creating its associated fixed type.
8368 Example: when printing the value of variable "Yes" above, its fixed
8369 type would look like this:
8376 On the other hand, if we printed the value of "No", its fixed type
8383 Things become a little more complicated when trying to fix an entity
8384 with a dynamic type that directly contains another dynamic type,
8385 such as an array of variant records, for instance. There are
8386 two possible cases: Arrays, and records.
8388 Arrays are a little simpler to handle, because the same amount of
8389 memory is allocated for each element of the array, even if the amount
8390 of space used by each element changes from element to element.
8391 Consider for instance the following array of type Rec:
8393 type Rec_Array is array (1 .. 2) of Rec;
8395 The type structure in GDB describes an array in terms of its
8396 bounds, and the type of its elements. By design, all elements
8397 in the array have the same type. So we cannot use a fixed type
8398 for the array elements in this case, since the fixed type depends
8399 on the actual value of each element.
8401 Fortunately, what happens in practice is that each element of
8402 the array has the same size, which is the maximum size that
8403 might be needed in order to hold an object of the element type.
8404 And the compiler shows it in the debugging information by wrapping
8405 the array element inside a private PAD type. This type should not
8406 be shown to the user, and must be "unwrap"'ed before printing. Note
8407 that we also use the adjective "aligner" in our code to designate
8408 these wrapper types.
8410 These wrapper types should have a constant size, which is the size
8411 of each element of the array. In the case when the size is statically
8412 known, the PAD type will already have the right size, and the array
8413 element type should remain unfixed. But there are cases when
8414 this size is not statically known. For instance, assuming that
8415 "Five" is an integer variable:
8417 type Dynamic is array (1 .. Five) of Integer;
8418 type Wrapper (Has_Length : Boolean := False) is record
8421 when True => Length : Integer;
8425 type Wrapper_Array is array (1 .. 2) of Wrapper;
8427 Hello : Wrapper_Array := (others => (Has_Length => True,
8428 Data => (others => 17),
8432 The debugging info would describe variable Hello as being an
8433 array of a PAD type. The size of that PAD type is not statically
8434 known, but can be determined using a parallel XVZ variable.
8435 In that case, a copy of the PAD type with the correct size should
8436 be used for the fixed array.
8438 However, things are slightly different in the case of dynamic
8439 record types. In this case, in order to compute the associated
8440 fixed type, we need to determine the size and offset of each of
8441 its components. This, in turn, requires us to compute the fixed
8442 type of each of these components.
8444 Consider for instance the example:
8446 type Bounded_String (Max_Size : Natural) is record
8447 Str : String (1 .. Max_Size);
8450 My_String : Bounded_String (Max_Size => 10);
8452 In that case, the position of field "Length" depends on the size
8453 of field Str, which itself depends on the value of the Max_Size
8454 discriminant. In order to fix the type of variable My_String,
8455 we need to fix the type of field Str. Therefore, fixing a variant
8456 record requires us to fix each of its components.
8458 However, if a component does not have a dynamic size, the component
8459 should not be fixed. In particular, fields that use a PAD type
8460 should not fixed. Here is an example where this might happen
8461 (assuming type Rec above):
8463 type Container (Big : Boolean) is record
8467 when True => Another : Integer;
8471 My_Container : Container := (Big => False,
8472 First => (Empty => True),
8475 In that example, the compiler creates a PAD type for component First,
8476 whose size is constant, and then positions the component After just
8477 right after it. The offset of component After is therefore constant
8480 The debugger computes the position of each field based on an algorithm
8481 that uses, among other things, the actual position and size of the field
8482 preceding it. Let's now imagine that the user is trying to print the
8483 value of My_Container. If the type fixing was recursive, we would
8484 end up computing the offset of field After based on the size of the
8485 fixed version of field First. And since in our example First has
8486 only one actual field, the size of the fixed type is actually smaller
8487 than the amount of space allocated to that field, and thus we would
8488 compute the wrong offset of field After.
8490 Unfortunately, we need to watch out for dynamic components of variant
8491 records (identified by the ___XVL suffix in the component name).
8492 Even if the target type is a PAD type, the size of that type might
8493 not be statically known. So the PAD type needs to be unwrapped and
8494 the resulting type needs to be fixed. Otherwise, we might end up
8495 with the wrong size for our component. This can be observed with
8496 the following type declarations:
8498 type Octal is new Integer range 0 .. 7;
8499 type Octal_Array is array (Positive range <>) of Octal;
8500 pragma Pack (Octal_Array);
8502 type Octal_Buffer (Size : Positive) is record
8503 Buffer : Octal_Array (1 .. Size);
8507 In that case, Buffer is a PAD type whose size is unset and needs
8508 to be computed by fixing the unwrapped type.
8510 Lastly, when should the sub-elements of a type that remained unfixed
8511 thus far, be actually fixed?
8513 The answer is: Only when referencing that element. For instance
8514 when selecting one component of a record, this specific component
8515 should be fixed at that point in time. Or when printing the value
8516 of a record, each component should be fixed before its value gets
8517 printed. Similarly for arrays, the element of the array should be
8518 fixed when printing each element of the array, or when extracting
8519 one element out of that array. On the other hand, fixing should
8520 not be performed on the elements when taking a slice of an array!
8522 Note that one of the side-effects of miscomputing the offset and
8523 size of each field is that we end up also miscomputing the size
8524 of the containing type. This can have adverse results when computing
8525 the value of an entity. GDB fetches the value of an entity based
8526 on the size of its type, and thus a wrong size causes GDB to fetch
8527 the wrong amount of memory. In the case where the computed size is
8528 too small, GDB fetches too little data to print the value of our
8529 entiry. Results in this case as unpredicatble, as we usually read
8530 past the buffer containing the data =:-o. */
8532 /* Implement the evaluate_exp routine in the exp_descriptor structure
8533 for the Ada language. */
8535 static struct value *
8536 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
8537 int *pos, enum noside noside)
8540 int tem, tem2, tem3;
8542 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
8545 struct value **argvec;
8549 op = exp->elts[pc].opcode;
8555 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
8556 arg1 = unwrap_value (arg1);
8558 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8559 then we need to perform the conversion manually, because
8560 evaluate_subexp_standard doesn't do it. This conversion is
8561 necessary in Ada because the different kinds of float/fixed
8562 types in Ada have different representations.
8564 Similarly, we need to perform the conversion from OP_LONG
8566 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
8567 arg1 = ada_value_cast (expect_type, arg1, noside);
8573 struct value *result;
8575 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
8576 /* The result type will have code OP_STRING, bashed there from
8577 OP_ARRAY. Bash it back. */
8578 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
8579 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
8585 type = exp->elts[pc + 1].type;
8586 arg1 = evaluate_subexp (type, exp, pos, noside);
8587 if (noside == EVAL_SKIP)
8589 arg1 = ada_value_cast (type, arg1, noside);
8594 type = exp->elts[pc + 1].type;
8595 return ada_evaluate_subexp (type, exp, pos, noside);
8598 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8599 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8601 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
8602 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8604 return ada_value_assign (arg1, arg1);
8606 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8607 except if the lhs of our assignment is a convenience variable.
8608 In the case of assigning to a convenience variable, the lhs
8609 should be exactly the result of the evaluation of the rhs. */
8610 type = value_type (arg1);
8611 if (VALUE_LVAL (arg1) == lval_internalvar)
8613 arg2 = evaluate_subexp (type, exp, pos, noside);
8614 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8616 if (ada_is_fixed_point_type (value_type (arg1)))
8617 arg2 = cast_to_fixed (value_type (arg1), arg2);
8618 else if (ada_is_fixed_point_type (value_type (arg2)))
8620 (_("Fixed-point values must be assigned to fixed-point variables"));
8622 arg2 = coerce_for_assign (value_type (arg1), arg2);
8623 return ada_value_assign (arg1, arg2);
8626 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8627 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8628 if (noside == EVAL_SKIP)
8630 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
8631 return (value_from_longest
8633 value_as_long (arg1) + value_as_long (arg2)));
8634 if ((ada_is_fixed_point_type (value_type (arg1))
8635 || ada_is_fixed_point_type (value_type (arg2)))
8636 && value_type (arg1) != value_type (arg2))
8637 error (_("Operands of fixed-point addition must have the same type"));
8638 /* Do the addition, and cast the result to the type of the first
8639 argument. We cannot cast the result to a reference type, so if
8640 ARG1 is a reference type, find its underlying type. */
8641 type = value_type (arg1);
8642 while (TYPE_CODE (type) == TYPE_CODE_REF)
8643 type = TYPE_TARGET_TYPE (type);
8644 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8645 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
8648 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8649 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8650 if (noside == EVAL_SKIP)
8652 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
8653 return (value_from_longest
8655 value_as_long (arg1) - value_as_long (arg2)));
8656 if ((ada_is_fixed_point_type (value_type (arg1))
8657 || ada_is_fixed_point_type (value_type (arg2)))
8658 && value_type (arg1) != value_type (arg2))
8659 error (_("Operands of fixed-point subtraction must have the same type"));
8660 /* Do the substraction, and cast the result to the type of the first
8661 argument. We cannot cast the result to a reference type, so if
8662 ARG1 is a reference type, find its underlying type. */
8663 type = value_type (arg1);
8664 while (TYPE_CODE (type) == TYPE_CODE_REF)
8665 type = TYPE_TARGET_TYPE (type);
8666 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8667 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
8673 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8674 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8675 if (noside == EVAL_SKIP)
8677 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8679 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8680 return value_zero (value_type (arg1), not_lval);
8684 type = builtin_type (exp->gdbarch)->builtin_double;
8685 if (ada_is_fixed_point_type (value_type (arg1)))
8686 arg1 = cast_from_fixed (type, arg1);
8687 if (ada_is_fixed_point_type (value_type (arg2)))
8688 arg2 = cast_from_fixed (type, arg2);
8689 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8690 return ada_value_binop (arg1, arg2, op);
8694 case BINOP_NOTEQUAL:
8695 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8696 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
8697 if (noside == EVAL_SKIP)
8699 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8703 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8704 tem = ada_value_equal (arg1, arg2);
8706 if (op == BINOP_NOTEQUAL)
8708 type = language_bool_type (exp->language_defn, exp->gdbarch);
8709 return value_from_longest (type, (LONGEST) tem);
8712 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8713 if (noside == EVAL_SKIP)
8715 else if (ada_is_fixed_point_type (value_type (arg1)))
8716 return value_cast (value_type (arg1), value_neg (arg1));
8719 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
8720 return value_neg (arg1);
8723 case BINOP_LOGICAL_AND:
8724 case BINOP_LOGICAL_OR:
8725 case UNOP_LOGICAL_NOT:
8730 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8731 type = language_bool_type (exp->language_defn, exp->gdbarch);
8732 return value_cast (type, val);
8735 case BINOP_BITWISE_AND:
8736 case BINOP_BITWISE_IOR:
8737 case BINOP_BITWISE_XOR:
8741 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8743 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8745 return value_cast (value_type (arg1), val);
8751 if (noside == EVAL_SKIP)
8756 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
8757 /* Only encountered when an unresolved symbol occurs in a
8758 context other than a function call, in which case, it is
8760 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8761 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
8762 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8764 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
8765 if (ada_is_tagged_type (type, 0))
8767 /* Tagged types are a little special in the fact that the real
8768 type is dynamic and can only be determined by inspecting the
8769 object's tag. This means that we need to get the object's
8770 value first (EVAL_NORMAL) and then extract the actual object
8773 Note that we cannot skip the final step where we extract
8774 the object type from its tag, because the EVAL_NORMAL phase
8775 results in dynamic components being resolved into fixed ones.
8776 This can cause problems when trying to print the type
8777 description of tagged types whose parent has a dynamic size:
8778 We use the type name of the "_parent" component in order
8779 to print the name of the ancestor type in the type description.
8780 If that component had a dynamic size, the resolution into
8781 a fixed type would result in the loss of that type name,
8782 thus preventing us from printing the name of the ancestor
8783 type in the type description. */
8784 struct type *actual_type;
8786 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
8787 actual_type = type_from_tag (ada_value_tag (arg1));
8788 if (actual_type == NULL)
8789 /* If, for some reason, we were unable to determine
8790 the actual type from the tag, then use the static
8791 approximation that we just computed as a fallback.
8792 This can happen if the debugging information is
8793 incomplete, for instance. */
8796 return value_zero (actual_type, not_lval);
8801 (to_static_fixed_type
8802 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
8807 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
8808 arg1 = unwrap_value (arg1);
8809 return ada_to_fixed_value (arg1);
8815 /* Allocate arg vector, including space for the function to be
8816 called in argvec[0] and a terminating NULL. */
8817 nargs = longest_to_int (exp->elts[pc + 1].longconst);
8819 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
8821 if (exp->elts[*pos].opcode == OP_VAR_VALUE
8822 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
8823 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8824 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
8827 for (tem = 0; tem <= nargs; tem += 1)
8828 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8831 if (noside == EVAL_SKIP)
8835 if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
8836 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
8837 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
8838 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
8839 /* This is a packed array that has already been fixed, and
8840 therefore already coerced to a simple array. Nothing further
8843 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
8844 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
8845 && VALUE_LVAL (argvec[0]) == lval_memory))
8846 argvec[0] = value_addr (argvec[0]);
8848 type = ada_check_typedef (value_type (argvec[0]));
8849 if (TYPE_CODE (type) == TYPE_CODE_PTR)
8851 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
8853 case TYPE_CODE_FUNC:
8854 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
8856 case TYPE_CODE_ARRAY:
8858 case TYPE_CODE_STRUCT:
8859 if (noside != EVAL_AVOID_SIDE_EFFECTS)
8860 argvec[0] = ada_value_ind (argvec[0]);
8861 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
8864 error (_("cannot subscript or call something of type `%s'"),
8865 ada_type_name (value_type (argvec[0])));
8870 switch (TYPE_CODE (type))
8872 case TYPE_CODE_FUNC:
8873 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8874 return allocate_value (TYPE_TARGET_TYPE (type));
8875 return call_function_by_hand (argvec[0], nargs, argvec + 1);
8876 case TYPE_CODE_STRUCT:
8880 arity = ada_array_arity (type);
8881 type = ada_array_element_type (type, nargs);
8883 error (_("cannot subscript or call a record"));
8885 error (_("wrong number of subscripts; expecting %d"), arity);
8886 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8887 return value_zero (ada_aligned_type (type), lval_memory);
8889 unwrap_value (ada_value_subscript
8890 (argvec[0], nargs, argvec + 1));
8892 case TYPE_CODE_ARRAY:
8893 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8895 type = ada_array_element_type (type, nargs);
8897 error (_("element type of array unknown"));
8899 return value_zero (ada_aligned_type (type), lval_memory);
8902 unwrap_value (ada_value_subscript
8903 (ada_coerce_to_simple_array (argvec[0]),
8904 nargs, argvec + 1));
8905 case TYPE_CODE_PTR: /* Pointer to array */
8906 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
8907 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8909 type = ada_array_element_type (type, nargs);
8911 error (_("element type of array unknown"));
8913 return value_zero (ada_aligned_type (type), lval_memory);
8916 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
8917 nargs, argvec + 1));
8920 error (_("Attempt to index or call something other than an "
8921 "array or function"));
8926 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8927 struct value *low_bound_val =
8928 evaluate_subexp (NULL_TYPE, exp, pos, noside);
8929 struct value *high_bound_val =
8930 evaluate_subexp (NULL_TYPE, exp, pos, noside);
8933 low_bound_val = coerce_ref (low_bound_val);
8934 high_bound_val = coerce_ref (high_bound_val);
8935 low_bound = pos_atr (low_bound_val);
8936 high_bound = pos_atr (high_bound_val);
8938 if (noside == EVAL_SKIP)
8941 /* If this is a reference to an aligner type, then remove all
8943 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8944 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
8945 TYPE_TARGET_TYPE (value_type (array)) =
8946 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
8948 if (ada_is_packed_array_type (value_type (array)))
8949 error (_("cannot slice a packed array"));
8951 /* If this is a reference to an array or an array lvalue,
8952 convert to a pointer. */
8953 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8954 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
8955 && VALUE_LVAL (array) == lval_memory))
8956 array = value_addr (array);
8958 if (noside == EVAL_AVOID_SIDE_EFFECTS
8959 && ada_is_array_descriptor_type (ada_check_typedef
8960 (value_type (array))))
8961 return empty_array (ada_type_of_array (array, 0), low_bound);
8963 array = ada_coerce_to_simple_array_ptr (array);
8965 /* If we have more than one level of pointer indirection,
8966 dereference the value until we get only one level. */
8967 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
8968 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
8970 array = value_ind (array);
8972 /* Make sure we really do have an array type before going further,
8973 to avoid a SEGV when trying to get the index type or the target
8974 type later down the road if the debug info generated by
8975 the compiler is incorrect or incomplete. */
8976 if (!ada_is_simple_array_type (value_type (array)))
8977 error (_("cannot take slice of non-array"));
8979 if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
8981 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
8982 return empty_array (TYPE_TARGET_TYPE (value_type (array)),
8986 struct type *arr_type0 =
8987 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
8989 return ada_value_slice_from_ptr (array, arr_type0,
8990 longest_to_int (low_bound),
8991 longest_to_int (high_bound));
8994 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8996 else if (high_bound < low_bound)
8997 return empty_array (value_type (array), low_bound);
8999 return ada_value_slice (array, longest_to_int (low_bound),
9000 longest_to_int (high_bound));
9005 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9006 type = check_typedef (exp->elts[pc + 1].type);
9008 if (noside == EVAL_SKIP)
9011 switch (TYPE_CODE (type))
9014 lim_warning (_("Membership test incompletely implemented; "
9015 "always returns true"));
9016 type = language_bool_type (exp->language_defn, exp->gdbarch);
9017 return value_from_longest (type, (LONGEST) 1);
9019 case TYPE_CODE_RANGE:
9020 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
9021 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
9022 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9023 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9024 type = language_bool_type (exp->language_defn, exp->gdbarch);
9026 value_from_longest (type,
9027 (value_less (arg1, arg3)
9028 || value_equal (arg1, arg3))
9029 && (value_less (arg2, arg1)
9030 || value_equal (arg2, arg1)));
9033 case BINOP_IN_BOUNDS:
9035 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9036 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9038 if (noside == EVAL_SKIP)
9041 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9043 type = language_bool_type (exp->language_defn, exp->gdbarch);
9044 return value_zero (type, not_lval);
9047 tem = longest_to_int (exp->elts[pc + 1].longconst);
9049 if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
9050 error (_("invalid dimension number to 'range"));
9052 arg3 = ada_array_bound (arg2, tem, 1);
9053 arg2 = ada_array_bound (arg2, tem, 0);
9055 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9056 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9057 type = language_bool_type (exp->language_defn, exp->gdbarch);
9059 value_from_longest (type,
9060 (value_less (arg1, arg3)
9061 || value_equal (arg1, arg3))
9062 && (value_less (arg2, arg1)
9063 || value_equal (arg2, arg1)));
9065 case TERNOP_IN_RANGE:
9066 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9067 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9068 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9070 if (noside == EVAL_SKIP)
9073 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9074 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
9075 type = language_bool_type (exp->language_defn, exp->gdbarch);
9077 value_from_longest (type,
9078 (value_less (arg1, arg3)
9079 || value_equal (arg1, arg3))
9080 && (value_less (arg2, arg1)
9081 || value_equal (arg2, arg1)));
9087 struct type *type_arg;
9088 if (exp->elts[*pos].opcode == OP_TYPE)
9090 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9092 type_arg = check_typedef (exp->elts[pc + 2].type);
9096 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9100 if (exp->elts[*pos].opcode != OP_LONG)
9101 error (_("Invalid operand to '%s"), ada_attribute_name (op));
9102 tem = longest_to_int (exp->elts[*pos + 2].longconst);
9105 if (noside == EVAL_SKIP)
9108 if (type_arg == NULL)
9110 arg1 = ada_coerce_ref (arg1);
9112 if (ada_is_packed_array_type (value_type (arg1)))
9113 arg1 = ada_coerce_to_simple_array (arg1);
9115 if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
9116 error (_("invalid dimension number to '%s"),
9117 ada_attribute_name (op));
9119 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9121 type = ada_index_type (value_type (arg1), tem);
9124 (_("attempt to take bound of something that is not an array"));
9125 return allocate_value (type);
9130 default: /* Should never happen. */
9131 error (_("unexpected attribute encountered"));
9133 return ada_array_bound (arg1, tem, 0);
9135 return ada_array_bound (arg1, tem, 1);
9137 return ada_array_length (arg1, tem);
9140 else if (discrete_type_p (type_arg))
9142 struct type *range_type;
9143 char *name = ada_type_name (type_arg);
9145 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
9147 to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
9148 if (range_type == NULL)
9149 range_type = type_arg;
9153 error (_("unexpected attribute encountered"));
9155 return value_from_longest
9156 (range_type, discrete_type_low_bound (range_type));
9158 return value_from_longest
9159 (range_type, discrete_type_high_bound (range_type));
9161 error (_("the 'length attribute applies only to array types"));
9164 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
9165 error (_("unimplemented type attribute"));
9170 if (ada_is_packed_array_type (type_arg))
9171 type_arg = decode_packed_array_type (type_arg);
9173 if (tem < 1 || tem > ada_array_arity (type_arg))
9174 error (_("invalid dimension number to '%s"),
9175 ada_attribute_name (op));
9177 type = ada_index_type (type_arg, tem);
9180 (_("attempt to take bound of something that is not an array"));
9181 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9182 return allocate_value (type);
9187 error (_("unexpected attribute encountered"));
9189 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
9190 return value_from_longest (type, low);
9192 high = ada_array_bound_from_type (type_arg, tem, 1, &type);
9193 return value_from_longest (type, high);
9195 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
9196 high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
9197 return value_from_longest (type, high - low + 1);
9203 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9204 if (noside == EVAL_SKIP)
9207 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9208 return value_zero (ada_tag_type (arg1), not_lval);
9210 return ada_value_tag (arg1);
9214 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9215 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9216 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9217 if (noside == EVAL_SKIP)
9219 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9220 return value_zero (value_type (arg1), not_lval);
9223 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9224 return value_binop (arg1, arg2,
9225 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
9228 case OP_ATR_MODULUS:
9230 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
9231 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9233 if (noside == EVAL_SKIP)
9236 if (!ada_is_modular_type (type_arg))
9237 error (_("'modulus must be applied to modular type"));
9239 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
9240 ada_modulus (type_arg));
9245 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9246 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9247 if (noside == EVAL_SKIP)
9249 type = builtin_type (exp->gdbarch)->builtin_int;
9250 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9251 return value_zero (type, not_lval);
9253 return value_pos_atr (type, arg1);
9256 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9257 type = value_type (arg1);
9259 /* If the argument is a reference, then dereference its type, since
9260 the user is really asking for the size of the actual object,
9261 not the size of the pointer. */
9262 if (TYPE_CODE (type) == TYPE_CODE_REF)
9263 type = TYPE_TARGET_TYPE (type);
9265 if (noside == EVAL_SKIP)
9267 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9268 return value_zero (builtin_type_int32, not_lval);
9270 return value_from_longest (builtin_type_int32,
9271 TARGET_CHAR_BIT * TYPE_LENGTH (type));
9274 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9275 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9276 type = exp->elts[pc + 2].type;
9277 if (noside == EVAL_SKIP)
9279 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9280 return value_zero (type, not_lval);
9282 return value_val_atr (type, arg1);
9285 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9286 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9287 if (noside == EVAL_SKIP)
9289 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9290 return value_zero (value_type (arg1), not_lval);
9293 /* For integer exponentiation operations,
9294 only promote the first argument. */
9295 if (is_integral_type (value_type (arg2)))
9296 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9298 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9300 return value_binop (arg1, arg2, op);
9304 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9305 if (noside == EVAL_SKIP)
9311 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9312 if (noside == EVAL_SKIP)
9314 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9315 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
9316 return value_neg (arg1);
9321 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9322 if (noside == EVAL_SKIP)
9324 type = ada_check_typedef (value_type (arg1));
9325 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9327 if (ada_is_array_descriptor_type (type))
9328 /* GDB allows dereferencing GNAT array descriptors. */
9330 struct type *arrType = ada_type_of_array (arg1, 0);
9331 if (arrType == NULL)
9332 error (_("Attempt to dereference null array pointer."));
9333 return value_at_lazy (arrType, 0);
9335 else if (TYPE_CODE (type) == TYPE_CODE_PTR
9336 || TYPE_CODE (type) == TYPE_CODE_REF
9337 /* In C you can dereference an array to get the 1st elt. */
9338 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
9340 type = to_static_fixed_type
9342 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
9344 return value_zero (type, lval_memory);
9346 else if (TYPE_CODE (type) == TYPE_CODE_INT)
9348 /* GDB allows dereferencing an int. */
9349 if (expect_type == NULL)
9350 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
9355 to_static_fixed_type (ada_aligned_type (expect_type));
9356 return value_zero (expect_type, lval_memory);
9360 error (_("Attempt to take contents of a non-pointer value."));
9362 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
9363 type = ada_check_typedef (value_type (arg1));
9365 if (TYPE_CODE (type) == TYPE_CODE_INT)
9366 /* GDB allows dereferencing an int. If we were given
9367 the expect_type, then use that as the target type.
9368 Otherwise, assume that the target type is an int. */
9370 if (expect_type != NULL)
9371 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
9374 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
9375 (CORE_ADDR) value_as_address (arg1));
9378 if (ada_is_array_descriptor_type (type))
9379 /* GDB allows dereferencing GNAT array descriptors. */
9380 return ada_coerce_to_simple_array (arg1);
9382 return ada_value_ind (arg1);
9384 case STRUCTOP_STRUCT:
9385 tem = longest_to_int (exp->elts[pc + 1].longconst);
9386 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
9387 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9388 if (noside == EVAL_SKIP)
9390 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9392 struct type *type1 = value_type (arg1);
9393 if (ada_is_tagged_type (type1, 1))
9395 type = ada_lookup_struct_elt_type (type1,
9396 &exp->elts[pc + 2].string,
9399 /* In this case, we assume that the field COULD exist
9400 in some extension of the type. Return an object of
9401 "type" void, which will match any formal
9402 (see ada_type_match). */
9403 return value_zero (builtin_type_void, lval_memory);
9407 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
9410 return value_zero (ada_aligned_type (type), lval_memory);
9413 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
9414 arg1 = unwrap_value (arg1);
9415 return ada_to_fixed_value (arg1);
9418 /* The value is not supposed to be used. This is here to make it
9419 easier to accommodate expressions that contain types. */
9421 if (noside == EVAL_SKIP)
9423 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9424 return allocate_value (exp->elts[pc + 1].type);
9426 error (_("Attempt to use a type name as an expression"));
9431 case OP_DISCRETE_RANGE:
9434 if (noside == EVAL_NORMAL)
9438 error (_("Undefined name, ambiguous name, or renaming used in "
9439 "component association: %s."), &exp->elts[pc+2].string);
9441 error (_("Aggregates only allowed on the right of an assignment"));
9443 internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
9446 ada_forward_operator_length (exp, pc, &oplen, &nargs);
9448 for (tem = 0; tem < nargs; tem += 1)
9449 ada_evaluate_subexp (NULL, exp, pos, noside);
9454 return value_from_longest (builtin_type_int8, (LONGEST) 1);
9460 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9461 type name that encodes the 'small and 'delta information.
9462 Otherwise, return NULL. */
9465 fixed_type_info (struct type *type)
9467 const char *name = ada_type_name (type);
9468 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
9470 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
9472 const char *tail = strstr (name, "___XF_");
9478 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
9479 return fixed_type_info (TYPE_TARGET_TYPE (type));
9484 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9487 ada_is_fixed_point_type (struct type *type)
9489 return fixed_type_info (type) != NULL;
9492 /* Return non-zero iff TYPE represents a System.Address type. */
9495 ada_is_system_address_type (struct type *type)
9497 return (TYPE_NAME (type)
9498 && strcmp (TYPE_NAME (type), "system__address") == 0);
9501 /* Assuming that TYPE is the representation of an Ada fixed-point
9502 type, return its delta, or -1 if the type is malformed and the
9503 delta cannot be determined. */
9506 ada_delta (struct type *type)
9508 const char *encoding = fixed_type_info (type);
9511 /* Strictly speaking, num and den are encoded as integer. However,
9512 they may not fit into a long, and they will have to be converted
9513 to DOUBLEST anyway. So scan them as DOUBLEST. */
9514 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
9521 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9522 factor ('SMALL value) associated with the type. */
9525 scaling_factor (struct type *type)
9527 const char *encoding = fixed_type_info (type);
9528 DOUBLEST num0, den0, num1, den1;
9531 /* Strictly speaking, num's and den's are encoded as integer. However,
9532 they may not fit into a long, and they will have to be converted
9533 to DOUBLEST anyway. So scan them as DOUBLEST. */
9534 n = sscanf (encoding,
9535 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
9536 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
9537 &num0, &den0, &num1, &den1);
9548 /* Assuming that X is the representation of a value of fixed-point
9549 type TYPE, return its floating-point equivalent. */
9552 ada_fixed_to_float (struct type *type, LONGEST x)
9554 return (DOUBLEST) x *scaling_factor (type);
9557 /* The representation of a fixed-point value of type TYPE
9558 corresponding to the value X. */
9561 ada_float_to_fixed (struct type *type, DOUBLEST x)
9563 return (LONGEST) (x / scaling_factor (type) + 0.5);
9567 /* VAX floating formats */
9569 /* Non-zero iff TYPE represents one of the special VAX floating-point
9573 ada_is_vax_floating_type (struct type *type)
9576 (ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
9579 && (TYPE_CODE (type) == TYPE_CODE_INT
9580 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9581 && strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
9584 /* The type of special VAX floating-point type this is, assuming
9585 ada_is_vax_floating_point. */
9588 ada_vax_float_type_suffix (struct type *type)
9590 return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
9593 /* A value representing the special debugging function that outputs
9594 VAX floating-point values of the type represented by TYPE. Assumes
9595 ada_is_vax_floating_type (TYPE). */
9598 ada_vax_float_print_function (struct type *type)
9600 switch (ada_vax_float_type_suffix (type))
9603 return get_var_value ("DEBUG_STRING_F", 0);
9605 return get_var_value ("DEBUG_STRING_D", 0);
9607 return get_var_value ("DEBUG_STRING_G", 0);
9609 error (_("invalid VAX floating-point type"));
9616 /* Scan STR beginning at position K for a discriminant name, and
9617 return the value of that discriminant field of DVAL in *PX. If
9618 PNEW_K is not null, put the position of the character beyond the
9619 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9620 not alter *PX and *PNEW_K if unsuccessful. */
9623 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
9626 static char *bound_buffer = NULL;
9627 static size_t bound_buffer_len = 0;
9630 struct value *bound_val;
9632 if (dval == NULL || str == NULL || str[k] == '\0')
9635 pend = strstr (str + k, "__");
9639 k += strlen (bound);
9643 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
9644 bound = bound_buffer;
9645 strncpy (bound_buffer, str + k, pend - (str + k));
9646 bound[pend - (str + k)] = '\0';
9650 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
9651 if (bound_val == NULL)
9654 *px = value_as_long (bound_val);
9660 /* Value of variable named NAME in the current environment. If
9661 no such variable found, then if ERR_MSG is null, returns 0, and
9662 otherwise causes an error with message ERR_MSG. */
9664 static struct value *
9665 get_var_value (char *name, char *err_msg)
9667 struct ada_symbol_info *syms;
9670 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
9675 if (err_msg == NULL)
9678 error (("%s"), err_msg);
9681 return value_of_variable (syms[0].sym, syms[0].block);
9684 /* Value of integer variable named NAME in the current environment. If
9685 no such variable found, returns 0, and sets *FLAG to 0. If
9686 successful, sets *FLAG to 1. */
9689 get_int_var_value (char *name, int *flag)
9691 struct value *var_val = get_var_value (name, 0);
9703 return value_as_long (var_val);
9708 /* Return a range type whose base type is that of the range type named
9709 NAME in the current environment, and whose bounds are calculated
9710 from NAME according to the GNAT range encoding conventions.
9711 Extract discriminant values, if needed, from DVAL. If a new type
9712 must be created, allocate in OBJFILE's space. The bounds
9713 information, in general, is encoded in NAME, the base type given in
9714 the named range type. */
9716 static struct type *
9717 to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
9719 struct type *raw_type = ada_find_any_type (name);
9720 struct type *base_type;
9723 /* Also search primitive types if type symbol could not be found. */
9724 if (raw_type == NULL)
9725 raw_type = language_lookup_primitive_type_by_name
9726 (language_def (language_ada), current_gdbarch, name);
9728 if (raw_type == NULL)
9729 base_type = builtin_type_int32;
9730 else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
9731 base_type = TYPE_TARGET_TYPE (raw_type);
9733 base_type = raw_type;
9735 subtype_info = strstr (name, "___XD");
9736 if (subtype_info == NULL)
9738 LONGEST L = discrete_type_low_bound (raw_type);
9739 LONGEST U = discrete_type_high_bound (raw_type);
9740 if (L < INT_MIN || U > INT_MAX)
9743 return create_range_type (alloc_type (objfile), raw_type,
9744 discrete_type_low_bound (raw_type),
9745 discrete_type_high_bound (raw_type));
9749 static char *name_buf = NULL;
9750 static size_t name_len = 0;
9751 int prefix_len = subtype_info - name;
9757 GROW_VECT (name_buf, name_len, prefix_len + 5);
9758 strncpy (name_buf, name, prefix_len);
9759 name_buf[prefix_len] = '\0';
9762 bounds_str = strchr (subtype_info, '_');
9765 if (*subtype_info == 'L')
9767 if (!ada_scan_number (bounds_str, n, &L, &n)
9768 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
9770 if (bounds_str[n] == '_')
9772 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
9779 strcpy (name_buf + prefix_len, "___L");
9780 L = get_int_var_value (name_buf, &ok);
9783 lim_warning (_("Unknown lower bound, using 1."));
9788 if (*subtype_info == 'U')
9790 if (!ada_scan_number (bounds_str, n, &U, &n)
9791 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
9797 strcpy (name_buf + prefix_len, "___U");
9798 U = get_int_var_value (name_buf, &ok);
9801 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
9806 if (objfile == NULL)
9807 objfile = TYPE_OBJFILE (base_type);
9808 type = create_range_type (alloc_type (objfile), base_type, L, U);
9809 TYPE_NAME (type) = name;
9814 /* True iff NAME is the name of a range type. */
9817 ada_is_range_type_name (const char *name)
9819 return (name != NULL && strstr (name, "___XD"));
9825 /* True iff TYPE is an Ada modular type. */
9828 ada_is_modular_type (struct type *type)
9830 struct type *subranged_type = base_type (type);
9832 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
9833 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
9834 && TYPE_UNSIGNED (subranged_type));
9837 /* Try to determine the lower and upper bounds of the given modular type
9838 using the type name only. Return non-zero and set L and U as the lower
9839 and upper bounds (respectively) if successful. */
9842 ada_modulus_from_name (struct type *type, ULONGEST *modulus)
9844 char *name = ada_type_name (type);
9852 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9853 we are looking for static bounds, which means an __XDLU suffix.
9854 Moreover, we know that the lower bound of modular types is always
9855 zero, so the actual suffix should start with "__XDLU_0__", and
9856 then be followed by the upper bound value. */
9857 suffix = strstr (name, "__XDLU_0__");
9861 if (!ada_scan_number (suffix, k, &U, NULL))
9864 *modulus = (ULONGEST) U + 1;
9868 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9871 ada_modulus (struct type *type)
9875 /* Normally, the modulus of a modular type is equal to the value of
9876 its upper bound + 1. However, the upper bound is currently stored
9877 as an int, which is not always big enough to hold the actual bound
9878 value. To workaround this, try to take advantage of the encoding
9879 that GNAT uses with with discrete types. To avoid some unnecessary
9880 parsing, we do this only when the size of TYPE is greater than
9881 the size of the field holding the bound. */
9882 if (TYPE_LENGTH (type) > sizeof (TYPE_HIGH_BOUND (type))
9883 && ada_modulus_from_name (type, &modulus))
9886 return (ULONGEST) (unsigned int) TYPE_HIGH_BOUND (type) + 1;
9890 /* Ada exception catchpoint support:
9891 ---------------------------------
9893 We support 3 kinds of exception catchpoints:
9894 . catchpoints on Ada exceptions
9895 . catchpoints on unhandled Ada exceptions
9896 . catchpoints on failed assertions
9898 Exceptions raised during failed assertions, or unhandled exceptions
9899 could perfectly be caught with the general catchpoint on Ada exceptions.
9900 However, we can easily differentiate these two special cases, and having
9901 the option to distinguish these two cases from the rest can be useful
9902 to zero-in on certain situations.
9904 Exception catchpoints are a specialized form of breakpoint,
9905 since they rely on inserting breakpoints inside known routines
9906 of the GNAT runtime. The implementation therefore uses a standard
9907 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9910 Support in the runtime for exception catchpoints have been changed
9911 a few times already, and these changes affect the implementation
9912 of these catchpoints. In order to be able to support several
9913 variants of the runtime, we use a sniffer that will determine
9914 the runtime variant used by the program being debugged.
9916 At this time, we do not support the use of conditions on Ada exception
9917 catchpoints. The COND and COND_STRING fields are therefore set
9918 to NULL (most of the time, see below).
9920 Conditions where EXP_STRING, COND, and COND_STRING are used:
9922 When a user specifies the name of a specific exception in the case
9923 of catchpoints on Ada exceptions, we store the name of that exception
9924 in the EXP_STRING. We then translate this request into an actual
9925 condition stored in COND_STRING, and then parse it into an expression
9928 /* The different types of catchpoints that we introduced for catching
9931 enum exception_catchpoint_kind
9934 ex_catch_exception_unhandled,
9938 /* Ada's standard exceptions. */
9940 static char *standard_exc[] = {
9947 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
9949 /* A structure that describes how to support exception catchpoints
9950 for a given executable. */
9952 struct exception_support_info
9954 /* The name of the symbol to break on in order to insert
9955 a catchpoint on exceptions. */
9956 const char *catch_exception_sym;
9958 /* The name of the symbol to break on in order to insert
9959 a catchpoint on unhandled exceptions. */
9960 const char *catch_exception_unhandled_sym;
9962 /* The name of the symbol to break on in order to insert
9963 a catchpoint on failed assertions. */
9964 const char *catch_assert_sym;
9966 /* Assuming that the inferior just triggered an unhandled exception
9967 catchpoint, this function is responsible for returning the address
9968 in inferior memory where the name of that exception is stored.
9969 Return zero if the address could not be computed. */
9970 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
9973 static CORE_ADDR ada_unhandled_exception_name_addr (void);
9974 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
9976 /* The following exception support info structure describes how to
9977 implement exception catchpoints with the latest version of the
9978 Ada runtime (as of 2007-03-06). */
9980 static const struct exception_support_info default_exception_support_info =
9982 "__gnat_debug_raise_exception", /* catch_exception_sym */
9983 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9984 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9985 ada_unhandled_exception_name_addr
9988 /* The following exception support info structure describes how to
9989 implement exception catchpoints with a slightly older version
9990 of the Ada runtime. */
9992 static const struct exception_support_info exception_support_info_fallback =
9994 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9995 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9996 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9997 ada_unhandled_exception_name_addr_from_raise
10000 /* For each executable, we sniff which exception info structure to use
10001 and cache it in the following global variable. */
10003 static const struct exception_support_info *exception_info = NULL;
10005 /* Inspect the Ada runtime and determine which exception info structure
10006 should be used to provide support for exception catchpoints.
10008 This function will always set exception_info, or raise an error. */
10011 ada_exception_support_info_sniffer (void)
10013 struct symbol *sym;
10015 /* If the exception info is already known, then no need to recompute it. */
10016 if (exception_info != NULL)
10019 /* Check the latest (default) exception support info. */
10020 sym = standard_lookup (default_exception_support_info.catch_exception_sym,
10024 exception_info = &default_exception_support_info;
10028 /* Try our fallback exception suport info. */
10029 sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
10033 exception_info = &exception_support_info_fallback;
10037 /* Sometimes, it is normal for us to not be able to find the routine
10038 we are looking for. This happens when the program is linked with
10039 the shared version of the GNAT runtime, and the program has not been
10040 started yet. Inform the user of these two possible causes if
10043 if (ada_update_initial_language (language_unknown, NULL) != language_ada)
10044 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10046 /* If the symbol does not exist, then check that the program is
10047 already started, to make sure that shared libraries have been
10048 loaded. If it is not started, this may mean that the symbol is
10049 in a shared library. */
10051 if (ptid_get_pid (inferior_ptid) == 0)
10052 error (_("Unable to insert catchpoint. Try to start the program first."));
10054 /* At this point, we know that we are debugging an Ada program and
10055 that the inferior has been started, but we still are not able to
10056 find the run-time symbols. That can mean that we are in
10057 configurable run time mode, or that a-except as been optimized
10058 out by the linker... In any case, at this point it is not worth
10059 supporting this feature. */
10061 error (_("Cannot insert catchpoints in this configuration."));
10064 /* An observer of "executable_changed" events.
10065 Its role is to clear certain cached values that need to be recomputed
10066 each time a new executable is loaded by GDB. */
10069 ada_executable_changed_observer (void)
10071 /* If the executable changed, then it is possible that the Ada runtime
10072 is different. So we need to invalidate the exception support info
10074 exception_info = NULL;
10077 /* Return the name of the function at PC, NULL if could not find it.
10078 This function only checks the debugging information, not the symbol
10082 function_name_from_pc (CORE_ADDR pc)
10086 if (!find_pc_partial_function (pc, &func_name, NULL, NULL))
10092 /* True iff FRAME is very likely to be that of a function that is
10093 part of the runtime system. This is all very heuristic, but is
10094 intended to be used as advice as to what frames are uninteresting
10098 is_known_support_routine (struct frame_info *frame)
10100 struct symtab_and_line sal;
10104 /* If this code does not have any debugging information (no symtab),
10105 This cannot be any user code. */
10107 find_frame_sal (frame, &sal);
10108 if (sal.symtab == NULL)
10111 /* If there is a symtab, but the associated source file cannot be
10112 located, then assume this is not user code: Selecting a frame
10113 for which we cannot display the code would not be very helpful
10114 for the user. This should also take care of case such as VxWorks
10115 where the kernel has some debugging info provided for a few units. */
10117 if (symtab_to_fullname (sal.symtab) == NULL)
10120 /* Check the unit filename againt the Ada runtime file naming.
10121 We also check the name of the objfile against the name of some
10122 known system libraries that sometimes come with debugging info
10125 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
10127 re_comp (known_runtime_file_name_patterns[i]);
10128 if (re_exec (sal.symtab->filename))
10130 if (sal.symtab->objfile != NULL
10131 && re_exec (sal.symtab->objfile->name))
10135 /* Check whether the function is a GNAT-generated entity. */
10137 func_name = function_name_from_pc (get_frame_address_in_block (frame));
10138 if (func_name == NULL)
10141 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
10143 re_comp (known_auxiliary_function_name_patterns[i]);
10144 if (re_exec (func_name))
10151 /* Find the first frame that contains debugging information and that is not
10152 part of the Ada run-time, starting from FI and moving upward. */
10155 ada_find_printable_frame (struct frame_info *fi)
10157 for (; fi != NULL; fi = get_prev_frame (fi))
10159 if (!is_known_support_routine (fi))
10168 /* Assuming that the inferior just triggered an unhandled exception
10169 catchpoint, return the address in inferior memory where the name
10170 of the exception is stored.
10172 Return zero if the address could not be computed. */
10175 ada_unhandled_exception_name_addr (void)
10177 return parse_and_eval_address ("e.full_name");
10180 /* Same as ada_unhandled_exception_name_addr, except that this function
10181 should be used when the inferior uses an older version of the runtime,
10182 where the exception name needs to be extracted from a specific frame
10183 several frames up in the callstack. */
10186 ada_unhandled_exception_name_addr_from_raise (void)
10189 struct frame_info *fi;
10191 /* To determine the name of this exception, we need to select
10192 the frame corresponding to RAISE_SYM_NAME. This frame is
10193 at least 3 levels up, so we simply skip the first 3 frames
10194 without checking the name of their associated function. */
10195 fi = get_current_frame ();
10196 for (frame_level = 0; frame_level < 3; frame_level += 1)
10198 fi = get_prev_frame (fi);
10202 const char *func_name =
10203 function_name_from_pc (get_frame_address_in_block (fi));
10204 if (func_name != NULL
10205 && strcmp (func_name, exception_info->catch_exception_sym) == 0)
10206 break; /* We found the frame we were looking for... */
10207 fi = get_prev_frame (fi);
10214 return parse_and_eval_address ("id.full_name");
10217 /* Assuming the inferior just triggered an Ada exception catchpoint
10218 (of any type), return the address in inferior memory where the name
10219 of the exception is stored, if applicable.
10221 Return zero if the address could not be computed, or if not relevant. */
10224 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
10225 struct breakpoint *b)
10229 case ex_catch_exception:
10230 return (parse_and_eval_address ("e.full_name"));
10233 case ex_catch_exception_unhandled:
10234 return exception_info->unhandled_exception_name_addr ();
10237 case ex_catch_assert:
10238 return 0; /* Exception name is not relevant in this case. */
10242 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10246 return 0; /* Should never be reached. */
10249 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10250 any error that ada_exception_name_addr_1 might cause to be thrown.
10251 When an error is intercepted, a warning with the error message is printed,
10252 and zero is returned. */
10255 ada_exception_name_addr (enum exception_catchpoint_kind ex,
10256 struct breakpoint *b)
10258 struct gdb_exception e;
10259 CORE_ADDR result = 0;
10261 TRY_CATCH (e, RETURN_MASK_ERROR)
10263 result = ada_exception_name_addr_1 (ex, b);
10268 warning (_("failed to get exception name: %s"), e.message);
10275 /* Implement the PRINT_IT method in the breakpoint_ops structure
10276 for all exception catchpoint kinds. */
10278 static enum print_stop_action
10279 print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
10281 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
10282 char exception_name[256];
10286 read_memory (addr, exception_name, sizeof (exception_name) - 1);
10287 exception_name [sizeof (exception_name) - 1] = '\0';
10290 ada_find_printable_frame (get_current_frame ());
10292 annotate_catchpoint (b->number);
10295 case ex_catch_exception:
10297 printf_filtered (_("\nCatchpoint %d, %s at "),
10298 b->number, exception_name);
10300 printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
10302 case ex_catch_exception_unhandled:
10304 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10305 b->number, exception_name);
10307 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10310 case ex_catch_assert:
10311 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10316 return PRINT_SRC_AND_LOC;
10319 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10320 for all exception catchpoint kinds. */
10323 print_one_exception (enum exception_catchpoint_kind ex,
10324 struct breakpoint *b, CORE_ADDR *last_addr)
10326 struct value_print_options opts;
10328 get_user_print_options (&opts);
10329 if (opts.addressprint)
10331 annotate_field (4);
10332 ui_out_field_core_addr (uiout, "addr", b->loc->address);
10335 annotate_field (5);
10336 *last_addr = b->loc->address;
10339 case ex_catch_exception:
10340 if (b->exp_string != NULL)
10342 char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
10344 ui_out_field_string (uiout, "what", msg);
10348 ui_out_field_string (uiout, "what", "all Ada exceptions");
10352 case ex_catch_exception_unhandled:
10353 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
10356 case ex_catch_assert:
10357 ui_out_field_string (uiout, "what", "failed Ada assertions");
10361 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10366 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10367 for all exception catchpoint kinds. */
10370 print_mention_exception (enum exception_catchpoint_kind ex,
10371 struct breakpoint *b)
10375 case ex_catch_exception:
10376 if (b->exp_string != NULL)
10377 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10378 b->number, b->exp_string);
10380 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
10384 case ex_catch_exception_unhandled:
10385 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10389 case ex_catch_assert:
10390 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
10394 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10399 /* Virtual table for "catch exception" breakpoints. */
10401 static enum print_stop_action
10402 print_it_catch_exception (struct breakpoint *b)
10404 return print_it_exception (ex_catch_exception, b);
10408 print_one_catch_exception (struct breakpoint *b, CORE_ADDR *last_addr)
10410 print_one_exception (ex_catch_exception, b, last_addr);
10414 print_mention_catch_exception (struct breakpoint *b)
10416 print_mention_exception (ex_catch_exception, b);
10419 static struct breakpoint_ops catch_exception_breakpoint_ops =
10423 NULL, /* breakpoint_hit */
10424 print_it_catch_exception,
10425 print_one_catch_exception,
10426 print_mention_catch_exception
10429 /* Virtual table for "catch exception unhandled" breakpoints. */
10431 static enum print_stop_action
10432 print_it_catch_exception_unhandled (struct breakpoint *b)
10434 return print_it_exception (ex_catch_exception_unhandled, b);
10438 print_one_catch_exception_unhandled (struct breakpoint *b, CORE_ADDR *last_addr)
10440 print_one_exception (ex_catch_exception_unhandled, b, last_addr);
10444 print_mention_catch_exception_unhandled (struct breakpoint *b)
10446 print_mention_exception (ex_catch_exception_unhandled, b);
10449 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
10452 NULL, /* breakpoint_hit */
10453 print_it_catch_exception_unhandled,
10454 print_one_catch_exception_unhandled,
10455 print_mention_catch_exception_unhandled
10458 /* Virtual table for "catch assert" breakpoints. */
10460 static enum print_stop_action
10461 print_it_catch_assert (struct breakpoint *b)
10463 return print_it_exception (ex_catch_assert, b);
10467 print_one_catch_assert (struct breakpoint *b, CORE_ADDR *last_addr)
10469 print_one_exception (ex_catch_assert, b, last_addr);
10473 print_mention_catch_assert (struct breakpoint *b)
10475 print_mention_exception (ex_catch_assert, b);
10478 static struct breakpoint_ops catch_assert_breakpoint_ops = {
10481 NULL, /* breakpoint_hit */
10482 print_it_catch_assert,
10483 print_one_catch_assert,
10484 print_mention_catch_assert
10487 /* Return non-zero if B is an Ada exception catchpoint. */
10490 ada_exception_catchpoint_p (struct breakpoint *b)
10492 return (b->ops == &catch_exception_breakpoint_ops
10493 || b->ops == &catch_exception_unhandled_breakpoint_ops
10494 || b->ops == &catch_assert_breakpoint_ops);
10497 /* Return a newly allocated copy of the first space-separated token
10498 in ARGSP, and then adjust ARGSP to point immediately after that
10501 Return NULL if ARGPS does not contain any more tokens. */
10504 ada_get_next_arg (char **argsp)
10506 char *args = *argsp;
10510 /* Skip any leading white space. */
10512 while (isspace (*args))
10515 if (args[0] == '\0')
10516 return NULL; /* No more arguments. */
10518 /* Find the end of the current argument. */
10521 while (*end != '\0' && !isspace (*end))
10524 /* Adjust ARGSP to point to the start of the next argument. */
10528 /* Make a copy of the current argument and return it. */
10530 result = xmalloc (end - args + 1);
10531 strncpy (result, args, end - args);
10532 result[end - args] = '\0';
10537 /* Split the arguments specified in a "catch exception" command.
10538 Set EX to the appropriate catchpoint type.
10539 Set EXP_STRING to the name of the specific exception if
10540 specified by the user. */
10543 catch_ada_exception_command_split (char *args,
10544 enum exception_catchpoint_kind *ex,
10547 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
10548 char *exception_name;
10550 exception_name = ada_get_next_arg (&args);
10551 make_cleanup (xfree, exception_name);
10553 /* Check that we do not have any more arguments. Anything else
10556 while (isspace (*args))
10559 if (args[0] != '\0')
10560 error (_("Junk at end of expression"));
10562 discard_cleanups (old_chain);
10564 if (exception_name == NULL)
10566 /* Catch all exceptions. */
10567 *ex = ex_catch_exception;
10568 *exp_string = NULL;
10570 else if (strcmp (exception_name, "unhandled") == 0)
10572 /* Catch unhandled exceptions. */
10573 *ex = ex_catch_exception_unhandled;
10574 *exp_string = NULL;
10578 /* Catch a specific exception. */
10579 *ex = ex_catch_exception;
10580 *exp_string = exception_name;
10584 /* Return the name of the symbol on which we should break in order to
10585 implement a catchpoint of the EX kind. */
10587 static const char *
10588 ada_exception_sym_name (enum exception_catchpoint_kind ex)
10590 gdb_assert (exception_info != NULL);
10594 case ex_catch_exception:
10595 return (exception_info->catch_exception_sym);
10597 case ex_catch_exception_unhandled:
10598 return (exception_info->catch_exception_unhandled_sym);
10600 case ex_catch_assert:
10601 return (exception_info->catch_assert_sym);
10604 internal_error (__FILE__, __LINE__,
10605 _("unexpected catchpoint kind (%d)"), ex);
10609 /* Return the breakpoint ops "virtual table" used for catchpoints
10612 static struct breakpoint_ops *
10613 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
10617 case ex_catch_exception:
10618 return (&catch_exception_breakpoint_ops);
10620 case ex_catch_exception_unhandled:
10621 return (&catch_exception_unhandled_breakpoint_ops);
10623 case ex_catch_assert:
10624 return (&catch_assert_breakpoint_ops);
10627 internal_error (__FILE__, __LINE__,
10628 _("unexpected catchpoint kind (%d)"), ex);
10632 /* Return the condition that will be used to match the current exception
10633 being raised with the exception that the user wants to catch. This
10634 assumes that this condition is used when the inferior just triggered
10635 an exception catchpoint.
10637 The string returned is a newly allocated string that needs to be
10638 deallocated later. */
10641 ada_exception_catchpoint_cond_string (const char *exp_string)
10645 /* The standard exceptions are a special case. They are defined in
10646 runtime units that have been compiled without debugging info; if
10647 EXP_STRING is the not-fully-qualified name of a standard
10648 exception (e.g. "constraint_error") then, during the evaluation
10649 of the condition expression, the symbol lookup on this name would
10650 *not* return this standard exception. The catchpoint condition
10651 may then be set only on user-defined exceptions which have the
10652 same not-fully-qualified name (e.g. my_package.constraint_error).
10654 To avoid this unexcepted behavior, these standard exceptions are
10655 systematically prefixed by "standard". This means that "catch
10656 exception constraint_error" is rewritten into "catch exception
10657 standard.constraint_error".
10659 If an exception named contraint_error is defined in another package of
10660 the inferior program, then the only way to specify this exception as a
10661 breakpoint condition is to use its fully-qualified named:
10662 e.g. my_package.constraint_error. */
10664 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
10666 if (strcmp (standard_exc [i], exp_string) == 0)
10668 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10672 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
10675 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10677 static struct expression *
10678 ada_parse_catchpoint_condition (char *cond_string,
10679 struct symtab_and_line sal)
10681 return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
10684 /* Return the symtab_and_line that should be used to insert an exception
10685 catchpoint of the TYPE kind.
10687 EX_STRING should contain the name of a specific exception
10688 that the catchpoint should catch, or NULL otherwise.
10690 The idea behind all the remaining parameters is that their names match
10691 the name of certain fields in the breakpoint structure that are used to
10692 handle exception catchpoints. This function returns the value to which
10693 these fields should be set, depending on the type of catchpoint we need
10696 If COND and COND_STRING are both non-NULL, any value they might
10697 hold will be free'ed, and then replaced by newly allocated ones.
10698 These parameters are left untouched otherwise. */
10700 static struct symtab_and_line
10701 ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
10702 char **addr_string, char **cond_string,
10703 struct expression **cond, struct breakpoint_ops **ops)
10705 const char *sym_name;
10706 struct symbol *sym;
10707 struct symtab_and_line sal;
10709 /* First, find out which exception support info to use. */
10710 ada_exception_support_info_sniffer ();
10712 /* Then lookup the function on which we will break in order to catch
10713 the Ada exceptions requested by the user. */
10715 sym_name = ada_exception_sym_name (ex);
10716 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
10718 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10719 that should be compiled with debugging information. As a result, we
10720 expect to find that symbol in the symtabs. If we don't find it, then
10721 the target most likely does not support Ada exceptions, or we cannot
10722 insert exception breakpoints yet, because the GNAT runtime hasn't been
10725 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10726 in such a way that no debugging information is produced for the symbol
10727 we are looking for. In this case, we could search the minimal symbols
10728 as a fall-back mechanism. This would still be operating in degraded
10729 mode, however, as we would still be missing the debugging information
10730 that is needed in order to extract the name of the exception being
10731 raised (this name is printed in the catchpoint message, and is also
10732 used when trying to catch a specific exception). We do not handle
10733 this case for now. */
10736 error (_("Unable to break on '%s' in this configuration."), sym_name);
10738 /* Make sure that the symbol we found corresponds to a function. */
10739 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
10740 error (_("Symbol \"%s\" is not a function (class = %d)"),
10741 sym_name, SYMBOL_CLASS (sym));
10743 sal = find_function_start_sal (sym, 1);
10745 /* Set ADDR_STRING. */
10747 *addr_string = xstrdup (sym_name);
10749 /* Set the COND and COND_STRING (if not NULL). */
10751 if (cond_string != NULL && cond != NULL)
10753 if (*cond_string != NULL)
10755 xfree (*cond_string);
10756 *cond_string = NULL;
10763 if (exp_string != NULL)
10765 *cond_string = ada_exception_catchpoint_cond_string (exp_string);
10766 *cond = ada_parse_catchpoint_condition (*cond_string, sal);
10771 *ops = ada_exception_breakpoint_ops (ex);
10776 /* Parse the arguments (ARGS) of the "catch exception" command.
10778 Set TYPE to the appropriate exception catchpoint type.
10779 If the user asked the catchpoint to catch only a specific
10780 exception, then save the exception name in ADDR_STRING.
10782 See ada_exception_sal for a description of all the remaining
10783 function arguments of this function. */
10785 struct symtab_and_line
10786 ada_decode_exception_location (char *args, char **addr_string,
10787 char **exp_string, char **cond_string,
10788 struct expression **cond,
10789 struct breakpoint_ops **ops)
10791 enum exception_catchpoint_kind ex;
10793 catch_ada_exception_command_split (args, &ex, exp_string);
10794 return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
10798 struct symtab_and_line
10799 ada_decode_assert_location (char *args, char **addr_string,
10800 struct breakpoint_ops **ops)
10802 /* Check that no argument where provided at the end of the command. */
10806 while (isspace (*args))
10809 error (_("Junk at end of arguments."));
10812 return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
10817 /* Information about operators given special treatment in functions
10819 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10821 #define ADA_OPERATORS \
10822 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10823 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10824 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10825 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10826 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10827 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10828 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10829 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10830 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10831 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10832 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10833 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10834 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10835 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10836 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10837 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10838 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10839 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10840 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10843 ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
10845 switch (exp->elts[pc - 1].opcode)
10848 operator_length_standard (exp, pc, oplenp, argsp);
10851 #define OP_DEFN(op, len, args, binop) \
10852 case op: *oplenp = len; *argsp = args; break;
10858 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
10863 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
10869 ada_op_name (enum exp_opcode opcode)
10874 return op_name_standard (opcode);
10876 #define OP_DEFN(op, len, args, binop) case op: return #op;
10881 return "OP_AGGREGATE";
10883 return "OP_CHOICES";
10889 /* As for operator_length, but assumes PC is pointing at the first
10890 element of the operator, and gives meaningful results only for the
10891 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10894 ada_forward_operator_length (struct expression *exp, int pc,
10895 int *oplenp, int *argsp)
10897 switch (exp->elts[pc].opcode)
10900 *oplenp = *argsp = 0;
10903 #define OP_DEFN(op, len, args, binop) \
10904 case op: *oplenp = len; *argsp = args; break;
10910 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
10915 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
10921 int len = longest_to_int (exp->elts[pc + 1].longconst);
10922 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
10930 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
10932 enum exp_opcode op = exp->elts[elt].opcode;
10937 ada_forward_operator_length (exp, elt, &oplen, &nargs);
10941 /* Ada attributes ('Foo). */
10944 case OP_ATR_LENGTH:
10948 case OP_ATR_MODULUS:
10955 case UNOP_IN_RANGE:
10957 /* XXX: gdb_sprint_host_address, type_sprint */
10958 fprintf_filtered (stream, _("Type @"));
10959 gdb_print_host_address (exp->elts[pc + 1].type, stream);
10960 fprintf_filtered (stream, " (");
10961 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
10962 fprintf_filtered (stream, ")");
10964 case BINOP_IN_BOUNDS:
10965 fprintf_filtered (stream, " (%d)",
10966 longest_to_int (exp->elts[pc + 2].longconst));
10968 case TERNOP_IN_RANGE:
10973 case OP_DISCRETE_RANGE:
10974 case OP_POSITIONAL:
10981 char *name = &exp->elts[elt + 2].string;
10982 int len = longest_to_int (exp->elts[elt + 1].longconst);
10983 fprintf_filtered (stream, "Text: `%.*s'", len, name);
10988 return dump_subexp_body_standard (exp, stream, elt);
10992 for (i = 0; i < nargs; i += 1)
10993 elt = dump_subexp (exp, stream, elt);
10998 /* The Ada extension of print_subexp (q.v.). */
11001 ada_print_subexp (struct expression *exp, int *pos,
11002 struct ui_file *stream, enum precedence prec)
11004 int oplen, nargs, i;
11006 enum exp_opcode op = exp->elts[pc].opcode;
11008 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11015 print_subexp_standard (exp, pos, stream, prec);
11019 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
11022 case BINOP_IN_BOUNDS:
11023 /* XXX: sprint_subexp */
11024 print_subexp (exp, pos, stream, PREC_SUFFIX);
11025 fputs_filtered (" in ", stream);
11026 print_subexp (exp, pos, stream, PREC_SUFFIX);
11027 fputs_filtered ("'range", stream);
11028 if (exp->elts[pc + 1].longconst > 1)
11029 fprintf_filtered (stream, "(%ld)",
11030 (long) exp->elts[pc + 1].longconst);
11033 case TERNOP_IN_RANGE:
11034 if (prec >= PREC_EQUAL)
11035 fputs_filtered ("(", stream);
11036 /* XXX: sprint_subexp */
11037 print_subexp (exp, pos, stream, PREC_SUFFIX);
11038 fputs_filtered (" in ", stream);
11039 print_subexp (exp, pos, stream, PREC_EQUAL);
11040 fputs_filtered (" .. ", stream);
11041 print_subexp (exp, pos, stream, PREC_EQUAL);
11042 if (prec >= PREC_EQUAL)
11043 fputs_filtered (")", stream);
11048 case OP_ATR_LENGTH:
11052 case OP_ATR_MODULUS:
11057 if (exp->elts[*pos].opcode == OP_TYPE)
11059 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
11060 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
11064 print_subexp (exp, pos, stream, PREC_SUFFIX);
11065 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
11069 for (tem = 1; tem < nargs; tem += 1)
11071 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
11072 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
11074 fputs_filtered (")", stream);
11079 type_print (exp->elts[pc + 1].type, "", stream, 0);
11080 fputs_filtered ("'(", stream);
11081 print_subexp (exp, pos, stream, PREC_PREFIX);
11082 fputs_filtered (")", stream);
11085 case UNOP_IN_RANGE:
11086 /* XXX: sprint_subexp */
11087 print_subexp (exp, pos, stream, PREC_SUFFIX);
11088 fputs_filtered (" in ", stream);
11089 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
11092 case OP_DISCRETE_RANGE:
11093 print_subexp (exp, pos, stream, PREC_SUFFIX);
11094 fputs_filtered ("..", stream);
11095 print_subexp (exp, pos, stream, PREC_SUFFIX);
11099 fputs_filtered ("others => ", stream);
11100 print_subexp (exp, pos, stream, PREC_SUFFIX);
11104 for (i = 0; i < nargs-1; i += 1)
11107 fputs_filtered ("|", stream);
11108 print_subexp (exp, pos, stream, PREC_SUFFIX);
11110 fputs_filtered (" => ", stream);
11111 print_subexp (exp, pos, stream, PREC_SUFFIX);
11114 case OP_POSITIONAL:
11115 print_subexp (exp, pos, stream, PREC_SUFFIX);
11119 fputs_filtered ("(", stream);
11120 for (i = 0; i < nargs; i += 1)
11123 fputs_filtered (", ", stream);
11124 print_subexp (exp, pos, stream, PREC_SUFFIX);
11126 fputs_filtered (")", stream);
11131 /* Table mapping opcodes into strings for printing operators
11132 and precedences of the operators. */
11134 static const struct op_print ada_op_print_tab[] = {
11135 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
11136 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
11137 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
11138 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
11139 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
11140 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
11141 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
11142 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
11143 {"<=", BINOP_LEQ, PREC_ORDER, 0},
11144 {">=", BINOP_GEQ, PREC_ORDER, 0},
11145 {">", BINOP_GTR, PREC_ORDER, 0},
11146 {"<", BINOP_LESS, PREC_ORDER, 0},
11147 {">>", BINOP_RSH, PREC_SHIFT, 0},
11148 {"<<", BINOP_LSH, PREC_SHIFT, 0},
11149 {"+", BINOP_ADD, PREC_ADD, 0},
11150 {"-", BINOP_SUB, PREC_ADD, 0},
11151 {"&", BINOP_CONCAT, PREC_ADD, 0},
11152 {"*", BINOP_MUL, PREC_MUL, 0},
11153 {"/", BINOP_DIV, PREC_MUL, 0},
11154 {"rem", BINOP_REM, PREC_MUL, 0},
11155 {"mod", BINOP_MOD, PREC_MUL, 0},
11156 {"**", BINOP_EXP, PREC_REPEAT, 0},
11157 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
11158 {"-", UNOP_NEG, PREC_PREFIX, 0},
11159 {"+", UNOP_PLUS, PREC_PREFIX, 0},
11160 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
11161 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
11162 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
11163 {".all", UNOP_IND, PREC_SUFFIX, 1},
11164 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
11165 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
11169 enum ada_primitive_types {
11170 ada_primitive_type_int,
11171 ada_primitive_type_long,
11172 ada_primitive_type_short,
11173 ada_primitive_type_char,
11174 ada_primitive_type_float,
11175 ada_primitive_type_double,
11176 ada_primitive_type_void,
11177 ada_primitive_type_long_long,
11178 ada_primitive_type_long_double,
11179 ada_primitive_type_natural,
11180 ada_primitive_type_positive,
11181 ada_primitive_type_system_address,
11182 nr_ada_primitive_types
11186 ada_language_arch_info (struct gdbarch *gdbarch,
11187 struct language_arch_info *lai)
11189 const struct builtin_type *builtin = builtin_type (gdbarch);
11190 lai->primitive_type_vector
11191 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
11193 lai->primitive_type_vector [ada_primitive_type_int] =
11194 init_type (TYPE_CODE_INT,
11195 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
11196 0, "integer", (struct objfile *) NULL);
11197 lai->primitive_type_vector [ada_primitive_type_long] =
11198 init_type (TYPE_CODE_INT,
11199 gdbarch_long_bit (gdbarch) / TARGET_CHAR_BIT,
11200 0, "long_integer", (struct objfile *) NULL);
11201 lai->primitive_type_vector [ada_primitive_type_short] =
11202 init_type (TYPE_CODE_INT,
11203 gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
11204 0, "short_integer", (struct objfile *) NULL);
11205 lai->string_char_type =
11206 lai->primitive_type_vector [ada_primitive_type_char] =
11207 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
11208 0, "character", (struct objfile *) NULL);
11209 lai->primitive_type_vector [ada_primitive_type_float] =
11210 init_type (TYPE_CODE_FLT,
11211 gdbarch_float_bit (gdbarch)/ TARGET_CHAR_BIT,
11212 0, "float", (struct objfile *) NULL);
11213 lai->primitive_type_vector [ada_primitive_type_double] =
11214 init_type (TYPE_CODE_FLT,
11215 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
11216 0, "long_float", (struct objfile *) NULL);
11217 lai->primitive_type_vector [ada_primitive_type_long_long] =
11218 init_type (TYPE_CODE_INT,
11219 gdbarch_long_long_bit (gdbarch) / TARGET_CHAR_BIT,
11220 0, "long_long_integer", (struct objfile *) NULL);
11221 lai->primitive_type_vector [ada_primitive_type_long_double] =
11222 init_type (TYPE_CODE_FLT,
11223 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
11224 0, "long_long_float", (struct objfile *) NULL);
11225 lai->primitive_type_vector [ada_primitive_type_natural] =
11226 init_type (TYPE_CODE_INT,
11227 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
11228 0, "natural", (struct objfile *) NULL);
11229 lai->primitive_type_vector [ada_primitive_type_positive] =
11230 init_type (TYPE_CODE_INT,
11231 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
11232 0, "positive", (struct objfile *) NULL);
11233 lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
11235 lai->primitive_type_vector [ada_primitive_type_system_address] =
11236 lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
11237 (struct objfile *) NULL));
11238 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
11239 = "system__address";
11241 lai->bool_type_symbol = NULL;
11242 lai->bool_type_default = builtin->builtin_bool;
11245 /* Language vector */
11247 /* Not really used, but needed in the ada_language_defn. */
11250 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
11252 ada_emit_char (c, type, stream, quoter, 1);
11258 warnings_issued = 0;
11259 return ada_parse ();
11262 static const struct exp_descriptor ada_exp_descriptor = {
11264 ada_operator_length,
11266 ada_dump_subexp_body,
11267 ada_evaluate_subexp
11270 const struct language_defn ada_language_defn = {
11271 "ada", /* Language name */
11275 case_sensitive_on, /* Yes, Ada is case-insensitive, but
11276 that's not quite what this means. */
11278 macro_expansion_no,
11279 &ada_exp_descriptor,
11283 ada_printchar, /* Print a character constant */
11284 ada_printstr, /* Function to print string constant */
11285 emit_char, /* Function to print single char (not used) */
11286 ada_print_type, /* Print a type using appropriate syntax */
11287 default_print_typedef, /* Print a typedef using appropriate syntax */
11288 ada_val_print, /* Print a value using appropriate syntax */
11289 ada_value_print, /* Print a top-level value */
11290 NULL, /* Language specific skip_trampoline */
11291 NULL, /* name_of_this */
11292 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
11293 basic_lookup_transparent_type, /* lookup_transparent_type */
11294 ada_la_decode, /* Language specific symbol demangler */
11295 NULL, /* Language specific class_name_from_physname */
11296 ada_op_print_tab, /* expression operators for printing */
11297 0, /* c-style arrays */
11298 1, /* String lower bound */
11299 ada_get_gdb_completer_word_break_characters,
11300 ada_make_symbol_completion_list,
11301 ada_language_arch_info,
11302 ada_print_array_index,
11303 default_pass_by_reference,
11308 /* Provide a prototype to silence -Wmissing-prototypes. */
11309 extern initialize_file_ftype _initialize_ada_language;
11312 _initialize_ada_language (void)
11314 add_language (&ada_language_defn);
11316 varsize_limit = 65536;
11318 obstack_init (&symbol_list_obstack);
11320 decoded_names_store = htab_create_alloc
11321 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
11322 NULL, xcalloc, xfree);
11324 observer_attach_executable_changed (ada_executable_changed_observer);