1 /* Ada language support routines for GDB, the GNU debugger. Copyright
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005 Free
4 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 2 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, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
25 #include "gdb_string.h"
29 #include "gdb_regex.h"
34 #include "expression.h"
35 #include "parser-defs.h"
41 #include "breakpoint.h"
44 #include "gdb_obstack.h"
46 #include "completer.h"
53 #include "dictionary.h"
54 #include "exceptions.h"
56 #ifndef ADA_RETAIN_DOTS
57 #define ADA_RETAIN_DOTS 0
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)
69 static void extract_string (CORE_ADDR addr, char *buf);
71 static struct type *ada_create_fundamental_type (struct objfile *, int);
73 static void modify_general_field (char *, LONGEST, int, int);
75 static struct type *desc_base_type (struct type *);
77 static struct type *desc_bounds_type (struct type *);
79 static struct value *desc_bounds (struct value *);
81 static int fat_pntr_bounds_bitpos (struct type *);
83 static int fat_pntr_bounds_bitsize (struct type *);
85 static struct type *desc_data_type (struct type *);
87 static struct value *desc_data (struct value *);
89 static int fat_pntr_data_bitpos (struct type *);
91 static int fat_pntr_data_bitsize (struct type *);
93 static struct value *desc_one_bound (struct value *, int, int);
95 static int desc_bound_bitpos (struct type *, int, int);
97 static int desc_bound_bitsize (struct type *, int, int);
99 static struct type *desc_index_type (struct type *, int);
101 static int desc_arity (struct type *);
103 static int ada_type_match (struct type *, struct type *, int);
105 static int ada_args_match (struct symbol *, struct value **, int);
107 static struct value *ensure_lval (struct value *, CORE_ADDR *);
109 static struct value *convert_actual (struct value *, struct type *,
112 static struct value *make_array_descriptor (struct type *, struct value *,
115 static void ada_add_block_symbols (struct obstack *,
116 struct block *, const char *,
117 domain_enum, struct objfile *,
118 struct symtab *, int);
120 static int is_nonfunction (struct ada_symbol_info *, int);
122 static void add_defn_to_vec (struct obstack *, struct symbol *,
123 struct block *, struct symtab *);
125 static int num_defns_collected (struct obstack *);
127 static struct ada_symbol_info *defns_collected (struct obstack *, int);
129 static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab
130 *, const char *, int,
133 static struct symtab *symtab_for_sym (struct symbol *);
135 static struct value *resolve_subexp (struct expression **, int *, int,
138 static void replace_operator_with_call (struct expression **, int, int, int,
139 struct symbol *, struct block *);
141 static int possible_user_operator_p (enum exp_opcode, struct value **);
143 static char *ada_op_name (enum exp_opcode);
145 static const char *ada_decoded_op_name (enum exp_opcode);
147 static int numeric_type_p (struct type *);
149 static int integer_type_p (struct type *);
151 static int scalar_type_p (struct type *);
153 static int discrete_type_p (struct type *);
155 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
158 static struct value *evaluate_subexp (struct type *, struct expression *,
161 static struct value *evaluate_subexp_type (struct expression *, int *);
163 static int is_dynamic_field (struct type *, int);
165 static struct type *to_fixed_variant_branch_type (struct type *,
167 CORE_ADDR, struct value *);
169 static struct type *to_fixed_array_type (struct type *, struct value *, int);
171 static struct type *to_fixed_range_type (char *, struct value *,
174 static struct type *to_static_fixed_type (struct type *);
176 static struct value *unwrap_value (struct value *);
178 static struct type *packed_array_type (struct type *, long *);
180 static struct type *decode_packed_array_type (struct type *);
182 static struct value *decode_packed_array (struct value *);
184 static struct value *value_subscript_packed (struct value *, int,
187 static struct value *coerce_unspec_val_to_type (struct value *,
190 static struct value *get_var_value (char *, char *);
192 static int lesseq_defined_than (struct symbol *, struct symbol *);
194 static int equiv_types (struct type *, struct type *);
196 static int is_name_suffix (const char *);
198 static int wild_match (const char *, int, const char *);
200 static struct value *ada_coerce_ref (struct value *);
202 static LONGEST pos_atr (struct value *);
204 static struct value *value_pos_atr (struct value *);
206 static struct value *value_val_atr (struct type *, struct value *);
208 static struct symbol *standard_lookup (const char *, const struct block *,
211 static struct value *ada_search_struct_field (char *, struct value *, int,
214 static struct value *ada_value_primitive_field (struct value *, int, int,
217 static int find_struct_field (char *, struct type *, int,
218 struct type **, int *, int *, int *);
220 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
223 static struct value *ada_to_fixed_value (struct value *);
225 static int ada_resolve_function (struct ada_symbol_info *, int,
226 struct value **, int, const char *,
229 static struct value *ada_coerce_to_simple_array (struct value *);
231 static int ada_is_direct_array_type (struct type *);
233 static void ada_language_arch_info (struct gdbarch *,
234 struct language_arch_info *);
236 static void check_size (const struct type *);
240 /* Maximum-sized dynamic type. */
241 static unsigned int varsize_limit;
243 /* FIXME: brobecker/2003-09-17: No longer a const because it is
244 returned by a function that does not return a const char *. */
245 static char *ada_completer_word_break_characters =
247 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
249 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
252 /* The name of the symbol to use to get the name of the main subprogram. */
253 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
254 = "__gnat_ada_main_program_name";
256 /* The name of the runtime function called when an exception is raised. */
257 static const char raise_sym_name[] = "__gnat_raise_nodefer_with_msg";
259 /* The name of the runtime function called when an unhandled exception
261 static const char raise_unhandled_sym_name[] = "__gnat_unhandled_exception";
263 /* The name of the runtime function called when an assert failure is
265 static const char raise_assert_sym_name[] =
266 "system__assertions__raise_assert_failure";
268 /* When GDB stops on an unhandled exception, GDB will go up the stack until
269 if finds a frame corresponding to this function, in order to extract the
270 name of the exception that has been raised from one of the parameters. */
271 static const char process_raise_exception_name[] =
272 "ada__exceptions__process_raise_exception";
274 /* A string that reflects the longest exception expression rewrite,
275 aside from the exception name. */
276 static const char longest_exception_template[] =
277 "'__gnat_raise_nodefer_with_msg' if long_integer(e) = long_integer(&)";
279 /* Limit on the number of warnings to raise per expression evaluation. */
280 static int warning_limit = 2;
282 /* Number of warning messages issued; reset to 0 by cleanups after
283 expression evaluation. */
284 static int warnings_issued = 0;
286 static const char *known_runtime_file_name_patterns[] = {
287 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
290 static const char *known_auxiliary_function_name_patterns[] = {
291 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
294 /* Space for allocating results of ada_lookup_symbol_list. */
295 static struct obstack symbol_list_obstack;
301 ada_get_gdb_completer_word_break_characters (void)
303 return ada_completer_word_break_characters;
306 /* Read the string located at ADDR from the inferior and store the
310 extract_string (CORE_ADDR addr, char *buf)
314 /* Loop, reading one byte at a time, until we reach the '\000'
315 end-of-string marker. */
318 target_read_memory (addr + char_index * sizeof (char),
319 buf + char_index * sizeof (char), sizeof (char));
322 while (buf[char_index - 1] != '\000');
325 /* Assuming VECT points to an array of *SIZE objects of size
326 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
327 updating *SIZE as necessary and returning the (new) array. */
330 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
332 if (*size < min_size)
335 if (*size < min_size)
337 vect = xrealloc (vect, *size * element_size);
342 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
343 suffix of FIELD_NAME beginning "___". */
346 field_name_match (const char *field_name, const char *target)
348 int len = strlen (target);
350 (strncmp (field_name, target, len) == 0
351 && (field_name[len] == '\0'
352 || (strncmp (field_name + len, "___", 3) == 0
353 && strcmp (field_name + strlen (field_name) - 6,
358 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
359 FIELD_NAME, and return its index. This function also handles fields
360 whose name have ___ suffixes because the compiler sometimes alters
361 their name by adding such a suffix to represent fields with certain
362 constraints. If the field could not be found, return a negative
363 number if MAYBE_MISSING is set. Otherwise raise an error. */
366 ada_get_field_index (const struct type *type, const char *field_name,
370 for (fieldno = 0; fieldno < TYPE_NFIELDS (type); fieldno++)
371 if (field_name_match (TYPE_FIELD_NAME (type, fieldno), field_name))
375 error (_("Unable to find field %s in struct %s. Aborting"),
376 field_name, TYPE_NAME (type));
381 /* The length of the prefix of NAME prior to any "___" suffix. */
384 ada_name_prefix_len (const char *name)
390 const char *p = strstr (name, "___");
392 return strlen (name);
398 /* Return non-zero if SUFFIX is a suffix of STR.
399 Return zero if STR is null. */
402 is_suffix (const char *str, const char *suffix)
408 len2 = strlen (suffix);
409 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
412 /* Create a value of type TYPE whose contents come from VALADDR, if it
413 is non-null, and whose memory address (in the inferior) is
417 value_from_contents_and_address (struct type *type,
418 const bfd_byte *valaddr,
421 struct value *v = allocate_value (type);
425 memcpy (VALUE_CONTENTS_RAW (v), valaddr, TYPE_LENGTH (type));
426 VALUE_ADDRESS (v) = address;
428 VALUE_LVAL (v) = lval_memory;
432 /* The contents of value VAL, treated as a value of type TYPE. The
433 result is an lval in memory if VAL is. */
435 static struct value *
436 coerce_unspec_val_to_type (struct value *val, struct type *type)
438 type = ada_check_typedef (type);
439 if (value_type (val) == type)
443 struct value *result;
445 /* Make sure that the object size is not unreasonable before
446 trying to allocate some memory for it. */
449 result = allocate_value (type);
450 VALUE_LVAL (result) = VALUE_LVAL (val);
451 result->bitsize = value_bitsize (val);
452 result->bitpos = value_bitpos (val);
453 VALUE_ADDRESS (result) = VALUE_ADDRESS (val) + value_offset (val);
455 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
456 VALUE_LAZY (result) = 1;
458 memcpy (VALUE_CONTENTS_RAW (result), VALUE_CONTENTS (val),
464 static const bfd_byte *
465 cond_offset_host (const bfd_byte *valaddr, long offset)
470 return valaddr + offset;
474 cond_offset_target (CORE_ADDR address, long offset)
479 return address + offset;
482 /* Issue a warning (as for the definition of warning in utils.c, but
483 with exactly one argument rather than ...), unless the limit on the
484 number of warnings has passed during the evaluation of the current
487 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
488 provided by "complaint". */
489 static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
492 lim_warning (const char *format, ...)
495 va_start (args, format);
497 warnings_issued += 1;
498 if (warnings_issued <= warning_limit)
499 vwarning (format, args);
504 /* Issue an error if the size of an object of type T is unreasonable,
505 i.e. if it would be a bad idea to allocate a value of this type in
509 check_size (const struct type *type)
511 if (TYPE_LENGTH (type) > varsize_limit)
512 error (_("object size is larger than varsize-limit"));
516 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
517 gdbtypes.h, but some of the necessary definitions in that file
518 seem to have gone missing. */
520 /* Maximum value of a SIZE-byte signed integer type. */
522 max_of_size (int size)
524 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
525 return top_bit | (top_bit - 1);
528 /* Minimum value of a SIZE-byte signed integer type. */
530 min_of_size (int size)
532 return -max_of_size (size) - 1;
535 /* Maximum value of a SIZE-byte unsigned integer type. */
537 umax_of_size (int size)
539 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
540 return top_bit | (top_bit - 1);
543 /* Maximum value of integral type T, as a signed quantity. */
545 max_of_type (struct type *t)
547 if (TYPE_UNSIGNED (t))
548 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
550 return max_of_size (TYPE_LENGTH (t));
553 /* Minimum value of integral type T, as a signed quantity. */
555 min_of_type (struct type *t)
557 if (TYPE_UNSIGNED (t))
560 return min_of_size (TYPE_LENGTH (t));
563 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
564 static struct value *
565 discrete_type_high_bound (struct type *type)
567 switch (TYPE_CODE (type))
569 case TYPE_CODE_RANGE:
570 return value_from_longest (TYPE_TARGET_TYPE (type),
571 TYPE_HIGH_BOUND (type));
574 value_from_longest (type,
575 TYPE_FIELD_BITPOS (type,
576 TYPE_NFIELDS (type) - 1));
578 return value_from_longest (type, max_of_type (type));
580 error (_("Unexpected type in discrete_type_high_bound."));
584 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
585 static struct value *
586 discrete_type_low_bound (struct type *type)
588 switch (TYPE_CODE (type))
590 case TYPE_CODE_RANGE:
591 return value_from_longest (TYPE_TARGET_TYPE (type),
592 TYPE_LOW_BOUND (type));
594 return value_from_longest (type, TYPE_FIELD_BITPOS (type, 0));
596 return value_from_longest (type, min_of_type (type));
598 error (_("Unexpected type in discrete_type_low_bound."));
602 /* The identity on non-range types. For range types, the underlying
603 non-range scalar type. */
606 base_type (struct type *type)
608 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
610 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
612 type = TYPE_TARGET_TYPE (type);
618 /* Language Selection */
620 /* If the main program is in Ada, return language_ada, otherwise return LANG
621 (the main program is in Ada iif the adainit symbol is found).
623 MAIN_PST is not used. */
626 ada_update_initial_language (enum language lang,
627 struct partial_symtab *main_pst)
629 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
630 (struct objfile *) NULL) != NULL)
636 /* If the main procedure is written in Ada, then return its name.
637 The result is good until the next call. Return NULL if the main
638 procedure doesn't appear to be in Ada. */
643 struct minimal_symbol *msym;
644 CORE_ADDR main_program_name_addr;
645 static char main_program_name[1024];
647 /* For Ada, the name of the main procedure is stored in a specific
648 string constant, generated by the binder. Look for that symbol,
649 extract its address, and then read that string. If we didn't find
650 that string, then most probably the main procedure is not written
652 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
656 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
657 if (main_program_name_addr == 0)
658 error (_("Invalid address for Ada main program name."));
660 extract_string (main_program_name_addr, main_program_name);
661 return main_program_name;
664 /* The main procedure doesn't seem to be in Ada. */
670 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
673 const struct ada_opname_map ada_opname_table[] = {
674 {"Oadd", "\"+\"", BINOP_ADD},
675 {"Osubtract", "\"-\"", BINOP_SUB},
676 {"Omultiply", "\"*\"", BINOP_MUL},
677 {"Odivide", "\"/\"", BINOP_DIV},
678 {"Omod", "\"mod\"", BINOP_MOD},
679 {"Orem", "\"rem\"", BINOP_REM},
680 {"Oexpon", "\"**\"", BINOP_EXP},
681 {"Olt", "\"<\"", BINOP_LESS},
682 {"Ole", "\"<=\"", BINOP_LEQ},
683 {"Ogt", "\">\"", BINOP_GTR},
684 {"Oge", "\">=\"", BINOP_GEQ},
685 {"Oeq", "\"=\"", BINOP_EQUAL},
686 {"One", "\"/=\"", BINOP_NOTEQUAL},
687 {"Oand", "\"and\"", BINOP_BITWISE_AND},
688 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
689 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
690 {"Oconcat", "\"&\"", BINOP_CONCAT},
691 {"Oabs", "\"abs\"", UNOP_ABS},
692 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
693 {"Oadd", "\"+\"", UNOP_PLUS},
694 {"Osubtract", "\"-\"", UNOP_NEG},
698 /* Return non-zero if STR should be suppressed in info listings. */
701 is_suppressed_name (const char *str)
703 if (strncmp (str, "_ada_", 5) == 0)
705 if (str[0] == '_' || str[0] == '\000')
710 const char *suffix = strstr (str, "___");
711 if (suffix != NULL && suffix[3] != 'X')
714 suffix = str + strlen (str);
715 for (p = suffix - 1; p != str; p -= 1)
719 if (p[0] == 'X' && p[-1] != '_')
723 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
724 if (strncmp (ada_opname_table[i].encoded, p,
725 strlen (ada_opname_table[i].encoded)) == 0)
734 /* The "encoded" form of DECODED, according to GNAT conventions.
735 The result is valid until the next call to ada_encode. */
738 ada_encode (const char *decoded)
740 static char *encoding_buffer = NULL;
741 static size_t encoding_buffer_size = 0;
748 GROW_VECT (encoding_buffer, encoding_buffer_size,
749 2 * strlen (decoded) + 10);
752 for (p = decoded; *p != '\0'; p += 1)
754 if (!ADA_RETAIN_DOTS && *p == '.')
756 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
761 const struct ada_opname_map *mapping;
763 for (mapping = ada_opname_table;
764 mapping->encoded != NULL
765 && strncmp (mapping->decoded, p,
766 strlen (mapping->decoded)) != 0; mapping += 1)
768 if (mapping->encoded == NULL)
769 error (_("invalid Ada operator name: %s"), p);
770 strcpy (encoding_buffer + k, mapping->encoded);
771 k += strlen (mapping->encoded);
776 encoding_buffer[k] = *p;
781 encoding_buffer[k] = '\0';
782 return encoding_buffer;
785 /* Return NAME folded to lower case, or, if surrounded by single
786 quotes, unfolded, but with the quotes stripped away. Result good
790 ada_fold_name (const char *name)
792 static char *fold_buffer = NULL;
793 static size_t fold_buffer_size = 0;
795 int len = strlen (name);
796 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
800 strncpy (fold_buffer, name + 1, len - 2);
801 fold_buffer[len - 2] = '\000';
806 for (i = 0; i <= len; i += 1)
807 fold_buffer[i] = tolower (name[i]);
814 0. Discard trailing .{DIGIT}+ or trailing ___{DIGIT}+
815 These are suffixes introduced by GNAT5 to nested subprogram
816 names, and do not serve any purpose for the debugger.
817 1. Discard final __{DIGIT}+ or $({DIGIT}+(__{DIGIT}+)*)
818 2. Convert other instances of embedded "__" to `.'.
819 3. Discard leading _ada_.
820 4. Convert operator names to the appropriate quoted symbols.
821 5. Remove everything after first ___ if it is followed by
823 6. Replace TK__ with __, and a trailing B or TKB with nothing.
824 7. Put symbols that should be suppressed in <...> brackets.
825 8. Remove trailing X[bn]* suffix (indicating names in package bodies).
827 The resulting string is valid until the next call of ada_decode.
828 If the string is unchanged by demangling, the original string pointer
832 ada_decode (const char *encoded)
839 static char *decoding_buffer = NULL;
840 static size_t decoding_buffer_size = 0;
842 if (strncmp (encoded, "_ada_", 5) == 0)
845 if (encoded[0] == '_' || encoded[0] == '<')
848 /* Remove trailing .{DIGIT}+ or ___{DIGIT}+. */
849 len0 = strlen (encoded);
850 if (len0 > 1 && isdigit (encoded[len0 - 1]))
853 while (i > 0 && isdigit (encoded[i]))
855 if (i >= 0 && encoded[i] == '.')
857 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
861 /* Remove the ___X.* suffix if present. Do not forget to verify that
862 the suffix is located before the current "end" of ENCODED. We want
863 to avoid re-matching parts of ENCODED that have previously been
864 marked as discarded (by decrementing LEN0). */
865 p = strstr (encoded, "___");
866 if (p != NULL && p - encoded < len0 - 3)
874 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
877 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
880 /* Make decoded big enough for possible expansion by operator name. */
881 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
882 decoded = decoding_buffer;
884 if (len0 > 1 && isdigit (encoded[len0 - 1]))
887 while ((i >= 0 && isdigit (encoded[i]))
888 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
890 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
892 else if (encoded[i] == '$')
896 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
897 decoded[j] = encoded[i];
902 if (at_start_name && encoded[i] == 'O')
905 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
907 int op_len = strlen (ada_opname_table[k].encoded);
908 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
910 && !isalnum (encoded[i + op_len]))
912 strcpy (decoded + j, ada_opname_table[k].decoded);
915 j += strlen (ada_opname_table[k].decoded);
919 if (ada_opname_table[k].encoded != NULL)
924 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
926 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
930 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
934 else if (!ADA_RETAIN_DOTS
935 && i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
944 decoded[j] = encoded[i];
951 for (i = 0; decoded[i] != '\0'; i += 1)
952 if (isupper (decoded[i]) || decoded[i] == ' ')
955 if (strcmp (decoded, encoded) == 0)
961 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
962 decoded = decoding_buffer;
963 if (encoded[0] == '<')
964 strcpy (decoded, encoded);
966 sprintf (decoded, "<%s>", encoded);
971 /* Table for keeping permanent unique copies of decoded names. Once
972 allocated, names in this table are never released. While this is a
973 storage leak, it should not be significant unless there are massive
974 changes in the set of decoded names in successive versions of a
975 symbol table loaded during a single session. */
976 static struct htab *decoded_names_store;
978 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
979 in the language-specific part of GSYMBOL, if it has not been
980 previously computed. Tries to save the decoded name in the same
981 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
982 in any case, the decoded symbol has a lifetime at least that of
984 The GSYMBOL parameter is "mutable" in the C++ sense: logically
985 const, but nevertheless modified to a semantically equivalent form
986 when a decoded name is cached in it.
990 ada_decode_symbol (const struct general_symbol_info *gsymbol)
993 (char **) &gsymbol->language_specific.cplus_specific.demangled_name;
994 if (*resultp == NULL)
996 const char *decoded = ada_decode (gsymbol->name);
997 if (gsymbol->bfd_section != NULL)
999 bfd *obfd = gsymbol->bfd_section->owner;
1002 struct objfile *objf;
1005 if (obfd == objf->obfd)
1007 *resultp = obsavestring (decoded, strlen (decoded),
1008 &objf->objfile_obstack);
1014 /* Sometimes, we can't find a corresponding objfile, in which
1015 case, we put the result on the heap. Since we only decode
1016 when needed, we hope this usually does not cause a
1017 significant memory leak (FIXME). */
1018 if (*resultp == NULL)
1020 char **slot = (char **) htab_find_slot (decoded_names_store,
1023 *slot = xstrdup (decoded);
1032 ada_la_decode (const char *encoded, int options)
1034 return xstrdup (ada_decode (encoded));
1037 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1038 suffixes that encode debugging information or leading _ada_ on
1039 SYM_NAME (see is_name_suffix commentary for the debugging
1040 information that is ignored). If WILD, then NAME need only match a
1041 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1042 either argument is NULL. */
1045 ada_match_name (const char *sym_name, const char *name, int wild)
1047 if (sym_name == NULL || name == NULL)
1050 return wild_match (name, strlen (name), sym_name);
1053 int len_name = strlen (name);
1054 return (strncmp (sym_name, name, len_name) == 0
1055 && is_name_suffix (sym_name + len_name))
1056 || (strncmp (sym_name, "_ada_", 5) == 0
1057 && strncmp (sym_name + 5, name, len_name) == 0
1058 && is_name_suffix (sym_name + len_name + 5));
1062 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1063 suppressed in info listings. */
1066 ada_suppress_symbol_printing (struct symbol *sym)
1068 if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)
1071 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym));
1077 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1079 static char *bound_name[] = {
1080 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1081 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1084 /* Maximum number of array dimensions we are prepared to handle. */
1086 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1088 /* Like modify_field, but allows bitpos > wordlength. */
1091 modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
1093 modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
1097 /* The desc_* routines return primitive portions of array descriptors
1100 /* The descriptor or array type, if any, indicated by TYPE; removes
1101 level of indirection, if needed. */
1103 static struct type *
1104 desc_base_type (struct type *type)
1108 type = ada_check_typedef (type);
1110 && (TYPE_CODE (type) == TYPE_CODE_PTR
1111 || TYPE_CODE (type) == TYPE_CODE_REF))
1112 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1117 /* True iff TYPE indicates a "thin" array pointer type. */
1120 is_thin_pntr (struct type *type)
1123 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1124 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1127 /* The descriptor type for thin pointer type TYPE. */
1129 static struct type *
1130 thin_descriptor_type (struct type *type)
1132 struct type *base_type = desc_base_type (type);
1133 if (base_type == NULL)
1135 if (is_suffix (ada_type_name (base_type), "___XVE"))
1139 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1140 if (alt_type == NULL)
1147 /* A pointer to the array data for thin-pointer value VAL. */
1149 static struct value *
1150 thin_data_pntr (struct value *val)
1152 struct type *type = value_type (val);
1153 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1154 return value_cast (desc_data_type (thin_descriptor_type (type)),
1157 return value_from_longest (desc_data_type (thin_descriptor_type (type)),
1158 VALUE_ADDRESS (val) + value_offset (val));
1161 /* True iff TYPE indicates a "thick" array pointer type. */
1164 is_thick_pntr (struct type *type)
1166 type = desc_base_type (type);
1167 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1168 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1171 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1172 pointer to one, the type of its bounds data; otherwise, NULL. */
1174 static struct type *
1175 desc_bounds_type (struct type *type)
1179 type = desc_base_type (type);
1183 else if (is_thin_pntr (type))
1185 type = thin_descriptor_type (type);
1188 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1190 return ada_check_typedef (r);
1192 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1194 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1196 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1201 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1202 one, a pointer to its bounds data. Otherwise NULL. */
1204 static struct value *
1205 desc_bounds (struct value *arr)
1207 struct type *type = ada_check_typedef (value_type (arr));
1208 if (is_thin_pntr (type))
1210 struct type *bounds_type =
1211 desc_bounds_type (thin_descriptor_type (type));
1214 if (desc_bounds_type == NULL)
1215 error (_("Bad GNAT array descriptor"));
1217 /* NOTE: The following calculation is not really kosher, but
1218 since desc_type is an XVE-encoded type (and shouldn't be),
1219 the correct calculation is a real pain. FIXME (and fix GCC). */
1220 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1221 addr = value_as_long (arr);
1223 addr = VALUE_ADDRESS (arr) + value_offset (arr);
1226 value_from_longest (lookup_pointer_type (bounds_type),
1227 addr - TYPE_LENGTH (bounds_type));
1230 else if (is_thick_pntr (type))
1231 return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1232 _("Bad GNAT array descriptor"));
1237 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1238 position of the field containing the address of the bounds data. */
1241 fat_pntr_bounds_bitpos (struct type *type)
1243 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1246 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1247 size of the field containing the address of the bounds data. */
1250 fat_pntr_bounds_bitsize (struct type *type)
1252 type = desc_base_type (type);
1254 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1255 return TYPE_FIELD_BITSIZE (type, 1);
1257 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1260 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1261 pointer to one, the type of its array data (a
1262 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1263 ada_type_of_array to get an array type with bounds data. */
1265 static struct type *
1266 desc_data_type (struct type *type)
1268 type = desc_base_type (type);
1270 /* NOTE: The following is bogus; see comment in desc_bounds. */
1271 if (is_thin_pntr (type))
1272 return lookup_pointer_type
1273 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)));
1274 else if (is_thick_pntr (type))
1275 return lookup_struct_elt_type (type, "P_ARRAY", 1);
1280 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1283 static struct value *
1284 desc_data (struct value *arr)
1286 struct type *type = value_type (arr);
1287 if (is_thin_pntr (type))
1288 return thin_data_pntr (arr);
1289 else if (is_thick_pntr (type))
1290 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1291 _("Bad GNAT array descriptor"));
1297 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1298 position of the field containing the address of the data. */
1301 fat_pntr_data_bitpos (struct type *type)
1303 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1306 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1307 size of the field containing the address of the data. */
1310 fat_pntr_data_bitsize (struct type *type)
1312 type = desc_base_type (type);
1314 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1315 return TYPE_FIELD_BITSIZE (type, 0);
1317 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1320 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1321 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1322 bound, if WHICH is 1. The first bound is I=1. */
1324 static struct value *
1325 desc_one_bound (struct value *bounds, int i, int which)
1327 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1328 _("Bad GNAT array descriptor bounds"));
1331 /* If BOUNDS is an array-bounds structure type, return the bit position
1332 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1333 bound, if WHICH is 1. The first bound is I=1. */
1336 desc_bound_bitpos (struct type *type, int i, int which)
1338 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1341 /* If BOUNDS is an array-bounds structure type, return the bit field size
1342 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1343 bound, if WHICH is 1. The first bound is I=1. */
1346 desc_bound_bitsize (struct type *type, int i, int which)
1348 type = desc_base_type (type);
1350 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1351 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1353 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1356 /* If TYPE is the type of an array-bounds structure, the type of its
1357 Ith bound (numbering from 1). Otherwise, NULL. */
1359 static struct type *
1360 desc_index_type (struct type *type, int i)
1362 type = desc_base_type (type);
1364 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1365 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1370 /* The number of index positions in the array-bounds type TYPE.
1371 Return 0 if TYPE is NULL. */
1374 desc_arity (struct type *type)
1376 type = desc_base_type (type);
1379 return TYPE_NFIELDS (type) / 2;
1383 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1384 an array descriptor type (representing an unconstrained array
1388 ada_is_direct_array_type (struct type *type)
1392 type = ada_check_typedef (type);
1393 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1394 || ada_is_array_descriptor_type (type));
1397 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1400 ada_is_simple_array_type (struct type *type)
1404 type = ada_check_typedef (type);
1405 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1406 || (TYPE_CODE (type) == TYPE_CODE_PTR
1407 && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
1410 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1413 ada_is_array_descriptor_type (struct type *type)
1415 struct type *data_type = desc_data_type (type);
1419 type = ada_check_typedef (type);
1422 && ((TYPE_CODE (data_type) == TYPE_CODE_PTR
1423 && TYPE_TARGET_TYPE (data_type) != NULL
1424 && TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY)
1425 || TYPE_CODE (data_type) == TYPE_CODE_ARRAY)
1426 && desc_arity (desc_bounds_type (type)) > 0;
1429 /* Non-zero iff type is a partially mal-formed GNAT array
1430 descriptor. FIXME: This is to compensate for some problems with
1431 debugging output from GNAT. Re-examine periodically to see if it
1435 ada_is_bogus_array_descriptor (struct type *type)
1439 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1440 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1441 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1442 && !ada_is_array_descriptor_type (type);
1446 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1447 (fat pointer) returns the type of the array data described---specifically,
1448 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1449 in from the descriptor; otherwise, they are left unspecified. If
1450 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1451 returns NULL. The result is simply the type of ARR if ARR is not
1454 ada_type_of_array (struct value *arr, int bounds)
1456 if (ada_is_packed_array_type (value_type (arr)))
1457 return decode_packed_array_type (value_type (arr));
1459 if (!ada_is_array_descriptor_type (value_type (arr)))
1460 return value_type (arr);
1464 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr))));
1467 struct type *elt_type;
1469 struct value *descriptor;
1470 struct objfile *objf = TYPE_OBJFILE (value_type (arr));
1472 elt_type = ada_array_element_type (value_type (arr), -1);
1473 arity = ada_array_arity (value_type (arr));
1475 if (elt_type == NULL || arity == 0)
1476 return ada_check_typedef (value_type (arr));
1478 descriptor = desc_bounds (arr);
1479 if (value_as_long (descriptor) == 0)
1483 struct type *range_type = alloc_type (objf);
1484 struct type *array_type = alloc_type (objf);
1485 struct value *low = desc_one_bound (descriptor, arity, 0);
1486 struct value *high = desc_one_bound (descriptor, arity, 1);
1489 create_range_type (range_type, value_type (low),
1490 (int) value_as_long (low),
1491 (int) value_as_long (high));
1492 elt_type = create_array_type (array_type, elt_type, range_type);
1495 return lookup_pointer_type (elt_type);
1499 /* If ARR does not represent an array, returns ARR unchanged.
1500 Otherwise, returns either a standard GDB array with bounds set
1501 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1502 GDB array. Returns NULL if ARR is a null fat pointer. */
1505 ada_coerce_to_simple_array_ptr (struct value *arr)
1507 if (ada_is_array_descriptor_type (value_type (arr)))
1509 struct type *arrType = ada_type_of_array (arr, 1);
1510 if (arrType == NULL)
1512 return value_cast (arrType, value_copy (desc_data (arr)));
1514 else if (ada_is_packed_array_type (value_type (arr)))
1515 return decode_packed_array (arr);
1520 /* If ARR does not represent an array, returns ARR unchanged.
1521 Otherwise, returns a standard GDB array describing ARR (which may
1522 be ARR itself if it already is in the proper form). */
1524 static struct value *
1525 ada_coerce_to_simple_array (struct value *arr)
1527 if (ada_is_array_descriptor_type (value_type (arr)))
1529 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
1531 error (_("Bounds unavailable for null array pointer."));
1532 return value_ind (arrVal);
1534 else if (ada_is_packed_array_type (value_type (arr)))
1535 return decode_packed_array (arr);
1540 /* If TYPE represents a GNAT array type, return it translated to an
1541 ordinary GDB array type (possibly with BITSIZE fields indicating
1542 packing). For other types, is the identity. */
1545 ada_coerce_to_simple_array_type (struct type *type)
1547 struct value *mark = value_mark ();
1548 struct value *dummy = value_from_longest (builtin_type_long, 0);
1549 struct type *result;
1551 result = ada_type_of_array (dummy, 0);
1552 value_free_to_mark (mark);
1556 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1559 ada_is_packed_array_type (struct type *type)
1563 type = desc_base_type (type);
1564 type = ada_check_typedef (type);
1566 ada_type_name (type) != NULL
1567 && strstr (ada_type_name (type), "___XP") != NULL;
1570 /* Given that TYPE is a standard GDB array type with all bounds filled
1571 in, and that the element size of its ultimate scalar constituents
1572 (that is, either its elements, or, if it is an array of arrays, its
1573 elements' elements, etc.) is *ELT_BITS, return an identical type,
1574 but with the bit sizes of its elements (and those of any
1575 constituent arrays) recorded in the BITSIZE components of its
1576 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1579 static struct type *
1580 packed_array_type (struct type *type, long *elt_bits)
1582 struct type *new_elt_type;
1583 struct type *new_type;
1584 LONGEST low_bound, high_bound;
1586 type = ada_check_typedef (type);
1587 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
1590 new_type = alloc_type (TYPE_OBJFILE (type));
1591 new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
1593 create_array_type (new_type, new_elt_type, TYPE_FIELD_TYPE (type, 0));
1594 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
1595 TYPE_NAME (new_type) = ada_type_name (type);
1597 if (get_discrete_bounds (TYPE_FIELD_TYPE (type, 0),
1598 &low_bound, &high_bound) < 0)
1599 low_bound = high_bound = 0;
1600 if (high_bound < low_bound)
1601 *elt_bits = TYPE_LENGTH (new_type) = 0;
1604 *elt_bits *= (high_bound - low_bound + 1);
1605 TYPE_LENGTH (new_type) =
1606 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
1609 TYPE_FLAGS (new_type) |= TYPE_FLAG_FIXED_INSTANCE;
1613 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1615 static struct type *
1616 decode_packed_array_type (struct type *type)
1619 struct block **blocks;
1620 const char *raw_name = ada_type_name (ada_check_typedef (type));
1621 char *name = (char *) alloca (strlen (raw_name) + 1);
1622 char *tail = strstr (raw_name, "___XP");
1623 struct type *shadow_type;
1627 type = desc_base_type (type);
1629 memcpy (name, raw_name, tail - raw_name);
1630 name[tail - raw_name] = '\000';
1632 sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
1633 if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
1635 lim_warning (_("could not find bounds information on packed array"));
1638 shadow_type = SYMBOL_TYPE (sym);
1640 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
1642 lim_warning (_("could not understand bounds information on packed array"));
1646 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1649 (_("could not understand bit size information on packed array"));
1653 return packed_array_type (shadow_type, &bits);
1656 /* Given that ARR is a struct value *indicating a GNAT packed array,
1657 returns a simple array that denotes that array. Its type is a
1658 standard GDB array type except that the BITSIZEs of the array
1659 target types are set to the number of bits in each element, and the
1660 type length is set appropriately. */
1662 static struct value *
1663 decode_packed_array (struct value *arr)
1667 arr = ada_coerce_ref (arr);
1668 if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
1669 arr = ada_value_ind (arr);
1671 type = decode_packed_array_type (value_type (arr));
1674 error (_("can't unpack array"));
1678 if (BITS_BIG_ENDIAN && ada_is_modular_type (value_type (arr)))
1680 /* This is a (right-justified) modular type representing a packed
1681 array with no wrapper. In order to interpret the value through
1682 the (left-justified) packed array type we just built, we must
1683 first left-justify it. */
1684 int bit_size, bit_pos;
1687 mod = ada_modulus (value_type (arr)) - 1;
1694 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
1695 arr = ada_value_primitive_packed_val (arr, NULL,
1696 bit_pos / HOST_CHAR_BIT,
1697 bit_pos % HOST_CHAR_BIT,
1702 return coerce_unspec_val_to_type (arr, type);
1706 /* The value of the element of packed array ARR at the ARITY indices
1707 given in IND. ARR must be a simple array. */
1709 static struct value *
1710 value_subscript_packed (struct value *arr, int arity, struct value **ind)
1713 int bits, elt_off, bit_off;
1714 long elt_total_bit_offset;
1715 struct type *elt_type;
1719 elt_total_bit_offset = 0;
1720 elt_type = ada_check_typedef (value_type (arr));
1721 for (i = 0; i < arity; i += 1)
1723 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
1724 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
1726 (_("attempt to do packed indexing of something other than a packed array"));
1729 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
1730 LONGEST lowerbound, upperbound;
1733 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
1735 lim_warning (_("don't know bounds of array"));
1736 lowerbound = upperbound = 0;
1739 idx = value_as_long (value_pos_atr (ind[i]));
1740 if (idx < lowerbound || idx > upperbound)
1741 lim_warning (_("packed array index %ld out of bounds"), (long) idx);
1742 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
1743 elt_total_bit_offset += (idx - lowerbound) * bits;
1744 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
1747 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
1748 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
1750 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
1752 if (VALUE_LVAL (arr) == lval_internalvar)
1753 VALUE_LVAL (v) = lval_internalvar_component;
1755 VALUE_LVAL (v) = VALUE_LVAL (arr);
1759 /* Non-zero iff TYPE includes negative integer values. */
1762 has_negatives (struct type *type)
1764 switch (TYPE_CODE (type))
1769 return !TYPE_UNSIGNED (type);
1770 case TYPE_CODE_RANGE:
1771 return TYPE_LOW_BOUND (type) < 0;
1776 /* Create a new value of type TYPE from the contents of OBJ starting
1777 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1778 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1779 assigning through the result will set the field fetched from.
1780 VALADDR is ignored unless OBJ is NULL, in which case,
1781 VALADDR+OFFSET must address the start of storage containing the
1782 packed value. The value returned in this case is never an lval.
1783 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1786 ada_value_primitive_packed_val (struct value *obj, const bfd_byte *valaddr,
1787 long offset, int bit_offset, int bit_size,
1791 int src, /* Index into the source area */
1792 targ, /* Index into the target area */
1793 srcBitsLeft, /* Number of source bits left to move */
1794 nsrc, ntarg, /* Number of source and target bytes */
1795 unusedLS, /* Number of bits in next significant
1796 byte of source that are unused */
1797 accumSize; /* Number of meaningful bits in accum */
1798 unsigned char *bytes; /* First byte containing data to unpack */
1799 unsigned char *unpacked;
1800 unsigned long accum; /* Staging area for bits being transferred */
1802 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
1803 /* Transmit bytes from least to most significant; delta is the direction
1804 the indices move. */
1805 int delta = BITS_BIG_ENDIAN ? -1 : 1;
1807 type = ada_check_typedef (type);
1811 v = allocate_value (type);
1812 bytes = (unsigned char *) (valaddr + offset);
1814 else if (VALUE_LAZY (obj))
1817 VALUE_ADDRESS (obj) + value_offset (obj) + offset);
1818 bytes = (unsigned char *) alloca (len);
1819 read_memory (VALUE_ADDRESS (v), bytes, len);
1823 v = allocate_value (type);
1824 bytes = (unsigned char *) VALUE_CONTENTS (obj) + offset;
1829 VALUE_LVAL (v) = VALUE_LVAL (obj);
1830 if (VALUE_LVAL (obj) == lval_internalvar)
1831 VALUE_LVAL (v) = lval_internalvar_component;
1832 VALUE_ADDRESS (v) = VALUE_ADDRESS (obj) + value_offset (obj) + offset;
1833 v->bitpos = bit_offset + value_bitpos (obj);
1834 v->bitsize = bit_size;
1835 if (value_bitpos (v) >= HOST_CHAR_BIT)
1837 VALUE_ADDRESS (v) += 1;
1838 v->bitpos -= HOST_CHAR_BIT;
1842 v->bitsize = bit_size;
1843 unpacked = (unsigned char *) VALUE_CONTENTS (v);
1845 srcBitsLeft = bit_size;
1847 ntarg = TYPE_LENGTH (type);
1851 memset (unpacked, 0, TYPE_LENGTH (type));
1854 else if (BITS_BIG_ENDIAN)
1857 if (has_negatives (type)
1858 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
1862 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
1865 switch (TYPE_CODE (type))
1867 case TYPE_CODE_ARRAY:
1868 case TYPE_CODE_UNION:
1869 case TYPE_CODE_STRUCT:
1870 /* Non-scalar values must be aligned at a byte boundary... */
1872 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
1873 /* ... And are placed at the beginning (most-significant) bytes
1879 targ = TYPE_LENGTH (type) - 1;
1885 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
1888 unusedLS = bit_offset;
1891 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
1898 /* Mask for removing bits of the next source byte that are not
1899 part of the value. */
1900 unsigned int unusedMSMask =
1901 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
1903 /* Sign-extend bits for this byte. */
1904 unsigned int signMask = sign & ~unusedMSMask;
1906 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
1907 accumSize += HOST_CHAR_BIT - unusedLS;
1908 if (accumSize >= HOST_CHAR_BIT)
1910 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
1911 accumSize -= HOST_CHAR_BIT;
1912 accum >>= HOST_CHAR_BIT;
1916 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
1923 accum |= sign << accumSize;
1924 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
1925 accumSize -= HOST_CHAR_BIT;
1926 accum >>= HOST_CHAR_BIT;
1934 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
1935 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
1938 move_bits (char *target, int targ_offset, char *source, int src_offset, int n)
1940 unsigned int accum, mask;
1941 int accum_bits, chunk_size;
1943 target += targ_offset / HOST_CHAR_BIT;
1944 targ_offset %= HOST_CHAR_BIT;
1945 source += src_offset / HOST_CHAR_BIT;
1946 src_offset %= HOST_CHAR_BIT;
1947 if (BITS_BIG_ENDIAN)
1949 accum = (unsigned char) *source;
1951 accum_bits = HOST_CHAR_BIT - src_offset;
1956 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
1957 accum_bits += HOST_CHAR_BIT;
1959 chunk_size = HOST_CHAR_BIT - targ_offset;
1962 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
1963 mask = ((1 << chunk_size) - 1) << unused_right;
1966 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
1968 accum_bits -= chunk_size;
1975 accum = (unsigned char) *source >> src_offset;
1977 accum_bits = HOST_CHAR_BIT - src_offset;
1981 accum = accum + ((unsigned char) *source << accum_bits);
1982 accum_bits += HOST_CHAR_BIT;
1984 chunk_size = HOST_CHAR_BIT - targ_offset;
1987 mask = ((1 << chunk_size) - 1) << targ_offset;
1988 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
1990 accum_bits -= chunk_size;
1991 accum >>= chunk_size;
1999 /* Store the contents of FROMVAL into the location of TOVAL.
2000 Return a new value with the location of TOVAL and contents of
2001 FROMVAL. Handles assignment into packed fields that have
2002 floating-point or non-scalar types. */
2004 static struct value *
2005 ada_value_assign (struct value *toval, struct value *fromval)
2007 struct type *type = value_type (toval);
2008 int bits = value_bitsize (toval);
2010 if (!toval->modifiable)
2011 error (_("Left operand of assignment is not a modifiable lvalue."));
2013 toval = coerce_ref (toval);
2015 if (VALUE_LVAL (toval) == lval_memory
2017 && (TYPE_CODE (type) == TYPE_CODE_FLT
2018 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2020 int len = (value_bitpos (toval)
2021 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2022 char *buffer = (char *) alloca (len);
2025 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2026 fromval = value_cast (type, fromval);
2028 read_memory (VALUE_ADDRESS (toval) + value_offset (toval), buffer, len);
2029 if (BITS_BIG_ENDIAN)
2030 move_bits (buffer, value_bitpos (toval),
2031 VALUE_CONTENTS (fromval),
2032 TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT -
2035 move_bits (buffer, value_bitpos (toval), VALUE_CONTENTS (fromval),
2037 write_memory (VALUE_ADDRESS (toval) + value_offset (toval), buffer,
2040 val = value_copy (toval);
2041 memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
2042 TYPE_LENGTH (type));
2048 return value_assign (toval, fromval);
2052 /* The value of the element of array ARR at the ARITY indices given in IND.
2053 ARR may be either a simple array, GNAT array descriptor, or pointer
2057 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2061 struct type *elt_type;
2063 elt = ada_coerce_to_simple_array (arr);
2065 elt_type = ada_check_typedef (value_type (elt));
2066 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2067 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2068 return value_subscript_packed (elt, arity, ind);
2070 for (k = 0; k < arity; k += 1)
2072 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2073 error (_("too many subscripts (%d expected)"), k);
2074 elt = value_subscript (elt, value_pos_atr (ind[k]));
2079 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2080 value of the element of *ARR at the ARITY indices given in
2081 IND. Does not read the entire array into memory. */
2084 ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
2089 for (k = 0; k < arity; k += 1)
2094 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2095 error (_("too many subscripts (%d expected)"), k);
2096 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2098 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2099 idx = value_pos_atr (ind[k]);
2101 idx = value_sub (idx, value_from_longest (builtin_type_int, lwb));
2102 arr = value_add (arr, idx);
2103 type = TYPE_TARGET_TYPE (type);
2106 return value_ind (arr);
2109 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2110 actual type of ARRAY_PTR is ignored), returns a reference to
2111 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2112 bound of this array is LOW, as per Ada rules. */
2113 static struct value *
2114 ada_value_slice_ptr (struct value *array_ptr, struct type *type,
2117 CORE_ADDR base = value_as_address (array_ptr)
2118 + ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
2119 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
2120 struct type *index_type =
2121 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
2123 struct type *slice_type =
2124 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2125 return value_from_pointer (lookup_reference_type (slice_type), base);
2129 static struct value *
2130 ada_value_slice (struct value *array, int low, int high)
2132 struct type *type = value_type (array);
2133 struct type *index_type =
2134 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2135 struct type *slice_type =
2136 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2137 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2140 /* If type is a record type in the form of a standard GNAT array
2141 descriptor, returns the number of dimensions for type. If arr is a
2142 simple array, returns the number of "array of"s that prefix its
2143 type designation. Otherwise, returns 0. */
2146 ada_array_arity (struct type *type)
2153 type = desc_base_type (type);
2156 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2157 return desc_arity (desc_bounds_type (type));
2159 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2162 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2168 /* If TYPE is a record type in the form of a standard GNAT array
2169 descriptor or a simple array type, returns the element type for
2170 TYPE after indexing by NINDICES indices, or by all indices if
2171 NINDICES is -1. Otherwise, returns NULL. */
2174 ada_array_element_type (struct type *type, int nindices)
2176 type = desc_base_type (type);
2178 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2181 struct type *p_array_type;
2183 p_array_type = desc_data_type (type);
2185 k = ada_array_arity (type);
2189 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2190 if (nindices >= 0 && k > nindices)
2192 p_array_type = TYPE_TARGET_TYPE (p_array_type);
2193 while (k > 0 && p_array_type != NULL)
2195 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2198 return p_array_type;
2200 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2202 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2204 type = TYPE_TARGET_TYPE (type);
2213 /* The type of nth index in arrays of given type (n numbering from 1).
2214 Does not examine memory. */
2217 ada_index_type (struct type *type, int n)
2219 struct type *result_type;
2221 type = desc_base_type (type);
2223 if (n > ada_array_arity (type))
2226 if (ada_is_simple_array_type (type))
2230 for (i = 1; i < n; i += 1)
2231 type = TYPE_TARGET_TYPE (type);
2232 result_type = TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 0));
2233 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2234 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2235 perhaps stabsread.c would make more sense. */
2236 if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2237 result_type = builtin_type_int;
2242 return desc_index_type (desc_bounds_type (type), n);
2245 /* Given that arr is an array type, returns the lower bound of the
2246 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2247 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2248 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2249 bounds type. It works for other arrays with bounds supplied by
2250 run-time quantities other than discriminants. */
2253 ada_array_bound_from_type (struct type * arr_type, int n, int which,
2254 struct type ** typep)
2257 struct type *index_type_desc;
2259 if (ada_is_packed_array_type (arr_type))
2260 arr_type = decode_packed_array_type (arr_type);
2262 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2265 *typep = builtin_type_int;
2266 return (LONGEST) - which;
2269 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2270 type = TYPE_TARGET_TYPE (arr_type);
2274 index_type_desc = ada_find_parallel_type (type, "___XA");
2275 if (index_type_desc == NULL)
2277 struct type *range_type;
2278 struct type *index_type;
2282 type = TYPE_TARGET_TYPE (type);
2286 range_type = TYPE_INDEX_TYPE (type);
2287 index_type = TYPE_TARGET_TYPE (range_type);
2288 if (TYPE_CODE (index_type) == TYPE_CODE_UNDEF)
2289 index_type = builtin_type_long;
2291 *typep = index_type;
2293 (LONGEST) (which == 0
2294 ? TYPE_LOW_BOUND (range_type)
2295 : TYPE_HIGH_BOUND (range_type));
2299 struct type *index_type =
2300 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
2301 NULL, TYPE_OBJFILE (arr_type));
2303 *typep = TYPE_TARGET_TYPE (index_type);
2305 (LONGEST) (which == 0
2306 ? TYPE_LOW_BOUND (index_type)
2307 : TYPE_HIGH_BOUND (index_type));
2311 /* Given that arr is an array value, returns the lower bound of the
2312 nth index (numbering from 1) if which is 0, and the upper bound if
2313 which is 1. This routine will also work for arrays with bounds
2314 supplied by run-time quantities other than discriminants. */
2317 ada_array_bound (struct value *arr, int n, int which)
2319 struct type *arr_type = value_type (arr);
2321 if (ada_is_packed_array_type (arr_type))
2322 return ada_array_bound (decode_packed_array (arr), n, which);
2323 else if (ada_is_simple_array_type (arr_type))
2326 LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
2327 return value_from_longest (type, v);
2330 return desc_one_bound (desc_bounds (arr), n, which);
2333 /* Given that arr is an array value, returns the length of the
2334 nth index. This routine will also work for arrays with bounds
2335 supplied by run-time quantities other than discriminants.
2336 Does not work for arrays indexed by enumeration types with representation
2337 clauses at the moment. */
2340 ada_array_length (struct value *arr, int n)
2342 struct type *arr_type = ada_check_typedef (value_type (arr));
2344 if (ada_is_packed_array_type (arr_type))
2345 return ada_array_length (decode_packed_array (arr), n);
2347 if (ada_is_simple_array_type (arr_type))
2351 ada_array_bound_from_type (arr_type, n, 1, &type) -
2352 ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
2353 return value_from_longest (type, v);
2357 value_from_longest (builtin_type_int,
2358 value_as_long (desc_one_bound (desc_bounds (arr),
2360 - value_as_long (desc_one_bound (desc_bounds (arr),
2364 /* An empty array whose type is that of ARR_TYPE (an array type),
2365 with bounds LOW to LOW-1. */
2367 static struct value *
2368 empty_array (struct type *arr_type, int low)
2370 struct type *index_type =
2371 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
2373 struct type *elt_type = ada_array_element_type (arr_type, 1);
2374 return allocate_value (create_array_type (NULL, elt_type, index_type));
2378 /* Name resolution */
2380 /* The "decoded" name for the user-definable Ada operator corresponding
2384 ada_decoded_op_name (enum exp_opcode op)
2388 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
2390 if (ada_opname_table[i].op == op)
2391 return ada_opname_table[i].decoded;
2393 error (_("Could not find operator name for opcode"));
2397 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2398 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2399 undefined namespace) and converts operators that are
2400 user-defined into appropriate function calls. If CONTEXT_TYPE is
2401 non-null, it provides a preferred result type [at the moment, only
2402 type void has any effect---causing procedures to be preferred over
2403 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2404 return type is preferred. May change (expand) *EXP. */
2407 resolve (struct expression **expp, int void_context_p)
2411 resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
2414 /* Resolve the operator of the subexpression beginning at
2415 position *POS of *EXPP. "Resolving" consists of replacing
2416 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2417 with their resolutions, replacing built-in operators with
2418 function calls to user-defined operators, where appropriate, and,
2419 when DEPROCEDURE_P is non-zero, converting function-valued variables
2420 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2421 are as in ada_resolve, above. */
2423 static struct value *
2424 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
2425 struct type *context_type)
2429 struct expression *exp; /* Convenience: == *expp. */
2430 enum exp_opcode op = (*expp)->elts[pc].opcode;
2431 struct value **argvec; /* Vector of operand types (alloca'ed). */
2432 int nargs; /* Number of operands. */
2438 /* Pass one: resolve operands, saving their types and updating *pos. */
2442 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2443 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2448 resolve_subexp (expp, pos, 0, NULL);
2450 nargs = longest_to_int (exp->elts[pc + 1].longconst);
2455 resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type);
2460 resolve_subexp (expp, pos, 0, NULL);
2463 case OP_ATR_MODULUS:
2493 arg1 = resolve_subexp (expp, pos, 0, NULL);
2495 resolve_subexp (expp, pos, 1, NULL);
2497 resolve_subexp (expp, pos, 1, value_type (arg1));
2515 case BINOP_LOGICAL_AND:
2516 case BINOP_LOGICAL_OR:
2517 case BINOP_BITWISE_AND:
2518 case BINOP_BITWISE_IOR:
2519 case BINOP_BITWISE_XOR:
2522 case BINOP_NOTEQUAL:
2529 case BINOP_SUBSCRIPT:
2537 case UNOP_LOGICAL_NOT:
2554 case OP_INTERNALVAR:
2563 case STRUCTOP_STRUCT:
2564 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2570 + BYTES_TO_EXP_ELEM (longest_to_int (exp->elts[pc + 1].longconst)
2575 case TERNOP_IN_RANGE:
2580 case BINOP_IN_BOUNDS:
2586 error (_("Unexpected operator during name resolution"));
2589 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
2590 for (i = 0; i < nargs; i += 1)
2591 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
2595 /* Pass two: perform any resolution on principal operator. */
2602 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
2604 struct ada_symbol_info *candidates;
2608 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2609 (exp->elts[pc + 2].symbol),
2610 exp->elts[pc + 1].block, VAR_DOMAIN,
2613 if (n_candidates > 1)
2615 /* Types tend to get re-introduced locally, so if there
2616 are any local symbols that are not types, first filter
2619 for (j = 0; j < n_candidates; j += 1)
2620 switch (SYMBOL_CLASS (candidates[j].sym))
2626 case LOC_REGPARM_ADDR:
2630 case LOC_BASEREG_ARG:
2632 case LOC_COMPUTED_ARG:
2638 if (j < n_candidates)
2641 while (j < n_candidates)
2643 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
2645 candidates[j] = candidates[n_candidates - 1];
2654 if (n_candidates == 0)
2655 error (_("No definition found for %s"),
2656 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2657 else if (n_candidates == 1)
2659 else if (deprocedure_p
2660 && !is_nonfunction (candidates, n_candidates))
2662 i = ada_resolve_function
2663 (candidates, n_candidates, NULL, 0,
2664 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
2667 error (_("Could not find a match for %s"),
2668 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2672 printf_filtered (_("Multiple matches for %s\n"),
2673 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2674 user_select_syms (candidates, n_candidates, 1);
2678 exp->elts[pc + 1].block = candidates[i].block;
2679 exp->elts[pc + 2].symbol = candidates[i].sym;
2680 if (innermost_block == NULL
2681 || contained_in (candidates[i].block, innermost_block))
2682 innermost_block = candidates[i].block;
2686 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
2689 replace_operator_with_call (expp, pc, 0, 0,
2690 exp->elts[pc + 2].symbol,
2691 exp->elts[pc + 1].block);
2698 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
2699 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2701 struct ada_symbol_info *candidates;
2705 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2706 (exp->elts[pc + 5].symbol),
2707 exp->elts[pc + 4].block, VAR_DOMAIN,
2709 if (n_candidates == 1)
2713 i = ada_resolve_function
2714 (candidates, n_candidates,
2716 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
2719 error (_("Could not find a match for %s"),
2720 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
2723 exp->elts[pc + 4].block = candidates[i].block;
2724 exp->elts[pc + 5].symbol = candidates[i].sym;
2725 if (innermost_block == NULL
2726 || contained_in (candidates[i].block, innermost_block))
2727 innermost_block = candidates[i].block;
2738 case BINOP_BITWISE_AND:
2739 case BINOP_BITWISE_IOR:
2740 case BINOP_BITWISE_XOR:
2742 case BINOP_NOTEQUAL:
2750 case UNOP_LOGICAL_NOT:
2752 if (possible_user_operator_p (op, argvec))
2754 struct ada_symbol_info *candidates;
2758 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
2759 (struct block *) NULL, VAR_DOMAIN,
2761 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
2762 ada_decoded_op_name (op), NULL);
2766 replace_operator_with_call (expp, pc, nargs, 1,
2767 candidates[i].sym, candidates[i].block);
2777 return evaluate_subexp_type (exp, pos);
2780 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2781 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2782 a non-pointer. A type of 'void' (which is never a valid expression type)
2783 by convention matches anything. */
2784 /* The term "match" here is rather loose. The match is heuristic and
2785 liberal. FIXME: TOO liberal, in fact. */
2788 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
2790 ftype = ada_check_typedef (ftype);
2791 atype = ada_check_typedef (atype);
2793 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
2794 ftype = TYPE_TARGET_TYPE (ftype);
2795 if (TYPE_CODE (atype) == TYPE_CODE_REF)
2796 atype = TYPE_TARGET_TYPE (atype);
2798 if (TYPE_CODE (ftype) == TYPE_CODE_VOID
2799 || TYPE_CODE (atype) == TYPE_CODE_VOID)
2802 switch (TYPE_CODE (ftype))
2807 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
2808 return ada_type_match (TYPE_TARGET_TYPE (ftype),
2809 TYPE_TARGET_TYPE (atype), 0);
2812 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
2814 case TYPE_CODE_ENUM:
2815 case TYPE_CODE_RANGE:
2816 switch (TYPE_CODE (atype))
2819 case TYPE_CODE_ENUM:
2820 case TYPE_CODE_RANGE:
2826 case TYPE_CODE_ARRAY:
2827 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
2828 || ada_is_array_descriptor_type (atype));
2830 case TYPE_CODE_STRUCT:
2831 if (ada_is_array_descriptor_type (ftype))
2832 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
2833 || ada_is_array_descriptor_type (atype));
2835 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
2836 && !ada_is_array_descriptor_type (atype));
2838 case TYPE_CODE_UNION:
2840 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
2844 /* Return non-zero if the formals of FUNC "sufficiently match" the
2845 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
2846 may also be an enumeral, in which case it is treated as a 0-
2847 argument function. */
2850 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
2853 struct type *func_type = SYMBOL_TYPE (func);
2855 if (SYMBOL_CLASS (func) == LOC_CONST
2856 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
2857 return (n_actuals == 0);
2858 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
2861 if (TYPE_NFIELDS (func_type) != n_actuals)
2864 for (i = 0; i < n_actuals; i += 1)
2866 if (actuals[i] == NULL)
2870 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
2871 struct type *atype = ada_check_typedef (value_type (actuals[i]));
2873 if (!ada_type_match (ftype, atype, 1))
2880 /* False iff function type FUNC_TYPE definitely does not produce a value
2881 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
2882 FUNC_TYPE is not a valid function type with a non-null return type
2883 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
2886 return_match (struct type *func_type, struct type *context_type)
2888 struct type *return_type;
2890 if (func_type == NULL)
2893 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
2894 return_type = base_type (TYPE_TARGET_TYPE (func_type));
2896 return_type = base_type (func_type);
2897 if (return_type == NULL)
2900 context_type = base_type (context_type);
2902 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
2903 return context_type == NULL || return_type == context_type;
2904 else if (context_type == NULL)
2905 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
2907 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
2911 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
2912 function (if any) that matches the types of the NARGS arguments in
2913 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
2914 that returns that type, then eliminate matches that don't. If
2915 CONTEXT_TYPE is void and there is at least one match that does not
2916 return void, eliminate all matches that do.
2918 Asks the user if there is more than one match remaining. Returns -1
2919 if there is no such symbol or none is selected. NAME is used
2920 solely for messages. May re-arrange and modify SYMS in
2921 the process; the index returned is for the modified vector. */
2924 ada_resolve_function (struct ada_symbol_info syms[],
2925 int nsyms, struct value **args, int nargs,
2926 const char *name, struct type *context_type)
2929 int m; /* Number of hits */
2930 struct type *fallback;
2931 struct type *return_type;
2933 return_type = context_type;
2934 if (context_type == NULL)
2935 fallback = builtin_type_void;
2942 for (k = 0; k < nsyms; k += 1)
2944 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
2946 if (ada_args_match (syms[k].sym, args, nargs)
2947 && return_match (type, return_type))
2953 if (m > 0 || return_type == fallback)
2956 return_type = fallback;
2963 printf_filtered (_("Multiple matches for %s\n"), name);
2964 user_select_syms (syms, m, 1);
2970 /* Returns true (non-zero) iff decoded name N0 should appear before N1
2971 in a listing of choices during disambiguation (see sort_choices, below).
2972 The idea is that overloadings of a subprogram name from the
2973 same package should sort in their source order. We settle for ordering
2974 such symbols by their trailing number (__N or $N). */
2977 encoded_ordered_before (char *N0, char *N1)
2981 else if (N0 == NULL)
2986 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
2988 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
2990 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
2991 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
2995 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
2998 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3000 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3001 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3003 return (strcmp (N0, N1) < 0);
3007 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3011 sort_choices (struct ada_symbol_info syms[], int nsyms)
3014 for (i = 1; i < nsyms; i += 1)
3016 struct ada_symbol_info sym = syms[i];
3019 for (j = i - 1; j >= 0; j -= 1)
3021 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3022 SYMBOL_LINKAGE_NAME (sym.sym)))
3024 syms[j + 1] = syms[j];
3030 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3031 by asking the user (if necessary), returning the number selected,
3032 and setting the first elements of SYMS items. Error if no symbols
3035 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3036 to be re-integrated one of these days. */
3039 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3042 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3044 int first_choice = (max_results == 1) ? 1 : 2;
3046 if (max_results < 1)
3047 error (_("Request to select 0 symbols!"));
3051 printf_unfiltered (_("[0] cancel\n"));
3052 if (max_results > 1)
3053 printf_unfiltered (_("[1] all\n"));
3055 sort_choices (syms, nsyms);
3057 for (i = 0; i < nsyms; i += 1)
3059 if (syms[i].sym == NULL)
3062 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3064 struct symtab_and_line sal =
3065 find_function_start_sal (syms[i].sym, 1);
3066 if (sal.symtab == NULL)
3067 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3069 SYMBOL_PRINT_NAME (syms[i].sym),
3072 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3073 SYMBOL_PRINT_NAME (syms[i].sym),
3074 sal.symtab->filename, sal.line);
3080 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3081 && SYMBOL_TYPE (syms[i].sym) != NULL
3082 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3083 struct symtab *symtab = symtab_for_sym (syms[i].sym);
3085 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3086 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3088 SYMBOL_PRINT_NAME (syms[i].sym),
3089 symtab->filename, SYMBOL_LINE (syms[i].sym));
3090 else if (is_enumeral
3091 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3093 printf_unfiltered ("[%d] ", i + first_choice);
3094 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3096 printf_unfiltered (_("'(%s) (enumeral)\n"),
3097 SYMBOL_PRINT_NAME (syms[i].sym));
3099 else if (symtab != NULL)
3100 printf_unfiltered (is_enumeral
3101 ? _("[%d] %s in %s (enumeral)\n")
3102 : _("[%d] %s at %s:?\n"),
3104 SYMBOL_PRINT_NAME (syms[i].sym),
3107 printf_unfiltered (is_enumeral
3108 ? _("[%d] %s (enumeral)\n")
3109 : _("[%d] %s at ?\n"),
3111 SYMBOL_PRINT_NAME (syms[i].sym));
3115 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3118 for (i = 0; i < n_chosen; i += 1)
3119 syms[i] = syms[chosen[i]];
3124 /* Read and validate a set of numeric choices from the user in the
3125 range 0 .. N_CHOICES-1. Place the results in increasing
3126 order in CHOICES[0 .. N-1], and return N.
3128 The user types choices as a sequence of numbers on one line
3129 separated by blanks, encoding them as follows:
3131 + A choice of 0 means to cancel the selection, throwing an error.
3132 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3133 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3135 The user is not allowed to choose more than MAX_RESULTS values.
3137 ANNOTATION_SUFFIX, if present, is used to annotate the input
3138 prompts (for use with the -f switch). */
3141 get_selections (int *choices, int n_choices, int max_results,
3142 int is_all_choice, char *annotation_suffix)
3147 int first_choice = is_all_choice ? 2 : 1;
3149 prompt = getenv ("PS2");
3153 printf_unfiltered ("%s ", prompt);
3154 gdb_flush (gdb_stdout);
3156 args = command_line_input ((char *) NULL, 0, annotation_suffix);
3159 error_no_arg (_("one or more choice numbers"));
3163 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3164 order, as given in args. Choices are validated. */
3170 while (isspace (*args))
3172 if (*args == '\0' && n_chosen == 0)
3173 error_no_arg (_("one or more choice numbers"));
3174 else if (*args == '\0')
3177 choice = strtol (args, &args2, 10);
3178 if (args == args2 || choice < 0
3179 || choice > n_choices + first_choice - 1)
3180 error (_("Argument must be choice number"));
3184 error (_("cancelled"));
3186 if (choice < first_choice)
3188 n_chosen = n_choices;
3189 for (j = 0; j < n_choices; j += 1)
3193 choice -= first_choice;
3195 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3199 if (j < 0 || choice != choices[j])
3202 for (k = n_chosen - 1; k > j; k -= 1)
3203 choices[k + 1] = choices[k];
3204 choices[j + 1] = choice;
3209 if (n_chosen > max_results)
3210 error (_("Select no more than %d of the above"), max_results);
3215 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3216 on the function identified by SYM and BLOCK, and taking NARGS
3217 arguments. Update *EXPP as needed to hold more space. */
3220 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3221 int oplen, struct symbol *sym,
3222 struct block *block)
3224 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3225 symbol, -oplen for operator being replaced). */
3226 struct expression *newexp = (struct expression *)
3227 xmalloc (sizeof (struct expression)
3228 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3229 struct expression *exp = *expp;
3231 newexp->nelts = exp->nelts + 7 - oplen;
3232 newexp->language_defn = exp->language_defn;
3233 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3234 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3235 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3237 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3238 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3240 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3241 newexp->elts[pc + 4].block = block;
3242 newexp->elts[pc + 5].symbol = sym;
3248 /* Type-class predicates */
3250 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3254 numeric_type_p (struct type *type)
3260 switch (TYPE_CODE (type))
3265 case TYPE_CODE_RANGE:
3266 return (type == TYPE_TARGET_TYPE (type)
3267 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3274 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3277 integer_type_p (struct type *type)
3283 switch (TYPE_CODE (type))
3287 case TYPE_CODE_RANGE:
3288 return (type == TYPE_TARGET_TYPE (type)
3289 || integer_type_p (TYPE_TARGET_TYPE (type)));
3296 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3299 scalar_type_p (struct type *type)
3305 switch (TYPE_CODE (type))
3308 case TYPE_CODE_RANGE:
3309 case TYPE_CODE_ENUM:
3318 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3321 discrete_type_p (struct type *type)
3327 switch (TYPE_CODE (type))
3330 case TYPE_CODE_RANGE:
3331 case TYPE_CODE_ENUM:
3339 /* Returns non-zero if OP with operands in the vector ARGS could be
3340 a user-defined function. Errs on the side of pre-defined operators
3341 (i.e., result 0). */
3344 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3346 struct type *type0 =
3347 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3348 struct type *type1 =
3349 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3363 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3367 case BINOP_BITWISE_AND:
3368 case BINOP_BITWISE_IOR:
3369 case BINOP_BITWISE_XOR:
3370 return (!(integer_type_p (type0) && integer_type_p (type1)));
3373 case BINOP_NOTEQUAL:
3378 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
3382 ((TYPE_CODE (type0) != TYPE_CODE_ARRAY
3383 && (TYPE_CODE (type0) != TYPE_CODE_PTR
3384 || TYPE_CODE (TYPE_TARGET_TYPE (type0)) != TYPE_CODE_ARRAY))
3385 || (TYPE_CODE (type1) != TYPE_CODE_ARRAY
3386 && (TYPE_CODE (type1) != TYPE_CODE_PTR
3387 || (TYPE_CODE (TYPE_TARGET_TYPE (type1))
3388 != TYPE_CODE_ARRAY))));
3391 return (!(numeric_type_p (type0) && integer_type_p (type1)));
3395 case UNOP_LOGICAL_NOT:
3397 return (!numeric_type_p (type0));
3404 /* NOTE: In the following, we assume that a renaming type's name may
3405 have an ___XD suffix. It would be nice if this went away at some
3408 /* If TYPE encodes a renaming, returns the renaming suffix, which
3409 is XR for an object renaming, XRP for a procedure renaming, XRE for
3410 an exception renaming, and XRS for a subprogram renaming. Returns
3411 NULL if NAME encodes none of these. */
3414 ada_renaming_type (struct type *type)
3416 if (type != NULL && TYPE_CODE (type) == TYPE_CODE_ENUM)
3418 const char *name = type_name_no_tag (type);
3419 const char *suffix = (name == NULL) ? NULL : strstr (name, "___XR");
3421 || (suffix[5] != '\000' && strchr ("PES_", suffix[5]) == NULL))
3430 /* Return non-zero iff SYM encodes an object renaming. */
3433 ada_is_object_renaming (struct symbol *sym)
3435 const char *renaming_type = ada_renaming_type (SYMBOL_TYPE (sym));
3436 return renaming_type != NULL
3437 && (renaming_type[2] == '\0' || renaming_type[2] == '_');
3440 /* Assuming that SYM encodes a non-object renaming, returns the original
3441 name of the renamed entity. The name is good until the end of
3445 ada_simple_renamed_entity (struct symbol *sym)
3448 const char *raw_name;
3452 type = SYMBOL_TYPE (sym);
3453 if (type == NULL || TYPE_NFIELDS (type) < 1)
3454 error (_("Improperly encoded renaming."));
3456 raw_name = TYPE_FIELD_NAME (type, 0);
3457 len = (raw_name == NULL ? 0 : strlen (raw_name)) - 5;
3459 error (_("Improperly encoded renaming."));
3461 result = xmalloc (len + 1);
3462 strncpy (result, raw_name, len);
3463 result[len] = '\000';
3468 /* Evaluation: Function Calls */
3470 /* Return an lvalue containing the value VAL. This is the identity on
3471 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3472 on the stack, using and updating *SP as the stack pointer, and
3473 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3475 static struct value *
3476 ensure_lval (struct value *val, CORE_ADDR *sp)
3478 if (! VALUE_LVAL (val))
3480 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
3482 /* The following is taken from the structure-return code in
3483 call_function_by_hand. FIXME: Therefore, some refactoring seems
3485 if (INNER_THAN (1, 2))
3487 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3488 reserving sufficient space. */
3490 if (gdbarch_frame_align_p (current_gdbarch))
3491 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3492 VALUE_ADDRESS (val) = *sp;
3496 /* Stack grows upward. Align the frame, allocate space, and
3497 then again, re-align the frame. */
3498 if (gdbarch_frame_align_p (current_gdbarch))
3499 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3500 VALUE_ADDRESS (val) = *sp;
3502 if (gdbarch_frame_align_p (current_gdbarch))
3503 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3506 write_memory (VALUE_ADDRESS (val), VALUE_CONTENTS_RAW (val), len);
3512 /* Return the value ACTUAL, converted to be an appropriate value for a
3513 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3514 allocating any necessary descriptors (fat pointers), or copies of
3515 values not residing in memory, updating it as needed. */
3517 static struct value *
3518 convert_actual (struct value *actual, struct type *formal_type0,
3521 struct type *actual_type = ada_check_typedef (value_type (actual));
3522 struct type *formal_type = ada_check_typedef (formal_type0);
3523 struct type *formal_target =
3524 TYPE_CODE (formal_type) == TYPE_CODE_PTR
3525 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
3526 struct type *actual_target =
3527 TYPE_CODE (actual_type) == TYPE_CODE_PTR
3528 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
3530 if (ada_is_array_descriptor_type (formal_target)
3531 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
3532 return make_array_descriptor (formal_type, actual, sp);
3533 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR)
3535 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
3536 && ada_is_array_descriptor_type (actual_target))
3537 return desc_data (actual);
3538 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
3540 if (VALUE_LVAL (actual) != lval_memory)
3543 actual_type = ada_check_typedef (value_type (actual));
3544 val = allocate_value (actual_type);
3545 memcpy ((char *) VALUE_CONTENTS_RAW (val),
3546 (char *) VALUE_CONTENTS (actual),
3547 TYPE_LENGTH (actual_type));
3548 actual = ensure_lval (val, sp);
3550 return value_addr (actual);
3553 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
3554 return ada_value_ind (actual);
3560 /* Push a descriptor of type TYPE for array value ARR on the stack at
3561 *SP, updating *SP to reflect the new descriptor. Return either
3562 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3563 to-descriptor type rather than a descriptor type), a struct value *
3564 representing a pointer to this descriptor. */
3566 static struct value *
3567 make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
3569 struct type *bounds_type = desc_bounds_type (type);
3570 struct type *desc_type = desc_base_type (type);
3571 struct value *descriptor = allocate_value (desc_type);
3572 struct value *bounds = allocate_value (bounds_type);
3575 for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
3577 modify_general_field (VALUE_CONTENTS (bounds),
3578 value_as_long (ada_array_bound (arr, i, 0)),
3579 desc_bound_bitpos (bounds_type, i, 0),
3580 desc_bound_bitsize (bounds_type, i, 0));
3581 modify_general_field (VALUE_CONTENTS (bounds),
3582 value_as_long (ada_array_bound (arr, i, 1)),
3583 desc_bound_bitpos (bounds_type, i, 1),
3584 desc_bound_bitsize (bounds_type, i, 1));
3587 bounds = ensure_lval (bounds, sp);
3589 modify_general_field (VALUE_CONTENTS (descriptor),
3590 VALUE_ADDRESS (ensure_lval (arr, sp)),
3591 fat_pntr_data_bitpos (desc_type),
3592 fat_pntr_data_bitsize (desc_type));
3594 modify_general_field (VALUE_CONTENTS (descriptor),
3595 VALUE_ADDRESS (bounds),
3596 fat_pntr_bounds_bitpos (desc_type),
3597 fat_pntr_bounds_bitsize (desc_type));
3599 descriptor = ensure_lval (descriptor, sp);
3601 if (TYPE_CODE (type) == TYPE_CODE_PTR)
3602 return value_addr (descriptor);
3608 /* Assuming a dummy frame has been established on the target, perform any
3609 conversions needed for calling function FUNC on the NARGS actual
3610 parameters in ARGS, other than standard C conversions. Does
3611 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3612 does not match the number of arguments expected. Use *SP as a
3613 stack pointer for additional data that must be pushed, updating its
3617 ada_convert_actuals (struct value *func, int nargs, struct value *args[],
3622 if (TYPE_NFIELDS (value_type (func)) == 0
3623 || nargs != TYPE_NFIELDS (value_type (func)))
3626 for (i = 0; i < nargs; i += 1)
3628 convert_actual (args[i], TYPE_FIELD_TYPE (value_type (func), i), sp);
3631 /* Dummy definitions for an experimental caching module that is not
3632 * used in the public sources. */
3635 lookup_cached_symbol (const char *name, domain_enum namespace,
3636 struct symbol **sym, struct block **block,
3637 struct symtab **symtab)
3643 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
3644 struct block *block, struct symtab *symtab)
3650 /* Return the result of a standard (literal, C-like) lookup of NAME in
3651 given DOMAIN, visible from lexical block BLOCK. */
3653 static struct symbol *
3654 standard_lookup (const char *name, const struct block *block,
3658 struct symtab *symtab;
3660 if (lookup_cached_symbol (name, domain, &sym, NULL, NULL))
3663 lookup_symbol_in_language (name, block, domain, language_c, 0, &symtab);
3664 cache_symbol (name, domain, sym, block_found, symtab);
3669 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3670 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3671 since they contend in overloading in the same way. */
3673 is_nonfunction (struct ada_symbol_info syms[], int n)
3677 for (i = 0; i < n; i += 1)
3678 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
3679 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
3680 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
3686 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3687 struct types. Otherwise, they may not. */
3690 equiv_types (struct type *type0, struct type *type1)
3694 if (type0 == NULL || type1 == NULL
3695 || TYPE_CODE (type0) != TYPE_CODE (type1))
3697 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
3698 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
3699 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
3700 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
3706 /* True iff SYM0 represents the same entity as SYM1, or one that is
3707 no more defined than that of SYM1. */
3710 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
3714 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
3715 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
3718 switch (SYMBOL_CLASS (sym0))
3724 struct type *type0 = SYMBOL_TYPE (sym0);
3725 struct type *type1 = SYMBOL_TYPE (sym1);
3726 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
3727 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
3728 int len0 = strlen (name0);
3730 TYPE_CODE (type0) == TYPE_CODE (type1)
3731 && (equiv_types (type0, type1)
3732 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
3733 && strncmp (name1 + len0, "___XV", 5) == 0));
3736 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
3737 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
3743 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3744 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3747 add_defn_to_vec (struct obstack *obstackp,
3749 struct block *block, struct symtab *symtab)
3753 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
3755 if (SYMBOL_TYPE (sym) != NULL)
3756 SYMBOL_TYPE (sym) = ada_check_typedef (SYMBOL_TYPE (sym));
3757 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
3759 if (lesseq_defined_than (sym, prevDefns[i].sym))
3761 else if (lesseq_defined_than (prevDefns[i].sym, sym))
3763 prevDefns[i].sym = sym;
3764 prevDefns[i].block = block;
3765 prevDefns[i].symtab = symtab;
3771 struct ada_symbol_info info;
3775 info.symtab = symtab;
3776 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
3780 /* Number of ada_symbol_info structures currently collected in
3781 current vector in *OBSTACKP. */
3784 num_defns_collected (struct obstack *obstackp)
3786 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
3789 /* Vector of ada_symbol_info structures currently collected in current
3790 vector in *OBSTACKP. If FINISH, close off the vector and return
3791 its final address. */
3793 static struct ada_symbol_info *
3794 defns_collected (struct obstack *obstackp, int finish)
3797 return obstack_finish (obstackp);
3799 return (struct ada_symbol_info *) obstack_base (obstackp);
3802 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
3803 Check the global symbols if GLOBAL, the static symbols if not.
3804 Do wild-card match if WILD. */
3806 static struct partial_symbol *
3807 ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
3808 int global, domain_enum namespace, int wild)
3810 struct partial_symbol **start;
3811 int name_len = strlen (name);
3812 int length = (global ? pst->n_global_syms : pst->n_static_syms);
3821 pst->objfile->global_psymbols.list + pst->globals_offset :
3822 pst->objfile->static_psymbols.list + pst->statics_offset);
3826 for (i = 0; i < length; i += 1)
3828 struct partial_symbol *psym = start[i];
3830 if (SYMBOL_DOMAIN (psym) == namespace
3831 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
3845 int M = (U + i) >> 1;
3846 struct partial_symbol *psym = start[M];
3847 if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
3849 else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
3851 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
3862 struct partial_symbol *psym = start[i];
3864 if (SYMBOL_DOMAIN (psym) == namespace)
3866 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
3874 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
3888 int M = (U + i) >> 1;
3889 struct partial_symbol *psym = start[M];
3890 if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
3892 else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
3894 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
3905 struct partial_symbol *psym = start[i];
3907 if (SYMBOL_DOMAIN (psym) == namespace)
3911 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
3914 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
3916 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
3926 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
3936 /* Find a symbol table containing symbol SYM or NULL if none. */
3938 static struct symtab *
3939 symtab_for_sym (struct symbol *sym)
3942 struct objfile *objfile;
3944 struct symbol *tmp_sym;
3945 struct dict_iterator iter;
3948 ALL_SYMTABS (objfile, s)
3950 switch (SYMBOL_CLASS (sym))
3958 case LOC_CONST_BYTES:
3959 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
3960 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
3962 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
3963 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
3969 switch (SYMBOL_CLASS (sym))
3975 case LOC_REGPARM_ADDR:
3980 case LOC_BASEREG_ARG:
3982 case LOC_COMPUTED_ARG:
3983 for (j = FIRST_LOCAL_BLOCK;
3984 j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1)
3986 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j);
3987 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
3998 /* Return a minimal symbol matching NAME according to Ada decoding
3999 rules. Returns NULL if there is no such minimal symbol. Names
4000 prefixed with "standard__" are handled specially: "standard__" is
4001 first stripped off, and only static and global symbols are searched. */
4003 struct minimal_symbol *
4004 ada_lookup_simple_minsym (const char *name)
4006 struct objfile *objfile;
4007 struct minimal_symbol *msymbol;
4010 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4012 name += sizeof ("standard__") - 1;
4016 wild_match = (strstr (name, "__") == NULL);
4018 ALL_MSYMBOLS (objfile, msymbol)
4020 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4021 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4028 /* For all subprograms that statically enclose the subprogram of the
4029 selected frame, add symbols matching identifier NAME in DOMAIN
4030 and their blocks to the list of data in OBSTACKP, as for
4031 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4035 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4036 const char *name, domain_enum namespace,
4041 /* FIXME: The next two routines belong in symtab.c */
4044 restore_language (void *lang)
4046 set_language ((enum language) lang);
4049 /* As for lookup_symbol, but performed as if the current language
4053 lookup_symbol_in_language (const char *name, const struct block *block,
4054 domain_enum domain, enum language lang,
4055 int *is_a_field_of_this, struct symtab **symtab)
4057 struct cleanup *old_chain
4058 = make_cleanup (restore_language, (void *) current_language->la_language);
4059 struct symbol *result;
4060 set_language (lang);
4061 result = lookup_symbol (name, block, domain, is_a_field_of_this, symtab);
4062 do_cleanups (old_chain);
4066 /* True if TYPE is definitely an artificial type supplied to a symbol
4067 for which no debugging information was given in the symbol file. */
4070 is_nondebugging_type (struct type *type)
4072 char *name = ada_type_name (type);
4073 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4076 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4077 duplicate other symbols in the list (The only case I know of where
4078 this happens is when object files containing stabs-in-ecoff are
4079 linked with files containing ordinary ecoff debugging symbols (or no
4080 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4081 Returns the number of items in the modified list. */
4084 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4091 if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4092 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4093 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4095 for (j = 0; j < nsyms; j += 1)
4098 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4099 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4100 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4101 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4102 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4103 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4106 for (k = i + 1; k < nsyms; k += 1)
4107 syms[k - 1] = syms[k];
4120 /* Given a type that corresponds to a renaming entity, use the type name
4121 to extract the scope (package name or function name, fully qualified,
4122 and following the GNAT encoding convention) where this renaming has been
4123 defined. The string returned needs to be deallocated after use. */
4126 xget_renaming_scope (struct type *renaming_type)
4128 /* The renaming types adhere to the following convention:
4129 <scope>__<rename>___<XR extension>.
4130 So, to extract the scope, we search for the "___XR" extension,
4131 and then backtrack until we find the first "__". */
4133 const char *name = type_name_no_tag (renaming_type);
4134 char *suffix = strstr (name, "___XR");
4139 /* Now, backtrack a bit until we find the first "__". Start looking
4140 at suffix - 3, as the <rename> part is at least one character long. */
4142 for (last = suffix - 3; last > name; last--)
4143 if (last[0] == '_' && last[1] == '_')
4146 /* Make a copy of scope and return it. */
4148 scope_len = last - name;
4149 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4151 strncpy (scope, name, scope_len);
4152 scope[scope_len] = '\0';
4157 /* Return nonzero if NAME corresponds to a package name. */
4160 is_package_name (const char *name)
4162 /* Here, We take advantage of the fact that no symbols are generated
4163 for packages, while symbols are generated for each function.
4164 So the condition for NAME represent a package becomes equivalent
4165 to NAME not existing in our list of symbols. There is only one
4166 small complication with library-level functions (see below). */
4170 /* If it is a function that has not been defined at library level,
4171 then we should be able to look it up in the symbols. */
4172 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4175 /* Library-level function names start with "_ada_". See if function
4176 "_ada_" followed by NAME can be found. */
4178 /* Do a quick check that NAME does not contain "__", since library-level
4179 functions names can not contain "__" in them. */
4180 if (strstr (name, "__") != NULL)
4183 fun_name = xstrprintf ("_ada_%s", name);
4185 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4188 /* Return nonzero if SYM corresponds to a renaming entity that is
4189 visible from FUNCTION_NAME. */
4192 renaming_is_visible (const struct symbol *sym, char *function_name)
4194 char *scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4196 make_cleanup (xfree, scope);
4198 /* If the rename has been defined in a package, then it is visible. */
4199 if (is_package_name (scope))
4202 /* Check that the rename is in the current function scope by checking
4203 that its name starts with SCOPE. */
4205 /* If the function name starts with "_ada_", it means that it is
4206 a library-level function. Strip this prefix before doing the
4207 comparison, as the encoding for the renaming does not contain
4209 if (strncmp (function_name, "_ada_", 5) == 0)
4212 return (strncmp (function_name, scope, strlen (scope)) == 0);
4215 /* Iterates over the SYMS list and remove any entry that corresponds to
4216 a renaming entity that is not visible from the function associated
4220 GNAT emits a type following a specified encoding for each renaming
4221 entity. Unfortunately, STABS currently does not support the definition
4222 of types that are local to a given lexical block, so all renamings types
4223 are emitted at library level. As a consequence, if an application
4224 contains two renaming entities using the same name, and a user tries to
4225 print the value of one of these entities, the result of the ada symbol
4226 lookup will also contain the wrong renaming type.
4228 This function partially covers for this limitation by attempting to
4229 remove from the SYMS list renaming symbols that should be visible
4230 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4231 method with the current information available. The implementation
4232 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4234 - When the user tries to print a rename in a function while there
4235 is another rename entity defined in a package: Normally, the
4236 rename in the function has precedence over the rename in the
4237 package, so the latter should be removed from the list. This is
4238 currently not the case.
4240 - This function will incorrectly remove valid renames if
4241 the CURRENT_BLOCK corresponds to a function which symbol name
4242 has been changed by an "Export" pragma. As a consequence,
4243 the user will be unable to print such rename entities. */
4246 remove_out_of_scope_renamings (struct ada_symbol_info *syms,
4247 int nsyms, struct block *current_block)
4249 struct symbol *current_function;
4250 char *current_function_name;
4253 /* Extract the function name associated to CURRENT_BLOCK.
4254 Abort if unable to do so. */
4256 if (current_block == NULL)
4259 current_function = block_function (current_block);
4260 if (current_function == NULL)
4263 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4264 if (current_function_name == NULL)
4267 /* Check each of the symbols, and remove it from the list if it is
4268 a type corresponding to a renaming that is out of the scope of
4269 the current block. */
4274 if (ada_is_object_renaming (syms[i].sym)
4275 && !renaming_is_visible (syms[i].sym, current_function_name))
4278 for (j = i + 1; j < nsyms; j++)
4279 syms[j - 1] = syms[j];
4289 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4290 scope and in global scopes, returning the number of matches. Sets
4291 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4292 indicating the symbols found and the blocks and symbol tables (if
4293 any) in which they were found. This vector are transient---good only to
4294 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4295 symbol match within the nest of blocks whose innermost member is BLOCK0,
4296 is the one match returned (no other matches in that or
4297 enclosing blocks is returned). If there are any matches in or
4298 surrounding BLOCK0, then these alone are returned. Otherwise, the
4299 search extends to global and file-scope (static) symbol tables.
4300 Names prefixed with "standard__" are handled specially: "standard__"
4301 is first stripped off, and only static and global symbols are searched. */
4304 ada_lookup_symbol_list (const char *name0, const struct block *block0,
4305 domain_enum namespace,
4306 struct ada_symbol_info **results)
4310 struct partial_symtab *ps;
4311 struct blockvector *bv;
4312 struct objfile *objfile;
4313 struct block *block;
4315 struct minimal_symbol *msymbol;
4321 obstack_free (&symbol_list_obstack, NULL);
4322 obstack_init (&symbol_list_obstack);
4326 /* Search specified block and its superiors. */
4328 wild_match = (strstr (name0, "__") == NULL);
4330 block = (struct block *) block0; /* FIXME: No cast ought to be
4331 needed, but adding const will
4332 have a cascade effect. */
4333 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
4337 name = name0 + sizeof ("standard__") - 1;
4341 while (block != NULL)
4344 ada_add_block_symbols (&symbol_list_obstack, block, name,
4345 namespace, NULL, NULL, wild_match);
4347 /* If we found a non-function match, assume that's the one. */
4348 if (is_nonfunction (defns_collected (&symbol_list_obstack, 0),
4349 num_defns_collected (&symbol_list_obstack)))
4352 block = BLOCK_SUPERBLOCK (block);
4355 /* If no luck so far, try to find NAME as a local symbol in some lexically
4356 enclosing subprogram. */
4357 if (num_defns_collected (&symbol_list_obstack) == 0 && block_depth > 2)
4358 add_symbols_from_enclosing_procs (&symbol_list_obstack,
4359 name, namespace, wild_match);
4361 /* If we found ANY matches among non-global symbols, we're done. */
4363 if (num_defns_collected (&symbol_list_obstack) > 0)
4367 if (lookup_cached_symbol (name0, namespace, &sym, &block, &s))
4370 add_defn_to_vec (&symbol_list_obstack, sym, block, s);
4374 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4375 tables, and psymtab's. */
4377 ALL_SYMTABS (objfile, s)
4382 bv = BLOCKVECTOR (s);
4383 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4384 ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
4385 objfile, s, wild_match);
4388 if (namespace == VAR_DOMAIN)
4390 ALL_MSYMBOLS (objfile, msymbol)
4392 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match))
4394 switch (MSYMBOL_TYPE (msymbol))
4396 case mst_solib_trampoline:
4399 s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol));
4402 int ndefns0 = num_defns_collected (&symbol_list_obstack);
4404 bv = BLOCKVECTOR (s);
4405 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4406 ada_add_block_symbols (&symbol_list_obstack, block,
4407 SYMBOL_LINKAGE_NAME (msymbol),
4408 namespace, objfile, s, wild_match);
4410 if (num_defns_collected (&symbol_list_obstack) == ndefns0)
4412 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
4413 ada_add_block_symbols (&symbol_list_obstack, block,
4414 SYMBOL_LINKAGE_NAME (msymbol),
4415 namespace, objfile, s,
4424 ALL_PSYMTABS (objfile, ps)
4428 && ada_lookup_partial_symbol (ps, name, 1, namespace, wild_match))
4430 s = PSYMTAB_TO_SYMTAB (ps);
4433 bv = BLOCKVECTOR (s);
4434 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4435 ada_add_block_symbols (&symbol_list_obstack, block, name,
4436 namespace, objfile, s, wild_match);
4440 /* Now add symbols from all per-file blocks if we've gotten no hits
4441 (Not strictly correct, but perhaps better than an error).
4442 Do the symtabs first, then check the psymtabs. */
4444 if (num_defns_collected (&symbol_list_obstack) == 0)
4447 ALL_SYMTABS (objfile, s)
4452 bv = BLOCKVECTOR (s);
4453 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
4454 ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
4455 objfile, s, wild_match);
4458 ALL_PSYMTABS (objfile, ps)
4462 && ada_lookup_partial_symbol (ps, name, 0, namespace, wild_match))
4464 s = PSYMTAB_TO_SYMTAB (ps);
4465 bv = BLOCKVECTOR (s);
4468 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
4469 ada_add_block_symbols (&symbol_list_obstack, block, name,
4470 namespace, objfile, s, wild_match);
4476 ndefns = num_defns_collected (&symbol_list_obstack);
4477 *results = defns_collected (&symbol_list_obstack, 1);
4479 ndefns = remove_extra_symbols (*results, ndefns);
4482 cache_symbol (name0, namespace, NULL, NULL, NULL);
4484 if (ndefns == 1 && cacheIfUnique)
4485 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block,
4486 (*results)[0].symtab);
4488 ndefns = remove_out_of_scope_renamings (*results, ndefns,
4489 (struct block *) block0);
4494 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4495 scope and in global scopes, or NULL if none. NAME is folded and
4496 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4497 choosing the first symbol if there are multiple choices.
4498 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4499 table in which the symbol was found (in both cases, these
4500 assignments occur only if the pointers are non-null). */
4503 ada_lookup_symbol (const char *name, const struct block *block0,
4504 domain_enum namespace, int *is_a_field_of_this,
4505 struct symtab **symtab)
4507 struct ada_symbol_info *candidates;
4510 n_candidates = ada_lookup_symbol_list (ada_encode (ada_fold_name (name)),
4511 block0, namespace, &candidates);
4513 if (n_candidates == 0)
4516 if (is_a_field_of_this != NULL)
4517 *is_a_field_of_this = 0;
4521 *symtab = candidates[0].symtab;
4522 if (*symtab == NULL && candidates[0].block != NULL)
4524 struct objfile *objfile;
4527 struct blockvector *bv;
4529 /* Search the list of symtabs for one which contains the
4530 address of the start of this block. */
4531 ALL_SYMTABS (objfile, s)
4533 bv = BLOCKVECTOR (s);
4534 b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4535 if (BLOCK_START (b) <= BLOCK_START (candidates[0].block)
4536 && BLOCK_END (b) > BLOCK_START (candidates[0].block))
4539 return fixup_symbol_section (candidates[0].sym, objfile);
4541 return fixup_symbol_section (candidates[0].sym, NULL);
4545 return candidates[0].sym;
4548 static struct symbol *
4549 ada_lookup_symbol_nonlocal (const char *name,
4550 const char *linkage_name,
4551 const struct block *block,
4552 const domain_enum domain, struct symtab **symtab)
4554 if (linkage_name == NULL)
4555 linkage_name = name;
4556 return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
4561 /* True iff STR is a possible encoded suffix of a normal Ada name
4562 that is to be ignored for matching purposes. Suffixes of parallel
4563 names (e.g., XVE) are not included here. Currently, the possible suffixes
4564 are given by either of the regular expression:
4566 (__[0-9]+)?\.[0-9]+ [nested subprogram suffix, on platforms such
4568 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4569 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4573 is_name_suffix (const char *str)
4576 const char *matching;
4577 const int len = strlen (str);
4579 /* (__[0-9]+)?\.[0-9]+ */
4581 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
4584 while (isdigit (matching[0]))
4586 if (matching[0] == '\0')
4590 if (matching[0] == '.')
4593 while (isdigit (matching[0]))
4595 if (matching[0] == '\0')
4600 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
4603 while (isdigit (matching[0]))
4605 if (matching[0] == '\0')
4609 /* ??? We should not modify STR directly, as we are doing below. This
4610 is fine in this case, but may become problematic later if we find
4611 that this alternative did not work, and want to try matching
4612 another one from the begining of STR. Since we modified it, we
4613 won't be able to find the begining of the string anymore! */
4617 while (str[0] != '_' && str[0] != '\0')
4619 if (str[0] != 'n' && str[0] != 'b')
4624 if (str[0] == '\000')
4628 if (str[1] != '_' || str[2] == '\000')
4632 if (strcmp (str + 3, "JM") == 0)
4634 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4635 the LJM suffix in favor of the JM one. But we will
4636 still accept LJM as a valid suffix for a reasonable
4637 amount of time, just to allow ourselves to debug programs
4638 compiled using an older version of GNAT. */
4639 if (strcmp (str + 3, "LJM") == 0)
4643 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
4644 || str[4] == 'U' || str[4] == 'P')
4646 if (str[4] == 'R' && str[5] != 'T')
4650 if (!isdigit (str[2]))
4652 for (k = 3; str[k] != '\0'; k += 1)
4653 if (!isdigit (str[k]) && str[k] != '_')
4657 if (str[0] == '$' && isdigit (str[1]))
4659 for (k = 2; str[k] != '\0'; k += 1)
4660 if (!isdigit (str[k]) && str[k] != '_')
4667 /* Return nonzero if the given string starts with a dot ('.')
4668 followed by zero or more digits.
4670 Note: brobecker/2003-11-10: A forward declaration has not been
4671 added at the begining of this file yet, because this function
4672 is only used to work around a problem found during wild matching
4673 when trying to match minimal symbol names against symbol names
4674 obtained from dwarf-2 data. This function is therefore currently
4675 only used in wild_match() and is likely to be deleted when the
4676 problem in dwarf-2 is fixed. */
4679 is_dot_digits_suffix (const char *str)
4685 while (isdigit (str[0]))
4687 return (str[0] == '\0');
4690 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4691 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4692 informational suffixes of NAME (i.e., for which is_name_suffix is
4696 wild_match (const char *patn0, int patn_len, const char *name0)
4702 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
4703 stored in the symbol table for nested function names is sometimes
4704 different from the name of the associated entity stored in
4705 the dwarf-2 data: This is the case for nested subprograms, where
4706 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
4707 while the symbol name from the dwarf-2 data does not.
4709 Although the DWARF-2 standard documents that entity names stored
4710 in the dwarf-2 data should be identical to the name as seen in
4711 the source code, GNAT takes a different approach as we already use
4712 a special encoding mechanism to convey the information so that
4713 a C debugger can still use the information generated to debug
4714 Ada programs. A corollary is that the symbol names in the dwarf-2
4715 data should match the names found in the symbol table. I therefore
4716 consider this issue as a compiler defect.
4718 Until the compiler is properly fixed, we work-around the problem
4719 by ignoring such suffixes during the match. We do so by making
4720 a copy of PATN0 and NAME0, and then by stripping such a suffix
4721 if present. We then perform the match on the resulting strings. */
4724 name_len = strlen (name0);
4726 name = (char *) alloca ((name_len + 1) * sizeof (char));
4727 strcpy (name, name0);
4728 dot = strrchr (name, '.');
4729 if (dot != NULL && is_dot_digits_suffix (dot))
4732 patn = (char *) alloca ((patn_len + 1) * sizeof (char));
4733 strncpy (patn, patn0, patn_len);
4734 patn[patn_len] = '\0';
4735 dot = strrchr (patn, '.');
4736 if (dot != NULL && is_dot_digits_suffix (dot))
4739 patn_len = dot - patn;
4743 /* Now perform the wild match. */
4745 name_len = strlen (name);
4746 if (name_len >= patn_len + 5 && strncmp (name, "_ada_", 5) == 0
4747 && strncmp (patn, name + 5, patn_len) == 0
4748 && is_name_suffix (name + patn_len + 5))
4751 while (name_len >= patn_len)
4753 if (strncmp (patn, name, patn_len) == 0
4754 && is_name_suffix (name + patn_len))
4762 && name[0] != '.' && (name[0] != '_' || name[1] != '_'));
4767 if (!islower (name[2]))
4774 if (!islower (name[1]))
4785 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4786 vector *defn_symbols, updating the list of symbols in OBSTACKP
4787 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4788 OBJFILE is the section containing BLOCK.
4789 SYMTAB is recorded with each symbol added. */
4792 ada_add_block_symbols (struct obstack *obstackp,
4793 struct block *block, const char *name,
4794 domain_enum domain, struct objfile *objfile,
4795 struct symtab *symtab, int wild)
4797 struct dict_iterator iter;
4798 int name_len = strlen (name);
4799 /* A matching argument symbol, if any. */
4800 struct symbol *arg_sym;
4801 /* Set true when we find a matching non-argument symbol. */
4810 ALL_BLOCK_SYMBOLS (block, iter, sym)
4812 if (SYMBOL_DOMAIN (sym) == domain
4813 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
4815 switch (SYMBOL_CLASS (sym))
4821 case LOC_REGPARM_ADDR:
4822 case LOC_BASEREG_ARG:
4823 case LOC_COMPUTED_ARG:
4826 case LOC_UNRESOLVED:
4830 add_defn_to_vec (obstackp,
4831 fixup_symbol_section (sym, objfile),
4840 ALL_BLOCK_SYMBOLS (block, iter, sym)
4842 if (SYMBOL_DOMAIN (sym) == domain)
4844 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
4846 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
4848 switch (SYMBOL_CLASS (sym))
4854 case LOC_REGPARM_ADDR:
4855 case LOC_BASEREG_ARG:
4856 case LOC_COMPUTED_ARG:
4859 case LOC_UNRESOLVED:
4863 add_defn_to_vec (obstackp,
4864 fixup_symbol_section (sym, objfile),
4873 if (!found_sym && arg_sym != NULL)
4875 add_defn_to_vec (obstackp,
4876 fixup_symbol_section (arg_sym, objfile),
4885 ALL_BLOCK_SYMBOLS (block, iter, sym)
4887 if (SYMBOL_DOMAIN (sym) == domain)
4891 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
4894 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
4896 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
4901 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
4903 switch (SYMBOL_CLASS (sym))
4909 case LOC_REGPARM_ADDR:
4910 case LOC_BASEREG_ARG:
4911 case LOC_COMPUTED_ARG:
4914 case LOC_UNRESOLVED:
4918 add_defn_to_vec (obstackp,
4919 fixup_symbol_section (sym, objfile),
4927 /* NOTE: This really shouldn't be needed for _ada_ symbols.
4928 They aren't parameters, right? */
4929 if (!found_sym && arg_sym != NULL)
4931 add_defn_to_vec (obstackp,
4932 fixup_symbol_section (arg_sym, objfile),
4940 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
4941 to be invisible to users. */
4944 ada_is_ignored_field (struct type *type, int field_num)
4946 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
4950 const char *name = TYPE_FIELD_NAME (type, field_num);
4951 return (name == NULL
4952 || (name[0] == '_' && strncmp (name, "_parent", 7) != 0));
4956 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
4957 pointer or reference type whose ultimate target has a tag field. */
4960 ada_is_tagged_type (struct type *type, int refok)
4962 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
4965 /* True iff TYPE represents the type of X'Tag */
4968 ada_is_tag_type (struct type *type)
4970 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
4974 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
4975 return (name != NULL
4976 && strcmp (name, "ada__tags__dispatch_table") == 0);
4980 /* The type of the tag on VAL. */
4983 ada_tag_type (struct value *val)
4985 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
4988 /* The value of the tag on VAL. */
4991 ada_value_tag (struct value *val)
4993 return ada_value_struct_elt (val, "_tag", "record");
4996 /* The value of the tag on the object of type TYPE whose contents are
4997 saved at VALADDR, if it is non-null, or is at memory address
5000 static struct value *
5001 value_tag_from_contents_and_address (struct type *type,
5002 const bfd_byte *valaddr,
5005 int tag_byte_offset, dummy1, dummy2;
5006 struct type *tag_type;
5007 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
5010 const bfd_byte *valaddr1 = ((valaddr == NULL)
5012 : valaddr + tag_byte_offset);
5013 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
5015 return value_from_contents_and_address (tag_type, valaddr1, address1);
5020 static struct type *
5021 type_from_tag (struct value *tag)
5023 const char *type_name = ada_tag_name (tag);
5024 if (type_name != NULL)
5025 return ada_find_any_type (ada_encode (type_name));
5035 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5036 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5037 The value stored in ARGS->name is valid until the next call to
5041 ada_tag_name_1 (void *args0)
5043 struct tag_args *args = (struct tag_args *) args0;
5044 static char name[1024];
5048 val = ada_value_struct_elt (args->tag, "tsd", NULL);
5051 val = ada_value_struct_elt (val, "expanded_name", NULL);
5054 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5055 for (p = name; *p != '\0'; p += 1)
5062 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5066 ada_tag_name (struct value *tag)
5068 struct tag_args args;
5069 if (!ada_is_tag_type (value_type (tag)))
5073 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
5077 /* The parent type of TYPE, or NULL if none. */
5080 ada_parent_type (struct type *type)
5084 type = ada_check_typedef (type);
5086 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
5089 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5090 if (ada_is_parent_field (type, i))
5091 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5096 /* True iff field number FIELD_NUM of structure type TYPE contains the
5097 parent-type (inherited) fields of a derived type. Assumes TYPE is
5098 a structure type with at least FIELD_NUM+1 fields. */
5101 ada_is_parent_field (struct type *type, int field_num)
5103 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5104 return (name != NULL
5105 && (strncmp (name, "PARENT", 6) == 0
5106 || strncmp (name, "_parent", 7) == 0));
5109 /* True iff field number FIELD_NUM of structure type TYPE is a
5110 transparent wrapper field (which should be silently traversed when doing
5111 field selection and flattened when printing). Assumes TYPE is a
5112 structure type with at least FIELD_NUM+1 fields. Such fields are always
5116 ada_is_wrapper_field (struct type *type, int field_num)
5118 const char *name = TYPE_FIELD_NAME (type, field_num);
5119 return (name != NULL
5120 && (strncmp (name, "PARENT", 6) == 0
5121 || strcmp (name, "REP") == 0
5122 || strncmp (name, "_parent", 7) == 0
5123 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
5126 /* True iff field number FIELD_NUM of structure or union type TYPE
5127 is a variant wrapper. Assumes TYPE is a structure type with at least
5128 FIELD_NUM+1 fields. */
5131 ada_is_variant_part (struct type *type, int field_num)
5133 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5134 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
5135 || (is_dynamic_field (type, field_num)
5136 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
5137 == TYPE_CODE_UNION)));
5140 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5141 whose discriminants are contained in the record type OUTER_TYPE,
5142 returns the type of the controlling discriminant for the variant. */
5145 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
5147 char *name = ada_variant_discrim_name (var_type);
5149 ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
5151 return builtin_type_int;
5156 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5157 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5158 represents a 'when others' clause; otherwise 0. */
5161 ada_is_others_clause (struct type *type, int field_num)
5163 const char *name = TYPE_FIELD_NAME (type, field_num);
5164 return (name != NULL && name[0] == 'O');
5167 /* Assuming that TYPE0 is the type of the variant part of a record,
5168 returns the name of the discriminant controlling the variant.
5169 The value is valid until the next call to ada_variant_discrim_name. */
5172 ada_variant_discrim_name (struct type *type0)
5174 static char *result = NULL;
5175 static size_t result_len = 0;
5178 const char *discrim_end;
5179 const char *discrim_start;
5181 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
5182 type = TYPE_TARGET_TYPE (type0);
5186 name = ada_type_name (type);
5188 if (name == NULL || name[0] == '\000')
5191 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
5194 if (strncmp (discrim_end, "___XVN", 6) == 0)
5197 if (discrim_end == name)
5200 for (discrim_start = discrim_end; discrim_start != name + 3;
5203 if (discrim_start == name + 1)
5205 if ((discrim_start > name + 3
5206 && strncmp (discrim_start - 3, "___", 3) == 0)
5207 || discrim_start[-1] == '.')
5211 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
5212 strncpy (result, discrim_start, discrim_end - discrim_start);
5213 result[discrim_end - discrim_start] = '\0';
5217 /* Scan STR for a subtype-encoded number, beginning at position K.
5218 Put the position of the character just past the number scanned in
5219 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5220 Return 1 if there was a valid number at the given position, and 0
5221 otherwise. A "subtype-encoded" number consists of the absolute value
5222 in decimal, followed by the letter 'm' to indicate a negative number.
5223 Assumes 0m does not occur. */
5226 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
5230 if (!isdigit (str[k]))
5233 /* Do it the hard way so as not to make any assumption about
5234 the relationship of unsigned long (%lu scan format code) and
5237 while (isdigit (str[k]))
5239 RU = RU * 10 + (str[k] - '0');
5246 *R = (-(LONGEST) (RU - 1)) - 1;
5252 /* NOTE on the above: Technically, C does not say what the results of
5253 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5254 number representable as a LONGEST (although either would probably work
5255 in most implementations). When RU>0, the locution in the then branch
5256 above is always equivalent to the negative of RU. */
5263 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5264 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5265 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5268 ada_in_variant (LONGEST val, struct type *type, int field_num)
5270 const char *name = TYPE_FIELD_NAME (type, field_num);
5283 if (!ada_scan_number (name, p + 1, &W, &p))
5292 if (!ada_scan_number (name, p + 1, &L, &p)
5293 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
5295 if (val >= L && val <= U)
5307 /* FIXME: Lots of redundancy below. Try to consolidate. */
5309 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5310 ARG_TYPE, extract and return the value of one of its (non-static)
5311 fields. FIELDNO says which field. Differs from value_primitive_field
5312 only in that it can handle packed values of arbitrary type. */
5314 static struct value *
5315 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
5316 struct type *arg_type)
5320 arg_type = ada_check_typedef (arg_type);
5321 type = TYPE_FIELD_TYPE (arg_type, fieldno);
5323 /* Handle packed fields. */
5325 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
5327 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
5328 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
5330 return ada_value_primitive_packed_val (arg1, VALUE_CONTENTS (arg1),
5331 offset + bit_pos / 8,
5332 bit_pos % 8, bit_size, type);
5335 return value_primitive_field (arg1, offset, fieldno, arg_type);
5338 /* Find field with name NAME in object of type TYPE. If found, return 1
5339 after setting *FIELD_TYPE_P to the field's type, *BYTE_OFFSET_P to
5340 OFFSET + the byte offset of the field within an object of that type,
5341 *BIT_OFFSET_P to the bit offset modulo byte size of the field, and
5342 *BIT_SIZE_P to its size in bits if the field is packed, and 0 otherwise.
5343 Looks inside wrappers for the field. Returns 0 if field not
5346 find_struct_field (char *name, struct type *type, int offset,
5347 struct type **field_type_p,
5348 int *byte_offset_p, int *bit_offset_p, int *bit_size_p)
5352 type = ada_check_typedef (type);
5353 *field_type_p = NULL;
5354 *byte_offset_p = *bit_offset_p = *bit_size_p = 0;
5356 for (i = TYPE_NFIELDS (type) - 1; i >= 0; i -= 1)
5358 int bit_pos = TYPE_FIELD_BITPOS (type, i);
5359 int fld_offset = offset + bit_pos / 8;
5360 char *t_field_name = TYPE_FIELD_NAME (type, i);
5362 if (t_field_name == NULL)
5365 else if (field_name_match (t_field_name, name))
5367 int bit_size = TYPE_FIELD_BITSIZE (type, i);
5368 *field_type_p = TYPE_FIELD_TYPE (type, i);
5369 *byte_offset_p = fld_offset;
5370 *bit_offset_p = bit_pos % 8;
5371 *bit_size_p = bit_size;
5374 else if (ada_is_wrapper_field (type, i))
5376 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
5377 field_type_p, byte_offset_p, bit_offset_p,
5381 else if (ada_is_variant_part (type, i))
5384 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5386 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
5388 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
5390 + TYPE_FIELD_BITPOS (field_type, j) / 8,
5391 field_type_p, byte_offset_p,
5392 bit_offset_p, bit_size_p))
5402 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5403 and search in it assuming it has (class) type TYPE.
5404 If found, return value, else return NULL.
5406 Searches recursively through wrapper fields (e.g., '_parent'). */
5408 static struct value *
5409 ada_search_struct_field (char *name, struct value *arg, int offset,
5413 type = ada_check_typedef (type);
5415 for (i = TYPE_NFIELDS (type) - 1; i >= 0; i -= 1)
5417 char *t_field_name = TYPE_FIELD_NAME (type, i);
5419 if (t_field_name == NULL)
5422 else if (field_name_match (t_field_name, name))
5423 return ada_value_primitive_field (arg, offset, i, type);
5425 else if (ada_is_wrapper_field (type, i))
5427 struct value *v = /* Do not let indent join lines here. */
5428 ada_search_struct_field (name, arg,
5429 offset + TYPE_FIELD_BITPOS (type, i) / 8,
5430 TYPE_FIELD_TYPE (type, i));
5435 else if (ada_is_variant_part (type, i))
5438 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5439 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
5441 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
5443 struct value *v = ada_search_struct_field /* Force line break. */
5445 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
5446 TYPE_FIELD_TYPE (field_type, j));
5455 /* Given ARG, a value of type (pointer or reference to a)*
5456 structure/union, extract the component named NAME from the ultimate
5457 target structure/union and return it as a value with its
5458 appropriate type. If ARG is a pointer or reference and the field
5459 is not packed, returns a reference to the field, otherwise the
5460 value of the field (an lvalue if ARG is an lvalue).
5462 The routine searches for NAME among all members of the structure itself
5463 and (recursively) among all members of any wrapper members
5466 ERR is a name (for use in error messages) that identifies the class
5467 of entity that ARG is supposed to be. ERR may be null, indicating
5468 that on error, the function simply returns NULL, and does not
5469 throw an error. (FIXME: True only if ARG is a pointer or reference
5473 ada_value_struct_elt (struct value *arg, char *name, char *err)
5475 struct type *t, *t1;
5479 t1 = t = ada_check_typedef (value_type (arg));
5480 if (TYPE_CODE (t) == TYPE_CODE_REF)
5482 t1 = TYPE_TARGET_TYPE (t);
5488 error (_("Bad value type in a %s."), err);
5490 t1 = ada_check_typedef (t1);
5491 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
5493 arg = coerce_ref (arg);
5498 while (TYPE_CODE (t) == TYPE_CODE_PTR)
5500 t1 = TYPE_TARGET_TYPE (t);
5506 error (_("Bad value type in a %s."), err);
5508 t1 = ada_check_typedef (t1);
5509 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
5511 arg = value_ind (arg);
5518 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
5523 error (_("Attempt to extract a component of a value that is not a %s."),
5528 v = ada_search_struct_field (name, arg, 0, t);
5531 int bit_offset, bit_size, byte_offset;
5532 struct type *field_type;
5535 if (TYPE_CODE (t) == TYPE_CODE_PTR)
5536 address = value_as_address (arg);
5538 address = unpack_pointer (t, VALUE_CONTENTS (arg));
5540 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL);
5541 if (find_struct_field (name, t1, 0,
5542 &field_type, &byte_offset, &bit_offset,
5547 if (TYPE_CODE (t) == TYPE_CODE_REF)
5548 arg = ada_coerce_ref (arg);
5550 arg = ada_value_ind (arg);
5551 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
5552 bit_offset, bit_size,
5556 v = value_from_pointer (lookup_reference_type (field_type),
5557 address + byte_offset);
5561 if (v == NULL && err != NULL)
5562 error (_("There is no member named %s."), name);
5567 /* Given a type TYPE, look up the type of the component of type named NAME.
5568 If DISPP is non-null, add its byte displacement from the beginning of a
5569 structure (pointed to by a value) of type TYPE to *DISPP (does not
5570 work for packed fields).
5572 Matches any field whose name has NAME as a prefix, possibly
5575 TYPE can be either a struct or union. If REFOK, TYPE may also
5576 be a (pointer or reference)+ to a struct or union, and the
5577 ultimate target type will be searched.
5579 Looks recursively into variant clauses and parent types.
5581 If NOERR is nonzero, return NULL if NAME is not suitably defined or
5582 TYPE is not a type of the right kind. */
5584 static struct type *
5585 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
5586 int noerr, int *dispp)
5593 if (refok && type != NULL)
5596 type = ada_check_typedef (type);
5597 if (TYPE_CODE (type) != TYPE_CODE_PTR
5598 && TYPE_CODE (type) != TYPE_CODE_REF)
5600 type = TYPE_TARGET_TYPE (type);
5604 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
5605 && TYPE_CODE (type) != TYPE_CODE_UNION))
5611 target_terminal_ours ();
5612 gdb_flush (gdb_stdout);
5614 error (_("Type (null) is not a structure or union type"));
5617 /* XXX: type_sprint */
5618 fprintf_unfiltered (gdb_stderr, _("Type "));
5619 type_print (type, "", gdb_stderr, -1);
5620 error (_(" is not a structure or union type"));
5625 type = to_static_fixed_type (type);
5627 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5629 char *t_field_name = TYPE_FIELD_NAME (type, i);
5633 if (t_field_name == NULL)
5636 else if (field_name_match (t_field_name, name))
5639 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
5640 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5643 else if (ada_is_wrapper_field (type, i))
5646 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
5651 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
5656 else if (ada_is_variant_part (type, i))
5659 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
5661 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
5664 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
5669 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
5680 target_terminal_ours ();
5681 gdb_flush (gdb_stdout);
5684 /* XXX: type_sprint */
5685 fprintf_unfiltered (gdb_stderr, _("Type "));
5686 type_print (type, "", gdb_stderr, -1);
5687 error (_(" has no component named <null>"));
5691 /* XXX: type_sprint */
5692 fprintf_unfiltered (gdb_stderr, _("Type "));
5693 type_print (type, "", gdb_stderr, -1);
5694 error (_(" has no component named %s"), name);
5701 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
5702 within a value of type OUTER_TYPE that is stored in GDB at
5703 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
5704 numbering from 0) is applicable. Returns -1 if none are. */
5707 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
5708 const bfd_byte *outer_valaddr)
5713 struct type *discrim_type;
5714 char *discrim_name = ada_variant_discrim_name (var_type);
5715 LONGEST discrim_val;
5719 ada_lookup_struct_elt_type (outer_type, discrim_name, 1, 1, &disp);
5720 if (discrim_type == NULL)
5722 discrim_val = unpack_long (discrim_type, outer_valaddr + disp);
5725 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
5727 if (ada_is_others_clause (var_type, i))
5729 else if (ada_in_variant (discrim_val, var_type, i))
5733 return others_clause;
5738 /* Dynamic-Sized Records */
5740 /* Strategy: The type ostensibly attached to a value with dynamic size
5741 (i.e., a size that is not statically recorded in the debugging
5742 data) does not accurately reflect the size or layout of the value.
5743 Our strategy is to convert these values to values with accurate,
5744 conventional types that are constructed on the fly. */
5746 /* There is a subtle and tricky problem here. In general, we cannot
5747 determine the size of dynamic records without its data. However,
5748 the 'struct value' data structure, which GDB uses to represent
5749 quantities in the inferior process (the target), requires the size
5750 of the type at the time of its allocation in order to reserve space
5751 for GDB's internal copy of the data. That's why the
5752 'to_fixed_xxx_type' routines take (target) addresses as parameters,
5753 rather than struct value*s.
5755 However, GDB's internal history variables ($1, $2, etc.) are
5756 struct value*s containing internal copies of the data that are not, in
5757 general, the same as the data at their corresponding addresses in
5758 the target. Fortunately, the types we give to these values are all
5759 conventional, fixed-size types (as per the strategy described
5760 above), so that we don't usually have to perform the
5761 'to_fixed_xxx_type' conversions to look at their values.
5762 Unfortunately, there is one exception: if one of the internal
5763 history variables is an array whose elements are unconstrained
5764 records, then we will need to create distinct fixed types for each
5765 element selected. */
5767 /* The upshot of all of this is that many routines take a (type, host
5768 address, target address) triple as arguments to represent a value.
5769 The host address, if non-null, is supposed to contain an internal
5770 copy of the relevant data; otherwise, the program is to consult the
5771 target at the target address. */
5773 /* Assuming that VAL0 represents a pointer value, the result of
5774 dereferencing it. Differs from value_ind in its treatment of
5775 dynamic-sized types. */
5778 ada_value_ind (struct value *val0)
5780 struct value *val = unwrap_value (value_ind (val0));
5781 return ada_to_fixed_value (val);
5784 /* The value resulting from dereferencing any "reference to"
5785 qualifiers on VAL0. */
5787 static struct value *
5788 ada_coerce_ref (struct value *val0)
5790 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
5792 struct value *val = val0;
5793 val = coerce_ref (val);
5794 val = unwrap_value (val);
5795 return ada_to_fixed_value (val);
5801 /* Return OFF rounded upward if necessary to a multiple of
5802 ALIGNMENT (a power of 2). */
5805 align_value (unsigned int off, unsigned int alignment)
5807 return (off + alignment - 1) & ~(alignment - 1);
5810 /* Return the bit alignment required for field #F of template type TYPE. */
5813 field_alignment (struct type *type, int f)
5815 const char *name = TYPE_FIELD_NAME (type, f);
5816 int len = (name == NULL) ? 0 : strlen (name);
5819 if (!isdigit (name[len - 1]))
5822 if (isdigit (name[len - 2]))
5823 align_offset = len - 2;
5825 align_offset = len - 1;
5827 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
5828 return TARGET_CHAR_BIT;
5830 return atoi (name + align_offset) * TARGET_CHAR_BIT;
5833 /* Find a symbol named NAME. Ignores ambiguity. */
5836 ada_find_any_symbol (const char *name)
5840 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
5841 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
5844 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
5848 /* Find a type named NAME. Ignores ambiguity. */
5851 ada_find_any_type (const char *name)
5853 struct symbol *sym = ada_find_any_symbol (name);
5856 return SYMBOL_TYPE (sym);
5861 /* Given a symbol NAME and its associated BLOCK, search all symbols
5862 for its ___XR counterpart, which is the ``renaming'' symbol
5863 associated to NAME. Return this symbol if found, return
5867 ada_find_renaming_symbol (const char *name, struct block *block)
5869 const struct symbol *function_sym = block_function (block);
5872 if (function_sym != NULL)
5874 /* If the symbol is defined inside a function, NAME is not fully
5875 qualified. This means we need to prepend the function name
5876 as well as adding the ``___XR'' suffix to build the name of
5877 the associated renaming symbol. */
5878 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
5879 const int function_name_len = strlen (function_name);
5880 const int rename_len = function_name_len + 2 /* "__" */
5881 + strlen (name) + 6 /* "___XR\0" */ ;
5883 /* Library-level functions are a special case, as GNAT adds
5884 a ``_ada_'' prefix to the function name to avoid namespace
5885 pollution. However, the renaming symbol themselves do not
5886 have this prefix, so we need to skip this prefix if present. */
5887 if (function_name_len > 5 /* "_ada_" */
5888 && strstr (function_name, "_ada_") == function_name)
5889 function_name = function_name + 5;
5891 rename = (char *) alloca (rename_len * sizeof (char));
5892 sprintf (rename, "%s__%s___XR", function_name, name);
5896 const int rename_len = strlen (name) + 6;
5897 rename = (char *) alloca (rename_len * sizeof (char));
5898 sprintf (rename, "%s___XR", name);
5901 return ada_find_any_symbol (rename);
5904 /* Because of GNAT encoding conventions, several GDB symbols may match a
5905 given type name. If the type denoted by TYPE0 is to be preferred to
5906 that of TYPE1 for purposes of type printing, return non-zero;
5907 otherwise return 0. */
5910 ada_prefer_type (struct type *type0, struct type *type1)
5914 else if (type0 == NULL)
5916 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
5918 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
5920 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
5922 else if (ada_is_packed_array_type (type0))
5924 else if (ada_is_array_descriptor_type (type0)
5925 && !ada_is_array_descriptor_type (type1))
5927 else if (ada_renaming_type (type0) != NULL
5928 && ada_renaming_type (type1) == NULL)
5933 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
5934 null, its TYPE_TAG_NAME. Null if TYPE is null. */
5937 ada_type_name (struct type *type)
5941 else if (TYPE_NAME (type) != NULL)
5942 return TYPE_NAME (type);
5944 return TYPE_TAG_NAME (type);
5947 /* Find a parallel type to TYPE whose name is formed by appending
5948 SUFFIX to the name of TYPE. */
5951 ada_find_parallel_type (struct type *type, const char *suffix)
5954 static size_t name_len = 0;
5956 char *typename = ada_type_name (type);
5958 if (typename == NULL)
5961 len = strlen (typename);
5963 GROW_VECT (name, name_len, len + strlen (suffix) + 1);
5965 strcpy (name, typename);
5966 strcpy (name + len, suffix);
5968 return ada_find_any_type (name);
5972 /* If TYPE is a variable-size record type, return the corresponding template
5973 type describing its fields. Otherwise, return NULL. */
5975 static struct type *
5976 dynamic_template_type (struct type *type)
5978 type = ada_check_typedef (type);
5980 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
5981 || ada_type_name (type) == NULL)
5985 int len = strlen (ada_type_name (type));
5986 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
5989 return ada_find_parallel_type (type, "___XVE");
5993 /* Assuming that TEMPL_TYPE is a union or struct type, returns
5994 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
5997 is_dynamic_field (struct type *templ_type, int field_num)
5999 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
6001 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
6002 && strstr (name, "___XVL") != NULL;
6005 /* The index of the variant field of TYPE, or -1 if TYPE does not
6006 represent a variant record type. */
6009 variant_field_index (struct type *type)
6013 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6016 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
6018 if (ada_is_variant_part (type, f))
6024 /* A record type with no fields. */
6026 static struct type *
6027 empty_record (struct objfile *objfile)
6029 struct type *type = alloc_type (objfile);
6030 TYPE_CODE (type) = TYPE_CODE_STRUCT;
6031 TYPE_NFIELDS (type) = 0;
6032 TYPE_FIELDS (type) = NULL;
6033 TYPE_NAME (type) = "<empty>";
6034 TYPE_TAG_NAME (type) = NULL;
6035 TYPE_FLAGS (type) = 0;
6036 TYPE_LENGTH (type) = 0;
6040 /* An ordinary record type (with fixed-length fields) that describes
6041 the value of type TYPE at VALADDR or ADDRESS (see comments at
6042 the beginning of this section) VAL according to GNAT conventions.
6043 DVAL0 should describe the (portion of a) record that contains any
6044 necessary discriminants. It should be NULL if value_type (VAL) is
6045 an outer-level type (i.e., as opposed to a branch of a variant.) A
6046 variant field (unless unchecked) is replaced by a particular branch
6049 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6050 length are not statically known are discarded. As a consequence,
6051 VALADDR, ADDRESS and DVAL0 are ignored.
6053 NOTE: Limitations: For now, we assume that dynamic fields and
6054 variants occupy whole numbers of bytes. However, they need not be
6058 ada_template_to_fixed_record_type_1 (struct type *type,
6059 const bfd_byte *valaddr,
6060 CORE_ADDR address, struct value *dval0,
6061 int keep_dynamic_fields)
6063 struct value *mark = value_mark ();
6066 int nfields, bit_len;
6069 int fld_bit_len, bit_incr;
6072 /* Compute the number of fields in this record type that are going
6073 to be processed: unless keep_dynamic_fields, this includes only
6074 fields whose position and length are static will be processed. */
6075 if (keep_dynamic_fields)
6076 nfields = TYPE_NFIELDS (type);
6080 while (nfields < TYPE_NFIELDS (type)
6081 && !ada_is_variant_part (type, nfields)
6082 && !is_dynamic_field (type, nfields))
6086 rtype = alloc_type (TYPE_OBJFILE (type));
6087 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
6088 INIT_CPLUS_SPECIFIC (rtype);
6089 TYPE_NFIELDS (rtype) = nfields;
6090 TYPE_FIELDS (rtype) = (struct field *)
6091 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6092 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
6093 TYPE_NAME (rtype) = ada_type_name (type);
6094 TYPE_TAG_NAME (rtype) = NULL;
6095 TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
6101 for (f = 0; f < nfields; f += 1)
6103 off = align_value (off, field_alignment (type, f))
6104 + TYPE_FIELD_BITPOS (type, f);
6105 TYPE_FIELD_BITPOS (rtype, f) = off;
6106 TYPE_FIELD_BITSIZE (rtype, f) = 0;
6108 if (ada_is_variant_part (type, f))
6111 fld_bit_len = bit_incr = 0;
6113 else if (is_dynamic_field (type, f))
6116 dval = value_from_contents_and_address (rtype, valaddr, address);
6120 TYPE_FIELD_TYPE (rtype, f) =
6123 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))),
6124 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6125 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
6126 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6127 bit_incr = fld_bit_len =
6128 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
6132 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
6133 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6134 if (TYPE_FIELD_BITSIZE (type, f) > 0)
6135 bit_incr = fld_bit_len =
6136 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
6138 bit_incr = fld_bit_len =
6139 TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
6141 if (off + fld_bit_len > bit_len)
6142 bit_len = off + fld_bit_len;
6144 TYPE_LENGTH (rtype) =
6145 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6148 /* We handle the variant part, if any, at the end because of certain
6149 odd cases in which it is re-ordered so as NOT the last field of
6150 the record. This can happen in the presence of representation
6152 if (variant_field >= 0)
6154 struct type *branch_type;
6156 off = TYPE_FIELD_BITPOS (rtype, variant_field);
6159 dval = value_from_contents_and_address (rtype, valaddr, address);
6164 to_fixed_variant_branch_type
6165 (TYPE_FIELD_TYPE (type, variant_field),
6166 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6167 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
6168 if (branch_type == NULL)
6170 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
6171 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
6172 TYPE_NFIELDS (rtype) -= 1;
6176 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6177 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6179 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
6181 if (off + fld_bit_len > bit_len)
6182 bit_len = off + fld_bit_len;
6183 TYPE_LENGTH (rtype) =
6184 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6188 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6189 should contain the alignment of that record, which should be a strictly
6190 positive value. If null or negative, then something is wrong, most
6191 probably in the debug info. In that case, we don't round up the size
6192 of the resulting type. If this record is not part of another structure,
6193 the current RTYPE length might be good enough for our purposes. */
6194 if (TYPE_LENGTH (type) <= 0)
6196 if (TYPE_NAME (rtype))
6197 warning (_("Invalid type size for `%s' detected: %d."),
6198 TYPE_NAME (rtype), TYPE_LENGTH (type));
6200 warning (_("Invalid type size for <unnamed> detected: %d."),
6201 TYPE_LENGTH (type));
6205 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
6206 TYPE_LENGTH (type));
6209 value_free_to_mark (mark);
6210 if (TYPE_LENGTH (rtype) > varsize_limit)
6211 error (_("record type with dynamic size is larger than varsize-limit"));
6215 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6218 static struct type *
6219 template_to_fixed_record_type (struct type *type, const bfd_byte *valaddr,
6220 CORE_ADDR address, struct value *dval0)
6222 return ada_template_to_fixed_record_type_1 (type, valaddr,
6226 /* An ordinary record type in which ___XVL-convention fields and
6227 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6228 static approximations, containing all possible fields. Uses
6229 no runtime values. Useless for use in values, but that's OK,
6230 since the results are used only for type determinations. Works on both
6231 structs and unions. Representation note: to save space, we memorize
6232 the result of this function in the TYPE_TARGET_TYPE of the
6235 static struct type *
6236 template_to_static_fixed_type (struct type *type0)
6242 if (TYPE_TARGET_TYPE (type0) != NULL)
6243 return TYPE_TARGET_TYPE (type0);
6245 nfields = TYPE_NFIELDS (type0);
6248 for (f = 0; f < nfields; f += 1)
6250 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
6251 struct type *new_type;
6253 if (is_dynamic_field (type0, f))
6254 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
6256 new_type = to_static_fixed_type (field_type);
6257 if (type == type0 && new_type != field_type)
6259 TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
6260 TYPE_CODE (type) = TYPE_CODE (type0);
6261 INIT_CPLUS_SPECIFIC (type);
6262 TYPE_NFIELDS (type) = nfields;
6263 TYPE_FIELDS (type) = (struct field *)
6264 TYPE_ALLOC (type, nfields * sizeof (struct field));
6265 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
6266 sizeof (struct field) * nfields);
6267 TYPE_NAME (type) = ada_type_name (type0);
6268 TYPE_TAG_NAME (type) = NULL;
6269 TYPE_FLAGS (type) |= TYPE_FLAG_FIXED_INSTANCE;
6270 TYPE_LENGTH (type) = 0;
6272 TYPE_FIELD_TYPE (type, f) = new_type;
6273 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
6278 /* Given an object of type TYPE whose contents are at VALADDR and
6279 whose address in memory is ADDRESS, returns a revision of TYPE --
6280 a non-dynamic-sized record with a variant part -- in which
6281 the variant part is replaced with the appropriate branch. Looks
6282 for discriminant values in DVAL0, which can be NULL if the record
6283 contains the necessary discriminant values. */
6285 static struct type *
6286 to_record_with_fixed_variant_part (struct type *type, const bfd_byte *valaddr,
6287 CORE_ADDR address, struct value *dval0)
6289 struct value *mark = value_mark ();
6292 struct type *branch_type;
6293 int nfields = TYPE_NFIELDS (type);
6294 int variant_field = variant_field_index (type);
6296 if (variant_field == -1)
6300 dval = value_from_contents_and_address (type, valaddr, address);
6304 rtype = alloc_type (TYPE_OBJFILE (type));
6305 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
6306 INIT_CPLUS_SPECIFIC (rtype);
6307 TYPE_NFIELDS (rtype) = nfields;
6308 TYPE_FIELDS (rtype) =
6309 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6310 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
6311 sizeof (struct field) * nfields);
6312 TYPE_NAME (rtype) = ada_type_name (type);
6313 TYPE_TAG_NAME (rtype) = NULL;
6314 TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
6315 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
6317 branch_type = to_fixed_variant_branch_type
6318 (TYPE_FIELD_TYPE (type, variant_field),
6319 cond_offset_host (valaddr,
6320 TYPE_FIELD_BITPOS (type, variant_field)
6322 cond_offset_target (address,
6323 TYPE_FIELD_BITPOS (type, variant_field)
6324 / TARGET_CHAR_BIT), dval);
6325 if (branch_type == NULL)
6328 for (f = variant_field + 1; f < nfields; f += 1)
6329 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
6330 TYPE_NFIELDS (rtype) -= 1;
6334 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6335 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6336 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
6337 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
6339 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
6341 value_free_to_mark (mark);
6345 /* An ordinary record type (with fixed-length fields) that describes
6346 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6347 beginning of this section]. Any necessary discriminants' values
6348 should be in DVAL, a record value; it may be NULL if the object
6349 at ADDR itself contains any necessary discriminant values.
6350 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6351 values from the record are needed. Except in the case that DVAL,
6352 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6353 unchecked) is replaced by a particular branch of the variant.
6355 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6356 is questionable and may be removed. It can arise during the
6357 processing of an unconstrained-array-of-record type where all the
6358 variant branches have exactly the same size. This is because in
6359 such cases, the compiler does not bother to use the XVS convention
6360 when encoding the record. I am currently dubious of this
6361 shortcut and suspect the compiler should be altered. FIXME. */
6363 static struct type *
6364 to_fixed_record_type (struct type *type0, const bfd_byte *valaddr,
6365 CORE_ADDR address, struct value *dval)
6367 struct type *templ_type;
6369 if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
6372 templ_type = dynamic_template_type (type0);
6374 if (templ_type != NULL)
6375 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
6376 else if (variant_field_index (type0) >= 0)
6378 if (dval == NULL && valaddr == NULL && address == 0)
6380 return to_record_with_fixed_variant_part (type0, valaddr, address,
6385 TYPE_FLAGS (type0) |= TYPE_FLAG_FIXED_INSTANCE;
6391 /* An ordinary record type (with fixed-length fields) that describes
6392 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
6393 union type. Any necessary discriminants' values should be in DVAL,
6394 a record value. That is, this routine selects the appropriate
6395 branch of the union at ADDR according to the discriminant value
6396 indicated in the union's type name. */
6398 static struct type *
6399 to_fixed_variant_branch_type (struct type *var_type0, const bfd_byte *valaddr,
6400 CORE_ADDR address, struct value *dval)
6403 struct type *templ_type;
6404 struct type *var_type;
6406 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
6407 var_type = TYPE_TARGET_TYPE (var_type0);
6409 var_type = var_type0;
6411 templ_type = ada_find_parallel_type (var_type, "___XVU");
6413 if (templ_type != NULL)
6414 var_type = templ_type;
6417 ada_which_variant_applies (var_type,
6418 value_type (dval), VALUE_CONTENTS (dval));
6421 return empty_record (TYPE_OBJFILE (var_type));
6422 else if (is_dynamic_field (var_type, which))
6423 return to_fixed_record_type
6424 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
6425 valaddr, address, dval);
6426 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
6428 to_fixed_record_type
6429 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
6431 return TYPE_FIELD_TYPE (var_type, which);
6434 /* Assuming that TYPE0 is an array type describing the type of a value
6435 at ADDR, and that DVAL describes a record containing any
6436 discriminants used in TYPE0, returns a type for the value that
6437 contains no dynamic components (that is, no components whose sizes
6438 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
6439 true, gives an error message if the resulting type's size is over
6442 static struct type *
6443 to_fixed_array_type (struct type *type0, struct value *dval,
6446 struct type *index_type_desc;
6447 struct type *result;
6449 if (ada_is_packed_array_type (type0) /* revisit? */
6450 || (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE))
6453 index_type_desc = ada_find_parallel_type (type0, "___XA");
6454 if (index_type_desc == NULL)
6456 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
6457 /* NOTE: elt_type---the fixed version of elt_type0---should never
6458 depend on the contents of the array in properly constructed
6460 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval);
6462 if (elt_type0 == elt_type)
6465 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
6466 elt_type, TYPE_INDEX_TYPE (type0));
6471 struct type *elt_type0;
6474 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
6475 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
6477 /* NOTE: result---the fixed version of elt_type0---should never
6478 depend on the contents of the array in properly constructed
6480 result = ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval);
6481 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
6483 struct type *range_type =
6484 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
6485 dval, TYPE_OBJFILE (type0));
6486 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
6487 result, range_type);
6489 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
6490 error (_("array type with dynamic size is larger than varsize-limit"));
6493 TYPE_FLAGS (result) |= TYPE_FLAG_FIXED_INSTANCE;
6498 /* A standard type (containing no dynamically sized components)
6499 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
6500 DVAL describes a record containing any discriminants used in TYPE0,
6501 and may be NULL if there are none, or if the object of type TYPE at
6502 ADDRESS or in VALADDR contains these discriminants. */
6505 ada_to_fixed_type (struct type *type, const bfd_byte *valaddr,
6506 CORE_ADDR address, struct value *dval)
6508 type = ada_check_typedef (type);
6509 switch (TYPE_CODE (type))
6513 case TYPE_CODE_STRUCT:
6515 struct type *static_type = to_static_fixed_type (type);
6516 if (ada_is_tagged_type (static_type, 0))
6518 struct type *real_type =
6519 type_from_tag (value_tag_from_contents_and_address (static_type,
6522 if (real_type != NULL)
6525 return to_fixed_record_type (type, valaddr, address, NULL);
6527 case TYPE_CODE_ARRAY:
6528 return to_fixed_array_type (type, dval, 1);
6529 case TYPE_CODE_UNION:
6533 return to_fixed_variant_branch_type (type, valaddr, address, dval);
6537 /* A standard (static-sized) type corresponding as well as possible to
6538 TYPE0, but based on no runtime data. */
6540 static struct type *
6541 to_static_fixed_type (struct type *type0)
6548 if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
6551 type0 = ada_check_typedef (type0);
6553 switch (TYPE_CODE (type0))
6557 case TYPE_CODE_STRUCT:
6558 type = dynamic_template_type (type0);
6560 return template_to_static_fixed_type (type);
6562 return template_to_static_fixed_type (type0);
6563 case TYPE_CODE_UNION:
6564 type = ada_find_parallel_type (type0, "___XVU");
6566 return template_to_static_fixed_type (type);
6568 return template_to_static_fixed_type (type0);
6572 /* A static approximation of TYPE with all type wrappers removed. */
6574 static struct type *
6575 static_unwrap_type (struct type *type)
6577 if (ada_is_aligner_type (type))
6579 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
6580 if (ada_type_name (type1) == NULL)
6581 TYPE_NAME (type1) = ada_type_name (type);
6583 return static_unwrap_type (type1);
6587 struct type *raw_real_type = ada_get_base_type (type);
6588 if (raw_real_type == type)
6591 return to_static_fixed_type (raw_real_type);
6595 /* In some cases, incomplete and private types require
6596 cross-references that are not resolved as records (for example,
6598 type FooP is access Foo;
6600 type Foo is array ...;
6601 ). In these cases, since there is no mechanism for producing
6602 cross-references to such types, we instead substitute for FooP a
6603 stub enumeration type that is nowhere resolved, and whose tag is
6604 the name of the actual type. Call these types "non-record stubs". */
6606 /* A type equivalent to TYPE that is not a non-record stub, if one
6607 exists, otherwise TYPE. */
6610 ada_check_typedef (struct type *type)
6612 CHECK_TYPEDEF (type);
6613 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
6614 || (TYPE_FLAGS (type) & TYPE_FLAG_STUB) == 0
6615 || TYPE_TAG_NAME (type) == NULL)
6619 char *name = TYPE_TAG_NAME (type);
6620 struct type *type1 = ada_find_any_type (name);
6621 return (type1 == NULL) ? type : type1;
6625 /* A value representing the data at VALADDR/ADDRESS as described by
6626 type TYPE0, but with a standard (static-sized) type that correctly
6627 describes it. If VAL0 is not NULL and TYPE0 already is a standard
6628 type, then return VAL0 [this feature is simply to avoid redundant
6629 creation of struct values]. */
6631 static struct value *
6632 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
6635 struct type *type = ada_to_fixed_type (type0, 0, address, NULL);
6636 if (type == type0 && val0 != NULL)
6639 return value_from_contents_and_address (type, 0, address);
6642 /* A value representing VAL, but with a standard (static-sized) type
6643 that correctly describes it. Does not necessarily create a new
6646 static struct value *
6647 ada_to_fixed_value (struct value *val)
6649 return ada_to_fixed_value_create (value_type (val),
6650 VALUE_ADDRESS (val) + value_offset (val),
6654 /* A value representing VAL, but with a standard (static-sized) type
6655 chosen to approximate the real type of VAL as well as possible, but
6656 without consulting any runtime values. For Ada dynamic-sized
6657 types, therefore, the type of the result is likely to be inaccurate. */
6660 ada_to_static_fixed_value (struct value *val)
6663 to_static_fixed_type (static_unwrap_type (value_type (val)));
6664 if (type == value_type (val))
6667 return coerce_unspec_val_to_type (val, type);
6673 /* Table mapping attribute numbers to names.
6674 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
6676 static const char *attribute_names[] = {
6694 ada_attribute_name (enum exp_opcode n)
6696 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
6697 return attribute_names[n - OP_ATR_FIRST + 1];
6699 return attribute_names[0];
6702 /* Evaluate the 'POS attribute applied to ARG. */
6705 pos_atr (struct value *arg)
6707 struct type *type = value_type (arg);
6709 if (!discrete_type_p (type))
6710 error (_("'POS only defined on discrete types"));
6712 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
6715 LONGEST v = value_as_long (arg);
6717 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6719 if (v == TYPE_FIELD_BITPOS (type, i))
6722 error (_("enumeration value is invalid: can't find 'POS"));
6725 return value_as_long (arg);
6728 static struct value *
6729 value_pos_atr (struct value *arg)
6731 return value_from_longest (builtin_type_int, pos_atr (arg));
6734 /* Evaluate the TYPE'VAL attribute applied to ARG. */
6736 static struct value *
6737 value_val_atr (struct type *type, struct value *arg)
6739 if (!discrete_type_p (type))
6740 error (_("'VAL only defined on discrete types"));
6741 if (!integer_type_p (value_type (arg)))
6742 error (_("'VAL requires integral argument"));
6744 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
6746 long pos = value_as_long (arg);
6747 if (pos < 0 || pos >= TYPE_NFIELDS (type))
6748 error (_("argument to 'VAL out of range"));
6749 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
6752 return value_from_longest (type, value_as_long (arg));
6758 /* True if TYPE appears to be an Ada character type.
6759 [At the moment, this is true only for Character and Wide_Character;
6760 It is a heuristic test that could stand improvement]. */
6763 ada_is_character_type (struct type *type)
6765 const char *name = ada_type_name (type);
6768 && (TYPE_CODE (type) == TYPE_CODE_CHAR
6769 || TYPE_CODE (type) == TYPE_CODE_INT
6770 || TYPE_CODE (type) == TYPE_CODE_RANGE)
6771 && (strcmp (name, "character") == 0
6772 || strcmp (name, "wide_character") == 0
6773 || strcmp (name, "unsigned char") == 0);
6776 /* True if TYPE appears to be an Ada string type. */
6779 ada_is_string_type (struct type *type)
6781 type = ada_check_typedef (type);
6783 && TYPE_CODE (type) != TYPE_CODE_PTR
6784 && (ada_is_simple_array_type (type)
6785 || ada_is_array_descriptor_type (type))
6786 && ada_array_arity (type) == 1)
6788 struct type *elttype = ada_array_element_type (type, 1);
6790 return ada_is_character_type (elttype);
6797 /* True if TYPE is a struct type introduced by the compiler to force the
6798 alignment of a value. Such types have a single field with a
6799 distinctive name. */
6802 ada_is_aligner_type (struct type *type)
6804 type = ada_check_typedef (type);
6806 /* If we can find a parallel XVS type, then the XVS type should
6807 be used instead of this type. And hence, this is not an aligner
6809 if (ada_find_parallel_type (type, "___XVS") != NULL)
6812 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
6813 && TYPE_NFIELDS (type) == 1
6814 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
6817 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
6818 the parallel type. */
6821 ada_get_base_type (struct type *raw_type)
6823 struct type *real_type_namer;
6824 struct type *raw_real_type;
6826 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
6829 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
6830 if (real_type_namer == NULL
6831 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
6832 || TYPE_NFIELDS (real_type_namer) != 1)
6835 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
6836 if (raw_real_type == NULL)
6839 return raw_real_type;
6842 /* The type of value designated by TYPE, with all aligners removed. */
6845 ada_aligned_type (struct type *type)
6847 if (ada_is_aligner_type (type))
6848 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
6850 return ada_get_base_type (type);
6854 /* The address of the aligned value in an object at address VALADDR
6855 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
6858 ada_aligned_value_addr (struct type *type, const bfd_byte *valaddr)
6860 if (ada_is_aligner_type (type))
6861 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
6863 TYPE_FIELD_BITPOS (type,
6864 0) / TARGET_CHAR_BIT);
6871 /* The printed representation of an enumeration literal with encoded
6872 name NAME. The value is good to the next call of ada_enum_name. */
6874 ada_enum_name (const char *name)
6876 static char *result;
6877 static size_t result_len = 0;
6880 /* First, unqualify the enumeration name:
6881 1. Search for the last '.' character. If we find one, then skip
6882 all the preceeding characters, the unqualified name starts
6883 right after that dot.
6884 2. Otherwise, we may be debugging on a target where the compiler
6885 translates dots into "__". Search forward for double underscores,
6886 but stop searching when we hit an overloading suffix, which is
6887 of the form "__" followed by digits. */
6889 tmp = strrchr (name, '.');
6894 while ((tmp = strstr (name, "__")) != NULL)
6896 if (isdigit (tmp[2]))
6906 if (name[1] == 'U' || name[1] == 'W')
6908 if (sscanf (name + 2, "%x", &v) != 1)
6914 GROW_VECT (result, result_len, 16);
6915 if (isascii (v) && isprint (v))
6916 sprintf (result, "'%c'", v);
6917 else if (name[1] == 'U')
6918 sprintf (result, "[\"%02x\"]", v);
6920 sprintf (result, "[\"%04x\"]", v);
6926 tmp = strstr (name, "__");
6928 tmp = strstr (name, "$");
6931 GROW_VECT (result, result_len, tmp - name + 1);
6932 strncpy (result, name, tmp - name);
6933 result[tmp - name] = '\0';
6941 static struct value *
6942 evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos,
6945 return (*exp->language_defn->la_exp_desc->evaluate_exp)
6946 (expect_type, exp, pos, noside);
6949 /* Evaluate the subexpression of EXP starting at *POS as for
6950 evaluate_type, updating *POS to point just past the evaluated
6953 static struct value *
6954 evaluate_subexp_type (struct expression *exp, int *pos)
6956 return (*exp->language_defn->la_exp_desc->evaluate_exp)
6957 (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
6960 /* If VAL is wrapped in an aligner or subtype wrapper, return the
6963 static struct value *
6964 unwrap_value (struct value *val)
6966 struct type *type = ada_check_typedef (value_type (val));
6967 if (ada_is_aligner_type (type))
6969 struct value *v = value_struct_elt (&val, NULL, "F",
6970 NULL, "internal structure");
6971 struct type *val_type = ada_check_typedef (value_type (v));
6972 if (ada_type_name (val_type) == NULL)
6973 TYPE_NAME (val_type) = ada_type_name (type);
6975 return unwrap_value (v);
6979 struct type *raw_real_type =
6980 ada_check_typedef (ada_get_base_type (type));
6982 if (type == raw_real_type)
6986 coerce_unspec_val_to_type
6987 (val, ada_to_fixed_type (raw_real_type, 0,
6988 VALUE_ADDRESS (val) + value_offset (val),
6993 static struct value *
6994 cast_to_fixed (struct type *type, struct value *arg)
6998 if (type == value_type (arg))
7000 else if (ada_is_fixed_point_type (value_type (arg)))
7001 val = ada_float_to_fixed (type,
7002 ada_fixed_to_float (value_type (arg),
7003 value_as_long (arg)));
7007 value_as_double (value_cast (builtin_type_double, value_copy (arg)));
7008 val = ada_float_to_fixed (type, argd);
7011 return value_from_longest (type, val);
7014 static struct value *
7015 cast_from_fixed_to_double (struct value *arg)
7017 DOUBLEST val = ada_fixed_to_float (value_type (arg),
7018 value_as_long (arg));
7019 return value_from_double (builtin_type_double, val);
7022 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7023 return the converted value. */
7025 static struct value *
7026 coerce_for_assign (struct type *type, struct value *val)
7028 struct type *type2 = value_type (val);
7032 type2 = ada_check_typedef (type2);
7033 type = ada_check_typedef (type);
7035 if (TYPE_CODE (type2) == TYPE_CODE_PTR
7036 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7038 val = ada_value_ind (val);
7039 type2 = value_type (val);
7042 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
7043 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7045 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
7046 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
7047 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
7048 error (_("Incompatible types in assignment"));
7054 static struct value *
7055 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
7058 struct type *type1, *type2;
7061 arg1 = coerce_ref (arg1);
7062 arg2 = coerce_ref (arg2);
7063 type1 = base_type (ada_check_typedef (value_type (arg1)));
7064 type2 = base_type (ada_check_typedef (value_type (arg2)));
7066 if (TYPE_CODE (type1) != TYPE_CODE_INT
7067 || TYPE_CODE (type2) != TYPE_CODE_INT)
7068 return value_binop (arg1, arg2, op);
7077 return value_binop (arg1, arg2, op);
7080 v2 = value_as_long (arg2);
7082 error (_("second operand of %s must not be zero."), op_string (op));
7084 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
7085 return value_binop (arg1, arg2, op);
7087 v1 = value_as_long (arg1);
7092 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
7093 v += v > 0 ? -1 : 1;
7101 /* Should not reach this point. */
7105 val = allocate_value (type1);
7106 store_unsigned_integer (VALUE_CONTENTS_RAW (val),
7107 TYPE_LENGTH (value_type (val)), v);
7112 ada_value_equal (struct value *arg1, struct value *arg2)
7114 if (ada_is_direct_array_type (value_type (arg1))
7115 || ada_is_direct_array_type (value_type (arg2)))
7117 arg1 = ada_coerce_to_simple_array (arg1);
7118 arg2 = ada_coerce_to_simple_array (arg2);
7119 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
7120 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
7121 error (_("Attempt to compare array with non-array"));
7122 /* FIXME: The following works only for types whose
7123 representations use all bits (no padding or undefined bits)
7124 and do not have user-defined equality. */
7126 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
7127 && memcmp (VALUE_CONTENTS (arg1), VALUE_CONTENTS (arg2),
7128 TYPE_LENGTH (value_type (arg1))) == 0;
7130 return value_equal (arg1, arg2);
7134 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
7135 int *pos, enum noside noside)
7138 int tem, tem2, tem3;
7140 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
7143 struct value **argvec;
7147 op = exp->elts[pc].opcode;
7154 unwrap_value (evaluate_subexp_standard
7155 (expect_type, exp, pos, noside));
7159 struct value *result;
7161 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
7162 /* The result type will have code OP_STRING, bashed there from
7163 OP_ARRAY. Bash it back. */
7164 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
7165 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
7171 type = exp->elts[pc + 1].type;
7172 arg1 = evaluate_subexp (type, exp, pos, noside);
7173 if (noside == EVAL_SKIP)
7175 if (type != ada_check_typedef (value_type (arg1)))
7177 if (ada_is_fixed_point_type (type))
7178 arg1 = cast_to_fixed (type, arg1);
7179 else if (ada_is_fixed_point_type (value_type (arg1)))
7180 arg1 = value_cast (type, cast_from_fixed_to_double (arg1));
7181 else if (VALUE_LVAL (arg1) == lval_memory)
7183 /* This is in case of the really obscure (and undocumented,
7184 but apparently expected) case of (Foo) Bar.all, where Bar
7185 is an integer constant and Foo is a dynamic-sized type.
7186 If we don't do this, ARG1 will simply be relabeled with
7188 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7189 return value_zero (to_static_fixed_type (type), not_lval);
7191 ada_to_fixed_value_create
7192 (type, VALUE_ADDRESS (arg1) + value_offset (arg1), 0);
7195 arg1 = value_cast (type, arg1);
7201 type = exp->elts[pc + 1].type;
7202 return ada_evaluate_subexp (type, exp, pos, noside);
7205 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7206 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
7207 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
7209 if (ada_is_fixed_point_type (value_type (arg1)))
7210 arg2 = cast_to_fixed (value_type (arg1), arg2);
7211 else if (ada_is_fixed_point_type (value_type (arg2)))
7213 (_("Fixed-point values must be assigned to fixed-point variables"));
7215 arg2 = coerce_for_assign (value_type (arg1), arg2);
7216 return ada_value_assign (arg1, arg2);
7219 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
7220 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
7221 if (noside == EVAL_SKIP)
7223 if ((ada_is_fixed_point_type (value_type (arg1))
7224 || ada_is_fixed_point_type (value_type (arg2)))
7225 && value_type (arg1) != value_type (arg2))
7226 error (_("Operands of fixed-point addition must have the same type"));
7227 return value_cast (value_type (arg1), value_add (arg1, arg2));
7230 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
7231 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
7232 if (noside == EVAL_SKIP)
7234 if ((ada_is_fixed_point_type (value_type (arg1))
7235 || ada_is_fixed_point_type (value_type (arg2)))
7236 && value_type (arg1) != value_type (arg2))
7237 error (_("Operands of fixed-point subtraction must have the same type"));
7238 return value_cast (value_type (arg1), value_sub (arg1, arg2));
7242 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7243 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7244 if (noside == EVAL_SKIP)
7246 else if (noside == EVAL_AVOID_SIDE_EFFECTS
7247 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
7248 return value_zero (value_type (arg1), not_lval);
7251 if (ada_is_fixed_point_type (value_type (arg1)))
7252 arg1 = cast_from_fixed_to_double (arg1);
7253 if (ada_is_fixed_point_type (value_type (arg2)))
7254 arg2 = cast_from_fixed_to_double (arg2);
7255 return ada_value_binop (arg1, arg2, op);
7260 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7261 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7262 if (noside == EVAL_SKIP)
7264 else if (noside == EVAL_AVOID_SIDE_EFFECTS
7265 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
7266 return value_zero (value_type (arg1), not_lval);
7268 return ada_value_binop (arg1, arg2, op);
7271 case BINOP_NOTEQUAL:
7272 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7273 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
7274 if (noside == EVAL_SKIP)
7276 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7279 tem = ada_value_equal (arg1, arg2);
7280 if (op == BINOP_NOTEQUAL)
7282 return value_from_longest (LA_BOOL_TYPE, (LONGEST) tem);
7285 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7286 if (noside == EVAL_SKIP)
7288 else if (ada_is_fixed_point_type (value_type (arg1)))
7289 return value_cast (value_type (arg1), value_neg (arg1));
7291 return value_neg (arg1);
7295 if (noside == EVAL_SKIP)
7300 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
7301 /* Only encountered when an unresolved symbol occurs in a
7302 context other than a function call, in which case, it is
7304 error (_("Unexpected unresolved symbol, %s, during evaluation"),
7305 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
7306 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7310 (to_static_fixed_type
7311 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
7317 unwrap_value (evaluate_subexp_standard
7318 (expect_type, exp, pos, noside));
7319 return ada_to_fixed_value (arg1);
7325 /* Allocate arg vector, including space for the function to be
7326 called in argvec[0] and a terminating NULL. */
7327 nargs = longest_to_int (exp->elts[pc + 1].longconst);
7329 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
7331 if (exp->elts[*pos].opcode == OP_VAR_VALUE
7332 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
7333 error (_("Unexpected unresolved symbol, %s, during evaluation"),
7334 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
7337 for (tem = 0; tem <= nargs; tem += 1)
7338 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7341 if (noside == EVAL_SKIP)
7345 if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
7346 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
7347 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
7348 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
7349 && VALUE_LVAL (argvec[0]) == lval_memory))
7350 argvec[0] = value_addr (argvec[0]);
7352 type = ada_check_typedef (value_type (argvec[0]));
7353 if (TYPE_CODE (type) == TYPE_CODE_PTR)
7355 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
7357 case TYPE_CODE_FUNC:
7358 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
7360 case TYPE_CODE_ARRAY:
7362 case TYPE_CODE_STRUCT:
7363 if (noside != EVAL_AVOID_SIDE_EFFECTS)
7364 argvec[0] = ada_value_ind (argvec[0]);
7365 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
7368 error (_("cannot subscript or call something of type `%s'"),
7369 ada_type_name (value_type (argvec[0])));
7374 switch (TYPE_CODE (type))
7376 case TYPE_CODE_FUNC:
7377 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7378 return allocate_value (TYPE_TARGET_TYPE (type));
7379 return call_function_by_hand (argvec[0], nargs, argvec + 1);
7380 case TYPE_CODE_STRUCT:
7384 arity = ada_array_arity (type);
7385 type = ada_array_element_type (type, nargs);
7387 error (_("cannot subscript or call a record"));
7389 error (_("wrong number of subscripts; expecting %d"), arity);
7390 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7391 return allocate_value (ada_aligned_type (type));
7393 unwrap_value (ada_value_subscript
7394 (argvec[0], nargs, argvec + 1));
7396 case TYPE_CODE_ARRAY:
7397 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7399 type = ada_array_element_type (type, nargs);
7401 error (_("element type of array unknown"));
7403 return allocate_value (ada_aligned_type (type));
7406 unwrap_value (ada_value_subscript
7407 (ada_coerce_to_simple_array (argvec[0]),
7408 nargs, argvec + 1));
7409 case TYPE_CODE_PTR: /* Pointer to array */
7410 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
7411 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7413 type = ada_array_element_type (type, nargs);
7415 error (_("element type of array unknown"));
7417 return allocate_value (ada_aligned_type (type));
7420 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
7421 nargs, argvec + 1));
7424 error (_("Attempt to index or call something other than an \
7425 array or function"));
7430 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7431 struct value *low_bound_val =
7432 evaluate_subexp (NULL_TYPE, exp, pos, noside);
7433 struct value *high_bound_val =
7434 evaluate_subexp (NULL_TYPE, exp, pos, noside);
7437 low_bound_val = coerce_ref (low_bound_val);
7438 high_bound_val = coerce_ref (high_bound_val);
7439 low_bound = pos_atr (low_bound_val);
7440 high_bound = pos_atr (high_bound_val);
7442 if (noside == EVAL_SKIP)
7445 /* If this is a reference to an aligner type, then remove all
7447 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
7448 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
7449 TYPE_TARGET_TYPE (value_type (array)) =
7450 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
7452 if (ada_is_packed_array_type (value_type (array)))
7453 error (_("cannot slice a packed array"));
7455 /* If this is a reference to an array or an array lvalue,
7456 convert to a pointer. */
7457 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
7458 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
7459 && VALUE_LVAL (array) == lval_memory))
7460 array = value_addr (array);
7462 if (noside == EVAL_AVOID_SIDE_EFFECTS
7463 && ada_is_array_descriptor_type (ada_check_typedef
7464 (value_type (array))))
7465 return empty_array (ada_type_of_array (array, 0), low_bound);
7467 array = ada_coerce_to_simple_array_ptr (array);
7469 /* If we have more than one level of pointer indirection,
7470 dereference the value until we get only one level. */
7471 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
7472 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
7474 array = value_ind (array);
7476 /* Make sure we really do have an array type before going further,
7477 to avoid a SEGV when trying to get the index type or the target
7478 type later down the road if the debug info generated by
7479 the compiler is incorrect or incomplete. */
7480 if (!ada_is_simple_array_type (value_type (array)))
7481 error (_("cannot take slice of non-array"));
7483 if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
7485 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
7486 return empty_array (TYPE_TARGET_TYPE (value_type (array)),
7490 struct type *arr_type0 =
7491 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
7493 return ada_value_slice_ptr (array, arr_type0,
7498 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7500 else if (high_bound < low_bound)
7501 return empty_array (value_type (array), low_bound);
7503 return ada_value_slice (array, (int) low_bound, (int) high_bound);
7508 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7509 type = exp->elts[pc + 1].type;
7511 if (noside == EVAL_SKIP)
7514 switch (TYPE_CODE (type))
7517 lim_warning (_("Membership test incompletely implemented; \
7518 always returns true"));
7519 return value_from_longest (builtin_type_int, (LONGEST) 1);
7521 case TYPE_CODE_RANGE:
7522 arg2 = value_from_longest (builtin_type_int, TYPE_LOW_BOUND (type));
7523 arg3 = value_from_longest (builtin_type_int,
7524 TYPE_HIGH_BOUND (type));
7526 value_from_longest (builtin_type_int,
7527 (value_less (arg1, arg3)
7528 || value_equal (arg1, arg3))
7529 && (value_less (arg2, arg1)
7530 || value_equal (arg2, arg1)));
7533 case BINOP_IN_BOUNDS:
7535 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7536 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7538 if (noside == EVAL_SKIP)
7541 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7542 return value_zero (builtin_type_int, not_lval);
7544 tem = longest_to_int (exp->elts[pc + 1].longconst);
7546 if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
7547 error (_("invalid dimension number to 'range"));
7549 arg3 = ada_array_bound (arg2, tem, 1);
7550 arg2 = ada_array_bound (arg2, tem, 0);
7553 value_from_longest (builtin_type_int,
7554 (value_less (arg1, arg3)
7555 || value_equal (arg1, arg3))
7556 && (value_less (arg2, arg1)
7557 || value_equal (arg2, arg1)));
7559 case TERNOP_IN_RANGE:
7560 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7561 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7562 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7564 if (noside == EVAL_SKIP)
7568 value_from_longest (builtin_type_int,
7569 (value_less (arg1, arg3)
7570 || value_equal (arg1, arg3))
7571 && (value_less (arg2, arg1)
7572 || value_equal (arg2, arg1)));
7578 struct type *type_arg;
7579 if (exp->elts[*pos].opcode == OP_TYPE)
7581 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
7583 type_arg = exp->elts[pc + 2].type;
7587 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7591 if (exp->elts[*pos].opcode != OP_LONG)
7592 error (_("Invalid operand to '%s"), ada_attribute_name (op));
7593 tem = longest_to_int (exp->elts[*pos + 2].longconst);
7596 if (noside == EVAL_SKIP)
7599 if (type_arg == NULL)
7601 arg1 = ada_coerce_ref (arg1);
7603 if (ada_is_packed_array_type (value_type (arg1)))
7604 arg1 = ada_coerce_to_simple_array (arg1);
7606 if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
7607 error (_("invalid dimension number to '%s"),
7608 ada_attribute_name (op));
7610 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7612 type = ada_index_type (value_type (arg1), tem);
7615 (_("attempt to take bound of something that is not an array"));
7616 return allocate_value (type);
7621 default: /* Should never happen. */
7622 error (_("unexpected attribute encountered"));
7624 return ada_array_bound (arg1, tem, 0);
7626 return ada_array_bound (arg1, tem, 1);
7628 return ada_array_length (arg1, tem);
7631 else if (discrete_type_p (type_arg))
7633 struct type *range_type;
7634 char *name = ada_type_name (type_arg);
7636 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
7638 to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
7639 if (range_type == NULL)
7640 range_type = type_arg;
7644 error (_("unexpected attribute encountered"));
7646 return discrete_type_low_bound (range_type);
7648 return discrete_type_high_bound (range_type);
7650 error (_("the 'length attribute applies only to array types"));
7653 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
7654 error (_("unimplemented type attribute"));
7659 if (ada_is_packed_array_type (type_arg))
7660 type_arg = decode_packed_array_type (type_arg);
7662 if (tem < 1 || tem > ada_array_arity (type_arg))
7663 error (_("invalid dimension number to '%s"),
7664 ada_attribute_name (op));
7666 type = ada_index_type (type_arg, tem);
7669 (_("attempt to take bound of something that is not an array"));
7670 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7671 return allocate_value (type);
7676 error (_("unexpected attribute encountered"));
7678 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
7679 return value_from_longest (type, low);
7681 high = ada_array_bound_from_type (type_arg, tem, 1, &type);
7682 return value_from_longest (type, high);
7684 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
7685 high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
7686 return value_from_longest (type, high - low + 1);
7692 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7693 if (noside == EVAL_SKIP)
7696 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7697 return value_zero (ada_tag_type (arg1), not_lval);
7699 return ada_value_tag (arg1);
7703 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
7704 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7705 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7706 if (noside == EVAL_SKIP)
7708 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7709 return value_zero (value_type (arg1), not_lval);
7711 return value_binop (arg1, arg2,
7712 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
7714 case OP_ATR_MODULUS:
7716 struct type *type_arg = exp->elts[pc + 2].type;
7717 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
7719 if (noside == EVAL_SKIP)
7722 if (!ada_is_modular_type (type_arg))
7723 error (_("'modulus must be applied to modular type"));
7725 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
7726 ada_modulus (type_arg));
7731 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
7732 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7733 if (noside == EVAL_SKIP)
7735 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7736 return value_zero (builtin_type_int, not_lval);
7738 return value_pos_atr (arg1);
7741 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7742 if (noside == EVAL_SKIP)
7744 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7745 return value_zero (builtin_type_int, not_lval);
7747 return value_from_longest (builtin_type_int,
7749 * TYPE_LENGTH (value_type (arg1)));
7752 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
7753 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7754 type = exp->elts[pc + 2].type;
7755 if (noside == EVAL_SKIP)
7757 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7758 return value_zero (type, not_lval);
7760 return value_val_atr (type, arg1);
7763 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7764 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7765 if (noside == EVAL_SKIP)
7767 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7768 return value_zero (value_type (arg1), not_lval);
7770 return value_binop (arg1, arg2, op);
7773 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7774 if (noside == EVAL_SKIP)
7780 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7781 if (noside == EVAL_SKIP)
7783 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
7784 return value_neg (arg1);
7789 if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR)
7790 expect_type = TYPE_TARGET_TYPE (ada_check_typedef (expect_type));
7791 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
7792 if (noside == EVAL_SKIP)
7794 type = ada_check_typedef (value_type (arg1));
7795 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7797 if (ada_is_array_descriptor_type (type))
7798 /* GDB allows dereferencing GNAT array descriptors. */
7800 struct type *arrType = ada_type_of_array (arg1, 0);
7801 if (arrType == NULL)
7802 error (_("Attempt to dereference null array pointer."));
7803 return value_at_lazy (arrType, 0);
7805 else if (TYPE_CODE (type) == TYPE_CODE_PTR
7806 || TYPE_CODE (type) == TYPE_CODE_REF
7807 /* In C you can dereference an array to get the 1st elt. */
7808 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
7810 type = to_static_fixed_type
7812 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
7814 return value_zero (type, lval_memory);
7816 else if (TYPE_CODE (type) == TYPE_CODE_INT)
7817 /* GDB allows dereferencing an int. */
7818 return value_zero (builtin_type_int, lval_memory);
7820 error (_("Attempt to take contents of a non-pointer value."));
7822 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
7823 type = ada_check_typedef (value_type (arg1));
7825 if (ada_is_array_descriptor_type (type))
7826 /* GDB allows dereferencing GNAT array descriptors. */
7827 return ada_coerce_to_simple_array (arg1);
7829 return ada_value_ind (arg1);
7831 case STRUCTOP_STRUCT:
7832 tem = longest_to_int (exp->elts[pc + 1].longconst);
7833 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
7834 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
7835 if (noside == EVAL_SKIP)
7837 if (noside == EVAL_AVOID_SIDE_EFFECTS)
7839 struct type *type1 = value_type (arg1);
7840 if (ada_is_tagged_type (type1, 1))
7842 type = ada_lookup_struct_elt_type (type1,
7843 &exp->elts[pc + 2].string,
7846 /* In this case, we assume that the field COULD exist
7847 in some extension of the type. Return an object of
7848 "type" void, which will match any formal
7849 (see ada_type_match). */
7850 return value_zero (builtin_type_void, lval_memory);
7854 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
7857 return value_zero (ada_aligned_type (type), lval_memory);
7861 ada_to_fixed_value (unwrap_value
7862 (ada_value_struct_elt
7863 (arg1, &exp->elts[pc + 2].string, "record")));
7865 /* The value is not supposed to be used. This is here to make it
7866 easier to accommodate expressions that contain types. */
7868 if (noside == EVAL_SKIP)
7870 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
7871 return allocate_value (builtin_type_void);
7873 error (_("Attempt to use a type name as an expression"));
7877 return value_from_longest (builtin_type_long, (LONGEST) 1);
7883 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
7884 type name that encodes the 'small and 'delta information.
7885 Otherwise, return NULL. */
7888 fixed_type_info (struct type *type)
7890 const char *name = ada_type_name (type);
7891 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
7893 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
7895 const char *tail = strstr (name, "___XF_");
7901 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
7902 return fixed_type_info (TYPE_TARGET_TYPE (type));
7907 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
7910 ada_is_fixed_point_type (struct type *type)
7912 return fixed_type_info (type) != NULL;
7915 /* Return non-zero iff TYPE represents a System.Address type. */
7918 ada_is_system_address_type (struct type *type)
7920 return (TYPE_NAME (type)
7921 && strcmp (TYPE_NAME (type), "system__address") == 0);
7924 /* Assuming that TYPE is the representation of an Ada fixed-point
7925 type, return its delta, or -1 if the type is malformed and the
7926 delta cannot be determined. */
7929 ada_delta (struct type *type)
7931 const char *encoding = fixed_type_info (type);
7934 if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2)
7937 return (DOUBLEST) num / (DOUBLEST) den;
7940 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
7941 factor ('SMALL value) associated with the type. */
7944 scaling_factor (struct type *type)
7946 const char *encoding = fixed_type_info (type);
7947 unsigned long num0, den0, num1, den1;
7950 n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1);
7955 return (DOUBLEST) num1 / (DOUBLEST) den1;
7957 return (DOUBLEST) num0 / (DOUBLEST) den0;
7961 /* Assuming that X is the representation of a value of fixed-point
7962 type TYPE, return its floating-point equivalent. */
7965 ada_fixed_to_float (struct type *type, LONGEST x)
7967 return (DOUBLEST) x *scaling_factor (type);
7970 /* The representation of a fixed-point value of type TYPE
7971 corresponding to the value X. */
7974 ada_float_to_fixed (struct type *type, DOUBLEST x)
7976 return (LONGEST) (x / scaling_factor (type) + 0.5);
7980 /* VAX floating formats */
7982 /* Non-zero iff TYPE represents one of the special VAX floating-point
7986 ada_is_vax_floating_type (struct type *type)
7989 (ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
7992 && (TYPE_CODE (type) == TYPE_CODE_INT
7993 || TYPE_CODE (type) == TYPE_CODE_RANGE)
7994 && strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
7997 /* The type of special VAX floating-point type this is, assuming
7998 ada_is_vax_floating_point. */
8001 ada_vax_float_type_suffix (struct type *type)
8003 return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
8006 /* A value representing the special debugging function that outputs
8007 VAX floating-point values of the type represented by TYPE. Assumes
8008 ada_is_vax_floating_type (TYPE). */
8011 ada_vax_float_print_function (struct type *type)
8013 switch (ada_vax_float_type_suffix (type))
8016 return get_var_value ("DEBUG_STRING_F", 0);
8018 return get_var_value ("DEBUG_STRING_D", 0);
8020 return get_var_value ("DEBUG_STRING_G", 0);
8022 error (_("invalid VAX floating-point type"));
8029 /* Scan STR beginning at position K for a discriminant name, and
8030 return the value of that discriminant field of DVAL in *PX. If
8031 PNEW_K is not null, put the position of the character beyond the
8032 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
8033 not alter *PX and *PNEW_K if unsuccessful. */
8036 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
8039 static char *bound_buffer = NULL;
8040 static size_t bound_buffer_len = 0;
8043 struct value *bound_val;
8045 if (dval == NULL || str == NULL || str[k] == '\0')
8048 pend = strstr (str + k, "__");
8052 k += strlen (bound);
8056 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
8057 bound = bound_buffer;
8058 strncpy (bound_buffer, str + k, pend - (str + k));
8059 bound[pend - (str + k)] = '\0';
8063 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
8064 if (bound_val == NULL)
8067 *px = value_as_long (bound_val);
8073 /* Value of variable named NAME in the current environment. If
8074 no such variable found, then if ERR_MSG is null, returns 0, and
8075 otherwise causes an error with message ERR_MSG. */
8077 static struct value *
8078 get_var_value (char *name, char *err_msg)
8080 struct ada_symbol_info *syms;
8083 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
8088 if (err_msg == NULL)
8091 error ("%s", err_msg);
8094 return value_of_variable (syms[0].sym, syms[0].block);
8097 /* Value of integer variable named NAME in the current environment. If
8098 no such variable found, returns 0, and sets *FLAG to 0. If
8099 successful, sets *FLAG to 1. */
8102 get_int_var_value (char *name, int *flag)
8104 struct value *var_val = get_var_value (name, 0);
8116 return value_as_long (var_val);
8121 /* Return a range type whose base type is that of the range type named
8122 NAME in the current environment, and whose bounds are calculated
8123 from NAME according to the GNAT range encoding conventions.
8124 Extract discriminant values, if needed, from DVAL. If a new type
8125 must be created, allocate in OBJFILE's space. The bounds
8126 information, in general, is encoded in NAME, the base type given in
8127 the named range type. */
8129 static struct type *
8130 to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
8132 struct type *raw_type = ada_find_any_type (name);
8133 struct type *base_type;
8136 if (raw_type == NULL)
8137 base_type = builtin_type_int;
8138 else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
8139 base_type = TYPE_TARGET_TYPE (raw_type);
8141 base_type = raw_type;
8143 subtype_info = strstr (name, "___XD");
8144 if (subtype_info == NULL)
8148 static char *name_buf = NULL;
8149 static size_t name_len = 0;
8150 int prefix_len = subtype_info - name;
8156 GROW_VECT (name_buf, name_len, prefix_len + 5);
8157 strncpy (name_buf, name, prefix_len);
8158 name_buf[prefix_len] = '\0';
8161 bounds_str = strchr (subtype_info, '_');
8164 if (*subtype_info == 'L')
8166 if (!ada_scan_number (bounds_str, n, &L, &n)
8167 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
8169 if (bounds_str[n] == '_')
8171 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
8178 strcpy (name_buf + prefix_len, "___L");
8179 L = get_int_var_value (name_buf, &ok);
8182 lim_warning (_("Unknown lower bound, using 1."));
8187 if (*subtype_info == 'U')
8189 if (!ada_scan_number (bounds_str, n, &U, &n)
8190 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
8196 strcpy (name_buf + prefix_len, "___U");
8197 U = get_int_var_value (name_buf, &ok);
8200 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
8205 if (objfile == NULL)
8206 objfile = TYPE_OBJFILE (base_type);
8207 type = create_range_type (alloc_type (objfile), base_type, L, U);
8208 TYPE_NAME (type) = name;
8213 /* True iff NAME is the name of a range type. */
8216 ada_is_range_type_name (const char *name)
8218 return (name != NULL && strstr (name, "___XD"));
8224 /* True iff TYPE is an Ada modular type. */
8227 ada_is_modular_type (struct type *type)
8229 struct type *subranged_type = base_type (type);
8231 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
8232 && TYPE_CODE (subranged_type) != TYPE_CODE_ENUM
8233 && TYPE_UNSIGNED (subranged_type));
8236 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
8239 ada_modulus (struct type * type)
8241 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
8245 /* Information about operators given special treatment in functions
8247 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
8249 #define ADA_OPERATORS \
8250 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
8251 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
8252 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
8253 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
8254 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
8255 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
8256 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
8257 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
8258 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
8259 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
8260 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
8261 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
8262 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
8263 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
8264 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
8265 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0)
8268 ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
8270 switch (exp->elts[pc - 1].opcode)
8273 operator_length_standard (exp, pc, oplenp, argsp);
8276 #define OP_DEFN(op, len, args, binop) \
8277 case op: *oplenp = len; *argsp = args; break;
8284 ada_op_name (enum exp_opcode opcode)
8289 return op_name_standard (opcode);
8290 #define OP_DEFN(op, len, args, binop) case op: return #op;
8296 /* As for operator_length, but assumes PC is pointing at the first
8297 element of the operator, and gives meaningful results only for the
8298 Ada-specific operators. */
8301 ada_forward_operator_length (struct expression *exp, int pc,
8302 int *oplenp, int *argsp)
8304 switch (exp->elts[pc].opcode)
8307 *oplenp = *argsp = 0;
8309 #define OP_DEFN(op, len, args, binop) \
8310 case op: *oplenp = len; *argsp = args; break;
8317 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
8319 enum exp_opcode op = exp->elts[elt].opcode;
8324 ada_forward_operator_length (exp, elt, &oplen, &nargs);
8328 /* Ada attributes ('Foo). */
8335 case OP_ATR_MODULUS:
8344 /* XXX: gdb_sprint_host_address, type_sprint */
8345 fprintf_filtered (stream, _("Type @"));
8346 gdb_print_host_address (exp->elts[pc + 1].type, stream);
8347 fprintf_filtered (stream, " (");
8348 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
8349 fprintf_filtered (stream, ")");
8351 case BINOP_IN_BOUNDS:
8352 fprintf_filtered (stream, " (%d)", (int) exp->elts[pc + 2].longconst);
8354 case TERNOP_IN_RANGE:
8358 return dump_subexp_body_standard (exp, stream, elt);
8362 for (i = 0; i < nargs; i += 1)
8363 elt = dump_subexp (exp, stream, elt);
8368 /* The Ada extension of print_subexp (q.v.). */
8371 ada_print_subexp (struct expression *exp, int *pos,
8372 struct ui_file *stream, enum precedence prec)
8376 enum exp_opcode op = exp->elts[pc].opcode;
8378 ada_forward_operator_length (exp, pc, &oplen, &nargs);
8383 print_subexp_standard (exp, pos, stream, prec);
8388 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
8391 case BINOP_IN_BOUNDS:
8392 /* XXX: sprint_subexp */
8394 print_subexp (exp, pos, stream, PREC_SUFFIX);
8395 fputs_filtered (" in ", stream);
8396 print_subexp (exp, pos, stream, PREC_SUFFIX);
8397 fputs_filtered ("'range", stream);
8398 if (exp->elts[pc + 1].longconst > 1)
8399 fprintf_filtered (stream, "(%ld)",
8400 (long) exp->elts[pc + 1].longconst);
8403 case TERNOP_IN_RANGE:
8405 if (prec >= PREC_EQUAL)
8406 fputs_filtered ("(", stream);
8407 /* XXX: sprint_subexp */
8408 print_subexp (exp, pos, stream, PREC_SUFFIX);
8409 fputs_filtered (" in ", stream);
8410 print_subexp (exp, pos, stream, PREC_EQUAL);
8411 fputs_filtered (" .. ", stream);
8412 print_subexp (exp, pos, stream, PREC_EQUAL);
8413 if (prec >= PREC_EQUAL)
8414 fputs_filtered (")", stream);
8423 case OP_ATR_MODULUS:
8429 if (exp->elts[*pos].opcode == OP_TYPE)
8431 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
8432 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
8436 print_subexp (exp, pos, stream, PREC_SUFFIX);
8437 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
8441 for (tem = 1; tem < nargs; tem += 1)
8443 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
8444 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
8446 fputs_filtered (")", stream);
8452 type_print (exp->elts[pc + 1].type, "", stream, 0);
8453 fputs_filtered ("'(", stream);
8454 print_subexp (exp, pos, stream, PREC_PREFIX);
8455 fputs_filtered (")", stream);
8460 /* XXX: sprint_subexp */
8461 print_subexp (exp, pos, stream, PREC_SUFFIX);
8462 fputs_filtered (" in ", stream);
8463 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
8468 /* Table mapping opcodes into strings for printing operators
8469 and precedences of the operators. */
8471 static const struct op_print ada_op_print_tab[] = {
8472 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
8473 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
8474 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
8475 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
8476 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
8477 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
8478 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
8479 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
8480 {"<=", BINOP_LEQ, PREC_ORDER, 0},
8481 {">=", BINOP_GEQ, PREC_ORDER, 0},
8482 {">", BINOP_GTR, PREC_ORDER, 0},
8483 {"<", BINOP_LESS, PREC_ORDER, 0},
8484 {">>", BINOP_RSH, PREC_SHIFT, 0},
8485 {"<<", BINOP_LSH, PREC_SHIFT, 0},
8486 {"+", BINOP_ADD, PREC_ADD, 0},
8487 {"-", BINOP_SUB, PREC_ADD, 0},
8488 {"&", BINOP_CONCAT, PREC_ADD, 0},
8489 {"*", BINOP_MUL, PREC_MUL, 0},
8490 {"/", BINOP_DIV, PREC_MUL, 0},
8491 {"rem", BINOP_REM, PREC_MUL, 0},
8492 {"mod", BINOP_MOD, PREC_MUL, 0},
8493 {"**", BINOP_EXP, PREC_REPEAT, 0},
8494 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
8495 {"-", UNOP_NEG, PREC_PREFIX, 0},
8496 {"+", UNOP_PLUS, PREC_PREFIX, 0},
8497 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
8498 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
8499 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
8500 {".all", UNOP_IND, PREC_SUFFIX, 1},
8501 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
8502 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
8506 /* Fundamental Ada Types */
8508 /* Create a fundamental Ada type using default reasonable for the current
8511 Some object/debugging file formats (DWARF version 1, COFF, etc) do not
8512 define fundamental types such as "int" or "double". Others (stabs or
8513 DWARF version 2, etc) do define fundamental types. For the formats which
8514 don't provide fundamental types, gdb can create such types using this
8517 FIXME: Some compilers distinguish explicitly signed integral types
8518 (signed short, signed int, signed long) from "regular" integral types
8519 (short, int, long) in the debugging information. There is some dis-
8520 agreement as to how useful this feature is. In particular, gcc does
8521 not support this. Also, only some debugging formats allow the
8522 distinction to be passed on to a debugger. For now, we always just
8523 use "short", "int", or "long" as the type name, for both the implicit
8524 and explicitly signed types. This also makes life easier for the
8525 gdb test suite since we don't have to account for the differences
8526 in output depending upon what the compiler and debugging format
8527 support. We will probably have to re-examine the issue when gdb
8528 starts taking it's fundamental type information directly from the
8529 debugging information supplied by the compiler. fnf@cygnus.com */
8531 static struct type *
8532 ada_create_fundamental_type (struct objfile *objfile, int typeid)
8534 struct type *type = NULL;
8539 /* FIXME: For now, if we are asked to produce a type not in this
8540 language, create the equivalent of a C integer type with the
8541 name "<?type?>". When all the dust settles from the type
8542 reconstruction work, this should probably become an error. */
8543 type = init_type (TYPE_CODE_INT,
8544 TARGET_INT_BIT / TARGET_CHAR_BIT,
8545 0, "<?type?>", objfile);
8546 warning (_("internal error: no Ada fundamental type %d"), typeid);
8549 type = init_type (TYPE_CODE_VOID,
8550 TARGET_CHAR_BIT / TARGET_CHAR_BIT,
8551 0, "void", objfile);
8554 type = init_type (TYPE_CODE_INT,
8555 TARGET_CHAR_BIT / TARGET_CHAR_BIT,
8556 0, "character", objfile);
8558 case FT_SIGNED_CHAR:
8559 type = init_type (TYPE_CODE_INT,
8560 TARGET_CHAR_BIT / TARGET_CHAR_BIT,
8561 0, "signed char", objfile);
8563 case FT_UNSIGNED_CHAR:
8564 type = init_type (TYPE_CODE_INT,
8565 TARGET_CHAR_BIT / TARGET_CHAR_BIT,
8566 TYPE_FLAG_UNSIGNED, "unsigned char", objfile);
8569 type = init_type (TYPE_CODE_INT,
8570 TARGET_SHORT_BIT / TARGET_CHAR_BIT,
8571 0, "short_integer", objfile);
8573 case FT_SIGNED_SHORT:
8574 type = init_type (TYPE_CODE_INT,
8575 TARGET_SHORT_BIT / TARGET_CHAR_BIT,
8576 0, "short_integer", objfile);
8578 case FT_UNSIGNED_SHORT:
8579 type = init_type (TYPE_CODE_INT,
8580 TARGET_SHORT_BIT / TARGET_CHAR_BIT,
8581 TYPE_FLAG_UNSIGNED, "unsigned short", objfile);
8584 type = init_type (TYPE_CODE_INT,
8585 TARGET_INT_BIT / TARGET_CHAR_BIT,
8586 0, "integer", objfile);
8588 case FT_SIGNED_INTEGER:
8589 type = init_type (TYPE_CODE_INT, TARGET_INT_BIT /
8591 0, "integer", objfile); /* FIXME -fnf */
8593 case FT_UNSIGNED_INTEGER:
8594 type = init_type (TYPE_CODE_INT,
8595 TARGET_INT_BIT / TARGET_CHAR_BIT,
8596 TYPE_FLAG_UNSIGNED, "unsigned int", objfile);
8599 type = init_type (TYPE_CODE_INT,
8600 TARGET_LONG_BIT / TARGET_CHAR_BIT,
8601 0, "long_integer", objfile);
8603 case FT_SIGNED_LONG:
8604 type = init_type (TYPE_CODE_INT,
8605 TARGET_LONG_BIT / TARGET_CHAR_BIT,
8606 0, "long_integer", objfile);
8608 case FT_UNSIGNED_LONG:
8609 type = init_type (TYPE_CODE_INT,
8610 TARGET_LONG_BIT / TARGET_CHAR_BIT,
8611 TYPE_FLAG_UNSIGNED, "unsigned long", objfile);
8614 type = init_type (TYPE_CODE_INT,
8615 TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT,
8616 0, "long_long_integer", objfile);
8618 case FT_SIGNED_LONG_LONG:
8619 type = init_type (TYPE_CODE_INT,
8620 TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT,
8621 0, "long_long_integer", objfile);
8623 case FT_UNSIGNED_LONG_LONG:
8624 type = init_type (TYPE_CODE_INT,
8625 TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT,
8626 TYPE_FLAG_UNSIGNED, "unsigned long long", objfile);
8629 type = init_type (TYPE_CODE_FLT,
8630 TARGET_FLOAT_BIT / TARGET_CHAR_BIT,
8631 0, "float", objfile);
8633 case FT_DBL_PREC_FLOAT:
8634 type = init_type (TYPE_CODE_FLT,
8635 TARGET_DOUBLE_BIT / TARGET_CHAR_BIT,
8636 0, "long_float", objfile);
8638 case FT_EXT_PREC_FLOAT:
8639 type = init_type (TYPE_CODE_FLT,
8640 TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT,
8641 0, "long_long_float", objfile);
8647 enum ada_primitive_types {
8648 ada_primitive_type_int,
8649 ada_primitive_type_long,
8650 ada_primitive_type_short,
8651 ada_primitive_type_char,
8652 ada_primitive_type_float,
8653 ada_primitive_type_double,
8654 ada_primitive_type_void,
8655 ada_primitive_type_long_long,
8656 ada_primitive_type_long_double,
8657 ada_primitive_type_natural,
8658 ada_primitive_type_positive,
8659 ada_primitive_type_system_address,
8660 nr_ada_primitive_types
8664 ada_language_arch_info (struct gdbarch *current_gdbarch,
8665 struct language_arch_info *lai)
8667 const struct builtin_type *builtin = builtin_type (current_gdbarch);
8668 lai->primitive_type_vector
8669 = GDBARCH_OBSTACK_CALLOC (current_gdbarch, nr_ada_primitive_types + 1,
8671 lai->primitive_type_vector [ada_primitive_type_int] =
8672 init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT,
8673 0, "integer", (struct objfile *) NULL);
8674 lai->primitive_type_vector [ada_primitive_type_long] =
8675 init_type (TYPE_CODE_INT, TARGET_LONG_BIT / TARGET_CHAR_BIT,
8676 0, "long_integer", (struct objfile *) NULL);
8677 lai->primitive_type_vector [ada_primitive_type_short] =
8678 init_type (TYPE_CODE_INT, TARGET_SHORT_BIT / TARGET_CHAR_BIT,
8679 0, "short_integer", (struct objfile *) NULL);
8680 lai->string_char_type =
8681 lai->primitive_type_vector [ada_primitive_type_char] =
8682 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
8683 0, "character", (struct objfile *) NULL);
8684 lai->primitive_type_vector [ada_primitive_type_float] =
8685 init_type (TYPE_CODE_FLT, TARGET_FLOAT_BIT / TARGET_CHAR_BIT,
8686 0, "float", (struct objfile *) NULL);
8687 lai->primitive_type_vector [ada_primitive_type_double] =
8688 init_type (TYPE_CODE_FLT, TARGET_DOUBLE_BIT / TARGET_CHAR_BIT,
8689 0, "long_float", (struct objfile *) NULL);
8690 lai->primitive_type_vector [ada_primitive_type_long_long] =
8691 init_type (TYPE_CODE_INT, TARGET_LONG_LONG_BIT / TARGET_CHAR_BIT,
8692 0, "long_long_integer", (struct objfile *) NULL);
8693 lai->primitive_type_vector [ada_primitive_type_long_double] =
8694 init_type (TYPE_CODE_FLT, TARGET_LONG_DOUBLE_BIT / TARGET_CHAR_BIT,
8695 0, "long_long_float", (struct objfile *) NULL);
8696 lai->primitive_type_vector [ada_primitive_type_natural] =
8697 init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT,
8698 0, "natural", (struct objfile *) NULL);
8699 lai->primitive_type_vector [ada_primitive_type_positive] =
8700 init_type (TYPE_CODE_INT, TARGET_INT_BIT / TARGET_CHAR_BIT,
8701 0, "positive", (struct objfile *) NULL);
8702 lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
8704 lai->primitive_type_vector [ada_primitive_type_system_address] =
8705 lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
8706 (struct objfile *) NULL));
8707 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
8708 = "system__address";
8711 /* Language vector */
8713 /* Not really used, but needed in the ada_language_defn. */
8716 emit_char (int c, struct ui_file *stream, int quoter)
8718 ada_emit_char (c, stream, quoter, 1);
8724 warnings_issued = 0;
8725 return ada_parse ();
8728 static const struct exp_descriptor ada_exp_descriptor = {
8730 ada_operator_length,
8732 ada_dump_subexp_body,
8736 const struct language_defn ada_language_defn = {
8737 "ada", /* Language name */
8742 case_sensitive_on, /* Yes, Ada is case-insensitive, but
8743 that's not quite what this means. */
8745 &ada_exp_descriptor,
8749 ada_printchar, /* Print a character constant */
8750 ada_printstr, /* Function to print string constant */
8751 emit_char, /* Function to print single char (not used) */
8752 ada_create_fundamental_type, /* Create fundamental type in this language */
8753 ada_print_type, /* Print a type using appropriate syntax */
8754 ada_val_print, /* Print a value using appropriate syntax */
8755 ada_value_print, /* Print a top-level value */
8756 NULL, /* Language specific skip_trampoline */
8757 NULL, /* value_of_this */
8758 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
8759 basic_lookup_transparent_type, /* lookup_transparent_type */
8760 ada_la_decode, /* Language specific symbol demangler */
8761 NULL, /* Language specific class_name_from_physname */
8762 ada_op_print_tab, /* expression operators for printing */
8763 0, /* c-style arrays */
8764 1, /* String lower bound */
8766 ada_get_gdb_completer_word_break_characters,
8767 ada_language_arch_info,
8772 _initialize_ada_language (void)
8774 add_language (&ada_language_defn);
8776 varsize_limit = 65536;
8778 obstack_init (&symbol_list_obstack);
8780 decoded_names_store = htab_create_alloc
8781 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
8782 NULL, xcalloc, xfree);