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_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 symtab *symtab_for_sym (struct symbol *);
131 static struct value *resolve_subexp (struct expression **, int *, int,
134 static void replace_operator_with_call (struct expression **, int, int, int,
135 struct symbol *, struct block *);
137 static int possible_user_operator_p (enum exp_opcode, struct value **);
139 static char *ada_op_name (enum exp_opcode);
141 static const char *ada_decoded_op_name (enum exp_opcode);
143 static int numeric_type_p (struct type *);
145 static int integer_type_p (struct type *);
147 static int scalar_type_p (struct type *);
149 static int discrete_type_p (struct type *);
151 static enum ada_renaming_category parse_old_style_renaming (struct type *,
156 static struct symbol *find_old_style_renaming_symbol (const char *,
159 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
162 static struct value *evaluate_subexp (struct type *, struct expression *,
165 static struct value *evaluate_subexp_type (struct expression *, int *);
167 static int is_dynamic_field (struct type *, int);
169 static struct type *to_fixed_variant_branch_type (struct type *,
171 CORE_ADDR, struct value *);
173 static struct type *to_fixed_array_type (struct type *, struct value *, int);
175 static struct type *to_fixed_range_type (char *, struct value *,
178 static struct type *to_static_fixed_type (struct type *);
179 static struct type *static_unwrap_type (struct type *type);
181 static struct value *unwrap_value (struct value *);
183 static struct type *packed_array_type (struct type *, long *);
185 static struct type *decode_packed_array_type (struct type *);
187 static struct value *decode_packed_array (struct value *);
189 static struct value *value_subscript_packed (struct value *, int,
192 static void move_bits (gdb_byte *, int, const gdb_byte *, int, int);
194 static struct value *coerce_unspec_val_to_type (struct value *,
197 static struct value *get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol *, struct symbol *);
201 static int equiv_types (struct type *, struct type *);
203 static int is_name_suffix (const char *);
205 static int wild_match (const char *, int, const char *);
207 static struct value *ada_coerce_ref (struct value *);
209 static LONGEST pos_atr (struct value *);
211 static struct value *value_pos_atr (struct type *, struct value *);
213 static struct value *value_val_atr (struct type *, struct value *);
215 static struct symbol *standard_lookup (const char *, const struct block *,
218 static struct value *ada_search_struct_field (char *, struct value *, int,
221 static struct value *ada_value_primitive_field (struct value *, int, int,
224 static int find_struct_field (char *, struct type *, int,
225 struct type **, int *, int *, int *, int *);
227 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
230 static struct value *ada_to_fixed_value (struct value *);
232 static int ada_resolve_function (struct ada_symbol_info *, int,
233 struct value **, int, const char *,
236 static struct value *ada_coerce_to_simple_array (struct value *);
238 static int ada_is_direct_array_type (struct type *);
240 static void ada_language_arch_info (struct gdbarch *,
241 struct language_arch_info *);
243 static void check_size (const struct type *);
245 static struct value *ada_index_struct_field (int, struct value *, int,
248 static struct value *assign_aggregate (struct value *, struct value *,
249 struct expression *, int *, enum noside);
251 static void aggregate_assign_from_choices (struct value *, struct value *,
253 int *, LONGEST *, int *,
254 int, LONGEST, LONGEST);
256 static void aggregate_assign_positional (struct value *, struct value *,
258 int *, LONGEST *, int *, int,
262 static void aggregate_assign_others (struct value *, struct value *,
264 int *, LONGEST *, int, LONGEST, LONGEST);
267 static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
270 static struct value *ada_evaluate_subexp (struct type *, struct expression *,
273 static void ada_forward_operator_length (struct expression *, int, int *,
278 /* Maximum-sized dynamic type. */
279 static unsigned int varsize_limit;
281 /* FIXME: brobecker/2003-09-17: No longer a const because it is
282 returned by a function that does not return a const char *. */
283 static char *ada_completer_word_break_characters =
285 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
287 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
290 /* The name of the symbol to use to get the name of the main subprogram. */
291 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
292 = "__gnat_ada_main_program_name";
294 /* Limit on the number of warnings to raise per expression evaluation. */
295 static int warning_limit = 2;
297 /* Number of warning messages issued; reset to 0 by cleanups after
298 expression evaluation. */
299 static int warnings_issued = 0;
301 static const char *known_runtime_file_name_patterns[] = {
302 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
305 static const char *known_auxiliary_function_name_patterns[] = {
306 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
309 /* Space for allocating results of ada_lookup_symbol_list. */
310 static struct obstack symbol_list_obstack;
314 /* Given DECODED_NAME a string holding a symbol name in its
315 decoded form (ie using the Ada dotted notation), returns
316 its unqualified name. */
319 ada_unqualified_name (const char *decoded_name)
321 const char *result = strrchr (decoded_name, '.');
324 result++; /* Skip the dot... */
326 result = decoded_name;
331 /* Return a string starting with '<', followed by STR, and '>'.
332 The result is good until the next call. */
335 add_angle_brackets (const char *str)
337 static char *result = NULL;
340 result = (char *) xmalloc ((strlen (str) + 3) * sizeof (char));
342 sprintf (result, "<%s>", str);
347 ada_get_gdb_completer_word_break_characters (void)
349 return ada_completer_word_break_characters;
352 /* Print an array element index using the Ada syntax. */
355 ada_print_array_index (struct value *index_value, struct ui_file *stream,
356 const struct value_print_options *options)
358 LA_VALUE_PRINT (index_value, stream, options);
359 fprintf_filtered (stream, " => ");
362 /* Read the string located at ADDR from the inferior and store the
366 extract_string (CORE_ADDR addr, char *buf)
370 /* Loop, reading one byte at a time, until we reach the '\000'
371 end-of-string marker. */
374 target_read_memory (addr + char_index * sizeof (char),
375 buf + char_index * sizeof (char), sizeof (char));
378 while (buf[char_index - 1] != '\000');
381 /* Assuming VECT points to an array of *SIZE objects of size
382 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
383 updating *SIZE as necessary and returning the (new) array. */
386 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
388 if (*size < min_size)
391 if (*size < min_size)
393 vect = xrealloc (vect, *size * element_size);
398 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
399 suffix of FIELD_NAME beginning "___". */
402 field_name_match (const char *field_name, const char *target)
404 int len = strlen (target);
406 (strncmp (field_name, target, len) == 0
407 && (field_name[len] == '\0'
408 || (strncmp (field_name + len, "___", 3) == 0
409 && strcmp (field_name + strlen (field_name) - 6,
414 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
415 FIELD_NAME, and return its index. This function also handles fields
416 whose name have ___ suffixes because the compiler sometimes alters
417 their name by adding such a suffix to represent fields with certain
418 constraints. If the field could not be found, return a negative
419 number if MAYBE_MISSING is set. Otherwise raise an error. */
422 ada_get_field_index (const struct type *type, const char *field_name,
426 for (fieldno = 0; fieldno < TYPE_NFIELDS (type); fieldno++)
427 if (field_name_match (TYPE_FIELD_NAME (type, fieldno), field_name))
431 error (_("Unable to find field %s in struct %s. Aborting"),
432 field_name, TYPE_NAME (type));
437 /* The length of the prefix of NAME prior to any "___" suffix. */
440 ada_name_prefix_len (const char *name)
446 const char *p = strstr (name, "___");
448 return strlen (name);
454 /* Return non-zero if SUFFIX is a suffix of STR.
455 Return zero if STR is null. */
458 is_suffix (const char *str, const char *suffix)
464 len2 = strlen (suffix);
465 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
468 /* The contents of value VAL, treated as a value of type TYPE. The
469 result is an lval in memory if VAL is. */
471 static struct value *
472 coerce_unspec_val_to_type (struct value *val, struct type *type)
474 type = ada_check_typedef (type);
475 if (value_type (val) == type)
479 struct value *result;
481 /* Make sure that the object size is not unreasonable before
482 trying to allocate some memory for it. */
485 result = allocate_value (type);
486 set_value_component_location (result, val);
487 set_value_bitsize (result, value_bitsize (val));
488 set_value_bitpos (result, value_bitpos (val));
489 VALUE_ADDRESS (result) += value_offset (val);
491 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
492 set_value_lazy (result, 1);
494 memcpy (value_contents_raw (result), value_contents (val),
500 static const gdb_byte *
501 cond_offset_host (const gdb_byte *valaddr, long offset)
506 return valaddr + offset;
510 cond_offset_target (CORE_ADDR address, long offset)
515 return address + offset;
518 /* Issue a warning (as for the definition of warning in utils.c, but
519 with exactly one argument rather than ...), unless the limit on the
520 number of warnings has passed during the evaluation of the current
523 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
524 provided by "complaint". */
525 static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
528 lim_warning (const char *format, ...)
531 va_start (args, format);
533 warnings_issued += 1;
534 if (warnings_issued <= warning_limit)
535 vwarning (format, args);
540 /* Issue an error if the size of an object of type T is unreasonable,
541 i.e. if it would be a bad idea to allocate a value of this type in
545 check_size (const struct type *type)
547 if (TYPE_LENGTH (type) > varsize_limit)
548 error (_("object size is larger than varsize-limit"));
552 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
553 gdbtypes.h, but some of the necessary definitions in that file
554 seem to have gone missing. */
556 /* Maximum value of a SIZE-byte signed integer type. */
558 max_of_size (int size)
560 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
561 return top_bit | (top_bit - 1);
564 /* Minimum value of a SIZE-byte signed integer type. */
566 min_of_size (int size)
568 return -max_of_size (size) - 1;
571 /* Maximum value of a SIZE-byte unsigned integer type. */
573 umax_of_size (int size)
575 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
576 return top_bit | (top_bit - 1);
579 /* Maximum value of integral type T, as a signed quantity. */
581 max_of_type (struct type *t)
583 if (TYPE_UNSIGNED (t))
584 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
586 return max_of_size (TYPE_LENGTH (t));
589 /* Minimum value of integral type T, as a signed quantity. */
591 min_of_type (struct type *t)
593 if (TYPE_UNSIGNED (t))
596 return min_of_size (TYPE_LENGTH (t));
599 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
601 discrete_type_high_bound (struct type *type)
603 switch (TYPE_CODE (type))
605 case TYPE_CODE_RANGE:
606 return TYPE_HIGH_BOUND (type);
608 return TYPE_FIELD_BITPOS (type, TYPE_NFIELDS (type) - 1);
613 return max_of_type (type);
615 error (_("Unexpected type in discrete_type_high_bound."));
619 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
621 discrete_type_low_bound (struct type *type)
623 switch (TYPE_CODE (type))
625 case TYPE_CODE_RANGE:
626 return TYPE_LOW_BOUND (type);
628 return TYPE_FIELD_BITPOS (type, 0);
633 return min_of_type (type);
635 error (_("Unexpected type in discrete_type_low_bound."));
639 /* The identity on non-range types. For range types, the underlying
640 non-range scalar type. */
643 base_type (struct type *type)
645 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
647 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
649 type = TYPE_TARGET_TYPE (type);
655 /* Language Selection */
657 /* If the main program is in Ada, return language_ada, otherwise return LANG
658 (the main program is in Ada iif the adainit symbol is found).
660 MAIN_PST is not used. */
663 ada_update_initial_language (enum language lang,
664 struct partial_symtab *main_pst)
666 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
667 (struct objfile *) NULL) != NULL)
673 /* If the main procedure is written in Ada, then return its name.
674 The result is good until the next call. Return NULL if the main
675 procedure doesn't appear to be in Ada. */
680 struct minimal_symbol *msym;
681 CORE_ADDR main_program_name_addr;
682 static char main_program_name[1024];
684 /* For Ada, the name of the main procedure is stored in a specific
685 string constant, generated by the binder. Look for that symbol,
686 extract its address, and then read that string. If we didn't find
687 that string, then most probably the main procedure is not written
689 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
693 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
694 if (main_program_name_addr == 0)
695 error (_("Invalid address for Ada main program name."));
697 extract_string (main_program_name_addr, main_program_name);
698 return main_program_name;
701 /* The main procedure doesn't seem to be in Ada. */
707 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
710 const struct ada_opname_map ada_opname_table[] = {
711 {"Oadd", "\"+\"", BINOP_ADD},
712 {"Osubtract", "\"-\"", BINOP_SUB},
713 {"Omultiply", "\"*\"", BINOP_MUL},
714 {"Odivide", "\"/\"", BINOP_DIV},
715 {"Omod", "\"mod\"", BINOP_MOD},
716 {"Orem", "\"rem\"", BINOP_REM},
717 {"Oexpon", "\"**\"", BINOP_EXP},
718 {"Olt", "\"<\"", BINOP_LESS},
719 {"Ole", "\"<=\"", BINOP_LEQ},
720 {"Ogt", "\">\"", BINOP_GTR},
721 {"Oge", "\">=\"", BINOP_GEQ},
722 {"Oeq", "\"=\"", BINOP_EQUAL},
723 {"One", "\"/=\"", BINOP_NOTEQUAL},
724 {"Oand", "\"and\"", BINOP_BITWISE_AND},
725 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
726 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
727 {"Oconcat", "\"&\"", BINOP_CONCAT},
728 {"Oabs", "\"abs\"", UNOP_ABS},
729 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
730 {"Oadd", "\"+\"", UNOP_PLUS},
731 {"Osubtract", "\"-\"", UNOP_NEG},
735 /* The "encoded" form of DECODED, according to GNAT conventions.
736 The result is valid until the next call to ada_encode. */
739 ada_encode (const char *decoded)
741 static char *encoding_buffer = NULL;
742 static size_t encoding_buffer_size = 0;
749 GROW_VECT (encoding_buffer, encoding_buffer_size,
750 2 * strlen (decoded) + 10);
753 for (p = decoded; *p != '\0'; p += 1)
757 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
762 const struct ada_opname_map *mapping;
764 for (mapping = ada_opname_table;
765 mapping->encoded != NULL
766 && strncmp (mapping->decoded, p,
767 strlen (mapping->decoded)) != 0; mapping += 1)
769 if (mapping->encoded == NULL)
770 error (_("invalid Ada operator name: %s"), p);
771 strcpy (encoding_buffer + k, mapping->encoded);
772 k += strlen (mapping->encoded);
777 encoding_buffer[k] = *p;
782 encoding_buffer[k] = '\0';
783 return encoding_buffer;
786 /* Return NAME folded to lower case, or, if surrounded by single
787 quotes, unfolded, but with the quotes stripped away. Result good
791 ada_fold_name (const char *name)
793 static char *fold_buffer = NULL;
794 static size_t fold_buffer_size = 0;
796 int len = strlen (name);
797 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
801 strncpy (fold_buffer, name + 1, len - 2);
802 fold_buffer[len - 2] = '\000';
807 for (i = 0; i <= len; i += 1)
808 fold_buffer[i] = tolower (name[i]);
814 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
817 is_lower_alphanum (const char c)
819 return (isdigit (c) || (isalpha (c) && islower (c)));
822 /* Remove either of these suffixes:
827 These are suffixes introduced by the compiler for entities such as
828 nested subprogram for instance, in order to avoid name clashes.
829 They do not serve any purpose for the debugger. */
832 ada_remove_trailing_digits (const char *encoded, int *len)
834 if (*len > 1 && isdigit (encoded[*len - 1]))
837 while (i > 0 && isdigit (encoded[i]))
839 if (i >= 0 && encoded[i] == '.')
841 else if (i >= 0 && encoded[i] == '$')
843 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
845 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
850 /* Remove the suffix introduced by the compiler for protected object
854 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
856 /* Remove trailing N. */
858 /* Protected entry subprograms are broken into two
859 separate subprograms: The first one is unprotected, and has
860 a 'N' suffix; the second is the protected version, and has
861 the 'P' suffix. The second calls the first one after handling
862 the protection. Since the P subprograms are internally generated,
863 we leave these names undecoded, giving the user a clue that this
864 entity is internal. */
867 && encoded[*len - 1] == 'N'
868 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
872 /* If ENCODED follows the GNAT entity encoding conventions, then return
873 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
876 The resulting string is valid until the next call of ada_decode.
877 If the string is unchanged by decoding, the original string pointer
881 ada_decode (const char *encoded)
888 static char *decoding_buffer = NULL;
889 static size_t decoding_buffer_size = 0;
891 /* The name of the Ada main procedure starts with "_ada_".
892 This prefix is not part of the decoded name, so skip this part
893 if we see this prefix. */
894 if (strncmp (encoded, "_ada_", 5) == 0)
897 /* If the name starts with '_', then it is not a properly encoded
898 name, so do not attempt to decode it. Similarly, if the name
899 starts with '<', the name should not be decoded. */
900 if (encoded[0] == '_' || encoded[0] == '<')
903 len0 = strlen (encoded);
905 ada_remove_trailing_digits (encoded, &len0);
906 ada_remove_po_subprogram_suffix (encoded, &len0);
908 /* Remove the ___X.* suffix if present. Do not forget to verify that
909 the suffix is located before the current "end" of ENCODED. We want
910 to avoid re-matching parts of ENCODED that have previously been
911 marked as discarded (by decrementing LEN0). */
912 p = strstr (encoded, "___");
913 if (p != NULL && p - encoded < len0 - 3)
921 /* Remove any trailing TKB suffix. It tells us that this symbol
922 is for the body of a task, but that information does not actually
923 appear in the decoded name. */
925 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
928 /* Remove trailing "B" suffixes. */
929 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
931 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
934 /* Make decoded big enough for possible expansion by operator name. */
936 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
937 decoded = decoding_buffer;
939 /* Remove trailing __{digit}+ or trailing ${digit}+. */
941 if (len0 > 1 && isdigit (encoded[len0 - 1]))
944 while ((i >= 0 && isdigit (encoded[i]))
945 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
947 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
949 else if (encoded[i] == '$')
953 /* The first few characters that are not alphabetic are not part
954 of any encoding we use, so we can copy them over verbatim. */
956 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
957 decoded[j] = encoded[i];
962 /* Is this a symbol function? */
963 if (at_start_name && encoded[i] == 'O')
966 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
968 int op_len = strlen (ada_opname_table[k].encoded);
969 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
971 && !isalnum (encoded[i + op_len]))
973 strcpy (decoded + j, ada_opname_table[k].decoded);
976 j += strlen (ada_opname_table[k].decoded);
980 if (ada_opname_table[k].encoded != NULL)
985 /* Replace "TK__" with "__", which will eventually be translated
986 into "." (just below). */
988 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
991 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
992 be translated into "." (just below). These are internal names
993 generated for anonymous blocks inside which our symbol is nested. */
995 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
996 && encoded [i+2] == 'B' && encoded [i+3] == '_'
997 && isdigit (encoded [i+4]))
1001 while (k < len0 && isdigit (encoded[k]))
1002 k++; /* Skip any extra digit. */
1004 /* Double-check that the "__B_{DIGITS}+" sequence we found
1005 is indeed followed by "__". */
1006 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1010 /* Remove _E{DIGITS}+[sb] */
1012 /* Just as for protected object subprograms, there are 2 categories
1013 of subprograms created by the compiler for each entry. The first
1014 one implements the actual entry code, and has a suffix following
1015 the convention above; the second one implements the barrier and
1016 uses the same convention as above, except that the 'E' is replaced
1019 Just as above, we do not decode the name of barrier functions
1020 to give the user a clue that the code he is debugging has been
1021 internally generated. */
1023 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1024 && isdigit (encoded[i+2]))
1028 while (k < len0 && isdigit (encoded[k]))
1032 && (encoded[k] == 'b' || encoded[k] == 's'))
1035 /* Just as an extra precaution, make sure that if this
1036 suffix is followed by anything else, it is a '_'.
1037 Otherwise, we matched this sequence by accident. */
1039 || (k < len0 && encoded[k] == '_'))
1044 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1045 the GNAT front-end in protected object subprograms. */
1048 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1050 /* Backtrack a bit up until we reach either the begining of
1051 the encoded name, or "__". Make sure that we only find
1052 digits or lowercase characters. */
1053 const char *ptr = encoded + i - 1;
1055 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1058 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1062 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1064 /* This is a X[bn]* sequence not separated from the previous
1065 part of the name with a non-alpha-numeric character (in other
1066 words, immediately following an alpha-numeric character), then
1067 verify that it is placed at the end of the encoded name. If
1068 not, then the encoding is not valid and we should abort the
1069 decoding. Otherwise, just skip it, it is used in body-nested
1073 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1077 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1079 /* Replace '__' by '.'. */
1087 /* It's a character part of the decoded name, so just copy it
1089 decoded[j] = encoded[i];
1094 decoded[j] = '\000';
1096 /* Decoded names should never contain any uppercase character.
1097 Double-check this, and abort the decoding if we find one. */
1099 for (i = 0; decoded[i] != '\0'; i += 1)
1100 if (isupper (decoded[i]) || decoded[i] == ' ')
1103 if (strcmp (decoded, encoded) == 0)
1109 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1110 decoded = decoding_buffer;
1111 if (encoded[0] == '<')
1112 strcpy (decoded, encoded);
1114 sprintf (decoded, "<%s>", encoded);
1119 /* Table for keeping permanent unique copies of decoded names. Once
1120 allocated, names in this table are never released. While this is a
1121 storage leak, it should not be significant unless there are massive
1122 changes in the set of decoded names in successive versions of a
1123 symbol table loaded during a single session. */
1124 static struct htab *decoded_names_store;
1126 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1127 in the language-specific part of GSYMBOL, if it has not been
1128 previously computed. Tries to save the decoded name in the same
1129 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1130 in any case, the decoded symbol has a lifetime at least that of
1132 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1133 const, but nevertheless modified to a semantically equivalent form
1134 when a decoded name is cached in it.
1138 ada_decode_symbol (const struct general_symbol_info *gsymbol)
1141 (char **) &gsymbol->language_specific.cplus_specific.demangled_name;
1142 if (*resultp == NULL)
1144 const char *decoded = ada_decode (gsymbol->name);
1145 if (gsymbol->obj_section != NULL)
1147 struct objfile *objf = gsymbol->obj_section->objfile;
1148 *resultp = obsavestring (decoded, strlen (decoded),
1149 &objf->objfile_obstack);
1151 /* Sometimes, we can't find a corresponding objfile, in which
1152 case, we put the result on the heap. Since we only decode
1153 when needed, we hope this usually does not cause a
1154 significant memory leak (FIXME). */
1155 if (*resultp == NULL)
1157 char **slot = (char **) htab_find_slot (decoded_names_store,
1160 *slot = xstrdup (decoded);
1169 ada_la_decode (const char *encoded, int options)
1171 return xstrdup (ada_decode (encoded));
1174 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1175 suffixes that encode debugging information or leading _ada_ on
1176 SYM_NAME (see is_name_suffix commentary for the debugging
1177 information that is ignored). If WILD, then NAME need only match a
1178 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1179 either argument is NULL. */
1182 ada_match_name (const char *sym_name, const char *name, int wild)
1184 if (sym_name == NULL || name == NULL)
1187 return wild_match (name, strlen (name), sym_name);
1190 int len_name = strlen (name);
1191 return (strncmp (sym_name, name, len_name) == 0
1192 && is_name_suffix (sym_name + len_name))
1193 || (strncmp (sym_name, "_ada_", 5) == 0
1194 && strncmp (sym_name + 5, name, len_name) == 0
1195 && is_name_suffix (sym_name + len_name + 5));
1202 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1204 static char *bound_name[] = {
1205 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1206 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1209 /* Maximum number of array dimensions we are prepared to handle. */
1211 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1213 /* Like modify_field, but allows bitpos > wordlength. */
1216 modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
1218 modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
1222 /* The desc_* routines return primitive portions of array descriptors
1225 /* The descriptor or array type, if any, indicated by TYPE; removes
1226 level of indirection, if needed. */
1228 static struct type *
1229 desc_base_type (struct type *type)
1233 type = ada_check_typedef (type);
1235 && (TYPE_CODE (type) == TYPE_CODE_PTR
1236 || TYPE_CODE (type) == TYPE_CODE_REF))
1237 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1242 /* True iff TYPE indicates a "thin" array pointer type. */
1245 is_thin_pntr (struct type *type)
1248 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1249 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1252 /* The descriptor type for thin pointer type TYPE. */
1254 static struct type *
1255 thin_descriptor_type (struct type *type)
1257 struct type *base_type = desc_base_type (type);
1258 if (base_type == NULL)
1260 if (is_suffix (ada_type_name (base_type), "___XVE"))
1264 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1265 if (alt_type == NULL)
1272 /* A pointer to the array data for thin-pointer value VAL. */
1274 static struct value *
1275 thin_data_pntr (struct value *val)
1277 struct type *type = value_type (val);
1278 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1279 return value_cast (desc_data_type (thin_descriptor_type (type)),
1282 return value_from_longest (desc_data_type (thin_descriptor_type (type)),
1283 VALUE_ADDRESS (val) + value_offset (val));
1286 /* True iff TYPE indicates a "thick" array pointer type. */
1289 is_thick_pntr (struct type *type)
1291 type = desc_base_type (type);
1292 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1293 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1296 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1297 pointer to one, the type of its bounds data; otherwise, NULL. */
1299 static struct type *
1300 desc_bounds_type (struct type *type)
1304 type = desc_base_type (type);
1308 else if (is_thin_pntr (type))
1310 type = thin_descriptor_type (type);
1313 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1315 return ada_check_typedef (r);
1317 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1319 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1321 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1326 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1327 one, a pointer to its bounds data. Otherwise NULL. */
1329 static struct value *
1330 desc_bounds (struct value *arr)
1332 struct type *type = ada_check_typedef (value_type (arr));
1333 if (is_thin_pntr (type))
1335 struct type *bounds_type =
1336 desc_bounds_type (thin_descriptor_type (type));
1339 if (bounds_type == NULL)
1340 error (_("Bad GNAT array descriptor"));
1342 /* NOTE: The following calculation is not really kosher, but
1343 since desc_type is an XVE-encoded type (and shouldn't be),
1344 the correct calculation is a real pain. FIXME (and fix GCC). */
1345 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1346 addr = value_as_long (arr);
1348 addr = VALUE_ADDRESS (arr) + value_offset (arr);
1351 value_from_longest (lookup_pointer_type (bounds_type),
1352 addr - TYPE_LENGTH (bounds_type));
1355 else if (is_thick_pntr (type))
1356 return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1357 _("Bad GNAT array descriptor"));
1362 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1363 position of the field containing the address of the bounds data. */
1366 fat_pntr_bounds_bitpos (struct type *type)
1368 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1371 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1372 size of the field containing the address of the bounds data. */
1375 fat_pntr_bounds_bitsize (struct type *type)
1377 type = desc_base_type (type);
1379 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1380 return TYPE_FIELD_BITSIZE (type, 1);
1382 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1385 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1386 pointer to one, the type of its array data (a
1387 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1388 ada_type_of_array to get an array type with bounds data. */
1390 static struct type *
1391 desc_data_type (struct type *type)
1393 type = desc_base_type (type);
1395 /* NOTE: The following is bogus; see comment in desc_bounds. */
1396 if (is_thin_pntr (type))
1397 return lookup_pointer_type
1398 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)));
1399 else if (is_thick_pntr (type))
1400 return lookup_struct_elt_type (type, "P_ARRAY", 1);
1405 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1408 static struct value *
1409 desc_data (struct value *arr)
1411 struct type *type = value_type (arr);
1412 if (is_thin_pntr (type))
1413 return thin_data_pntr (arr);
1414 else if (is_thick_pntr (type))
1415 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1416 _("Bad GNAT array descriptor"));
1422 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1423 position of the field containing the address of the data. */
1426 fat_pntr_data_bitpos (struct type *type)
1428 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1431 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1432 size of the field containing the address of the data. */
1435 fat_pntr_data_bitsize (struct type *type)
1437 type = desc_base_type (type);
1439 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1440 return TYPE_FIELD_BITSIZE (type, 0);
1442 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1445 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1446 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1447 bound, if WHICH is 1. The first bound is I=1. */
1449 static struct value *
1450 desc_one_bound (struct value *bounds, int i, int which)
1452 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1453 _("Bad GNAT array descriptor bounds"));
1456 /* If BOUNDS is an array-bounds structure type, return the bit position
1457 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1458 bound, if WHICH is 1. The first bound is I=1. */
1461 desc_bound_bitpos (struct type *type, int i, int which)
1463 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1466 /* If BOUNDS is an array-bounds structure type, return the bit field size
1467 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1468 bound, if WHICH is 1. The first bound is I=1. */
1471 desc_bound_bitsize (struct type *type, int i, int which)
1473 type = desc_base_type (type);
1475 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1476 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1478 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1481 /* If TYPE is the type of an array-bounds structure, the type of its
1482 Ith bound (numbering from 1). Otherwise, NULL. */
1484 static struct type *
1485 desc_index_type (struct type *type, int i)
1487 type = desc_base_type (type);
1489 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1490 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1495 /* The number of index positions in the array-bounds type TYPE.
1496 Return 0 if TYPE is NULL. */
1499 desc_arity (struct type *type)
1501 type = desc_base_type (type);
1504 return TYPE_NFIELDS (type) / 2;
1508 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1509 an array descriptor type (representing an unconstrained array
1513 ada_is_direct_array_type (struct type *type)
1517 type = ada_check_typedef (type);
1518 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1519 || ada_is_array_descriptor_type (type));
1522 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1526 ada_is_array_type (struct type *type)
1529 && (TYPE_CODE (type) == TYPE_CODE_PTR
1530 || TYPE_CODE (type) == TYPE_CODE_REF))
1531 type = TYPE_TARGET_TYPE (type);
1532 return ada_is_direct_array_type (type);
1535 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1538 ada_is_simple_array_type (struct type *type)
1542 type = ada_check_typedef (type);
1543 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1544 || (TYPE_CODE (type) == TYPE_CODE_PTR
1545 && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
1548 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1551 ada_is_array_descriptor_type (struct type *type)
1553 struct type *data_type = desc_data_type (type);
1557 type = ada_check_typedef (type);
1560 && ((TYPE_CODE (data_type) == TYPE_CODE_PTR
1561 && TYPE_TARGET_TYPE (data_type) != NULL
1562 && TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY)
1563 || TYPE_CODE (data_type) == TYPE_CODE_ARRAY)
1564 && desc_arity (desc_bounds_type (type)) > 0;
1567 /* Non-zero iff type is a partially mal-formed GNAT array
1568 descriptor. FIXME: This is to compensate for some problems with
1569 debugging output from GNAT. Re-examine periodically to see if it
1573 ada_is_bogus_array_descriptor (struct type *type)
1577 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1578 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1579 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1580 && !ada_is_array_descriptor_type (type);
1584 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1585 (fat pointer) returns the type of the array data described---specifically,
1586 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1587 in from the descriptor; otherwise, they are left unspecified. If
1588 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1589 returns NULL. The result is simply the type of ARR if ARR is not
1592 ada_type_of_array (struct value *arr, int bounds)
1594 if (ada_is_packed_array_type (value_type (arr)))
1595 return decode_packed_array_type (value_type (arr));
1597 if (!ada_is_array_descriptor_type (value_type (arr)))
1598 return value_type (arr);
1602 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr))));
1605 struct type *elt_type;
1607 struct value *descriptor;
1608 struct objfile *objf = TYPE_OBJFILE (value_type (arr));
1610 elt_type = ada_array_element_type (value_type (arr), -1);
1611 arity = ada_array_arity (value_type (arr));
1613 if (elt_type == NULL || arity == 0)
1614 return ada_check_typedef (value_type (arr));
1616 descriptor = desc_bounds (arr);
1617 if (value_as_long (descriptor) == 0)
1621 struct type *range_type = alloc_type (objf);
1622 struct type *array_type = alloc_type (objf);
1623 struct value *low = desc_one_bound (descriptor, arity, 0);
1624 struct value *high = desc_one_bound (descriptor, arity, 1);
1627 create_range_type (range_type, value_type (low),
1628 longest_to_int (value_as_long (low)),
1629 longest_to_int (value_as_long (high)));
1630 elt_type = create_array_type (array_type, elt_type, range_type);
1633 return lookup_pointer_type (elt_type);
1637 /* If ARR does not represent an array, returns ARR unchanged.
1638 Otherwise, returns either a standard GDB array with bounds set
1639 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1640 GDB array. Returns NULL if ARR is a null fat pointer. */
1643 ada_coerce_to_simple_array_ptr (struct value *arr)
1645 if (ada_is_array_descriptor_type (value_type (arr)))
1647 struct type *arrType = ada_type_of_array (arr, 1);
1648 if (arrType == NULL)
1650 return value_cast (arrType, value_copy (desc_data (arr)));
1652 else if (ada_is_packed_array_type (value_type (arr)))
1653 return decode_packed_array (arr);
1658 /* If ARR does not represent an array, returns ARR unchanged.
1659 Otherwise, returns a standard GDB array describing ARR (which may
1660 be ARR itself if it already is in the proper form). */
1662 static struct value *
1663 ada_coerce_to_simple_array (struct value *arr)
1665 if (ada_is_array_descriptor_type (value_type (arr)))
1667 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1669 error (_("Bounds unavailable for null array pointer."));
1670 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
1671 return value_ind (arrVal);
1673 else if (ada_is_packed_array_type (value_type (arr)))
1674 return decode_packed_array (arr);
1679 /* If TYPE represents a GNAT array type, return it translated to an
1680 ordinary GDB array type (possibly with BITSIZE fields indicating
1681 packing). For other types, is the identity. */
1684 ada_coerce_to_simple_array_type (struct type *type)
1686 struct value *mark = value_mark ();
1687 struct value *dummy = value_from_longest (builtin_type_int32, 0);
1688 struct type *result;
1689 deprecated_set_value_type (dummy, type);
1690 result = ada_type_of_array (dummy, 0);
1691 value_free_to_mark (mark);
1695 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1698 ada_is_packed_array_type (struct type *type)
1702 type = desc_base_type (type);
1703 type = ada_check_typedef (type);
1705 ada_type_name (type) != NULL
1706 && strstr (ada_type_name (type), "___XP") != NULL;
1709 /* Given that TYPE is a standard GDB array type with all bounds filled
1710 in, and that the element size of its ultimate scalar constituents
1711 (that is, either its elements, or, if it is an array of arrays, its
1712 elements' elements, etc.) is *ELT_BITS, return an identical type,
1713 but with the bit sizes of its elements (and those of any
1714 constituent arrays) recorded in the BITSIZE components of its
1715 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1718 static struct type *
1719 packed_array_type (struct type *type, long *elt_bits)
1721 struct type *new_elt_type;
1722 struct type *new_type;
1723 LONGEST low_bound, high_bound;
1725 type = ada_check_typedef (type);
1726 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
1729 new_type = alloc_type (TYPE_OBJFILE (type));
1730 new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
1732 create_array_type (new_type, new_elt_type, TYPE_INDEX_TYPE (type));
1733 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
1734 TYPE_NAME (new_type) = ada_type_name (type);
1736 if (get_discrete_bounds (TYPE_INDEX_TYPE (type),
1737 &low_bound, &high_bound) < 0)
1738 low_bound = high_bound = 0;
1739 if (high_bound < low_bound)
1740 *elt_bits = TYPE_LENGTH (new_type) = 0;
1743 *elt_bits *= (high_bound - low_bound + 1);
1744 TYPE_LENGTH (new_type) =
1745 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
1748 TYPE_FIXED_INSTANCE (new_type) = 1;
1752 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1754 static struct type *
1755 decode_packed_array_type (struct type *type)
1758 struct block **blocks;
1759 char *raw_name = ada_type_name (ada_check_typedef (type));
1762 struct type *shadow_type;
1767 raw_name = ada_type_name (desc_base_type (type));
1772 name = (char *) alloca (strlen (raw_name) + 1);
1773 tail = strstr (raw_name, "___XP");
1774 type = desc_base_type (type);
1776 memcpy (name, raw_name, tail - raw_name);
1777 name[tail - raw_name] = '\000';
1779 sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
1780 if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
1782 lim_warning (_("could not find bounds information on packed array"));
1785 shadow_type = SYMBOL_TYPE (sym);
1787 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
1789 lim_warning (_("could not understand bounds information on packed array"));
1793 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1796 (_("could not understand bit size information on packed array"));
1800 return packed_array_type (shadow_type, &bits);
1803 /* Given that ARR is a struct value *indicating a GNAT packed array,
1804 returns a simple array that denotes that array. Its type is a
1805 standard GDB array type except that the BITSIZEs of the array
1806 target types are set to the number of bits in each element, and the
1807 type length is set appropriately. */
1809 static struct value *
1810 decode_packed_array (struct value *arr)
1814 arr = ada_coerce_ref (arr);
1815 if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
1816 arr = ada_value_ind (arr);
1818 type = decode_packed_array_type (value_type (arr));
1821 error (_("can't unpack array"));
1825 if (gdbarch_bits_big_endian (current_gdbarch)
1826 && ada_is_modular_type (value_type (arr)))
1828 /* This is a (right-justified) modular type representing a packed
1829 array with no wrapper. In order to interpret the value through
1830 the (left-justified) packed array type we just built, we must
1831 first left-justify it. */
1832 int bit_size, bit_pos;
1835 mod = ada_modulus (value_type (arr)) - 1;
1842 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
1843 arr = ada_value_primitive_packed_val (arr, NULL,
1844 bit_pos / HOST_CHAR_BIT,
1845 bit_pos % HOST_CHAR_BIT,
1850 return coerce_unspec_val_to_type (arr, type);
1854 /* The value of the element of packed array ARR at the ARITY indices
1855 given in IND. ARR must be a simple array. */
1857 static struct value *
1858 value_subscript_packed (struct value *arr, int arity, struct value **ind)
1861 int bits, elt_off, bit_off;
1862 long elt_total_bit_offset;
1863 struct type *elt_type;
1867 elt_total_bit_offset = 0;
1868 elt_type = ada_check_typedef (value_type (arr));
1869 for (i = 0; i < arity; i += 1)
1871 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
1872 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
1874 (_("attempt to do packed indexing of something other than a packed array"));
1877 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
1878 LONGEST lowerbound, upperbound;
1881 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
1883 lim_warning (_("don't know bounds of array"));
1884 lowerbound = upperbound = 0;
1887 idx = pos_atr (ind[i]);
1888 if (idx < lowerbound || idx > upperbound)
1889 lim_warning (_("packed array index %ld out of bounds"), (long) idx);
1890 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
1891 elt_total_bit_offset += (idx - lowerbound) * bits;
1892 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
1895 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
1896 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
1898 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
1903 /* Non-zero iff TYPE includes negative integer values. */
1906 has_negatives (struct type *type)
1908 switch (TYPE_CODE (type))
1913 return !TYPE_UNSIGNED (type);
1914 case TYPE_CODE_RANGE:
1915 return TYPE_LOW_BOUND (type) < 0;
1920 /* Create a new value of type TYPE from the contents of OBJ starting
1921 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1922 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1923 assigning through the result will set the field fetched from.
1924 VALADDR is ignored unless OBJ is NULL, in which case,
1925 VALADDR+OFFSET must address the start of storage containing the
1926 packed value. The value returned in this case is never an lval.
1927 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1930 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
1931 long offset, int bit_offset, int bit_size,
1935 int src, /* Index into the source area */
1936 targ, /* Index into the target area */
1937 srcBitsLeft, /* Number of source bits left to move */
1938 nsrc, ntarg, /* Number of source and target bytes */
1939 unusedLS, /* Number of bits in next significant
1940 byte of source that are unused */
1941 accumSize; /* Number of meaningful bits in accum */
1942 unsigned char *bytes; /* First byte containing data to unpack */
1943 unsigned char *unpacked;
1944 unsigned long accum; /* Staging area for bits being transferred */
1946 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
1947 /* Transmit bytes from least to most significant; delta is the direction
1948 the indices move. */
1949 int delta = gdbarch_bits_big_endian (current_gdbarch) ? -1 : 1;
1951 type = ada_check_typedef (type);
1955 v = allocate_value (type);
1956 bytes = (unsigned char *) (valaddr + offset);
1958 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
1961 VALUE_ADDRESS (obj) + value_offset (obj) + offset);
1962 bytes = (unsigned char *) alloca (len);
1963 read_memory (VALUE_ADDRESS (v), bytes, len);
1967 v = allocate_value (type);
1968 bytes = (unsigned char *) value_contents (obj) + offset;
1973 set_value_component_location (v, obj);
1974 VALUE_ADDRESS (v) += value_offset (obj) + offset;
1975 set_value_bitpos (v, bit_offset + value_bitpos (obj));
1976 set_value_bitsize (v, bit_size);
1977 if (value_bitpos (v) >= HOST_CHAR_BIT)
1979 VALUE_ADDRESS (v) += 1;
1980 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
1984 set_value_bitsize (v, bit_size);
1985 unpacked = (unsigned char *) value_contents (v);
1987 srcBitsLeft = bit_size;
1989 ntarg = TYPE_LENGTH (type);
1993 memset (unpacked, 0, TYPE_LENGTH (type));
1996 else if (gdbarch_bits_big_endian (current_gdbarch))
1999 if (has_negatives (type)
2000 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2004 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2007 switch (TYPE_CODE (type))
2009 case TYPE_CODE_ARRAY:
2010 case TYPE_CODE_UNION:
2011 case TYPE_CODE_STRUCT:
2012 /* Non-scalar values must be aligned at a byte boundary... */
2014 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2015 /* ... And are placed at the beginning (most-significant) bytes
2017 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2021 targ = TYPE_LENGTH (type) - 1;
2027 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2030 unusedLS = bit_offset;
2033 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2040 /* Mask for removing bits of the next source byte that are not
2041 part of the value. */
2042 unsigned int unusedMSMask =
2043 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2045 /* Sign-extend bits for this byte. */
2046 unsigned int signMask = sign & ~unusedMSMask;
2048 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2049 accumSize += HOST_CHAR_BIT - unusedLS;
2050 if (accumSize >= HOST_CHAR_BIT)
2052 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2053 accumSize -= HOST_CHAR_BIT;
2054 accum >>= HOST_CHAR_BIT;
2058 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2065 accum |= sign << accumSize;
2066 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2067 accumSize -= HOST_CHAR_BIT;
2068 accum >>= HOST_CHAR_BIT;
2076 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2077 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2080 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2081 int src_offset, int n)
2083 unsigned int accum, mask;
2084 int accum_bits, chunk_size;
2086 target += targ_offset / HOST_CHAR_BIT;
2087 targ_offset %= HOST_CHAR_BIT;
2088 source += src_offset / HOST_CHAR_BIT;
2089 src_offset %= HOST_CHAR_BIT;
2090 if (gdbarch_bits_big_endian (current_gdbarch))
2092 accum = (unsigned char) *source;
2094 accum_bits = HOST_CHAR_BIT - src_offset;
2099 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2100 accum_bits += HOST_CHAR_BIT;
2102 chunk_size = HOST_CHAR_BIT - targ_offset;
2105 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2106 mask = ((1 << chunk_size) - 1) << unused_right;
2109 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2111 accum_bits -= chunk_size;
2118 accum = (unsigned char) *source >> src_offset;
2120 accum_bits = HOST_CHAR_BIT - src_offset;
2124 accum = accum + ((unsigned char) *source << accum_bits);
2125 accum_bits += HOST_CHAR_BIT;
2127 chunk_size = HOST_CHAR_BIT - targ_offset;
2130 mask = ((1 << chunk_size) - 1) << targ_offset;
2131 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2133 accum_bits -= chunk_size;
2134 accum >>= chunk_size;
2141 /* Store the contents of FROMVAL into the location of TOVAL.
2142 Return a new value with the location of TOVAL and contents of
2143 FROMVAL. Handles assignment into packed fields that have
2144 floating-point or non-scalar types. */
2146 static struct value *
2147 ada_value_assign (struct value *toval, struct value *fromval)
2149 struct type *type = value_type (toval);
2150 int bits = value_bitsize (toval);
2152 toval = ada_coerce_ref (toval);
2153 fromval = ada_coerce_ref (fromval);
2155 if (ada_is_direct_array_type (value_type (toval)))
2156 toval = ada_coerce_to_simple_array (toval);
2157 if (ada_is_direct_array_type (value_type (fromval)))
2158 fromval = ada_coerce_to_simple_array (fromval);
2160 if (!deprecated_value_modifiable (toval))
2161 error (_("Left operand of assignment is not a modifiable lvalue."));
2163 if (VALUE_LVAL (toval) == lval_memory
2165 && (TYPE_CODE (type) == TYPE_CODE_FLT
2166 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2168 int len = (value_bitpos (toval)
2169 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2171 char *buffer = (char *) alloca (len);
2173 CORE_ADDR to_addr = VALUE_ADDRESS (toval) + value_offset (toval);
2175 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2176 fromval = value_cast (type, fromval);
2178 read_memory (to_addr, buffer, len);
2179 from_size = value_bitsize (fromval);
2181 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2182 if (gdbarch_bits_big_endian (current_gdbarch))
2183 move_bits (buffer, value_bitpos (toval),
2184 value_contents (fromval), from_size - bits, bits);
2186 move_bits (buffer, value_bitpos (toval), value_contents (fromval),
2188 write_memory (to_addr, buffer, len);
2189 if (deprecated_memory_changed_hook)
2190 deprecated_memory_changed_hook (to_addr, len);
2192 val = value_copy (toval);
2193 memcpy (value_contents_raw (val), value_contents (fromval),
2194 TYPE_LENGTH (type));
2195 deprecated_set_value_type (val, type);
2200 return value_assign (toval, fromval);
2204 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2205 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2206 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2207 * COMPONENT, and not the inferior's memory. The current contents
2208 * of COMPONENT are ignored. */
2210 value_assign_to_component (struct value *container, struct value *component,
2213 LONGEST offset_in_container =
2214 (LONGEST) (VALUE_ADDRESS (component) + value_offset (component)
2215 - VALUE_ADDRESS (container) - value_offset (container));
2216 int bit_offset_in_container =
2217 value_bitpos (component) - value_bitpos (container);
2220 val = value_cast (value_type (component), val);
2222 if (value_bitsize (component) == 0)
2223 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2225 bits = value_bitsize (component);
2227 if (gdbarch_bits_big_endian (current_gdbarch))
2228 move_bits (value_contents_writeable (container) + offset_in_container,
2229 value_bitpos (container) + bit_offset_in_container,
2230 value_contents (val),
2231 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2234 move_bits (value_contents_writeable (container) + offset_in_container,
2235 value_bitpos (container) + bit_offset_in_container,
2236 value_contents (val), 0, bits);
2239 /* The value of the element of array ARR at the ARITY indices given in IND.
2240 ARR may be either a simple array, GNAT array descriptor, or pointer
2244 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2248 struct type *elt_type;
2250 elt = ada_coerce_to_simple_array (arr);
2252 elt_type = ada_check_typedef (value_type (elt));
2253 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2254 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2255 return value_subscript_packed (elt, arity, ind);
2257 for (k = 0; k < arity; k += 1)
2259 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2260 error (_("too many subscripts (%d expected)"), k);
2261 elt = value_subscript (elt, value_pos_atr (builtin_type_int32, ind[k]));
2266 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2267 value of the element of *ARR at the ARITY indices given in
2268 IND. Does not read the entire array into memory. */
2270 static struct value *
2271 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2276 for (k = 0; k < arity; k += 1)
2281 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2282 error (_("too many subscripts (%d expected)"), k);
2283 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2285 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2286 idx = value_pos_atr (builtin_type_int32, ind[k]);
2288 idx = value_binop (idx, value_from_longest (value_type (idx), lwb),
2291 arr = value_ptradd (arr, idx);
2292 type = TYPE_TARGET_TYPE (type);
2295 return value_ind (arr);
2298 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2299 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2300 elements starting at index LOW. The lower bound of this array is LOW, as
2302 static struct value *
2303 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2306 CORE_ADDR base = value_as_address (array_ptr)
2307 + ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
2308 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
2309 struct type *index_type =
2310 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
2312 struct type *slice_type =
2313 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2314 return value_at_lazy (slice_type, base);
2318 static struct value *
2319 ada_value_slice (struct value *array, int low, int high)
2321 struct type *type = value_type (array);
2322 struct type *index_type =
2323 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2324 struct type *slice_type =
2325 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2326 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2329 /* If type is a record type in the form of a standard GNAT array
2330 descriptor, returns the number of dimensions for type. If arr is a
2331 simple array, returns the number of "array of"s that prefix its
2332 type designation. Otherwise, returns 0. */
2335 ada_array_arity (struct type *type)
2342 type = desc_base_type (type);
2345 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2346 return desc_arity (desc_bounds_type (type));
2348 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2351 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2357 /* If TYPE is a record type in the form of a standard GNAT array
2358 descriptor or a simple array type, returns the element type for
2359 TYPE after indexing by NINDICES indices, or by all indices if
2360 NINDICES is -1. Otherwise, returns NULL. */
2363 ada_array_element_type (struct type *type, int nindices)
2365 type = desc_base_type (type);
2367 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2370 struct type *p_array_type;
2372 p_array_type = desc_data_type (type);
2374 k = ada_array_arity (type);
2378 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2379 if (nindices >= 0 && k > nindices)
2381 p_array_type = TYPE_TARGET_TYPE (p_array_type);
2382 while (k > 0 && p_array_type != NULL)
2384 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2387 return p_array_type;
2389 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2391 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2393 type = TYPE_TARGET_TYPE (type);
2402 /* The type of nth index in arrays of given type (n numbering from 1).
2403 Does not examine memory. */
2406 ada_index_type (struct type *type, int n)
2408 struct type *result_type;
2410 type = desc_base_type (type);
2412 if (n > ada_array_arity (type))
2415 if (ada_is_simple_array_type (type))
2419 for (i = 1; i < n; i += 1)
2420 type = TYPE_TARGET_TYPE (type);
2421 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2422 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2423 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2424 perhaps stabsread.c would make more sense. */
2425 if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2426 result_type = builtin_type_int32;
2431 return desc_index_type (desc_bounds_type (type), n);
2434 /* Given that arr is an array type, returns the lower bound of the
2435 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2436 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2437 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2438 bounds type. It works for other arrays with bounds supplied by
2439 run-time quantities other than discriminants. */
2442 ada_array_bound_from_type (struct type * arr_type, int n, int which,
2443 struct type ** typep)
2445 struct type *type, *index_type_desc, *index_type;
2448 gdb_assert (which == 0 || which == 1);
2450 if (ada_is_packed_array_type (arr_type))
2451 arr_type = decode_packed_array_type (arr_type);
2453 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2456 *typep = builtin_type_int32;
2457 return (LONGEST) - which;
2460 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2461 type = TYPE_TARGET_TYPE (arr_type);
2465 index_type_desc = ada_find_parallel_type (type, "___XA");
2466 if (index_type_desc != NULL)
2467 index_type = to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
2468 NULL, TYPE_OBJFILE (arr_type));
2473 type = TYPE_TARGET_TYPE (type);
2477 index_type = TYPE_INDEX_TYPE (type);
2480 switch (TYPE_CODE (index_type))
2482 case TYPE_CODE_RANGE:
2483 retval = which == 0 ? TYPE_LOW_BOUND (index_type)
2484 : TYPE_HIGH_BOUND (index_type);
2486 case TYPE_CODE_ENUM:
2487 retval = which == 0 ? TYPE_FIELD_BITPOS (index_type, 0)
2488 : TYPE_FIELD_BITPOS (index_type,
2489 TYPE_NFIELDS (index_type) - 1);
2492 internal_error (__FILE__, __LINE__, _("invalid type code of index type"));
2496 *typep = index_type;
2501 /* Given that arr is an array value, returns the lower bound of the
2502 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2503 WHICH is 1. This routine will also work for arrays with bounds
2504 supplied by run-time quantities other than discriminants. */
2507 ada_array_bound (struct value *arr, int n, int which)
2509 struct type *arr_type = value_type (arr);
2511 if (ada_is_packed_array_type (arr_type))
2512 return ada_array_bound (decode_packed_array (arr), n, which);
2513 else if (ada_is_simple_array_type (arr_type))
2516 LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
2517 return value_from_longest (type, v);
2520 return desc_one_bound (desc_bounds (arr), n, which);
2523 /* Given that arr is an array value, returns the length of the
2524 nth index. This routine will also work for arrays with bounds
2525 supplied by run-time quantities other than discriminants.
2526 Does not work for arrays indexed by enumeration types with representation
2527 clauses at the moment. */
2529 static struct value *
2530 ada_array_length (struct value *arr, int n)
2532 struct type *arr_type = ada_check_typedef (value_type (arr));
2534 if (ada_is_packed_array_type (arr_type))
2535 return ada_array_length (decode_packed_array (arr), n);
2537 if (ada_is_simple_array_type (arr_type))
2541 ada_array_bound_from_type (arr_type, n, 1, &type) -
2542 ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
2543 return value_from_longest (type, v);
2547 value_from_longest (builtin_type_int32,
2548 value_as_long (desc_one_bound (desc_bounds (arr),
2550 - value_as_long (desc_one_bound (desc_bounds (arr),
2554 /* An empty array whose type is that of ARR_TYPE (an array type),
2555 with bounds LOW to LOW-1. */
2557 static struct value *
2558 empty_array (struct type *arr_type, int low)
2560 struct type *index_type =
2561 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
2563 struct type *elt_type = ada_array_element_type (arr_type, 1);
2564 return allocate_value (create_array_type (NULL, elt_type, index_type));
2568 /* Name resolution */
2570 /* The "decoded" name for the user-definable Ada operator corresponding
2574 ada_decoded_op_name (enum exp_opcode op)
2578 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2580 if (ada_opname_table[i].op == op)
2581 return ada_opname_table[i].decoded;
2583 error (_("Could not find operator name for opcode"));
2587 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2588 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2589 undefined namespace) and converts operators that are
2590 user-defined into appropriate function calls. If CONTEXT_TYPE is
2591 non-null, it provides a preferred result type [at the moment, only
2592 type void has any effect---causing procedures to be preferred over
2593 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2594 return type is preferred. May change (expand) *EXP. */
2597 resolve (struct expression **expp, int void_context_p)
2601 resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
2604 /* Resolve the operator of the subexpression beginning at
2605 position *POS of *EXPP. "Resolving" consists of replacing
2606 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2607 with their resolutions, replacing built-in operators with
2608 function calls to user-defined operators, where appropriate, and,
2609 when DEPROCEDURE_P is non-zero, converting function-valued variables
2610 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2611 are as in ada_resolve, above. */
2613 static struct value *
2614 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2615 struct type *context_type)
2619 struct expression *exp; /* Convenience: == *expp. */
2620 enum exp_opcode op = (*expp)->elts[pc].opcode;
2621 struct value **argvec; /* Vector of operand types (alloca'ed). */
2622 int nargs; /* Number of operands. */
2629 /* Pass one: resolve operands, saving their types and updating *pos,
2634 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2635 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2640 resolve_subexp (expp, pos, 0, NULL);
2642 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2647 resolve_subexp (expp, pos, 0, NULL);
2652 resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type);
2655 case OP_ATR_MODULUS:
2665 case TERNOP_IN_RANGE:
2666 case BINOP_IN_BOUNDS:
2672 case OP_DISCRETE_RANGE:
2674 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2683 arg1 = resolve_subexp (expp, pos, 0, NULL);
2685 resolve_subexp (expp, pos, 1, NULL);
2687 resolve_subexp (expp, pos, 1, value_type (arg1));
2704 case BINOP_LOGICAL_AND:
2705 case BINOP_LOGICAL_OR:
2706 case BINOP_BITWISE_AND:
2707 case BINOP_BITWISE_IOR:
2708 case BINOP_BITWISE_XOR:
2711 case BINOP_NOTEQUAL:
2718 case BINOP_SUBSCRIPT:
2726 case UNOP_LOGICAL_NOT:
2742 case OP_INTERNALVAR:
2752 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2755 case STRUCTOP_STRUCT:
2756 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2769 error (_("Unexpected operator during name resolution"));
2772 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
2773 for (i = 0; i < nargs; i += 1)
2774 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
2778 /* Pass two: perform any resolution on principal operator. */
2785 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
2787 struct ada_symbol_info *candidates;
2791 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2792 (exp->elts[pc + 2].symbol),
2793 exp->elts[pc + 1].block, VAR_DOMAIN,
2796 if (n_candidates > 1)
2798 /* Types tend to get re-introduced locally, so if there
2799 are any local symbols that are not types, first filter
2802 for (j = 0; j < n_candidates; j += 1)
2803 switch (SYMBOL_CLASS (candidates[j].sym))
2808 case LOC_REGPARM_ADDR:
2816 if (j < n_candidates)
2819 while (j < n_candidates)
2821 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
2823 candidates[j] = candidates[n_candidates - 1];
2832 if (n_candidates == 0)
2833 error (_("No definition found for %s"),
2834 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2835 else if (n_candidates == 1)
2837 else if (deprocedure_p
2838 && !is_nonfunction (candidates, n_candidates))
2840 i = ada_resolve_function
2841 (candidates, n_candidates, NULL, 0,
2842 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
2845 error (_("Could not find a match for %s"),
2846 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2850 printf_filtered (_("Multiple matches for %s\n"),
2851 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2852 user_select_syms (candidates, n_candidates, 1);
2856 exp->elts[pc + 1].block = candidates[i].block;
2857 exp->elts[pc + 2].symbol = candidates[i].sym;
2858 if (innermost_block == NULL
2859 || contained_in (candidates[i].block, innermost_block))
2860 innermost_block = candidates[i].block;
2864 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
2867 replace_operator_with_call (expp, pc, 0, 0,
2868 exp->elts[pc + 2].symbol,
2869 exp->elts[pc + 1].block);
2876 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2877 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2879 struct ada_symbol_info *candidates;
2883 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2884 (exp->elts[pc + 5].symbol),
2885 exp->elts[pc + 4].block, VAR_DOMAIN,
2887 if (n_candidates == 1)
2891 i = ada_resolve_function
2892 (candidates, n_candidates,
2894 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
2897 error (_("Could not find a match for %s"),
2898 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
2901 exp->elts[pc + 4].block = candidates[i].block;
2902 exp->elts[pc + 5].symbol = candidates[i].sym;
2903 if (innermost_block == NULL
2904 || contained_in (candidates[i].block, innermost_block))
2905 innermost_block = candidates[i].block;
2916 case BINOP_BITWISE_AND:
2917 case BINOP_BITWISE_IOR:
2918 case BINOP_BITWISE_XOR:
2920 case BINOP_NOTEQUAL:
2928 case UNOP_LOGICAL_NOT:
2930 if (possible_user_operator_p (op, argvec))
2932 struct ada_symbol_info *candidates;
2936 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
2937 (struct block *) NULL, VAR_DOMAIN,
2939 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
2940 ada_decoded_op_name (op), NULL);
2944 replace_operator_with_call (expp, pc, nargs, 1,
2945 candidates[i].sym, candidates[i].block);
2956 return evaluate_subexp_type (exp, pos);
2959 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2960 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2961 a non-pointer. A type of 'void' (which is never a valid expression type)
2962 by convention matches anything. */
2963 /* The term "match" here is rather loose. The match is heuristic and
2964 liberal. FIXME: TOO liberal, in fact. */
2967 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
2969 ftype = ada_check_typedef (ftype);
2970 atype = ada_check_typedef (atype);
2972 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
2973 ftype = TYPE_TARGET_TYPE (ftype);
2974 if (TYPE_CODE (atype) == TYPE_CODE_REF)
2975 atype = TYPE_TARGET_TYPE (atype);
2977 if (TYPE_CODE (ftype) == TYPE_CODE_VOID
2978 || TYPE_CODE (atype) == TYPE_CODE_VOID)
2981 switch (TYPE_CODE (ftype))
2986 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
2987 return ada_type_match (TYPE_TARGET_TYPE (ftype),
2988 TYPE_TARGET_TYPE (atype), 0);
2991 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
2993 case TYPE_CODE_ENUM:
2994 case TYPE_CODE_RANGE:
2995 switch (TYPE_CODE (atype))
2998 case TYPE_CODE_ENUM:
2999 case TYPE_CODE_RANGE:
3005 case TYPE_CODE_ARRAY:
3006 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3007 || ada_is_array_descriptor_type (atype));
3009 case TYPE_CODE_STRUCT:
3010 if (ada_is_array_descriptor_type (ftype))
3011 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3012 || ada_is_array_descriptor_type (atype));
3014 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3015 && !ada_is_array_descriptor_type (atype));
3017 case TYPE_CODE_UNION:
3019 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3023 /* Return non-zero if the formals of FUNC "sufficiently match" the
3024 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3025 may also be an enumeral, in which case it is treated as a 0-
3026 argument function. */
3029 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3032 struct type *func_type = SYMBOL_TYPE (func);
3034 if (SYMBOL_CLASS (func) == LOC_CONST
3035 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3036 return (n_actuals == 0);
3037 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3040 if (TYPE_NFIELDS (func_type) != n_actuals)
3043 for (i = 0; i < n_actuals; i += 1)
3045 if (actuals[i] == NULL)
3049 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
3050 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3052 if (!ada_type_match (ftype, atype, 1))
3059 /* False iff function type FUNC_TYPE definitely does not produce a value
3060 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3061 FUNC_TYPE is not a valid function type with a non-null return type
3062 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3065 return_match (struct type *func_type, struct type *context_type)
3067 struct type *return_type;
3069 if (func_type == NULL)
3072 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3073 return_type = base_type (TYPE_TARGET_TYPE (func_type));
3075 return_type = base_type (func_type);
3076 if (return_type == NULL)
3079 context_type = base_type (context_type);
3081 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3082 return context_type == NULL || return_type == context_type;
3083 else if (context_type == NULL)
3084 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3086 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3090 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3091 function (if any) that matches the types of the NARGS arguments in
3092 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3093 that returns that type, then eliminate matches that don't. If
3094 CONTEXT_TYPE is void and there is at least one match that does not
3095 return void, eliminate all matches that do.
3097 Asks the user if there is more than one match remaining. Returns -1
3098 if there is no such symbol or none is selected. NAME is used
3099 solely for messages. May re-arrange and modify SYMS in
3100 the process; the index returned is for the modified vector. */
3103 ada_resolve_function (struct ada_symbol_info syms[],
3104 int nsyms, struct value **args, int nargs,
3105 const char *name, struct type *context_type)
3108 int m; /* Number of hits */
3109 struct type *fallback;
3110 struct type *return_type;
3112 return_type = context_type;
3113 if (context_type == NULL)
3114 fallback = builtin_type_void;
3121 for (k = 0; k < nsyms; k += 1)
3123 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3125 if (ada_args_match (syms[k].sym, args, nargs)
3126 && return_match (type, return_type))
3132 if (m > 0 || return_type == fallback)
3135 return_type = fallback;
3142 printf_filtered (_("Multiple matches for %s\n"), name);
3143 user_select_syms (syms, m, 1);
3149 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3150 in a listing of choices during disambiguation (see sort_choices, below).
3151 The idea is that overloadings of a subprogram name from the
3152 same package should sort in their source order. We settle for ordering
3153 such symbols by their trailing number (__N or $N). */
3156 encoded_ordered_before (char *N0, char *N1)
3160 else if (N0 == NULL)
3165 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3167 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3169 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3170 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3174 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3177 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3179 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3180 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3182 return (strcmp (N0, N1) < 0);
3186 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3190 sort_choices (struct ada_symbol_info syms[], int nsyms)
3193 for (i = 1; i < nsyms; i += 1)
3195 struct ada_symbol_info sym = syms[i];
3198 for (j = i - 1; j >= 0; j -= 1)
3200 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3201 SYMBOL_LINKAGE_NAME (sym.sym)))
3203 syms[j + 1] = syms[j];
3209 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3210 by asking the user (if necessary), returning the number selected,
3211 and setting the first elements of SYMS items. Error if no symbols
3214 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3215 to be re-integrated one of these days. */
3218 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3221 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3223 int first_choice = (max_results == 1) ? 1 : 2;
3224 const char *select_mode = multiple_symbols_select_mode ();
3226 if (max_results < 1)
3227 error (_("Request to select 0 symbols!"));
3231 if (select_mode == multiple_symbols_cancel)
3233 canceled because the command is ambiguous\n\
3234 See set/show multiple-symbol."));
3236 /* If select_mode is "all", then return all possible symbols.
3237 Only do that if more than one symbol can be selected, of course.
3238 Otherwise, display the menu as usual. */
3239 if (select_mode == multiple_symbols_all && max_results > 1)
3242 printf_unfiltered (_("[0] cancel\n"));
3243 if (max_results > 1)
3244 printf_unfiltered (_("[1] all\n"));
3246 sort_choices (syms, nsyms);
3248 for (i = 0; i < nsyms; i += 1)
3250 if (syms[i].sym == NULL)
3253 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3255 struct symtab_and_line sal =
3256 find_function_start_sal (syms[i].sym, 1);
3257 if (sal.symtab == NULL)
3258 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3260 SYMBOL_PRINT_NAME (syms[i].sym),
3263 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3264 SYMBOL_PRINT_NAME (syms[i].sym),
3265 sal.symtab->filename, sal.line);
3271 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3272 && SYMBOL_TYPE (syms[i].sym) != NULL
3273 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3274 struct symtab *symtab = symtab_for_sym (syms[i].sym);
3276 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3277 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3279 SYMBOL_PRINT_NAME (syms[i].sym),
3280 symtab->filename, SYMBOL_LINE (syms[i].sym));
3281 else if (is_enumeral
3282 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3284 printf_unfiltered (("[%d] "), i + first_choice);
3285 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3287 printf_unfiltered (_("'(%s) (enumeral)\n"),
3288 SYMBOL_PRINT_NAME (syms[i].sym));
3290 else if (symtab != NULL)
3291 printf_unfiltered (is_enumeral
3292 ? _("[%d] %s in %s (enumeral)\n")
3293 : _("[%d] %s at %s:?\n"),
3295 SYMBOL_PRINT_NAME (syms[i].sym),
3298 printf_unfiltered (is_enumeral
3299 ? _("[%d] %s (enumeral)\n")
3300 : _("[%d] %s at ?\n"),
3302 SYMBOL_PRINT_NAME (syms[i].sym));
3306 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3309 for (i = 0; i < n_chosen; i += 1)
3310 syms[i] = syms[chosen[i]];
3315 /* Read and validate a set of numeric choices from the user in the
3316 range 0 .. N_CHOICES-1. Place the results in increasing
3317 order in CHOICES[0 .. N-1], and return N.
3319 The user types choices as a sequence of numbers on one line
3320 separated by blanks, encoding them as follows:
3322 + A choice of 0 means to cancel the selection, throwing an error.
3323 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3324 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3326 The user is not allowed to choose more than MAX_RESULTS values.
3328 ANNOTATION_SUFFIX, if present, is used to annotate the input
3329 prompts (for use with the -f switch). */
3332 get_selections (int *choices, int n_choices, int max_results,
3333 int is_all_choice, char *annotation_suffix)
3338 int first_choice = is_all_choice ? 2 : 1;
3340 prompt = getenv ("PS2");
3344 args = command_line_input (prompt, 0, annotation_suffix);
3347 error_no_arg (_("one or more choice numbers"));
3351 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3352 order, as given in args. Choices are validated. */
3358 while (isspace (*args))
3360 if (*args == '\0' && n_chosen == 0)
3361 error_no_arg (_("one or more choice numbers"));
3362 else if (*args == '\0')
3365 choice = strtol (args, &args2, 10);
3366 if (args == args2 || choice < 0
3367 || choice > n_choices + first_choice - 1)
3368 error (_("Argument must be choice number"));
3372 error (_("cancelled"));
3374 if (choice < first_choice)
3376 n_chosen = n_choices;
3377 for (j = 0; j < n_choices; j += 1)
3381 choice -= first_choice;
3383 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3387 if (j < 0 || choice != choices[j])
3390 for (k = n_chosen - 1; k > j; k -= 1)
3391 choices[k + 1] = choices[k];
3392 choices[j + 1] = choice;
3397 if (n_chosen > max_results)
3398 error (_("Select no more than %d of the above"), max_results);
3403 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3404 on the function identified by SYM and BLOCK, and taking NARGS
3405 arguments. Update *EXPP as needed to hold more space. */
3408 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3409 int oplen, struct symbol *sym,
3410 struct block *block)
3412 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3413 symbol, -oplen for operator being replaced). */
3414 struct expression *newexp = (struct expression *)
3415 xmalloc (sizeof (struct expression)
3416 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3417 struct expression *exp = *expp;
3419 newexp->nelts = exp->nelts + 7 - oplen;
3420 newexp->language_defn = exp->language_defn;
3421 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3422 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3423 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3425 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3426 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3428 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3429 newexp->elts[pc + 4].block = block;
3430 newexp->elts[pc + 5].symbol = sym;
3436 /* Type-class predicates */
3438 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3442 numeric_type_p (struct type *type)
3448 switch (TYPE_CODE (type))
3453 case TYPE_CODE_RANGE:
3454 return (type == TYPE_TARGET_TYPE (type)
3455 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3462 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3465 integer_type_p (struct type *type)
3471 switch (TYPE_CODE (type))
3475 case TYPE_CODE_RANGE:
3476 return (type == TYPE_TARGET_TYPE (type)
3477 || integer_type_p (TYPE_TARGET_TYPE (type)));
3484 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3487 scalar_type_p (struct type *type)
3493 switch (TYPE_CODE (type))
3496 case TYPE_CODE_RANGE:
3497 case TYPE_CODE_ENUM:
3506 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3509 discrete_type_p (struct type *type)
3515 switch (TYPE_CODE (type))
3518 case TYPE_CODE_RANGE:
3519 case TYPE_CODE_ENUM:
3527 /* Returns non-zero if OP with operands in the vector ARGS could be
3528 a user-defined function. Errs on the side of pre-defined operators
3529 (i.e., result 0). */
3532 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3534 struct type *type0 =
3535 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3536 struct type *type1 =
3537 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3551 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3555 case BINOP_BITWISE_AND:
3556 case BINOP_BITWISE_IOR:
3557 case BINOP_BITWISE_XOR:
3558 return (!(integer_type_p (type0) && integer_type_p (type1)));
3561 case BINOP_NOTEQUAL:
3566 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3569 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
3572 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3576 case UNOP_LOGICAL_NOT:
3578 return (!numeric_type_p (type0));
3587 1. In the following, we assume that a renaming type's name may
3588 have an ___XD suffix. It would be nice if this went away at some
3590 2. We handle both the (old) purely type-based representation of
3591 renamings and the (new) variable-based encoding. At some point,
3592 it is devoutly to be hoped that the former goes away
3593 (FIXME: hilfinger-2007-07-09).
3594 3. Subprogram renamings are not implemented, although the XRS
3595 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3597 /* If SYM encodes a renaming,
3599 <renaming> renames <renamed entity>,
3601 sets *LEN to the length of the renamed entity's name,
3602 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3603 the string describing the subcomponent selected from the renamed
3604 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3605 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3606 are undefined). Otherwise, returns a value indicating the category
3607 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3608 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3609 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3610 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3611 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3612 may be NULL, in which case they are not assigned.
3614 [Currently, however, GCC does not generate subprogram renamings.] */
3616 enum ada_renaming_category
3617 ada_parse_renaming (struct symbol *sym,
3618 const char **renamed_entity, int *len,
3619 const char **renaming_expr)
3621 enum ada_renaming_category kind;
3626 return ADA_NOT_RENAMING;
3627 switch (SYMBOL_CLASS (sym))
3630 return ADA_NOT_RENAMING;
3632 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3633 renamed_entity, len, renaming_expr);
3637 case LOC_OPTIMIZED_OUT:
3638 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3640 return ADA_NOT_RENAMING;
3644 kind = ADA_OBJECT_RENAMING;
3648 kind = ADA_EXCEPTION_RENAMING;
3652 kind = ADA_PACKAGE_RENAMING;
3656 kind = ADA_SUBPROGRAM_RENAMING;
3660 return ADA_NOT_RENAMING;
3664 if (renamed_entity != NULL)
3665 *renamed_entity = info;
3666 suffix = strstr (info, "___XE");
3667 if (suffix == NULL || suffix == info)
3668 return ADA_NOT_RENAMING;
3670 *len = strlen (info) - strlen (suffix);
3672 if (renaming_expr != NULL)
3673 *renaming_expr = suffix;
3677 /* Assuming TYPE encodes a renaming according to the old encoding in
3678 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3679 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3680 ADA_NOT_RENAMING otherwise. */
3681 static enum ada_renaming_category
3682 parse_old_style_renaming (struct type *type,
3683 const char **renamed_entity, int *len,
3684 const char **renaming_expr)
3686 enum ada_renaming_category kind;
3691 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3692 || TYPE_NFIELDS (type) != 1)
3693 return ADA_NOT_RENAMING;
3695 name = type_name_no_tag (type);
3697 return ADA_NOT_RENAMING;
3699 name = strstr (name, "___XR");
3701 return ADA_NOT_RENAMING;
3706 kind = ADA_OBJECT_RENAMING;
3709 kind = ADA_EXCEPTION_RENAMING;
3712 kind = ADA_PACKAGE_RENAMING;
3715 kind = ADA_SUBPROGRAM_RENAMING;
3718 return ADA_NOT_RENAMING;
3721 info = TYPE_FIELD_NAME (type, 0);
3723 return ADA_NOT_RENAMING;
3724 if (renamed_entity != NULL)
3725 *renamed_entity = info;
3726 suffix = strstr (info, "___XE");
3727 if (renaming_expr != NULL)
3728 *renaming_expr = suffix + 5;
3729 if (suffix == NULL || suffix == info)
3730 return ADA_NOT_RENAMING;
3732 *len = suffix - info;
3738 /* Evaluation: Function Calls */
3740 /* Return an lvalue containing the value VAL. This is the identity on
3741 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3742 on the stack, using and updating *SP as the stack pointer, and
3743 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3745 static struct value *
3746 ensure_lval (struct value *val, CORE_ADDR *sp)
3748 if (! VALUE_LVAL (val))
3750 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
3752 /* The following is taken from the structure-return code in
3753 call_function_by_hand. FIXME: Therefore, some refactoring seems
3755 if (gdbarch_inner_than (current_gdbarch, 1, 2))
3757 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3758 reserving sufficient space. */
3760 if (gdbarch_frame_align_p (current_gdbarch))
3761 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3762 VALUE_ADDRESS (val) = *sp;
3766 /* Stack grows upward. Align the frame, allocate space, and
3767 then again, re-align the frame. */
3768 if (gdbarch_frame_align_p (current_gdbarch))
3769 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3770 VALUE_ADDRESS (val) = *sp;
3772 if (gdbarch_frame_align_p (current_gdbarch))
3773 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3775 VALUE_LVAL (val) = lval_memory;
3777 write_memory (VALUE_ADDRESS (val), value_contents_raw (val), len);
3783 /* Return the value ACTUAL, converted to be an appropriate value for a
3784 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3785 allocating any necessary descriptors (fat pointers), or copies of
3786 values not residing in memory, updating it as needed. */
3789 ada_convert_actual (struct value *actual, struct type *formal_type0,
3792 struct type *actual_type = ada_check_typedef (value_type (actual));
3793 struct type *formal_type = ada_check_typedef (formal_type0);
3794 struct type *formal_target =
3795 TYPE_CODE (formal_type) == TYPE_CODE_PTR
3796 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
3797 struct type *actual_target =
3798 TYPE_CODE (actual_type) == TYPE_CODE_PTR
3799 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
3801 if (ada_is_array_descriptor_type (formal_target)
3802 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
3803 return make_array_descriptor (formal_type, actual, sp);
3804 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
3805 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
3807 struct value *result;
3808 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
3809 && ada_is_array_descriptor_type (actual_target))
3810 result = desc_data (actual);
3811 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
3813 if (VALUE_LVAL (actual) != lval_memory)
3816 actual_type = ada_check_typedef (value_type (actual));
3817 val = allocate_value (actual_type);
3818 memcpy ((char *) value_contents_raw (val),
3819 (char *) value_contents (actual),
3820 TYPE_LENGTH (actual_type));
3821 actual = ensure_lval (val, sp);
3823 result = value_addr (actual);
3827 return value_cast_pointers (formal_type, result);
3829 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
3830 return ada_value_ind (actual);
3836 /* Push a descriptor of type TYPE for array value ARR on the stack at
3837 *SP, updating *SP to reflect the new descriptor. Return either
3838 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3839 to-descriptor type rather than a descriptor type), a struct value *
3840 representing a pointer to this descriptor. */
3842 static struct value *
3843 make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
3845 struct type *bounds_type = desc_bounds_type (type);
3846 struct type *desc_type = desc_base_type (type);
3847 struct value *descriptor = allocate_value (desc_type);
3848 struct value *bounds = allocate_value (bounds_type);
3851 for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
3853 modify_general_field (value_contents_writeable (bounds),
3854 value_as_long (ada_array_bound (arr, i, 0)),
3855 desc_bound_bitpos (bounds_type, i, 0),
3856 desc_bound_bitsize (bounds_type, i, 0));
3857 modify_general_field (value_contents_writeable (bounds),
3858 value_as_long (ada_array_bound (arr, i, 1)),
3859 desc_bound_bitpos (bounds_type, i, 1),
3860 desc_bound_bitsize (bounds_type, i, 1));
3863 bounds = ensure_lval (bounds, sp);
3865 modify_general_field (value_contents_writeable (descriptor),
3866 VALUE_ADDRESS (ensure_lval (arr, sp)),
3867 fat_pntr_data_bitpos (desc_type),
3868 fat_pntr_data_bitsize (desc_type));
3870 modify_general_field (value_contents_writeable (descriptor),
3871 VALUE_ADDRESS (bounds),
3872 fat_pntr_bounds_bitpos (desc_type),
3873 fat_pntr_bounds_bitsize (desc_type));
3875 descriptor = ensure_lval (descriptor, sp);
3877 if (TYPE_CODE (type) == TYPE_CODE_PTR)
3878 return value_addr (descriptor);
3883 /* Dummy definitions for an experimental caching module that is not
3884 * used in the public sources. */
3887 lookup_cached_symbol (const char *name, domain_enum namespace,
3888 struct symbol **sym, struct block **block)
3894 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
3895 struct block *block)
3901 /* Return the result of a standard (literal, C-like) lookup of NAME in
3902 given DOMAIN, visible from lexical block BLOCK. */
3904 static struct symbol *
3905 standard_lookup (const char *name, const struct block *block,
3910 if (lookup_cached_symbol (name, domain, &sym, NULL))
3912 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
3913 cache_symbol (name, domain, sym, block_found);
3918 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3919 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3920 since they contend in overloading in the same way. */
3922 is_nonfunction (struct ada_symbol_info syms[], int n)
3926 for (i = 0; i < n; i += 1)
3927 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
3928 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
3929 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
3935 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3936 struct types. Otherwise, they may not. */
3939 equiv_types (struct type *type0, struct type *type1)
3943 if (type0 == NULL || type1 == NULL
3944 || TYPE_CODE (type0) != TYPE_CODE (type1))
3946 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
3947 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
3948 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
3949 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
3955 /* True iff SYM0 represents the same entity as SYM1, or one that is
3956 no more defined than that of SYM1. */
3959 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
3963 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
3964 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
3967 switch (SYMBOL_CLASS (sym0))
3973 struct type *type0 = SYMBOL_TYPE (sym0);
3974 struct type *type1 = SYMBOL_TYPE (sym1);
3975 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
3976 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
3977 int len0 = strlen (name0);
3979 TYPE_CODE (type0) == TYPE_CODE (type1)
3980 && (equiv_types (type0, type1)
3981 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
3982 && strncmp (name1 + len0, "___XV", 5) == 0));
3985 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
3986 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
3992 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3993 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3996 add_defn_to_vec (struct obstack *obstackp,
3998 struct block *block)
4002 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4004 /* Do not try to complete stub types, as the debugger is probably
4005 already scanning all symbols matching a certain name at the
4006 time when this function is called. Trying to replace the stub
4007 type by its associated full type will cause us to restart a scan
4008 which may lead to an infinite recursion. Instead, the client
4009 collecting the matching symbols will end up collecting several
4010 matches, with at least one of them complete. It can then filter
4011 out the stub ones if needed. */
4013 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4015 if (lesseq_defined_than (sym, prevDefns[i].sym))
4017 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4019 prevDefns[i].sym = sym;
4020 prevDefns[i].block = block;
4026 struct ada_symbol_info info;
4030 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4034 /* Number of ada_symbol_info structures currently collected in
4035 current vector in *OBSTACKP. */
4038 num_defns_collected (struct obstack *obstackp)
4040 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4043 /* Vector of ada_symbol_info structures currently collected in current
4044 vector in *OBSTACKP. If FINISH, close off the vector and return
4045 its final address. */
4047 static struct ada_symbol_info *
4048 defns_collected (struct obstack *obstackp, int finish)
4051 return obstack_finish (obstackp);
4053 return (struct ada_symbol_info *) obstack_base (obstackp);
4056 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4057 Check the global symbols if GLOBAL, the static symbols if not.
4058 Do wild-card match if WILD. */
4060 static struct partial_symbol *
4061 ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
4062 int global, domain_enum namespace, int wild)
4064 struct partial_symbol **start;
4065 int name_len = strlen (name);
4066 int length = (global ? pst->n_global_syms : pst->n_static_syms);
4075 pst->objfile->global_psymbols.list + pst->globals_offset :
4076 pst->objfile->static_psymbols.list + pst->statics_offset);
4080 for (i = 0; i < length; i += 1)
4082 struct partial_symbol *psym = start[i];
4084 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4085 SYMBOL_DOMAIN (psym), namespace)
4086 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
4100 int M = (U + i) >> 1;
4101 struct partial_symbol *psym = start[M];
4102 if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
4104 else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
4106 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
4117 struct partial_symbol *psym = start[i];
4119 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4120 SYMBOL_DOMAIN (psym), namespace))
4122 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
4130 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
4144 int M = (U + i) >> 1;
4145 struct partial_symbol *psym = start[M];
4146 if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
4148 else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
4150 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
4161 struct partial_symbol *psym = start[i];
4163 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym),
4164 SYMBOL_DOMAIN (psym), namespace))
4168 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
4171 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
4173 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
4183 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
4193 /* Find a symbol table containing symbol SYM or NULL if none. */
4195 static struct symtab *
4196 symtab_for_sym (struct symbol *sym)
4199 struct objfile *objfile;
4201 struct symbol *tmp_sym;
4202 struct dict_iterator iter;
4205 ALL_PRIMARY_SYMTABS (objfile, s)
4207 switch (SYMBOL_CLASS (sym))
4215 case LOC_CONST_BYTES:
4216 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
4217 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4219 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
4220 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4226 switch (SYMBOL_CLASS (sym))
4231 case LOC_REGPARM_ADDR:
4235 for (j = FIRST_LOCAL_BLOCK;
4236 j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1)
4238 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j);
4239 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4250 /* Return a minimal symbol matching NAME according to Ada decoding
4251 rules. Returns NULL if there is no such minimal symbol. Names
4252 prefixed with "standard__" are handled specially: "standard__" is
4253 first stripped off, and only static and global symbols are searched. */
4255 struct minimal_symbol *
4256 ada_lookup_simple_minsym (const char *name)
4258 struct objfile *objfile;
4259 struct minimal_symbol *msymbol;
4262 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4264 name += sizeof ("standard__") - 1;
4268 wild_match = (strstr (name, "__") == NULL);
4270 ALL_MSYMBOLS (objfile, msymbol)
4272 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4273 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4280 /* For all subprograms that statically enclose the subprogram of the
4281 selected frame, add symbols matching identifier NAME in DOMAIN
4282 and their blocks to the list of data in OBSTACKP, as for
4283 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4287 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4288 const char *name, domain_enum namespace,
4293 /* True if TYPE is definitely an artificial type supplied to a symbol
4294 for which no debugging information was given in the symbol file. */
4297 is_nondebugging_type (struct type *type)
4299 char *name = ada_type_name (type);
4300 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4303 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4304 duplicate other symbols in the list (The only case I know of where
4305 this happens is when object files containing stabs-in-ecoff are
4306 linked with files containing ordinary ecoff debugging symbols (or no
4307 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4308 Returns the number of items in the modified list. */
4311 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4320 /* If two symbols have the same name and one of them is a stub type,
4321 the get rid of the stub. */
4323 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4324 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4326 for (j = 0; j < nsyms; j++)
4329 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4330 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4331 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4332 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4337 /* Two symbols with the same name, same class and same address
4338 should be identical. */
4340 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4341 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4342 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4344 for (j = 0; j < nsyms; j += 1)
4347 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4348 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4349 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4350 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4351 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4352 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4359 for (j = i + 1; j < nsyms; j += 1)
4360 syms[j - 1] = syms[j];
4369 /* Given a type that corresponds to a renaming entity, use the type name
4370 to extract the scope (package name or function name, fully qualified,
4371 and following the GNAT encoding convention) where this renaming has been
4372 defined. The string returned needs to be deallocated after use. */
4375 xget_renaming_scope (struct type *renaming_type)
4377 /* The renaming types adhere to the following convention:
4378 <scope>__<rename>___<XR extension>.
4379 So, to extract the scope, we search for the "___XR" extension,
4380 and then backtrack until we find the first "__". */
4382 const char *name = type_name_no_tag (renaming_type);
4383 char *suffix = strstr (name, "___XR");
4388 /* Now, backtrack a bit until we find the first "__". Start looking
4389 at suffix - 3, as the <rename> part is at least one character long. */
4391 for (last = suffix - 3; last > name; last--)
4392 if (last[0] == '_' && last[1] == '_')
4395 /* Make a copy of scope and return it. */
4397 scope_len = last - name;
4398 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4400 strncpy (scope, name, scope_len);
4401 scope[scope_len] = '\0';
4406 /* Return nonzero if NAME corresponds to a package name. */
4409 is_package_name (const char *name)
4411 /* Here, We take advantage of the fact that no symbols are generated
4412 for packages, while symbols are generated for each function.
4413 So the condition for NAME represent a package becomes equivalent
4414 to NAME not existing in our list of symbols. There is only one
4415 small complication with library-level functions (see below). */
4419 /* If it is a function that has not been defined at library level,
4420 then we should be able to look it up in the symbols. */
4421 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4424 /* Library-level function names start with "_ada_". See if function
4425 "_ada_" followed by NAME can be found. */
4427 /* Do a quick check that NAME does not contain "__", since library-level
4428 functions names cannot contain "__" in them. */
4429 if (strstr (name, "__") != NULL)
4432 fun_name = xstrprintf ("_ada_%s", name);
4434 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4437 /* Return nonzero if SYM corresponds to a renaming entity that is
4438 not visible from FUNCTION_NAME. */
4441 old_renaming_is_invisible (const struct symbol *sym, char *function_name)
4445 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4448 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4450 make_cleanup (xfree, scope);
4452 /* If the rename has been defined in a package, then it is visible. */
4453 if (is_package_name (scope))
4456 /* Check that the rename is in the current function scope by checking
4457 that its name starts with SCOPE. */
4459 /* If the function name starts with "_ada_", it means that it is
4460 a library-level function. Strip this prefix before doing the
4461 comparison, as the encoding for the renaming does not contain
4463 if (strncmp (function_name, "_ada_", 5) == 0)
4466 return (strncmp (function_name, scope, strlen (scope)) != 0);
4469 /* Remove entries from SYMS that corresponds to a renaming entity that
4470 is not visible from the function associated with CURRENT_BLOCK or
4471 that is superfluous due to the presence of more specific renaming
4472 information. Places surviving symbols in the initial entries of
4473 SYMS and returns the number of surviving symbols.
4476 First, in cases where an object renaming is implemented as a
4477 reference variable, GNAT may produce both the actual reference
4478 variable and the renaming encoding. In this case, we discard the
4481 Second, GNAT emits a type following a specified encoding for each renaming
4482 entity. Unfortunately, STABS currently does not support the definition
4483 of types that are local to a given lexical block, so all renamings types
4484 are emitted at library level. As a consequence, if an application
4485 contains two renaming entities using the same name, and a user tries to
4486 print the value of one of these entities, the result of the ada symbol
4487 lookup will also contain the wrong renaming type.
4489 This function partially covers for this limitation by attempting to
4490 remove from the SYMS list renaming symbols that should be visible
4491 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4492 method with the current information available. The implementation
4493 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4495 - When the user tries to print a rename in a function while there
4496 is another rename entity defined in a package: Normally, the
4497 rename in the function has precedence over the rename in the
4498 package, so the latter should be removed from the list. This is
4499 currently not the case.
4501 - This function will incorrectly remove valid renames if
4502 the CURRENT_BLOCK corresponds to a function which symbol name
4503 has been changed by an "Export" pragma. As a consequence,
4504 the user will be unable to print such rename entities. */
4507 remove_irrelevant_renamings (struct ada_symbol_info *syms,
4508 int nsyms, const struct block *current_block)
4510 struct symbol *current_function;
4511 char *current_function_name;
4513 int is_new_style_renaming;
4515 /* If there is both a renaming foo___XR... encoded as a variable and
4516 a simple variable foo in the same block, discard the latter.
4517 First, zero out such symbols, then compress. */
4518 is_new_style_renaming = 0;
4519 for (i = 0; i < nsyms; i += 1)
4521 struct symbol *sym = syms[i].sym;
4522 struct block *block = syms[i].block;
4526 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4528 name = SYMBOL_LINKAGE_NAME (sym);
4529 suffix = strstr (name, "___XR");
4533 int name_len = suffix - name;
4535 is_new_style_renaming = 1;
4536 for (j = 0; j < nsyms; j += 1)
4537 if (i != j && syms[j].sym != NULL
4538 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4540 && block == syms[j].block)
4544 if (is_new_style_renaming)
4548 for (j = k = 0; j < nsyms; j += 1)
4549 if (syms[j].sym != NULL)
4557 /* Extract the function name associated to CURRENT_BLOCK.
4558 Abort if unable to do so. */
4560 if (current_block == NULL)
4563 current_function = block_linkage_function (current_block);
4564 if (current_function == NULL)
4567 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4568 if (current_function_name == NULL)
4571 /* Check each of the symbols, and remove it from the list if it is
4572 a type corresponding to a renaming that is out of the scope of
4573 the current block. */
4578 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4579 == ADA_OBJECT_RENAMING
4580 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4583 for (j = i + 1; j < nsyms; j += 1)
4584 syms[j - 1] = syms[j];
4594 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4595 whose name and domain match NAME and DOMAIN respectively.
4596 If no match was found, then extend the search to "enclosing"
4597 routines (in other words, if we're inside a nested function,
4598 search the symbols defined inside the enclosing functions).
4600 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4603 ada_add_local_symbols (struct obstack *obstackp, const char *name,
4604 struct block *block, domain_enum domain,
4607 int block_depth = 0;
4609 while (block != NULL)
4612 ada_add_block_symbols (obstackp, block, name, domain, NULL, wild_match);
4614 /* If we found a non-function match, assume that's the one. */
4615 if (is_nonfunction (defns_collected (obstackp, 0),
4616 num_defns_collected (obstackp)))
4619 block = BLOCK_SUPERBLOCK (block);
4622 /* If no luck so far, try to find NAME as a local symbol in some lexically
4623 enclosing subprogram. */
4624 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
4625 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match);
4628 /* Add to OBSTACKP all non-local symbols whose name and domain match
4629 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4630 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4633 ada_add_non_local_symbols (struct obstack *obstackp, const char *name,
4634 domain_enum domain, int global,
4637 struct objfile *objfile;
4638 struct partial_symtab *ps;
4640 ALL_PSYMTABS (objfile, ps)
4644 || ada_lookup_partial_symbol (ps, name, global, domain, wild_match))
4646 struct symtab *s = PSYMTAB_TO_SYMTAB (ps);
4647 const int block_kind = global ? GLOBAL_BLOCK : STATIC_BLOCK;
4649 if (s == NULL || !s->primary)
4651 ada_add_block_symbols (obstackp,
4652 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), block_kind),
4653 name, domain, objfile, wild_match);
4658 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4659 scope and in global scopes, returning the number of matches. Sets
4660 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4661 indicating the symbols found and the blocks and symbol tables (if
4662 any) in which they were found. This vector are transient---good only to
4663 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4664 symbol match within the nest of blocks whose innermost member is BLOCK0,
4665 is the one match returned (no other matches in that or
4666 enclosing blocks is returned). If there are any matches in or
4667 surrounding BLOCK0, then these alone are returned. Otherwise, the
4668 search extends to global and file-scope (static) symbol tables.
4669 Names prefixed with "standard__" are handled specially: "standard__"
4670 is first stripped off, and only static and global symbols are searched. */
4673 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4674 domain_enum namespace,
4675 struct ada_symbol_info **results)
4678 struct block *block;
4684 obstack_free (&symbol_list_obstack, NULL);
4685 obstack_init (&symbol_list_obstack);
4689 /* Search specified block and its superiors. */
4691 wild_match = (strstr (name0, "__") == NULL);
4693 block = (struct block *) block0; /* FIXME: No cast ought to be
4694 needed, but adding const will
4695 have a cascade effect. */
4697 /* Special case: If the user specifies a symbol name inside package
4698 Standard, do a non-wild matching of the symbol name without
4699 the "standard__" prefix. This was primarily introduced in order
4700 to allow the user to specifically access the standard exceptions
4701 using, for instance, Standard.Constraint_Error when Constraint_Error
4702 is ambiguous (due to the user defining its own Constraint_Error
4703 entity inside its program). */
4704 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
4708 name = name0 + sizeof ("standard__") - 1;
4711 /* Check the non-global symbols. If we have ANY match, then we're done. */
4713 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
4715 if (num_defns_collected (&symbol_list_obstack) > 0)
4718 /* No non-global symbols found. Check our cache to see if we have
4719 already performed this search before. If we have, then return
4723 if (lookup_cached_symbol (name0, namespace, &sym, &block))
4726 add_defn_to_vec (&symbol_list_obstack, sym, block);
4730 /* Search symbols from all global blocks. */
4732 ada_add_non_local_symbols (&symbol_list_obstack, name, namespace, 1,
4735 /* Now add symbols from all per-file blocks if we've gotten no hits
4736 (not strictly correct, but perhaps better than an error). */
4738 if (num_defns_collected (&symbol_list_obstack) == 0)
4739 ada_add_non_local_symbols (&symbol_list_obstack, name, namespace, 0,
4743 ndefns = num_defns_collected (&symbol_list_obstack);
4744 *results = defns_collected (&symbol_list_obstack, 1);
4746 ndefns = remove_extra_symbols (*results, ndefns);
4749 cache_symbol (name0, namespace, NULL, NULL);
4751 if (ndefns == 1 && cacheIfUnique)
4752 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
4754 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
4760 ada_lookup_encoded_symbol (const char *name, const struct block *block0,
4761 domain_enum namespace, struct block **block_found)
4763 struct ada_symbol_info *candidates;
4766 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
4768 if (n_candidates == 0)
4771 if (block_found != NULL)
4772 *block_found = candidates[0].block;
4774 return fixup_symbol_section (candidates[0].sym, NULL);
4777 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4778 scope and in global scopes, or NULL if none. NAME is folded and
4779 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4780 choosing the first symbol if there are multiple choices.
4781 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4782 table in which the symbol was found (in both cases, these
4783 assignments occur only if the pointers are non-null). */
4785 ada_lookup_symbol (const char *name, const struct block *block0,
4786 domain_enum namespace, int *is_a_field_of_this)
4788 if (is_a_field_of_this != NULL)
4789 *is_a_field_of_this = 0;
4792 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
4793 block0, namespace, NULL);
4796 static struct symbol *
4797 ada_lookup_symbol_nonlocal (const char *name,
4798 const char *linkage_name,
4799 const struct block *block,
4800 const domain_enum domain)
4802 if (linkage_name == NULL)
4803 linkage_name = name;
4804 return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
4809 /* True iff STR is a possible encoded suffix of a normal Ada name
4810 that is to be ignored for matching purposes. Suffixes of parallel
4811 names (e.g., XVE) are not included here. Currently, the possible suffixes
4812 are given by any of the regular expressions:
4814 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4815 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4816 _E[0-9]+[bs]$ [protected object entry suffixes]
4817 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4819 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4820 match is performed. This sequence is used to differentiate homonyms,
4821 is an optional part of a valid name suffix. */
4824 is_name_suffix (const char *str)
4827 const char *matching;
4828 const int len = strlen (str);
4830 /* Skip optional leading __[0-9]+. */
4832 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
4835 while (isdigit (str[0]))
4841 if (str[0] == '.' || str[0] == '$')
4844 while (isdigit (matching[0]))
4846 if (matching[0] == '\0')
4852 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
4855 while (isdigit (matching[0]))
4857 if (matching[0] == '\0')
4862 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4863 with a N at the end. Unfortunately, the compiler uses the same
4864 convention for other internal types it creates. So treating
4865 all entity names that end with an "N" as a name suffix causes
4866 some regressions. For instance, consider the case of an enumerated
4867 type. To support the 'Image attribute, it creates an array whose
4869 Having a single character like this as a suffix carrying some
4870 information is a bit risky. Perhaps we should change the encoding
4871 to be something like "_N" instead. In the meantime, do not do
4872 the following check. */
4873 /* Protected Object Subprograms */
4874 if (len == 1 && str [0] == 'N')
4879 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
4882 while (isdigit (matching[0]))
4884 if ((matching[0] == 'b' || matching[0] == 's')
4885 && matching [1] == '\0')
4889 /* ??? We should not modify STR directly, as we are doing below. This
4890 is fine in this case, but may become problematic later if we find
4891 that this alternative did not work, and want to try matching
4892 another one from the begining of STR. Since we modified it, we
4893 won't be able to find the begining of the string anymore! */
4897 while (str[0] != '_' && str[0] != '\0')
4899 if (str[0] != 'n' && str[0] != 'b')
4905 if (str[0] == '\000')
4910 if (str[1] != '_' || str[2] == '\000')
4914 if (strcmp (str + 3, "JM") == 0)
4916 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4917 the LJM suffix in favor of the JM one. But we will
4918 still accept LJM as a valid suffix for a reasonable
4919 amount of time, just to allow ourselves to debug programs
4920 compiled using an older version of GNAT. */
4921 if (strcmp (str + 3, "LJM") == 0)
4925 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
4926 || str[4] == 'U' || str[4] == 'P')
4928 if (str[4] == 'R' && str[5] != 'T')
4932 if (!isdigit (str[2]))
4934 for (k = 3; str[k] != '\0'; k += 1)
4935 if (!isdigit (str[k]) && str[k] != '_')
4939 if (str[0] == '$' && isdigit (str[1]))
4941 for (k = 2; str[k] != '\0'; k += 1)
4942 if (!isdigit (str[k]) && str[k] != '_')
4949 /* Return non-zero if the string starting at NAME and ending before
4950 NAME_END contains no capital letters. */
4953 is_valid_name_for_wild_match (const char *name0)
4955 const char *decoded_name = ada_decode (name0);
4958 /* If the decoded name starts with an angle bracket, it means that
4959 NAME0 does not follow the GNAT encoding format. It should then
4960 not be allowed as a possible wild match. */
4961 if (decoded_name[0] == '<')
4964 for (i=0; decoded_name[i] != '\0'; i++)
4965 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
4971 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4972 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4973 informational suffixes of NAME (i.e., for which is_name_suffix is
4977 wild_match (const char *patn0, int patn_len, const char *name0)
4984 match = strstr (start, patn0);
4989 || (match > name0 + 1 && match[-1] == '_' && match[-2] == '_')
4990 || (match == name0 + 5 && strncmp ("_ada_", name0, 5) == 0))
4991 && is_name_suffix (match + patn_len))
4992 return (match == name0 || is_valid_name_for_wild_match (name0));
4998 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4999 vector *defn_symbols, updating the list of symbols in OBSTACKP
5000 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5001 OBJFILE is the section containing BLOCK.
5002 SYMTAB is recorded with each symbol added. */
5005 ada_add_block_symbols (struct obstack *obstackp,
5006 struct block *block, const char *name,
5007 domain_enum domain, struct objfile *objfile,
5010 struct dict_iterator iter;
5011 int name_len = strlen (name);
5012 /* A matching argument symbol, if any. */
5013 struct symbol *arg_sym;
5014 /* Set true when we find a matching non-argument symbol. */
5023 ALL_BLOCK_SYMBOLS (block, iter, sym)
5025 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5026 SYMBOL_DOMAIN (sym), domain)
5027 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
5029 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5031 else if (SYMBOL_IS_ARGUMENT (sym))
5036 add_defn_to_vec (obstackp,
5037 fixup_symbol_section (sym, objfile),
5045 ALL_BLOCK_SYMBOLS (block, iter, sym)
5047 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5048 SYMBOL_DOMAIN (sym), domain))
5050 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
5052 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
5054 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5056 if (SYMBOL_IS_ARGUMENT (sym))
5061 add_defn_to_vec (obstackp,
5062 fixup_symbol_section (sym, objfile),
5071 if (!found_sym && arg_sym != NULL)
5073 add_defn_to_vec (obstackp,
5074 fixup_symbol_section (arg_sym, objfile),
5083 ALL_BLOCK_SYMBOLS (block, iter, sym)
5085 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5086 SYMBOL_DOMAIN (sym), domain))
5090 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5093 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5095 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5100 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5102 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5104 if (SYMBOL_IS_ARGUMENT (sym))
5109 add_defn_to_vec (obstackp,
5110 fixup_symbol_section (sym, objfile),
5118 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5119 They aren't parameters, right? */
5120 if (!found_sym && arg_sym != NULL)
5122 add_defn_to_vec (obstackp,
5123 fixup_symbol_section (arg_sym, objfile),
5130 /* Symbol Completion */
5132 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5133 name in a form that's appropriate for the completion. The result
5134 does not need to be deallocated, but is only good until the next call.
5136 TEXT_LEN is equal to the length of TEXT.
5137 Perform a wild match if WILD_MATCH is set.
5138 ENCODED should be set if TEXT represents the start of a symbol name
5139 in its encoded form. */
5142 symbol_completion_match (const char *sym_name,
5143 const char *text, int text_len,
5144 int wild_match, int encoded)
5147 const int verbatim_match = (text[0] == '<');
5152 /* Strip the leading angle bracket. */
5157 /* First, test against the fully qualified name of the symbol. */
5159 if (strncmp (sym_name, text, text_len) == 0)
5162 if (match && !encoded)
5164 /* One needed check before declaring a positive match is to verify
5165 that iff we are doing a verbatim match, the decoded version
5166 of the symbol name starts with '<'. Otherwise, this symbol name
5167 is not a suitable completion. */
5168 const char *sym_name_copy = sym_name;
5169 int has_angle_bracket;
5171 sym_name = ada_decode (sym_name);
5172 has_angle_bracket = (sym_name[0] == '<');
5173 match = (has_angle_bracket == verbatim_match);
5174 sym_name = sym_name_copy;
5177 if (match && !verbatim_match)
5179 /* When doing non-verbatim match, another check that needs to
5180 be done is to verify that the potentially matching symbol name
5181 does not include capital letters, because the ada-mode would
5182 not be able to understand these symbol names without the
5183 angle bracket notation. */
5186 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5191 /* Second: Try wild matching... */
5193 if (!match && wild_match)
5195 /* Since we are doing wild matching, this means that TEXT
5196 may represent an unqualified symbol name. We therefore must
5197 also compare TEXT against the unqualified name of the symbol. */
5198 sym_name = ada_unqualified_name (ada_decode (sym_name));
5200 if (strncmp (sym_name, text, text_len) == 0)
5204 /* Finally: If we found a mach, prepare the result to return. */
5210 sym_name = add_angle_brackets (sym_name);
5213 sym_name = ada_decode (sym_name);
5218 typedef char *char_ptr;
5219 DEF_VEC_P (char_ptr);
5221 /* A companion function to ada_make_symbol_completion_list().
5222 Check if SYM_NAME represents a symbol which name would be suitable
5223 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5224 it is appended at the end of the given string vector SV.
5226 ORIG_TEXT is the string original string from the user command
5227 that needs to be completed. WORD is the entire command on which
5228 completion should be performed. These two parameters are used to
5229 determine which part of the symbol name should be added to the
5231 if WILD_MATCH is set, then wild matching is performed.
5232 ENCODED should be set if TEXT represents a symbol name in its
5233 encoded formed (in which case the completion should also be
5237 symbol_completion_add (VEC(char_ptr) **sv,
5238 const char *sym_name,
5239 const char *text, int text_len,
5240 const char *orig_text, const char *word,
5241 int wild_match, int encoded)
5243 const char *match = symbol_completion_match (sym_name, text, text_len,
5244 wild_match, encoded);
5250 /* We found a match, so add the appropriate completion to the given
5253 if (word == orig_text)
5255 completion = xmalloc (strlen (match) + 5);
5256 strcpy (completion, match);
5258 else if (word > orig_text)
5260 /* Return some portion of sym_name. */
5261 completion = xmalloc (strlen (match) + 5);
5262 strcpy (completion, match + (word - orig_text));
5266 /* Return some of ORIG_TEXT plus sym_name. */
5267 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5268 strncpy (completion, word, orig_text - word);
5269 completion[orig_text - word] = '\0';
5270 strcat (completion, match);
5273 VEC_safe_push (char_ptr, *sv, completion);
5276 /* Return a list of possible symbol names completing TEXT0. The list
5277 is NULL terminated. WORD is the entire command on which completion
5281 ada_make_symbol_completion_list (char *text0, char *word)
5287 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
5290 struct partial_symtab *ps;
5291 struct minimal_symbol *msymbol;
5292 struct objfile *objfile;
5293 struct block *b, *surrounding_static_block = 0;
5295 struct dict_iterator iter;
5297 if (text0[0] == '<')
5299 text = xstrdup (text0);
5300 make_cleanup (xfree, text);
5301 text_len = strlen (text);
5307 text = xstrdup (ada_encode (text0));
5308 make_cleanup (xfree, text);
5309 text_len = strlen (text);
5310 for (i = 0; i < text_len; i++)
5311 text[i] = tolower (text[i]);
5313 encoded = (strstr (text0, "__") != NULL);
5314 /* If the name contains a ".", then the user is entering a fully
5315 qualified entity name, and the match must not be done in wild
5316 mode. Similarly, if the user wants to complete what looks like
5317 an encoded name, the match must not be done in wild mode. */
5318 wild_match = (strchr (text0, '.') == NULL && !encoded);
5321 /* First, look at the partial symtab symbols. */
5322 ALL_PSYMTABS (objfile, ps)
5324 struct partial_symbol **psym;
5326 /* If the psymtab's been read in we'll get it when we search
5327 through the blockvector. */
5331 for (psym = objfile->global_psymbols.list + ps->globals_offset;
5332 psym < (objfile->global_psymbols.list + ps->globals_offset
5333 + ps->n_global_syms); psym++)
5336 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
5337 text, text_len, text0, word,
5338 wild_match, encoded);
5341 for (psym = objfile->static_psymbols.list + ps->statics_offset;
5342 psym < (objfile->static_psymbols.list + ps->statics_offset
5343 + ps->n_static_syms); psym++)
5346 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
5347 text, text_len, text0, word,
5348 wild_match, encoded);
5352 /* At this point scan through the misc symbol vectors and add each
5353 symbol you find to the list. Eventually we want to ignore
5354 anything that isn't a text symbol (everything else will be
5355 handled by the psymtab code above). */
5357 ALL_MSYMBOLS (objfile, msymbol)
5360 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
5361 text, text_len, text0, word, wild_match, encoded);
5364 /* Search upwards from currently selected frame (so that we can
5365 complete on local vars. */
5367 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5369 if (!BLOCK_SUPERBLOCK (b))
5370 surrounding_static_block = b; /* For elmin of dups */
5372 ALL_BLOCK_SYMBOLS (b, iter, sym)
5374 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5375 text, text_len, text0, word,
5376 wild_match, encoded);
5380 /* Go through the symtabs and check the externs and statics for
5381 symbols which match. */
5383 ALL_SYMTABS (objfile, s)
5386 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5387 ALL_BLOCK_SYMBOLS (b, iter, sym)
5389 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5390 text, text_len, text0, word,
5391 wild_match, encoded);
5395 ALL_SYMTABS (objfile, s)
5398 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5399 /* Don't do this block twice. */
5400 if (b == surrounding_static_block)
5402 ALL_BLOCK_SYMBOLS (b, iter, sym)
5404 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
5405 text, text_len, text0, word,
5406 wild_match, encoded);
5410 /* Append the closing NULL entry. */
5411 VEC_safe_push (char_ptr, completions, NULL);
5413 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5414 return the copy. It's unfortunate that we have to make a copy
5415 of an array that we're about to destroy, but there is nothing much
5416 we can do about it. Fortunately, it's typically not a very large
5419 const size_t completions_size =
5420 VEC_length (char_ptr, completions) * sizeof (char *);
5421 char **result = malloc (completions_size);
5423 memcpy (result, VEC_address (char_ptr, completions), completions_size);
5425 VEC_free (char_ptr, completions);
5432 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5433 for tagged types. */
5436 ada_is_dispatch_table_ptr_type (struct type *type)
5440 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5443 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5447 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5450 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5451 to be invisible to users. */
5454 ada_is_ignored_field (struct type *type, int field_num)
5456 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5459 /* Check the name of that field. */
5461 const char *name = TYPE_FIELD_NAME (type, field_num);
5463 /* Anonymous field names should not be printed.
5464 brobecker/2007-02-20: I don't think this can actually happen
5465 but we don't want to print the value of annonymous fields anyway. */
5469 /* A field named "_parent" is internally generated by GNAT for
5470 tagged types, and should not be printed either. */
5471 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5475 /* If this is the dispatch table of a tagged type, then ignore. */
5476 if (ada_is_tagged_type (type, 1)
5477 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5480 /* Not a special field, so it should not be ignored. */
5484 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5485 pointer or reference type whose ultimate target has a tag field. */
5488 ada_is_tagged_type (struct type *type, int refok)
5490 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5493 /* True iff TYPE represents the type of X'Tag */
5496 ada_is_tag_type (struct type *type)
5498 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5502 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5503 return (name != NULL
5504 && strcmp (name, "ada__tags__dispatch_table") == 0);
5508 /* The type of the tag on VAL. */
5511 ada_tag_type (struct value *val)
5513 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
5516 /* The value of the tag on VAL. */
5519 ada_value_tag (struct value *val)
5521 return ada_value_struct_elt (val, "_tag", 0);
5524 /* The value of the tag on the object of type TYPE whose contents are
5525 saved at VALADDR, if it is non-null, or is at memory address
5528 static struct value *
5529 value_tag_from_contents_and_address (struct type *type,
5530 const gdb_byte *valaddr,
5533 int tag_byte_offset, dummy1, dummy2;
5534 struct type *tag_type;
5535 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5538 const gdb_byte *valaddr1 = ((valaddr == NULL)
5540 : valaddr + tag_byte_offset);
5541 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5543 return value_from_contents_and_address (tag_type, valaddr1, address1);
5548 static struct type *
5549 type_from_tag (struct value *tag)
5551 const char *type_name = ada_tag_name (tag);
5552 if (type_name != NULL)
5553 return ada_find_any_type (ada_encode (type_name));
5564 static int ada_tag_name_1 (void *);
5565 static int ada_tag_name_2 (struct tag_args *);
5567 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5568 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5569 The value stored in ARGS->name is valid until the next call to
5573 ada_tag_name_1 (void *args0)
5575 struct tag_args *args = (struct tag_args *) args0;
5576 static char name[1024];
5580 val = ada_value_struct_elt (args->tag, "tsd", 1);
5582 return ada_tag_name_2 (args);
5583 val = ada_value_struct_elt (val, "expanded_name", 1);
5586 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5587 for (p = name; *p != '\0'; p += 1)
5594 /* Utility function for ada_tag_name_1 that tries the second
5595 representation for the dispatch table (in which there is no
5596 explicit 'tsd' field in the referent of the tag pointer, and instead
5597 the tsd pointer is stored just before the dispatch table. */
5600 ada_tag_name_2 (struct tag_args *args)
5602 struct type *info_type;
5603 static char name[1024];
5605 struct value *val, *valp;
5608 info_type = ada_find_any_type ("ada__tags__type_specific_data");
5609 if (info_type == NULL)
5611 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
5612 valp = value_cast (info_type, args->tag);
5615 val = value_ind (value_ptradd (valp,
5616 value_from_longest (builtin_type_int8, -1)));
5619 val = ada_value_struct_elt (val, "expanded_name", 1);
5622 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5623 for (p = name; *p != '\0'; p += 1)
5630 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5634 ada_tag_name (struct value *tag)
5636 struct tag_args args;
5637 if (!ada_is_tag_type (value_type (tag)))
5641 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
5645 /* The parent type of TYPE, or NULL if none. */
5648 ada_parent_type (struct type *type)
5652 type = ada_check_typedef (type);
5654 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
5657 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5658 if (ada_is_parent_field (type, i))
5660 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
5662 /* If the _parent field is a pointer, then dereference it. */
5663 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
5664 parent_type = TYPE_TARGET_TYPE (parent_type);
5665 /* If there is a parallel XVS type, get the actual base type. */
5666 parent_type = ada_get_base_type (parent_type);
5668 return ada_check_typedef (parent_type);
5674 /* True iff field number FIELD_NUM of structure type TYPE contains the
5675 parent-type (inherited) fields of a derived type. Assumes TYPE is
5676 a structure type with at least FIELD_NUM+1 fields. */
5679 ada_is_parent_field (struct type *type, int field_num)
5681 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5682 return (name != NULL
5683 && (strncmp (name, "PARENT", 6) == 0
5684 || strncmp (name, "_parent", 7) == 0));
5687 /* True iff field number FIELD_NUM of structure type TYPE is a
5688 transparent wrapper field (which should be silently traversed when doing
5689 field selection and flattened when printing). Assumes TYPE is a
5690 structure type with at least FIELD_NUM+1 fields. Such fields are always
5694 ada_is_wrapper_field (struct type *type, int field_num)
5696 const char *name = TYPE_FIELD_NAME (type, field_num);
5697 return (name != NULL
5698 && (strncmp (name, "PARENT", 6) == 0
5699 || strcmp (name, "REP") == 0
5700 || strncmp (name, "_parent", 7) == 0
5701 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
5704 /* True iff field number FIELD_NUM of structure or union type TYPE
5705 is a variant wrapper. Assumes TYPE is a structure type with at least
5706 FIELD_NUM+1 fields. */
5709 ada_is_variant_part (struct type *type, int field_num)
5711 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5712 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
5713 || (is_dynamic_field (type, field_num)
5714 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
5715 == TYPE_CODE_UNION)));
5718 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5719 whose discriminants are contained in the record type OUTER_TYPE,
5720 returns the type of the controlling discriminant for the variant. */
5723 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
5725 char *name = ada_variant_discrim_name (var_type);
5727 ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
5729 return builtin_type_int32;
5734 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5735 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5736 represents a 'when others' clause; otherwise 0. */
5739 ada_is_others_clause (struct type *type, int field_num)
5741 const char *name = TYPE_FIELD_NAME (type, field_num);
5742 return (name != NULL && name[0] == 'O');
5745 /* Assuming that TYPE0 is the type of the variant part of a record,
5746 returns the name of the discriminant controlling the variant.
5747 The value is valid until the next call to ada_variant_discrim_name. */
5750 ada_variant_discrim_name (struct type *type0)
5752 static char *result = NULL;
5753 static size_t result_len = 0;
5756 const char *discrim_end;
5757 const char *discrim_start;
5759 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
5760 type = TYPE_TARGET_TYPE (type0);
5764 name = ada_type_name (type);
5766 if (name == NULL || name[0] == '\000')
5769 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
5772 if (strncmp (discrim_end, "___XVN", 6) == 0)
5775 if (discrim_end == name)
5778 for (discrim_start = discrim_end; discrim_start != name + 3;
5781 if (discrim_start == name + 1)
5783 if ((discrim_start > name + 3
5784 && strncmp (discrim_start - 3, "___", 3) == 0)
5785 || discrim_start[-1] == '.')
5789 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
5790 strncpy (result, discrim_start, discrim_end - discrim_start);
5791 result[discrim_end - discrim_start] = '\0';
5795 /* Scan STR for a subtype-encoded number, beginning at position K.
5796 Put the position of the character just past the number scanned in
5797 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5798 Return 1 if there was a valid number at the given position, and 0
5799 otherwise. A "subtype-encoded" number consists of the absolute value
5800 in decimal, followed by the letter 'm' to indicate a negative number.
5801 Assumes 0m does not occur. */
5804 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
5808 if (!isdigit (str[k]))
5811 /* Do it the hard way so as not to make any assumption about
5812 the relationship of unsigned long (%lu scan format code) and
5815 while (isdigit (str[k]))
5817 RU = RU * 10 + (str[k] - '0');
5824 *R = (-(LONGEST) (RU - 1)) - 1;
5830 /* NOTE on the above: Technically, C does not say what the results of
5831 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5832 number representable as a LONGEST (although either would probably work
5833 in most implementations). When RU>0, the locution in the then branch
5834 above is always equivalent to the negative of RU. */
5841 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5842 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5843 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5846 ada_in_variant (LONGEST val, struct type *type, int field_num)
5848 const char *name = TYPE_FIELD_NAME (type, field_num);
5861 if (!ada_scan_number (name, p + 1, &W, &p))
5870 if (!ada_scan_number (name, p + 1, &L, &p)
5871 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
5873 if (val >= L && val <= U)
5885 /* FIXME: Lots of redundancy below. Try to consolidate. */
5887 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5888 ARG_TYPE, extract and return the value of one of its (non-static)
5889 fields. FIELDNO says which field. Differs from value_primitive_field
5890 only in that it can handle packed values of arbitrary type. */
5892 static struct value *
5893 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
5894 struct type *arg_type)
5898 arg_type = ada_check_typedef (arg_type);
5899 type = TYPE_FIELD_TYPE (arg_type, fieldno);
5901 /* Handle packed fields. */
5903 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
5905 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
5906 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
5908 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
5909 offset + bit_pos / 8,
5910 bit_pos % 8, bit_size, type);
5913 return value_primitive_field (arg1, offset, fieldno, arg_type);
5916 /* Find field with name NAME in object of type TYPE. If found,
5917 set the following for each argument that is non-null:
5918 - *FIELD_TYPE_P to the field's type;
5919 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5920 an object of that type;
5921 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5922 - *BIT_SIZE_P to its size in bits if the field is packed, and
5924 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5925 fields up to but not including the desired field, or by the total
5926 number of fields if not found. A NULL value of NAME never
5927 matches; the function just counts visible fields in this case.
5929 Returns 1 if found, 0 otherwise. */
5932 find_struct_field (char *name, struct type *type, int offset,
5933 struct type **field_type_p,
5934 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
5939 type = ada_check_typedef (type);
5941 if (field_type_p != NULL)
5942 *field_type_p = NULL;
5943 if (byte_offset_p != NULL)
5945 if (bit_offset_p != NULL)
5947 if (bit_size_p != NULL)
5950 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5952 int bit_pos = TYPE_FIELD_BITPOS (type, i);
5953 int fld_offset = offset + bit_pos / 8;
5954 char *t_field_name = TYPE_FIELD_NAME (type, i);
5956 if (t_field_name == NULL)
5959 else if (name != NULL && field_name_match (t_field_name, name))
5961 int bit_size = TYPE_FIELD_BITSIZE (type, i);
5962 if (field_type_p != NULL)
5963 *field_type_p = TYPE_FIELD_TYPE (type, i);
5964 if (byte_offset_p != NULL)
5965 *byte_offset_p = fld_offset;
5966 if (bit_offset_p != NULL)
5967 *bit_offset_p = bit_pos % 8;
5968 if (bit_size_p != NULL)
5969 *bit_size_p = bit_size;
5972 else if (ada_is_wrapper_field (type, i))
5974 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
5975 field_type_p, byte_offset_p, bit_offset_p,
5976 bit_size_p, index_p))
5979 else if (ada_is_variant_part (type, i))
5981 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5984 struct type *field_type
5985 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5987 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
5989 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
5991 + TYPE_FIELD_BITPOS (field_type, j) / 8,
5992 field_type_p, byte_offset_p,
5993 bit_offset_p, bit_size_p, index_p))
5997 else if (index_p != NULL)
6003 /* Number of user-visible fields in record type TYPE. */
6006 num_visible_fields (struct type *type)
6010 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6014 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6015 and search in it assuming it has (class) type TYPE.
6016 If found, return value, else return NULL.
6018 Searches recursively through wrapper fields (e.g., '_parent'). */
6020 static struct value *
6021 ada_search_struct_field (char *name, struct value *arg, int offset,
6025 type = ada_check_typedef (type);
6027 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6029 char *t_field_name = TYPE_FIELD_NAME (type, i);
6031 if (t_field_name == NULL)
6034 else if (field_name_match (t_field_name, name))
6035 return ada_value_primitive_field (arg, offset, i, type);
6037 else if (ada_is_wrapper_field (type, i))
6039 struct value *v = /* Do not let indent join lines here. */
6040 ada_search_struct_field (name, arg,
6041 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6042 TYPE_FIELD_TYPE (type, i));
6047 else if (ada_is_variant_part (type, i))
6049 /* PNH: Do we ever get here? See find_struct_field. */
6051 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6052 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6054 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6056 struct value *v = ada_search_struct_field /* Force line break. */
6058 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6059 TYPE_FIELD_TYPE (field_type, j));
6068 static struct value *ada_index_struct_field_1 (int *, struct value *,
6069 int, struct type *);
6072 /* Return field #INDEX in ARG, where the index is that returned by
6073 * find_struct_field through its INDEX_P argument. Adjust the address
6074 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6075 * If found, return value, else return NULL. */
6077 static struct value *
6078 ada_index_struct_field (int index, struct value *arg, int offset,
6081 return ada_index_struct_field_1 (&index, arg, offset, type);
6085 /* Auxiliary function for ada_index_struct_field. Like
6086 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6089 static struct value *
6090 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6094 type = ada_check_typedef (type);
6096 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6098 if (TYPE_FIELD_NAME (type, i) == NULL)
6100 else if (ada_is_wrapper_field (type, i))
6102 struct value *v = /* Do not let indent join lines here. */
6103 ada_index_struct_field_1 (index_p, arg,
6104 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6105 TYPE_FIELD_TYPE (type, i));
6110 else if (ada_is_variant_part (type, i))
6112 /* PNH: Do we ever get here? See ada_search_struct_field,
6113 find_struct_field. */
6114 error (_("Cannot assign this kind of variant record"));
6116 else if (*index_p == 0)
6117 return ada_value_primitive_field (arg, offset, i, type);
6124 /* Given ARG, a value of type (pointer or reference to a)*
6125 structure/union, extract the component named NAME from the ultimate
6126 target structure/union and return it as a value with its
6129 The routine searches for NAME among all members of the structure itself
6130 and (recursively) among all members of any wrapper members
6133 If NO_ERR, then simply return NULL in case of error, rather than
6137 ada_value_struct_elt (struct value *arg, char *name, int no_err)
6139 struct type *t, *t1;
6143 t1 = t = ada_check_typedef (value_type (arg));
6144 if (TYPE_CODE (t) == TYPE_CODE_REF)
6146 t1 = TYPE_TARGET_TYPE (t);
6149 t1 = ada_check_typedef (t1);
6150 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6152 arg = coerce_ref (arg);
6157 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6159 t1 = TYPE_TARGET_TYPE (t);
6162 t1 = ada_check_typedef (t1);
6163 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
6165 arg = value_ind (arg);
6172 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
6176 v = ada_search_struct_field (name, arg, 0, t);
6179 int bit_offset, bit_size, byte_offset;
6180 struct type *field_type;
6183 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6184 address = value_as_address (arg);
6186 address = unpack_pointer (t, value_contents (arg));
6188 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
6189 if (find_struct_field (name, t1, 0,
6190 &field_type, &byte_offset, &bit_offset,
6195 if (TYPE_CODE (t) == TYPE_CODE_REF)
6196 arg = ada_coerce_ref (arg);
6198 arg = ada_value_ind (arg);
6199 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6200 bit_offset, bit_size,
6204 v = value_at_lazy (field_type, address + byte_offset);
6208 if (v != NULL || no_err)
6211 error (_("There is no member named %s."), name);
6217 error (_("Attempt to extract a component of a value that is not a record."));
6220 /* Given a type TYPE, look up the type of the component of type named NAME.
6221 If DISPP is non-null, add its byte displacement from the beginning of a
6222 structure (pointed to by a value) of type TYPE to *DISPP (does not
6223 work for packed fields).
6225 Matches any field whose name has NAME as a prefix, possibly
6228 TYPE can be either a struct or union. If REFOK, TYPE may also
6229 be a (pointer or reference)+ to a struct or union, and the
6230 ultimate target type will be searched.
6232 Looks recursively into variant clauses and parent types.
6234 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6235 TYPE is not a type of the right kind. */
6237 static struct type *
6238 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6239 int noerr, int *dispp)
6246 if (refok && type != NULL)
6249 type = ada_check_typedef (type);
6250 if (TYPE_CODE (type) != TYPE_CODE_PTR
6251 && TYPE_CODE (type) != TYPE_CODE_REF)
6253 type = TYPE_TARGET_TYPE (type);
6257 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6258 && TYPE_CODE (type) != TYPE_CODE_UNION))
6264 target_terminal_ours ();
6265 gdb_flush (gdb_stdout);
6267 error (_("Type (null) is not a structure or union type"));
6270 /* XXX: type_sprint */
6271 fprintf_unfiltered (gdb_stderr, _("Type "));
6272 type_print (type, "", gdb_stderr, -1);
6273 error (_(" is not a structure or union type"));
6278 type = to_static_fixed_type (type);
6280 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6282 char *t_field_name = TYPE_FIELD_NAME (type, i);
6286 if (t_field_name == NULL)
6289 else if (field_name_match (t_field_name, name))
6292 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
6293 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6296 else if (ada_is_wrapper_field (type, i))
6299 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6304 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6309 else if (ada_is_variant_part (type, i))
6312 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6314 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6316 /* FIXME pnh 2008/01/26: We check for a field that is
6317 NOT wrapped in a struct, since the compiler sometimes
6318 generates these for unchecked variant types. Revisit
6319 if the compiler changes this practice. */
6320 char *v_field_name = TYPE_FIELD_NAME (field_type, j);
6322 if (v_field_name != NULL
6323 && field_name_match (v_field_name, name))
6324 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6326 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
6332 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6343 target_terminal_ours ();
6344 gdb_flush (gdb_stdout);
6347 /* XXX: type_sprint */
6348 fprintf_unfiltered (gdb_stderr, _("Type "));
6349 type_print (type, "", gdb_stderr, -1);
6350 error (_(" has no component named <null>"));
6354 /* XXX: type_sprint */
6355 fprintf_unfiltered (gdb_stderr, _("Type "));
6356 type_print (type, "", gdb_stderr, -1);
6357 error (_(" has no component named %s"), name);
6364 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6365 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6366 represents an unchecked union (that is, the variant part of a
6367 record that is named in an Unchecked_Union pragma). */
6370 is_unchecked_variant (struct type *var_type, struct type *outer_type)
6372 char *discrim_name = ada_variant_discrim_name (var_type);
6373 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6378 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6379 within a value of type OUTER_TYPE that is stored in GDB at
6380 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6381 numbering from 0) is applicable. Returns -1 if none are. */
6384 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
6385 const gdb_byte *outer_valaddr)
6389 char *discrim_name = ada_variant_discrim_name (var_type);
6390 struct value *outer;
6391 struct value *discrim;
6392 LONGEST discrim_val;
6394 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6395 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6396 if (discrim == NULL)
6398 discrim_val = value_as_long (discrim);
6401 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6403 if (ada_is_others_clause (var_type, i))
6405 else if (ada_in_variant (discrim_val, var_type, i))
6409 return others_clause;
6414 /* Dynamic-Sized Records */
6416 /* Strategy: The type ostensibly attached to a value with dynamic size
6417 (i.e., a size that is not statically recorded in the debugging
6418 data) does not accurately reflect the size or layout of the value.
6419 Our strategy is to convert these values to values with accurate,
6420 conventional types that are constructed on the fly. */
6422 /* There is a subtle and tricky problem here. In general, we cannot
6423 determine the size of dynamic records without its data. However,
6424 the 'struct value' data structure, which GDB uses to represent
6425 quantities in the inferior process (the target), requires the size
6426 of the type at the time of its allocation in order to reserve space
6427 for GDB's internal copy of the data. That's why the
6428 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6429 rather than struct value*s.
6431 However, GDB's internal history variables ($1, $2, etc.) are
6432 struct value*s containing internal copies of the data that are not, in
6433 general, the same as the data at their corresponding addresses in
6434 the target. Fortunately, the types we give to these values are all
6435 conventional, fixed-size types (as per the strategy described
6436 above), so that we don't usually have to perform the
6437 'to_fixed_xxx_type' conversions to look at their values.
6438 Unfortunately, there is one exception: if one of the internal
6439 history variables is an array whose elements are unconstrained
6440 records, then we will need to create distinct fixed types for each
6441 element selected. */
6443 /* The upshot of all of this is that many routines take a (type, host
6444 address, target address) triple as arguments to represent a value.
6445 The host address, if non-null, is supposed to contain an internal
6446 copy of the relevant data; otherwise, the program is to consult the
6447 target at the target address. */
6449 /* Assuming that VAL0 represents a pointer value, the result of
6450 dereferencing it. Differs from value_ind in its treatment of
6451 dynamic-sized types. */
6454 ada_value_ind (struct value *val0)
6456 struct value *val = unwrap_value (value_ind (val0));
6457 return ada_to_fixed_value (val);
6460 /* The value resulting from dereferencing any "reference to"
6461 qualifiers on VAL0. */
6463 static struct value *
6464 ada_coerce_ref (struct value *val0)
6466 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
6468 struct value *val = val0;
6469 val = coerce_ref (val);
6470 val = unwrap_value (val);
6471 return ada_to_fixed_value (val);
6477 /* Return OFF rounded upward if necessary to a multiple of
6478 ALIGNMENT (a power of 2). */
6481 align_value (unsigned int off, unsigned int alignment)
6483 return (off + alignment - 1) & ~(alignment - 1);
6486 /* Return the bit alignment required for field #F of template type TYPE. */
6489 field_alignment (struct type *type, int f)
6491 const char *name = TYPE_FIELD_NAME (type, f);
6495 /* The field name should never be null, unless the debugging information
6496 is somehow malformed. In this case, we assume the field does not
6497 require any alignment. */
6501 len = strlen (name);
6503 if (!isdigit (name[len - 1]))
6506 if (isdigit (name[len - 2]))
6507 align_offset = len - 2;
6509 align_offset = len - 1;
6511 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
6512 return TARGET_CHAR_BIT;
6514 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6517 /* Find a symbol named NAME. Ignores ambiguity. */
6520 ada_find_any_symbol (const char *name)
6524 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6525 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6528 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6532 /* Find a type named NAME. Ignores ambiguity. */
6535 ada_find_any_type (const char *name)
6537 struct symbol *sym = ada_find_any_symbol (name);
6538 struct type *type = NULL;
6541 type = SYMBOL_TYPE (sym);
6544 type = language_lookup_primitive_type_by_name
6545 (language_def (language_ada), current_gdbarch, name);
6550 /* Given NAME and an associated BLOCK, search all symbols for
6551 NAME suffixed with "___XR", which is the ``renaming'' symbol
6552 associated to NAME. Return this symbol if found, return
6556 ada_find_renaming_symbol (const char *name, struct block *block)
6560 sym = find_old_style_renaming_symbol (name, block);
6565 /* Not right yet. FIXME pnh 7/20/2007. */
6566 sym = ada_find_any_symbol (name);
6567 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
6573 static struct symbol *
6574 find_old_style_renaming_symbol (const char *name, struct block *block)
6576 const struct symbol *function_sym = block_linkage_function (block);
6579 if (function_sym != NULL)
6581 /* If the symbol is defined inside a function, NAME is not fully
6582 qualified. This means we need to prepend the function name
6583 as well as adding the ``___XR'' suffix to build the name of
6584 the associated renaming symbol. */
6585 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
6586 /* Function names sometimes contain suffixes used
6587 for instance to qualify nested subprograms. When building
6588 the XR type name, we need to make sure that this suffix is
6589 not included. So do not include any suffix in the function
6590 name length below. */
6591 const int function_name_len = ada_name_prefix_len (function_name);
6592 const int rename_len = function_name_len + 2 /* "__" */
6593 + strlen (name) + 6 /* "___XR\0" */ ;
6595 /* Strip the suffix if necessary. */
6596 function_name[function_name_len] = '\0';
6598 /* Library-level functions are a special case, as GNAT adds
6599 a ``_ada_'' prefix to the function name to avoid namespace
6600 pollution. However, the renaming symbols themselves do not
6601 have this prefix, so we need to skip this prefix if present. */
6602 if (function_name_len > 5 /* "_ada_" */
6603 && strstr (function_name, "_ada_") == function_name)
6604 function_name = function_name + 5;
6606 rename = (char *) alloca (rename_len * sizeof (char));
6607 sprintf (rename, "%s__%s___XR", function_name, name);
6611 const int rename_len = strlen (name) + 6;
6612 rename = (char *) alloca (rename_len * sizeof (char));
6613 sprintf (rename, "%s___XR", name);
6616 return ada_find_any_symbol (rename);
6619 /* Because of GNAT encoding conventions, several GDB symbols may match a
6620 given type name. If the type denoted by TYPE0 is to be preferred to
6621 that of TYPE1 for purposes of type printing, return non-zero;
6622 otherwise return 0. */
6625 ada_prefer_type (struct type *type0, struct type *type1)
6629 else if (type0 == NULL)
6631 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
6633 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
6635 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
6637 else if (ada_is_packed_array_type (type0))
6639 else if (ada_is_array_descriptor_type (type0)
6640 && !ada_is_array_descriptor_type (type1))
6644 const char *type0_name = type_name_no_tag (type0);
6645 const char *type1_name = type_name_no_tag (type1);
6647 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
6648 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
6654 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6655 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6658 ada_type_name (struct type *type)
6662 else if (TYPE_NAME (type) != NULL)
6663 return TYPE_NAME (type);
6665 return TYPE_TAG_NAME (type);
6668 /* Find a parallel type to TYPE whose name is formed by appending
6669 SUFFIX to the name of TYPE. */
6672 ada_find_parallel_type (struct type *type, const char *suffix)
6675 static size_t name_len = 0;
6677 char *typename = ada_type_name (type);
6679 if (typename == NULL)
6682 len = strlen (typename);
6684 GROW_VECT (name, name_len, len + strlen (suffix) + 1);
6686 strcpy (name, typename);
6687 strcpy (name + len, suffix);
6689 return ada_find_any_type (name);
6693 /* If TYPE is a variable-size record type, return the corresponding template
6694 type describing its fields. Otherwise, return NULL. */
6696 static struct type *
6697 dynamic_template_type (struct type *type)
6699 type = ada_check_typedef (type);
6701 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
6702 || ada_type_name (type) == NULL)
6706 int len = strlen (ada_type_name (type));
6707 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
6710 return ada_find_parallel_type (type, "___XVE");
6714 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6715 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6718 is_dynamic_field (struct type *templ_type, int field_num)
6720 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
6722 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
6723 && strstr (name, "___XVL") != NULL;
6726 /* The index of the variant field of TYPE, or -1 if TYPE does not
6727 represent a variant record type. */
6730 variant_field_index (struct type *type)
6734 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6737 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
6739 if (ada_is_variant_part (type, f))
6745 /* A record type with no fields. */
6747 static struct type *
6748 empty_record (struct objfile *objfile)
6750 struct type *type = alloc_type (objfile);
6751 TYPE_CODE (type) = TYPE_CODE_STRUCT;
6752 TYPE_NFIELDS (type) = 0;
6753 TYPE_FIELDS (type) = NULL;
6754 INIT_CPLUS_SPECIFIC (type);
6755 TYPE_NAME (type) = "<empty>";
6756 TYPE_TAG_NAME (type) = NULL;
6757 TYPE_LENGTH (type) = 0;
6761 /* An ordinary record type (with fixed-length fields) that describes
6762 the value of type TYPE at VALADDR or ADDRESS (see comments at
6763 the beginning of this section) VAL according to GNAT conventions.
6764 DVAL0 should describe the (portion of a) record that contains any
6765 necessary discriminants. It should be NULL if value_type (VAL) is
6766 an outer-level type (i.e., as opposed to a branch of a variant.) A
6767 variant field (unless unchecked) is replaced by a particular branch
6770 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6771 length are not statically known are discarded. As a consequence,
6772 VALADDR, ADDRESS and DVAL0 are ignored.
6774 NOTE: Limitations: For now, we assume that dynamic fields and
6775 variants occupy whole numbers of bytes. However, they need not be
6779 ada_template_to_fixed_record_type_1 (struct type *type,
6780 const gdb_byte *valaddr,
6781 CORE_ADDR address, struct value *dval0,
6782 int keep_dynamic_fields)
6784 struct value *mark = value_mark ();
6787 int nfields, bit_len;
6790 int fld_bit_len, bit_incr;
6793 /* Compute the number of fields in this record type that are going
6794 to be processed: unless keep_dynamic_fields, this includes only
6795 fields whose position and length are static will be processed. */
6796 if (keep_dynamic_fields)
6797 nfields = TYPE_NFIELDS (type);
6801 while (nfields < TYPE_NFIELDS (type)
6802 && !ada_is_variant_part (type, nfields)
6803 && !is_dynamic_field (type, nfields))
6807 rtype = alloc_type (TYPE_OBJFILE (type));
6808 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
6809 INIT_CPLUS_SPECIFIC (rtype);
6810 TYPE_NFIELDS (rtype) = nfields;
6811 TYPE_FIELDS (rtype) = (struct field *)
6812 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6813 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
6814 TYPE_NAME (rtype) = ada_type_name (type);
6815 TYPE_TAG_NAME (rtype) = NULL;
6816 TYPE_FIXED_INSTANCE (rtype) = 1;
6822 for (f = 0; f < nfields; f += 1)
6824 off = align_value (off, field_alignment (type, f))
6825 + TYPE_FIELD_BITPOS (type, f);
6826 TYPE_FIELD_BITPOS (rtype, f) = off;
6827 TYPE_FIELD_BITSIZE (rtype, f) = 0;
6829 if (ada_is_variant_part (type, f))
6832 fld_bit_len = bit_incr = 0;
6834 else if (is_dynamic_field (type, f))
6838 /* rtype's length is computed based on the run-time
6839 value of discriminants. If the discriminants are not
6840 initialized, the type size may be completely bogus and
6841 GDB may fail to allocate a value for it. So check the
6842 size first before creating the value. */
6844 dval = value_from_contents_and_address (rtype, valaddr, address);
6849 /* Get the fixed type of the field. Note that, in this case, we
6850 do not want to get the real type out of the tag: if the current
6851 field is the parent part of a tagged record, we will get the
6852 tag of the object. Clearly wrong: the real type of the parent
6853 is not the real type of the child. We would end up in an infinite
6855 TYPE_FIELD_TYPE (rtype, f) =
6858 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))),
6859 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6860 cond_offset_target (address, off / TARGET_CHAR_BIT), dval, 0);
6861 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6862 bit_incr = fld_bit_len =
6863 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
6867 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
6868 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6869 if (TYPE_FIELD_BITSIZE (type, f) > 0)
6870 bit_incr = fld_bit_len =
6871 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
6873 bit_incr = fld_bit_len =
6874 TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
6876 if (off + fld_bit_len > bit_len)
6877 bit_len = off + fld_bit_len;
6879 TYPE_LENGTH (rtype) =
6880 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6883 /* We handle the variant part, if any, at the end because of certain
6884 odd cases in which it is re-ordered so as NOT to be the last field of
6885 the record. This can happen in the presence of representation
6887 if (variant_field >= 0)
6889 struct type *branch_type;
6891 off = TYPE_FIELD_BITPOS (rtype, variant_field);
6894 dval = value_from_contents_and_address (rtype, valaddr, address);
6899 to_fixed_variant_branch_type
6900 (TYPE_FIELD_TYPE (type, variant_field),
6901 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6902 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
6903 if (branch_type == NULL)
6905 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
6906 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
6907 TYPE_NFIELDS (rtype) -= 1;
6911 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6912 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6914 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
6916 if (off + fld_bit_len > bit_len)
6917 bit_len = off + fld_bit_len;
6918 TYPE_LENGTH (rtype) =
6919 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6923 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6924 should contain the alignment of that record, which should be a strictly
6925 positive value. If null or negative, then something is wrong, most
6926 probably in the debug info. In that case, we don't round up the size
6927 of the resulting type. If this record is not part of another structure,
6928 the current RTYPE length might be good enough for our purposes. */
6929 if (TYPE_LENGTH (type) <= 0)
6931 if (TYPE_NAME (rtype))
6932 warning (_("Invalid type size for `%s' detected: %d."),
6933 TYPE_NAME (rtype), TYPE_LENGTH (type));
6935 warning (_("Invalid type size for <unnamed> detected: %d."),
6936 TYPE_LENGTH (type));
6940 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
6941 TYPE_LENGTH (type));
6944 value_free_to_mark (mark);
6945 if (TYPE_LENGTH (rtype) > varsize_limit)
6946 error (_("record type with dynamic size is larger than varsize-limit"));
6950 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6953 static struct type *
6954 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
6955 CORE_ADDR address, struct value *dval0)
6957 return ada_template_to_fixed_record_type_1 (type, valaddr,
6961 /* An ordinary record type in which ___XVL-convention fields and
6962 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6963 static approximations, containing all possible fields. Uses
6964 no runtime values. Useless for use in values, but that's OK,
6965 since the results are used only for type determinations. Works on both
6966 structs and unions. Representation note: to save space, we memorize
6967 the result of this function in the TYPE_TARGET_TYPE of the
6970 static struct type *
6971 template_to_static_fixed_type (struct type *type0)
6977 if (TYPE_TARGET_TYPE (type0) != NULL)
6978 return TYPE_TARGET_TYPE (type0);
6980 nfields = TYPE_NFIELDS (type0);
6983 for (f = 0; f < nfields; f += 1)
6985 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
6986 struct type *new_type;
6988 if (is_dynamic_field (type0, f))
6989 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
6991 new_type = static_unwrap_type (field_type);
6992 if (type == type0 && new_type != field_type)
6994 TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
6995 TYPE_CODE (type) = TYPE_CODE (type0);
6996 INIT_CPLUS_SPECIFIC (type);
6997 TYPE_NFIELDS (type) = nfields;
6998 TYPE_FIELDS (type) = (struct field *)
6999 TYPE_ALLOC (type, nfields * sizeof (struct field));
7000 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7001 sizeof (struct field) * nfields);
7002 TYPE_NAME (type) = ada_type_name (type0);
7003 TYPE_TAG_NAME (type) = NULL;
7004 TYPE_FIXED_INSTANCE (type) = 1;
7005 TYPE_LENGTH (type) = 0;
7007 TYPE_FIELD_TYPE (type, f) = new_type;
7008 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
7013 /* Given an object of type TYPE whose contents are at VALADDR and
7014 whose address in memory is ADDRESS, returns a revision of TYPE,
7015 which should be a non-dynamic-sized record, in which the variant
7016 part, if any, is replaced with the appropriate branch. Looks
7017 for discriminant values in DVAL0, which can be NULL if the record
7018 contains the necessary discriminant values. */
7020 static struct type *
7021 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
7022 CORE_ADDR address, struct value *dval0)
7024 struct value *mark = value_mark ();
7027 struct type *branch_type;
7028 int nfields = TYPE_NFIELDS (type);
7029 int variant_field = variant_field_index (type);
7031 if (variant_field == -1)
7035 dval = value_from_contents_and_address (type, valaddr, address);
7039 rtype = alloc_type (TYPE_OBJFILE (type));
7040 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7041 INIT_CPLUS_SPECIFIC (rtype);
7042 TYPE_NFIELDS (rtype) = nfields;
7043 TYPE_FIELDS (rtype) =
7044 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7045 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
7046 sizeof (struct field) * nfields);
7047 TYPE_NAME (rtype) = ada_type_name (type);
7048 TYPE_TAG_NAME (rtype) = NULL;
7049 TYPE_FIXED_INSTANCE (rtype) = 1;
7050 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7052 branch_type = to_fixed_variant_branch_type
7053 (TYPE_FIELD_TYPE (type, variant_field),
7054 cond_offset_host (valaddr,
7055 TYPE_FIELD_BITPOS (type, variant_field)
7057 cond_offset_target (address,
7058 TYPE_FIELD_BITPOS (type, variant_field)
7059 / TARGET_CHAR_BIT), dval);
7060 if (branch_type == NULL)
7063 for (f = variant_field + 1; f < nfields; f += 1)
7064 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7065 TYPE_NFIELDS (rtype) -= 1;
7069 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7070 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7071 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
7072 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
7074 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
7076 value_free_to_mark (mark);
7080 /* An ordinary record type (with fixed-length fields) that describes
7081 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7082 beginning of this section]. Any necessary discriminants' values
7083 should be in DVAL, a record value; it may be NULL if the object
7084 at ADDR itself contains any necessary discriminant values.
7085 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7086 values from the record are needed. Except in the case that DVAL,
7087 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7088 unchecked) is replaced by a particular branch of the variant.
7090 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7091 is questionable and may be removed. It can arise during the
7092 processing of an unconstrained-array-of-record type where all the
7093 variant branches have exactly the same size. This is because in
7094 such cases, the compiler does not bother to use the XVS convention
7095 when encoding the record. I am currently dubious of this
7096 shortcut and suspect the compiler should be altered. FIXME. */
7098 static struct type *
7099 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
7100 CORE_ADDR address, struct value *dval)
7102 struct type *templ_type;
7104 if (TYPE_FIXED_INSTANCE (type0))
7107 templ_type = dynamic_template_type (type0);
7109 if (templ_type != NULL)
7110 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
7111 else if (variant_field_index (type0) >= 0)
7113 if (dval == NULL && valaddr == NULL && address == 0)
7115 return to_record_with_fixed_variant_part (type0, valaddr, address,
7120 TYPE_FIXED_INSTANCE (type0) = 1;
7126 /* An ordinary record type (with fixed-length fields) that describes
7127 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7128 union type. Any necessary discriminants' values should be in DVAL,
7129 a record value. That is, this routine selects the appropriate
7130 branch of the union at ADDR according to the discriminant value
7131 indicated in the union's type name. Returns VAR_TYPE0 itself if
7132 it represents a variant subject to a pragma Unchecked_Union. */
7134 static struct type *
7135 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
7136 CORE_ADDR address, struct value *dval)
7139 struct type *templ_type;
7140 struct type *var_type;
7142 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7143 var_type = TYPE_TARGET_TYPE (var_type0);
7145 var_type = var_type0;
7147 templ_type = ada_find_parallel_type (var_type, "___XVU");
7149 if (templ_type != NULL)
7150 var_type = templ_type;
7152 if (is_unchecked_variant (var_type, value_type (dval)))
7155 ada_which_variant_applies (var_type,
7156 value_type (dval), value_contents (dval));
7159 return empty_record (TYPE_OBJFILE (var_type));
7160 else if (is_dynamic_field (var_type, which))
7161 return to_fixed_record_type
7162 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7163 valaddr, address, dval);
7164 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
7166 to_fixed_record_type
7167 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
7169 return TYPE_FIELD_TYPE (var_type, which);
7172 /* Assuming that TYPE0 is an array type describing the type of a value
7173 at ADDR, and that DVAL describes a record containing any
7174 discriminants used in TYPE0, returns a type for the value that
7175 contains no dynamic components (that is, no components whose sizes
7176 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7177 true, gives an error message if the resulting type's size is over
7180 static struct type *
7181 to_fixed_array_type (struct type *type0, struct value *dval,
7184 struct type *index_type_desc;
7185 struct type *result;
7187 if (ada_is_packed_array_type (type0) /* revisit? */
7188 || TYPE_FIXED_INSTANCE (type0))
7191 index_type_desc = ada_find_parallel_type (type0, "___XA");
7192 if (index_type_desc == NULL)
7194 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
7195 /* NOTE: elt_type---the fixed version of elt_type0---should never
7196 depend on the contents of the array in properly constructed
7198 /* Create a fixed version of the array element type.
7199 We're not providing the address of an element here,
7200 and thus the actual object value cannot be inspected to do
7201 the conversion. This should not be a problem, since arrays of
7202 unconstrained objects are not allowed. In particular, all
7203 the elements of an array of a tagged type should all be of
7204 the same type specified in the debugging info. No need to
7205 consult the object tag. */
7206 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
7208 if (elt_type0 == elt_type)
7211 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7212 elt_type, TYPE_INDEX_TYPE (type0));
7217 struct type *elt_type0;
7220 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
7221 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
7223 /* NOTE: result---the fixed version of elt_type0---should never
7224 depend on the contents of the array in properly constructed
7226 /* Create a fixed version of the array element type.
7227 We're not providing the address of an element here,
7228 and thus the actual object value cannot be inspected to do
7229 the conversion. This should not be a problem, since arrays of
7230 unconstrained objects are not allowed. In particular, all
7231 the elements of an array of a tagged type should all be of
7232 the same type specified in the debugging info. No need to
7233 consult the object tag. */
7235 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
7236 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
7238 struct type *range_type =
7239 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
7240 dval, TYPE_OBJFILE (type0));
7241 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7242 result, range_type);
7244 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
7245 error (_("array type with dynamic size is larger than varsize-limit"));
7248 TYPE_FIXED_INSTANCE (result) = 1;
7253 /* A standard type (containing no dynamically sized components)
7254 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7255 DVAL describes a record containing any discriminants used in TYPE0,
7256 and may be NULL if there are none, or if the object of type TYPE at
7257 ADDRESS or in VALADDR contains these discriminants.
7259 If CHECK_TAG is not null, in the case of tagged types, this function
7260 attempts to locate the object's tag and use it to compute the actual
7261 type. However, when ADDRESS is null, we cannot use it to determine the
7262 location of the tag, and therefore compute the tagged type's actual type.
7263 So we return the tagged type without consulting the tag. */
7265 static struct type *
7266 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
7267 CORE_ADDR address, struct value *dval, int check_tag)
7269 type = ada_check_typedef (type);
7270 switch (TYPE_CODE (type))
7274 case TYPE_CODE_STRUCT:
7276 struct type *static_type = to_static_fixed_type (type);
7277 struct type *fixed_record_type =
7278 to_fixed_record_type (type, valaddr, address, NULL);
7279 /* If STATIC_TYPE is a tagged type and we know the object's address,
7280 then we can determine its tag, and compute the object's actual
7281 type from there. Note that we have to use the fixed record
7282 type (the parent part of the record may have dynamic fields
7283 and the way the location of _tag is expressed may depend on
7286 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
7288 struct type *real_type =
7289 type_from_tag (value_tag_from_contents_and_address
7293 if (real_type != NULL)
7294 return to_fixed_record_type (real_type, valaddr, address, NULL);
7297 /* Check to see if there is a parallel ___XVZ variable.
7298 If there is, then it provides the actual size of our type. */
7299 else if (ada_type_name (fixed_record_type) != NULL)
7301 char *name = ada_type_name (fixed_record_type);
7302 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
7306 sprintf (xvz_name, "%s___XVZ", name);
7307 size = get_int_var_value (xvz_name, &xvz_found);
7308 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
7310 fixed_record_type = copy_type (fixed_record_type);
7311 TYPE_LENGTH (fixed_record_type) = size;
7313 /* The FIXED_RECORD_TYPE may have be a stub. We have
7314 observed this when the debugging info is STABS, and
7315 apparently it is something that is hard to fix.
7317 In practice, we don't need the actual type definition
7318 at all, because the presence of the XVZ variable allows us
7319 to assume that there must be a XVS type as well, which we
7320 should be able to use later, when we need the actual type
7323 In the meantime, pretend that the "fixed" type we are
7324 returning is NOT a stub, because this can cause trouble
7325 when using this type to create new types targeting it.
7326 Indeed, the associated creation routines often check
7327 whether the target type is a stub and will try to replace
7328 it, thus using a type with the wrong size. This, in turn,
7329 might cause the new type to have the wrong size too.
7330 Consider the case of an array, for instance, where the size
7331 of the array is computed from the number of elements in
7332 our array multiplied by the size of its element. */
7333 TYPE_STUB (fixed_record_type) = 0;
7336 return fixed_record_type;
7338 case TYPE_CODE_ARRAY:
7339 return to_fixed_array_type (type, dval, 1);
7340 case TYPE_CODE_UNION:
7344 return to_fixed_variant_branch_type (type, valaddr, address, dval);
7348 /* The same as ada_to_fixed_type_1, except that it preserves the type
7349 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7350 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7353 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7354 CORE_ADDR address, struct value *dval, int check_tag)
7357 struct type *fixed_type =
7358 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7360 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7361 && TYPE_TARGET_TYPE (type) == fixed_type)
7367 /* A standard (static-sized) type corresponding as well as possible to
7368 TYPE0, but based on no runtime data. */
7370 static struct type *
7371 to_static_fixed_type (struct type *type0)
7378 if (TYPE_FIXED_INSTANCE (type0))
7381 type0 = ada_check_typedef (type0);
7383 switch (TYPE_CODE (type0))
7387 case TYPE_CODE_STRUCT:
7388 type = dynamic_template_type (type0);
7390 return template_to_static_fixed_type (type);
7392 return template_to_static_fixed_type (type0);
7393 case TYPE_CODE_UNION:
7394 type = ada_find_parallel_type (type0, "___XVU");
7396 return template_to_static_fixed_type (type);
7398 return template_to_static_fixed_type (type0);
7402 /* A static approximation of TYPE with all type wrappers removed. */
7404 static struct type *
7405 static_unwrap_type (struct type *type)
7407 if (ada_is_aligner_type (type))
7409 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
7410 if (ada_type_name (type1) == NULL)
7411 TYPE_NAME (type1) = ada_type_name (type);
7413 return static_unwrap_type (type1);
7417 struct type *raw_real_type = ada_get_base_type (type);
7418 if (raw_real_type == type)
7421 return to_static_fixed_type (raw_real_type);
7425 /* In some cases, incomplete and private types require
7426 cross-references that are not resolved as records (for example,
7428 type FooP is access Foo;
7430 type Foo is array ...;
7431 ). In these cases, since there is no mechanism for producing
7432 cross-references to such types, we instead substitute for FooP a
7433 stub enumeration type that is nowhere resolved, and whose tag is
7434 the name of the actual type. Call these types "non-record stubs". */
7436 /* A type equivalent to TYPE that is not a non-record stub, if one
7437 exists, otherwise TYPE. */
7440 ada_check_typedef (struct type *type)
7445 CHECK_TYPEDEF (type);
7446 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
7447 || !TYPE_STUB (type)
7448 || TYPE_TAG_NAME (type) == NULL)
7452 char *name = TYPE_TAG_NAME (type);
7453 struct type *type1 = ada_find_any_type (name);
7454 return (type1 == NULL) ? type : type1;
7458 /* A value representing the data at VALADDR/ADDRESS as described by
7459 type TYPE0, but with a standard (static-sized) type that correctly
7460 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7461 type, then return VAL0 [this feature is simply to avoid redundant
7462 creation of struct values]. */
7464 static struct value *
7465 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
7468 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
7469 if (type == type0 && val0 != NULL)
7472 return value_from_contents_and_address (type, 0, address);
7475 /* A value representing VAL, but with a standard (static-sized) type
7476 that correctly describes it. Does not necessarily create a new
7479 static struct value *
7480 ada_to_fixed_value (struct value *val)
7482 return ada_to_fixed_value_create (value_type (val),
7483 VALUE_ADDRESS (val) + value_offset (val),
7487 /* A value representing VAL, but with a standard (static-sized) type
7488 chosen to approximate the real type of VAL as well as possible, but
7489 without consulting any runtime values. For Ada dynamic-sized
7490 types, therefore, the type of the result is likely to be inaccurate. */
7492 static struct value *
7493 ada_to_static_fixed_value (struct value *val)
7496 to_static_fixed_type (static_unwrap_type (value_type (val)));
7497 if (type == value_type (val))
7500 return coerce_unspec_val_to_type (val, type);
7506 /* Table mapping attribute numbers to names.
7507 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7509 static const char *attribute_names[] = {
7527 ada_attribute_name (enum exp_opcode n)
7529 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
7530 return attribute_names[n - OP_ATR_FIRST + 1];
7532 return attribute_names[0];
7535 /* Evaluate the 'POS attribute applied to ARG. */
7538 pos_atr (struct value *arg)
7540 struct value *val = coerce_ref (arg);
7541 struct type *type = value_type (val);
7543 if (!discrete_type_p (type))
7544 error (_("'POS only defined on discrete types"));
7546 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7549 LONGEST v = value_as_long (val);
7551 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7553 if (v == TYPE_FIELD_BITPOS (type, i))
7556 error (_("enumeration value is invalid: can't find 'POS"));
7559 return value_as_long (val);
7562 static struct value *
7563 value_pos_atr (struct type *type, struct value *arg)
7565 return value_from_longest (type, pos_atr (arg));
7568 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7570 static struct value *
7571 value_val_atr (struct type *type, struct value *arg)
7573 if (!discrete_type_p (type))
7574 error (_("'VAL only defined on discrete types"));
7575 if (!integer_type_p (value_type (arg)))
7576 error (_("'VAL requires integral argument"));
7578 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7580 long pos = value_as_long (arg);
7581 if (pos < 0 || pos >= TYPE_NFIELDS (type))
7582 error (_("argument to 'VAL out of range"));
7583 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
7586 return value_from_longest (type, value_as_long (arg));
7592 /* True if TYPE appears to be an Ada character type.
7593 [At the moment, this is true only for Character and Wide_Character;
7594 It is a heuristic test that could stand improvement]. */
7597 ada_is_character_type (struct type *type)
7601 /* If the type code says it's a character, then assume it really is,
7602 and don't check any further. */
7603 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
7606 /* Otherwise, assume it's a character type iff it is a discrete type
7607 with a known character type name. */
7608 name = ada_type_name (type);
7609 return (name != NULL
7610 && (TYPE_CODE (type) == TYPE_CODE_INT
7611 || TYPE_CODE (type) == TYPE_CODE_RANGE)
7612 && (strcmp (name, "character") == 0
7613 || strcmp (name, "wide_character") == 0
7614 || strcmp (name, "wide_wide_character") == 0
7615 || strcmp (name, "unsigned char") == 0));
7618 /* True if TYPE appears to be an Ada string type. */
7621 ada_is_string_type (struct type *type)
7623 type = ada_check_typedef (type);
7625 && TYPE_CODE (type) != TYPE_CODE_PTR
7626 && (ada_is_simple_array_type (type)
7627 || ada_is_array_descriptor_type (type))
7628 && ada_array_arity (type) == 1)
7630 struct type *elttype = ada_array_element_type (type, 1);
7632 return ada_is_character_type (elttype);
7639 /* True if TYPE is a struct type introduced by the compiler to force the
7640 alignment of a value. Such types have a single field with a
7641 distinctive name. */
7644 ada_is_aligner_type (struct type *type)
7646 type = ada_check_typedef (type);
7648 /* If we can find a parallel XVS type, then the XVS type should
7649 be used instead of this type. And hence, this is not an aligner
7651 if (ada_find_parallel_type (type, "___XVS") != NULL)
7654 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
7655 && TYPE_NFIELDS (type) == 1
7656 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
7659 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7660 the parallel type. */
7663 ada_get_base_type (struct type *raw_type)
7665 struct type *real_type_namer;
7666 struct type *raw_real_type;
7668 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
7671 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
7672 if (real_type_namer == NULL
7673 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
7674 || TYPE_NFIELDS (real_type_namer) != 1)
7677 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
7678 if (raw_real_type == NULL)
7681 return raw_real_type;
7684 /* The type of value designated by TYPE, with all aligners removed. */
7687 ada_aligned_type (struct type *type)
7689 if (ada_is_aligner_type (type))
7690 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
7692 return ada_get_base_type (type);
7696 /* The address of the aligned value in an object at address VALADDR
7697 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7700 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
7702 if (ada_is_aligner_type (type))
7703 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
7705 TYPE_FIELD_BITPOS (type,
7706 0) / TARGET_CHAR_BIT);
7713 /* The printed representation of an enumeration literal with encoded
7714 name NAME. The value is good to the next call of ada_enum_name. */
7716 ada_enum_name (const char *name)
7718 static char *result;
7719 static size_t result_len = 0;
7722 /* First, unqualify the enumeration name:
7723 1. Search for the last '.' character. If we find one, then skip
7724 all the preceeding characters, the unqualified name starts
7725 right after that dot.
7726 2. Otherwise, we may be debugging on a target where the compiler
7727 translates dots into "__". Search forward for double underscores,
7728 but stop searching when we hit an overloading suffix, which is
7729 of the form "__" followed by digits. */
7731 tmp = strrchr (name, '.');
7736 while ((tmp = strstr (name, "__")) != NULL)
7738 if (isdigit (tmp[2]))
7748 if (name[1] == 'U' || name[1] == 'W')
7750 if (sscanf (name + 2, "%x", &v) != 1)
7756 GROW_VECT (result, result_len, 16);
7757 if (isascii (v) && isprint (v))
7758 sprintf (result, "'%c'", v);
7759 else if (name[1] == 'U')
7760 sprintf (result, "[\"%02x\"]", v);
7762 sprintf (result, "[\"%04x\"]", v);
7768 tmp = strstr (name, "__");
7770 tmp = strstr (name, "$");
7773 GROW_VECT (result, result_len, tmp - name + 1);
7774 strncpy (result, name, tmp - name);
7775 result[tmp - name] = '\0';
7783 static struct value *
7784 evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos,
7787 return (*exp->language_defn->la_exp_desc->evaluate_exp)
7788 (expect_type, exp, pos, noside);
7791 /* Evaluate the subexpression of EXP starting at *POS as for
7792 evaluate_type, updating *POS to point just past the evaluated
7795 static struct value *
7796 evaluate_subexp_type (struct expression *exp, int *pos)
7798 return (*exp->language_defn->la_exp_desc->evaluate_exp)
7799 (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
7802 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7805 static struct value *
7806 unwrap_value (struct value *val)
7808 struct type *type = ada_check_typedef (value_type (val));
7809 if (ada_is_aligner_type (type))
7811 struct value *v = ada_value_struct_elt (val, "F", 0);
7812 struct type *val_type = ada_check_typedef (value_type (v));
7813 if (ada_type_name (val_type) == NULL)
7814 TYPE_NAME (val_type) = ada_type_name (type);
7816 return unwrap_value (v);
7820 struct type *raw_real_type =
7821 ada_check_typedef (ada_get_base_type (type));
7823 if (type == raw_real_type)
7827 coerce_unspec_val_to_type
7828 (val, ada_to_fixed_type (raw_real_type, 0,
7829 VALUE_ADDRESS (val) + value_offset (val),
7834 static struct value *
7835 cast_to_fixed (struct type *type, struct value *arg)
7839 if (type == value_type (arg))
7841 else if (ada_is_fixed_point_type (value_type (arg)))
7842 val = ada_float_to_fixed (type,
7843 ada_fixed_to_float (value_type (arg),
7844 value_as_long (arg)));
7847 DOUBLEST argd = value_as_double (arg);
7848 val = ada_float_to_fixed (type, argd);
7851 return value_from_longest (type, val);
7854 static struct value *
7855 cast_from_fixed (struct type *type, struct value *arg)
7857 DOUBLEST val = ada_fixed_to_float (value_type (arg),
7858 value_as_long (arg));
7859 return value_from_double (type, val);
7862 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7863 return the converted value. */
7865 static struct value *
7866 coerce_for_assign (struct type *type, struct value *val)
7868 struct type *type2 = value_type (val);
7872 type2 = ada_check_typedef (type2);
7873 type = ada_check_typedef (type);
7875 if (TYPE_CODE (type2) == TYPE_CODE_PTR
7876 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7878 val = ada_value_ind (val);
7879 type2 = value_type (val);
7882 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
7883 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7885 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
7886 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
7887 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
7888 error (_("Incompatible types in assignment"));
7889 deprecated_set_value_type (val, type);
7894 static struct value *
7895 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
7898 struct type *type1, *type2;
7901 arg1 = coerce_ref (arg1);
7902 arg2 = coerce_ref (arg2);
7903 type1 = base_type (ada_check_typedef (value_type (arg1)));
7904 type2 = base_type (ada_check_typedef (value_type (arg2)));
7906 if (TYPE_CODE (type1) != TYPE_CODE_INT
7907 || TYPE_CODE (type2) != TYPE_CODE_INT)
7908 return value_binop (arg1, arg2, op);
7917 return value_binop (arg1, arg2, op);
7920 v2 = value_as_long (arg2);
7922 error (_("second operand of %s must not be zero."), op_string (op));
7924 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
7925 return value_binop (arg1, arg2, op);
7927 v1 = value_as_long (arg1);
7932 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
7933 v += v > 0 ? -1 : 1;
7941 /* Should not reach this point. */
7945 val = allocate_value (type1);
7946 store_unsigned_integer (value_contents_raw (val),
7947 TYPE_LENGTH (value_type (val)), v);
7952 ada_value_equal (struct value *arg1, struct value *arg2)
7954 if (ada_is_direct_array_type (value_type (arg1))
7955 || ada_is_direct_array_type (value_type (arg2)))
7957 /* Automatically dereference any array reference before
7958 we attempt to perform the comparison. */
7959 arg1 = ada_coerce_ref (arg1);
7960 arg2 = ada_coerce_ref (arg2);
7962 arg1 = ada_coerce_to_simple_array (arg1);
7963 arg2 = ada_coerce_to_simple_array (arg2);
7964 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
7965 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
7966 error (_("Attempt to compare array with non-array"));
7967 /* FIXME: The following works only for types whose
7968 representations use all bits (no padding or undefined bits)
7969 and do not have user-defined equality. */
7971 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
7972 && memcmp (value_contents (arg1), value_contents (arg2),
7973 TYPE_LENGTH (value_type (arg1))) == 0;
7975 return value_equal (arg1, arg2);
7978 /* Total number of component associations in the aggregate starting at
7979 index PC in EXP. Assumes that index PC is the start of an
7983 num_component_specs (struct expression *exp, int pc)
7986 m = exp->elts[pc + 1].longconst;
7989 for (i = 0; i < m; i += 1)
7991 switch (exp->elts[pc].opcode)
7997 n += exp->elts[pc + 1].longconst;
8000 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8005 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8006 component of LHS (a simple array or a record), updating *POS past
8007 the expression, assuming that LHS is contained in CONTAINER. Does
8008 not modify the inferior's memory, nor does it modify LHS (unless
8009 LHS == CONTAINER). */
8012 assign_component (struct value *container, struct value *lhs, LONGEST index,
8013 struct expression *exp, int *pos)
8015 struct value *mark = value_mark ();
8017 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8019 struct value *index_val = value_from_longest (builtin_type_int32, index);
8020 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8024 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
8025 elt = ada_to_fixed_value (unwrap_value (elt));
8028 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8029 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8031 value_assign_to_component (container, elt,
8032 ada_evaluate_subexp (NULL, exp, pos,
8035 value_free_to_mark (mark);
8038 /* Assuming that LHS represents an lvalue having a record or array
8039 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8040 of that aggregate's value to LHS, advancing *POS past the
8041 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8042 lvalue containing LHS (possibly LHS itself). Does not modify
8043 the inferior's memory, nor does it modify the contents of
8044 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8046 static struct value *
8047 assign_aggregate (struct value *container,
8048 struct value *lhs, struct expression *exp,
8049 int *pos, enum noside noside)
8051 struct type *lhs_type;
8052 int n = exp->elts[*pos+1].longconst;
8053 LONGEST low_index, high_index;
8056 int max_indices, num_indices;
8057 int is_array_aggregate;
8059 struct value *mark = value_mark ();
8062 if (noside != EVAL_NORMAL)
8065 for (i = 0; i < n; i += 1)
8066 ada_evaluate_subexp (NULL, exp, pos, noside);
8070 container = ada_coerce_ref (container);
8071 if (ada_is_direct_array_type (value_type (container)))
8072 container = ada_coerce_to_simple_array (container);
8073 lhs = ada_coerce_ref (lhs);
8074 if (!deprecated_value_modifiable (lhs))
8075 error (_("Left operand of assignment is not a modifiable lvalue."));
8077 lhs_type = value_type (lhs);
8078 if (ada_is_direct_array_type (lhs_type))
8080 lhs = ada_coerce_to_simple_array (lhs);
8081 lhs_type = value_type (lhs);
8082 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8083 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8084 is_array_aggregate = 1;
8086 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8089 high_index = num_visible_fields (lhs_type) - 1;
8090 is_array_aggregate = 0;
8093 error (_("Left-hand side must be array or record."));
8095 num_specs = num_component_specs (exp, *pos - 3);
8096 max_indices = 4 * num_specs + 4;
8097 indices = alloca (max_indices * sizeof (indices[0]));
8098 indices[0] = indices[1] = low_index - 1;
8099 indices[2] = indices[3] = high_index + 1;
8102 for (i = 0; i < n; i += 1)
8104 switch (exp->elts[*pos].opcode)
8107 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8108 &num_indices, max_indices,
8109 low_index, high_index);
8112 aggregate_assign_positional (container, lhs, exp, pos, indices,
8113 &num_indices, max_indices,
8114 low_index, high_index);
8118 error (_("Misplaced 'others' clause"));
8119 aggregate_assign_others (container, lhs, exp, pos, indices,
8120 num_indices, low_index, high_index);
8123 error (_("Internal error: bad aggregate clause"));
8130 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8131 construct at *POS, updating *POS past the construct, given that
8132 the positions are relative to lower bound LOW, where HIGH is the
8133 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8134 updating *NUM_INDICES as needed. CONTAINER is as for
8135 assign_aggregate. */
8137 aggregate_assign_positional (struct value *container,
8138 struct value *lhs, struct expression *exp,
8139 int *pos, LONGEST *indices, int *num_indices,
8140 int max_indices, LONGEST low, LONGEST high)
8142 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8144 if (ind - 1 == high)
8145 warning (_("Extra components in aggregate ignored."));
8148 add_component_interval (ind, ind, indices, num_indices, max_indices);
8150 assign_component (container, lhs, ind, exp, pos);
8153 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8156 /* Assign into the components of LHS indexed by the OP_CHOICES
8157 construct at *POS, updating *POS past the construct, given that
8158 the allowable indices are LOW..HIGH. Record the indices assigned
8159 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8160 needed. CONTAINER is as for assign_aggregate. */
8162 aggregate_assign_from_choices (struct value *container,
8163 struct value *lhs, struct expression *exp,
8164 int *pos, LONGEST *indices, int *num_indices,
8165 int max_indices, LONGEST low, LONGEST high)
8168 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
8169 int choice_pos, expr_pc;
8170 int is_array = ada_is_direct_array_type (value_type (lhs));
8172 choice_pos = *pos += 3;
8174 for (j = 0; j < n_choices; j += 1)
8175 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8177 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8179 for (j = 0; j < n_choices; j += 1)
8181 LONGEST lower, upper;
8182 enum exp_opcode op = exp->elts[choice_pos].opcode;
8183 if (op == OP_DISCRETE_RANGE)
8186 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8188 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8193 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8204 name = &exp->elts[choice_pos + 2].string;
8207 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8210 error (_("Invalid record component association."));
8212 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8214 if (! find_struct_field (name, value_type (lhs), 0,
8215 NULL, NULL, NULL, NULL, &ind))
8216 error (_("Unknown component name: %s."), name);
8217 lower = upper = ind;
8220 if (lower <= upper && (lower < low || upper > high))
8221 error (_("Index in component association out of bounds."));
8223 add_component_interval (lower, upper, indices, num_indices,
8225 while (lower <= upper)
8229 assign_component (container, lhs, lower, exp, &pos1);
8235 /* Assign the value of the expression in the OP_OTHERS construct in
8236 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8237 have not been previously assigned. The index intervals already assigned
8238 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8239 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8241 aggregate_assign_others (struct value *container,
8242 struct value *lhs, struct expression *exp,
8243 int *pos, LONGEST *indices, int num_indices,
8244 LONGEST low, LONGEST high)
8247 int expr_pc = *pos+1;
8249 for (i = 0; i < num_indices - 2; i += 2)
8252 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8256 assign_component (container, lhs, ind, exp, &pos);
8259 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8262 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8263 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8264 modifying *SIZE as needed. It is an error if *SIZE exceeds
8265 MAX_SIZE. The resulting intervals do not overlap. */
8267 add_component_interval (LONGEST low, LONGEST high,
8268 LONGEST* indices, int *size, int max_size)
8271 for (i = 0; i < *size; i += 2) {
8272 if (high >= indices[i] && low <= indices[i + 1])
8275 for (kh = i + 2; kh < *size; kh += 2)
8276 if (high < indices[kh])
8278 if (low < indices[i])
8280 indices[i + 1] = indices[kh - 1];
8281 if (high > indices[i + 1])
8282 indices[i + 1] = high;
8283 memcpy (indices + i + 2, indices + kh, *size - kh);
8284 *size -= kh - i - 2;
8287 else if (high < indices[i])
8291 if (*size == max_size)
8292 error (_("Internal error: miscounted aggregate components."));
8294 for (j = *size-1; j >= i+2; j -= 1)
8295 indices[j] = indices[j - 2];
8297 indices[i + 1] = high;
8300 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8303 static struct value *
8304 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8306 if (type == ada_check_typedef (value_type (arg2)))
8309 if (ada_is_fixed_point_type (type))
8310 return (cast_to_fixed (type, arg2));
8312 if (ada_is_fixed_point_type (value_type (arg2)))
8313 return cast_from_fixed (type, arg2);
8315 return value_cast (type, arg2);
8318 static struct value *
8319 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
8320 int *pos, enum noside noside)
8323 int tem, tem2, tem3;
8325 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
8328 struct value **argvec;
8332 op = exp->elts[pc].opcode;
8338 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
8339 arg1 = unwrap_value (arg1);
8341 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8342 then we need to perform the conversion manually, because
8343 evaluate_subexp_standard doesn't do it. This conversion is
8344 necessary in Ada because the different kinds of float/fixed
8345 types in Ada have different representations.
8347 Similarly, we need to perform the conversion from OP_LONG
8349 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
8350 arg1 = ada_value_cast (expect_type, arg1, noside);
8356 struct value *result;
8358 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
8359 /* The result type will have code OP_STRING, bashed there from
8360 OP_ARRAY. Bash it back. */
8361 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
8362 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
8368 type = exp->elts[pc + 1].type;
8369 arg1 = evaluate_subexp (type, exp, pos, noside);
8370 if (noside == EVAL_SKIP)
8372 arg1 = ada_value_cast (type, arg1, noside);
8377 type = exp->elts[pc + 1].type;
8378 return ada_evaluate_subexp (type, exp, pos, noside);
8381 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8382 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8384 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
8385 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8387 return ada_value_assign (arg1, arg1);
8389 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8390 except if the lhs of our assignment is a convenience variable.
8391 In the case of assigning to a convenience variable, the lhs
8392 should be exactly the result of the evaluation of the rhs. */
8393 type = value_type (arg1);
8394 if (VALUE_LVAL (arg1) == lval_internalvar)
8396 arg2 = evaluate_subexp (type, exp, pos, noside);
8397 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8399 if (ada_is_fixed_point_type (value_type (arg1)))
8400 arg2 = cast_to_fixed (value_type (arg1), arg2);
8401 else if (ada_is_fixed_point_type (value_type (arg2)))
8403 (_("Fixed-point values must be assigned to fixed-point variables"));
8405 arg2 = coerce_for_assign (value_type (arg1), arg2);
8406 return ada_value_assign (arg1, arg2);
8409 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8410 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8411 if (noside == EVAL_SKIP)
8413 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
8414 return (value_from_longest
8416 value_as_long (arg1) + value_as_long (arg2)));
8417 if ((ada_is_fixed_point_type (value_type (arg1))
8418 || ada_is_fixed_point_type (value_type (arg2)))
8419 && value_type (arg1) != value_type (arg2))
8420 error (_("Operands of fixed-point addition must have the same type"));
8421 /* Do the addition, and cast the result to the type of the first
8422 argument. We cannot cast the result to a reference type, so if
8423 ARG1 is a reference type, find its underlying type. */
8424 type = value_type (arg1);
8425 while (TYPE_CODE (type) == TYPE_CODE_REF)
8426 type = TYPE_TARGET_TYPE (type);
8427 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8428 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
8431 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8432 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8433 if (noside == EVAL_SKIP)
8435 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
8436 return (value_from_longest
8438 value_as_long (arg1) - value_as_long (arg2)));
8439 if ((ada_is_fixed_point_type (value_type (arg1))
8440 || ada_is_fixed_point_type (value_type (arg2)))
8441 && value_type (arg1) != value_type (arg2))
8442 error (_("Operands of fixed-point subtraction must have the same type"));
8443 /* Do the substraction, and cast the result to the type of the first
8444 argument. We cannot cast the result to a reference type, so if
8445 ARG1 is a reference type, find its underlying type. */
8446 type = value_type (arg1);
8447 while (TYPE_CODE (type) == TYPE_CODE_REF)
8448 type = TYPE_TARGET_TYPE (type);
8449 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8450 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
8454 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8455 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8456 if (noside == EVAL_SKIP)
8458 else if (noside == EVAL_AVOID_SIDE_EFFECTS
8459 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
8460 return value_zero (value_type (arg1), not_lval);
8463 type = builtin_type (exp->gdbarch)->builtin_double;
8464 if (ada_is_fixed_point_type (value_type (arg1)))
8465 arg1 = cast_from_fixed (type, arg1);
8466 if (ada_is_fixed_point_type (value_type (arg2)))
8467 arg2 = cast_from_fixed (type, arg2);
8468 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8469 return ada_value_binop (arg1, arg2, op);
8474 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8475 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8476 if (noside == EVAL_SKIP)
8478 else if (noside == EVAL_AVOID_SIDE_EFFECTS
8479 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
8480 return value_zero (value_type (arg1), not_lval);
8483 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8484 return ada_value_binop (arg1, arg2, op);
8488 case BINOP_NOTEQUAL:
8489 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8490 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
8491 if (noside == EVAL_SKIP)
8493 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8497 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8498 tem = ada_value_equal (arg1, arg2);
8500 if (op == BINOP_NOTEQUAL)
8502 type = language_bool_type (exp->language_defn, exp->gdbarch);
8503 return value_from_longest (type, (LONGEST) tem);
8506 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8507 if (noside == EVAL_SKIP)
8509 else if (ada_is_fixed_point_type (value_type (arg1)))
8510 return value_cast (value_type (arg1), value_neg (arg1));
8513 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
8514 return value_neg (arg1);
8517 case BINOP_LOGICAL_AND:
8518 case BINOP_LOGICAL_OR:
8519 case UNOP_LOGICAL_NOT:
8524 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8525 type = language_bool_type (exp->language_defn, exp->gdbarch);
8526 return value_cast (type, val);
8529 case BINOP_BITWISE_AND:
8530 case BINOP_BITWISE_IOR:
8531 case BINOP_BITWISE_XOR:
8535 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8537 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8539 return value_cast (value_type (arg1), val);
8545 if (noside == EVAL_SKIP)
8550 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
8551 /* Only encountered when an unresolved symbol occurs in a
8552 context other than a function call, in which case, it is
8554 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8555 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
8556 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8558 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
8559 if (ada_is_tagged_type (type, 0))
8561 /* Tagged types are a little special in the fact that the real
8562 type is dynamic and can only be determined by inspecting the
8563 object's tag. This means that we need to get the object's
8564 value first (EVAL_NORMAL) and then extract the actual object
8567 Note that we cannot skip the final step where we extract
8568 the object type from its tag, because the EVAL_NORMAL phase
8569 results in dynamic components being resolved into fixed ones.
8570 This can cause problems when trying to print the type
8571 description of tagged types whose parent has a dynamic size:
8572 We use the type name of the "_parent" component in order
8573 to print the name of the ancestor type in the type description.
8574 If that component had a dynamic size, the resolution into
8575 a fixed type would result in the loss of that type name,
8576 thus preventing us from printing the name of the ancestor
8577 type in the type description. */
8578 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
8579 return value_zero (type_from_tag (ada_value_tag (arg1)), not_lval);
8584 (to_static_fixed_type
8585 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
8591 unwrap_value (evaluate_subexp_standard
8592 (expect_type, exp, pos, noside));
8593 return ada_to_fixed_value (arg1);
8599 /* Allocate arg vector, including space for the function to be
8600 called in argvec[0] and a terminating NULL. */
8601 nargs = longest_to_int (exp->elts[pc + 1].longconst);
8603 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
8605 if (exp->elts[*pos].opcode == OP_VAR_VALUE
8606 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
8607 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8608 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
8611 for (tem = 0; tem <= nargs; tem += 1)
8612 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8615 if (noside == EVAL_SKIP)
8619 if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
8620 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
8621 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
8622 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
8623 && VALUE_LVAL (argvec[0]) == lval_memory))
8624 argvec[0] = value_addr (argvec[0]);
8626 type = ada_check_typedef (value_type (argvec[0]));
8627 if (TYPE_CODE (type) == TYPE_CODE_PTR)
8629 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
8631 case TYPE_CODE_FUNC:
8632 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
8634 case TYPE_CODE_ARRAY:
8636 case TYPE_CODE_STRUCT:
8637 if (noside != EVAL_AVOID_SIDE_EFFECTS)
8638 argvec[0] = ada_value_ind (argvec[0]);
8639 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
8642 error (_("cannot subscript or call something of type `%s'"),
8643 ada_type_name (value_type (argvec[0])));
8648 switch (TYPE_CODE (type))
8650 case TYPE_CODE_FUNC:
8651 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8652 return allocate_value (TYPE_TARGET_TYPE (type));
8653 return call_function_by_hand (argvec[0], nargs, argvec + 1);
8654 case TYPE_CODE_STRUCT:
8658 arity = ada_array_arity (type);
8659 type = ada_array_element_type (type, nargs);
8661 error (_("cannot subscript or call a record"));
8663 error (_("wrong number of subscripts; expecting %d"), arity);
8664 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8665 return value_zero (ada_aligned_type (type), lval_memory);
8667 unwrap_value (ada_value_subscript
8668 (argvec[0], nargs, argvec + 1));
8670 case TYPE_CODE_ARRAY:
8671 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8673 type = ada_array_element_type (type, nargs);
8675 error (_("element type of array unknown"));
8677 return value_zero (ada_aligned_type (type), lval_memory);
8680 unwrap_value (ada_value_subscript
8681 (ada_coerce_to_simple_array (argvec[0]),
8682 nargs, argvec + 1));
8683 case TYPE_CODE_PTR: /* Pointer to array */
8684 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
8685 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8687 type = ada_array_element_type (type, nargs);
8689 error (_("element type of array unknown"));
8691 return value_zero (ada_aligned_type (type), lval_memory);
8694 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
8695 nargs, argvec + 1));
8698 error (_("Attempt to index or call something other than an "
8699 "array or function"));
8704 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8705 struct value *low_bound_val =
8706 evaluate_subexp (NULL_TYPE, exp, pos, noside);
8707 struct value *high_bound_val =
8708 evaluate_subexp (NULL_TYPE, exp, pos, noside);
8711 low_bound_val = coerce_ref (low_bound_val);
8712 high_bound_val = coerce_ref (high_bound_val);
8713 low_bound = pos_atr (low_bound_val);
8714 high_bound = pos_atr (high_bound_val);
8716 if (noside == EVAL_SKIP)
8719 /* If this is a reference to an aligner type, then remove all
8721 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8722 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
8723 TYPE_TARGET_TYPE (value_type (array)) =
8724 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
8726 if (ada_is_packed_array_type (value_type (array)))
8727 error (_("cannot slice a packed array"));
8729 /* If this is a reference to an array or an array lvalue,
8730 convert to a pointer. */
8731 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8732 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
8733 && VALUE_LVAL (array) == lval_memory))
8734 array = value_addr (array);
8736 if (noside == EVAL_AVOID_SIDE_EFFECTS
8737 && ada_is_array_descriptor_type (ada_check_typedef
8738 (value_type (array))))
8739 return empty_array (ada_type_of_array (array, 0), low_bound);
8741 array = ada_coerce_to_simple_array_ptr (array);
8743 /* If we have more than one level of pointer indirection,
8744 dereference the value until we get only one level. */
8745 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
8746 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
8748 array = value_ind (array);
8750 /* Make sure we really do have an array type before going further,
8751 to avoid a SEGV when trying to get the index type or the target
8752 type later down the road if the debug info generated by
8753 the compiler is incorrect or incomplete. */
8754 if (!ada_is_simple_array_type (value_type (array)))
8755 error (_("cannot take slice of non-array"));
8757 if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
8759 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
8760 return empty_array (TYPE_TARGET_TYPE (value_type (array)),
8764 struct type *arr_type0 =
8765 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
8767 return ada_value_slice_from_ptr (array, arr_type0,
8768 longest_to_int (low_bound),
8769 longest_to_int (high_bound));
8772 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8774 else if (high_bound < low_bound)
8775 return empty_array (value_type (array), low_bound);
8777 return ada_value_slice (array, longest_to_int (low_bound),
8778 longest_to_int (high_bound));
8783 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8784 type = exp->elts[pc + 1].type;
8786 if (noside == EVAL_SKIP)
8789 switch (TYPE_CODE (type))
8792 lim_warning (_("Membership test incompletely implemented; "
8793 "always returns true"));
8794 type = language_bool_type (exp->language_defn, exp->gdbarch);
8795 return value_from_longest (type, (LONGEST) 1);
8797 case TYPE_CODE_RANGE:
8798 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
8799 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
8800 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8801 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
8802 type = language_bool_type (exp->language_defn, exp->gdbarch);
8804 value_from_longest (type,
8805 (value_less (arg1, arg3)
8806 || value_equal (arg1, arg3))
8807 && (value_less (arg2, arg1)
8808 || value_equal (arg2, arg1)));
8811 case BINOP_IN_BOUNDS:
8813 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8814 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8816 if (noside == EVAL_SKIP)
8819 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8821 type = language_bool_type (exp->language_defn, exp->gdbarch);
8822 return value_zero (type, not_lval);
8825 tem = longest_to_int (exp->elts[pc + 1].longconst);
8827 if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
8828 error (_("invalid dimension number to 'range"));
8830 arg3 = ada_array_bound (arg2, tem, 1);
8831 arg2 = ada_array_bound (arg2, tem, 0);
8833 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8834 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
8835 type = language_bool_type (exp->language_defn, exp->gdbarch);
8837 value_from_longest (type,
8838 (value_less (arg1, arg3)
8839 || value_equal (arg1, arg3))
8840 && (value_less (arg2, arg1)
8841 || value_equal (arg2, arg1)));
8843 case TERNOP_IN_RANGE:
8844 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8845 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8846 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8848 if (noside == EVAL_SKIP)
8851 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
8852 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
8853 type = language_bool_type (exp->language_defn, exp->gdbarch);
8855 value_from_longest (type,
8856 (value_less (arg1, arg3)
8857 || value_equal (arg1, arg3))
8858 && (value_less (arg2, arg1)
8859 || value_equal (arg2, arg1)));
8865 struct type *type_arg;
8866 if (exp->elts[*pos].opcode == OP_TYPE)
8868 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
8870 type_arg = exp->elts[pc + 2].type;
8874 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8878 if (exp->elts[*pos].opcode != OP_LONG)
8879 error (_("Invalid operand to '%s"), ada_attribute_name (op));
8880 tem = longest_to_int (exp->elts[*pos + 2].longconst);
8883 if (noside == EVAL_SKIP)
8886 if (type_arg == NULL)
8888 arg1 = ada_coerce_ref (arg1);
8890 if (ada_is_packed_array_type (value_type (arg1)))
8891 arg1 = ada_coerce_to_simple_array (arg1);
8893 if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
8894 error (_("invalid dimension number to '%s"),
8895 ada_attribute_name (op));
8897 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8899 type = ada_index_type (value_type (arg1), tem);
8902 (_("attempt to take bound of something that is not an array"));
8903 return allocate_value (type);
8908 default: /* Should never happen. */
8909 error (_("unexpected attribute encountered"));
8911 return ada_array_bound (arg1, tem, 0);
8913 return ada_array_bound (arg1, tem, 1);
8915 return ada_array_length (arg1, tem);
8918 else if (discrete_type_p (type_arg))
8920 struct type *range_type;
8921 char *name = ada_type_name (type_arg);
8923 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
8925 to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
8926 if (range_type == NULL)
8927 range_type = type_arg;
8931 error (_("unexpected attribute encountered"));
8933 return value_from_longest
8934 (range_type, discrete_type_low_bound (range_type));
8936 return value_from_longest
8937 (range_type, discrete_type_high_bound (range_type));
8939 error (_("the 'length attribute applies only to array types"));
8942 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
8943 error (_("unimplemented type attribute"));
8948 if (ada_is_packed_array_type (type_arg))
8949 type_arg = decode_packed_array_type (type_arg);
8951 if (tem < 1 || tem > ada_array_arity (type_arg))
8952 error (_("invalid dimension number to '%s"),
8953 ada_attribute_name (op));
8955 type = ada_index_type (type_arg, tem);
8958 (_("attempt to take bound of something that is not an array"));
8959 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8960 return allocate_value (type);
8965 error (_("unexpected attribute encountered"));
8967 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
8968 return value_from_longest (type, low);
8970 high = ada_array_bound_from_type (type_arg, tem, 1, &type);
8971 return value_from_longest (type, high);
8973 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
8974 high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
8975 return value_from_longest (type, high - low + 1);
8981 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8982 if (noside == EVAL_SKIP)
8985 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8986 return value_zero (ada_tag_type (arg1), not_lval);
8988 return ada_value_tag (arg1);
8992 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
8993 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8994 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8995 if (noside == EVAL_SKIP)
8997 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8998 return value_zero (value_type (arg1), not_lval);
9001 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9002 return value_binop (arg1, arg2,
9003 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
9006 case OP_ATR_MODULUS:
9008 struct type *type_arg = exp->elts[pc + 2].type;
9009 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9011 if (noside == EVAL_SKIP)
9014 if (!ada_is_modular_type (type_arg))
9015 error (_("'modulus must be applied to modular type"));
9017 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
9018 ada_modulus (type_arg));
9023 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9024 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9025 if (noside == EVAL_SKIP)
9027 type = builtin_type (exp->gdbarch)->builtin_int;
9028 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9029 return value_zero (type, not_lval);
9031 return value_pos_atr (type, arg1);
9034 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9035 type = value_type (arg1);
9037 /* If the argument is a reference, then dereference its type, since
9038 the user is really asking for the size of the actual object,
9039 not the size of the pointer. */
9040 if (TYPE_CODE (type) == TYPE_CODE_REF)
9041 type = TYPE_TARGET_TYPE (type);
9043 if (noside == EVAL_SKIP)
9045 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9046 return value_zero (builtin_type_int32, not_lval);
9048 return value_from_longest (builtin_type_int32,
9049 TARGET_CHAR_BIT * TYPE_LENGTH (type));
9052 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
9053 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9054 type = exp->elts[pc + 2].type;
9055 if (noside == EVAL_SKIP)
9057 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9058 return value_zero (type, not_lval);
9060 return value_val_atr (type, arg1);
9063 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9064 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9065 if (noside == EVAL_SKIP)
9067 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9068 return value_zero (value_type (arg1), not_lval);
9071 /* For integer exponentiation operations,
9072 only promote the first argument. */
9073 if (is_integral_type (value_type (arg2)))
9074 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9076 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9078 return value_binop (arg1, arg2, op);
9082 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9083 if (noside == EVAL_SKIP)
9089 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9090 if (noside == EVAL_SKIP)
9092 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9093 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
9094 return value_neg (arg1);
9099 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9100 if (noside == EVAL_SKIP)
9102 type = ada_check_typedef (value_type (arg1));
9103 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9105 if (ada_is_array_descriptor_type (type))
9106 /* GDB allows dereferencing GNAT array descriptors. */
9108 struct type *arrType = ada_type_of_array (arg1, 0);
9109 if (arrType == NULL)
9110 error (_("Attempt to dereference null array pointer."));
9111 return value_at_lazy (arrType, 0);
9113 else if (TYPE_CODE (type) == TYPE_CODE_PTR
9114 || TYPE_CODE (type) == TYPE_CODE_REF
9115 /* In C you can dereference an array to get the 1st elt. */
9116 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
9118 type = to_static_fixed_type
9120 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
9122 return value_zero (type, lval_memory);
9124 else if (TYPE_CODE (type) == TYPE_CODE_INT)
9126 /* GDB allows dereferencing an int. */
9127 if (expect_type == NULL)
9128 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
9133 to_static_fixed_type (ada_aligned_type (expect_type));
9134 return value_zero (expect_type, lval_memory);
9138 error (_("Attempt to take contents of a non-pointer value."));
9140 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
9141 type = ada_check_typedef (value_type (arg1));
9143 if (TYPE_CODE (type) == TYPE_CODE_INT)
9144 /* GDB allows dereferencing an int. If we were given
9145 the expect_type, then use that as the target type.
9146 Otherwise, assume that the target type is an int. */
9148 if (expect_type != NULL)
9149 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
9152 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
9153 (CORE_ADDR) value_as_address (arg1));
9156 if (ada_is_array_descriptor_type (type))
9157 /* GDB allows dereferencing GNAT array descriptors. */
9158 return ada_coerce_to_simple_array (arg1);
9160 return ada_value_ind (arg1);
9162 case STRUCTOP_STRUCT:
9163 tem = longest_to_int (exp->elts[pc + 1].longconst);
9164 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
9165 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9166 if (noside == EVAL_SKIP)
9168 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9170 struct type *type1 = value_type (arg1);
9171 if (ada_is_tagged_type (type1, 1))
9173 type = ada_lookup_struct_elt_type (type1,
9174 &exp->elts[pc + 2].string,
9177 /* In this case, we assume that the field COULD exist
9178 in some extension of the type. Return an object of
9179 "type" void, which will match any formal
9180 (see ada_type_match). */
9181 return value_zero (builtin_type_void, lval_memory);
9185 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
9188 return value_zero (ada_aligned_type (type), lval_memory);
9192 ada_to_fixed_value (unwrap_value
9193 (ada_value_struct_elt
9194 (arg1, &exp->elts[pc + 2].string, 0)));
9196 /* The value is not supposed to be used. This is here to make it
9197 easier to accommodate expressions that contain types. */
9199 if (noside == EVAL_SKIP)
9201 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9202 return allocate_value (exp->elts[pc + 1].type);
9204 error (_("Attempt to use a type name as an expression"));
9209 case OP_DISCRETE_RANGE:
9212 if (noside == EVAL_NORMAL)
9216 error (_("Undefined name, ambiguous name, or renaming used in "
9217 "component association: %s."), &exp->elts[pc+2].string);
9219 error (_("Aggregates only allowed on the right of an assignment"));
9221 internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
9224 ada_forward_operator_length (exp, pc, &oplen, &nargs);
9226 for (tem = 0; tem < nargs; tem += 1)
9227 ada_evaluate_subexp (NULL, exp, pos, noside);
9232 return value_from_longest (builtin_type_int8, (LONGEST) 1);
9238 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9239 type name that encodes the 'small and 'delta information.
9240 Otherwise, return NULL. */
9243 fixed_type_info (struct type *type)
9245 const char *name = ada_type_name (type);
9246 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
9248 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
9250 const char *tail = strstr (name, "___XF_");
9256 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
9257 return fixed_type_info (TYPE_TARGET_TYPE (type));
9262 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9265 ada_is_fixed_point_type (struct type *type)
9267 return fixed_type_info (type) != NULL;
9270 /* Return non-zero iff TYPE represents a System.Address type. */
9273 ada_is_system_address_type (struct type *type)
9275 return (TYPE_NAME (type)
9276 && strcmp (TYPE_NAME (type), "system__address") == 0);
9279 /* Assuming that TYPE is the representation of an Ada fixed-point
9280 type, return its delta, or -1 if the type is malformed and the
9281 delta cannot be determined. */
9284 ada_delta (struct type *type)
9286 const char *encoding = fixed_type_info (type);
9289 if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2)
9292 return (DOUBLEST) num / (DOUBLEST) den;
9295 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9296 factor ('SMALL value) associated with the type. */
9299 scaling_factor (struct type *type)
9301 const char *encoding = fixed_type_info (type);
9302 unsigned long num0, den0, num1, den1;
9305 n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1);
9310 return (DOUBLEST) num1 / (DOUBLEST) den1;
9312 return (DOUBLEST) num0 / (DOUBLEST) den0;
9316 /* Assuming that X is the representation of a value of fixed-point
9317 type TYPE, return its floating-point equivalent. */
9320 ada_fixed_to_float (struct type *type, LONGEST x)
9322 return (DOUBLEST) x *scaling_factor (type);
9325 /* The representation of a fixed-point value of type TYPE
9326 corresponding to the value X. */
9329 ada_float_to_fixed (struct type *type, DOUBLEST x)
9331 return (LONGEST) (x / scaling_factor (type) + 0.5);
9335 /* VAX floating formats */
9337 /* Non-zero iff TYPE represents one of the special VAX floating-point
9341 ada_is_vax_floating_type (struct type *type)
9344 (ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
9347 && (TYPE_CODE (type) == TYPE_CODE_INT
9348 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9349 && strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
9352 /* The type of special VAX floating-point type this is, assuming
9353 ada_is_vax_floating_point. */
9356 ada_vax_float_type_suffix (struct type *type)
9358 return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
9361 /* A value representing the special debugging function that outputs
9362 VAX floating-point values of the type represented by TYPE. Assumes
9363 ada_is_vax_floating_type (TYPE). */
9366 ada_vax_float_print_function (struct type *type)
9368 switch (ada_vax_float_type_suffix (type))
9371 return get_var_value ("DEBUG_STRING_F", 0);
9373 return get_var_value ("DEBUG_STRING_D", 0);
9375 return get_var_value ("DEBUG_STRING_G", 0);
9377 error (_("invalid VAX floating-point type"));
9384 /* Scan STR beginning at position K for a discriminant name, and
9385 return the value of that discriminant field of DVAL in *PX. If
9386 PNEW_K is not null, put the position of the character beyond the
9387 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9388 not alter *PX and *PNEW_K if unsuccessful. */
9391 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
9394 static char *bound_buffer = NULL;
9395 static size_t bound_buffer_len = 0;
9398 struct value *bound_val;
9400 if (dval == NULL || str == NULL || str[k] == '\0')
9403 pend = strstr (str + k, "__");
9407 k += strlen (bound);
9411 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
9412 bound = bound_buffer;
9413 strncpy (bound_buffer, str + k, pend - (str + k));
9414 bound[pend - (str + k)] = '\0';
9418 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
9419 if (bound_val == NULL)
9422 *px = value_as_long (bound_val);
9428 /* Value of variable named NAME in the current environment. If
9429 no such variable found, then if ERR_MSG is null, returns 0, and
9430 otherwise causes an error with message ERR_MSG. */
9432 static struct value *
9433 get_var_value (char *name, char *err_msg)
9435 struct ada_symbol_info *syms;
9438 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
9443 if (err_msg == NULL)
9446 error (("%s"), err_msg);
9449 return value_of_variable (syms[0].sym, syms[0].block);
9452 /* Value of integer variable named NAME in the current environment. If
9453 no such variable found, returns 0, and sets *FLAG to 0. If
9454 successful, sets *FLAG to 1. */
9457 get_int_var_value (char *name, int *flag)
9459 struct value *var_val = get_var_value (name, 0);
9471 return value_as_long (var_val);
9476 /* Return a range type whose base type is that of the range type named
9477 NAME in the current environment, and whose bounds are calculated
9478 from NAME according to the GNAT range encoding conventions.
9479 Extract discriminant values, if needed, from DVAL. If a new type
9480 must be created, allocate in OBJFILE's space. The bounds
9481 information, in general, is encoded in NAME, the base type given in
9482 the named range type. */
9484 static struct type *
9485 to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
9487 struct type *raw_type = ada_find_any_type (name);
9488 struct type *base_type;
9491 if (raw_type == NULL)
9492 base_type = builtin_type_int32;
9493 else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
9494 base_type = TYPE_TARGET_TYPE (raw_type);
9496 base_type = raw_type;
9498 subtype_info = strstr (name, "___XD");
9499 if (subtype_info == NULL)
9501 LONGEST L = discrete_type_low_bound (raw_type);
9502 LONGEST U = discrete_type_high_bound (raw_type);
9503 if (L < INT_MIN || U > INT_MAX)
9506 return create_range_type (alloc_type (objfile), raw_type,
9507 discrete_type_low_bound (raw_type),
9508 discrete_type_high_bound (raw_type));
9512 static char *name_buf = NULL;
9513 static size_t name_len = 0;
9514 int prefix_len = subtype_info - name;
9520 GROW_VECT (name_buf, name_len, prefix_len + 5);
9521 strncpy (name_buf, name, prefix_len);
9522 name_buf[prefix_len] = '\0';
9525 bounds_str = strchr (subtype_info, '_');
9528 if (*subtype_info == 'L')
9530 if (!ada_scan_number (bounds_str, n, &L, &n)
9531 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
9533 if (bounds_str[n] == '_')
9535 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
9542 strcpy (name_buf + prefix_len, "___L");
9543 L = get_int_var_value (name_buf, &ok);
9546 lim_warning (_("Unknown lower bound, using 1."));
9551 if (*subtype_info == 'U')
9553 if (!ada_scan_number (bounds_str, n, &U, &n)
9554 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
9560 strcpy (name_buf + prefix_len, "___U");
9561 U = get_int_var_value (name_buf, &ok);
9564 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
9569 if (objfile == NULL)
9570 objfile = TYPE_OBJFILE (base_type);
9571 type = create_range_type (alloc_type (objfile), base_type, L, U);
9572 TYPE_NAME (type) = name;
9577 /* True iff NAME is the name of a range type. */
9580 ada_is_range_type_name (const char *name)
9582 return (name != NULL && strstr (name, "___XD"));
9588 /* True iff TYPE is an Ada modular type. */
9591 ada_is_modular_type (struct type *type)
9593 struct type *subranged_type = base_type (type);
9595 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
9596 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
9597 && TYPE_UNSIGNED (subranged_type));
9600 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9603 ada_modulus (struct type * type)
9605 return (ULONGEST) (unsigned int) TYPE_HIGH_BOUND (type) + 1;
9609 /* Ada exception catchpoint support:
9610 ---------------------------------
9612 We support 3 kinds of exception catchpoints:
9613 . catchpoints on Ada exceptions
9614 . catchpoints on unhandled Ada exceptions
9615 . catchpoints on failed assertions
9617 Exceptions raised during failed assertions, or unhandled exceptions
9618 could perfectly be caught with the general catchpoint on Ada exceptions.
9619 However, we can easily differentiate these two special cases, and having
9620 the option to distinguish these two cases from the rest can be useful
9621 to zero-in on certain situations.
9623 Exception catchpoints are a specialized form of breakpoint,
9624 since they rely on inserting breakpoints inside known routines
9625 of the GNAT runtime. The implementation therefore uses a standard
9626 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9629 Support in the runtime for exception catchpoints have been changed
9630 a few times already, and these changes affect the implementation
9631 of these catchpoints. In order to be able to support several
9632 variants of the runtime, we use a sniffer that will determine
9633 the runtime variant used by the program being debugged.
9635 At this time, we do not support the use of conditions on Ada exception
9636 catchpoints. The COND and COND_STRING fields are therefore set
9637 to NULL (most of the time, see below).
9639 Conditions where EXP_STRING, COND, and COND_STRING are used:
9641 When a user specifies the name of a specific exception in the case
9642 of catchpoints on Ada exceptions, we store the name of that exception
9643 in the EXP_STRING. We then translate this request into an actual
9644 condition stored in COND_STRING, and then parse it into an expression
9647 /* The different types of catchpoints that we introduced for catching
9650 enum exception_catchpoint_kind
9653 ex_catch_exception_unhandled,
9657 /* Ada's standard exceptions. */
9659 static char *standard_exc[] = {
9666 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
9668 /* A structure that describes how to support exception catchpoints
9669 for a given executable. */
9671 struct exception_support_info
9673 /* The name of the symbol to break on in order to insert
9674 a catchpoint on exceptions. */
9675 const char *catch_exception_sym;
9677 /* The name of the symbol to break on in order to insert
9678 a catchpoint on unhandled exceptions. */
9679 const char *catch_exception_unhandled_sym;
9681 /* The name of the symbol to break on in order to insert
9682 a catchpoint on failed assertions. */
9683 const char *catch_assert_sym;
9685 /* Assuming that the inferior just triggered an unhandled exception
9686 catchpoint, this function is responsible for returning the address
9687 in inferior memory where the name of that exception is stored.
9688 Return zero if the address could not be computed. */
9689 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
9692 static CORE_ADDR ada_unhandled_exception_name_addr (void);
9693 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
9695 /* The following exception support info structure describes how to
9696 implement exception catchpoints with the latest version of the
9697 Ada runtime (as of 2007-03-06). */
9699 static const struct exception_support_info default_exception_support_info =
9701 "__gnat_debug_raise_exception", /* catch_exception_sym */
9702 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9703 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9704 ada_unhandled_exception_name_addr
9707 /* The following exception support info structure describes how to
9708 implement exception catchpoints with a slightly older version
9709 of the Ada runtime. */
9711 static const struct exception_support_info exception_support_info_fallback =
9713 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9714 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9715 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9716 ada_unhandled_exception_name_addr_from_raise
9719 /* For each executable, we sniff which exception info structure to use
9720 and cache it in the following global variable. */
9722 static const struct exception_support_info *exception_info = NULL;
9724 /* Inspect the Ada runtime and determine which exception info structure
9725 should be used to provide support for exception catchpoints.
9727 This function will always set exception_info, or raise an error. */
9730 ada_exception_support_info_sniffer (void)
9734 /* If the exception info is already known, then no need to recompute it. */
9735 if (exception_info != NULL)
9738 /* Check the latest (default) exception support info. */
9739 sym = standard_lookup (default_exception_support_info.catch_exception_sym,
9743 exception_info = &default_exception_support_info;
9747 /* Try our fallback exception suport info. */
9748 sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
9752 exception_info = &exception_support_info_fallback;
9756 /* Sometimes, it is normal for us to not be able to find the routine
9757 we are looking for. This happens when the program is linked with
9758 the shared version of the GNAT runtime, and the program has not been
9759 started yet. Inform the user of these two possible causes if
9762 if (ada_update_initial_language (language_unknown, NULL) != language_ada)
9763 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9765 /* If the symbol does not exist, then check that the program is
9766 already started, to make sure that shared libraries have been
9767 loaded. If it is not started, this may mean that the symbol is
9768 in a shared library. */
9770 if (ptid_get_pid (inferior_ptid) == 0)
9771 error (_("Unable to insert catchpoint. Try to start the program first."));
9773 /* At this point, we know that we are debugging an Ada program and
9774 that the inferior has been started, but we still are not able to
9775 find the run-time symbols. That can mean that we are in
9776 configurable run time mode, or that a-except as been optimized
9777 out by the linker... In any case, at this point it is not worth
9778 supporting this feature. */
9780 error (_("Cannot insert catchpoints in this configuration."));
9783 /* An observer of "executable_changed" events.
9784 Its role is to clear certain cached values that need to be recomputed
9785 each time a new executable is loaded by GDB. */
9788 ada_executable_changed_observer (void)
9790 /* If the executable changed, then it is possible that the Ada runtime
9791 is different. So we need to invalidate the exception support info
9793 exception_info = NULL;
9796 /* Return the name of the function at PC, NULL if could not find it.
9797 This function only checks the debugging information, not the symbol
9801 function_name_from_pc (CORE_ADDR pc)
9805 if (!find_pc_partial_function (pc, &func_name, NULL, NULL))
9811 /* True iff FRAME is very likely to be that of a function that is
9812 part of the runtime system. This is all very heuristic, but is
9813 intended to be used as advice as to what frames are uninteresting
9817 is_known_support_routine (struct frame_info *frame)
9819 struct symtab_and_line sal;
9823 /* If this code does not have any debugging information (no symtab),
9824 This cannot be any user code. */
9826 find_frame_sal (frame, &sal);
9827 if (sal.symtab == NULL)
9830 /* If there is a symtab, but the associated source file cannot be
9831 located, then assume this is not user code: Selecting a frame
9832 for which we cannot display the code would not be very helpful
9833 for the user. This should also take care of case such as VxWorks
9834 where the kernel has some debugging info provided for a few units. */
9836 if (symtab_to_fullname (sal.symtab) == NULL)
9839 /* Check the unit filename againt the Ada runtime file naming.
9840 We also check the name of the objfile against the name of some
9841 known system libraries that sometimes come with debugging info
9844 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
9846 re_comp (known_runtime_file_name_patterns[i]);
9847 if (re_exec (sal.symtab->filename))
9849 if (sal.symtab->objfile != NULL
9850 && re_exec (sal.symtab->objfile->name))
9854 /* Check whether the function is a GNAT-generated entity. */
9856 func_name = function_name_from_pc (get_frame_address_in_block (frame));
9857 if (func_name == NULL)
9860 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
9862 re_comp (known_auxiliary_function_name_patterns[i]);
9863 if (re_exec (func_name))
9870 /* Find the first frame that contains debugging information and that is not
9871 part of the Ada run-time, starting from FI and moving upward. */
9874 ada_find_printable_frame (struct frame_info *fi)
9876 for (; fi != NULL; fi = get_prev_frame (fi))
9878 if (!is_known_support_routine (fi))
9887 /* Assuming that the inferior just triggered an unhandled exception
9888 catchpoint, return the address in inferior memory where the name
9889 of the exception is stored.
9891 Return zero if the address could not be computed. */
9894 ada_unhandled_exception_name_addr (void)
9896 return parse_and_eval_address ("e.full_name");
9899 /* Same as ada_unhandled_exception_name_addr, except that this function
9900 should be used when the inferior uses an older version of the runtime,
9901 where the exception name needs to be extracted from a specific frame
9902 several frames up in the callstack. */
9905 ada_unhandled_exception_name_addr_from_raise (void)
9908 struct frame_info *fi;
9910 /* To determine the name of this exception, we need to select
9911 the frame corresponding to RAISE_SYM_NAME. This frame is
9912 at least 3 levels up, so we simply skip the first 3 frames
9913 without checking the name of their associated function. */
9914 fi = get_current_frame ();
9915 for (frame_level = 0; frame_level < 3; frame_level += 1)
9917 fi = get_prev_frame (fi);
9921 const char *func_name =
9922 function_name_from_pc (get_frame_address_in_block (fi));
9923 if (func_name != NULL
9924 && strcmp (func_name, exception_info->catch_exception_sym) == 0)
9925 break; /* We found the frame we were looking for... */
9926 fi = get_prev_frame (fi);
9933 return parse_and_eval_address ("id.full_name");
9936 /* Assuming the inferior just triggered an Ada exception catchpoint
9937 (of any type), return the address in inferior memory where the name
9938 of the exception is stored, if applicable.
9940 Return zero if the address could not be computed, or if not relevant. */
9943 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
9944 struct breakpoint *b)
9948 case ex_catch_exception:
9949 return (parse_and_eval_address ("e.full_name"));
9952 case ex_catch_exception_unhandled:
9953 return exception_info->unhandled_exception_name_addr ();
9956 case ex_catch_assert:
9957 return 0; /* Exception name is not relevant in this case. */
9961 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
9965 return 0; /* Should never be reached. */
9968 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9969 any error that ada_exception_name_addr_1 might cause to be thrown.
9970 When an error is intercepted, a warning with the error message is printed,
9971 and zero is returned. */
9974 ada_exception_name_addr (enum exception_catchpoint_kind ex,
9975 struct breakpoint *b)
9977 struct gdb_exception e;
9978 CORE_ADDR result = 0;
9980 TRY_CATCH (e, RETURN_MASK_ERROR)
9982 result = ada_exception_name_addr_1 (ex, b);
9987 warning (_("failed to get exception name: %s"), e.message);
9994 /* Implement the PRINT_IT method in the breakpoint_ops structure
9995 for all exception catchpoint kinds. */
9997 static enum print_stop_action
9998 print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
10000 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
10001 char exception_name[256];
10005 read_memory (addr, exception_name, sizeof (exception_name) - 1);
10006 exception_name [sizeof (exception_name) - 1] = '\0';
10009 ada_find_printable_frame (get_current_frame ());
10011 annotate_catchpoint (b->number);
10014 case ex_catch_exception:
10016 printf_filtered (_("\nCatchpoint %d, %s at "),
10017 b->number, exception_name);
10019 printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
10021 case ex_catch_exception_unhandled:
10023 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10024 b->number, exception_name);
10026 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10029 case ex_catch_assert:
10030 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10035 return PRINT_SRC_AND_LOC;
10038 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10039 for all exception catchpoint kinds. */
10042 print_one_exception (enum exception_catchpoint_kind ex,
10043 struct breakpoint *b, CORE_ADDR *last_addr)
10045 struct value_print_options opts;
10047 get_user_print_options (&opts);
10048 if (opts.addressprint)
10050 annotate_field (4);
10051 ui_out_field_core_addr (uiout, "addr", b->loc->address);
10054 annotate_field (5);
10055 *last_addr = b->loc->address;
10058 case ex_catch_exception:
10059 if (b->exp_string != NULL)
10061 char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
10063 ui_out_field_string (uiout, "what", msg);
10067 ui_out_field_string (uiout, "what", "all Ada exceptions");
10071 case ex_catch_exception_unhandled:
10072 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
10075 case ex_catch_assert:
10076 ui_out_field_string (uiout, "what", "failed Ada assertions");
10080 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10085 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10086 for all exception catchpoint kinds. */
10089 print_mention_exception (enum exception_catchpoint_kind ex,
10090 struct breakpoint *b)
10094 case ex_catch_exception:
10095 if (b->exp_string != NULL)
10096 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10097 b->number, b->exp_string);
10099 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
10103 case ex_catch_exception_unhandled:
10104 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10108 case ex_catch_assert:
10109 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
10113 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
10118 /* Virtual table for "catch exception" breakpoints. */
10120 static enum print_stop_action
10121 print_it_catch_exception (struct breakpoint *b)
10123 return print_it_exception (ex_catch_exception, b);
10127 print_one_catch_exception (struct breakpoint *b, CORE_ADDR *last_addr)
10129 print_one_exception (ex_catch_exception, b, last_addr);
10133 print_mention_catch_exception (struct breakpoint *b)
10135 print_mention_exception (ex_catch_exception, b);
10138 static struct breakpoint_ops catch_exception_breakpoint_ops =
10142 NULL, /* breakpoint_hit */
10143 print_it_catch_exception,
10144 print_one_catch_exception,
10145 print_mention_catch_exception
10148 /* Virtual table for "catch exception unhandled" breakpoints. */
10150 static enum print_stop_action
10151 print_it_catch_exception_unhandled (struct breakpoint *b)
10153 return print_it_exception (ex_catch_exception_unhandled, b);
10157 print_one_catch_exception_unhandled (struct breakpoint *b, CORE_ADDR *last_addr)
10159 print_one_exception (ex_catch_exception_unhandled, b, last_addr);
10163 print_mention_catch_exception_unhandled (struct breakpoint *b)
10165 print_mention_exception (ex_catch_exception_unhandled, b);
10168 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
10171 NULL, /* breakpoint_hit */
10172 print_it_catch_exception_unhandled,
10173 print_one_catch_exception_unhandled,
10174 print_mention_catch_exception_unhandled
10177 /* Virtual table for "catch assert" breakpoints. */
10179 static enum print_stop_action
10180 print_it_catch_assert (struct breakpoint *b)
10182 return print_it_exception (ex_catch_assert, b);
10186 print_one_catch_assert (struct breakpoint *b, CORE_ADDR *last_addr)
10188 print_one_exception (ex_catch_assert, b, last_addr);
10192 print_mention_catch_assert (struct breakpoint *b)
10194 print_mention_exception (ex_catch_assert, b);
10197 static struct breakpoint_ops catch_assert_breakpoint_ops = {
10200 NULL, /* breakpoint_hit */
10201 print_it_catch_assert,
10202 print_one_catch_assert,
10203 print_mention_catch_assert
10206 /* Return non-zero if B is an Ada exception catchpoint. */
10209 ada_exception_catchpoint_p (struct breakpoint *b)
10211 return (b->ops == &catch_exception_breakpoint_ops
10212 || b->ops == &catch_exception_unhandled_breakpoint_ops
10213 || b->ops == &catch_assert_breakpoint_ops);
10216 /* Return a newly allocated copy of the first space-separated token
10217 in ARGSP, and then adjust ARGSP to point immediately after that
10220 Return NULL if ARGPS does not contain any more tokens. */
10223 ada_get_next_arg (char **argsp)
10225 char *args = *argsp;
10229 /* Skip any leading white space. */
10231 while (isspace (*args))
10234 if (args[0] == '\0')
10235 return NULL; /* No more arguments. */
10237 /* Find the end of the current argument. */
10240 while (*end != '\0' && !isspace (*end))
10243 /* Adjust ARGSP to point to the start of the next argument. */
10247 /* Make a copy of the current argument and return it. */
10249 result = xmalloc (end - args + 1);
10250 strncpy (result, args, end - args);
10251 result[end - args] = '\0';
10256 /* Split the arguments specified in a "catch exception" command.
10257 Set EX to the appropriate catchpoint type.
10258 Set EXP_STRING to the name of the specific exception if
10259 specified by the user. */
10262 catch_ada_exception_command_split (char *args,
10263 enum exception_catchpoint_kind *ex,
10266 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
10267 char *exception_name;
10269 exception_name = ada_get_next_arg (&args);
10270 make_cleanup (xfree, exception_name);
10272 /* Check that we do not have any more arguments. Anything else
10275 while (isspace (*args))
10278 if (args[0] != '\0')
10279 error (_("Junk at end of expression"));
10281 discard_cleanups (old_chain);
10283 if (exception_name == NULL)
10285 /* Catch all exceptions. */
10286 *ex = ex_catch_exception;
10287 *exp_string = NULL;
10289 else if (strcmp (exception_name, "unhandled") == 0)
10291 /* Catch unhandled exceptions. */
10292 *ex = ex_catch_exception_unhandled;
10293 *exp_string = NULL;
10297 /* Catch a specific exception. */
10298 *ex = ex_catch_exception;
10299 *exp_string = exception_name;
10303 /* Return the name of the symbol on which we should break in order to
10304 implement a catchpoint of the EX kind. */
10306 static const char *
10307 ada_exception_sym_name (enum exception_catchpoint_kind ex)
10309 gdb_assert (exception_info != NULL);
10313 case ex_catch_exception:
10314 return (exception_info->catch_exception_sym);
10316 case ex_catch_exception_unhandled:
10317 return (exception_info->catch_exception_unhandled_sym);
10319 case ex_catch_assert:
10320 return (exception_info->catch_assert_sym);
10323 internal_error (__FILE__, __LINE__,
10324 _("unexpected catchpoint kind (%d)"), ex);
10328 /* Return the breakpoint ops "virtual table" used for catchpoints
10331 static struct breakpoint_ops *
10332 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
10336 case ex_catch_exception:
10337 return (&catch_exception_breakpoint_ops);
10339 case ex_catch_exception_unhandled:
10340 return (&catch_exception_unhandled_breakpoint_ops);
10342 case ex_catch_assert:
10343 return (&catch_assert_breakpoint_ops);
10346 internal_error (__FILE__, __LINE__,
10347 _("unexpected catchpoint kind (%d)"), ex);
10351 /* Return the condition that will be used to match the current exception
10352 being raised with the exception that the user wants to catch. This
10353 assumes that this condition is used when the inferior just triggered
10354 an exception catchpoint.
10356 The string returned is a newly allocated string that needs to be
10357 deallocated later. */
10360 ada_exception_catchpoint_cond_string (const char *exp_string)
10364 /* The standard exceptions are a special case. They are defined in
10365 runtime units that have been compiled without debugging info; if
10366 EXP_STRING is the not-fully-qualified name of a standard
10367 exception (e.g. "constraint_error") then, during the evaluation
10368 of the condition expression, the symbol lookup on this name would
10369 *not* return this standard exception. The catchpoint condition
10370 may then be set only on user-defined exceptions which have the
10371 same not-fully-qualified name (e.g. my_package.constraint_error).
10373 To avoid this unexcepted behavior, these standard exceptions are
10374 systematically prefixed by "standard". This means that "catch
10375 exception constraint_error" is rewritten into "catch exception
10376 standard.constraint_error".
10378 If an exception named contraint_error is defined in another package of
10379 the inferior program, then the only way to specify this exception as a
10380 breakpoint condition is to use its fully-qualified named:
10381 e.g. my_package.constraint_error. */
10383 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
10385 if (strcmp (standard_exc [i], exp_string) == 0)
10387 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10391 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
10394 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10396 static struct expression *
10397 ada_parse_catchpoint_condition (char *cond_string,
10398 struct symtab_and_line sal)
10400 return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
10403 /* Return the symtab_and_line that should be used to insert an exception
10404 catchpoint of the TYPE kind.
10406 EX_STRING should contain the name of a specific exception
10407 that the catchpoint should catch, or NULL otherwise.
10409 The idea behind all the remaining parameters is that their names match
10410 the name of certain fields in the breakpoint structure that are used to
10411 handle exception catchpoints. This function returns the value to which
10412 these fields should be set, depending on the type of catchpoint we need
10415 If COND and COND_STRING are both non-NULL, any value they might
10416 hold will be free'ed, and then replaced by newly allocated ones.
10417 These parameters are left untouched otherwise. */
10419 static struct symtab_and_line
10420 ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
10421 char **addr_string, char **cond_string,
10422 struct expression **cond, struct breakpoint_ops **ops)
10424 const char *sym_name;
10425 struct symbol *sym;
10426 struct symtab_and_line sal;
10428 /* First, find out which exception support info to use. */
10429 ada_exception_support_info_sniffer ();
10431 /* Then lookup the function on which we will break in order to catch
10432 the Ada exceptions requested by the user. */
10434 sym_name = ada_exception_sym_name (ex);
10435 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
10437 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10438 that should be compiled with debugging information. As a result, we
10439 expect to find that symbol in the symtabs. If we don't find it, then
10440 the target most likely does not support Ada exceptions, or we cannot
10441 insert exception breakpoints yet, because the GNAT runtime hasn't been
10444 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10445 in such a way that no debugging information is produced for the symbol
10446 we are looking for. In this case, we could search the minimal symbols
10447 as a fall-back mechanism. This would still be operating in degraded
10448 mode, however, as we would still be missing the debugging information
10449 that is needed in order to extract the name of the exception being
10450 raised (this name is printed in the catchpoint message, and is also
10451 used when trying to catch a specific exception). We do not handle
10452 this case for now. */
10455 error (_("Unable to break on '%s' in this configuration."), sym_name);
10457 /* Make sure that the symbol we found corresponds to a function. */
10458 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
10459 error (_("Symbol \"%s\" is not a function (class = %d)"),
10460 sym_name, SYMBOL_CLASS (sym));
10462 sal = find_function_start_sal (sym, 1);
10464 /* Set ADDR_STRING. */
10466 *addr_string = xstrdup (sym_name);
10468 /* Set the COND and COND_STRING (if not NULL). */
10470 if (cond_string != NULL && cond != NULL)
10472 if (*cond_string != NULL)
10474 xfree (*cond_string);
10475 *cond_string = NULL;
10482 if (exp_string != NULL)
10484 *cond_string = ada_exception_catchpoint_cond_string (exp_string);
10485 *cond = ada_parse_catchpoint_condition (*cond_string, sal);
10490 *ops = ada_exception_breakpoint_ops (ex);
10495 /* Parse the arguments (ARGS) of the "catch exception" command.
10497 Set TYPE to the appropriate exception catchpoint type.
10498 If the user asked the catchpoint to catch only a specific
10499 exception, then save the exception name in ADDR_STRING.
10501 See ada_exception_sal for a description of all the remaining
10502 function arguments of this function. */
10504 struct symtab_and_line
10505 ada_decode_exception_location (char *args, char **addr_string,
10506 char **exp_string, char **cond_string,
10507 struct expression **cond,
10508 struct breakpoint_ops **ops)
10510 enum exception_catchpoint_kind ex;
10512 catch_ada_exception_command_split (args, &ex, exp_string);
10513 return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
10517 struct symtab_and_line
10518 ada_decode_assert_location (char *args, char **addr_string,
10519 struct breakpoint_ops **ops)
10521 /* Check that no argument where provided at the end of the command. */
10525 while (isspace (*args))
10528 error (_("Junk at end of arguments."));
10531 return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
10536 /* Information about operators given special treatment in functions
10538 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10540 #define ADA_OPERATORS \
10541 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10542 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10543 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10544 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10545 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10546 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10547 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10548 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10549 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10550 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10551 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10552 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10553 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10554 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10555 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10556 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10557 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10558 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10559 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10562 ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
10564 switch (exp->elts[pc - 1].opcode)
10567 operator_length_standard (exp, pc, oplenp, argsp);
10570 #define OP_DEFN(op, len, args, binop) \
10571 case op: *oplenp = len; *argsp = args; break;
10577 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
10582 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
10588 ada_op_name (enum exp_opcode opcode)
10593 return op_name_standard (opcode);
10595 #define OP_DEFN(op, len, args, binop) case op: return #op;
10600 return "OP_AGGREGATE";
10602 return "OP_CHOICES";
10608 /* As for operator_length, but assumes PC is pointing at the first
10609 element of the operator, and gives meaningful results only for the
10610 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10613 ada_forward_operator_length (struct expression *exp, int pc,
10614 int *oplenp, int *argsp)
10616 switch (exp->elts[pc].opcode)
10619 *oplenp = *argsp = 0;
10622 #define OP_DEFN(op, len, args, binop) \
10623 case op: *oplenp = len; *argsp = args; break;
10629 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
10634 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
10640 int len = longest_to_int (exp->elts[pc + 1].longconst);
10641 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
10649 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
10651 enum exp_opcode op = exp->elts[elt].opcode;
10656 ada_forward_operator_length (exp, elt, &oplen, &nargs);
10660 /* Ada attributes ('Foo). */
10663 case OP_ATR_LENGTH:
10667 case OP_ATR_MODULUS:
10674 case UNOP_IN_RANGE:
10676 /* XXX: gdb_sprint_host_address, type_sprint */
10677 fprintf_filtered (stream, _("Type @"));
10678 gdb_print_host_address (exp->elts[pc + 1].type, stream);
10679 fprintf_filtered (stream, " (");
10680 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
10681 fprintf_filtered (stream, ")");
10683 case BINOP_IN_BOUNDS:
10684 fprintf_filtered (stream, " (%d)",
10685 longest_to_int (exp->elts[pc + 2].longconst));
10687 case TERNOP_IN_RANGE:
10692 case OP_DISCRETE_RANGE:
10693 case OP_POSITIONAL:
10700 char *name = &exp->elts[elt + 2].string;
10701 int len = longest_to_int (exp->elts[elt + 1].longconst);
10702 fprintf_filtered (stream, "Text: `%.*s'", len, name);
10707 return dump_subexp_body_standard (exp, stream, elt);
10711 for (i = 0; i < nargs; i += 1)
10712 elt = dump_subexp (exp, stream, elt);
10717 /* The Ada extension of print_subexp (q.v.). */
10720 ada_print_subexp (struct expression *exp, int *pos,
10721 struct ui_file *stream, enum precedence prec)
10723 int oplen, nargs, i;
10725 enum exp_opcode op = exp->elts[pc].opcode;
10727 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10734 print_subexp_standard (exp, pos, stream, prec);
10738 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
10741 case BINOP_IN_BOUNDS:
10742 /* XXX: sprint_subexp */
10743 print_subexp (exp, pos, stream, PREC_SUFFIX);
10744 fputs_filtered (" in ", stream);
10745 print_subexp (exp, pos, stream, PREC_SUFFIX);
10746 fputs_filtered ("'range", stream);
10747 if (exp->elts[pc + 1].longconst > 1)
10748 fprintf_filtered (stream, "(%ld)",
10749 (long) exp->elts[pc + 1].longconst);
10752 case TERNOP_IN_RANGE:
10753 if (prec >= PREC_EQUAL)
10754 fputs_filtered ("(", stream);
10755 /* XXX: sprint_subexp */
10756 print_subexp (exp, pos, stream, PREC_SUFFIX);
10757 fputs_filtered (" in ", stream);
10758 print_subexp (exp, pos, stream, PREC_EQUAL);
10759 fputs_filtered (" .. ", stream);
10760 print_subexp (exp, pos, stream, PREC_EQUAL);
10761 if (prec >= PREC_EQUAL)
10762 fputs_filtered (")", stream);
10767 case OP_ATR_LENGTH:
10771 case OP_ATR_MODULUS:
10776 if (exp->elts[*pos].opcode == OP_TYPE)
10778 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
10779 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
10783 print_subexp (exp, pos, stream, PREC_SUFFIX);
10784 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
10788 for (tem = 1; tem < nargs; tem += 1)
10790 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
10791 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
10793 fputs_filtered (")", stream);
10798 type_print (exp->elts[pc + 1].type, "", stream, 0);
10799 fputs_filtered ("'(", stream);
10800 print_subexp (exp, pos, stream, PREC_PREFIX);
10801 fputs_filtered (")", stream);
10804 case UNOP_IN_RANGE:
10805 /* XXX: sprint_subexp */
10806 print_subexp (exp, pos, stream, PREC_SUFFIX);
10807 fputs_filtered (" in ", stream);
10808 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
10811 case OP_DISCRETE_RANGE:
10812 print_subexp (exp, pos, stream, PREC_SUFFIX);
10813 fputs_filtered ("..", stream);
10814 print_subexp (exp, pos, stream, PREC_SUFFIX);
10818 fputs_filtered ("others => ", stream);
10819 print_subexp (exp, pos, stream, PREC_SUFFIX);
10823 for (i = 0; i < nargs-1; i += 1)
10826 fputs_filtered ("|", stream);
10827 print_subexp (exp, pos, stream, PREC_SUFFIX);
10829 fputs_filtered (" => ", stream);
10830 print_subexp (exp, pos, stream, PREC_SUFFIX);
10833 case OP_POSITIONAL:
10834 print_subexp (exp, pos, stream, PREC_SUFFIX);
10838 fputs_filtered ("(", stream);
10839 for (i = 0; i < nargs; i += 1)
10842 fputs_filtered (", ", stream);
10843 print_subexp (exp, pos, stream, PREC_SUFFIX);
10845 fputs_filtered (")", stream);
10850 /* Table mapping opcodes into strings for printing operators
10851 and precedences of the operators. */
10853 static const struct op_print ada_op_print_tab[] = {
10854 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
10855 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
10856 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
10857 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
10858 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
10859 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
10860 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
10861 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
10862 {"<=", BINOP_LEQ, PREC_ORDER, 0},
10863 {">=", BINOP_GEQ, PREC_ORDER, 0},
10864 {">", BINOP_GTR, PREC_ORDER, 0},
10865 {"<", BINOP_LESS, PREC_ORDER, 0},
10866 {">>", BINOP_RSH, PREC_SHIFT, 0},
10867 {"<<", BINOP_LSH, PREC_SHIFT, 0},
10868 {"+", BINOP_ADD, PREC_ADD, 0},
10869 {"-", BINOP_SUB, PREC_ADD, 0},
10870 {"&", BINOP_CONCAT, PREC_ADD, 0},
10871 {"*", BINOP_MUL, PREC_MUL, 0},
10872 {"/", BINOP_DIV, PREC_MUL, 0},
10873 {"rem", BINOP_REM, PREC_MUL, 0},
10874 {"mod", BINOP_MOD, PREC_MUL, 0},
10875 {"**", BINOP_EXP, PREC_REPEAT, 0},
10876 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
10877 {"-", UNOP_NEG, PREC_PREFIX, 0},
10878 {"+", UNOP_PLUS, PREC_PREFIX, 0},
10879 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
10880 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
10881 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
10882 {".all", UNOP_IND, PREC_SUFFIX, 1},
10883 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
10884 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
10888 enum ada_primitive_types {
10889 ada_primitive_type_int,
10890 ada_primitive_type_long,
10891 ada_primitive_type_short,
10892 ada_primitive_type_char,
10893 ada_primitive_type_float,
10894 ada_primitive_type_double,
10895 ada_primitive_type_void,
10896 ada_primitive_type_long_long,
10897 ada_primitive_type_long_double,
10898 ada_primitive_type_natural,
10899 ada_primitive_type_positive,
10900 ada_primitive_type_system_address,
10901 nr_ada_primitive_types
10905 ada_language_arch_info (struct gdbarch *gdbarch,
10906 struct language_arch_info *lai)
10908 const struct builtin_type *builtin = builtin_type (gdbarch);
10909 lai->primitive_type_vector
10910 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
10912 lai->primitive_type_vector [ada_primitive_type_int] =
10913 init_type (TYPE_CODE_INT,
10914 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
10915 0, "integer", (struct objfile *) NULL);
10916 lai->primitive_type_vector [ada_primitive_type_long] =
10917 init_type (TYPE_CODE_INT,
10918 gdbarch_long_bit (gdbarch) / TARGET_CHAR_BIT,
10919 0, "long_integer", (struct objfile *) NULL);
10920 lai->primitive_type_vector [ada_primitive_type_short] =
10921 init_type (TYPE_CODE_INT,
10922 gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
10923 0, "short_integer", (struct objfile *) NULL);
10924 lai->string_char_type =
10925 lai->primitive_type_vector [ada_primitive_type_char] =
10926 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
10927 0, "character", (struct objfile *) NULL);
10928 lai->primitive_type_vector [ada_primitive_type_float] =
10929 init_type (TYPE_CODE_FLT,
10930 gdbarch_float_bit (gdbarch)/ TARGET_CHAR_BIT,
10931 0, "float", (struct objfile *) NULL);
10932 lai->primitive_type_vector [ada_primitive_type_double] =
10933 init_type (TYPE_CODE_FLT,
10934 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
10935 0, "long_float", (struct objfile *) NULL);
10936 lai->primitive_type_vector [ada_primitive_type_long_long] =
10937 init_type (TYPE_CODE_INT,
10938 gdbarch_long_long_bit (gdbarch) / TARGET_CHAR_BIT,
10939 0, "long_long_integer", (struct objfile *) NULL);
10940 lai->primitive_type_vector [ada_primitive_type_long_double] =
10941 init_type (TYPE_CODE_FLT,
10942 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
10943 0, "long_long_float", (struct objfile *) NULL);
10944 lai->primitive_type_vector [ada_primitive_type_natural] =
10945 init_type (TYPE_CODE_INT,
10946 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
10947 0, "natural", (struct objfile *) NULL);
10948 lai->primitive_type_vector [ada_primitive_type_positive] =
10949 init_type (TYPE_CODE_INT,
10950 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
10951 0, "positive", (struct objfile *) NULL);
10952 lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
10954 lai->primitive_type_vector [ada_primitive_type_system_address] =
10955 lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
10956 (struct objfile *) NULL));
10957 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
10958 = "system__address";
10960 lai->bool_type_symbol = "boolean";
10961 lai->bool_type_default = builtin->builtin_bool;
10964 /* Language vector */
10966 /* Not really used, but needed in the ada_language_defn. */
10969 emit_char (int c, struct ui_file *stream, int quoter)
10971 ada_emit_char (c, stream, quoter, 1);
10977 warnings_issued = 0;
10978 return ada_parse ();
10981 static const struct exp_descriptor ada_exp_descriptor = {
10983 ada_operator_length,
10985 ada_dump_subexp_body,
10986 ada_evaluate_subexp
10989 const struct language_defn ada_language_defn = {
10990 "ada", /* Language name */
10994 case_sensitive_on, /* Yes, Ada is case-insensitive, but
10995 that's not quite what this means. */
10997 macro_expansion_no,
10998 &ada_exp_descriptor,
11002 ada_printchar, /* Print a character constant */
11003 ada_printstr, /* Function to print string constant */
11004 emit_char, /* Function to print single char (not used) */
11005 ada_print_type, /* Print a type using appropriate syntax */
11006 default_print_typedef, /* Print a typedef using appropriate syntax */
11007 ada_val_print, /* Print a value using appropriate syntax */
11008 ada_value_print, /* Print a top-level value */
11009 NULL, /* Language specific skip_trampoline */
11010 NULL, /* name_of_this */
11011 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
11012 basic_lookup_transparent_type, /* lookup_transparent_type */
11013 ada_la_decode, /* Language specific symbol demangler */
11014 NULL, /* Language specific class_name_from_physname */
11015 ada_op_print_tab, /* expression operators for printing */
11016 0, /* c-style arrays */
11017 1, /* String lower bound */
11018 ada_get_gdb_completer_word_break_characters,
11019 ada_make_symbol_completion_list,
11020 ada_language_arch_info,
11021 ada_print_array_index,
11022 default_pass_by_reference,
11027 /* Provide a prototype to silence -Wmissing-prototypes. */
11028 extern initialize_file_ftype _initialize_ada_language;
11031 _initialize_ada_language (void)
11033 add_language (&ada_language_defn);
11035 varsize_limit = 65536;
11037 obstack_init (&symbol_list_obstack);
11039 decoded_names_store = htab_create_alloc
11040 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
11041 NULL, xcalloc, xfree);
11043 observer_attach_executable_changed (ada_executable_changed_observer);