1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2014 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_regex.h"
29 #include "expression.h"
30 #include "parser-defs.h"
37 #include "breakpoint.h"
40 #include "gdb_obstack.h"
42 #include "completer.h"
47 #include "dictionary.h"
55 #include "typeprint.h"
59 #include "mi/mi-common.h"
60 #include "arch-utils.h"
61 #include "cli/cli-utils.h"
63 /* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
67 #ifndef TRUNCATION_TOWARDS_ZERO
68 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
71 static struct type *desc_base_type (struct type *);
73 static struct type *desc_bounds_type (struct type *);
75 static struct value *desc_bounds (struct value *);
77 static int fat_pntr_bounds_bitpos (struct type *);
79 static int fat_pntr_bounds_bitsize (struct type *);
81 static struct type *desc_data_target_type (struct type *);
83 static struct value *desc_data (struct value *);
85 static int fat_pntr_data_bitpos (struct type *);
87 static int fat_pntr_data_bitsize (struct type *);
89 static struct value *desc_one_bound (struct value *, int, int);
91 static int desc_bound_bitpos (struct type *, int, int);
93 static int desc_bound_bitsize (struct type *, int, int);
95 static struct type *desc_index_type (struct type *, int);
97 static int desc_arity (struct type *);
99 static int ada_type_match (struct type *, struct type *, int);
101 static int ada_args_match (struct symbol *, struct value **, int);
103 static int full_match (const char *, const char *);
105 static struct value *make_array_descriptor (struct type *, struct value *);
107 static void ada_add_block_symbols (struct obstack *,
108 const struct block *, const char *,
109 domain_enum, struct objfile *, int);
111 static int is_nonfunction (struct ada_symbol_info *, int);
113 static void add_defn_to_vec (struct obstack *, struct symbol *,
114 const struct block *);
116 static int num_defns_collected (struct obstack *);
118 static struct ada_symbol_info *defns_collected (struct obstack *, int);
120 static struct value *resolve_subexp (struct expression **, int *, int,
123 static void replace_operator_with_call (struct expression **, int, int, int,
124 struct symbol *, const struct block *);
126 static int possible_user_operator_p (enum exp_opcode, struct value **);
128 static char *ada_op_name (enum exp_opcode);
130 static const char *ada_decoded_op_name (enum exp_opcode);
132 static int numeric_type_p (struct type *);
134 static int integer_type_p (struct type *);
136 static int scalar_type_p (struct type *);
138 static int discrete_type_p (struct type *);
140 static enum ada_renaming_category parse_old_style_renaming (struct type *,
145 static struct symbol *find_old_style_renaming_symbol (const char *,
146 const struct block *);
148 static struct type *ada_lookup_struct_elt_type (struct type *, char *,
151 static struct value *evaluate_subexp_type (struct expression *, int *);
153 static struct type *ada_find_parallel_type_with_name (struct type *,
156 static int is_dynamic_field (struct type *, int);
158 static struct type *to_fixed_variant_branch_type (struct type *,
160 CORE_ADDR, struct value *);
162 static struct type *to_fixed_array_type (struct type *, struct value *, int);
164 static struct type *to_fixed_range_type (struct type *, struct value *);
166 static struct type *to_static_fixed_type (struct type *);
167 static struct type *static_unwrap_type (struct type *type);
169 static struct value *unwrap_value (struct value *);
171 static struct type *constrained_packed_array_type (struct type *, long *);
173 static struct type *decode_constrained_packed_array_type (struct type *);
175 static long decode_packed_array_bitsize (struct type *);
177 static struct value *decode_constrained_packed_array (struct value *);
179 static int ada_is_packed_array_type (struct type *);
181 static int ada_is_unconstrained_packed_array_type (struct type *);
183 static struct value *value_subscript_packed (struct value *, int,
186 static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int);
188 static struct value *coerce_unspec_val_to_type (struct value *,
191 static struct value *get_var_value (char *, char *);
193 static int lesseq_defined_than (struct symbol *, struct symbol *);
195 static int equiv_types (struct type *, struct type *);
197 static int is_name_suffix (const char *);
199 static int advance_wild_match (const char **, const char *, int);
201 static int wild_match (const char *, const char *);
203 static struct value *ada_coerce_ref (struct value *);
205 static LONGEST pos_atr (struct value *);
207 static struct value *value_pos_atr (struct type *, struct value *);
209 static struct value *value_val_atr (struct type *, struct value *);
211 static struct symbol *standard_lookup (const char *, const struct block *,
214 static struct value *ada_search_struct_field (char *, struct value *, int,
217 static struct value *ada_value_primitive_field (struct value *, int, int,
220 static int find_struct_field (const char *, struct type *, int,
221 struct type **, int *, int *, int *, int *);
223 static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
226 static int ada_resolve_function (struct ada_symbol_info *, int,
227 struct value **, int, const char *,
230 static int ada_is_direct_array_type (struct type *);
232 static void ada_language_arch_info (struct gdbarch *,
233 struct language_arch_info *);
235 static void check_size (const struct type *);
237 static struct value *ada_index_struct_field (int, struct value *, int,
240 static struct value *assign_aggregate (struct value *, struct value *,
244 static void aggregate_assign_from_choices (struct value *, struct value *,
246 int *, LONGEST *, int *,
247 int, LONGEST, LONGEST);
249 static void aggregate_assign_positional (struct value *, struct value *,
251 int *, LONGEST *, int *, int,
255 static void aggregate_assign_others (struct value *, struct value *,
257 int *, LONGEST *, int, LONGEST, LONGEST);
260 static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
263 static struct value *ada_evaluate_subexp (struct type *, struct expression *,
266 static void ada_forward_operator_length (struct expression *, int, int *,
269 static struct type *ada_find_any_type (const char *name);
272 /* The result of a symbol lookup to be stored in our symbol cache. */
276 /* The name used to perform the lookup. */
278 /* The namespace used during the lookup. */
279 domain_enum namespace;
280 /* The symbol returned by the lookup, or NULL if no matching symbol
283 /* The block where the symbol was found, or NULL if no matching
285 const struct block *block;
286 /* A pointer to the next entry with the same hash. */
287 struct cache_entry *next;
290 /* The Ada symbol cache, used to store the result of Ada-mode symbol
291 lookups in the course of executing the user's commands.
293 The cache is implemented using a simple, fixed-sized hash.
294 The size is fixed on the grounds that there are not likely to be
295 all that many symbols looked up during any given session, regardless
296 of the size of the symbol table. If we decide to go to a resizable
297 table, let's just use the stuff from libiberty instead. */
299 #define HASH_SIZE 1009
301 struct ada_symbol_cache
303 /* An obstack used to store the entries in our cache. */
304 struct obstack cache_space;
306 /* The root of the hash table used to implement our symbol cache. */
307 struct cache_entry *root[HASH_SIZE];
310 static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache);
312 /* Maximum-sized dynamic type. */
313 static unsigned int varsize_limit;
315 /* FIXME: brobecker/2003-09-17: No longer a const because it is
316 returned by a function that does not return a const char *. */
317 static char *ada_completer_word_break_characters =
319 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
321 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
324 /* The name of the symbol to use to get the name of the main subprogram. */
325 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
326 = "__gnat_ada_main_program_name";
328 /* Limit on the number of warnings to raise per expression evaluation. */
329 static int warning_limit = 2;
331 /* Number of warning messages issued; reset to 0 by cleanups after
332 expression evaluation. */
333 static int warnings_issued = 0;
335 static const char *known_runtime_file_name_patterns[] = {
336 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
339 static const char *known_auxiliary_function_name_patterns[] = {
340 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
343 /* Space for allocating results of ada_lookup_symbol_list. */
344 static struct obstack symbol_list_obstack;
346 /* Maintenance-related settings for this module. */
348 static struct cmd_list_element *maint_set_ada_cmdlist;
349 static struct cmd_list_element *maint_show_ada_cmdlist;
351 /* Implement the "maintenance set ada" (prefix) command. */
354 maint_set_ada_cmd (char *args, int from_tty)
356 help_list (maint_set_ada_cmdlist, "maintenance set ada ", all_commands,
360 /* Implement the "maintenance show ada" (prefix) command. */
363 maint_show_ada_cmd (char *args, int from_tty)
365 cmd_show_list (maint_show_ada_cmdlist, from_tty, "");
368 /* The "maintenance ada set/show ignore-descriptive-type" value. */
370 static int ada_ignore_descriptive_types_p = 0;
372 /* Inferior-specific data. */
374 /* Per-inferior data for this module. */
376 struct ada_inferior_data
378 /* The ada__tags__type_specific_data type, which is used when decoding
379 tagged types. With older versions of GNAT, this type was directly
380 accessible through a component ("tsd") in the object tag. But this
381 is no longer the case, so we cache it for each inferior. */
382 struct type *tsd_type;
384 /* The exception_support_info data. This data is used to determine
385 how to implement support for Ada exception catchpoints in a given
387 const struct exception_support_info *exception_info;
390 /* Our key to this module's inferior data. */
391 static const struct inferior_data *ada_inferior_data;
393 /* A cleanup routine for our inferior data. */
395 ada_inferior_data_cleanup (struct inferior *inf, void *arg)
397 struct ada_inferior_data *data;
399 data = inferior_data (inf, ada_inferior_data);
404 /* Return our inferior data for the given inferior (INF).
406 This function always returns a valid pointer to an allocated
407 ada_inferior_data structure. If INF's inferior data has not
408 been previously set, this functions creates a new one with all
409 fields set to zero, sets INF's inferior to it, and then returns
410 a pointer to that newly allocated ada_inferior_data. */
412 static struct ada_inferior_data *
413 get_ada_inferior_data (struct inferior *inf)
415 struct ada_inferior_data *data;
417 data = inferior_data (inf, ada_inferior_data);
420 data = XCNEW (struct ada_inferior_data);
421 set_inferior_data (inf, ada_inferior_data, data);
427 /* Perform all necessary cleanups regarding our module's inferior data
428 that is required after the inferior INF just exited. */
431 ada_inferior_exit (struct inferior *inf)
433 ada_inferior_data_cleanup (inf, NULL);
434 set_inferior_data (inf, ada_inferior_data, NULL);
438 /* program-space-specific data. */
440 /* This module's per-program-space data. */
441 struct ada_pspace_data
443 /* The Ada symbol cache. */
444 struct ada_symbol_cache *sym_cache;
447 /* Key to our per-program-space data. */
448 static const struct program_space_data *ada_pspace_data_handle;
450 /* Return this module's data for the given program space (PSPACE).
451 If not is found, add a zero'ed one now.
453 This function always returns a valid object. */
455 static struct ada_pspace_data *
456 get_ada_pspace_data (struct program_space *pspace)
458 struct ada_pspace_data *data;
460 data = program_space_data (pspace, ada_pspace_data_handle);
463 data = XCNEW (struct ada_pspace_data);
464 set_program_space_data (pspace, ada_pspace_data_handle, data);
470 /* The cleanup callback for this module's per-program-space data. */
473 ada_pspace_data_cleanup (struct program_space *pspace, void *data)
475 struct ada_pspace_data *pspace_data = data;
477 if (pspace_data->sym_cache != NULL)
478 ada_free_symbol_cache (pspace_data->sym_cache);
484 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
485 all typedef layers have been peeled. Otherwise, return TYPE.
487 Normally, we really expect a typedef type to only have 1 typedef layer.
488 In other words, we really expect the target type of a typedef type to be
489 a non-typedef type. This is particularly true for Ada units, because
490 the language does not have a typedef vs not-typedef distinction.
491 In that respect, the Ada compiler has been trying to eliminate as many
492 typedef definitions in the debugging information, since they generally
493 do not bring any extra information (we still use typedef under certain
494 circumstances related mostly to the GNAT encoding).
496 Unfortunately, we have seen situations where the debugging information
497 generated by the compiler leads to such multiple typedef layers. For
498 instance, consider the following example with stabs:
500 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
501 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
503 This is an error in the debugging information which causes type
504 pck__float_array___XUP to be defined twice, and the second time,
505 it is defined as a typedef of a typedef.
507 This is on the fringe of legality as far as debugging information is
508 concerned, and certainly unexpected. But it is easy to handle these
509 situations correctly, so we can afford to be lenient in this case. */
512 ada_typedef_target_type (struct type *type)
514 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
515 type = TYPE_TARGET_TYPE (type);
519 /* Given DECODED_NAME a string holding a symbol name in its
520 decoded form (ie using the Ada dotted notation), returns
521 its unqualified name. */
524 ada_unqualified_name (const char *decoded_name)
526 const char *result = strrchr (decoded_name, '.');
529 result++; /* Skip the dot... */
531 result = decoded_name;
536 /* Return a string starting with '<', followed by STR, and '>'.
537 The result is good until the next call. */
540 add_angle_brackets (const char *str)
542 static char *result = NULL;
545 result = xstrprintf ("<%s>", str);
550 ada_get_gdb_completer_word_break_characters (void)
552 return ada_completer_word_break_characters;
555 /* Print an array element index using the Ada syntax. */
558 ada_print_array_index (struct value *index_value, struct ui_file *stream,
559 const struct value_print_options *options)
561 LA_VALUE_PRINT (index_value, stream, options);
562 fprintf_filtered (stream, " => ");
565 /* Assuming VECT points to an array of *SIZE objects of size
566 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
567 updating *SIZE as necessary and returning the (new) array. */
570 grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
572 if (*size < min_size)
575 if (*size < min_size)
577 vect = xrealloc (vect, *size * element_size);
582 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
583 suffix of FIELD_NAME beginning "___". */
586 field_name_match (const char *field_name, const char *target)
588 int len = strlen (target);
591 (strncmp (field_name, target, len) == 0
592 && (field_name[len] == '\0'
593 || (strncmp (field_name + len, "___", 3) == 0
594 && strcmp (field_name + strlen (field_name) - 6,
599 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
600 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
601 and return its index. This function also handles fields whose name
602 have ___ suffixes because the compiler sometimes alters their name
603 by adding such a suffix to represent fields with certain constraints.
604 If the field could not be found, return a negative number if
605 MAYBE_MISSING is set. Otherwise raise an error. */
608 ada_get_field_index (const struct type *type, const char *field_name,
612 struct type *struct_type = check_typedef ((struct type *) type);
614 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
615 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
619 error (_("Unable to find field %s in struct %s. Aborting"),
620 field_name, TYPE_NAME (struct_type));
625 /* The length of the prefix of NAME prior to any "___" suffix. */
628 ada_name_prefix_len (const char *name)
634 const char *p = strstr (name, "___");
637 return strlen (name);
643 /* Return non-zero if SUFFIX is a suffix of STR.
644 Return zero if STR is null. */
647 is_suffix (const char *str, const char *suffix)
654 len2 = strlen (suffix);
655 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
658 /* The contents of value VAL, treated as a value of type TYPE. The
659 result is an lval in memory if VAL is. */
661 static struct value *
662 coerce_unspec_val_to_type (struct value *val, struct type *type)
664 type = ada_check_typedef (type);
665 if (value_type (val) == type)
669 struct value *result;
671 /* Make sure that the object size is not unreasonable before
672 trying to allocate some memory for it. */
676 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
677 result = allocate_value_lazy (type);
680 result = allocate_value (type);
681 value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type));
683 set_value_component_location (result, val);
684 set_value_bitsize (result, value_bitsize (val));
685 set_value_bitpos (result, value_bitpos (val));
686 set_value_address (result, value_address (val));
691 static const gdb_byte *
692 cond_offset_host (const gdb_byte *valaddr, long offset)
697 return valaddr + offset;
701 cond_offset_target (CORE_ADDR address, long offset)
706 return address + offset;
709 /* Issue a warning (as for the definition of warning in utils.c, but
710 with exactly one argument rather than ...), unless the limit on the
711 number of warnings has passed during the evaluation of the current
714 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
715 provided by "complaint". */
716 static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
719 lim_warning (const char *format, ...)
723 va_start (args, format);
724 warnings_issued += 1;
725 if (warnings_issued <= warning_limit)
726 vwarning (format, args);
731 /* Issue an error if the size of an object of type T is unreasonable,
732 i.e. if it would be a bad idea to allocate a value of this type in
736 check_size (const struct type *type)
738 if (TYPE_LENGTH (type) > varsize_limit)
739 error (_("object size is larger than varsize-limit"));
742 /* Maximum value of a SIZE-byte signed integer type. */
744 max_of_size (int size)
746 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
748 return top_bit | (top_bit - 1);
751 /* Minimum value of a SIZE-byte signed integer type. */
753 min_of_size (int size)
755 return -max_of_size (size) - 1;
758 /* Maximum value of a SIZE-byte unsigned integer type. */
760 umax_of_size (int size)
762 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
764 return top_bit | (top_bit - 1);
767 /* Maximum value of integral type T, as a signed quantity. */
769 max_of_type (struct type *t)
771 if (TYPE_UNSIGNED (t))
772 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
774 return max_of_size (TYPE_LENGTH (t));
777 /* Minimum value of integral type T, as a signed quantity. */
779 min_of_type (struct type *t)
781 if (TYPE_UNSIGNED (t))
784 return min_of_size (TYPE_LENGTH (t));
787 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
789 ada_discrete_type_high_bound (struct type *type)
791 type = resolve_dynamic_type (type, 0);
792 switch (TYPE_CODE (type))
794 case TYPE_CODE_RANGE:
795 return TYPE_HIGH_BOUND (type);
797 return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1);
802 return max_of_type (type);
804 error (_("Unexpected type in ada_discrete_type_high_bound."));
808 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
810 ada_discrete_type_low_bound (struct type *type)
812 type = resolve_dynamic_type (type, 0);
813 switch (TYPE_CODE (type))
815 case TYPE_CODE_RANGE:
816 return TYPE_LOW_BOUND (type);
818 return TYPE_FIELD_ENUMVAL (type, 0);
823 return min_of_type (type);
825 error (_("Unexpected type in ada_discrete_type_low_bound."));
829 /* The identity on non-range types. For range types, the underlying
830 non-range scalar type. */
833 get_base_type (struct type *type)
835 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
837 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
839 type = TYPE_TARGET_TYPE (type);
844 /* Return a decoded version of the given VALUE. This means returning
845 a value whose type is obtained by applying all the GNAT-specific
846 encondings, making the resulting type a static but standard description
847 of the initial type. */
850 ada_get_decoded_value (struct value *value)
852 struct type *type = ada_check_typedef (value_type (value));
854 if (ada_is_array_descriptor_type (type)
855 || (ada_is_constrained_packed_array_type (type)
856 && TYPE_CODE (type) != TYPE_CODE_PTR))
858 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */
859 value = ada_coerce_to_simple_array_ptr (value);
861 value = ada_coerce_to_simple_array (value);
864 value = ada_to_fixed_value (value);
869 /* Same as ada_get_decoded_value, but with the given TYPE.
870 Because there is no associated actual value for this type,
871 the resulting type might be a best-effort approximation in
872 the case of dynamic types. */
875 ada_get_decoded_type (struct type *type)
877 type = to_static_fixed_type (type);
878 if (ada_is_constrained_packed_array_type (type))
879 type = ada_coerce_to_simple_array_type (type);
885 /* Language Selection */
887 /* If the main program is in Ada, return language_ada, otherwise return LANG
888 (the main program is in Ada iif the adainit symbol is found). */
891 ada_update_initial_language (enum language lang)
893 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
894 (struct objfile *) NULL).minsym != NULL)
900 /* If the main procedure is written in Ada, then return its name.
901 The result is good until the next call. Return NULL if the main
902 procedure doesn't appear to be in Ada. */
907 struct bound_minimal_symbol msym;
908 static char *main_program_name = NULL;
910 /* For Ada, the name of the main procedure is stored in a specific
911 string constant, generated by the binder. Look for that symbol,
912 extract its address, and then read that string. If we didn't find
913 that string, then most probably the main procedure is not written
915 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
917 if (msym.minsym != NULL)
919 CORE_ADDR main_program_name_addr;
922 main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym);
923 if (main_program_name_addr == 0)
924 error (_("Invalid address for Ada main program name."));
926 xfree (main_program_name);
927 target_read_string (main_program_name_addr, &main_program_name,
932 return main_program_name;
935 /* The main procedure doesn't seem to be in Ada. */
941 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
944 const struct ada_opname_map ada_opname_table[] = {
945 {"Oadd", "\"+\"", BINOP_ADD},
946 {"Osubtract", "\"-\"", BINOP_SUB},
947 {"Omultiply", "\"*\"", BINOP_MUL},
948 {"Odivide", "\"/\"", BINOP_DIV},
949 {"Omod", "\"mod\"", BINOP_MOD},
950 {"Orem", "\"rem\"", BINOP_REM},
951 {"Oexpon", "\"**\"", BINOP_EXP},
952 {"Olt", "\"<\"", BINOP_LESS},
953 {"Ole", "\"<=\"", BINOP_LEQ},
954 {"Ogt", "\">\"", BINOP_GTR},
955 {"Oge", "\">=\"", BINOP_GEQ},
956 {"Oeq", "\"=\"", BINOP_EQUAL},
957 {"One", "\"/=\"", BINOP_NOTEQUAL},
958 {"Oand", "\"and\"", BINOP_BITWISE_AND},
959 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
960 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
961 {"Oconcat", "\"&\"", BINOP_CONCAT},
962 {"Oabs", "\"abs\"", UNOP_ABS},
963 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
964 {"Oadd", "\"+\"", UNOP_PLUS},
965 {"Osubtract", "\"-\"", UNOP_NEG},
969 /* The "encoded" form of DECODED, according to GNAT conventions.
970 The result is valid until the next call to ada_encode. */
973 ada_encode (const char *decoded)
975 static char *encoding_buffer = NULL;
976 static size_t encoding_buffer_size = 0;
983 GROW_VECT (encoding_buffer, encoding_buffer_size,
984 2 * strlen (decoded) + 10);
987 for (p = decoded; *p != '\0'; p += 1)
991 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
996 const struct ada_opname_map *mapping;
998 for (mapping = ada_opname_table;
999 mapping->encoded != NULL
1000 && strncmp (mapping->decoded, p,
1001 strlen (mapping->decoded)) != 0; mapping += 1)
1003 if (mapping->encoded == NULL)
1004 error (_("invalid Ada operator name: %s"), p);
1005 strcpy (encoding_buffer + k, mapping->encoded);
1006 k += strlen (mapping->encoded);
1011 encoding_buffer[k] = *p;
1016 encoding_buffer[k] = '\0';
1017 return encoding_buffer;
1020 /* Return NAME folded to lower case, or, if surrounded by single
1021 quotes, unfolded, but with the quotes stripped away. Result good
1025 ada_fold_name (const char *name)
1027 static char *fold_buffer = NULL;
1028 static size_t fold_buffer_size = 0;
1030 int len = strlen (name);
1031 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
1033 if (name[0] == '\'')
1035 strncpy (fold_buffer, name + 1, len - 2);
1036 fold_buffer[len - 2] = '\000';
1042 for (i = 0; i <= len; i += 1)
1043 fold_buffer[i] = tolower (name[i]);
1049 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1052 is_lower_alphanum (const char c)
1054 return (isdigit (c) || (isalpha (c) && islower (c)));
1057 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1058 This function saves in LEN the length of that same symbol name but
1059 without either of these suffixes:
1065 These are suffixes introduced by the compiler for entities such as
1066 nested subprogram for instance, in order to avoid name clashes.
1067 They do not serve any purpose for the debugger. */
1070 ada_remove_trailing_digits (const char *encoded, int *len)
1072 if (*len > 1 && isdigit (encoded[*len - 1]))
1076 while (i > 0 && isdigit (encoded[i]))
1078 if (i >= 0 && encoded[i] == '.')
1080 else if (i >= 0 && encoded[i] == '$')
1082 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
1084 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
1089 /* Remove the suffix introduced by the compiler for protected object
1093 ada_remove_po_subprogram_suffix (const char *encoded, int *len)
1095 /* Remove trailing N. */
1097 /* Protected entry subprograms are broken into two
1098 separate subprograms: The first one is unprotected, and has
1099 a 'N' suffix; the second is the protected version, and has
1100 the 'P' suffix. The second calls the first one after handling
1101 the protection. Since the P subprograms are internally generated,
1102 we leave these names undecoded, giving the user a clue that this
1103 entity is internal. */
1106 && encoded[*len - 1] == 'N'
1107 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
1111 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1114 ada_remove_Xbn_suffix (const char *encoded, int *len)
1118 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
1121 if (encoded[i] != 'X')
1127 if (isalnum (encoded[i-1]))
1131 /* If ENCODED follows the GNAT entity encoding conventions, then return
1132 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1133 replaced by ENCODED.
1135 The resulting string is valid until the next call of ada_decode.
1136 If the string is unchanged by decoding, the original string pointer
1140 ada_decode (const char *encoded)
1147 static char *decoding_buffer = NULL;
1148 static size_t decoding_buffer_size = 0;
1150 /* The name of the Ada main procedure starts with "_ada_".
1151 This prefix is not part of the decoded name, so skip this part
1152 if we see this prefix. */
1153 if (strncmp (encoded, "_ada_", 5) == 0)
1156 /* If the name starts with '_', then it is not a properly encoded
1157 name, so do not attempt to decode it. Similarly, if the name
1158 starts with '<', the name should not be decoded. */
1159 if (encoded[0] == '_' || encoded[0] == '<')
1162 len0 = strlen (encoded);
1164 ada_remove_trailing_digits (encoded, &len0);
1165 ada_remove_po_subprogram_suffix (encoded, &len0);
1167 /* Remove the ___X.* suffix if present. Do not forget to verify that
1168 the suffix is located before the current "end" of ENCODED. We want
1169 to avoid re-matching parts of ENCODED that have previously been
1170 marked as discarded (by decrementing LEN0). */
1171 p = strstr (encoded, "___");
1172 if (p != NULL && p - encoded < len0 - 3)
1180 /* Remove any trailing TKB suffix. It tells us that this symbol
1181 is for the body of a task, but that information does not actually
1182 appear in the decoded name. */
1184 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
1187 /* Remove any trailing TB suffix. The TB suffix is slightly different
1188 from the TKB suffix because it is used for non-anonymous task
1191 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
1194 /* Remove trailing "B" suffixes. */
1195 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1197 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
1200 /* Make decoded big enough for possible expansion by operator name. */
1202 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1203 decoded = decoding_buffer;
1205 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1207 if (len0 > 1 && isdigit (encoded[len0 - 1]))
1210 while ((i >= 0 && isdigit (encoded[i]))
1211 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1213 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1215 else if (encoded[i] == '$')
1219 /* The first few characters that are not alphabetic are not part
1220 of any encoding we use, so we can copy them over verbatim. */
1222 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1223 decoded[j] = encoded[i];
1228 /* Is this a symbol function? */
1229 if (at_start_name && encoded[i] == 'O')
1233 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1235 int op_len = strlen (ada_opname_table[k].encoded);
1236 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1238 && !isalnum (encoded[i + op_len]))
1240 strcpy (decoded + j, ada_opname_table[k].decoded);
1243 j += strlen (ada_opname_table[k].decoded);
1247 if (ada_opname_table[k].encoded != NULL)
1252 /* Replace "TK__" with "__", which will eventually be translated
1253 into "." (just below). */
1255 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1258 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1259 be translated into "." (just below). These are internal names
1260 generated for anonymous blocks inside which our symbol is nested. */
1262 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1263 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1264 && isdigit (encoded [i+4]))
1268 while (k < len0 && isdigit (encoded[k]))
1269 k++; /* Skip any extra digit. */
1271 /* Double-check that the "__B_{DIGITS}+" sequence we found
1272 is indeed followed by "__". */
1273 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1277 /* Remove _E{DIGITS}+[sb] */
1279 /* Just as for protected object subprograms, there are 2 categories
1280 of subprograms created by the compiler for each entry. The first
1281 one implements the actual entry code, and has a suffix following
1282 the convention above; the second one implements the barrier and
1283 uses the same convention as above, except that the 'E' is replaced
1286 Just as above, we do not decode the name of barrier functions
1287 to give the user a clue that the code he is debugging has been
1288 internally generated. */
1290 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1291 && isdigit (encoded[i+2]))
1295 while (k < len0 && isdigit (encoded[k]))
1299 && (encoded[k] == 'b' || encoded[k] == 's'))
1302 /* Just as an extra precaution, make sure that if this
1303 suffix is followed by anything else, it is a '_'.
1304 Otherwise, we matched this sequence by accident. */
1306 || (k < len0 && encoded[k] == '_'))
1311 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1312 the GNAT front-end in protected object subprograms. */
1315 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1317 /* Backtrack a bit up until we reach either the begining of
1318 the encoded name, or "__". Make sure that we only find
1319 digits or lowercase characters. */
1320 const char *ptr = encoded + i - 1;
1322 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1325 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1329 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1331 /* This is a X[bn]* sequence not separated from the previous
1332 part of the name with a non-alpha-numeric character (in other
1333 words, immediately following an alpha-numeric character), then
1334 verify that it is placed at the end of the encoded name. If
1335 not, then the encoding is not valid and we should abort the
1336 decoding. Otherwise, just skip it, it is used in body-nested
1340 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1344 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1346 /* Replace '__' by '.'. */
1354 /* It's a character part of the decoded name, so just copy it
1356 decoded[j] = encoded[i];
1361 decoded[j] = '\000';
1363 /* Decoded names should never contain any uppercase character.
1364 Double-check this, and abort the decoding if we find one. */
1366 for (i = 0; decoded[i] != '\0'; i += 1)
1367 if (isupper (decoded[i]) || decoded[i] == ' ')
1370 if (strcmp (decoded, encoded) == 0)
1376 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1377 decoded = decoding_buffer;
1378 if (encoded[0] == '<')
1379 strcpy (decoded, encoded);
1381 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
1386 /* Table for keeping permanent unique copies of decoded names. Once
1387 allocated, names in this table are never released. While this is a
1388 storage leak, it should not be significant unless there are massive
1389 changes in the set of decoded names in successive versions of a
1390 symbol table loaded during a single session. */
1391 static struct htab *decoded_names_store;
1393 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1394 in the language-specific part of GSYMBOL, if it has not been
1395 previously computed. Tries to save the decoded name in the same
1396 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1397 in any case, the decoded symbol has a lifetime at least that of
1399 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1400 const, but nevertheless modified to a semantically equivalent form
1401 when a decoded name is cached in it. */
1404 ada_decode_symbol (const struct general_symbol_info *arg)
1406 struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg;
1407 const char **resultp =
1408 &gsymbol->language_specific.mangled_lang.demangled_name;
1410 if (!gsymbol->ada_mangled)
1412 const char *decoded = ada_decode (gsymbol->name);
1413 struct obstack *obstack = gsymbol->language_specific.obstack;
1415 gsymbol->ada_mangled = 1;
1417 if (obstack != NULL)
1418 *resultp = obstack_copy0 (obstack, decoded, strlen (decoded));
1421 /* Sometimes, we can't find a corresponding objfile, in
1422 which case, we put the result on the heap. Since we only
1423 decode when needed, we hope this usually does not cause a
1424 significant memory leak (FIXME). */
1426 char **slot = (char **) htab_find_slot (decoded_names_store,
1430 *slot = xstrdup (decoded);
1439 ada_la_decode (const char *encoded, int options)
1441 return xstrdup (ada_decode (encoded));
1444 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1445 suffixes that encode debugging information or leading _ada_ on
1446 SYM_NAME (see is_name_suffix commentary for the debugging
1447 information that is ignored). If WILD, then NAME need only match a
1448 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1449 either argument is NULL. */
1452 match_name (const char *sym_name, const char *name, int wild)
1454 if (sym_name == NULL || name == NULL)
1457 return wild_match (sym_name, name) == 0;
1460 int len_name = strlen (name);
1462 return (strncmp (sym_name, name, len_name) == 0
1463 && is_name_suffix (sym_name + len_name))
1464 || (strncmp (sym_name, "_ada_", 5) == 0
1465 && strncmp (sym_name + 5, name, len_name) == 0
1466 && is_name_suffix (sym_name + len_name + 5));
1473 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1474 generated by the GNAT compiler to describe the index type used
1475 for each dimension of an array, check whether it follows the latest
1476 known encoding. If not, fix it up to conform to the latest encoding.
1477 Otherwise, do nothing. This function also does nothing if
1478 INDEX_DESC_TYPE is NULL.
1480 The GNAT encoding used to describle the array index type evolved a bit.
1481 Initially, the information would be provided through the name of each
1482 field of the structure type only, while the type of these fields was
1483 described as unspecified and irrelevant. The debugger was then expected
1484 to perform a global type lookup using the name of that field in order
1485 to get access to the full index type description. Because these global
1486 lookups can be very expensive, the encoding was later enhanced to make
1487 the global lookup unnecessary by defining the field type as being
1488 the full index type description.
1490 The purpose of this routine is to allow us to support older versions
1491 of the compiler by detecting the use of the older encoding, and by
1492 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1493 we essentially replace each field's meaningless type by the associated
1497 ada_fixup_array_indexes_type (struct type *index_desc_type)
1501 if (index_desc_type == NULL)
1503 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1505 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1506 to check one field only, no need to check them all). If not, return
1509 If our INDEX_DESC_TYPE was generated using the older encoding,
1510 the field type should be a meaningless integer type whose name
1511 is not equal to the field name. */
1512 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1513 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1514 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1517 /* Fixup each field of INDEX_DESC_TYPE. */
1518 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1520 const char *name = TYPE_FIELD_NAME (index_desc_type, i);
1521 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1524 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1528 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1530 static char *bound_name[] = {
1531 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1532 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1535 /* Maximum number of array dimensions we are prepared to handle. */
1537 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1540 /* The desc_* routines return primitive portions of array descriptors
1543 /* The descriptor or array type, if any, indicated by TYPE; removes
1544 level of indirection, if needed. */
1546 static struct type *
1547 desc_base_type (struct type *type)
1551 type = ada_check_typedef (type);
1552 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1553 type = ada_typedef_target_type (type);
1556 && (TYPE_CODE (type) == TYPE_CODE_PTR
1557 || TYPE_CODE (type) == TYPE_CODE_REF))
1558 return ada_check_typedef (TYPE_TARGET_TYPE (type));
1563 /* True iff TYPE indicates a "thin" array pointer type. */
1566 is_thin_pntr (struct type *type)
1569 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1570 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1573 /* The descriptor type for thin pointer type TYPE. */
1575 static struct type *
1576 thin_descriptor_type (struct type *type)
1578 struct type *base_type = desc_base_type (type);
1580 if (base_type == NULL)
1582 if (is_suffix (ada_type_name (base_type), "___XVE"))
1586 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
1588 if (alt_type == NULL)
1595 /* A pointer to the array data for thin-pointer value VAL. */
1597 static struct value *
1598 thin_data_pntr (struct value *val)
1600 struct type *type = ada_check_typedef (value_type (val));
1601 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
1603 data_type = lookup_pointer_type (data_type);
1605 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1606 return value_cast (data_type, value_copy (val));
1608 return value_from_longest (data_type, value_address (val));
1611 /* True iff TYPE indicates a "thick" array pointer type. */
1614 is_thick_pntr (struct type *type)
1616 type = desc_base_type (type);
1617 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
1618 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
1621 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1622 pointer to one, the type of its bounds data; otherwise, NULL. */
1624 static struct type *
1625 desc_bounds_type (struct type *type)
1629 type = desc_base_type (type);
1633 else if (is_thin_pntr (type))
1635 type = thin_descriptor_type (type);
1638 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1640 return ada_check_typedef (r);
1642 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1644 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1646 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
1651 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1652 one, a pointer to its bounds data. Otherwise NULL. */
1654 static struct value *
1655 desc_bounds (struct value *arr)
1657 struct type *type = ada_check_typedef (value_type (arr));
1659 if (is_thin_pntr (type))
1661 struct type *bounds_type =
1662 desc_bounds_type (thin_descriptor_type (type));
1665 if (bounds_type == NULL)
1666 error (_("Bad GNAT array descriptor"));
1668 /* NOTE: The following calculation is not really kosher, but
1669 since desc_type is an XVE-encoded type (and shouldn't be),
1670 the correct calculation is a real pain. FIXME (and fix GCC). */
1671 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1672 addr = value_as_long (arr);
1674 addr = value_address (arr);
1677 value_from_longest (lookup_pointer_type (bounds_type),
1678 addr - TYPE_LENGTH (bounds_type));
1681 else if (is_thick_pntr (type))
1683 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1684 _("Bad GNAT array descriptor"));
1685 struct type *p_bounds_type = value_type (p_bounds);
1688 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1690 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1692 if (TYPE_STUB (target_type))
1693 p_bounds = value_cast (lookup_pointer_type
1694 (ada_check_typedef (target_type)),
1698 error (_("Bad GNAT array descriptor"));
1706 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1707 position of the field containing the address of the bounds data. */
1710 fat_pntr_bounds_bitpos (struct type *type)
1712 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1715 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1716 size of the field containing the address of the bounds data. */
1719 fat_pntr_bounds_bitsize (struct type *type)
1721 type = desc_base_type (type);
1723 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
1724 return TYPE_FIELD_BITSIZE (type, 1);
1726 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
1729 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1730 pointer to one, the type of its array data (a array-with-no-bounds type);
1731 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1734 static struct type *
1735 desc_data_target_type (struct type *type)
1737 type = desc_base_type (type);
1739 /* NOTE: The following is bogus; see comment in desc_bounds. */
1740 if (is_thin_pntr (type))
1741 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
1742 else if (is_thick_pntr (type))
1744 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1747 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
1748 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
1754 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1757 static struct value *
1758 desc_data (struct value *arr)
1760 struct type *type = value_type (arr);
1762 if (is_thin_pntr (type))
1763 return thin_data_pntr (arr);
1764 else if (is_thick_pntr (type))
1765 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
1766 _("Bad GNAT array descriptor"));
1772 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1773 position of the field containing the address of the data. */
1776 fat_pntr_data_bitpos (struct type *type)
1778 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1781 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1782 size of the field containing the address of the data. */
1785 fat_pntr_data_bitsize (struct type *type)
1787 type = desc_base_type (type);
1789 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1790 return TYPE_FIELD_BITSIZE (type, 0);
1792 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1795 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1796 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1797 bound, if WHICH is 1. The first bound is I=1. */
1799 static struct value *
1800 desc_one_bound (struct value *bounds, int i, int which)
1802 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
1803 _("Bad GNAT array descriptor bounds"));
1806 /* If BOUNDS is an array-bounds structure type, return the bit position
1807 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1808 bound, if WHICH is 1. The first bound is I=1. */
1811 desc_bound_bitpos (struct type *type, int i, int which)
1813 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
1816 /* If BOUNDS is an array-bounds structure type, return the bit field size
1817 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1818 bound, if WHICH is 1. The first bound is I=1. */
1821 desc_bound_bitsize (struct type *type, int i, int which)
1823 type = desc_base_type (type);
1825 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1826 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1828 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
1831 /* If TYPE is the type of an array-bounds structure, the type of its
1832 Ith bound (numbering from 1). Otherwise, NULL. */
1834 static struct type *
1835 desc_index_type (struct type *type, int i)
1837 type = desc_base_type (type);
1839 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1840 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1845 /* The number of index positions in the array-bounds type TYPE.
1846 Return 0 if TYPE is NULL. */
1849 desc_arity (struct type *type)
1851 type = desc_base_type (type);
1854 return TYPE_NFIELDS (type) / 2;
1858 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1859 an array descriptor type (representing an unconstrained array
1863 ada_is_direct_array_type (struct type *type)
1867 type = ada_check_typedef (type);
1868 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1869 || ada_is_array_descriptor_type (type));
1872 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1876 ada_is_array_type (struct type *type)
1879 && (TYPE_CODE (type) == TYPE_CODE_PTR
1880 || TYPE_CODE (type) == TYPE_CODE_REF))
1881 type = TYPE_TARGET_TYPE (type);
1882 return ada_is_direct_array_type (type);
1885 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1888 ada_is_simple_array_type (struct type *type)
1892 type = ada_check_typedef (type);
1893 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
1894 || (TYPE_CODE (type) == TYPE_CODE_PTR
1895 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1896 == TYPE_CODE_ARRAY));
1899 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1902 ada_is_array_descriptor_type (struct type *type)
1904 struct type *data_type = desc_data_target_type (type);
1908 type = ada_check_typedef (type);
1909 return (data_type != NULL
1910 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1911 && desc_arity (desc_bounds_type (type)) > 0);
1914 /* Non-zero iff type is a partially mal-formed GNAT array
1915 descriptor. FIXME: This is to compensate for some problems with
1916 debugging output from GNAT. Re-examine periodically to see if it
1920 ada_is_bogus_array_descriptor (struct type *type)
1924 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1925 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
1926 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1927 && !ada_is_array_descriptor_type (type);
1931 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1932 (fat pointer) returns the type of the array data described---specifically,
1933 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1934 in from the descriptor; otherwise, they are left unspecified. If
1935 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1936 returns NULL. The result is simply the type of ARR if ARR is not
1939 ada_type_of_array (struct value *arr, int bounds)
1941 if (ada_is_constrained_packed_array_type (value_type (arr)))
1942 return decode_constrained_packed_array_type (value_type (arr));
1944 if (!ada_is_array_descriptor_type (value_type (arr)))
1945 return value_type (arr);
1949 struct type *array_type =
1950 ada_check_typedef (desc_data_target_type (value_type (arr)));
1952 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1953 TYPE_FIELD_BITSIZE (array_type, 0) =
1954 decode_packed_array_bitsize (value_type (arr));
1960 struct type *elt_type;
1962 struct value *descriptor;
1964 elt_type = ada_array_element_type (value_type (arr), -1);
1965 arity = ada_array_arity (value_type (arr));
1967 if (elt_type == NULL || arity == 0)
1968 return ada_check_typedef (value_type (arr));
1970 descriptor = desc_bounds (arr);
1971 if (value_as_long (descriptor) == 0)
1975 struct type *range_type = alloc_type_copy (value_type (arr));
1976 struct type *array_type = alloc_type_copy (value_type (arr));
1977 struct value *low = desc_one_bound (descriptor, arity, 0);
1978 struct value *high = desc_one_bound (descriptor, arity, 1);
1981 create_static_range_type (range_type, value_type (low),
1982 longest_to_int (value_as_long (low)),
1983 longest_to_int (value_as_long (high)));
1984 elt_type = create_array_type (array_type, elt_type, range_type);
1986 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1988 /* We need to store the element packed bitsize, as well as
1989 recompute the array size, because it was previously
1990 computed based on the unpacked element size. */
1991 LONGEST lo = value_as_long (low);
1992 LONGEST hi = value_as_long (high);
1994 TYPE_FIELD_BITSIZE (elt_type, 0) =
1995 decode_packed_array_bitsize (value_type (arr));
1996 /* If the array has no element, then the size is already
1997 zero, and does not need to be recomputed. */
2001 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
2003 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
2008 return lookup_pointer_type (elt_type);
2012 /* If ARR does not represent an array, returns ARR unchanged.
2013 Otherwise, returns either a standard GDB array with bounds set
2014 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2015 GDB array. Returns NULL if ARR is a null fat pointer. */
2018 ada_coerce_to_simple_array_ptr (struct value *arr)
2020 if (ada_is_array_descriptor_type (value_type (arr)))
2022 struct type *arrType = ada_type_of_array (arr, 1);
2024 if (arrType == NULL)
2026 return value_cast (arrType, value_copy (desc_data (arr)));
2028 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2029 return decode_constrained_packed_array (arr);
2034 /* If ARR does not represent an array, returns ARR unchanged.
2035 Otherwise, returns a standard GDB array describing ARR (which may
2036 be ARR itself if it already is in the proper form). */
2039 ada_coerce_to_simple_array (struct value *arr)
2041 if (ada_is_array_descriptor_type (value_type (arr)))
2043 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
2046 error (_("Bounds unavailable for null array pointer."));
2047 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
2048 return value_ind (arrVal);
2050 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2051 return decode_constrained_packed_array (arr);
2056 /* If TYPE represents a GNAT array type, return it translated to an
2057 ordinary GDB array type (possibly with BITSIZE fields indicating
2058 packing). For other types, is the identity. */
2061 ada_coerce_to_simple_array_type (struct type *type)
2063 if (ada_is_constrained_packed_array_type (type))
2064 return decode_constrained_packed_array_type (type);
2066 if (ada_is_array_descriptor_type (type))
2067 return ada_check_typedef (desc_data_target_type (type));
2072 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2075 ada_is_packed_array_type (struct type *type)
2079 type = desc_base_type (type);
2080 type = ada_check_typedef (type);
2082 ada_type_name (type) != NULL
2083 && strstr (ada_type_name (type), "___XP") != NULL;
2086 /* Non-zero iff TYPE represents a standard GNAT constrained
2087 packed-array type. */
2090 ada_is_constrained_packed_array_type (struct type *type)
2092 return ada_is_packed_array_type (type)
2093 && !ada_is_array_descriptor_type (type);
2096 /* Non-zero iff TYPE represents an array descriptor for a
2097 unconstrained packed-array type. */
2100 ada_is_unconstrained_packed_array_type (struct type *type)
2102 return ada_is_packed_array_type (type)
2103 && ada_is_array_descriptor_type (type);
2106 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2107 return the size of its elements in bits. */
2110 decode_packed_array_bitsize (struct type *type)
2112 const char *raw_name;
2116 /* Access to arrays implemented as fat pointers are encoded as a typedef
2117 of the fat pointer type. We need the name of the fat pointer type
2118 to do the decoding, so strip the typedef layer. */
2119 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
2120 type = ada_typedef_target_type (type);
2122 raw_name = ada_type_name (ada_check_typedef (type));
2124 raw_name = ada_type_name (desc_base_type (type));
2129 tail = strstr (raw_name, "___XP");
2130 gdb_assert (tail != NULL);
2132 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
2135 (_("could not understand bit size information on packed array"));
2142 /* Given that TYPE is a standard GDB array type with all bounds filled
2143 in, and that the element size of its ultimate scalar constituents
2144 (that is, either its elements, or, if it is an array of arrays, its
2145 elements' elements, etc.) is *ELT_BITS, return an identical type,
2146 but with the bit sizes of its elements (and those of any
2147 constituent arrays) recorded in the BITSIZE components of its
2148 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2151 Note that, for arrays whose index type has an XA encoding where
2152 a bound references a record discriminant, getting that discriminant,
2153 and therefore the actual value of that bound, is not possible
2154 because none of the given parameters gives us access to the record.
2155 This function assumes that it is OK in the context where it is being
2156 used to return an array whose bounds are still dynamic and where
2157 the length is arbitrary. */
2159 static struct type *
2160 constrained_packed_array_type (struct type *type, long *elt_bits)
2162 struct type *new_elt_type;
2163 struct type *new_type;
2164 struct type *index_type_desc;
2165 struct type *index_type;
2166 LONGEST low_bound, high_bound;
2168 type = ada_check_typedef (type);
2169 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2172 index_type_desc = ada_find_parallel_type (type, "___XA");
2173 if (index_type_desc)
2174 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0),
2177 index_type = TYPE_INDEX_TYPE (type);
2179 new_type = alloc_type_copy (type);
2181 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2183 create_array_type (new_type, new_elt_type, index_type);
2184 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2185 TYPE_NAME (new_type) = ada_type_name (type);
2187 if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE
2188 && is_dynamic_type (check_typedef (index_type)))
2189 || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0)
2190 low_bound = high_bound = 0;
2191 if (high_bound < low_bound)
2192 *elt_bits = TYPE_LENGTH (new_type) = 0;
2195 *elt_bits *= (high_bound - low_bound + 1);
2196 TYPE_LENGTH (new_type) =
2197 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2200 TYPE_FIXED_INSTANCE (new_type) = 1;
2204 /* The array type encoded by TYPE, where
2205 ada_is_constrained_packed_array_type (TYPE). */
2207 static struct type *
2208 decode_constrained_packed_array_type (struct type *type)
2210 const char *raw_name = ada_type_name (ada_check_typedef (type));
2213 struct type *shadow_type;
2217 raw_name = ada_type_name (desc_base_type (type));
2222 name = (char *) alloca (strlen (raw_name) + 1);
2223 tail = strstr (raw_name, "___XP");
2224 type = desc_base_type (type);
2226 memcpy (name, raw_name, tail - raw_name);
2227 name[tail - raw_name] = '\000';
2229 shadow_type = ada_find_parallel_type_with_name (type, name);
2231 if (shadow_type == NULL)
2233 lim_warning (_("could not find bounds information on packed array"));
2236 CHECK_TYPEDEF (shadow_type);
2238 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2240 lim_warning (_("could not understand bounds "
2241 "information on packed array"));
2245 bits = decode_packed_array_bitsize (type);
2246 return constrained_packed_array_type (shadow_type, &bits);
2249 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2250 array, returns a simple array that denotes that array. Its type is a
2251 standard GDB array type except that the BITSIZEs of the array
2252 target types are set to the number of bits in each element, and the
2253 type length is set appropriately. */
2255 static struct value *
2256 decode_constrained_packed_array (struct value *arr)
2260 /* If our value is a pointer, then dereference it. Likewise if
2261 the value is a reference. Make sure that this operation does not
2262 cause the target type to be fixed, as this would indirectly cause
2263 this array to be decoded. The rest of the routine assumes that
2264 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2265 and "value_ind" routines to perform the dereferencing, as opposed
2266 to using "ada_coerce_ref" or "ada_value_ind". */
2267 arr = coerce_ref (arr);
2268 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2269 arr = value_ind (arr);
2271 type = decode_constrained_packed_array_type (value_type (arr));
2274 error (_("can't unpack array"));
2278 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
2279 && ada_is_modular_type (value_type (arr)))
2281 /* This is a (right-justified) modular type representing a packed
2282 array with no wrapper. In order to interpret the value through
2283 the (left-justified) packed array type we just built, we must
2284 first left-justify it. */
2285 int bit_size, bit_pos;
2288 mod = ada_modulus (value_type (arr)) - 1;
2295 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
2296 arr = ada_value_primitive_packed_val (arr, NULL,
2297 bit_pos / HOST_CHAR_BIT,
2298 bit_pos % HOST_CHAR_BIT,
2303 return coerce_unspec_val_to_type (arr, type);
2307 /* The value of the element of packed array ARR at the ARITY indices
2308 given in IND. ARR must be a simple array. */
2310 static struct value *
2311 value_subscript_packed (struct value *arr, int arity, struct value **ind)
2314 int bits, elt_off, bit_off;
2315 long elt_total_bit_offset;
2316 struct type *elt_type;
2320 elt_total_bit_offset = 0;
2321 elt_type = ada_check_typedef (value_type (arr));
2322 for (i = 0; i < arity; i += 1)
2324 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
2325 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2327 (_("attempt to do packed indexing of "
2328 "something other than a packed array"));
2331 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2332 LONGEST lowerbound, upperbound;
2335 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2337 lim_warning (_("don't know bounds of array"));
2338 lowerbound = upperbound = 0;
2341 idx = pos_atr (ind[i]);
2342 if (idx < lowerbound || idx > upperbound)
2343 lim_warning (_("packed array index %ld out of bounds"),
2345 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2346 elt_total_bit_offset += (idx - lowerbound) * bits;
2347 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
2350 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2351 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
2353 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
2358 /* Non-zero iff TYPE includes negative integer values. */
2361 has_negatives (struct type *type)
2363 switch (TYPE_CODE (type))
2368 return !TYPE_UNSIGNED (type);
2369 case TYPE_CODE_RANGE:
2370 return TYPE_LOW_BOUND (type) < 0;
2375 /* Create a new value of type TYPE from the contents of OBJ starting
2376 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2377 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2378 assigning through the result will set the field fetched from.
2379 VALADDR is ignored unless OBJ is NULL, in which case,
2380 VALADDR+OFFSET must address the start of storage containing the
2381 packed value. The value returned in this case is never an lval.
2382 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2385 ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2386 long offset, int bit_offset, int bit_size,
2390 int src, /* Index into the source area */
2391 targ, /* Index into the target area */
2392 srcBitsLeft, /* Number of source bits left to move */
2393 nsrc, ntarg, /* Number of source and target bytes */
2394 unusedLS, /* Number of bits in next significant
2395 byte of source that are unused */
2396 accumSize; /* Number of meaningful bits in accum */
2397 unsigned char *bytes; /* First byte containing data to unpack */
2398 unsigned char *unpacked;
2399 unsigned long accum; /* Staging area for bits being transferred */
2401 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2402 /* Transmit bytes from least to most significant; delta is the direction
2403 the indices move. */
2404 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
2406 type = ada_check_typedef (type);
2410 v = allocate_value (type);
2411 bytes = (unsigned char *) (valaddr + offset);
2413 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2415 v = value_at (type, value_address (obj));
2416 type = value_type (v);
2417 bytes = (unsigned char *) alloca (len);
2418 read_memory (value_address (v) + offset, bytes, len);
2422 v = allocate_value (type);
2423 bytes = (unsigned char *) value_contents (obj) + offset;
2428 long new_offset = offset;
2430 set_value_component_location (v, obj);
2431 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2432 set_value_bitsize (v, bit_size);
2433 if (value_bitpos (v) >= HOST_CHAR_BIT)
2436 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2438 set_value_offset (v, new_offset);
2440 /* Also set the parent value. This is needed when trying to
2441 assign a new value (in inferior memory). */
2442 set_value_parent (v, obj);
2445 set_value_bitsize (v, bit_size);
2446 unpacked = (unsigned char *) value_contents (v);
2448 srcBitsLeft = bit_size;
2450 ntarg = TYPE_LENGTH (type);
2454 memset (unpacked, 0, TYPE_LENGTH (type));
2457 else if (gdbarch_bits_big_endian (get_type_arch (type)))
2460 if (has_negatives (type)
2461 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
2465 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2468 switch (TYPE_CODE (type))
2470 case TYPE_CODE_ARRAY:
2471 case TYPE_CODE_UNION:
2472 case TYPE_CODE_STRUCT:
2473 /* Non-scalar values must be aligned at a byte boundary... */
2475 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2476 /* ... And are placed at the beginning (most-significant) bytes
2478 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2483 targ = TYPE_LENGTH (type) - 1;
2489 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2492 unusedLS = bit_offset;
2495 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
2502 /* Mask for removing bits of the next source byte that are not
2503 part of the value. */
2504 unsigned int unusedMSMask =
2505 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2507 /* Sign-extend bits for this byte. */
2508 unsigned int signMask = sign & ~unusedMSMask;
2511 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
2512 accumSize += HOST_CHAR_BIT - unusedLS;
2513 if (accumSize >= HOST_CHAR_BIT)
2515 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2516 accumSize -= HOST_CHAR_BIT;
2517 accum >>= HOST_CHAR_BIT;
2521 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2528 accum |= sign << accumSize;
2529 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2530 accumSize -= HOST_CHAR_BIT;
2531 accum >>= HOST_CHAR_BIT;
2539 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2540 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2543 move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
2544 int src_offset, int n, int bits_big_endian_p)
2546 unsigned int accum, mask;
2547 int accum_bits, chunk_size;
2549 target += targ_offset / HOST_CHAR_BIT;
2550 targ_offset %= HOST_CHAR_BIT;
2551 source += src_offset / HOST_CHAR_BIT;
2552 src_offset %= HOST_CHAR_BIT;
2553 if (bits_big_endian_p)
2555 accum = (unsigned char) *source;
2557 accum_bits = HOST_CHAR_BIT - src_offset;
2563 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2564 accum_bits += HOST_CHAR_BIT;
2566 chunk_size = HOST_CHAR_BIT - targ_offset;
2569 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2570 mask = ((1 << chunk_size) - 1) << unused_right;
2573 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2575 accum_bits -= chunk_size;
2582 accum = (unsigned char) *source >> src_offset;
2584 accum_bits = HOST_CHAR_BIT - src_offset;
2588 accum = accum + ((unsigned char) *source << accum_bits);
2589 accum_bits += HOST_CHAR_BIT;
2591 chunk_size = HOST_CHAR_BIT - targ_offset;
2594 mask = ((1 << chunk_size) - 1) << targ_offset;
2595 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2597 accum_bits -= chunk_size;
2598 accum >>= chunk_size;
2605 /* Store the contents of FROMVAL into the location of TOVAL.
2606 Return a new value with the location of TOVAL and contents of
2607 FROMVAL. Handles assignment into packed fields that have
2608 floating-point or non-scalar types. */
2610 static struct value *
2611 ada_value_assign (struct value *toval, struct value *fromval)
2613 struct type *type = value_type (toval);
2614 int bits = value_bitsize (toval);
2616 toval = ada_coerce_ref (toval);
2617 fromval = ada_coerce_ref (fromval);
2619 if (ada_is_direct_array_type (value_type (toval)))
2620 toval = ada_coerce_to_simple_array (toval);
2621 if (ada_is_direct_array_type (value_type (fromval)))
2622 fromval = ada_coerce_to_simple_array (fromval);
2624 if (!deprecated_value_modifiable (toval))
2625 error (_("Left operand of assignment is not a modifiable lvalue."));
2627 if (VALUE_LVAL (toval) == lval_memory
2629 && (TYPE_CODE (type) == TYPE_CODE_FLT
2630 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
2632 int len = (value_bitpos (toval)
2633 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2635 gdb_byte *buffer = alloca (len);
2637 CORE_ADDR to_addr = value_address (toval);
2639 if (TYPE_CODE (type) == TYPE_CODE_FLT)
2640 fromval = value_cast (type, fromval);
2642 read_memory (to_addr, buffer, len);
2643 from_size = value_bitsize (fromval);
2645 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
2646 if (gdbarch_bits_big_endian (get_type_arch (type)))
2647 move_bits (buffer, value_bitpos (toval),
2648 value_contents (fromval), from_size - bits, bits, 1);
2650 move_bits (buffer, value_bitpos (toval),
2651 value_contents (fromval), 0, bits, 0);
2652 write_memory_with_notification (to_addr, buffer, len);
2654 val = value_copy (toval);
2655 memcpy (value_contents_raw (val), value_contents (fromval),
2656 TYPE_LENGTH (type));
2657 deprecated_set_value_type (val, type);
2662 return value_assign (toval, fromval);
2666 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2667 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2668 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2669 * COMPONENT, and not the inferior's memory. The current contents
2670 * of COMPONENT are ignored. */
2672 value_assign_to_component (struct value *container, struct value *component,
2675 LONGEST offset_in_container =
2676 (LONGEST) (value_address (component) - value_address (container));
2677 int bit_offset_in_container =
2678 value_bitpos (component) - value_bitpos (container);
2681 val = value_cast (value_type (component), val);
2683 if (value_bitsize (component) == 0)
2684 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2686 bits = value_bitsize (component);
2688 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2689 move_bits (value_contents_writeable (container) + offset_in_container,
2690 value_bitpos (container) + bit_offset_in_container,
2691 value_contents (val),
2692 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2695 move_bits (value_contents_writeable (container) + offset_in_container,
2696 value_bitpos (container) + bit_offset_in_container,
2697 value_contents (val), 0, bits, 0);
2700 /* The value of the element of array ARR at the ARITY indices given in IND.
2701 ARR may be either a simple array, GNAT array descriptor, or pointer
2705 ada_value_subscript (struct value *arr, int arity, struct value **ind)
2709 struct type *elt_type;
2711 elt = ada_coerce_to_simple_array (arr);
2713 elt_type = ada_check_typedef (value_type (elt));
2714 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
2715 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2716 return value_subscript_packed (elt, arity, ind);
2718 for (k = 0; k < arity; k += 1)
2720 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
2721 error (_("too many subscripts (%d expected)"), k);
2722 elt = value_subscript (elt, pos_atr (ind[k]));
2727 /* Assuming ARR is a pointer to a GDB array, the value of the element
2728 of *ARR at the ARITY indices given in IND.
2729 Does not read the entire array into memory. */
2731 static struct value *
2732 ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind)
2736 = check_typedef (value_enclosing_type (ada_value_ind (arr)));
2738 for (k = 0; k < arity; k += 1)
2742 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2743 error (_("too many subscripts (%d expected)"), k);
2744 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
2746 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2747 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
2748 type = TYPE_TARGET_TYPE (type);
2751 return value_ind (arr);
2754 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2755 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2756 elements starting at index LOW. The lower bound of this array is LOW, as
2758 static struct value *
2759 ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2762 struct type *type0 = ada_check_typedef (type);
2763 CORE_ADDR base = value_as_address (array_ptr)
2764 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)))
2765 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
2766 struct type *index_type
2767 = create_static_range_type (NULL,
2768 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)),
2770 struct type *slice_type =
2771 create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type);
2773 return value_at_lazy (slice_type, base);
2777 static struct value *
2778 ada_value_slice (struct value *array, int low, int high)
2780 struct type *type = ada_check_typedef (value_type (array));
2781 struct type *index_type
2782 = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
2783 struct type *slice_type =
2784 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2786 return value_cast (slice_type, value_slice (array, low, high - low + 1));
2789 /* If type is a record type in the form of a standard GNAT array
2790 descriptor, returns the number of dimensions for type. If arr is a
2791 simple array, returns the number of "array of"s that prefix its
2792 type designation. Otherwise, returns 0. */
2795 ada_array_arity (struct type *type)
2802 type = desc_base_type (type);
2805 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2806 return desc_arity (desc_bounds_type (type));
2808 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2811 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
2817 /* If TYPE is a record type in the form of a standard GNAT array
2818 descriptor or a simple array type, returns the element type for
2819 TYPE after indexing by NINDICES indices, or by all indices if
2820 NINDICES is -1. Otherwise, returns NULL. */
2823 ada_array_element_type (struct type *type, int nindices)
2825 type = desc_base_type (type);
2827 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
2830 struct type *p_array_type;
2832 p_array_type = desc_data_target_type (type);
2834 k = ada_array_arity (type);
2838 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2839 if (nindices >= 0 && k > nindices)
2841 while (k > 0 && p_array_type != NULL)
2843 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
2846 return p_array_type;
2848 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2850 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
2852 type = TYPE_TARGET_TYPE (type);
2861 /* The type of nth index in arrays of given type (n numbering from 1).
2862 Does not examine memory. Throws an error if N is invalid or TYPE
2863 is not an array type. NAME is the name of the Ada attribute being
2864 evaluated ('range, 'first, 'last, or 'length); it is used in building
2865 the error message. */
2867 static struct type *
2868 ada_index_type (struct type *type, int n, const char *name)
2870 struct type *result_type;
2872 type = desc_base_type (type);
2874 if (n < 0 || n > ada_array_arity (type))
2875 error (_("invalid dimension number to '%s"), name);
2877 if (ada_is_simple_array_type (type))
2881 for (i = 1; i < n; i += 1)
2882 type = TYPE_TARGET_TYPE (type);
2883 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
2884 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2885 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2886 perhaps stabsread.c would make more sense. */
2887 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2892 result_type = desc_index_type (desc_bounds_type (type), n);
2893 if (result_type == NULL)
2894 error (_("attempt to take bound of something that is not an array"));
2900 /* Given that arr is an array type, returns the lower bound of the
2901 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2902 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2903 array-descriptor type. It works for other arrays with bounds supplied
2904 by run-time quantities other than discriminants. */
2907 ada_array_bound_from_type (struct type *arr_type, int n, int which)
2909 struct type *type, *index_type_desc, *index_type;
2912 gdb_assert (which == 0 || which == 1);
2914 if (ada_is_constrained_packed_array_type (arr_type))
2915 arr_type = decode_constrained_packed_array_type (arr_type);
2917 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
2918 return (LONGEST) - which;
2920 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2921 type = TYPE_TARGET_TYPE (arr_type);
2925 index_type_desc = ada_find_parallel_type (type, "___XA");
2926 ada_fixup_array_indexes_type (index_type_desc);
2927 if (index_type_desc != NULL)
2928 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2932 struct type *elt_type = check_typedef (type);
2934 for (i = 1; i < n; i++)
2935 elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type));
2937 index_type = TYPE_INDEX_TYPE (elt_type);
2941 (LONGEST) (which == 0
2942 ? ada_discrete_type_low_bound (index_type)
2943 : ada_discrete_type_high_bound (index_type));
2946 /* Given that arr is an array value, returns the lower bound of the
2947 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2948 WHICH is 1. This routine will also work for arrays with bounds
2949 supplied by run-time quantities other than discriminants. */
2952 ada_array_bound (struct value *arr, int n, int which)
2954 struct type *arr_type;
2956 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2957 arr = value_ind (arr);
2958 arr_type = value_enclosing_type (arr);
2960 if (ada_is_constrained_packed_array_type (arr_type))
2961 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
2962 else if (ada_is_simple_array_type (arr_type))
2963 return ada_array_bound_from_type (arr_type, n, which);
2965 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
2968 /* Given that arr is an array value, returns the length of the
2969 nth index. This routine will also work for arrays with bounds
2970 supplied by run-time quantities other than discriminants.
2971 Does not work for arrays indexed by enumeration types with representation
2972 clauses at the moment. */
2975 ada_array_length (struct value *arr, int n)
2977 struct type *arr_type;
2979 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
2980 arr = value_ind (arr);
2981 arr_type = value_enclosing_type (arr);
2983 if (ada_is_constrained_packed_array_type (arr_type))
2984 return ada_array_length (decode_constrained_packed_array (arr), n);
2986 if (ada_is_simple_array_type (arr_type))
2987 return (ada_array_bound_from_type (arr_type, n, 1)
2988 - ada_array_bound_from_type (arr_type, n, 0) + 1);
2990 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2991 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
2994 /* An empty array whose type is that of ARR_TYPE (an array type),
2995 with bounds LOW to LOW-1. */
2997 static struct value *
2998 empty_array (struct type *arr_type, int low)
3000 struct type *arr_type0 = ada_check_typedef (arr_type);
3001 struct type *index_type
3002 = create_static_range_type
3003 (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1);
3004 struct type *elt_type = ada_array_element_type (arr_type0, 1);
3006 return allocate_value (create_array_type (NULL, elt_type, index_type));
3010 /* Name resolution */
3012 /* The "decoded" name for the user-definable Ada operator corresponding
3016 ada_decoded_op_name (enum exp_opcode op)
3020 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
3022 if (ada_opname_table[i].op == op)
3023 return ada_opname_table[i].decoded;
3025 error (_("Could not find operator name for opcode"));
3029 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3030 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3031 undefined namespace) and converts operators that are
3032 user-defined into appropriate function calls. If CONTEXT_TYPE is
3033 non-null, it provides a preferred result type [at the moment, only
3034 type void has any effect---causing procedures to be preferred over
3035 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3036 return type is preferred. May change (expand) *EXP. */
3039 resolve (struct expression **expp, int void_context_p)
3041 struct type *context_type = NULL;
3045 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
3047 resolve_subexp (expp, &pc, 1, context_type);
3050 /* Resolve the operator of the subexpression beginning at
3051 position *POS of *EXPP. "Resolving" consists of replacing
3052 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3053 with their resolutions, replacing built-in operators with
3054 function calls to user-defined operators, where appropriate, and,
3055 when DEPROCEDURE_P is non-zero, converting function-valued variables
3056 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3057 are as in ada_resolve, above. */
3059 static struct value *
3060 resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
3061 struct type *context_type)
3065 struct expression *exp; /* Convenience: == *expp. */
3066 enum exp_opcode op = (*expp)->elts[pc].opcode;
3067 struct value **argvec; /* Vector of operand types (alloca'ed). */
3068 int nargs; /* Number of operands. */
3075 /* Pass one: resolve operands, saving their types and updating *pos,
3080 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3081 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3086 resolve_subexp (expp, pos, 0, NULL);
3088 nargs = longest_to_int (exp->elts[pc + 1].longconst);
3093 resolve_subexp (expp, pos, 0, NULL);
3098 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
3101 case OP_ATR_MODULUS:
3111 case TERNOP_IN_RANGE:
3112 case BINOP_IN_BOUNDS:
3118 case OP_DISCRETE_RANGE:
3120 ada_forward_operator_length (exp, pc, &oplen, &nargs);
3129 arg1 = resolve_subexp (expp, pos, 0, NULL);
3131 resolve_subexp (expp, pos, 1, NULL);
3133 resolve_subexp (expp, pos, 1, value_type (arg1));
3150 case BINOP_LOGICAL_AND:
3151 case BINOP_LOGICAL_OR:
3152 case BINOP_BITWISE_AND:
3153 case BINOP_BITWISE_IOR:
3154 case BINOP_BITWISE_XOR:
3157 case BINOP_NOTEQUAL:
3164 case BINOP_SUBSCRIPT:
3172 case UNOP_LOGICAL_NOT:
3188 case OP_INTERNALVAR:
3198 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3201 case STRUCTOP_STRUCT:
3202 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3215 error (_("Unexpected operator during name resolution"));
3218 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
3219 for (i = 0; i < nargs; i += 1)
3220 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3224 /* Pass two: perform any resolution on principal operator. */
3231 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
3233 struct ada_symbol_info *candidates;
3237 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3238 (exp->elts[pc + 2].symbol),
3239 exp->elts[pc + 1].block, VAR_DOMAIN,
3242 if (n_candidates > 1)
3244 /* Types tend to get re-introduced locally, so if there
3245 are any local symbols that are not types, first filter
3248 for (j = 0; j < n_candidates; j += 1)
3249 switch (SYMBOL_CLASS (candidates[j].sym))
3254 case LOC_REGPARM_ADDR:
3262 if (j < n_candidates)
3265 while (j < n_candidates)
3267 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3269 candidates[j] = candidates[n_candidates - 1];
3278 if (n_candidates == 0)
3279 error (_("No definition found for %s"),
3280 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3281 else if (n_candidates == 1)
3283 else if (deprocedure_p
3284 && !is_nonfunction (candidates, n_candidates))
3286 i = ada_resolve_function
3287 (candidates, n_candidates, NULL, 0,
3288 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3291 error (_("Could not find a match for %s"),
3292 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3296 printf_filtered (_("Multiple matches for %s\n"),
3297 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3298 user_select_syms (candidates, n_candidates, 1);
3302 exp->elts[pc + 1].block = candidates[i].block;
3303 exp->elts[pc + 2].symbol = candidates[i].sym;
3304 if (innermost_block == NULL
3305 || contained_in (candidates[i].block, innermost_block))
3306 innermost_block = candidates[i].block;
3310 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3313 replace_operator_with_call (expp, pc, 0, 0,
3314 exp->elts[pc + 2].symbol,
3315 exp->elts[pc + 1].block);
3322 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
3323 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3325 struct ada_symbol_info *candidates;
3329 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3330 (exp->elts[pc + 5].symbol),
3331 exp->elts[pc + 4].block, VAR_DOMAIN,
3333 if (n_candidates == 1)
3337 i = ada_resolve_function
3338 (candidates, n_candidates,
3340 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3343 error (_("Could not find a match for %s"),
3344 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3347 exp->elts[pc + 4].block = candidates[i].block;
3348 exp->elts[pc + 5].symbol = candidates[i].sym;
3349 if (innermost_block == NULL
3350 || contained_in (candidates[i].block, innermost_block))
3351 innermost_block = candidates[i].block;
3362 case BINOP_BITWISE_AND:
3363 case BINOP_BITWISE_IOR:
3364 case BINOP_BITWISE_XOR:
3366 case BINOP_NOTEQUAL:
3374 case UNOP_LOGICAL_NOT:
3376 if (possible_user_operator_p (op, argvec))
3378 struct ada_symbol_info *candidates;
3382 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3383 (struct block *) NULL, VAR_DOMAIN,
3385 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
3386 ada_decoded_op_name (op), NULL);
3390 replace_operator_with_call (expp, pc, nargs, 1,
3391 candidates[i].sym, candidates[i].block);
3402 return evaluate_subexp_type (exp, pos);
3405 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3406 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3408 /* The term "match" here is rather loose. The match is heuristic and
3412 ada_type_match (struct type *ftype, struct type *atype, int may_deref)
3414 ftype = ada_check_typedef (ftype);
3415 atype = ada_check_typedef (atype);
3417 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3418 ftype = TYPE_TARGET_TYPE (ftype);
3419 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3420 atype = TYPE_TARGET_TYPE (atype);
3422 switch (TYPE_CODE (ftype))
3425 return TYPE_CODE (ftype) == TYPE_CODE (atype);
3427 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
3428 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3429 TYPE_TARGET_TYPE (atype), 0);
3432 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
3434 case TYPE_CODE_ENUM:
3435 case TYPE_CODE_RANGE:
3436 switch (TYPE_CODE (atype))
3439 case TYPE_CODE_ENUM:
3440 case TYPE_CODE_RANGE:
3446 case TYPE_CODE_ARRAY:
3447 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3448 || ada_is_array_descriptor_type (atype));
3450 case TYPE_CODE_STRUCT:
3451 if (ada_is_array_descriptor_type (ftype))
3452 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3453 || ada_is_array_descriptor_type (atype));
3455 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3456 && !ada_is_array_descriptor_type (atype));
3458 case TYPE_CODE_UNION:
3460 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3464 /* Return non-zero if the formals of FUNC "sufficiently match" the
3465 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3466 may also be an enumeral, in which case it is treated as a 0-
3467 argument function. */
3470 ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
3473 struct type *func_type = SYMBOL_TYPE (func);
3475 if (SYMBOL_CLASS (func) == LOC_CONST
3476 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
3477 return (n_actuals == 0);
3478 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3481 if (TYPE_NFIELDS (func_type) != n_actuals)
3484 for (i = 0; i < n_actuals; i += 1)
3486 if (actuals[i] == NULL)
3490 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3492 struct type *atype = ada_check_typedef (value_type (actuals[i]));
3494 if (!ada_type_match (ftype, atype, 1))
3501 /* False iff function type FUNC_TYPE definitely does not produce a value
3502 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3503 FUNC_TYPE is not a valid function type with a non-null return type
3504 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3507 return_match (struct type *func_type, struct type *context_type)
3509 struct type *return_type;
3511 if (func_type == NULL)
3514 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3515 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
3517 return_type = get_base_type (func_type);
3518 if (return_type == NULL)
3521 context_type = get_base_type (context_type);
3523 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3524 return context_type == NULL || return_type == context_type;
3525 else if (context_type == NULL)
3526 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3528 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3532 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3533 function (if any) that matches the types of the NARGS arguments in
3534 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3535 that returns that type, then eliminate matches that don't. If
3536 CONTEXT_TYPE is void and there is at least one match that does not
3537 return void, eliminate all matches that do.
3539 Asks the user if there is more than one match remaining. Returns -1
3540 if there is no such symbol or none is selected. NAME is used
3541 solely for messages. May re-arrange and modify SYMS in
3542 the process; the index returned is for the modified vector. */
3545 ada_resolve_function (struct ada_symbol_info syms[],
3546 int nsyms, struct value **args, int nargs,
3547 const char *name, struct type *context_type)
3551 int m; /* Number of hits */
3554 /* In the first pass of the loop, we only accept functions matching
3555 context_type. If none are found, we add a second pass of the loop
3556 where every function is accepted. */
3557 for (fallback = 0; m == 0 && fallback < 2; fallback++)
3559 for (k = 0; k < nsyms; k += 1)
3561 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
3563 if (ada_args_match (syms[k].sym, args, nargs)
3564 && (fallback || return_match (type, context_type)))
3576 printf_filtered (_("Multiple matches for %s\n"), name);
3577 user_select_syms (syms, m, 1);
3583 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3584 in a listing of choices during disambiguation (see sort_choices, below).
3585 The idea is that overloadings of a subprogram name from the
3586 same package should sort in their source order. We settle for ordering
3587 such symbols by their trailing number (__N or $N). */
3590 encoded_ordered_before (const char *N0, const char *N1)
3594 else if (N0 == NULL)
3600 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
3602 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
3604 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
3605 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3610 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3613 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3615 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3616 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3618 return (strcmp (N0, N1) < 0);
3622 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3626 sort_choices (struct ada_symbol_info syms[], int nsyms)
3630 for (i = 1; i < nsyms; i += 1)
3632 struct ada_symbol_info sym = syms[i];
3635 for (j = i - 1; j >= 0; j -= 1)
3637 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3638 SYMBOL_LINKAGE_NAME (sym.sym)))
3640 syms[j + 1] = syms[j];
3646 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3647 by asking the user (if necessary), returning the number selected,
3648 and setting the first elements of SYMS items. Error if no symbols
3651 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3652 to be re-integrated one of these days. */
3655 user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
3658 int *chosen = (int *) alloca (sizeof (int) * nsyms);
3660 int first_choice = (max_results == 1) ? 1 : 2;
3661 const char *select_mode = multiple_symbols_select_mode ();
3663 if (max_results < 1)
3664 error (_("Request to select 0 symbols!"));
3668 if (select_mode == multiple_symbols_cancel)
3670 canceled because the command is ambiguous\n\
3671 See set/show multiple-symbol."));
3673 /* If select_mode is "all", then return all possible symbols.
3674 Only do that if more than one symbol can be selected, of course.
3675 Otherwise, display the menu as usual. */
3676 if (select_mode == multiple_symbols_all && max_results > 1)
3679 printf_unfiltered (_("[0] cancel\n"));
3680 if (max_results > 1)
3681 printf_unfiltered (_("[1] all\n"));
3683 sort_choices (syms, nsyms);
3685 for (i = 0; i < nsyms; i += 1)
3687 if (syms[i].sym == NULL)
3690 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3692 struct symtab_and_line sal =
3693 find_function_start_sal (syms[i].sym, 1);
3695 if (sal.symtab == NULL)
3696 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3698 SYMBOL_PRINT_NAME (syms[i].sym),
3701 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3702 SYMBOL_PRINT_NAME (syms[i].sym),
3703 symtab_to_filename_for_display (sal.symtab),
3710 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3711 && SYMBOL_TYPE (syms[i].sym) != NULL
3712 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3713 struct symtab *symtab = SYMBOL_SYMTAB (syms[i].sym);
3715 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
3716 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3718 SYMBOL_PRINT_NAME (syms[i].sym),
3719 symtab_to_filename_for_display (symtab),
3720 SYMBOL_LINE (syms[i].sym));
3721 else if (is_enumeral
3722 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
3724 printf_unfiltered (("[%d] "), i + first_choice);
3725 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3726 gdb_stdout, -1, 0, &type_print_raw_options);
3727 printf_unfiltered (_("'(%s) (enumeral)\n"),
3728 SYMBOL_PRINT_NAME (syms[i].sym));
3730 else if (symtab != NULL)
3731 printf_unfiltered (is_enumeral
3732 ? _("[%d] %s in %s (enumeral)\n")
3733 : _("[%d] %s at %s:?\n"),
3735 SYMBOL_PRINT_NAME (syms[i].sym),
3736 symtab_to_filename_for_display (symtab));
3738 printf_unfiltered (is_enumeral
3739 ? _("[%d] %s (enumeral)\n")
3740 : _("[%d] %s at ?\n"),
3742 SYMBOL_PRINT_NAME (syms[i].sym));
3746 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
3749 for (i = 0; i < n_chosen; i += 1)
3750 syms[i] = syms[chosen[i]];
3755 /* Read and validate a set of numeric choices from the user in the
3756 range 0 .. N_CHOICES-1. Place the results in increasing
3757 order in CHOICES[0 .. N-1], and return N.
3759 The user types choices as a sequence of numbers on one line
3760 separated by blanks, encoding them as follows:
3762 + A choice of 0 means to cancel the selection, throwing an error.
3763 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3764 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3766 The user is not allowed to choose more than MAX_RESULTS values.
3768 ANNOTATION_SUFFIX, if present, is used to annotate the input
3769 prompts (for use with the -f switch). */
3772 get_selections (int *choices, int n_choices, int max_results,
3773 int is_all_choice, char *annotation_suffix)
3778 int first_choice = is_all_choice ? 2 : 1;
3780 prompt = getenv ("PS2");
3784 args = command_line_input (prompt, 0, annotation_suffix);
3787 error_no_arg (_("one or more choice numbers"));
3791 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3792 order, as given in args. Choices are validated. */
3798 args = skip_spaces (args);
3799 if (*args == '\0' && n_chosen == 0)
3800 error_no_arg (_("one or more choice numbers"));
3801 else if (*args == '\0')
3804 choice = strtol (args, &args2, 10);
3805 if (args == args2 || choice < 0
3806 || choice > n_choices + first_choice - 1)
3807 error (_("Argument must be choice number"));
3811 error (_("cancelled"));
3813 if (choice < first_choice)
3815 n_chosen = n_choices;
3816 for (j = 0; j < n_choices; j += 1)
3820 choice -= first_choice;
3822 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
3826 if (j < 0 || choice != choices[j])
3830 for (k = n_chosen - 1; k > j; k -= 1)
3831 choices[k + 1] = choices[k];
3832 choices[j + 1] = choice;
3837 if (n_chosen > max_results)
3838 error (_("Select no more than %d of the above"), max_results);
3843 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3844 on the function identified by SYM and BLOCK, and taking NARGS
3845 arguments. Update *EXPP as needed to hold more space. */
3848 replace_operator_with_call (struct expression **expp, int pc, int nargs,
3849 int oplen, struct symbol *sym,
3850 const struct block *block)
3852 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3853 symbol, -oplen for operator being replaced). */
3854 struct expression *newexp = (struct expression *)
3855 xzalloc (sizeof (struct expression)
3856 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
3857 struct expression *exp = *expp;
3859 newexp->nelts = exp->nelts + 7 - oplen;
3860 newexp->language_defn = exp->language_defn;
3861 newexp->gdbarch = exp->gdbarch;
3862 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
3863 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
3864 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
3866 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3867 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3869 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3870 newexp->elts[pc + 4].block = block;
3871 newexp->elts[pc + 5].symbol = sym;
3877 /* Type-class predicates */
3879 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3883 numeric_type_p (struct type *type)
3889 switch (TYPE_CODE (type))
3894 case TYPE_CODE_RANGE:
3895 return (type == TYPE_TARGET_TYPE (type)
3896 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3903 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3906 integer_type_p (struct type *type)
3912 switch (TYPE_CODE (type))
3916 case TYPE_CODE_RANGE:
3917 return (type == TYPE_TARGET_TYPE (type)
3918 || integer_type_p (TYPE_TARGET_TYPE (type)));
3925 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3928 scalar_type_p (struct type *type)
3934 switch (TYPE_CODE (type))
3937 case TYPE_CODE_RANGE:
3938 case TYPE_CODE_ENUM:
3947 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3950 discrete_type_p (struct type *type)
3956 switch (TYPE_CODE (type))
3959 case TYPE_CODE_RANGE:
3960 case TYPE_CODE_ENUM:
3961 case TYPE_CODE_BOOL:
3969 /* Returns non-zero if OP with operands in the vector ARGS could be
3970 a user-defined function. Errs on the side of pre-defined operators
3971 (i.e., result 0). */
3974 possible_user_operator_p (enum exp_opcode op, struct value *args[])
3976 struct type *type0 =
3977 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
3978 struct type *type1 =
3979 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
3993 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
3997 case BINOP_BITWISE_AND:
3998 case BINOP_BITWISE_IOR:
3999 case BINOP_BITWISE_XOR:
4000 return (!(integer_type_p (type0) && integer_type_p (type1)));
4003 case BINOP_NOTEQUAL:
4008 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
4011 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
4014 return (!(numeric_type_p (type0) && integer_type_p (type1)));
4018 case UNOP_LOGICAL_NOT:
4020 return (!numeric_type_p (type0));
4029 1. In the following, we assume that a renaming type's name may
4030 have an ___XD suffix. It would be nice if this went away at some
4032 2. We handle both the (old) purely type-based representation of
4033 renamings and the (new) variable-based encoding. At some point,
4034 it is devoutly to be hoped that the former goes away
4035 (FIXME: hilfinger-2007-07-09).
4036 3. Subprogram renamings are not implemented, although the XRS
4037 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4039 /* If SYM encodes a renaming,
4041 <renaming> renames <renamed entity>,
4043 sets *LEN to the length of the renamed entity's name,
4044 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4045 the string describing the subcomponent selected from the renamed
4046 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4047 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4048 are undefined). Otherwise, returns a value indicating the category
4049 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4050 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4051 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4052 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4053 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4054 may be NULL, in which case they are not assigned.
4056 [Currently, however, GCC does not generate subprogram renamings.] */
4058 enum ada_renaming_category
4059 ada_parse_renaming (struct symbol *sym,
4060 const char **renamed_entity, int *len,
4061 const char **renaming_expr)
4063 enum ada_renaming_category kind;
4068 return ADA_NOT_RENAMING;
4069 switch (SYMBOL_CLASS (sym))
4072 return ADA_NOT_RENAMING;
4074 return parse_old_style_renaming (SYMBOL_TYPE (sym),
4075 renamed_entity, len, renaming_expr);
4079 case LOC_OPTIMIZED_OUT:
4080 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
4082 return ADA_NOT_RENAMING;
4086 kind = ADA_OBJECT_RENAMING;
4090 kind = ADA_EXCEPTION_RENAMING;
4094 kind = ADA_PACKAGE_RENAMING;
4098 kind = ADA_SUBPROGRAM_RENAMING;
4102 return ADA_NOT_RENAMING;
4106 if (renamed_entity != NULL)
4107 *renamed_entity = info;
4108 suffix = strstr (info, "___XE");
4109 if (suffix == NULL || suffix == info)
4110 return ADA_NOT_RENAMING;
4112 *len = strlen (info) - strlen (suffix);
4114 if (renaming_expr != NULL)
4115 *renaming_expr = suffix;
4119 /* Assuming TYPE encodes a renaming according to the old encoding in
4120 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4121 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4122 ADA_NOT_RENAMING otherwise. */
4123 static enum ada_renaming_category
4124 parse_old_style_renaming (struct type *type,
4125 const char **renamed_entity, int *len,
4126 const char **renaming_expr)
4128 enum ada_renaming_category kind;
4133 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4134 || TYPE_NFIELDS (type) != 1)
4135 return ADA_NOT_RENAMING;
4137 name = type_name_no_tag (type);
4139 return ADA_NOT_RENAMING;
4141 name = strstr (name, "___XR");
4143 return ADA_NOT_RENAMING;
4148 kind = ADA_OBJECT_RENAMING;
4151 kind = ADA_EXCEPTION_RENAMING;
4154 kind = ADA_PACKAGE_RENAMING;
4157 kind = ADA_SUBPROGRAM_RENAMING;
4160 return ADA_NOT_RENAMING;
4163 info = TYPE_FIELD_NAME (type, 0);
4165 return ADA_NOT_RENAMING;
4166 if (renamed_entity != NULL)
4167 *renamed_entity = info;
4168 suffix = strstr (info, "___XE");
4169 if (renaming_expr != NULL)
4170 *renaming_expr = suffix + 5;
4171 if (suffix == NULL || suffix == info)
4172 return ADA_NOT_RENAMING;
4174 *len = suffix - info;
4178 /* Compute the value of the given RENAMING_SYM, which is expected to
4179 be a symbol encoding a renaming expression. BLOCK is the block
4180 used to evaluate the renaming. */
4182 static struct value *
4183 ada_read_renaming_var_value (struct symbol *renaming_sym,
4184 const struct block *block)
4186 const char *sym_name;
4187 struct expression *expr;
4188 struct value *value;
4189 struct cleanup *old_chain = NULL;
4191 sym_name = SYMBOL_LINKAGE_NAME (renaming_sym);
4192 expr = parse_exp_1 (&sym_name, 0, block, 0);
4193 old_chain = make_cleanup (free_current_contents, &expr);
4194 value = evaluate_expression (expr);
4196 do_cleanups (old_chain);
4201 /* Evaluation: Function Calls */
4203 /* Return an lvalue containing the value VAL. This is the identity on
4204 lvalues, and otherwise has the side-effect of allocating memory
4205 in the inferior where a copy of the value contents is copied. */
4207 static struct value *
4208 ensure_lval (struct value *val)
4210 if (VALUE_LVAL (val) == not_lval
4211 || VALUE_LVAL (val) == lval_internalvar)
4213 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
4214 const CORE_ADDR addr =
4215 value_as_long (value_allocate_space_in_inferior (len));
4217 set_value_address (val, addr);
4218 VALUE_LVAL (val) = lval_memory;
4219 write_memory (addr, value_contents (val), len);
4225 /* Return the value ACTUAL, converted to be an appropriate value for a
4226 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4227 allocating any necessary descriptors (fat pointers), or copies of
4228 values not residing in memory, updating it as needed. */
4231 ada_convert_actual (struct value *actual, struct type *formal_type0)
4233 struct type *actual_type = ada_check_typedef (value_type (actual));
4234 struct type *formal_type = ada_check_typedef (formal_type0);
4235 struct type *formal_target =
4236 TYPE_CODE (formal_type) == TYPE_CODE_PTR
4237 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
4238 struct type *actual_target =
4239 TYPE_CODE (actual_type) == TYPE_CODE_PTR
4240 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
4242 if (ada_is_array_descriptor_type (formal_target)
4243 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
4244 return make_array_descriptor (formal_type, actual);
4245 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4246 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
4248 struct value *result;
4250 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4251 && ada_is_array_descriptor_type (actual_target))
4252 result = desc_data (actual);
4253 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4255 if (VALUE_LVAL (actual) != lval_memory)
4259 actual_type = ada_check_typedef (value_type (actual));
4260 val = allocate_value (actual_type);
4261 memcpy ((char *) value_contents_raw (val),
4262 (char *) value_contents (actual),
4263 TYPE_LENGTH (actual_type));
4264 actual = ensure_lval (val);
4266 result = value_addr (actual);
4270 return value_cast_pointers (formal_type, result, 0);
4272 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4273 return ada_value_ind (actual);
4278 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4279 type TYPE. This is usually an inefficient no-op except on some targets
4280 (such as AVR) where the representation of a pointer and an address
4284 value_pointer (struct value *value, struct type *type)
4286 struct gdbarch *gdbarch = get_type_arch (type);
4287 unsigned len = TYPE_LENGTH (type);
4288 gdb_byte *buf = alloca (len);
4291 addr = value_address (value);
4292 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4293 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4298 /* Push a descriptor of type TYPE for array value ARR on the stack at
4299 *SP, updating *SP to reflect the new descriptor. Return either
4300 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4301 to-descriptor type rather than a descriptor type), a struct value *
4302 representing a pointer to this descriptor. */
4304 static struct value *
4305 make_array_descriptor (struct type *type, struct value *arr)
4307 struct type *bounds_type = desc_bounds_type (type);
4308 struct type *desc_type = desc_base_type (type);
4309 struct value *descriptor = allocate_value (desc_type);
4310 struct value *bounds = allocate_value (bounds_type);
4313 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4316 modify_field (value_type (bounds), value_contents_writeable (bounds),
4317 ada_array_bound (arr, i, 0),
4318 desc_bound_bitpos (bounds_type, i, 0),
4319 desc_bound_bitsize (bounds_type, i, 0));
4320 modify_field (value_type (bounds), value_contents_writeable (bounds),
4321 ada_array_bound (arr, i, 1),
4322 desc_bound_bitpos (bounds_type, i, 1),
4323 desc_bound_bitsize (bounds_type, i, 1));
4326 bounds = ensure_lval (bounds);
4328 modify_field (value_type (descriptor),
4329 value_contents_writeable (descriptor),
4330 value_pointer (ensure_lval (arr),
4331 TYPE_FIELD_TYPE (desc_type, 0)),
4332 fat_pntr_data_bitpos (desc_type),
4333 fat_pntr_data_bitsize (desc_type));
4335 modify_field (value_type (descriptor),
4336 value_contents_writeable (descriptor),
4337 value_pointer (bounds,
4338 TYPE_FIELD_TYPE (desc_type, 1)),
4339 fat_pntr_bounds_bitpos (desc_type),
4340 fat_pntr_bounds_bitsize (desc_type));
4342 descriptor = ensure_lval (descriptor);
4344 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4345 return value_addr (descriptor);
4350 /* Symbol Cache Module */
4352 /* Performance measurements made as of 2010-01-15 indicate that
4353 this cache does bring some noticeable improvements. Depending
4354 on the type of entity being printed, the cache can make it as much
4355 as an order of magnitude faster than without it.
4357 The descriptive type DWARF extension has significantly reduced
4358 the need for this cache, at least when DWARF is being used. However,
4359 even in this case, some expensive name-based symbol searches are still
4360 sometimes necessary - to find an XVZ variable, mostly. */
4362 /* Initialize the contents of SYM_CACHE. */
4365 ada_init_symbol_cache (struct ada_symbol_cache *sym_cache)
4367 obstack_init (&sym_cache->cache_space);
4368 memset (sym_cache->root, '\000', sizeof (sym_cache->root));
4371 /* Free the memory used by SYM_CACHE. */
4374 ada_free_symbol_cache (struct ada_symbol_cache *sym_cache)
4376 obstack_free (&sym_cache->cache_space, NULL);
4380 /* Return the symbol cache associated to the given program space PSPACE.
4381 If not allocated for this PSPACE yet, allocate and initialize one. */
4383 static struct ada_symbol_cache *
4384 ada_get_symbol_cache (struct program_space *pspace)
4386 struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace);
4387 struct ada_symbol_cache *sym_cache = pspace_data->sym_cache;
4389 if (sym_cache == NULL)
4391 sym_cache = XCNEW (struct ada_symbol_cache);
4392 ada_init_symbol_cache (sym_cache);
4398 /* Clear all entries from the symbol cache. */
4401 ada_clear_symbol_cache (void)
4403 struct ada_symbol_cache *sym_cache
4404 = ada_get_symbol_cache (current_program_space);
4406 obstack_free (&sym_cache->cache_space, NULL);
4407 ada_init_symbol_cache (sym_cache);
4410 /* Search our cache for an entry matching NAME and NAMESPACE.
4411 Return it if found, or NULL otherwise. */
4413 static struct cache_entry **
4414 find_entry (const char *name, domain_enum namespace)
4416 struct ada_symbol_cache *sym_cache
4417 = ada_get_symbol_cache (current_program_space);
4418 int h = msymbol_hash (name) % HASH_SIZE;
4419 struct cache_entry **e;
4421 for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next)
4423 if (namespace == (*e)->namespace && strcmp (name, (*e)->name) == 0)
4429 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4430 Return 1 if found, 0 otherwise.
4432 If an entry was found and SYM is not NULL, set *SYM to the entry's
4433 SYM. Same principle for BLOCK if not NULL. */
4436 lookup_cached_symbol (const char *name, domain_enum namespace,
4437 struct symbol **sym, const struct block **block)
4439 struct cache_entry **e = find_entry (name, namespace);
4446 *block = (*e)->block;
4450 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4451 in domain NAMESPACE, save this result in our symbol cache. */
4454 cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
4455 const struct block *block)
4457 struct ada_symbol_cache *sym_cache
4458 = ada_get_symbol_cache (current_program_space);
4461 struct cache_entry *e;
4463 /* If the symbol is a local symbol, then do not cache it, as a search
4464 for that symbol depends on the context. To determine whether
4465 the symbol is local or not, we check the block where we found it
4466 against the global and static blocks of its associated symtab. */
4468 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (sym->symtab),
4469 GLOBAL_BLOCK) != block
4470 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (sym->symtab),
4471 STATIC_BLOCK) != block)
4474 h = msymbol_hash (name) % HASH_SIZE;
4475 e = (struct cache_entry *) obstack_alloc (&sym_cache->cache_space,
4477 e->next = sym_cache->root[h];
4478 sym_cache->root[h] = e;
4479 e->name = copy = obstack_alloc (&sym_cache->cache_space, strlen (name) + 1);
4480 strcpy (copy, name);
4482 e->namespace = namespace;
4488 /* Return nonzero if wild matching should be used when searching for
4489 all symbols matching LOOKUP_NAME.
4491 LOOKUP_NAME is expected to be a symbol name after transformation
4492 for Ada lookups (see ada_name_for_lookup). */
4495 should_use_wild_match (const char *lookup_name)
4497 return (strstr (lookup_name, "__") == NULL);
4500 /* Return the result of a standard (literal, C-like) lookup of NAME in
4501 given DOMAIN, visible from lexical block BLOCK. */
4503 static struct symbol *
4504 standard_lookup (const char *name, const struct block *block,
4507 /* Initialize it just to avoid a GCC false warning. */
4508 struct symbol *sym = NULL;
4510 if (lookup_cached_symbol (name, domain, &sym, NULL))
4512 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4513 cache_symbol (name, domain, sym, block_found);
4518 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4519 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4520 since they contend in overloading in the same way. */
4522 is_nonfunction (struct ada_symbol_info syms[], int n)
4526 for (i = 0; i < n; i += 1)
4527 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4528 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4529 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
4535 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4536 struct types. Otherwise, they may not. */
4539 equiv_types (struct type *type0, struct type *type1)
4543 if (type0 == NULL || type1 == NULL
4544 || TYPE_CODE (type0) != TYPE_CODE (type1))
4546 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
4547 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4548 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4549 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
4555 /* True iff SYM0 represents the same entity as SYM1, or one that is
4556 no more defined than that of SYM1. */
4559 lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
4563 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
4564 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4567 switch (SYMBOL_CLASS (sym0))
4573 struct type *type0 = SYMBOL_TYPE (sym0);
4574 struct type *type1 = SYMBOL_TYPE (sym1);
4575 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4576 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4577 int len0 = strlen (name0);
4580 TYPE_CODE (type0) == TYPE_CODE (type1)
4581 && (equiv_types (type0, type1)
4582 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4583 && strncmp (name1 + len0, "___XV", 5) == 0));
4586 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4587 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
4593 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4594 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4597 add_defn_to_vec (struct obstack *obstackp,
4599 const struct block *block)
4602 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
4604 /* Do not try to complete stub types, as the debugger is probably
4605 already scanning all symbols matching a certain name at the
4606 time when this function is called. Trying to replace the stub
4607 type by its associated full type will cause us to restart a scan
4608 which may lead to an infinite recursion. Instead, the client
4609 collecting the matching symbols will end up collecting several
4610 matches, with at least one of them complete. It can then filter
4611 out the stub ones if needed. */
4613 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4615 if (lesseq_defined_than (sym, prevDefns[i].sym))
4617 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4619 prevDefns[i].sym = sym;
4620 prevDefns[i].block = block;
4626 struct ada_symbol_info info;
4630 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4634 /* Number of ada_symbol_info structures currently collected in
4635 current vector in *OBSTACKP. */
4638 num_defns_collected (struct obstack *obstackp)
4640 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4643 /* Vector of ada_symbol_info structures currently collected in current
4644 vector in *OBSTACKP. If FINISH, close off the vector and return
4645 its final address. */
4647 static struct ada_symbol_info *
4648 defns_collected (struct obstack *obstackp, int finish)
4651 return obstack_finish (obstackp);
4653 return (struct ada_symbol_info *) obstack_base (obstackp);
4656 /* Return a bound minimal symbol matching NAME according to Ada
4657 decoding rules. Returns an invalid symbol if there is no such
4658 minimal symbol. Names prefixed with "standard__" are handled
4659 specially: "standard__" is first stripped off, and only static and
4660 global symbols are searched. */
4662 struct bound_minimal_symbol
4663 ada_lookup_simple_minsym (const char *name)
4665 struct bound_minimal_symbol result;
4666 struct objfile *objfile;
4667 struct minimal_symbol *msymbol;
4668 const int wild_match_p = should_use_wild_match (name);
4670 memset (&result, 0, sizeof (result));
4672 /* Special case: If the user specifies a symbol name inside package
4673 Standard, do a non-wild matching of the symbol name without
4674 the "standard__" prefix. This was primarily introduced in order
4675 to allow the user to specifically access the standard exceptions
4676 using, for instance, Standard.Constraint_Error when Constraint_Error
4677 is ambiguous (due to the user defining its own Constraint_Error
4678 entity inside its program). */
4679 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4680 name += sizeof ("standard__") - 1;
4682 ALL_MSYMBOLS (objfile, msymbol)
4684 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), name, wild_match_p)
4685 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4687 result.minsym = msymbol;
4688 result.objfile = objfile;
4696 /* For all subprograms that statically enclose the subprogram of the
4697 selected frame, add symbols matching identifier NAME in DOMAIN
4698 and their blocks to the list of data in OBSTACKP, as for
4699 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4700 with a wildcard prefix. */
4703 add_symbols_from_enclosing_procs (struct obstack *obstackp,
4704 const char *name, domain_enum namespace,
4709 /* True if TYPE is definitely an artificial type supplied to a symbol
4710 for which no debugging information was given in the symbol file. */
4713 is_nondebugging_type (struct type *type)
4715 const char *name = ada_type_name (type);
4717 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4720 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4721 that are deemed "identical" for practical purposes.
4723 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4724 types and that their number of enumerals is identical (in other
4725 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4728 ada_identical_enum_types_p (struct type *type1, struct type *type2)
4732 /* The heuristic we use here is fairly conservative. We consider
4733 that 2 enumerate types are identical if they have the same
4734 number of enumerals and that all enumerals have the same
4735 underlying value and name. */
4737 /* All enums in the type should have an identical underlying value. */
4738 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4739 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
4742 /* All enumerals should also have the same name (modulo any numerical
4744 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4746 const char *name_1 = TYPE_FIELD_NAME (type1, i);
4747 const char *name_2 = TYPE_FIELD_NAME (type2, i);
4748 int len_1 = strlen (name_1);
4749 int len_2 = strlen (name_2);
4751 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
4752 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
4754 || strncmp (TYPE_FIELD_NAME (type1, i),
4755 TYPE_FIELD_NAME (type2, i),
4763 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4764 that are deemed "identical" for practical purposes. Sometimes,
4765 enumerals are not strictly identical, but their types are so similar
4766 that they can be considered identical.
4768 For instance, consider the following code:
4770 type Color is (Black, Red, Green, Blue, White);
4771 type RGB_Color is new Color range Red .. Blue;
4773 Type RGB_Color is a subrange of an implicit type which is a copy
4774 of type Color. If we call that implicit type RGB_ColorB ("B" is
4775 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4776 As a result, when an expression references any of the enumeral
4777 by name (Eg. "print green"), the expression is technically
4778 ambiguous and the user should be asked to disambiguate. But
4779 doing so would only hinder the user, since it wouldn't matter
4780 what choice he makes, the outcome would always be the same.
4781 So, for practical purposes, we consider them as the same. */
4784 symbols_are_identical_enums (struct ada_symbol_info *syms, int nsyms)
4788 /* Before performing a thorough comparison check of each type,
4789 we perform a series of inexpensive checks. We expect that these
4790 checks will quickly fail in the vast majority of cases, and thus
4791 help prevent the unnecessary use of a more expensive comparison.
4792 Said comparison also expects us to make some of these checks
4793 (see ada_identical_enum_types_p). */
4795 /* Quick check: All symbols should have an enum type. */
4796 for (i = 0; i < nsyms; i++)
4797 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM)
4800 /* Quick check: They should all have the same value. */
4801 for (i = 1; i < nsyms; i++)
4802 if (SYMBOL_VALUE (syms[i].sym) != SYMBOL_VALUE (syms[0].sym))
4805 /* Quick check: They should all have the same number of enumerals. */
4806 for (i = 1; i < nsyms; i++)
4807 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].sym))
4808 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].sym)))
4811 /* All the sanity checks passed, so we might have a set of
4812 identical enumeration types. Perform a more complete
4813 comparison of the type of each symbol. */
4814 for (i = 1; i < nsyms; i++)
4815 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].sym),
4816 SYMBOL_TYPE (syms[0].sym)))
4822 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4823 duplicate other symbols in the list (The only case I know of where
4824 this happens is when object files containing stabs-in-ecoff are
4825 linked with files containing ordinary ecoff debugging symbols (or no
4826 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4827 Returns the number of items in the modified list. */
4830 remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4834 /* We should never be called with less than 2 symbols, as there
4835 cannot be any extra symbol in that case. But it's easy to
4836 handle, since we have nothing to do in that case. */
4845 /* If two symbols have the same name and one of them is a stub type,
4846 the get rid of the stub. */
4848 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4849 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4851 for (j = 0; j < nsyms; j++)
4854 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4855 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4856 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4857 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
4862 /* Two symbols with the same name, same class and same address
4863 should be identical. */
4865 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4866 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4867 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4869 for (j = 0; j < nsyms; j += 1)
4872 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4873 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4874 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
4875 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4876 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4877 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4884 for (j = i + 1; j < nsyms; j += 1)
4885 syms[j - 1] = syms[j];
4892 /* If all the remaining symbols are identical enumerals, then
4893 just keep the first one and discard the rest.
4895 Unlike what we did previously, we do not discard any entry
4896 unless they are ALL identical. This is because the symbol
4897 comparison is not a strict comparison, but rather a practical
4898 comparison. If all symbols are considered identical, then
4899 we can just go ahead and use the first one and discard the rest.
4900 But if we cannot reduce the list to a single element, we have
4901 to ask the user to disambiguate anyways. And if we have to
4902 present a multiple-choice menu, it's less confusing if the list
4903 isn't missing some choices that were identical and yet distinct. */
4904 if (symbols_are_identical_enums (syms, nsyms))
4910 /* Given a type that corresponds to a renaming entity, use the type name
4911 to extract the scope (package name or function name, fully qualified,
4912 and following the GNAT encoding convention) where this renaming has been
4913 defined. The string returned needs to be deallocated after use. */
4916 xget_renaming_scope (struct type *renaming_type)
4918 /* The renaming types adhere to the following convention:
4919 <scope>__<rename>___<XR extension>.
4920 So, to extract the scope, we search for the "___XR" extension,
4921 and then backtrack until we find the first "__". */
4923 const char *name = type_name_no_tag (renaming_type);
4924 char *suffix = strstr (name, "___XR");
4929 /* Now, backtrack a bit until we find the first "__". Start looking
4930 at suffix - 3, as the <rename> part is at least one character long. */
4932 for (last = suffix - 3; last > name; last--)
4933 if (last[0] == '_' && last[1] == '_')
4936 /* Make a copy of scope and return it. */
4938 scope_len = last - name;
4939 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
4941 strncpy (scope, name, scope_len);
4942 scope[scope_len] = '\0';
4947 /* Return nonzero if NAME corresponds to a package name. */
4950 is_package_name (const char *name)
4952 /* Here, We take advantage of the fact that no symbols are generated
4953 for packages, while symbols are generated for each function.
4954 So the condition for NAME represent a package becomes equivalent
4955 to NAME not existing in our list of symbols. There is only one
4956 small complication with library-level functions (see below). */
4960 /* If it is a function that has not been defined at library level,
4961 then we should be able to look it up in the symbols. */
4962 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4965 /* Library-level function names start with "_ada_". See if function
4966 "_ada_" followed by NAME can be found. */
4968 /* Do a quick check that NAME does not contain "__", since library-level
4969 functions names cannot contain "__" in them. */
4970 if (strstr (name, "__") != NULL)
4973 fun_name = xstrprintf ("_ada_%s", name);
4975 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4978 /* Return nonzero if SYM corresponds to a renaming entity that is
4979 not visible from FUNCTION_NAME. */
4982 old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
4985 struct cleanup *old_chain;
4987 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4990 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
4991 old_chain = make_cleanup (xfree, scope);
4993 /* If the rename has been defined in a package, then it is visible. */
4994 if (is_package_name (scope))
4996 do_cleanups (old_chain);
5000 /* Check that the rename is in the current function scope by checking
5001 that its name starts with SCOPE. */
5003 /* If the function name starts with "_ada_", it means that it is
5004 a library-level function. Strip this prefix before doing the
5005 comparison, as the encoding for the renaming does not contain
5007 if (strncmp (function_name, "_ada_", 5) == 0)
5011 int is_invisible = strncmp (function_name, scope, strlen (scope)) != 0;
5013 do_cleanups (old_chain);
5014 return is_invisible;
5018 /* Remove entries from SYMS that corresponds to a renaming entity that
5019 is not visible from the function associated with CURRENT_BLOCK or
5020 that is superfluous due to the presence of more specific renaming
5021 information. Places surviving symbols in the initial entries of
5022 SYMS and returns the number of surviving symbols.
5025 First, in cases where an object renaming is implemented as a
5026 reference variable, GNAT may produce both the actual reference
5027 variable and the renaming encoding. In this case, we discard the
5030 Second, GNAT emits a type following a specified encoding for each renaming
5031 entity. Unfortunately, STABS currently does not support the definition
5032 of types that are local to a given lexical block, so all renamings types
5033 are emitted at library level. As a consequence, if an application
5034 contains two renaming entities using the same name, and a user tries to
5035 print the value of one of these entities, the result of the ada symbol
5036 lookup will also contain the wrong renaming type.
5038 This function partially covers for this limitation by attempting to
5039 remove from the SYMS list renaming symbols that should be visible
5040 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5041 method with the current information available. The implementation
5042 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5044 - When the user tries to print a rename in a function while there
5045 is another rename entity defined in a package: Normally, the
5046 rename in the function has precedence over the rename in the
5047 package, so the latter should be removed from the list. This is
5048 currently not the case.
5050 - This function will incorrectly remove valid renames if
5051 the CURRENT_BLOCK corresponds to a function which symbol name
5052 has been changed by an "Export" pragma. As a consequence,
5053 the user will be unable to print such rename entities. */
5056 remove_irrelevant_renamings (struct ada_symbol_info *syms,
5057 int nsyms, const struct block *current_block)
5059 struct symbol *current_function;
5060 const char *current_function_name;
5062 int is_new_style_renaming;
5064 /* If there is both a renaming foo___XR... encoded as a variable and
5065 a simple variable foo in the same block, discard the latter.
5066 First, zero out such symbols, then compress. */
5067 is_new_style_renaming = 0;
5068 for (i = 0; i < nsyms; i += 1)
5070 struct symbol *sym = syms[i].sym;
5071 const struct block *block = syms[i].block;
5075 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
5077 name = SYMBOL_LINKAGE_NAME (sym);
5078 suffix = strstr (name, "___XR");
5082 int name_len = suffix - name;
5085 is_new_style_renaming = 1;
5086 for (j = 0; j < nsyms; j += 1)
5087 if (i != j && syms[j].sym != NULL
5088 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
5090 && block == syms[j].block)
5094 if (is_new_style_renaming)
5098 for (j = k = 0; j < nsyms; j += 1)
5099 if (syms[j].sym != NULL)
5107 /* Extract the function name associated to CURRENT_BLOCK.
5108 Abort if unable to do so. */
5110 if (current_block == NULL)
5113 current_function = block_linkage_function (current_block);
5114 if (current_function == NULL)
5117 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
5118 if (current_function_name == NULL)
5121 /* Check each of the symbols, and remove it from the list if it is
5122 a type corresponding to a renaming that is out of the scope of
5123 the current block. */
5128 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
5129 == ADA_OBJECT_RENAMING
5130 && old_renaming_is_invisible (syms[i].sym, current_function_name))
5134 for (j = i + 1; j < nsyms; j += 1)
5135 syms[j - 1] = syms[j];
5145 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5146 whose name and domain match NAME and DOMAIN respectively.
5147 If no match was found, then extend the search to "enclosing"
5148 routines (in other words, if we're inside a nested function,
5149 search the symbols defined inside the enclosing functions).
5150 If WILD_MATCH_P is nonzero, perform the naming matching in
5151 "wild" mode (see function "wild_match" for more info).
5153 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5156 ada_add_local_symbols (struct obstack *obstackp, const char *name,
5157 const struct block *block, domain_enum domain,
5160 int block_depth = 0;
5162 while (block != NULL)
5165 ada_add_block_symbols (obstackp, block, name, domain, NULL,
5168 /* If we found a non-function match, assume that's the one. */
5169 if (is_nonfunction (defns_collected (obstackp, 0),
5170 num_defns_collected (obstackp)))
5173 block = BLOCK_SUPERBLOCK (block);
5176 /* If no luck so far, try to find NAME as a local symbol in some lexically
5177 enclosing subprogram. */
5178 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
5179 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match_p);
5182 /* An object of this type is used as the user_data argument when
5183 calling the map_matching_symbols method. */
5187 struct objfile *objfile;
5188 struct obstack *obstackp;
5189 struct symbol *arg_sym;
5193 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5194 to a list of symbols. DATA0 is a pointer to a struct match_data *
5195 containing the obstack that collects the symbol list, the file that SYM
5196 must come from, a flag indicating whether a non-argument symbol has
5197 been found in the current block, and the last argument symbol
5198 passed in SYM within the current block (if any). When SYM is null,
5199 marking the end of a block, the argument symbol is added if no
5200 other has been found. */
5203 aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
5205 struct match_data *data = (struct match_data *) data0;
5209 if (!data->found_sym && data->arg_sym != NULL)
5210 add_defn_to_vec (data->obstackp,
5211 fixup_symbol_section (data->arg_sym, data->objfile),
5213 data->found_sym = 0;
5214 data->arg_sym = NULL;
5218 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5220 else if (SYMBOL_IS_ARGUMENT (sym))
5221 data->arg_sym = sym;
5224 data->found_sym = 1;
5225 add_defn_to_vec (data->obstackp,
5226 fixup_symbol_section (sym, data->objfile),
5233 /* Implements compare_names, but only applying the comparision using
5234 the given CASING. */
5237 compare_names_with_case (const char *string1, const char *string2,
5238 enum case_sensitivity casing)
5240 while (*string1 != '\0' && *string2 != '\0')
5244 if (isspace (*string1) || isspace (*string2))
5245 return strcmp_iw_ordered (string1, string2);
5247 if (casing == case_sensitive_off)
5249 c1 = tolower (*string1);
5250 c2 = tolower (*string2);
5267 return strcmp_iw_ordered (string1, string2);
5269 if (*string2 == '\0')
5271 if (is_name_suffix (string1))
5278 if (*string2 == '(')
5279 return strcmp_iw_ordered (string1, string2);
5282 if (casing == case_sensitive_off)
5283 return tolower (*string1) - tolower (*string2);
5285 return *string1 - *string2;
5290 /* Compare STRING1 to STRING2, with results as for strcmp.
5291 Compatible with strcmp_iw_ordered in that...
5293 strcmp_iw_ordered (STRING1, STRING2) <= 0
5297 compare_names (STRING1, STRING2) <= 0
5299 (they may differ as to what symbols compare equal). */
5302 compare_names (const char *string1, const char *string2)
5306 /* Similar to what strcmp_iw_ordered does, we need to perform
5307 a case-insensitive comparison first, and only resort to
5308 a second, case-sensitive, comparison if the first one was
5309 not sufficient to differentiate the two strings. */
5311 result = compare_names_with_case (string1, string2, case_sensitive_off);
5313 result = compare_names_with_case (string1, string2, case_sensitive_on);
5318 /* Add to OBSTACKP all non-local symbols whose name and domain match
5319 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5320 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5323 add_nonlocal_symbols (struct obstack *obstackp, const char *name,
5324 domain_enum domain, int global,
5327 struct objfile *objfile;
5328 struct match_data data;
5330 memset (&data, 0, sizeof data);
5331 data.obstackp = obstackp;
5333 ALL_OBJFILES (objfile)
5335 data.objfile = objfile;
5338 objfile->sf->qf->map_matching_symbols (objfile, name, domain, global,
5339 aux_add_nonlocal_symbols, &data,
5342 objfile->sf->qf->map_matching_symbols (objfile, name, domain, global,
5343 aux_add_nonlocal_symbols, &data,
5344 full_match, compare_names);
5347 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5349 ALL_OBJFILES (objfile)
5351 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
5352 strcpy (name1, "_ada_");
5353 strcpy (name1 + sizeof ("_ada_") - 1, name);
5354 data.objfile = objfile;
5355 objfile->sf->qf->map_matching_symbols (objfile, name1, domain,
5357 aux_add_nonlocal_symbols,
5359 full_match, compare_names);
5364 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5365 non-zero, enclosing scope and in global scopes, returning the number of
5367 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5368 indicating the symbols found and the blocks and symbol tables (if
5369 any) in which they were found. This vector is transient---good only to
5370 the next call of ada_lookup_symbol_list.
5372 When full_search is non-zero, any non-function/non-enumeral
5373 symbol match within the nest of blocks whose innermost member is BLOCK0,
5374 is the one match returned (no other matches in that or
5375 enclosing blocks is returned). If there are any matches in or
5376 surrounding BLOCK0, then these alone are returned.
5378 Names prefixed with "standard__" are handled specially: "standard__"
5379 is first stripped off, and only static and global symbols are searched. */
5382 ada_lookup_symbol_list_worker (const char *name0, const struct block *block0,
5383 domain_enum namespace,
5384 struct ada_symbol_info **results,
5388 const struct block *block;
5390 const int wild_match_p = should_use_wild_match (name0);
5394 obstack_free (&symbol_list_obstack, NULL);
5395 obstack_init (&symbol_list_obstack);
5399 /* Search specified block and its superiors. */
5404 /* Special case: If the user specifies a symbol name inside package
5405 Standard, do a non-wild matching of the symbol name without
5406 the "standard__" prefix. This was primarily introduced in order
5407 to allow the user to specifically access the standard exceptions
5408 using, for instance, Standard.Constraint_Error when Constraint_Error
5409 is ambiguous (due to the user defining its own Constraint_Error
5410 entity inside its program). */
5411 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
5414 name = name0 + sizeof ("standard__") - 1;
5417 /* Check the non-global symbols. If we have ANY match, then we're done. */
5423 ada_add_local_symbols (&symbol_list_obstack, name, block,
5424 namespace, wild_match_p);
5428 /* In the !full_search case we're are being called by
5429 ada_iterate_over_symbols, and we don't want to search
5431 ada_add_block_symbols (&symbol_list_obstack, block, name,
5432 namespace, NULL, wild_match_p);
5434 if (num_defns_collected (&symbol_list_obstack) > 0 || !full_search)
5438 /* No non-global symbols found. Check our cache to see if we have
5439 already performed this search before. If we have, then return
5443 if (lookup_cached_symbol (name0, namespace, &sym, &block))
5446 add_defn_to_vec (&symbol_list_obstack, sym, block);
5450 /* Search symbols from all global blocks. */
5452 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
5455 /* Now add symbols from all per-file blocks if we've gotten no hits
5456 (not strictly correct, but perhaps better than an error). */
5458 if (num_defns_collected (&symbol_list_obstack) == 0)
5459 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
5463 ndefns = num_defns_collected (&symbol_list_obstack);
5464 *results = defns_collected (&symbol_list_obstack, 1);
5466 ndefns = remove_extra_symbols (*results, ndefns);
5468 if (ndefns == 0 && full_search)
5469 cache_symbol (name0, namespace, NULL, NULL);
5471 if (ndefns == 1 && full_search && cacheIfUnique)
5472 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
5474 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
5479 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5480 in global scopes, returning the number of matches, and setting *RESULTS
5481 to a vector of (SYM,BLOCK) tuples.
5482 See ada_lookup_symbol_list_worker for further details. */
5485 ada_lookup_symbol_list (const char *name0, const struct block *block0,
5486 domain_enum domain, struct ada_symbol_info **results)
5488 return ada_lookup_symbol_list_worker (name0, block0, domain, results, 1);
5491 /* Implementation of the la_iterate_over_symbols method. */
5494 ada_iterate_over_symbols (const struct block *block,
5495 const char *name, domain_enum domain,
5496 symbol_found_callback_ftype *callback,
5500 struct ada_symbol_info *results;
5502 ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0);
5503 for (i = 0; i < ndefs; ++i)
5505 if (! (*callback) (results[i].sym, data))
5510 /* If NAME is the name of an entity, return a string that should
5511 be used to look that entity up in Ada units. This string should
5512 be deallocated after use using xfree.
5514 NAME can have any form that the "break" or "print" commands might
5515 recognize. In other words, it does not have to be the "natural"
5516 name, or the "encoded" name. */
5519 ada_name_for_lookup (const char *name)
5522 int nlen = strlen (name);
5524 if (name[0] == '<' && name[nlen - 1] == '>')
5526 canon = xmalloc (nlen - 1);
5527 memcpy (canon, name + 1, nlen - 2);
5528 canon[nlen - 2] = '\0';
5531 canon = xstrdup (ada_encode (ada_fold_name (name)));
5535 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5536 to 1, but choosing the first symbol found if there are multiple
5539 The result is stored in *INFO, which must be non-NULL.
5540 If no match is found, INFO->SYM is set to NULL. */
5543 ada_lookup_encoded_symbol (const char *name, const struct block *block,
5544 domain_enum namespace,
5545 struct ada_symbol_info *info)
5547 struct ada_symbol_info *candidates;
5550 gdb_assert (info != NULL);
5551 memset (info, 0, sizeof (struct ada_symbol_info));
5553 n_candidates = ada_lookup_symbol_list (name, block, namespace, &candidates);
5554 if (n_candidates == 0)
5557 *info = candidates[0];
5558 info->sym = fixup_symbol_section (info->sym, NULL);
5561 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5562 scope and in global scopes, or NULL if none. NAME is folded and
5563 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5564 choosing the first symbol if there are multiple choices.
5565 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5568 ada_lookup_symbol (const char *name, const struct block *block0,
5569 domain_enum namespace, int *is_a_field_of_this)
5571 struct ada_symbol_info info;
5573 if (is_a_field_of_this != NULL)
5574 *is_a_field_of_this = 0;
5576 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
5577 block0, namespace, &info);
5581 static struct symbol *
5582 ada_lookup_symbol_nonlocal (const char *name,
5583 const struct block *block,
5584 const domain_enum domain)
5586 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
5590 /* True iff STR is a possible encoded suffix of a normal Ada name
5591 that is to be ignored for matching purposes. Suffixes of parallel
5592 names (e.g., XVE) are not included here. Currently, the possible suffixes
5593 are given by any of the regular expressions:
5595 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5596 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5597 TKB [subprogram suffix for task bodies]
5598 _E[0-9]+[bs]$ [protected object entry suffixes]
5599 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5601 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5602 match is performed. This sequence is used to differentiate homonyms,
5603 is an optional part of a valid name suffix. */
5606 is_name_suffix (const char *str)
5609 const char *matching;
5610 const int len = strlen (str);
5612 /* Skip optional leading __[0-9]+. */
5614 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5617 while (isdigit (str[0]))
5623 if (str[0] == '.' || str[0] == '$')
5626 while (isdigit (matching[0]))
5628 if (matching[0] == '\0')
5634 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5637 while (isdigit (matching[0]))
5639 if (matching[0] == '\0')
5643 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5645 if (strcmp (str, "TKB") == 0)
5649 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5650 with a N at the end. Unfortunately, the compiler uses the same
5651 convention for other internal types it creates. So treating
5652 all entity names that end with an "N" as a name suffix causes
5653 some regressions. For instance, consider the case of an enumerated
5654 type. To support the 'Image attribute, it creates an array whose
5656 Having a single character like this as a suffix carrying some
5657 information is a bit risky. Perhaps we should change the encoding
5658 to be something like "_N" instead. In the meantime, do not do
5659 the following check. */
5660 /* Protected Object Subprograms */
5661 if (len == 1 && str [0] == 'N')
5666 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
5669 while (isdigit (matching[0]))
5671 if ((matching[0] == 'b' || matching[0] == 's')
5672 && matching [1] == '\0')
5676 /* ??? We should not modify STR directly, as we are doing below. This
5677 is fine in this case, but may become problematic later if we find
5678 that this alternative did not work, and want to try matching
5679 another one from the begining of STR. Since we modified it, we
5680 won't be able to find the begining of the string anymore! */
5684 while (str[0] != '_' && str[0] != '\0')
5686 if (str[0] != 'n' && str[0] != 'b')
5692 if (str[0] == '\000')
5697 if (str[1] != '_' || str[2] == '\000')
5701 if (strcmp (str + 3, "JM") == 0)
5703 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5704 the LJM suffix in favor of the JM one. But we will
5705 still accept LJM as a valid suffix for a reasonable
5706 amount of time, just to allow ourselves to debug programs
5707 compiled using an older version of GNAT. */
5708 if (strcmp (str + 3, "LJM") == 0)
5712 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5713 || str[4] == 'U' || str[4] == 'P')
5715 if (str[4] == 'R' && str[5] != 'T')
5719 if (!isdigit (str[2]))
5721 for (k = 3; str[k] != '\0'; k += 1)
5722 if (!isdigit (str[k]) && str[k] != '_')
5726 if (str[0] == '$' && isdigit (str[1]))
5728 for (k = 2; str[k] != '\0'; k += 1)
5729 if (!isdigit (str[k]) && str[k] != '_')
5736 /* Return non-zero if the string starting at NAME and ending before
5737 NAME_END contains no capital letters. */
5740 is_valid_name_for_wild_match (const char *name0)
5742 const char *decoded_name = ada_decode (name0);
5745 /* If the decoded name starts with an angle bracket, it means that
5746 NAME0 does not follow the GNAT encoding format. It should then
5747 not be allowed as a possible wild match. */
5748 if (decoded_name[0] == '<')
5751 for (i=0; decoded_name[i] != '\0'; i++)
5752 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5758 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5759 that could start a simple name. Assumes that *NAMEP points into
5760 the string beginning at NAME0. */
5763 advance_wild_match (const char **namep, const char *name0, int target0)
5765 const char *name = *namep;
5775 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5778 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5783 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5784 || name[2] == target0))
5792 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5802 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5803 informational suffixes of NAME (i.e., for which is_name_suffix is
5804 true). Assumes that PATN is a lower-cased Ada simple name. */
5807 wild_match (const char *name, const char *patn)
5810 const char *name0 = name;
5814 const char *match = name;
5818 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5821 if (*p == '\0' && is_name_suffix (name))
5822 return match != name0 && !is_valid_name_for_wild_match (name0);
5824 if (name[-1] == '_')
5827 if (!advance_wild_match (&name, name0, *patn))
5832 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5833 informational suffix. */
5836 full_match (const char *sym_name, const char *search_name)
5838 return !match_name (sym_name, search_name, 0);
5842 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5843 vector *defn_symbols, updating the list of symbols in OBSTACKP
5844 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5845 OBJFILE is the section containing BLOCK. */
5848 ada_add_block_symbols (struct obstack *obstackp,
5849 const struct block *block, const char *name,
5850 domain_enum domain, struct objfile *objfile,
5853 struct block_iterator iter;
5854 int name_len = strlen (name);
5855 /* A matching argument symbol, if any. */
5856 struct symbol *arg_sym;
5857 /* Set true when we find a matching non-argument symbol. */
5865 for (sym = block_iter_match_first (block, name, wild_match, &iter);
5866 sym != NULL; sym = block_iter_match_next (name, wild_match, &iter))
5868 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5869 SYMBOL_DOMAIN (sym), domain)
5870 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
5872 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5874 else if (SYMBOL_IS_ARGUMENT (sym))
5879 add_defn_to_vec (obstackp,
5880 fixup_symbol_section (sym, objfile),
5888 for (sym = block_iter_match_first (block, name, full_match, &iter);
5889 sym != NULL; sym = block_iter_match_next (name, full_match, &iter))
5891 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5892 SYMBOL_DOMAIN (sym), domain))
5894 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5896 if (SYMBOL_IS_ARGUMENT (sym))
5901 add_defn_to_vec (obstackp,
5902 fixup_symbol_section (sym, objfile),
5910 if (!found_sym && arg_sym != NULL)
5912 add_defn_to_vec (obstackp,
5913 fixup_symbol_section (arg_sym, objfile),
5922 ALL_BLOCK_SYMBOLS (block, iter, sym)
5924 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5925 SYMBOL_DOMAIN (sym), domain))
5929 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5932 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5934 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5939 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5941 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5943 if (SYMBOL_IS_ARGUMENT (sym))
5948 add_defn_to_vec (obstackp,
5949 fixup_symbol_section (sym, objfile),
5957 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5958 They aren't parameters, right? */
5959 if (!found_sym && arg_sym != NULL)
5961 add_defn_to_vec (obstackp,
5962 fixup_symbol_section (arg_sym, objfile),
5969 /* Symbol Completion */
5971 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5972 name in a form that's appropriate for the completion. The result
5973 does not need to be deallocated, but is only good until the next call.
5975 TEXT_LEN is equal to the length of TEXT.
5976 Perform a wild match if WILD_MATCH_P is set.
5977 ENCODED_P should be set if TEXT represents the start of a symbol name
5978 in its encoded form. */
5981 symbol_completion_match (const char *sym_name,
5982 const char *text, int text_len,
5983 int wild_match_p, int encoded_p)
5985 const int verbatim_match = (text[0] == '<');
5990 /* Strip the leading angle bracket. */
5995 /* First, test against the fully qualified name of the symbol. */
5997 if (strncmp (sym_name, text, text_len) == 0)
6000 if (match && !encoded_p)
6002 /* One needed check before declaring a positive match is to verify
6003 that iff we are doing a verbatim match, the decoded version
6004 of the symbol name starts with '<'. Otherwise, this symbol name
6005 is not a suitable completion. */
6006 const char *sym_name_copy = sym_name;
6007 int has_angle_bracket;
6009 sym_name = ada_decode (sym_name);
6010 has_angle_bracket = (sym_name[0] == '<');
6011 match = (has_angle_bracket == verbatim_match);
6012 sym_name = sym_name_copy;
6015 if (match && !verbatim_match)
6017 /* When doing non-verbatim match, another check that needs to
6018 be done is to verify that the potentially matching symbol name
6019 does not include capital letters, because the ada-mode would
6020 not be able to understand these symbol names without the
6021 angle bracket notation. */
6024 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
6029 /* Second: Try wild matching... */
6031 if (!match && wild_match_p)
6033 /* Since we are doing wild matching, this means that TEXT
6034 may represent an unqualified symbol name. We therefore must
6035 also compare TEXT against the unqualified name of the symbol. */
6036 sym_name = ada_unqualified_name (ada_decode (sym_name));
6038 if (strncmp (sym_name, text, text_len) == 0)
6042 /* Finally: If we found a mach, prepare the result to return. */
6048 sym_name = add_angle_brackets (sym_name);
6051 sym_name = ada_decode (sym_name);
6056 /* A companion function to ada_make_symbol_completion_list().
6057 Check if SYM_NAME represents a symbol which name would be suitable
6058 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6059 it is appended at the end of the given string vector SV.
6061 ORIG_TEXT is the string original string from the user command
6062 that needs to be completed. WORD is the entire command on which
6063 completion should be performed. These two parameters are used to
6064 determine which part of the symbol name should be added to the
6066 if WILD_MATCH_P is set, then wild matching is performed.
6067 ENCODED_P should be set if TEXT represents a symbol name in its
6068 encoded formed (in which case the completion should also be
6072 symbol_completion_add (VEC(char_ptr) **sv,
6073 const char *sym_name,
6074 const char *text, int text_len,
6075 const char *orig_text, const char *word,
6076 int wild_match_p, int encoded_p)
6078 const char *match = symbol_completion_match (sym_name, text, text_len,
6079 wild_match_p, encoded_p);
6085 /* We found a match, so add the appropriate completion to the given
6088 if (word == orig_text)
6090 completion = xmalloc (strlen (match) + 5);
6091 strcpy (completion, match);
6093 else if (word > orig_text)
6095 /* Return some portion of sym_name. */
6096 completion = xmalloc (strlen (match) + 5);
6097 strcpy (completion, match + (word - orig_text));
6101 /* Return some of ORIG_TEXT plus sym_name. */
6102 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
6103 strncpy (completion, word, orig_text - word);
6104 completion[orig_text - word] = '\0';
6105 strcat (completion, match);
6108 VEC_safe_push (char_ptr, *sv, completion);
6111 /* An object of this type is passed as the user_data argument to the
6112 expand_symtabs_matching method. */
6113 struct add_partial_datum
6115 VEC(char_ptr) **completions;
6124 /* A callback for expand_symtabs_matching. */
6127 ada_complete_symbol_matcher (const char *name, void *user_data)
6129 struct add_partial_datum *data = user_data;
6131 return symbol_completion_match (name, data->text, data->text_len,
6132 data->wild_match, data->encoded) != NULL;
6135 /* Return a list of possible symbol names completing TEXT0. WORD is
6136 the entire command on which completion is made. */
6138 static VEC (char_ptr) *
6139 ada_make_symbol_completion_list (const char *text0, const char *word,
6140 enum type_code code)
6146 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
6149 struct minimal_symbol *msymbol;
6150 struct objfile *objfile;
6151 const struct block *b, *surrounding_static_block = 0;
6153 struct block_iterator iter;
6154 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
6156 gdb_assert (code == TYPE_CODE_UNDEF);
6158 if (text0[0] == '<')
6160 text = xstrdup (text0);
6161 make_cleanup (xfree, text);
6162 text_len = strlen (text);
6168 text = xstrdup (ada_encode (text0));
6169 make_cleanup (xfree, text);
6170 text_len = strlen (text);
6171 for (i = 0; i < text_len; i++)
6172 text[i] = tolower (text[i]);
6174 encoded_p = (strstr (text0, "__") != NULL);
6175 /* If the name contains a ".", then the user is entering a fully
6176 qualified entity name, and the match must not be done in wild
6177 mode. Similarly, if the user wants to complete what looks like
6178 an encoded name, the match must not be done in wild mode. */
6179 wild_match_p = (strchr (text0, '.') == NULL && !encoded_p);
6182 /* First, look at the partial symtab symbols. */
6184 struct add_partial_datum data;
6186 data.completions = &completions;
6188 data.text_len = text_len;
6191 data.wild_match = wild_match_p;
6192 data.encoded = encoded_p;
6193 expand_symtabs_matching (NULL, ada_complete_symbol_matcher, ALL_DOMAIN,
6197 /* At this point scan through the misc symbol vectors and add each
6198 symbol you find to the list. Eventually we want to ignore
6199 anything that isn't a text symbol (everything else will be
6200 handled by the psymtab code above). */
6202 ALL_MSYMBOLS (objfile, msymbol)
6205 symbol_completion_add (&completions, MSYMBOL_LINKAGE_NAME (msymbol),
6206 text, text_len, text0, word, wild_match_p,
6210 /* Search upwards from currently selected frame (so that we can
6211 complete on local vars. */
6213 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
6215 if (!BLOCK_SUPERBLOCK (b))
6216 surrounding_static_block = b; /* For elmin of dups */
6218 ALL_BLOCK_SYMBOLS (b, iter, sym)
6220 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
6221 text, text_len, text0, word,
6222 wild_match_p, encoded_p);
6226 /* Go through the symtabs and check the externs and statics for
6227 symbols which match.
6228 Non-primary symtabs share the block vector with their primary symtabs
6229 so we use ALL_PRIMARY_SYMTABS here instead of ALL_SYMTABS. */
6231 ALL_PRIMARY_SYMTABS (objfile, s)
6234 b = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s), GLOBAL_BLOCK);
6235 ALL_BLOCK_SYMBOLS (b, iter, sym)
6237 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
6238 text, text_len, text0, word,
6239 wild_match_p, encoded_p);
6243 ALL_PRIMARY_SYMTABS (objfile, s)
6246 b = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s), STATIC_BLOCK);
6247 /* Don't do this block twice. */
6248 if (b == surrounding_static_block)
6250 ALL_BLOCK_SYMBOLS (b, iter, sym)
6252 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
6253 text, text_len, text0, word,
6254 wild_match_p, encoded_p);
6258 do_cleanups (old_chain);
6264 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6265 for tagged types. */
6268 ada_is_dispatch_table_ptr_type (struct type *type)
6272 if (TYPE_CODE (type) != TYPE_CODE_PTR)
6275 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
6279 return (strcmp (name, "ada__tags__dispatch_table") == 0);
6282 /* Return non-zero if TYPE is an interface tag. */
6285 ada_is_interface_tag (struct type *type)
6287 const char *name = TYPE_NAME (type);
6292 return (strcmp (name, "ada__tags__interface_tag") == 0);
6295 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6296 to be invisible to users. */
6299 ada_is_ignored_field (struct type *type, int field_num)
6301 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
6304 /* Check the name of that field. */
6306 const char *name = TYPE_FIELD_NAME (type, field_num);
6308 /* Anonymous field names should not be printed.
6309 brobecker/2007-02-20: I don't think this can actually happen
6310 but we don't want to print the value of annonymous fields anyway. */
6314 /* Normally, fields whose name start with an underscore ("_")
6315 are fields that have been internally generated by the compiler,
6316 and thus should not be printed. The "_parent" field is special,
6317 however: This is a field internally generated by the compiler
6318 for tagged types, and it contains the components inherited from
6319 the parent type. This field should not be printed as is, but
6320 should not be ignored either. */
6321 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
6325 /* If this is the dispatch table of a tagged type or an interface tag,
6327 if (ada_is_tagged_type (type, 1)
6328 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num))
6329 || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num))))
6332 /* Not a special field, so it should not be ignored. */
6336 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6337 pointer or reference type whose ultimate target has a tag field. */
6340 ada_is_tagged_type (struct type *type, int refok)
6342 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
6345 /* True iff TYPE represents the type of X'Tag */
6348 ada_is_tag_type (struct type *type)
6350 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
6354 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
6356 return (name != NULL
6357 && strcmp (name, "ada__tags__dispatch_table") == 0);
6361 /* The type of the tag on VAL. */
6364 ada_tag_type (struct value *val)
6366 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
6369 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6370 retired at Ada 05). */
6373 is_ada95_tag (struct value *tag)
6375 return ada_value_struct_elt (tag, "tsd", 1) != NULL;
6378 /* The value of the tag on VAL. */
6381 ada_value_tag (struct value *val)
6383 return ada_value_struct_elt (val, "_tag", 0);
6386 /* The value of the tag on the object of type TYPE whose contents are
6387 saved at VALADDR, if it is non-null, or is at memory address
6390 static struct value *
6391 value_tag_from_contents_and_address (struct type *type,
6392 const gdb_byte *valaddr,
6395 int tag_byte_offset;
6396 struct type *tag_type;
6398 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
6401 const gdb_byte *valaddr1 = ((valaddr == NULL)
6403 : valaddr + tag_byte_offset);
6404 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
6406 return value_from_contents_and_address (tag_type, valaddr1, address1);
6411 static struct type *
6412 type_from_tag (struct value *tag)
6414 const char *type_name = ada_tag_name (tag);
6416 if (type_name != NULL)
6417 return ada_find_any_type (ada_encode (type_name));
6421 /* Given a value OBJ of a tagged type, return a value of this
6422 type at the base address of the object. The base address, as
6423 defined in Ada.Tags, it is the address of the primary tag of
6424 the object, and therefore where the field values of its full
6425 view can be fetched. */
6428 ada_tag_value_at_base_address (struct value *obj)
6430 volatile struct gdb_exception e;
6432 LONGEST offset_to_top = 0;
6433 struct type *ptr_type, *obj_type;
6435 CORE_ADDR base_address;
6437 obj_type = value_type (obj);
6439 /* It is the responsability of the caller to deref pointers. */
6441 if (TYPE_CODE (obj_type) == TYPE_CODE_PTR
6442 || TYPE_CODE (obj_type) == TYPE_CODE_REF)
6445 tag = ada_value_tag (obj);
6449 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6451 if (is_ada95_tag (tag))
6454 ptr_type = builtin_type (target_gdbarch ())->builtin_data_ptr;
6455 ptr_type = lookup_pointer_type (ptr_type);
6456 val = value_cast (ptr_type, tag);
6460 /* It is perfectly possible that an exception be raised while
6461 trying to determine the base address, just like for the tag;
6462 see ada_tag_name for more details. We do not print the error
6463 message for the same reason. */
6465 TRY_CATCH (e, RETURN_MASK_ERROR)
6467 offset_to_top = value_as_long (value_ind (value_ptradd (val, -2)));
6473 /* If offset is null, nothing to do. */
6475 if (offset_to_top == 0)
6478 /* -1 is a special case in Ada.Tags; however, what should be done
6479 is not quite clear from the documentation. So do nothing for
6482 if (offset_to_top == -1)
6485 base_address = value_address (obj) - offset_to_top;
6486 tag = value_tag_from_contents_and_address (obj_type, NULL, base_address);
6488 /* Make sure that we have a proper tag at the new address.
6489 Otherwise, offset_to_top is bogus (which can happen when
6490 the object is not initialized yet). */
6495 obj_type = type_from_tag (tag);
6500 return value_from_contents_and_address (obj_type, NULL, base_address);
6503 /* Return the "ada__tags__type_specific_data" type. */
6505 static struct type *
6506 ada_get_tsd_type (struct inferior *inf)
6508 struct ada_inferior_data *data = get_ada_inferior_data (inf);
6510 if (data->tsd_type == 0)
6511 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6512 return data->tsd_type;
6515 /* Return the TSD (type-specific data) associated to the given TAG.
6516 TAG is assumed to be the tag of a tagged-type entity.
6518 May return NULL if we are unable to get the TSD. */
6520 static struct value *
6521 ada_get_tsd_from_tag (struct value *tag)
6526 /* First option: The TSD is simply stored as a field of our TAG.
6527 Only older versions of GNAT would use this format, but we have
6528 to test it first, because there are no visible markers for
6529 the current approach except the absence of that field. */
6531 val = ada_value_struct_elt (tag, "tsd", 1);
6535 /* Try the second representation for the dispatch table (in which
6536 there is no explicit 'tsd' field in the referent of the tag pointer,
6537 and instead the tsd pointer is stored just before the dispatch
6540 type = ada_get_tsd_type (current_inferior());
6543 type = lookup_pointer_type (lookup_pointer_type (type));
6544 val = value_cast (type, tag);
6547 return value_ind (value_ptradd (val, -1));
6550 /* Given the TSD of a tag (type-specific data), return a string
6551 containing the name of the associated type.
6553 The returned value is good until the next call. May return NULL
6554 if we are unable to determine the tag name. */
6557 ada_tag_name_from_tsd (struct value *tsd)
6559 static char name[1024];
6563 val = ada_value_struct_elt (tsd, "expanded_name", 1);
6566 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6567 for (p = name; *p != '\0'; p += 1)
6573 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6576 Return NULL if the TAG is not an Ada tag, or if we were unable to
6577 determine the name of that tag. The result is good until the next
6581 ada_tag_name (struct value *tag)
6583 volatile struct gdb_exception e;
6586 if (!ada_is_tag_type (value_type (tag)))
6589 /* It is perfectly possible that an exception be raised while trying
6590 to determine the TAG's name, even under normal circumstances:
6591 The associated variable may be uninitialized or corrupted, for
6592 instance. We do not let any exception propagate past this point.
6593 instead we return NULL.
6595 We also do not print the error message either (which often is very
6596 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6597 the caller print a more meaningful message if necessary. */
6598 TRY_CATCH (e, RETURN_MASK_ERROR)
6600 struct value *tsd = ada_get_tsd_from_tag (tag);
6603 name = ada_tag_name_from_tsd (tsd);
6609 /* The parent type of TYPE, or NULL if none. */
6612 ada_parent_type (struct type *type)
6616 type = ada_check_typedef (type);
6618 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6621 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6622 if (ada_is_parent_field (type, i))
6624 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6626 /* If the _parent field is a pointer, then dereference it. */
6627 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6628 parent_type = TYPE_TARGET_TYPE (parent_type);
6629 /* If there is a parallel XVS type, get the actual base type. */
6630 parent_type = ada_get_base_type (parent_type);
6632 return ada_check_typedef (parent_type);
6638 /* True iff field number FIELD_NUM of structure type TYPE contains the
6639 parent-type (inherited) fields of a derived type. Assumes TYPE is
6640 a structure type with at least FIELD_NUM+1 fields. */
6643 ada_is_parent_field (struct type *type, int field_num)
6645 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
6647 return (name != NULL
6648 && (strncmp (name, "PARENT", 6) == 0
6649 || strncmp (name, "_parent", 7) == 0));
6652 /* True iff field number FIELD_NUM of structure type TYPE is a
6653 transparent wrapper field (which should be silently traversed when doing
6654 field selection and flattened when printing). Assumes TYPE is a
6655 structure type with at least FIELD_NUM+1 fields. Such fields are always
6659 ada_is_wrapper_field (struct type *type, int field_num)
6661 const char *name = TYPE_FIELD_NAME (type, field_num);
6663 return (name != NULL
6664 && (strncmp (name, "PARENT", 6) == 0
6665 || strcmp (name, "REP") == 0
6666 || strncmp (name, "_parent", 7) == 0
6667 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
6670 /* True iff field number FIELD_NUM of structure or union type TYPE
6671 is a variant wrapper. Assumes TYPE is a structure type with at least
6672 FIELD_NUM+1 fields. */
6675 ada_is_variant_part (struct type *type, int field_num)
6677 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
6679 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
6680 || (is_dynamic_field (type, field_num)
6681 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6682 == TYPE_CODE_UNION)));
6685 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6686 whose discriminants are contained in the record type OUTER_TYPE,
6687 returns the type of the controlling discriminant for the variant.
6688 May return NULL if the type could not be found. */
6691 ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
6693 char *name = ada_variant_discrim_name (var_type);
6695 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
6698 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6699 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6700 represents a 'when others' clause; otherwise 0. */
6703 ada_is_others_clause (struct type *type, int field_num)
6705 const char *name = TYPE_FIELD_NAME (type, field_num);
6707 return (name != NULL && name[0] == 'O');
6710 /* Assuming that TYPE0 is the type of the variant part of a record,
6711 returns the name of the discriminant controlling the variant.
6712 The value is valid until the next call to ada_variant_discrim_name. */
6715 ada_variant_discrim_name (struct type *type0)
6717 static char *result = NULL;
6718 static size_t result_len = 0;
6721 const char *discrim_end;
6722 const char *discrim_start;
6724 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
6725 type = TYPE_TARGET_TYPE (type0);
6729 name = ada_type_name (type);
6731 if (name == NULL || name[0] == '\000')
6734 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
6737 if (strncmp (discrim_end, "___XVN", 6) == 0)
6740 if (discrim_end == name)
6743 for (discrim_start = discrim_end; discrim_start != name + 3;
6746 if (discrim_start == name + 1)
6748 if ((discrim_start > name + 3
6749 && strncmp (discrim_start - 3, "___", 3) == 0)
6750 || discrim_start[-1] == '.')
6754 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
6755 strncpy (result, discrim_start, discrim_end - discrim_start);
6756 result[discrim_end - discrim_start] = '\0';
6760 /* Scan STR for a subtype-encoded number, beginning at position K.
6761 Put the position of the character just past the number scanned in
6762 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6763 Return 1 if there was a valid number at the given position, and 0
6764 otherwise. A "subtype-encoded" number consists of the absolute value
6765 in decimal, followed by the letter 'm' to indicate a negative number.
6766 Assumes 0m does not occur. */
6769 ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
6773 if (!isdigit (str[k]))
6776 /* Do it the hard way so as not to make any assumption about
6777 the relationship of unsigned long (%lu scan format code) and
6780 while (isdigit (str[k]))
6782 RU = RU * 10 + (str[k] - '0');
6789 *R = (-(LONGEST) (RU - 1)) - 1;
6795 /* NOTE on the above: Technically, C does not say what the results of
6796 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6797 number representable as a LONGEST (although either would probably work
6798 in most implementations). When RU>0, the locution in the then branch
6799 above is always equivalent to the negative of RU. */
6806 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6807 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6808 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6811 ada_in_variant (LONGEST val, struct type *type, int field_num)
6813 const char *name = TYPE_FIELD_NAME (type, field_num);
6827 if (!ada_scan_number (name, p + 1, &W, &p))
6837 if (!ada_scan_number (name, p + 1, &L, &p)
6838 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6840 if (val >= L && val <= U)
6852 /* FIXME: Lots of redundancy below. Try to consolidate. */
6854 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6855 ARG_TYPE, extract and return the value of one of its (non-static)
6856 fields. FIELDNO says which field. Differs from value_primitive_field
6857 only in that it can handle packed values of arbitrary type. */
6859 static struct value *
6860 ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
6861 struct type *arg_type)
6865 arg_type = ada_check_typedef (arg_type);
6866 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6868 /* Handle packed fields. */
6870 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6872 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6873 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
6875 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
6876 offset + bit_pos / 8,
6877 bit_pos % 8, bit_size, type);
6880 return value_primitive_field (arg1, offset, fieldno, arg_type);
6883 /* Find field with name NAME in object of type TYPE. If found,
6884 set the following for each argument that is non-null:
6885 - *FIELD_TYPE_P to the field's type;
6886 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6887 an object of that type;
6888 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6889 - *BIT_SIZE_P to its size in bits if the field is packed, and
6891 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6892 fields up to but not including the desired field, or by the total
6893 number of fields if not found. A NULL value of NAME never
6894 matches; the function just counts visible fields in this case.
6896 Returns 1 if found, 0 otherwise. */
6899 find_struct_field (const char *name, struct type *type, int offset,
6900 struct type **field_type_p,
6901 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6906 type = ada_check_typedef (type);
6908 if (field_type_p != NULL)
6909 *field_type_p = NULL;
6910 if (byte_offset_p != NULL)
6912 if (bit_offset_p != NULL)
6914 if (bit_size_p != NULL)
6917 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6919 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6920 int fld_offset = offset + bit_pos / 8;
6921 const char *t_field_name = TYPE_FIELD_NAME (type, i);
6923 if (t_field_name == NULL)
6926 else if (name != NULL && field_name_match (t_field_name, name))
6928 int bit_size = TYPE_FIELD_BITSIZE (type, i);
6930 if (field_type_p != NULL)
6931 *field_type_p = TYPE_FIELD_TYPE (type, i);
6932 if (byte_offset_p != NULL)
6933 *byte_offset_p = fld_offset;
6934 if (bit_offset_p != NULL)
6935 *bit_offset_p = bit_pos % 8;
6936 if (bit_size_p != NULL)
6937 *bit_size_p = bit_size;
6940 else if (ada_is_wrapper_field (type, i))
6942 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6943 field_type_p, byte_offset_p, bit_offset_p,
6944 bit_size_p, index_p))
6947 else if (ada_is_variant_part (type, i))
6949 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6952 struct type *field_type
6953 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
6955 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
6957 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6959 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6960 field_type_p, byte_offset_p,
6961 bit_offset_p, bit_size_p, index_p))
6965 else if (index_p != NULL)
6971 /* Number of user-visible fields in record type TYPE. */
6974 num_visible_fields (struct type *type)
6979 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6983 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6984 and search in it assuming it has (class) type TYPE.
6985 If found, return value, else return NULL.
6987 Searches recursively through wrapper fields (e.g., '_parent'). */
6989 static struct value *
6990 ada_search_struct_field (char *name, struct value *arg, int offset,
6995 type = ada_check_typedef (type);
6996 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6998 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7000 if (t_field_name == NULL)
7003 else if (field_name_match (t_field_name, name))
7004 return ada_value_primitive_field (arg, offset, i, type);
7006 else if (ada_is_wrapper_field (type, i))
7008 struct value *v = /* Do not let indent join lines here. */
7009 ada_search_struct_field (name, arg,
7010 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7011 TYPE_FIELD_TYPE (type, i));
7017 else if (ada_is_variant_part (type, i))
7019 /* PNH: Do we ever get here? See find_struct_field. */
7021 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7023 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
7025 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
7027 struct value *v = ada_search_struct_field /* Force line
7030 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
7031 TYPE_FIELD_TYPE (field_type, j));
7041 static struct value *ada_index_struct_field_1 (int *, struct value *,
7042 int, struct type *);
7045 /* Return field #INDEX in ARG, where the index is that returned by
7046 * find_struct_field through its INDEX_P argument. Adjust the address
7047 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7048 * If found, return value, else return NULL. */
7050 static struct value *
7051 ada_index_struct_field (int index, struct value *arg, int offset,
7054 return ada_index_struct_field_1 (&index, arg, offset, type);
7058 /* Auxiliary function for ada_index_struct_field. Like
7059 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7062 static struct value *
7063 ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
7067 type = ada_check_typedef (type);
7069 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7071 if (TYPE_FIELD_NAME (type, i) == NULL)
7073 else if (ada_is_wrapper_field (type, i))
7075 struct value *v = /* Do not let indent join lines here. */
7076 ada_index_struct_field_1 (index_p, arg,
7077 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7078 TYPE_FIELD_TYPE (type, i));
7084 else if (ada_is_variant_part (type, i))
7086 /* PNH: Do we ever get here? See ada_search_struct_field,
7087 find_struct_field. */
7088 error (_("Cannot assign this kind of variant record"));
7090 else if (*index_p == 0)
7091 return ada_value_primitive_field (arg, offset, i, type);
7098 /* Given ARG, a value of type (pointer or reference to a)*
7099 structure/union, extract the component named NAME from the ultimate
7100 target structure/union and return it as a value with its
7103 The routine searches for NAME among all members of the structure itself
7104 and (recursively) among all members of any wrapper members
7107 If NO_ERR, then simply return NULL in case of error, rather than
7111 ada_value_struct_elt (struct value *arg, char *name, int no_err)
7113 struct type *t, *t1;
7117 t1 = t = ada_check_typedef (value_type (arg));
7118 if (TYPE_CODE (t) == TYPE_CODE_REF)
7120 t1 = TYPE_TARGET_TYPE (t);
7123 t1 = ada_check_typedef (t1);
7124 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7126 arg = coerce_ref (arg);
7131 while (TYPE_CODE (t) == TYPE_CODE_PTR)
7133 t1 = TYPE_TARGET_TYPE (t);
7136 t1 = ada_check_typedef (t1);
7137 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
7139 arg = value_ind (arg);
7146 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
7150 v = ada_search_struct_field (name, arg, 0, t);
7153 int bit_offset, bit_size, byte_offset;
7154 struct type *field_type;
7157 if (TYPE_CODE (t) == TYPE_CODE_PTR)
7158 address = value_address (ada_value_ind (arg));
7160 address = value_address (ada_coerce_ref (arg));
7162 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
7163 if (find_struct_field (name, t1, 0,
7164 &field_type, &byte_offset, &bit_offset,
7169 if (TYPE_CODE (t) == TYPE_CODE_REF)
7170 arg = ada_coerce_ref (arg);
7172 arg = ada_value_ind (arg);
7173 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
7174 bit_offset, bit_size,
7178 v = value_at_lazy (field_type, address + byte_offset);
7182 if (v != NULL || no_err)
7185 error (_("There is no member named %s."), name);
7191 error (_("Attempt to extract a component of "
7192 "a value that is not a record."));
7195 /* Given a type TYPE, look up the type of the component of type named NAME.
7196 If DISPP is non-null, add its byte displacement from the beginning of a
7197 structure (pointed to by a value) of type TYPE to *DISPP (does not
7198 work for packed fields).
7200 Matches any field whose name has NAME as a prefix, possibly
7203 TYPE can be either a struct or union. If REFOK, TYPE may also
7204 be a (pointer or reference)+ to a struct or union, and the
7205 ultimate target type will be searched.
7207 Looks recursively into variant clauses and parent types.
7209 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7210 TYPE is not a type of the right kind. */
7212 static struct type *
7213 ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
7214 int noerr, int *dispp)
7221 if (refok && type != NULL)
7224 type = ada_check_typedef (type);
7225 if (TYPE_CODE (type) != TYPE_CODE_PTR
7226 && TYPE_CODE (type) != TYPE_CODE_REF)
7228 type = TYPE_TARGET_TYPE (type);
7232 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
7233 && TYPE_CODE (type) != TYPE_CODE_UNION))
7239 target_terminal_ours ();
7240 gdb_flush (gdb_stdout);
7242 error (_("Type (null) is not a structure or union type"));
7245 /* XXX: type_sprint */
7246 fprintf_unfiltered (gdb_stderr, _("Type "));
7247 type_print (type, "", gdb_stderr, -1);
7248 error (_(" is not a structure or union type"));
7253 type = to_static_fixed_type (type);
7255 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7257 const char *t_field_name = TYPE_FIELD_NAME (type, i);
7261 if (t_field_name == NULL)
7264 else if (field_name_match (t_field_name, name))
7267 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
7268 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
7271 else if (ada_is_wrapper_field (type, i))
7274 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
7279 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
7284 else if (ada_is_variant_part (type, i))
7287 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7290 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
7292 /* FIXME pnh 2008/01/26: We check for a field that is
7293 NOT wrapped in a struct, since the compiler sometimes
7294 generates these for unchecked variant types. Revisit
7295 if the compiler changes this practice. */
7296 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
7298 if (v_field_name != NULL
7299 && field_name_match (v_field_name, name))
7300 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
7302 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
7309 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
7320 target_terminal_ours ();
7321 gdb_flush (gdb_stdout);
7324 /* XXX: type_sprint */
7325 fprintf_unfiltered (gdb_stderr, _("Type "));
7326 type_print (type, "", gdb_stderr, -1);
7327 error (_(" has no component named <null>"));
7331 /* XXX: type_sprint */
7332 fprintf_unfiltered (gdb_stderr, _("Type "));
7333 type_print (type, "", gdb_stderr, -1);
7334 error (_(" has no component named %s"), name);
7341 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7342 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7343 represents an unchecked union (that is, the variant part of a
7344 record that is named in an Unchecked_Union pragma). */
7347 is_unchecked_variant (struct type *var_type, struct type *outer_type)
7349 char *discrim_name = ada_variant_discrim_name (var_type);
7351 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
7356 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7357 within a value of type OUTER_TYPE that is stored in GDB at
7358 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7359 numbering from 0) is applicable. Returns -1 if none are. */
7362 ada_which_variant_applies (struct type *var_type, struct type *outer_type,
7363 const gdb_byte *outer_valaddr)
7367 char *discrim_name = ada_variant_discrim_name (var_type);
7368 struct value *outer;
7369 struct value *discrim;
7370 LONGEST discrim_val;
7372 /* Using plain value_from_contents_and_address here causes problems
7373 because we will end up trying to resolve a type that is currently
7374 being constructed. */
7375 outer = value_from_contents_and_address_unresolved (outer_type,
7377 discrim = ada_value_struct_elt (outer, discrim_name, 1);
7378 if (discrim == NULL)
7380 discrim_val = value_as_long (discrim);
7383 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
7385 if (ada_is_others_clause (var_type, i))
7387 else if (ada_in_variant (discrim_val, var_type, i))
7391 return others_clause;
7396 /* Dynamic-Sized Records */
7398 /* Strategy: The type ostensibly attached to a value with dynamic size
7399 (i.e., a size that is not statically recorded in the debugging
7400 data) does not accurately reflect the size or layout of the value.
7401 Our strategy is to convert these values to values with accurate,
7402 conventional types that are constructed on the fly. */
7404 /* There is a subtle and tricky problem here. In general, we cannot
7405 determine the size of dynamic records without its data. However,
7406 the 'struct value' data structure, which GDB uses to represent
7407 quantities in the inferior process (the target), requires the size
7408 of the type at the time of its allocation in order to reserve space
7409 for GDB's internal copy of the data. That's why the
7410 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7411 rather than struct value*s.
7413 However, GDB's internal history variables ($1, $2, etc.) are
7414 struct value*s containing internal copies of the data that are not, in
7415 general, the same as the data at their corresponding addresses in
7416 the target. Fortunately, the types we give to these values are all
7417 conventional, fixed-size types (as per the strategy described
7418 above), so that we don't usually have to perform the
7419 'to_fixed_xxx_type' conversions to look at their values.
7420 Unfortunately, there is one exception: if one of the internal
7421 history variables is an array whose elements are unconstrained
7422 records, then we will need to create distinct fixed types for each
7423 element selected. */
7425 /* The upshot of all of this is that many routines take a (type, host
7426 address, target address) triple as arguments to represent a value.
7427 The host address, if non-null, is supposed to contain an internal
7428 copy of the relevant data; otherwise, the program is to consult the
7429 target at the target address. */
7431 /* Assuming that VAL0 represents a pointer value, the result of
7432 dereferencing it. Differs from value_ind in its treatment of
7433 dynamic-sized types. */
7436 ada_value_ind (struct value *val0)
7438 struct value *val = value_ind (val0);
7440 if (ada_is_tagged_type (value_type (val), 0))
7441 val = ada_tag_value_at_base_address (val);
7443 return ada_to_fixed_value (val);
7446 /* The value resulting from dereferencing any "reference to"
7447 qualifiers on VAL0. */
7449 static struct value *
7450 ada_coerce_ref (struct value *val0)
7452 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
7454 struct value *val = val0;
7456 val = coerce_ref (val);
7458 if (ada_is_tagged_type (value_type (val), 0))
7459 val = ada_tag_value_at_base_address (val);
7461 return ada_to_fixed_value (val);
7467 /* Return OFF rounded upward if necessary to a multiple of
7468 ALIGNMENT (a power of 2). */
7471 align_value (unsigned int off, unsigned int alignment)
7473 return (off + alignment - 1) & ~(alignment - 1);
7476 /* Return the bit alignment required for field #F of template type TYPE. */
7479 field_alignment (struct type *type, int f)
7481 const char *name = TYPE_FIELD_NAME (type, f);
7485 /* The field name should never be null, unless the debugging information
7486 is somehow malformed. In this case, we assume the field does not
7487 require any alignment. */
7491 len = strlen (name);
7493 if (!isdigit (name[len - 1]))
7496 if (isdigit (name[len - 2]))
7497 align_offset = len - 2;
7499 align_offset = len - 1;
7501 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
7502 return TARGET_CHAR_BIT;
7504 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7507 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7509 static struct symbol *
7510 ada_find_any_type_symbol (const char *name)
7514 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
7515 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
7518 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7522 /* Find a type named NAME. Ignores ambiguity. This routine will look
7523 solely for types defined by debug info, it will not search the GDB
7526 static struct type *
7527 ada_find_any_type (const char *name)
7529 struct symbol *sym = ada_find_any_type_symbol (name);
7532 return SYMBOL_TYPE (sym);
7537 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7538 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7539 symbol, in which case it is returned. Otherwise, this looks for
7540 symbols whose name is that of NAME_SYM suffixed with "___XR".
7541 Return symbol if found, and NULL otherwise. */
7544 ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block)
7546 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
7549 if (strstr (name, "___XR") != NULL)
7552 sym = find_old_style_renaming_symbol (name, block);
7557 /* Not right yet. FIXME pnh 7/20/2007. */
7558 sym = ada_find_any_type_symbol (name);
7559 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
7565 static struct symbol *
7566 find_old_style_renaming_symbol (const char *name, const struct block *block)
7568 const struct symbol *function_sym = block_linkage_function (block);
7571 if (function_sym != NULL)
7573 /* If the symbol is defined inside a function, NAME is not fully
7574 qualified. This means we need to prepend the function name
7575 as well as adding the ``___XR'' suffix to build the name of
7576 the associated renaming symbol. */
7577 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
7578 /* Function names sometimes contain suffixes used
7579 for instance to qualify nested subprograms. When building
7580 the XR type name, we need to make sure that this suffix is
7581 not included. So do not include any suffix in the function
7582 name length below. */
7583 int function_name_len = ada_name_prefix_len (function_name);
7584 const int rename_len = function_name_len + 2 /* "__" */
7585 + strlen (name) + 6 /* "___XR\0" */ ;
7587 /* Strip the suffix if necessary. */
7588 ada_remove_trailing_digits (function_name, &function_name_len);
7589 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
7590 ada_remove_Xbn_suffix (function_name, &function_name_len);
7592 /* Library-level functions are a special case, as GNAT adds
7593 a ``_ada_'' prefix to the function name to avoid namespace
7594 pollution. However, the renaming symbols themselves do not
7595 have this prefix, so we need to skip this prefix if present. */
7596 if (function_name_len > 5 /* "_ada_" */
7597 && strstr (function_name, "_ada_") == function_name)
7600 function_name_len -= 5;
7603 rename = (char *) alloca (rename_len * sizeof (char));
7604 strncpy (rename, function_name, function_name_len);
7605 xsnprintf (rename + function_name_len, rename_len - function_name_len,
7610 const int rename_len = strlen (name) + 6;
7612 rename = (char *) alloca (rename_len * sizeof (char));
7613 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
7616 return ada_find_any_type_symbol (rename);
7619 /* Because of GNAT encoding conventions, several GDB symbols may match a
7620 given type name. If the type denoted by TYPE0 is to be preferred to
7621 that of TYPE1 for purposes of type printing, return non-zero;
7622 otherwise return 0. */
7625 ada_prefer_type (struct type *type0, struct type *type1)
7629 else if (type0 == NULL)
7631 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
7633 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
7635 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
7637 else if (ada_is_constrained_packed_array_type (type0))
7639 else if (ada_is_array_descriptor_type (type0)
7640 && !ada_is_array_descriptor_type (type1))
7644 const char *type0_name = type_name_no_tag (type0);
7645 const char *type1_name = type_name_no_tag (type1);
7647 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
7648 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
7654 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7655 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7658 ada_type_name (struct type *type)
7662 else if (TYPE_NAME (type) != NULL)
7663 return TYPE_NAME (type);
7665 return TYPE_TAG_NAME (type);
7668 /* Search the list of "descriptive" types associated to TYPE for a type
7669 whose name is NAME. */
7671 static struct type *
7672 find_parallel_type_by_descriptive_type (struct type *type, const char *name)
7674 struct type *result;
7676 if (ada_ignore_descriptive_types_p)
7679 /* If there no descriptive-type info, then there is no parallel type
7681 if (!HAVE_GNAT_AUX_INFO (type))
7684 result = TYPE_DESCRIPTIVE_TYPE (type);
7685 while (result != NULL)
7687 const char *result_name = ada_type_name (result);
7689 if (result_name == NULL)
7691 warning (_("unexpected null name on descriptive type"));
7695 /* If the names match, stop. */
7696 if (strcmp (result_name, name) == 0)
7699 /* Otherwise, look at the next item on the list, if any. */
7700 if (HAVE_GNAT_AUX_INFO (result))
7701 result = TYPE_DESCRIPTIVE_TYPE (result);
7706 /* If we didn't find a match, see whether this is a packed array. With
7707 older compilers, the descriptive type information is either absent or
7708 irrelevant when it comes to packed arrays so the above lookup fails.
7709 Fall back to using a parallel lookup by name in this case. */
7710 if (result == NULL && ada_is_constrained_packed_array_type (type))
7711 return ada_find_any_type (name);
7716 /* Find a parallel type to TYPE with the specified NAME, using the
7717 descriptive type taken from the debugging information, if available,
7718 and otherwise using the (slower) name-based method. */
7720 static struct type *
7721 ada_find_parallel_type_with_name (struct type *type, const char *name)
7723 struct type *result = NULL;
7725 if (HAVE_GNAT_AUX_INFO (type))
7726 result = find_parallel_type_by_descriptive_type (type, name);
7728 result = ada_find_any_type (name);
7733 /* Same as above, but specify the name of the parallel type by appending
7734 SUFFIX to the name of TYPE. */
7737 ada_find_parallel_type (struct type *type, const char *suffix)
7740 const char *typename = ada_type_name (type);
7743 if (typename == NULL)
7746 len = strlen (typename);
7748 name = (char *) alloca (len + strlen (suffix) + 1);
7750 strcpy (name, typename);
7751 strcpy (name + len, suffix);
7753 return ada_find_parallel_type_with_name (type, name);
7756 /* If TYPE is a variable-size record type, return the corresponding template
7757 type describing its fields. Otherwise, return NULL. */
7759 static struct type *
7760 dynamic_template_type (struct type *type)
7762 type = ada_check_typedef (type);
7764 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
7765 || ada_type_name (type) == NULL)
7769 int len = strlen (ada_type_name (type));
7771 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
7774 return ada_find_parallel_type (type, "___XVE");
7778 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7779 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7782 is_dynamic_field (struct type *templ_type, int field_num)
7784 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
7787 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
7788 && strstr (name, "___XVL") != NULL;
7791 /* The index of the variant field of TYPE, or -1 if TYPE does not
7792 represent a variant record type. */
7795 variant_field_index (struct type *type)
7799 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
7802 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
7804 if (ada_is_variant_part (type, f))
7810 /* A record type with no fields. */
7812 static struct type *
7813 empty_record (struct type *template)
7815 struct type *type = alloc_type_copy (template);
7817 TYPE_CODE (type) = TYPE_CODE_STRUCT;
7818 TYPE_NFIELDS (type) = 0;
7819 TYPE_FIELDS (type) = NULL;
7820 INIT_CPLUS_SPECIFIC (type);
7821 TYPE_NAME (type) = "<empty>";
7822 TYPE_TAG_NAME (type) = NULL;
7823 TYPE_LENGTH (type) = 0;
7827 /* An ordinary record type (with fixed-length fields) that describes
7828 the value of type TYPE at VALADDR or ADDRESS (see comments at
7829 the beginning of this section) VAL according to GNAT conventions.
7830 DVAL0 should describe the (portion of a) record that contains any
7831 necessary discriminants. It should be NULL if value_type (VAL) is
7832 an outer-level type (i.e., as opposed to a branch of a variant.) A
7833 variant field (unless unchecked) is replaced by a particular branch
7836 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7837 length are not statically known are discarded. As a consequence,
7838 VALADDR, ADDRESS and DVAL0 are ignored.
7840 NOTE: Limitations: For now, we assume that dynamic fields and
7841 variants occupy whole numbers of bytes. However, they need not be
7845 ada_template_to_fixed_record_type_1 (struct type *type,
7846 const gdb_byte *valaddr,
7847 CORE_ADDR address, struct value *dval0,
7848 int keep_dynamic_fields)
7850 struct value *mark = value_mark ();
7853 int nfields, bit_len;
7859 /* Compute the number of fields in this record type that are going
7860 to be processed: unless keep_dynamic_fields, this includes only
7861 fields whose position and length are static will be processed. */
7862 if (keep_dynamic_fields)
7863 nfields = TYPE_NFIELDS (type);
7867 while (nfields < TYPE_NFIELDS (type)
7868 && !ada_is_variant_part (type, nfields)
7869 && !is_dynamic_field (type, nfields))
7873 rtype = alloc_type_copy (type);
7874 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7875 INIT_CPLUS_SPECIFIC (rtype);
7876 TYPE_NFIELDS (rtype) = nfields;
7877 TYPE_FIELDS (rtype) = (struct field *)
7878 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7879 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7880 TYPE_NAME (rtype) = ada_type_name (type);
7881 TYPE_TAG_NAME (rtype) = NULL;
7882 TYPE_FIXED_INSTANCE (rtype) = 1;
7888 for (f = 0; f < nfields; f += 1)
7890 off = align_value (off, field_alignment (type, f))
7891 + TYPE_FIELD_BITPOS (type, f);
7892 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
7893 TYPE_FIELD_BITSIZE (rtype, f) = 0;
7895 if (ada_is_variant_part (type, f))
7900 else if (is_dynamic_field (type, f))
7902 const gdb_byte *field_valaddr = valaddr;
7903 CORE_ADDR field_address = address;
7904 struct type *field_type =
7905 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7909 /* rtype's length is computed based on the run-time
7910 value of discriminants. If the discriminants are not
7911 initialized, the type size may be completely bogus and
7912 GDB may fail to allocate a value for it. So check the
7913 size first before creating the value. */
7915 /* Using plain value_from_contents_and_address here
7916 causes problems because we will end up trying to
7917 resolve a type that is currently being
7919 dval = value_from_contents_and_address_unresolved (rtype,
7922 rtype = value_type (dval);
7927 /* If the type referenced by this field is an aligner type, we need
7928 to unwrap that aligner type, because its size might not be set.
7929 Keeping the aligner type would cause us to compute the wrong
7930 size for this field, impacting the offset of the all the fields
7931 that follow this one. */
7932 if (ada_is_aligner_type (field_type))
7934 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7936 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7937 field_address = cond_offset_target (field_address, field_offset);
7938 field_type = ada_aligned_type (field_type);
7941 field_valaddr = cond_offset_host (field_valaddr,
7942 off / TARGET_CHAR_BIT);
7943 field_address = cond_offset_target (field_address,
7944 off / TARGET_CHAR_BIT);
7946 /* Get the fixed type of the field. Note that, in this case,
7947 we do not want to get the real type out of the tag: if
7948 the current field is the parent part of a tagged record,
7949 we will get the tag of the object. Clearly wrong: the real
7950 type of the parent is not the real type of the child. We
7951 would end up in an infinite loop. */
7952 field_type = ada_get_base_type (field_type);
7953 field_type = ada_to_fixed_type (field_type, field_valaddr,
7954 field_address, dval, 0);
7955 /* If the field size is already larger than the maximum
7956 object size, then the record itself will necessarily
7957 be larger than the maximum object size. We need to make
7958 this check now, because the size might be so ridiculously
7959 large (due to an uninitialized variable in the inferior)
7960 that it would cause an overflow when adding it to the
7962 check_size (field_type);
7964 TYPE_FIELD_TYPE (rtype, f) = field_type;
7965 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7966 /* The multiplication can potentially overflow. But because
7967 the field length has been size-checked just above, and
7968 assuming that the maximum size is a reasonable value,
7969 an overflow should not happen in practice. So rather than
7970 adding overflow recovery code to this already complex code,
7971 we just assume that it's not going to happen. */
7973 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7977 /* Note: If this field's type is a typedef, it is important
7978 to preserve the typedef layer.
7980 Otherwise, we might be transforming a typedef to a fat
7981 pointer (encoding a pointer to an unconstrained array),
7982 into a basic fat pointer (encoding an unconstrained
7983 array). As both types are implemented using the same
7984 structure, the typedef is the only clue which allows us
7985 to distinguish between the two options. Stripping it
7986 would prevent us from printing this field appropriately. */
7987 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
7988 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7989 if (TYPE_FIELD_BITSIZE (type, f) > 0)
7991 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7994 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7996 /* We need to be careful of typedefs when computing
7997 the length of our field. If this is a typedef,
7998 get the length of the target type, not the length
8000 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
8001 field_type = ada_typedef_target_type (field_type);
8004 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
8007 if (off + fld_bit_len > bit_len)
8008 bit_len = off + fld_bit_len;
8010 TYPE_LENGTH (rtype) =
8011 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8014 /* We handle the variant part, if any, at the end because of certain
8015 odd cases in which it is re-ordered so as NOT to be the last field of
8016 the record. This can happen in the presence of representation
8018 if (variant_field >= 0)
8020 struct type *branch_type;
8022 off = TYPE_FIELD_BITPOS (rtype, variant_field);
8026 /* Using plain value_from_contents_and_address here causes
8027 problems because we will end up trying to resolve a type
8028 that is currently being constructed. */
8029 dval = value_from_contents_and_address_unresolved (rtype, valaddr,
8031 rtype = value_type (dval);
8037 to_fixed_variant_branch_type
8038 (TYPE_FIELD_TYPE (type, variant_field),
8039 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
8040 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
8041 if (branch_type == NULL)
8043 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
8044 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8045 TYPE_NFIELDS (rtype) -= 1;
8049 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8050 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8052 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
8054 if (off + fld_bit_len > bit_len)
8055 bit_len = off + fld_bit_len;
8056 TYPE_LENGTH (rtype) =
8057 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8061 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8062 should contain the alignment of that record, which should be a strictly
8063 positive value. If null or negative, then something is wrong, most
8064 probably in the debug info. In that case, we don't round up the size
8065 of the resulting type. If this record is not part of another structure,
8066 the current RTYPE length might be good enough for our purposes. */
8067 if (TYPE_LENGTH (type) <= 0)
8069 if (TYPE_NAME (rtype))
8070 warning (_("Invalid type size for `%s' detected: %d."),
8071 TYPE_NAME (rtype), TYPE_LENGTH (type));
8073 warning (_("Invalid type size for <unnamed> detected: %d."),
8074 TYPE_LENGTH (type));
8078 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
8079 TYPE_LENGTH (type));
8082 value_free_to_mark (mark);
8083 if (TYPE_LENGTH (rtype) > varsize_limit)
8084 error (_("record type with dynamic size is larger than varsize-limit"));
8088 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8091 static struct type *
8092 template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
8093 CORE_ADDR address, struct value *dval0)
8095 return ada_template_to_fixed_record_type_1 (type, valaddr,
8099 /* An ordinary record type in which ___XVL-convention fields and
8100 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8101 static approximations, containing all possible fields. Uses
8102 no runtime values. Useless for use in values, but that's OK,
8103 since the results are used only for type determinations. Works on both
8104 structs and unions. Representation note: to save space, we memorize
8105 the result of this function in the TYPE_TARGET_TYPE of the
8108 static struct type *
8109 template_to_static_fixed_type (struct type *type0)
8115 if (TYPE_TARGET_TYPE (type0) != NULL)
8116 return TYPE_TARGET_TYPE (type0);
8118 nfields = TYPE_NFIELDS (type0);
8121 for (f = 0; f < nfields; f += 1)
8123 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
8124 struct type *new_type;
8126 if (is_dynamic_field (type0, f))
8127 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
8129 new_type = static_unwrap_type (field_type);
8130 if (type == type0 && new_type != field_type)
8132 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
8133 TYPE_CODE (type) = TYPE_CODE (type0);
8134 INIT_CPLUS_SPECIFIC (type);
8135 TYPE_NFIELDS (type) = nfields;
8136 TYPE_FIELDS (type) = (struct field *)
8137 TYPE_ALLOC (type, nfields * sizeof (struct field));
8138 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
8139 sizeof (struct field) * nfields);
8140 TYPE_NAME (type) = ada_type_name (type0);
8141 TYPE_TAG_NAME (type) = NULL;
8142 TYPE_FIXED_INSTANCE (type) = 1;
8143 TYPE_LENGTH (type) = 0;
8145 TYPE_FIELD_TYPE (type, f) = new_type;
8146 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
8151 /* Given an object of type TYPE whose contents are at VALADDR and
8152 whose address in memory is ADDRESS, returns a revision of TYPE,
8153 which should be a non-dynamic-sized record, in which the variant
8154 part, if any, is replaced with the appropriate branch. Looks
8155 for discriminant values in DVAL0, which can be NULL if the record
8156 contains the necessary discriminant values. */
8158 static struct type *
8159 to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
8160 CORE_ADDR address, struct value *dval0)
8162 struct value *mark = value_mark ();
8165 struct type *branch_type;
8166 int nfields = TYPE_NFIELDS (type);
8167 int variant_field = variant_field_index (type);
8169 if (variant_field == -1)
8174 dval = value_from_contents_and_address (type, valaddr, address);
8175 type = value_type (dval);
8180 rtype = alloc_type_copy (type);
8181 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8182 INIT_CPLUS_SPECIFIC (rtype);
8183 TYPE_NFIELDS (rtype) = nfields;
8184 TYPE_FIELDS (rtype) =
8185 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8186 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
8187 sizeof (struct field) * nfields);
8188 TYPE_NAME (rtype) = ada_type_name (type);
8189 TYPE_TAG_NAME (rtype) = NULL;
8190 TYPE_FIXED_INSTANCE (rtype) = 1;
8191 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
8193 branch_type = to_fixed_variant_branch_type
8194 (TYPE_FIELD_TYPE (type, variant_field),
8195 cond_offset_host (valaddr,
8196 TYPE_FIELD_BITPOS (type, variant_field)
8198 cond_offset_target (address,
8199 TYPE_FIELD_BITPOS (type, variant_field)
8200 / TARGET_CHAR_BIT), dval);
8201 if (branch_type == NULL)
8205 for (f = variant_field + 1; f < nfields; f += 1)
8206 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8207 TYPE_NFIELDS (rtype) -= 1;
8211 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8212 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8213 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
8214 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
8216 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
8218 value_free_to_mark (mark);
8222 /* An ordinary record type (with fixed-length fields) that describes
8223 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8224 beginning of this section]. Any necessary discriminants' values
8225 should be in DVAL, a record value; it may be NULL if the object
8226 at ADDR itself contains any necessary discriminant values.
8227 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8228 values from the record are needed. Except in the case that DVAL,
8229 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8230 unchecked) is replaced by a particular branch of the variant.
8232 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8233 is questionable and may be removed. It can arise during the
8234 processing of an unconstrained-array-of-record type where all the
8235 variant branches have exactly the same size. This is because in
8236 such cases, the compiler does not bother to use the XVS convention
8237 when encoding the record. I am currently dubious of this
8238 shortcut and suspect the compiler should be altered. FIXME. */
8240 static struct type *
8241 to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
8242 CORE_ADDR address, struct value *dval)
8244 struct type *templ_type;
8246 if (TYPE_FIXED_INSTANCE (type0))
8249 templ_type = dynamic_template_type (type0);
8251 if (templ_type != NULL)
8252 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
8253 else if (variant_field_index (type0) >= 0)
8255 if (dval == NULL && valaddr == NULL && address == 0)
8257 return to_record_with_fixed_variant_part (type0, valaddr, address,
8262 TYPE_FIXED_INSTANCE (type0) = 1;
8268 /* An ordinary record type (with fixed-length fields) that describes
8269 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8270 union type. Any necessary discriminants' values should be in DVAL,
8271 a record value. That is, this routine selects the appropriate
8272 branch of the union at ADDR according to the discriminant value
8273 indicated in the union's type name. Returns VAR_TYPE0 itself if
8274 it represents a variant subject to a pragma Unchecked_Union. */
8276 static struct type *
8277 to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
8278 CORE_ADDR address, struct value *dval)
8281 struct type *templ_type;
8282 struct type *var_type;
8284 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
8285 var_type = TYPE_TARGET_TYPE (var_type0);
8287 var_type = var_type0;
8289 templ_type = ada_find_parallel_type (var_type, "___XVU");
8291 if (templ_type != NULL)
8292 var_type = templ_type;
8294 if (is_unchecked_variant (var_type, value_type (dval)))
8297 ada_which_variant_applies (var_type,
8298 value_type (dval), value_contents (dval));
8301 return empty_record (var_type);
8302 else if (is_dynamic_field (var_type, which))
8303 return to_fixed_record_type
8304 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
8305 valaddr, address, dval);
8306 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
8308 to_fixed_record_type
8309 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
8311 return TYPE_FIELD_TYPE (var_type, which);
8314 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8315 ENCODING_TYPE, a type following the GNAT conventions for discrete
8316 type encodings, only carries redundant information. */
8319 ada_is_redundant_range_encoding (struct type *range_type,
8320 struct type *encoding_type)
8322 struct type *fixed_range_type;
8327 gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE);
8329 if (is_dynamic_type (range_type))
8332 if (TYPE_NAME (encoding_type) == NULL)
8335 bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_");
8336 if (bounds_str == NULL)
8339 n = 8; /* Skip "___XDLU_". */
8340 if (!ada_scan_number (bounds_str, n, &lo, &n))
8342 if (TYPE_LOW_BOUND (range_type) != lo)
8345 n += 2; /* Skip the "__" separator between the two bounds. */
8346 if (!ada_scan_number (bounds_str, n, &hi, &n))
8348 if (TYPE_HIGH_BOUND (range_type) != hi)
8354 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8355 a type following the GNAT encoding for describing array type
8356 indices, only carries redundant information. */
8359 ada_is_redundant_index_type_desc (struct type *array_type,
8360 struct type *desc_type)
8362 struct type *this_layer = check_typedef (array_type);
8365 for (i = 0; i < TYPE_NFIELDS (desc_type); i++)
8367 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer),
8368 TYPE_FIELD_TYPE (desc_type, i)))
8370 this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer));
8376 /* Assuming that TYPE0 is an array type describing the type of a value
8377 at ADDR, and that DVAL describes a record containing any
8378 discriminants used in TYPE0, returns a type for the value that
8379 contains no dynamic components (that is, no components whose sizes
8380 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8381 true, gives an error message if the resulting type's size is over
8384 static struct type *
8385 to_fixed_array_type (struct type *type0, struct value *dval,
8388 struct type *index_type_desc;
8389 struct type *result;
8390 int constrained_packed_array_p;
8392 type0 = ada_check_typedef (type0);
8393 if (TYPE_FIXED_INSTANCE (type0))
8396 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
8397 if (constrained_packed_array_p)
8398 type0 = decode_constrained_packed_array_type (type0);
8400 index_type_desc = ada_find_parallel_type (type0, "___XA");
8401 ada_fixup_array_indexes_type (index_type_desc);
8402 if (index_type_desc != NULL
8403 && ada_is_redundant_index_type_desc (type0, index_type_desc))
8405 /* Ignore this ___XA parallel type, as it does not bring any
8406 useful information. This allows us to avoid creating fixed
8407 versions of the array's index types, which would be identical
8408 to the original ones. This, in turn, can also help avoid
8409 the creation of fixed versions of the array itself. */
8410 index_type_desc = NULL;
8413 if (index_type_desc == NULL)
8415 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
8417 /* NOTE: elt_type---the fixed version of elt_type0---should never
8418 depend on the contents of the array in properly constructed
8420 /* Create a fixed version of the array element type.
8421 We're not providing the address of an element here,
8422 and thus the actual object value cannot be inspected to do
8423 the conversion. This should not be a problem, since arrays of
8424 unconstrained objects are not allowed. In particular, all
8425 the elements of an array of a tagged type should all be of
8426 the same type specified in the debugging info. No need to
8427 consult the object tag. */
8428 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
8430 /* Make sure we always create a new array type when dealing with
8431 packed array types, since we're going to fix-up the array
8432 type length and element bitsize a little further down. */
8433 if (elt_type0 == elt_type && !constrained_packed_array_p)
8436 result = create_array_type (alloc_type_copy (type0),
8437 elt_type, TYPE_INDEX_TYPE (type0));
8442 struct type *elt_type0;
8445 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
8446 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8448 /* NOTE: result---the fixed version of elt_type0---should never
8449 depend on the contents of the array in properly constructed
8451 /* Create a fixed version of the array element type.
8452 We're not providing the address of an element here,
8453 and thus the actual object value cannot be inspected to do
8454 the conversion. This should not be a problem, since arrays of
8455 unconstrained objects are not allowed. In particular, all
8456 the elements of an array of a tagged type should all be of
8457 the same type specified in the debugging info. No need to
8458 consult the object tag. */
8460 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
8463 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
8465 struct type *range_type =
8466 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
8468 result = create_array_type (alloc_type_copy (elt_type0),
8469 result, range_type);
8470 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
8472 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
8473 error (_("array type with dynamic size is larger than varsize-limit"));
8476 /* We want to preserve the type name. This can be useful when
8477 trying to get the type name of a value that has already been
8478 printed (for instance, if the user did "print VAR; whatis $". */
8479 TYPE_NAME (result) = TYPE_NAME (type0);
8481 if (constrained_packed_array_p)
8483 /* So far, the resulting type has been created as if the original
8484 type was a regular (non-packed) array type. As a result, the
8485 bitsize of the array elements needs to be set again, and the array
8486 length needs to be recomputed based on that bitsize. */
8487 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
8488 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
8490 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
8491 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
8492 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
8493 TYPE_LENGTH (result)++;
8496 TYPE_FIXED_INSTANCE (result) = 1;
8501 /* A standard type (containing no dynamically sized components)
8502 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8503 DVAL describes a record containing any discriminants used in TYPE0,
8504 and may be NULL if there are none, or if the object of type TYPE at
8505 ADDRESS or in VALADDR contains these discriminants.
8507 If CHECK_TAG is not null, in the case of tagged types, this function
8508 attempts to locate the object's tag and use it to compute the actual
8509 type. However, when ADDRESS is null, we cannot use it to determine the
8510 location of the tag, and therefore compute the tagged type's actual type.
8511 So we return the tagged type without consulting the tag. */
8513 static struct type *
8514 ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
8515 CORE_ADDR address, struct value *dval, int check_tag)
8517 type = ada_check_typedef (type);
8518 switch (TYPE_CODE (type))
8522 case TYPE_CODE_STRUCT:
8524 struct type *static_type = to_static_fixed_type (type);
8525 struct type *fixed_record_type =
8526 to_fixed_record_type (type, valaddr, address, NULL);
8528 /* If STATIC_TYPE is a tagged type and we know the object's address,
8529 then we can determine its tag, and compute the object's actual
8530 type from there. Note that we have to use the fixed record
8531 type (the parent part of the record may have dynamic fields
8532 and the way the location of _tag is expressed may depend on
8535 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
8538 value_tag_from_contents_and_address
8542 struct type *real_type = type_from_tag (tag);
8544 value_from_contents_and_address (fixed_record_type,
8547 fixed_record_type = value_type (obj);
8548 if (real_type != NULL)
8549 return to_fixed_record_type
8551 value_address (ada_tag_value_at_base_address (obj)), NULL);
8554 /* Check to see if there is a parallel ___XVZ variable.
8555 If there is, then it provides the actual size of our type. */
8556 else if (ada_type_name (fixed_record_type) != NULL)
8558 const char *name = ada_type_name (fixed_record_type);
8559 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
8563 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
8564 size = get_int_var_value (xvz_name, &xvz_found);
8565 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
8567 fixed_record_type = copy_type (fixed_record_type);
8568 TYPE_LENGTH (fixed_record_type) = size;
8570 /* The FIXED_RECORD_TYPE may have be a stub. We have
8571 observed this when the debugging info is STABS, and
8572 apparently it is something that is hard to fix.
8574 In practice, we don't need the actual type definition
8575 at all, because the presence of the XVZ variable allows us
8576 to assume that there must be a XVS type as well, which we
8577 should be able to use later, when we need the actual type
8580 In the meantime, pretend that the "fixed" type we are
8581 returning is NOT a stub, because this can cause trouble
8582 when using this type to create new types targeting it.
8583 Indeed, the associated creation routines often check
8584 whether the target type is a stub and will try to replace
8585 it, thus using a type with the wrong size. This, in turn,
8586 might cause the new type to have the wrong size too.
8587 Consider the case of an array, for instance, where the size
8588 of the array is computed from the number of elements in
8589 our array multiplied by the size of its element. */
8590 TYPE_STUB (fixed_record_type) = 0;
8593 return fixed_record_type;
8595 case TYPE_CODE_ARRAY:
8596 return to_fixed_array_type (type, dval, 1);
8597 case TYPE_CODE_UNION:
8601 return to_fixed_variant_branch_type (type, valaddr, address, dval);
8605 /* The same as ada_to_fixed_type_1, except that it preserves the type
8606 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8608 The typedef layer needs be preserved in order to differentiate between
8609 arrays and array pointers when both types are implemented using the same
8610 fat pointer. In the array pointer case, the pointer is encoded as
8611 a typedef of the pointer type. For instance, considering:
8613 type String_Access is access String;
8614 S1 : String_Access := null;
8616 To the debugger, S1 is defined as a typedef of type String. But
8617 to the user, it is a pointer. So if the user tries to print S1,
8618 we should not dereference the array, but print the array address
8621 If we didn't preserve the typedef layer, we would lose the fact that
8622 the type is to be presented as a pointer (needs de-reference before
8623 being printed). And we would also use the source-level type name. */
8626 ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
8627 CORE_ADDR address, struct value *dval, int check_tag)
8630 struct type *fixed_type =
8631 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
8633 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8634 then preserve the typedef layer.
8636 Implementation note: We can only check the main-type portion of
8637 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8638 from TYPE now returns a type that has the same instance flags
8639 as TYPE. For instance, if TYPE is a "typedef const", and its
8640 target type is a "struct", then the typedef elimination will return
8641 a "const" version of the target type. See check_typedef for more
8642 details about how the typedef layer elimination is done.
8644 brobecker/2010-11-19: It seems to me that the only case where it is
8645 useful to preserve the typedef layer is when dealing with fat pointers.
8646 Perhaps, we could add a check for that and preserve the typedef layer
8647 only in that situation. But this seems unecessary so far, probably
8648 because we call check_typedef/ada_check_typedef pretty much everywhere.
8650 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8651 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
8652 == TYPE_MAIN_TYPE (fixed_type)))
8658 /* A standard (static-sized) type corresponding as well as possible to
8659 TYPE0, but based on no runtime data. */
8661 static struct type *
8662 to_static_fixed_type (struct type *type0)
8669 if (TYPE_FIXED_INSTANCE (type0))
8672 type0 = ada_check_typedef (type0);
8674 switch (TYPE_CODE (type0))
8678 case TYPE_CODE_STRUCT:
8679 type = dynamic_template_type (type0);
8681 return template_to_static_fixed_type (type);
8683 return template_to_static_fixed_type (type0);
8684 case TYPE_CODE_UNION:
8685 type = ada_find_parallel_type (type0, "___XVU");
8687 return template_to_static_fixed_type (type);
8689 return template_to_static_fixed_type (type0);
8693 /* A static approximation of TYPE with all type wrappers removed. */
8695 static struct type *
8696 static_unwrap_type (struct type *type)
8698 if (ada_is_aligner_type (type))
8700 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
8701 if (ada_type_name (type1) == NULL)
8702 TYPE_NAME (type1) = ada_type_name (type);
8704 return static_unwrap_type (type1);
8708 struct type *raw_real_type = ada_get_base_type (type);
8710 if (raw_real_type == type)
8713 return to_static_fixed_type (raw_real_type);
8717 /* In some cases, incomplete and private types require
8718 cross-references that are not resolved as records (for example,
8720 type FooP is access Foo;
8722 type Foo is array ...;
8723 ). In these cases, since there is no mechanism for producing
8724 cross-references to such types, we instead substitute for FooP a
8725 stub enumeration type that is nowhere resolved, and whose tag is
8726 the name of the actual type. Call these types "non-record stubs". */
8728 /* A type equivalent to TYPE that is not a non-record stub, if one
8729 exists, otherwise TYPE. */
8732 ada_check_typedef (struct type *type)
8737 /* If our type is a typedef type of a fat pointer, then we're done.
8738 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8739 what allows us to distinguish between fat pointers that represent
8740 array types, and fat pointers that represent array access types
8741 (in both cases, the compiler implements them as fat pointers). */
8742 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8743 && is_thick_pntr (ada_typedef_target_type (type)))
8746 CHECK_TYPEDEF (type);
8747 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
8748 || !TYPE_STUB (type)
8749 || TYPE_TAG_NAME (type) == NULL)
8753 const char *name = TYPE_TAG_NAME (type);
8754 struct type *type1 = ada_find_any_type (name);
8759 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8760 stubs pointing to arrays, as we don't create symbols for array
8761 types, only for the typedef-to-array types). If that's the case,
8762 strip the typedef layer. */
8763 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
8764 type1 = ada_check_typedef (type1);
8770 /* A value representing the data at VALADDR/ADDRESS as described by
8771 type TYPE0, but with a standard (static-sized) type that correctly
8772 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8773 type, then return VAL0 [this feature is simply to avoid redundant
8774 creation of struct values]. */
8776 static struct value *
8777 ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
8780 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
8782 if (type == type0 && val0 != NULL)
8785 return value_from_contents_and_address (type, 0, address);
8788 /* A value representing VAL, but with a standard (static-sized) type
8789 that correctly describes it. Does not necessarily create a new
8793 ada_to_fixed_value (struct value *val)
8795 val = unwrap_value (val);
8796 val = ada_to_fixed_value_create (value_type (val),
8797 value_address (val),
8805 /* Table mapping attribute numbers to names.
8806 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8808 static const char *attribute_names[] = {
8826 ada_attribute_name (enum exp_opcode n)
8828 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
8829 return attribute_names[n - OP_ATR_FIRST + 1];
8831 return attribute_names[0];
8834 /* Evaluate the 'POS attribute applied to ARG. */
8837 pos_atr (struct value *arg)
8839 struct value *val = coerce_ref (arg);
8840 struct type *type = value_type (val);
8842 if (!discrete_type_p (type))
8843 error (_("'POS only defined on discrete types"));
8845 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8848 LONGEST v = value_as_long (val);
8850 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
8852 if (v == TYPE_FIELD_ENUMVAL (type, i))
8855 error (_("enumeration value is invalid: can't find 'POS"));
8858 return value_as_long (val);
8861 static struct value *
8862 value_pos_atr (struct type *type, struct value *arg)
8864 return value_from_longest (type, pos_atr (arg));
8867 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8869 static struct value *
8870 value_val_atr (struct type *type, struct value *arg)
8872 if (!discrete_type_p (type))
8873 error (_("'VAL only defined on discrete types"));
8874 if (!integer_type_p (value_type (arg)))
8875 error (_("'VAL requires integral argument"));
8877 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8879 long pos = value_as_long (arg);
8881 if (pos < 0 || pos >= TYPE_NFIELDS (type))
8882 error (_("argument to 'VAL out of range"));
8883 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
8886 return value_from_longest (type, value_as_long (arg));
8892 /* True if TYPE appears to be an Ada character type.
8893 [At the moment, this is true only for Character and Wide_Character;
8894 It is a heuristic test that could stand improvement]. */
8897 ada_is_character_type (struct type *type)
8901 /* If the type code says it's a character, then assume it really is,
8902 and don't check any further. */
8903 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
8906 /* Otherwise, assume it's a character type iff it is a discrete type
8907 with a known character type name. */
8908 name = ada_type_name (type);
8909 return (name != NULL
8910 && (TYPE_CODE (type) == TYPE_CODE_INT
8911 || TYPE_CODE (type) == TYPE_CODE_RANGE)
8912 && (strcmp (name, "character") == 0
8913 || strcmp (name, "wide_character") == 0
8914 || strcmp (name, "wide_wide_character") == 0
8915 || strcmp (name, "unsigned char") == 0));
8918 /* True if TYPE appears to be an Ada string type. */
8921 ada_is_string_type (struct type *type)
8923 type = ada_check_typedef (type);
8925 && TYPE_CODE (type) != TYPE_CODE_PTR
8926 && (ada_is_simple_array_type (type)
8927 || ada_is_array_descriptor_type (type))
8928 && ada_array_arity (type) == 1)
8930 struct type *elttype = ada_array_element_type (type, 1);
8932 return ada_is_character_type (elttype);
8938 /* The compiler sometimes provides a parallel XVS type for a given
8939 PAD type. Normally, it is safe to follow the PAD type directly,
8940 but older versions of the compiler have a bug that causes the offset
8941 of its "F" field to be wrong. Following that field in that case
8942 would lead to incorrect results, but this can be worked around
8943 by ignoring the PAD type and using the associated XVS type instead.
8945 Set to True if the debugger should trust the contents of PAD types.
8946 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8947 static int trust_pad_over_xvs = 1;
8949 /* True if TYPE is a struct type introduced by the compiler to force the
8950 alignment of a value. Such types have a single field with a
8951 distinctive name. */
8954 ada_is_aligner_type (struct type *type)
8956 type = ada_check_typedef (type);
8958 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
8961 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
8962 && TYPE_NFIELDS (type) == 1
8963 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
8966 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8967 the parallel type. */
8970 ada_get_base_type (struct type *raw_type)
8972 struct type *real_type_namer;
8973 struct type *raw_real_type;
8975 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
8978 if (ada_is_aligner_type (raw_type))
8979 /* The encoding specifies that we should always use the aligner type.
8980 So, even if this aligner type has an associated XVS type, we should
8983 According to the compiler gurus, an XVS type parallel to an aligner
8984 type may exist because of a stabs limitation. In stabs, aligner
8985 types are empty because the field has a variable-sized type, and
8986 thus cannot actually be used as an aligner type. As a result,
8987 we need the associated parallel XVS type to decode the type.
8988 Since the policy in the compiler is to not change the internal
8989 representation based on the debugging info format, we sometimes
8990 end up having a redundant XVS type parallel to the aligner type. */
8993 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
8994 if (real_type_namer == NULL
8995 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
8996 || TYPE_NFIELDS (real_type_namer) != 1)
8999 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
9001 /* This is an older encoding form where the base type needs to be
9002 looked up by name. We prefer the newer enconding because it is
9004 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
9005 if (raw_real_type == NULL)
9008 return raw_real_type;
9011 /* The field in our XVS type is a reference to the base type. */
9012 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
9015 /* The type of value designated by TYPE, with all aligners removed. */
9018 ada_aligned_type (struct type *type)
9020 if (ada_is_aligner_type (type))
9021 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
9023 return ada_get_base_type (type);
9027 /* The address of the aligned value in an object at address VALADDR
9028 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9031 ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
9033 if (ada_is_aligner_type (type))
9034 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
9036 TYPE_FIELD_BITPOS (type,
9037 0) / TARGET_CHAR_BIT);
9044 /* The printed representation of an enumeration literal with encoded
9045 name NAME. The value is good to the next call of ada_enum_name. */
9047 ada_enum_name (const char *name)
9049 static char *result;
9050 static size_t result_len = 0;
9053 /* First, unqualify the enumeration name:
9054 1. Search for the last '.' character. If we find one, then skip
9055 all the preceding characters, the unqualified name starts
9056 right after that dot.
9057 2. Otherwise, we may be debugging on a target where the compiler
9058 translates dots into "__". Search forward for double underscores,
9059 but stop searching when we hit an overloading suffix, which is
9060 of the form "__" followed by digits. */
9062 tmp = strrchr (name, '.');
9067 while ((tmp = strstr (name, "__")) != NULL)
9069 if (isdigit (tmp[2]))
9080 if (name[1] == 'U' || name[1] == 'W')
9082 if (sscanf (name + 2, "%x", &v) != 1)
9088 GROW_VECT (result, result_len, 16);
9089 if (isascii (v) && isprint (v))
9090 xsnprintf (result, result_len, "'%c'", v);
9091 else if (name[1] == 'U')
9092 xsnprintf (result, result_len, "[\"%02x\"]", v);
9094 xsnprintf (result, result_len, "[\"%04x\"]", v);
9100 tmp = strstr (name, "__");
9102 tmp = strstr (name, "$");
9105 GROW_VECT (result, result_len, tmp - name + 1);
9106 strncpy (result, name, tmp - name);
9107 result[tmp - name] = '\0';
9115 /* Evaluate the subexpression of EXP starting at *POS as for
9116 evaluate_type, updating *POS to point just past the evaluated
9119 static struct value *
9120 evaluate_subexp_type (struct expression *exp, int *pos)
9122 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9125 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9128 static struct value *
9129 unwrap_value (struct value *val)
9131 struct type *type = ada_check_typedef (value_type (val));
9133 if (ada_is_aligner_type (type))
9135 struct value *v = ada_value_struct_elt (val, "F", 0);
9136 struct type *val_type = ada_check_typedef (value_type (v));
9138 if (ada_type_name (val_type) == NULL)
9139 TYPE_NAME (val_type) = ada_type_name (type);
9141 return unwrap_value (v);
9145 struct type *raw_real_type =
9146 ada_check_typedef (ada_get_base_type (type));
9148 /* If there is no parallel XVS or XVE type, then the value is
9149 already unwrapped. Return it without further modification. */
9150 if ((type == raw_real_type)
9151 && ada_find_parallel_type (type, "___XVE") == NULL)
9155 coerce_unspec_val_to_type
9156 (val, ada_to_fixed_type (raw_real_type, 0,
9157 value_address (val),
9162 static struct value *
9163 cast_to_fixed (struct type *type, struct value *arg)
9167 if (type == value_type (arg))
9169 else if (ada_is_fixed_point_type (value_type (arg)))
9170 val = ada_float_to_fixed (type,
9171 ada_fixed_to_float (value_type (arg),
9172 value_as_long (arg)));
9175 DOUBLEST argd = value_as_double (arg);
9177 val = ada_float_to_fixed (type, argd);
9180 return value_from_longest (type, val);
9183 static struct value *
9184 cast_from_fixed (struct type *type, struct value *arg)
9186 DOUBLEST val = ada_fixed_to_float (value_type (arg),
9187 value_as_long (arg));
9189 return value_from_double (type, val);
9192 /* Given two array types T1 and T2, return nonzero iff both arrays
9193 contain the same number of elements. */
9196 ada_same_array_size_p (struct type *t1, struct type *t2)
9198 LONGEST lo1, hi1, lo2, hi2;
9200 /* Get the array bounds in order to verify that the size of
9201 the two arrays match. */
9202 if (!get_array_bounds (t1, &lo1, &hi1)
9203 || !get_array_bounds (t2, &lo2, &hi2))
9204 error (_("unable to determine array bounds"));
9206 /* To make things easier for size comparison, normalize a bit
9207 the case of empty arrays by making sure that the difference
9208 between upper bound and lower bound is always -1. */
9214 return (hi1 - lo1 == hi2 - lo2);
9217 /* Assuming that VAL is an array of integrals, and TYPE represents
9218 an array with the same number of elements, but with wider integral
9219 elements, return an array "casted" to TYPE. In practice, this
9220 means that the returned array is built by casting each element
9221 of the original array into TYPE's (wider) element type. */
9223 static struct value *
9224 ada_promote_array_of_integrals (struct type *type, struct value *val)
9226 struct type *elt_type = TYPE_TARGET_TYPE (type);
9231 /* Verify that both val and type are arrays of scalars, and
9232 that the size of val's elements is smaller than the size
9233 of type's element. */
9234 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
9235 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
9236 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
9237 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
9238 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
9239 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
9241 if (!get_array_bounds (type, &lo, &hi))
9242 error (_("unable to determine array bounds"));
9244 res = allocate_value (type);
9246 /* Promote each array element. */
9247 for (i = 0; i < hi - lo + 1; i++)
9249 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
9251 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
9252 value_contents_all (elt), TYPE_LENGTH (elt_type));
9258 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9259 return the converted value. */
9261 static struct value *
9262 coerce_for_assign (struct type *type, struct value *val)
9264 struct type *type2 = value_type (val);
9269 type2 = ada_check_typedef (type2);
9270 type = ada_check_typedef (type);
9272 if (TYPE_CODE (type2) == TYPE_CODE_PTR
9273 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9275 val = ada_value_ind (val);
9276 type2 = value_type (val);
9279 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
9280 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9282 if (!ada_same_array_size_p (type, type2))
9283 error (_("cannot assign arrays of different length"));
9285 if (is_integral_type (TYPE_TARGET_TYPE (type))
9286 && is_integral_type (TYPE_TARGET_TYPE (type2))
9287 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9288 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9290 /* Allow implicit promotion of the array elements to
9292 return ada_promote_array_of_integrals (type, val);
9295 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9296 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9297 error (_("Incompatible types in assignment"));
9298 deprecated_set_value_type (val, type);
9303 static struct value *
9304 ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
9307 struct type *type1, *type2;
9310 arg1 = coerce_ref (arg1);
9311 arg2 = coerce_ref (arg2);
9312 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
9313 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
9315 if (TYPE_CODE (type1) != TYPE_CODE_INT
9316 || TYPE_CODE (type2) != TYPE_CODE_INT)
9317 return value_binop (arg1, arg2, op);
9326 return value_binop (arg1, arg2, op);
9329 v2 = value_as_long (arg2);
9331 error (_("second operand of %s must not be zero."), op_string (op));
9333 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
9334 return value_binop (arg1, arg2, op);
9336 v1 = value_as_long (arg1);
9341 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
9342 v += v > 0 ? -1 : 1;
9350 /* Should not reach this point. */
9354 val = allocate_value (type1);
9355 store_unsigned_integer (value_contents_raw (val),
9356 TYPE_LENGTH (value_type (val)),
9357 gdbarch_byte_order (get_type_arch (type1)), v);
9362 ada_value_equal (struct value *arg1, struct value *arg2)
9364 if (ada_is_direct_array_type (value_type (arg1))
9365 || ada_is_direct_array_type (value_type (arg2)))
9367 /* Automatically dereference any array reference before
9368 we attempt to perform the comparison. */
9369 arg1 = ada_coerce_ref (arg1);
9370 arg2 = ada_coerce_ref (arg2);
9372 arg1 = ada_coerce_to_simple_array (arg1);
9373 arg2 = ada_coerce_to_simple_array (arg2);
9374 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
9375 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
9376 error (_("Attempt to compare array with non-array"));
9377 /* FIXME: The following works only for types whose
9378 representations use all bits (no padding or undefined bits)
9379 and do not have user-defined equality. */
9381 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
9382 && memcmp (value_contents (arg1), value_contents (arg2),
9383 TYPE_LENGTH (value_type (arg1))) == 0;
9385 return value_equal (arg1, arg2);
9388 /* Total number of component associations in the aggregate starting at
9389 index PC in EXP. Assumes that index PC is the start of an
9393 num_component_specs (struct expression *exp, int pc)
9397 m = exp->elts[pc + 1].longconst;
9400 for (i = 0; i < m; i += 1)
9402 switch (exp->elts[pc].opcode)
9408 n += exp->elts[pc + 1].longconst;
9411 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
9416 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9417 component of LHS (a simple array or a record), updating *POS past
9418 the expression, assuming that LHS is contained in CONTAINER. Does
9419 not modify the inferior's memory, nor does it modify LHS (unless
9420 LHS == CONTAINER). */
9423 assign_component (struct value *container, struct value *lhs, LONGEST index,
9424 struct expression *exp, int *pos)
9426 struct value *mark = value_mark ();
9429 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
9431 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
9432 struct value *index_val = value_from_longest (index_type, index);
9434 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
9438 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
9439 elt = ada_to_fixed_value (elt);
9442 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9443 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
9445 value_assign_to_component (container, elt,
9446 ada_evaluate_subexp (NULL, exp, pos,
9449 value_free_to_mark (mark);
9452 /* Assuming that LHS represents an lvalue having a record or array
9453 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9454 of that aggregate's value to LHS, advancing *POS past the
9455 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9456 lvalue containing LHS (possibly LHS itself). Does not modify
9457 the inferior's memory, nor does it modify the contents of
9458 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9460 static struct value *
9461 assign_aggregate (struct value *container,
9462 struct value *lhs, struct expression *exp,
9463 int *pos, enum noside noside)
9465 struct type *lhs_type;
9466 int n = exp->elts[*pos+1].longconst;
9467 LONGEST low_index, high_index;
9470 int max_indices, num_indices;
9474 if (noside != EVAL_NORMAL)
9476 for (i = 0; i < n; i += 1)
9477 ada_evaluate_subexp (NULL, exp, pos, noside);
9481 container = ada_coerce_ref (container);
9482 if (ada_is_direct_array_type (value_type (container)))
9483 container = ada_coerce_to_simple_array (container);
9484 lhs = ada_coerce_ref (lhs);
9485 if (!deprecated_value_modifiable (lhs))
9486 error (_("Left operand of assignment is not a modifiable lvalue."));
9488 lhs_type = value_type (lhs);
9489 if (ada_is_direct_array_type (lhs_type))
9491 lhs = ada_coerce_to_simple_array (lhs);
9492 lhs_type = value_type (lhs);
9493 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
9494 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
9496 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
9499 high_index = num_visible_fields (lhs_type) - 1;
9502 error (_("Left-hand side must be array or record."));
9504 num_specs = num_component_specs (exp, *pos - 3);
9505 max_indices = 4 * num_specs + 4;
9506 indices = alloca (max_indices * sizeof (indices[0]));
9507 indices[0] = indices[1] = low_index - 1;
9508 indices[2] = indices[3] = high_index + 1;
9511 for (i = 0; i < n; i += 1)
9513 switch (exp->elts[*pos].opcode)
9516 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
9517 &num_indices, max_indices,
9518 low_index, high_index);
9521 aggregate_assign_positional (container, lhs, exp, pos, indices,
9522 &num_indices, max_indices,
9523 low_index, high_index);
9527 error (_("Misplaced 'others' clause"));
9528 aggregate_assign_others (container, lhs, exp, pos, indices,
9529 num_indices, low_index, high_index);
9532 error (_("Internal error: bad aggregate clause"));
9539 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9540 construct at *POS, updating *POS past the construct, given that
9541 the positions are relative to lower bound LOW, where HIGH is the
9542 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9543 updating *NUM_INDICES as needed. CONTAINER is as for
9544 assign_aggregate. */
9546 aggregate_assign_positional (struct value *container,
9547 struct value *lhs, struct expression *exp,
9548 int *pos, LONGEST *indices, int *num_indices,
9549 int max_indices, LONGEST low, LONGEST high)
9551 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
9553 if (ind - 1 == high)
9554 warning (_("Extra components in aggregate ignored."));
9557 add_component_interval (ind, ind, indices, num_indices, max_indices);
9559 assign_component (container, lhs, ind, exp, pos);
9562 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9565 /* Assign into the components of LHS indexed by the OP_CHOICES
9566 construct at *POS, updating *POS past the construct, given that
9567 the allowable indices are LOW..HIGH. Record the indices assigned
9568 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9569 needed. CONTAINER is as for assign_aggregate. */
9571 aggregate_assign_from_choices (struct value *container,
9572 struct value *lhs, struct expression *exp,
9573 int *pos, LONGEST *indices, int *num_indices,
9574 int max_indices, LONGEST low, LONGEST high)
9577 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
9578 int choice_pos, expr_pc;
9579 int is_array = ada_is_direct_array_type (value_type (lhs));
9581 choice_pos = *pos += 3;
9583 for (j = 0; j < n_choices; j += 1)
9584 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9586 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9588 for (j = 0; j < n_choices; j += 1)
9590 LONGEST lower, upper;
9591 enum exp_opcode op = exp->elts[choice_pos].opcode;
9593 if (op == OP_DISCRETE_RANGE)
9596 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9598 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9603 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
9615 name = &exp->elts[choice_pos + 2].string;
9618 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
9621 error (_("Invalid record component association."));
9623 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
9625 if (! find_struct_field (name, value_type (lhs), 0,
9626 NULL, NULL, NULL, NULL, &ind))
9627 error (_("Unknown component name: %s."), name);
9628 lower = upper = ind;
9631 if (lower <= upper && (lower < low || upper > high))
9632 error (_("Index in component association out of bounds."));
9634 add_component_interval (lower, upper, indices, num_indices,
9636 while (lower <= upper)
9641 assign_component (container, lhs, lower, exp, &pos1);
9647 /* Assign the value of the expression in the OP_OTHERS construct in
9648 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9649 have not been previously assigned. The index intervals already assigned
9650 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9651 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9653 aggregate_assign_others (struct value *container,
9654 struct value *lhs, struct expression *exp,
9655 int *pos, LONGEST *indices, int num_indices,
9656 LONGEST low, LONGEST high)
9659 int expr_pc = *pos + 1;
9661 for (i = 0; i < num_indices - 2; i += 2)
9665 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
9670 assign_component (container, lhs, ind, exp, &localpos);
9673 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9676 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9677 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9678 modifying *SIZE as needed. It is an error if *SIZE exceeds
9679 MAX_SIZE. The resulting intervals do not overlap. */
9681 add_component_interval (LONGEST low, LONGEST high,
9682 LONGEST* indices, int *size, int max_size)
9686 for (i = 0; i < *size; i += 2) {
9687 if (high >= indices[i] && low <= indices[i + 1])
9691 for (kh = i + 2; kh < *size; kh += 2)
9692 if (high < indices[kh])
9694 if (low < indices[i])
9696 indices[i + 1] = indices[kh - 1];
9697 if (high > indices[i + 1])
9698 indices[i + 1] = high;
9699 memcpy (indices + i + 2, indices + kh, *size - kh);
9700 *size -= kh - i - 2;
9703 else if (high < indices[i])
9707 if (*size == max_size)
9708 error (_("Internal error: miscounted aggregate components."));
9710 for (j = *size-1; j >= i+2; j -= 1)
9711 indices[j] = indices[j - 2];
9713 indices[i + 1] = high;
9716 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9719 static struct value *
9720 ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
9722 if (type == ada_check_typedef (value_type (arg2)))
9725 if (ada_is_fixed_point_type (type))
9726 return (cast_to_fixed (type, arg2));
9728 if (ada_is_fixed_point_type (value_type (arg2)))
9729 return cast_from_fixed (type, arg2);
9731 return value_cast (type, arg2);
9734 /* Evaluating Ada expressions, and printing their result.
9735 ------------------------------------------------------
9740 We usually evaluate an Ada expression in order to print its value.
9741 We also evaluate an expression in order to print its type, which
9742 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9743 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9744 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9745 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9748 Evaluating expressions is a little more complicated for Ada entities
9749 than it is for entities in languages such as C. The main reason for
9750 this is that Ada provides types whose definition might be dynamic.
9751 One example of such types is variant records. Or another example
9752 would be an array whose bounds can only be known at run time.
9754 The following description is a general guide as to what should be
9755 done (and what should NOT be done) in order to evaluate an expression
9756 involving such types, and when. This does not cover how the semantic
9757 information is encoded by GNAT as this is covered separatly. For the
9758 document used as the reference for the GNAT encoding, see exp_dbug.ads
9759 in the GNAT sources.
9761 Ideally, we should embed each part of this description next to its
9762 associated code. Unfortunately, the amount of code is so vast right
9763 now that it's hard to see whether the code handling a particular
9764 situation might be duplicated or not. One day, when the code is
9765 cleaned up, this guide might become redundant with the comments
9766 inserted in the code, and we might want to remove it.
9768 2. ``Fixing'' an Entity, the Simple Case:
9769 -----------------------------------------
9771 When evaluating Ada expressions, the tricky issue is that they may
9772 reference entities whose type contents and size are not statically
9773 known. Consider for instance a variant record:
9775 type Rec (Empty : Boolean := True) is record
9778 when False => Value : Integer;
9781 Yes : Rec := (Empty => False, Value => 1);
9782 No : Rec := (empty => True);
9784 The size and contents of that record depends on the value of the
9785 descriminant (Rec.Empty). At this point, neither the debugging
9786 information nor the associated type structure in GDB are able to
9787 express such dynamic types. So what the debugger does is to create
9788 "fixed" versions of the type that applies to the specific object.
9789 We also informally refer to this opperation as "fixing" an object,
9790 which means creating its associated fixed type.
9792 Example: when printing the value of variable "Yes" above, its fixed
9793 type would look like this:
9800 On the other hand, if we printed the value of "No", its fixed type
9807 Things become a little more complicated when trying to fix an entity
9808 with a dynamic type that directly contains another dynamic type,
9809 such as an array of variant records, for instance. There are
9810 two possible cases: Arrays, and records.
9812 3. ``Fixing'' Arrays:
9813 ---------------------
9815 The type structure in GDB describes an array in terms of its bounds,
9816 and the type of its elements. By design, all elements in the array
9817 have the same type and we cannot represent an array of variant elements
9818 using the current type structure in GDB. When fixing an array,
9819 we cannot fix the array element, as we would potentially need one
9820 fixed type per element of the array. As a result, the best we can do
9821 when fixing an array is to produce an array whose bounds and size
9822 are correct (allowing us to read it from memory), but without having
9823 touched its element type. Fixing each element will be done later,
9824 when (if) necessary.
9826 Arrays are a little simpler to handle than records, because the same
9827 amount of memory is allocated for each element of the array, even if
9828 the amount of space actually used by each element differs from element
9829 to element. Consider for instance the following array of type Rec:
9831 type Rec_Array is array (1 .. 2) of Rec;
9833 The actual amount of memory occupied by each element might be different
9834 from element to element, depending on the value of their discriminant.
9835 But the amount of space reserved for each element in the array remains
9836 fixed regardless. So we simply need to compute that size using
9837 the debugging information available, from which we can then determine
9838 the array size (we multiply the number of elements of the array by
9839 the size of each element).
9841 The simplest case is when we have an array of a constrained element
9842 type. For instance, consider the following type declarations:
9844 type Bounded_String (Max_Size : Integer) is
9846 Buffer : String (1 .. Max_Size);
9848 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9850 In this case, the compiler describes the array as an array of
9851 variable-size elements (identified by its XVS suffix) for which
9852 the size can be read in the parallel XVZ variable.
9854 In the case of an array of an unconstrained element type, the compiler
9855 wraps the array element inside a private PAD type. This type should not
9856 be shown to the user, and must be "unwrap"'ed before printing. Note
9857 that we also use the adjective "aligner" in our code to designate
9858 these wrapper types.
9860 In some cases, the size allocated for each element is statically
9861 known. In that case, the PAD type already has the correct size,
9862 and the array element should remain unfixed.
9864 But there are cases when this size is not statically known.
9865 For instance, assuming that "Five" is an integer variable:
9867 type Dynamic is array (1 .. Five) of Integer;
9868 type Wrapper (Has_Length : Boolean := False) is record
9871 when True => Length : Integer;
9875 type Wrapper_Array is array (1 .. 2) of Wrapper;
9877 Hello : Wrapper_Array := (others => (Has_Length => True,
9878 Data => (others => 17),
9882 The debugging info would describe variable Hello as being an
9883 array of a PAD type. The size of that PAD type is not statically
9884 known, but can be determined using a parallel XVZ variable.
9885 In that case, a copy of the PAD type with the correct size should
9886 be used for the fixed array.
9888 3. ``Fixing'' record type objects:
9889 ----------------------------------
9891 Things are slightly different from arrays in the case of dynamic
9892 record types. In this case, in order to compute the associated
9893 fixed type, we need to determine the size and offset of each of
9894 its components. This, in turn, requires us to compute the fixed
9895 type of each of these components.
9897 Consider for instance the example:
9899 type Bounded_String (Max_Size : Natural) is record
9900 Str : String (1 .. Max_Size);
9903 My_String : Bounded_String (Max_Size => 10);
9905 In that case, the position of field "Length" depends on the size
9906 of field Str, which itself depends on the value of the Max_Size
9907 discriminant. In order to fix the type of variable My_String,
9908 we need to fix the type of field Str. Therefore, fixing a variant
9909 record requires us to fix each of its components.
9911 However, if a component does not have a dynamic size, the component
9912 should not be fixed. In particular, fields that use a PAD type
9913 should not fixed. Here is an example where this might happen
9914 (assuming type Rec above):
9916 type Container (Big : Boolean) is record
9920 when True => Another : Integer;
9924 My_Container : Container := (Big => False,
9925 First => (Empty => True),
9928 In that example, the compiler creates a PAD type for component First,
9929 whose size is constant, and then positions the component After just
9930 right after it. The offset of component After is therefore constant
9933 The debugger computes the position of each field based on an algorithm
9934 that uses, among other things, the actual position and size of the field
9935 preceding it. Let's now imagine that the user is trying to print
9936 the value of My_Container. If the type fixing was recursive, we would
9937 end up computing the offset of field After based on the size of the
9938 fixed version of field First. And since in our example First has
9939 only one actual field, the size of the fixed type is actually smaller
9940 than the amount of space allocated to that field, and thus we would
9941 compute the wrong offset of field After.
9943 To make things more complicated, we need to watch out for dynamic
9944 components of variant records (identified by the ___XVL suffix in
9945 the component name). Even if the target type is a PAD type, the size
9946 of that type might not be statically known. So the PAD type needs
9947 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9948 we might end up with the wrong size for our component. This can be
9949 observed with the following type declarations:
9951 type Octal is new Integer range 0 .. 7;
9952 type Octal_Array is array (Positive range <>) of Octal;
9953 pragma Pack (Octal_Array);
9955 type Octal_Buffer (Size : Positive) is record
9956 Buffer : Octal_Array (1 .. Size);
9960 In that case, Buffer is a PAD type whose size is unset and needs
9961 to be computed by fixing the unwrapped type.
9963 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9964 ----------------------------------------------------------
9966 Lastly, when should the sub-elements of an entity that remained unfixed
9967 thus far, be actually fixed?
9969 The answer is: Only when referencing that element. For instance
9970 when selecting one component of a record, this specific component
9971 should be fixed at that point in time. Or when printing the value
9972 of a record, each component should be fixed before its value gets
9973 printed. Similarly for arrays, the element of the array should be
9974 fixed when printing each element of the array, or when extracting
9975 one element out of that array. On the other hand, fixing should
9976 not be performed on the elements when taking a slice of an array!
9978 Note that one of the side-effects of miscomputing the offset and
9979 size of each field is that we end up also miscomputing the size
9980 of the containing type. This can have adverse results when computing
9981 the value of an entity. GDB fetches the value of an entity based
9982 on the size of its type, and thus a wrong size causes GDB to fetch
9983 the wrong amount of memory. In the case where the computed size is
9984 too small, GDB fetches too little data to print the value of our
9985 entiry. Results in this case as unpredicatble, as we usually read
9986 past the buffer containing the data =:-o. */
9988 /* Implement the evaluate_exp routine in the exp_descriptor structure
9989 for the Ada language. */
9991 static struct value *
9992 ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
9993 int *pos, enum noside noside)
9999 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
10002 struct value **argvec;
10006 op = exp->elts[pc].opcode;
10012 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10014 if (noside == EVAL_NORMAL)
10015 arg1 = unwrap_value (arg1);
10017 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
10018 then we need to perform the conversion manually, because
10019 evaluate_subexp_standard doesn't do it. This conversion is
10020 necessary in Ada because the different kinds of float/fixed
10021 types in Ada have different representations.
10023 Similarly, we need to perform the conversion from OP_LONG
10025 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
10026 arg1 = ada_value_cast (expect_type, arg1, noside);
10032 struct value *result;
10035 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
10036 /* The result type will have code OP_STRING, bashed there from
10037 OP_ARRAY. Bash it back. */
10038 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
10039 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
10045 type = exp->elts[pc + 1].type;
10046 arg1 = evaluate_subexp (type, exp, pos, noside);
10047 if (noside == EVAL_SKIP)
10049 arg1 = ada_value_cast (type, arg1, noside);
10054 type = exp->elts[pc + 1].type;
10055 return ada_evaluate_subexp (type, exp, pos, noside);
10058 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10059 if (exp->elts[*pos].opcode == OP_AGGREGATE)
10061 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
10062 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10064 return ada_value_assign (arg1, arg1);
10066 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10067 except if the lhs of our assignment is a convenience variable.
10068 In the case of assigning to a convenience variable, the lhs
10069 should be exactly the result of the evaluation of the rhs. */
10070 type = value_type (arg1);
10071 if (VALUE_LVAL (arg1) == lval_internalvar)
10073 arg2 = evaluate_subexp (type, exp, pos, noside);
10074 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10076 if (ada_is_fixed_point_type (value_type (arg1)))
10077 arg2 = cast_to_fixed (value_type (arg1), arg2);
10078 else if (ada_is_fixed_point_type (value_type (arg2)))
10080 (_("Fixed-point values must be assigned to fixed-point variables"));
10082 arg2 = coerce_for_assign (value_type (arg1), arg2);
10083 return ada_value_assign (arg1, arg2);
10086 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10087 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10088 if (noside == EVAL_SKIP)
10090 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10091 return (value_from_longest
10092 (value_type (arg1),
10093 value_as_long (arg1) + value_as_long (arg2)));
10094 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10095 return (value_from_longest
10096 (value_type (arg2),
10097 value_as_long (arg1) + value_as_long (arg2)));
10098 if ((ada_is_fixed_point_type (value_type (arg1))
10099 || ada_is_fixed_point_type (value_type (arg2)))
10100 && value_type (arg1) != value_type (arg2))
10101 error (_("Operands of fixed-point addition must have the same type"));
10102 /* Do the addition, and cast the result to the type of the first
10103 argument. We cannot cast the result to a reference type, so if
10104 ARG1 is a reference type, find its underlying type. */
10105 type = value_type (arg1);
10106 while (TYPE_CODE (type) == TYPE_CODE_REF)
10107 type = TYPE_TARGET_TYPE (type);
10108 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10109 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
10112 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10113 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10114 if (noside == EVAL_SKIP)
10116 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10117 return (value_from_longest
10118 (value_type (arg1),
10119 value_as_long (arg1) - value_as_long (arg2)));
10120 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10121 return (value_from_longest
10122 (value_type (arg2),
10123 value_as_long (arg1) - value_as_long (arg2)));
10124 if ((ada_is_fixed_point_type (value_type (arg1))
10125 || ada_is_fixed_point_type (value_type (arg2)))
10126 && value_type (arg1) != value_type (arg2))
10127 error (_("Operands of fixed-point subtraction "
10128 "must have the same type"));
10129 /* Do the substraction, and cast the result to the type of the first
10130 argument. We cannot cast the result to a reference type, so if
10131 ARG1 is a reference type, find its underlying type. */
10132 type = value_type (arg1);
10133 while (TYPE_CODE (type) == TYPE_CODE_REF)
10134 type = TYPE_TARGET_TYPE (type);
10135 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10136 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
10142 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10143 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10144 if (noside == EVAL_SKIP)
10146 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10148 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10149 return value_zero (value_type (arg1), not_lval);
10153 type = builtin_type (exp->gdbarch)->builtin_double;
10154 if (ada_is_fixed_point_type (value_type (arg1)))
10155 arg1 = cast_from_fixed (type, arg1);
10156 if (ada_is_fixed_point_type (value_type (arg2)))
10157 arg2 = cast_from_fixed (type, arg2);
10158 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10159 return ada_value_binop (arg1, arg2, op);
10163 case BINOP_NOTEQUAL:
10164 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10165 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
10166 if (noside == EVAL_SKIP)
10168 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10172 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10173 tem = ada_value_equal (arg1, arg2);
10175 if (op == BINOP_NOTEQUAL)
10177 type = language_bool_type (exp->language_defn, exp->gdbarch);
10178 return value_from_longest (type, (LONGEST) tem);
10181 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10182 if (noside == EVAL_SKIP)
10184 else if (ada_is_fixed_point_type (value_type (arg1)))
10185 return value_cast (value_type (arg1), value_neg (arg1));
10188 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10189 return value_neg (arg1);
10192 case BINOP_LOGICAL_AND:
10193 case BINOP_LOGICAL_OR:
10194 case UNOP_LOGICAL_NOT:
10199 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10200 type = language_bool_type (exp->language_defn, exp->gdbarch);
10201 return value_cast (type, val);
10204 case BINOP_BITWISE_AND:
10205 case BINOP_BITWISE_IOR:
10206 case BINOP_BITWISE_XOR:
10210 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
10212 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10214 return value_cast (value_type (arg1), val);
10220 if (noside == EVAL_SKIP)
10226 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
10227 /* Only encountered when an unresolved symbol occurs in a
10228 context other than a function call, in which case, it is
10230 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10231 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
10233 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10235 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
10236 /* Check to see if this is a tagged type. We also need to handle
10237 the case where the type is a reference to a tagged type, but
10238 we have to be careful to exclude pointers to tagged types.
10239 The latter should be shown as usual (as a pointer), whereas
10240 a reference should mostly be transparent to the user. */
10241 if (ada_is_tagged_type (type, 0)
10242 || (TYPE_CODE (type) == TYPE_CODE_REF
10243 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
10245 /* Tagged types are a little special in the fact that the real
10246 type is dynamic and can only be determined by inspecting the
10247 object's tag. This means that we need to get the object's
10248 value first (EVAL_NORMAL) and then extract the actual object
10251 Note that we cannot skip the final step where we extract
10252 the object type from its tag, because the EVAL_NORMAL phase
10253 results in dynamic components being resolved into fixed ones.
10254 This can cause problems when trying to print the type
10255 description of tagged types whose parent has a dynamic size:
10256 We use the type name of the "_parent" component in order
10257 to print the name of the ancestor type in the type description.
10258 If that component had a dynamic size, the resolution into
10259 a fixed type would result in the loss of that type name,
10260 thus preventing us from printing the name of the ancestor
10261 type in the type description. */
10262 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
10264 if (TYPE_CODE (type) != TYPE_CODE_REF)
10266 struct type *actual_type;
10268 actual_type = type_from_tag (ada_value_tag (arg1));
10269 if (actual_type == NULL)
10270 /* If, for some reason, we were unable to determine
10271 the actual type from the tag, then use the static
10272 approximation that we just computed as a fallback.
10273 This can happen if the debugging information is
10274 incomplete, for instance. */
10275 actual_type = type;
10276 return value_zero (actual_type, not_lval);
10280 /* In the case of a ref, ada_coerce_ref takes care
10281 of determining the actual type. But the evaluation
10282 should return a ref as it should be valid to ask
10283 for its address; so rebuild a ref after coerce. */
10284 arg1 = ada_coerce_ref (arg1);
10285 return value_ref (arg1);
10289 /* Records and unions for which GNAT encodings have been
10290 generated need to be statically fixed as well.
10291 Otherwise, non-static fixing produces a type where
10292 all dynamic properties are removed, which prevents "ptype"
10293 from being able to completely describe the type.
10294 For instance, a case statement in a variant record would be
10295 replaced by the relevant components based on the actual
10296 value of the discriminants. */
10297 if ((TYPE_CODE (type) == TYPE_CODE_STRUCT
10298 && dynamic_template_type (type) != NULL)
10299 || (TYPE_CODE (type) == TYPE_CODE_UNION
10300 && ada_find_parallel_type (type, "___XVU") != NULL))
10303 return value_zero (to_static_fixed_type (type), not_lval);
10307 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10308 return ada_to_fixed_value (arg1);
10313 /* Allocate arg vector, including space for the function to be
10314 called in argvec[0] and a terminating NULL. */
10315 nargs = longest_to_int (exp->elts[pc + 1].longconst);
10317 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
10319 if (exp->elts[*pos].opcode == OP_VAR_VALUE
10320 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
10321 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10322 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
10325 for (tem = 0; tem <= nargs; tem += 1)
10326 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10329 if (noside == EVAL_SKIP)
10333 if (ada_is_constrained_packed_array_type
10334 (desc_base_type (value_type (argvec[0]))))
10335 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
10336 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10337 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
10338 /* This is a packed array that has already been fixed, and
10339 therefore already coerced to a simple array. Nothing further
10342 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
10343 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10344 && VALUE_LVAL (argvec[0]) == lval_memory))
10345 argvec[0] = value_addr (argvec[0]);
10347 type = ada_check_typedef (value_type (argvec[0]));
10349 /* Ada allows us to implicitly dereference arrays when subscripting
10350 them. So, if this is an array typedef (encoding use for array
10351 access types encoded as fat pointers), strip it now. */
10352 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
10353 type = ada_typedef_target_type (type);
10355 if (TYPE_CODE (type) == TYPE_CODE_PTR)
10357 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
10359 case TYPE_CODE_FUNC:
10360 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10362 case TYPE_CODE_ARRAY:
10364 case TYPE_CODE_STRUCT:
10365 if (noside != EVAL_AVOID_SIDE_EFFECTS)
10366 argvec[0] = ada_value_ind (argvec[0]);
10367 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
10370 error (_("cannot subscript or call something of type `%s'"),
10371 ada_type_name (value_type (argvec[0])));
10376 switch (TYPE_CODE (type))
10378 case TYPE_CODE_FUNC:
10379 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10381 struct type *rtype = TYPE_TARGET_TYPE (type);
10383 if (TYPE_GNU_IFUNC (type))
10384 return allocate_value (TYPE_TARGET_TYPE (rtype));
10385 return allocate_value (rtype);
10387 return call_function_by_hand (argvec[0], nargs, argvec + 1);
10388 case TYPE_CODE_INTERNAL_FUNCTION:
10389 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10390 /* We don't know anything about what the internal
10391 function might return, but we have to return
10393 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10396 return call_internal_function (exp->gdbarch, exp->language_defn,
10397 argvec[0], nargs, argvec + 1);
10399 case TYPE_CODE_STRUCT:
10403 arity = ada_array_arity (type);
10404 type = ada_array_element_type (type, nargs);
10406 error (_("cannot subscript or call a record"));
10407 if (arity != nargs)
10408 error (_("wrong number of subscripts; expecting %d"), arity);
10409 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10410 return value_zero (ada_aligned_type (type), lval_memory);
10412 unwrap_value (ada_value_subscript
10413 (argvec[0], nargs, argvec + 1));
10415 case TYPE_CODE_ARRAY:
10416 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10418 type = ada_array_element_type (type, nargs);
10420 error (_("element type of array unknown"));
10422 return value_zero (ada_aligned_type (type), lval_memory);
10425 unwrap_value (ada_value_subscript
10426 (ada_coerce_to_simple_array (argvec[0]),
10427 nargs, argvec + 1));
10428 case TYPE_CODE_PTR: /* Pointer to array */
10429 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10431 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
10432 type = ada_array_element_type (type, nargs);
10434 error (_("element type of array unknown"));
10436 return value_zero (ada_aligned_type (type), lval_memory);
10439 unwrap_value (ada_value_ptr_subscript (argvec[0],
10440 nargs, argvec + 1));
10443 error (_("Attempt to index or call something other than an "
10444 "array or function"));
10449 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10450 struct value *low_bound_val =
10451 evaluate_subexp (NULL_TYPE, exp, pos, noside);
10452 struct value *high_bound_val =
10453 evaluate_subexp (NULL_TYPE, exp, pos, noside);
10455 LONGEST high_bound;
10457 low_bound_val = coerce_ref (low_bound_val);
10458 high_bound_val = coerce_ref (high_bound_val);
10459 low_bound = pos_atr (low_bound_val);
10460 high_bound = pos_atr (high_bound_val);
10462 if (noside == EVAL_SKIP)
10465 /* If this is a reference to an aligner type, then remove all
10467 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
10468 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
10469 TYPE_TARGET_TYPE (value_type (array)) =
10470 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
10472 if (ada_is_constrained_packed_array_type (value_type (array)))
10473 error (_("cannot slice a packed array"));
10475 /* If this is a reference to an array or an array lvalue,
10476 convert to a pointer. */
10477 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
10478 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
10479 && VALUE_LVAL (array) == lval_memory))
10480 array = value_addr (array);
10482 if (noside == EVAL_AVOID_SIDE_EFFECTS
10483 && ada_is_array_descriptor_type (ada_check_typedef
10484 (value_type (array))))
10485 return empty_array (ada_type_of_array (array, 0), low_bound);
10487 array = ada_coerce_to_simple_array_ptr (array);
10489 /* If we have more than one level of pointer indirection,
10490 dereference the value until we get only one level. */
10491 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
10492 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
10494 array = value_ind (array);
10496 /* Make sure we really do have an array type before going further,
10497 to avoid a SEGV when trying to get the index type or the target
10498 type later down the road if the debug info generated by
10499 the compiler is incorrect or incomplete. */
10500 if (!ada_is_simple_array_type (value_type (array)))
10501 error (_("cannot take slice of non-array"));
10503 if (TYPE_CODE (ada_check_typedef (value_type (array)))
10506 struct type *type0 = ada_check_typedef (value_type (array));
10508 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
10509 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
10512 struct type *arr_type0 =
10513 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
10515 return ada_value_slice_from_ptr (array, arr_type0,
10516 longest_to_int (low_bound),
10517 longest_to_int (high_bound));
10520 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10522 else if (high_bound < low_bound)
10523 return empty_array (value_type (array), low_bound);
10525 return ada_value_slice (array, longest_to_int (low_bound),
10526 longest_to_int (high_bound));
10529 case UNOP_IN_RANGE:
10531 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10532 type = check_typedef (exp->elts[pc + 1].type);
10534 if (noside == EVAL_SKIP)
10537 switch (TYPE_CODE (type))
10540 lim_warning (_("Membership test incompletely implemented; "
10541 "always returns true"));
10542 type = language_bool_type (exp->language_defn, exp->gdbarch);
10543 return value_from_longest (type, (LONGEST) 1);
10545 case TYPE_CODE_RANGE:
10546 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
10547 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
10548 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10549 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10550 type = language_bool_type (exp->language_defn, exp->gdbarch);
10552 value_from_longest (type,
10553 (value_less (arg1, arg3)
10554 || value_equal (arg1, arg3))
10555 && (value_less (arg2, arg1)
10556 || value_equal (arg2, arg1)));
10559 case BINOP_IN_BOUNDS:
10561 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10562 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10564 if (noside == EVAL_SKIP)
10567 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10569 type = language_bool_type (exp->language_defn, exp->gdbarch);
10570 return value_zero (type, not_lval);
10573 tem = longest_to_int (exp->elts[pc + 1].longconst);
10575 type = ada_index_type (value_type (arg2), tem, "range");
10577 type = value_type (arg1);
10579 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
10580 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
10582 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10583 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10584 type = language_bool_type (exp->language_defn, exp->gdbarch);
10586 value_from_longest (type,
10587 (value_less (arg1, arg3)
10588 || value_equal (arg1, arg3))
10589 && (value_less (arg2, arg1)
10590 || value_equal (arg2, arg1)));
10592 case TERNOP_IN_RANGE:
10593 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10594 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10595 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10597 if (noside == EVAL_SKIP)
10600 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10601 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
10602 type = language_bool_type (exp->language_defn, exp->gdbarch);
10604 value_from_longest (type,
10605 (value_less (arg1, arg3)
10606 || value_equal (arg1, arg3))
10607 && (value_less (arg2, arg1)
10608 || value_equal (arg2, arg1)));
10612 case OP_ATR_LENGTH:
10614 struct type *type_arg;
10616 if (exp->elts[*pos].opcode == OP_TYPE)
10618 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10620 type_arg = check_typedef (exp->elts[pc + 2].type);
10624 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10628 if (exp->elts[*pos].opcode != OP_LONG)
10629 error (_("Invalid operand to '%s"), ada_attribute_name (op));
10630 tem = longest_to_int (exp->elts[*pos + 2].longconst);
10633 if (noside == EVAL_SKIP)
10636 if (type_arg == NULL)
10638 arg1 = ada_coerce_ref (arg1);
10640 if (ada_is_constrained_packed_array_type (value_type (arg1)))
10641 arg1 = ada_coerce_to_simple_array (arg1);
10643 if (op == OP_ATR_LENGTH)
10644 type = builtin_type (exp->gdbarch)->builtin_int;
10647 type = ada_index_type (value_type (arg1), tem,
10648 ada_attribute_name (op));
10650 type = builtin_type (exp->gdbarch)->builtin_int;
10653 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10654 return allocate_value (type);
10658 default: /* Should never happen. */
10659 error (_("unexpected attribute encountered"));
10661 return value_from_longest
10662 (type, ada_array_bound (arg1, tem, 0));
10664 return value_from_longest
10665 (type, ada_array_bound (arg1, tem, 1));
10666 case OP_ATR_LENGTH:
10667 return value_from_longest
10668 (type, ada_array_length (arg1, tem));
10671 else if (discrete_type_p (type_arg))
10673 struct type *range_type;
10674 const char *name = ada_type_name (type_arg);
10677 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
10678 range_type = to_fixed_range_type (type_arg, NULL);
10679 if (range_type == NULL)
10680 range_type = type_arg;
10684 error (_("unexpected attribute encountered"));
10686 return value_from_longest
10687 (range_type, ada_discrete_type_low_bound (range_type));
10689 return value_from_longest
10690 (range_type, ada_discrete_type_high_bound (range_type));
10691 case OP_ATR_LENGTH:
10692 error (_("the 'length attribute applies only to array types"));
10695 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
10696 error (_("unimplemented type attribute"));
10701 if (ada_is_constrained_packed_array_type (type_arg))
10702 type_arg = decode_constrained_packed_array_type (type_arg);
10704 if (op == OP_ATR_LENGTH)
10705 type = builtin_type (exp->gdbarch)->builtin_int;
10708 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
10710 type = builtin_type (exp->gdbarch)->builtin_int;
10713 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10714 return allocate_value (type);
10719 error (_("unexpected attribute encountered"));
10721 low = ada_array_bound_from_type (type_arg, tem, 0);
10722 return value_from_longest (type, low);
10724 high = ada_array_bound_from_type (type_arg, tem, 1);
10725 return value_from_longest (type, high);
10726 case OP_ATR_LENGTH:
10727 low = ada_array_bound_from_type (type_arg, tem, 0);
10728 high = ada_array_bound_from_type (type_arg, tem, 1);
10729 return value_from_longest (type, high - low + 1);
10735 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10736 if (noside == EVAL_SKIP)
10739 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10740 return value_zero (ada_tag_type (arg1), not_lval);
10742 return ada_value_tag (arg1);
10746 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10747 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10748 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10749 if (noside == EVAL_SKIP)
10751 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10752 return value_zero (value_type (arg1), not_lval);
10755 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10756 return value_binop (arg1, arg2,
10757 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
10760 case OP_ATR_MODULUS:
10762 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
10764 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10765 if (noside == EVAL_SKIP)
10768 if (!ada_is_modular_type (type_arg))
10769 error (_("'modulus must be applied to modular type"));
10771 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
10772 ada_modulus (type_arg));
10777 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10778 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10779 if (noside == EVAL_SKIP)
10781 type = builtin_type (exp->gdbarch)->builtin_int;
10782 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10783 return value_zero (type, not_lval);
10785 return value_pos_atr (type, arg1);
10788 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10789 type = value_type (arg1);
10791 /* If the argument is a reference, then dereference its type, since
10792 the user is really asking for the size of the actual object,
10793 not the size of the pointer. */
10794 if (TYPE_CODE (type) == TYPE_CODE_REF)
10795 type = TYPE_TARGET_TYPE (type);
10797 if (noside == EVAL_SKIP)
10799 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10800 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
10802 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
10803 TARGET_CHAR_BIT * TYPE_LENGTH (type));
10806 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10807 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10808 type = exp->elts[pc + 2].type;
10809 if (noside == EVAL_SKIP)
10811 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10812 return value_zero (type, not_lval);
10814 return value_val_atr (type, arg1);
10817 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10818 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10819 if (noside == EVAL_SKIP)
10821 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10822 return value_zero (value_type (arg1), not_lval);
10825 /* For integer exponentiation operations,
10826 only promote the first argument. */
10827 if (is_integral_type (value_type (arg2)))
10828 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10830 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10832 return value_binop (arg1, arg2, op);
10836 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10837 if (noside == EVAL_SKIP)
10843 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10844 if (noside == EVAL_SKIP)
10846 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10847 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
10848 return value_neg (arg1);
10853 preeval_pos = *pos;
10854 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10855 if (noside == EVAL_SKIP)
10857 type = ada_check_typedef (value_type (arg1));
10858 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10860 if (ada_is_array_descriptor_type (type))
10861 /* GDB allows dereferencing GNAT array descriptors. */
10863 struct type *arrType = ada_type_of_array (arg1, 0);
10865 if (arrType == NULL)
10866 error (_("Attempt to dereference null array pointer."));
10867 return value_at_lazy (arrType, 0);
10869 else if (TYPE_CODE (type) == TYPE_CODE_PTR
10870 || TYPE_CODE (type) == TYPE_CODE_REF
10871 /* In C you can dereference an array to get the 1st elt. */
10872 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
10874 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10875 only be determined by inspecting the object's tag.
10876 This means that we need to evaluate completely the
10877 expression in order to get its type. */
10879 if ((TYPE_CODE (type) == TYPE_CODE_REF
10880 || TYPE_CODE (type) == TYPE_CODE_PTR)
10881 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))
10883 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
10885 type = value_type (ada_value_ind (arg1));
10889 type = to_static_fixed_type
10891 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
10894 return value_zero (type, lval_memory);
10896 else if (TYPE_CODE (type) == TYPE_CODE_INT)
10898 /* GDB allows dereferencing an int. */
10899 if (expect_type == NULL)
10900 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10905 to_static_fixed_type (ada_aligned_type (expect_type));
10906 return value_zero (expect_type, lval_memory);
10910 error (_("Attempt to take contents of a non-pointer value."));
10912 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
10913 type = ada_check_typedef (value_type (arg1));
10915 if (TYPE_CODE (type) == TYPE_CODE_INT)
10916 /* GDB allows dereferencing an int. If we were given
10917 the expect_type, then use that as the target type.
10918 Otherwise, assume that the target type is an int. */
10920 if (expect_type != NULL)
10921 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
10924 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
10925 (CORE_ADDR) value_as_address (arg1));
10928 if (ada_is_array_descriptor_type (type))
10929 /* GDB allows dereferencing GNAT array descriptors. */
10930 return ada_coerce_to_simple_array (arg1);
10932 return ada_value_ind (arg1);
10934 case STRUCTOP_STRUCT:
10935 tem = longest_to_int (exp->elts[pc + 1].longconst);
10936 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
10937 preeval_pos = *pos;
10938 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10939 if (noside == EVAL_SKIP)
10941 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10943 struct type *type1 = value_type (arg1);
10945 if (ada_is_tagged_type (type1, 1))
10947 type = ada_lookup_struct_elt_type (type1,
10948 &exp->elts[pc + 2].string,
10951 /* If the field is not found, check if it exists in the
10952 extension of this object's type. This means that we
10953 need to evaluate completely the expression. */
10957 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
10959 arg1 = ada_value_struct_elt (arg1,
10960 &exp->elts[pc + 2].string,
10962 arg1 = unwrap_value (arg1);
10963 type = value_type (ada_to_fixed_value (arg1));
10968 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
10971 return value_zero (ada_aligned_type (type), lval_memory);
10974 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
10975 arg1 = unwrap_value (arg1);
10976 return ada_to_fixed_value (arg1);
10979 /* The value is not supposed to be used. This is here to make it
10980 easier to accommodate expressions that contain types. */
10982 if (noside == EVAL_SKIP)
10984 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
10985 return allocate_value (exp->elts[pc + 1].type);
10987 error (_("Attempt to use a type name as an expression"));
10992 case OP_DISCRETE_RANGE:
10993 case OP_POSITIONAL:
10995 if (noside == EVAL_NORMAL)
10999 error (_("Undefined name, ambiguous name, or renaming used in "
11000 "component association: %s."), &exp->elts[pc+2].string);
11002 error (_("Aggregates only allowed on the right of an assignment"));
11004 internal_error (__FILE__, __LINE__,
11005 _("aggregate apparently mangled"));
11008 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11010 for (tem = 0; tem < nargs; tem += 1)
11011 ada_evaluate_subexp (NULL, exp, pos, noside);
11016 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
11022 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11023 type name that encodes the 'small and 'delta information.
11024 Otherwise, return NULL. */
11026 static const char *
11027 fixed_type_info (struct type *type)
11029 const char *name = ada_type_name (type);
11030 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
11032 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
11034 const char *tail = strstr (name, "___XF_");
11041 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
11042 return fixed_type_info (TYPE_TARGET_TYPE (type));
11047 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11050 ada_is_fixed_point_type (struct type *type)
11052 return fixed_type_info (type) != NULL;
11055 /* Return non-zero iff TYPE represents a System.Address type. */
11058 ada_is_system_address_type (struct type *type)
11060 return (TYPE_NAME (type)
11061 && strcmp (TYPE_NAME (type), "system__address") == 0);
11064 /* Assuming that TYPE is the representation of an Ada fixed-point
11065 type, return its delta, or -1 if the type is malformed and the
11066 delta cannot be determined. */
11069 ada_delta (struct type *type)
11071 const char *encoding = fixed_type_info (type);
11074 /* Strictly speaking, num and den are encoded as integer. However,
11075 they may not fit into a long, and they will have to be converted
11076 to DOUBLEST anyway. So scan them as DOUBLEST. */
11077 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
11084 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
11085 factor ('SMALL value) associated with the type. */
11088 scaling_factor (struct type *type)
11090 const char *encoding = fixed_type_info (type);
11091 DOUBLEST num0, den0, num1, den1;
11094 /* Strictly speaking, num's and den's are encoded as integer. However,
11095 they may not fit into a long, and they will have to be converted
11096 to DOUBLEST anyway. So scan them as DOUBLEST. */
11097 n = sscanf (encoding,
11098 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
11099 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
11100 &num0, &den0, &num1, &den1);
11105 return num1 / den1;
11107 return num0 / den0;
11111 /* Assuming that X is the representation of a value of fixed-point
11112 type TYPE, return its floating-point equivalent. */
11115 ada_fixed_to_float (struct type *type, LONGEST x)
11117 return (DOUBLEST) x *scaling_factor (type);
11120 /* The representation of a fixed-point value of type TYPE
11121 corresponding to the value X. */
11124 ada_float_to_fixed (struct type *type, DOUBLEST x)
11126 return (LONGEST) (x / scaling_factor (type) + 0.5);
11133 /* Scan STR beginning at position K for a discriminant name, and
11134 return the value of that discriminant field of DVAL in *PX. If
11135 PNEW_K is not null, put the position of the character beyond the
11136 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11137 not alter *PX and *PNEW_K if unsuccessful. */
11140 scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
11143 static char *bound_buffer = NULL;
11144 static size_t bound_buffer_len = 0;
11147 struct value *bound_val;
11149 if (dval == NULL || str == NULL || str[k] == '\0')
11152 pend = strstr (str + k, "__");
11156 k += strlen (bound);
11160 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
11161 bound = bound_buffer;
11162 strncpy (bound_buffer, str + k, pend - (str + k));
11163 bound[pend - (str + k)] = '\0';
11167 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
11168 if (bound_val == NULL)
11171 *px = value_as_long (bound_val);
11172 if (pnew_k != NULL)
11177 /* Value of variable named NAME in the current environment. If
11178 no such variable found, then if ERR_MSG is null, returns 0, and
11179 otherwise causes an error with message ERR_MSG. */
11181 static struct value *
11182 get_var_value (char *name, char *err_msg)
11184 struct ada_symbol_info *syms;
11187 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
11192 if (err_msg == NULL)
11195 error (("%s"), err_msg);
11198 return value_of_variable (syms[0].sym, syms[0].block);
11201 /* Value of integer variable named NAME in the current environment. If
11202 no such variable found, returns 0, and sets *FLAG to 0. If
11203 successful, sets *FLAG to 1. */
11206 get_int_var_value (char *name, int *flag)
11208 struct value *var_val = get_var_value (name, 0);
11220 return value_as_long (var_val);
11225 /* Return a range type whose base type is that of the range type named
11226 NAME in the current environment, and whose bounds are calculated
11227 from NAME according to the GNAT range encoding conventions.
11228 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11229 corresponding range type from debug information; fall back to using it
11230 if symbol lookup fails. If a new type must be created, allocate it
11231 like ORIG_TYPE was. The bounds information, in general, is encoded
11232 in NAME, the base type given in the named range type. */
11234 static struct type *
11235 to_fixed_range_type (struct type *raw_type, struct value *dval)
11238 struct type *base_type;
11239 char *subtype_info;
11241 gdb_assert (raw_type != NULL);
11242 gdb_assert (TYPE_NAME (raw_type) != NULL);
11244 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
11245 base_type = TYPE_TARGET_TYPE (raw_type);
11247 base_type = raw_type;
11249 name = TYPE_NAME (raw_type);
11250 subtype_info = strstr (name, "___XD");
11251 if (subtype_info == NULL)
11253 LONGEST L = ada_discrete_type_low_bound (raw_type);
11254 LONGEST U = ada_discrete_type_high_bound (raw_type);
11256 if (L < INT_MIN || U > INT_MAX)
11259 return create_static_range_type (alloc_type_copy (raw_type), raw_type,
11264 static char *name_buf = NULL;
11265 static size_t name_len = 0;
11266 int prefix_len = subtype_info - name;
11272 GROW_VECT (name_buf, name_len, prefix_len + 5);
11273 strncpy (name_buf, name, prefix_len);
11274 name_buf[prefix_len] = '\0';
11277 bounds_str = strchr (subtype_info, '_');
11280 if (*subtype_info == 'L')
11282 if (!ada_scan_number (bounds_str, n, &L, &n)
11283 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
11285 if (bounds_str[n] == '_')
11287 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
11295 strcpy (name_buf + prefix_len, "___L");
11296 L = get_int_var_value (name_buf, &ok);
11299 lim_warning (_("Unknown lower bound, using 1."));
11304 if (*subtype_info == 'U')
11306 if (!ada_scan_number (bounds_str, n, &U, &n)
11307 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
11314 strcpy (name_buf + prefix_len, "___U");
11315 U = get_int_var_value (name_buf, &ok);
11318 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
11323 type = create_static_range_type (alloc_type_copy (raw_type),
11325 TYPE_NAME (type) = name;
11330 /* True iff NAME is the name of a range type. */
11333 ada_is_range_type_name (const char *name)
11335 return (name != NULL && strstr (name, "___XD"));
11339 /* Modular types */
11341 /* True iff TYPE is an Ada modular type. */
11344 ada_is_modular_type (struct type *type)
11346 struct type *subranged_type = get_base_type (type);
11348 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
11349 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
11350 && TYPE_UNSIGNED (subranged_type));
11353 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11356 ada_modulus (struct type *type)
11358 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
11362 /* Ada exception catchpoint support:
11363 ---------------------------------
11365 We support 3 kinds of exception catchpoints:
11366 . catchpoints on Ada exceptions
11367 . catchpoints on unhandled Ada exceptions
11368 . catchpoints on failed assertions
11370 Exceptions raised during failed assertions, or unhandled exceptions
11371 could perfectly be caught with the general catchpoint on Ada exceptions.
11372 However, we can easily differentiate these two special cases, and having
11373 the option to distinguish these two cases from the rest can be useful
11374 to zero-in on certain situations.
11376 Exception catchpoints are a specialized form of breakpoint,
11377 since they rely on inserting breakpoints inside known routines
11378 of the GNAT runtime. The implementation therefore uses a standard
11379 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11382 Support in the runtime for exception catchpoints have been changed
11383 a few times already, and these changes affect the implementation
11384 of these catchpoints. In order to be able to support several
11385 variants of the runtime, we use a sniffer that will determine
11386 the runtime variant used by the program being debugged. */
11388 /* Ada's standard exceptions.
11390 The Ada 83 standard also defined Numeric_Error. But there so many
11391 situations where it was unclear from the Ada 83 Reference Manual
11392 (RM) whether Constraint_Error or Numeric_Error should be raised,
11393 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11394 Interpretation saying that anytime the RM says that Numeric_Error
11395 should be raised, the implementation may raise Constraint_Error.
11396 Ada 95 went one step further and pretty much removed Numeric_Error
11397 from the list of standard exceptions (it made it a renaming of
11398 Constraint_Error, to help preserve compatibility when compiling
11399 an Ada83 compiler). As such, we do not include Numeric_Error from
11400 this list of standard exceptions. */
11402 static char *standard_exc[] = {
11403 "constraint_error",
11409 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
11411 /* A structure that describes how to support exception catchpoints
11412 for a given executable. */
11414 struct exception_support_info
11416 /* The name of the symbol to break on in order to insert
11417 a catchpoint on exceptions. */
11418 const char *catch_exception_sym;
11420 /* The name of the symbol to break on in order to insert
11421 a catchpoint on unhandled exceptions. */
11422 const char *catch_exception_unhandled_sym;
11424 /* The name of the symbol to break on in order to insert
11425 a catchpoint on failed assertions. */
11426 const char *catch_assert_sym;
11428 /* Assuming that the inferior just triggered an unhandled exception
11429 catchpoint, this function is responsible for returning the address
11430 in inferior memory where the name of that exception is stored.
11431 Return zero if the address could not be computed. */
11432 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
11435 static CORE_ADDR ada_unhandled_exception_name_addr (void);
11436 static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
11438 /* The following exception support info structure describes how to
11439 implement exception catchpoints with the latest version of the
11440 Ada runtime (as of 2007-03-06). */
11442 static const struct exception_support_info default_exception_support_info =
11444 "__gnat_debug_raise_exception", /* catch_exception_sym */
11445 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11446 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11447 ada_unhandled_exception_name_addr
11450 /* The following exception support info structure describes how to
11451 implement exception catchpoints with a slightly older version
11452 of the Ada runtime. */
11454 static const struct exception_support_info exception_support_info_fallback =
11456 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11457 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11458 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11459 ada_unhandled_exception_name_addr_from_raise
11462 /* Return nonzero if we can detect the exception support routines
11463 described in EINFO.
11465 This function errors out if an abnormal situation is detected
11466 (for instance, if we find the exception support routines, but
11467 that support is found to be incomplete). */
11470 ada_has_this_exception_support (const struct exception_support_info *einfo)
11472 struct symbol *sym;
11474 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11475 that should be compiled with debugging information. As a result, we
11476 expect to find that symbol in the symtabs. */
11478 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
11481 /* Perhaps we did not find our symbol because the Ada runtime was
11482 compiled without debugging info, or simply stripped of it.
11483 It happens on some GNU/Linux distributions for instance, where
11484 users have to install a separate debug package in order to get
11485 the runtime's debugging info. In that situation, let the user
11486 know why we cannot insert an Ada exception catchpoint.
11488 Note: Just for the purpose of inserting our Ada exception
11489 catchpoint, we could rely purely on the associated minimal symbol.
11490 But we would be operating in degraded mode anyway, since we are
11491 still lacking the debugging info needed later on to extract
11492 the name of the exception being raised (this name is printed in
11493 the catchpoint message, and is also used when trying to catch
11494 a specific exception). We do not handle this case for now. */
11495 struct bound_minimal_symbol msym
11496 = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL);
11498 if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline)
11499 error (_("Your Ada runtime appears to be missing some debugging "
11500 "information.\nCannot insert Ada exception catchpoint "
11501 "in this configuration."));
11506 /* Make sure that the symbol we found corresponds to a function. */
11508 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
11509 error (_("Symbol \"%s\" is not a function (class = %d)"),
11510 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
11515 /* Inspect the Ada runtime and determine which exception info structure
11516 should be used to provide support for exception catchpoints.
11518 This function will always set the per-inferior exception_info,
11519 or raise an error. */
11522 ada_exception_support_info_sniffer (void)
11524 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11526 /* If the exception info is already known, then no need to recompute it. */
11527 if (data->exception_info != NULL)
11530 /* Check the latest (default) exception support info. */
11531 if (ada_has_this_exception_support (&default_exception_support_info))
11533 data->exception_info = &default_exception_support_info;
11537 /* Try our fallback exception suport info. */
11538 if (ada_has_this_exception_support (&exception_support_info_fallback))
11540 data->exception_info = &exception_support_info_fallback;
11544 /* Sometimes, it is normal for us to not be able to find the routine
11545 we are looking for. This happens when the program is linked with
11546 the shared version of the GNAT runtime, and the program has not been
11547 started yet. Inform the user of these two possible causes if
11550 if (ada_update_initial_language (language_unknown) != language_ada)
11551 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11553 /* If the symbol does not exist, then check that the program is
11554 already started, to make sure that shared libraries have been
11555 loaded. If it is not started, this may mean that the symbol is
11556 in a shared library. */
11558 if (ptid_get_pid (inferior_ptid) == 0)
11559 error (_("Unable to insert catchpoint. Try to start the program first."));
11561 /* At this point, we know that we are debugging an Ada program and
11562 that the inferior has been started, but we still are not able to
11563 find the run-time symbols. That can mean that we are in
11564 configurable run time mode, or that a-except as been optimized
11565 out by the linker... In any case, at this point it is not worth
11566 supporting this feature. */
11568 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11571 /* True iff FRAME is very likely to be that of a function that is
11572 part of the runtime system. This is all very heuristic, but is
11573 intended to be used as advice as to what frames are uninteresting
11577 is_known_support_routine (struct frame_info *frame)
11579 struct symtab_and_line sal;
11581 enum language func_lang;
11583 const char *fullname;
11585 /* If this code does not have any debugging information (no symtab),
11586 This cannot be any user code. */
11588 find_frame_sal (frame, &sal);
11589 if (sal.symtab == NULL)
11592 /* If there is a symtab, but the associated source file cannot be
11593 located, then assume this is not user code: Selecting a frame
11594 for which we cannot display the code would not be very helpful
11595 for the user. This should also take care of case such as VxWorks
11596 where the kernel has some debugging info provided for a few units. */
11598 fullname = symtab_to_fullname (sal.symtab);
11599 if (access (fullname, R_OK) != 0)
11602 /* Check the unit filename againt the Ada runtime file naming.
11603 We also check the name of the objfile against the name of some
11604 known system libraries that sometimes come with debugging info
11607 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
11609 re_comp (known_runtime_file_name_patterns[i]);
11610 if (re_exec (lbasename (sal.symtab->filename)))
11612 if (SYMTAB_OBJFILE (sal.symtab) != NULL
11613 && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab))))
11617 /* Check whether the function is a GNAT-generated entity. */
11619 find_frame_funname (frame, &func_name, &func_lang, NULL);
11620 if (func_name == NULL)
11623 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
11625 re_comp (known_auxiliary_function_name_patterns[i]);
11626 if (re_exec (func_name))
11637 /* Find the first frame that contains debugging information and that is not
11638 part of the Ada run-time, starting from FI and moving upward. */
11641 ada_find_printable_frame (struct frame_info *fi)
11643 for (; fi != NULL; fi = get_prev_frame (fi))
11645 if (!is_known_support_routine (fi))
11654 /* Assuming that the inferior just triggered an unhandled exception
11655 catchpoint, return the address in inferior memory where the name
11656 of the exception is stored.
11658 Return zero if the address could not be computed. */
11661 ada_unhandled_exception_name_addr (void)
11663 return parse_and_eval_address ("e.full_name");
11666 /* Same as ada_unhandled_exception_name_addr, except that this function
11667 should be used when the inferior uses an older version of the runtime,
11668 where the exception name needs to be extracted from a specific frame
11669 several frames up in the callstack. */
11672 ada_unhandled_exception_name_addr_from_raise (void)
11675 struct frame_info *fi;
11676 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11677 struct cleanup *old_chain;
11679 /* To determine the name of this exception, we need to select
11680 the frame corresponding to RAISE_SYM_NAME. This frame is
11681 at least 3 levels up, so we simply skip the first 3 frames
11682 without checking the name of their associated function. */
11683 fi = get_current_frame ();
11684 for (frame_level = 0; frame_level < 3; frame_level += 1)
11686 fi = get_prev_frame (fi);
11688 old_chain = make_cleanup (null_cleanup, NULL);
11692 enum language func_lang;
11694 find_frame_funname (fi, &func_name, &func_lang, NULL);
11695 if (func_name != NULL)
11697 make_cleanup (xfree, func_name);
11699 if (strcmp (func_name,
11700 data->exception_info->catch_exception_sym) == 0)
11701 break; /* We found the frame we were looking for... */
11702 fi = get_prev_frame (fi);
11705 do_cleanups (old_chain);
11711 return parse_and_eval_address ("id.full_name");
11714 /* Assuming the inferior just triggered an Ada exception catchpoint
11715 (of any type), return the address in inferior memory where the name
11716 of the exception is stored, if applicable.
11718 Return zero if the address could not be computed, or if not relevant. */
11721 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex,
11722 struct breakpoint *b)
11724 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11728 case ada_catch_exception:
11729 return (parse_and_eval_address ("e.full_name"));
11732 case ada_catch_exception_unhandled:
11733 return data->exception_info->unhandled_exception_name_addr ();
11736 case ada_catch_assert:
11737 return 0; /* Exception name is not relevant in this case. */
11741 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11745 return 0; /* Should never be reached. */
11748 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11749 any error that ada_exception_name_addr_1 might cause to be thrown.
11750 When an error is intercepted, a warning with the error message is printed,
11751 and zero is returned. */
11754 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex,
11755 struct breakpoint *b)
11757 volatile struct gdb_exception e;
11758 CORE_ADDR result = 0;
11760 TRY_CATCH (e, RETURN_MASK_ERROR)
11762 result = ada_exception_name_addr_1 (ex, b);
11767 warning (_("failed to get exception name: %s"), e.message);
11774 static char *ada_exception_catchpoint_cond_string (const char *excep_string);
11776 /* Ada catchpoints.
11778 In the case of catchpoints on Ada exceptions, the catchpoint will
11779 stop the target on every exception the program throws. When a user
11780 specifies the name of a specific exception, we translate this
11781 request into a condition expression (in text form), and then parse
11782 it into an expression stored in each of the catchpoint's locations.
11783 We then use this condition to check whether the exception that was
11784 raised is the one the user is interested in. If not, then the
11785 target is resumed again. We store the name of the requested
11786 exception, in order to be able to re-set the condition expression
11787 when symbols change. */
11789 /* An instance of this type is used to represent an Ada catchpoint
11790 breakpoint location. It includes a "struct bp_location" as a kind
11791 of base class; users downcast to "struct bp_location *" when
11794 struct ada_catchpoint_location
11796 /* The base class. */
11797 struct bp_location base;
11799 /* The condition that checks whether the exception that was raised
11800 is the specific exception the user specified on catchpoint
11802 struct expression *excep_cond_expr;
11805 /* Implement the DTOR method in the bp_location_ops structure for all
11806 Ada exception catchpoint kinds. */
11809 ada_catchpoint_location_dtor (struct bp_location *bl)
11811 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
11813 xfree (al->excep_cond_expr);
11816 /* The vtable to be used in Ada catchpoint locations. */
11818 static const struct bp_location_ops ada_catchpoint_location_ops =
11820 ada_catchpoint_location_dtor
11823 /* An instance of this type is used to represent an Ada catchpoint.
11824 It includes a "struct breakpoint" as a kind of base class; users
11825 downcast to "struct breakpoint *" when needed. */
11827 struct ada_catchpoint
11829 /* The base class. */
11830 struct breakpoint base;
11832 /* The name of the specific exception the user specified. */
11833 char *excep_string;
11836 /* Parse the exception condition string in the context of each of the
11837 catchpoint's locations, and store them for later evaluation. */
11840 create_excep_cond_exprs (struct ada_catchpoint *c)
11842 struct cleanup *old_chain;
11843 struct bp_location *bl;
11846 /* Nothing to do if there's no specific exception to catch. */
11847 if (c->excep_string == NULL)
11850 /* Same if there are no locations... */
11851 if (c->base.loc == NULL)
11854 /* Compute the condition expression in text form, from the specific
11855 expection we want to catch. */
11856 cond_string = ada_exception_catchpoint_cond_string (c->excep_string);
11857 old_chain = make_cleanup (xfree, cond_string);
11859 /* Iterate over all the catchpoint's locations, and parse an
11860 expression for each. */
11861 for (bl = c->base.loc; bl != NULL; bl = bl->next)
11863 struct ada_catchpoint_location *ada_loc
11864 = (struct ada_catchpoint_location *) bl;
11865 struct expression *exp = NULL;
11867 if (!bl->shlib_disabled)
11869 volatile struct gdb_exception e;
11873 TRY_CATCH (e, RETURN_MASK_ERROR)
11875 exp = parse_exp_1 (&s, bl->address,
11876 block_for_pc (bl->address), 0);
11880 warning (_("failed to reevaluate internal exception condition "
11881 "for catchpoint %d: %s"),
11882 c->base.number, e.message);
11883 /* There is a bug in GCC on sparc-solaris when building with
11884 optimization which causes EXP to change unexpectedly
11885 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11886 The problem should be fixed starting with GCC 4.9.
11887 In the meantime, work around it by forcing EXP back
11893 ada_loc->excep_cond_expr = exp;
11896 do_cleanups (old_chain);
11899 /* Implement the DTOR method in the breakpoint_ops structure for all
11900 exception catchpoint kinds. */
11903 dtor_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
11905 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11907 xfree (c->excep_string);
11909 bkpt_breakpoint_ops.dtor (b);
11912 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11913 structure for all exception catchpoint kinds. */
11915 static struct bp_location *
11916 allocate_location_exception (enum ada_exception_catchpoint_kind ex,
11917 struct breakpoint *self)
11919 struct ada_catchpoint_location *loc;
11921 loc = XNEW (struct ada_catchpoint_location);
11922 init_bp_location (&loc->base, &ada_catchpoint_location_ops, self);
11923 loc->excep_cond_expr = NULL;
11927 /* Implement the RE_SET method in the breakpoint_ops structure for all
11928 exception catchpoint kinds. */
11931 re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
11933 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11935 /* Call the base class's method. This updates the catchpoint's
11937 bkpt_breakpoint_ops.re_set (b);
11939 /* Reparse the exception conditional expressions. One for each
11941 create_excep_cond_exprs (c);
11944 /* Returns true if we should stop for this breakpoint hit. If the
11945 user specified a specific exception, we only want to cause a stop
11946 if the program thrown that exception. */
11949 should_stop_exception (const struct bp_location *bl)
11951 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
11952 const struct ada_catchpoint_location *ada_loc
11953 = (const struct ada_catchpoint_location *) bl;
11954 volatile struct gdb_exception ex;
11957 /* With no specific exception, should always stop. */
11958 if (c->excep_string == NULL)
11961 if (ada_loc->excep_cond_expr == NULL)
11963 /* We will have a NULL expression if back when we were creating
11964 the expressions, this location's had failed to parse. */
11969 TRY_CATCH (ex, RETURN_MASK_ALL)
11971 struct value *mark;
11973 mark = value_mark ();
11974 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr));
11975 value_free_to_mark (mark);
11978 exception_fprintf (gdb_stderr, ex,
11979 _("Error in testing exception condition:\n"));
11983 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11984 for all exception catchpoint kinds. */
11987 check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
11989 bs->stop = should_stop_exception (bs->bp_location_at);
11992 /* Implement the PRINT_IT method in the breakpoint_ops structure
11993 for all exception catchpoint kinds. */
11995 static enum print_stop_action
11996 print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
11998 struct ui_out *uiout = current_uiout;
11999 struct breakpoint *b = bs->breakpoint_at;
12001 annotate_catchpoint (b->number);
12003 if (ui_out_is_mi_like_p (uiout))
12005 ui_out_field_string (uiout, "reason",
12006 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
12007 ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition));
12010 ui_out_text (uiout,
12011 b->disposition == disp_del ? "\nTemporary catchpoint "
12012 : "\nCatchpoint ");
12013 ui_out_field_int (uiout, "bkptno", b->number);
12014 ui_out_text (uiout, ", ");
12018 case ada_catch_exception:
12019 case ada_catch_exception_unhandled:
12021 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
12022 char exception_name[256];
12026 read_memory (addr, (gdb_byte *) exception_name,
12027 sizeof (exception_name) - 1);
12028 exception_name [sizeof (exception_name) - 1] = '\0';
12032 /* For some reason, we were unable to read the exception
12033 name. This could happen if the Runtime was compiled
12034 without debugging info, for instance. In that case,
12035 just replace the exception name by the generic string
12036 "exception" - it will read as "an exception" in the
12037 notification we are about to print. */
12038 memcpy (exception_name, "exception", sizeof ("exception"));
12040 /* In the case of unhandled exception breakpoints, we print
12041 the exception name as "unhandled EXCEPTION_NAME", to make
12042 it clearer to the user which kind of catchpoint just got
12043 hit. We used ui_out_text to make sure that this extra
12044 info does not pollute the exception name in the MI case. */
12045 if (ex == ada_catch_exception_unhandled)
12046 ui_out_text (uiout, "unhandled ");
12047 ui_out_field_string (uiout, "exception-name", exception_name);
12050 case ada_catch_assert:
12051 /* In this case, the name of the exception is not really
12052 important. Just print "failed assertion" to make it clearer
12053 that his program just hit an assertion-failure catchpoint.
12054 We used ui_out_text because this info does not belong in
12056 ui_out_text (uiout, "failed assertion");
12059 ui_out_text (uiout, " at ");
12060 ada_find_printable_frame (get_current_frame ());
12062 return PRINT_SRC_AND_LOC;
12065 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12066 for all exception catchpoint kinds. */
12069 print_one_exception (enum ada_exception_catchpoint_kind ex,
12070 struct breakpoint *b, struct bp_location **last_loc)
12072 struct ui_out *uiout = current_uiout;
12073 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12074 struct value_print_options opts;
12076 get_user_print_options (&opts);
12077 if (opts.addressprint)
12079 annotate_field (4);
12080 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
12083 annotate_field (5);
12084 *last_loc = b->loc;
12087 case ada_catch_exception:
12088 if (c->excep_string != NULL)
12090 char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string);
12092 ui_out_field_string (uiout, "what", msg);
12096 ui_out_field_string (uiout, "what", "all Ada exceptions");
12100 case ada_catch_exception_unhandled:
12101 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
12104 case ada_catch_assert:
12105 ui_out_field_string (uiout, "what", "failed Ada assertions");
12109 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12114 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12115 for all exception catchpoint kinds. */
12118 print_mention_exception (enum ada_exception_catchpoint_kind ex,
12119 struct breakpoint *b)
12121 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12122 struct ui_out *uiout = current_uiout;
12124 ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ")
12125 : _("Catchpoint "));
12126 ui_out_field_int (uiout, "bkptno", b->number);
12127 ui_out_text (uiout, ": ");
12131 case ada_catch_exception:
12132 if (c->excep_string != NULL)
12134 char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string);
12135 struct cleanup *old_chain = make_cleanup (xfree, info);
12137 ui_out_text (uiout, info);
12138 do_cleanups (old_chain);
12141 ui_out_text (uiout, _("all Ada exceptions"));
12144 case ada_catch_exception_unhandled:
12145 ui_out_text (uiout, _("unhandled Ada exceptions"));
12148 case ada_catch_assert:
12149 ui_out_text (uiout, _("failed Ada assertions"));
12153 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12158 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12159 for all exception catchpoint kinds. */
12162 print_recreate_exception (enum ada_exception_catchpoint_kind ex,
12163 struct breakpoint *b, struct ui_file *fp)
12165 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12169 case ada_catch_exception:
12170 fprintf_filtered (fp, "catch exception");
12171 if (c->excep_string != NULL)
12172 fprintf_filtered (fp, " %s", c->excep_string);
12175 case ada_catch_exception_unhandled:
12176 fprintf_filtered (fp, "catch exception unhandled");
12179 case ada_catch_assert:
12180 fprintf_filtered (fp, "catch assert");
12184 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12186 print_recreate_thread (b, fp);
12189 /* Virtual table for "catch exception" breakpoints. */
12192 dtor_catch_exception (struct breakpoint *b)
12194 dtor_exception (ada_catch_exception, b);
12197 static struct bp_location *
12198 allocate_location_catch_exception (struct breakpoint *self)
12200 return allocate_location_exception (ada_catch_exception, self);
12204 re_set_catch_exception (struct breakpoint *b)
12206 re_set_exception (ada_catch_exception, b);
12210 check_status_catch_exception (bpstat bs)
12212 check_status_exception (ada_catch_exception, bs);
12215 static enum print_stop_action
12216 print_it_catch_exception (bpstat bs)
12218 return print_it_exception (ada_catch_exception, bs);
12222 print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
12224 print_one_exception (ada_catch_exception, b, last_loc);
12228 print_mention_catch_exception (struct breakpoint *b)
12230 print_mention_exception (ada_catch_exception, b);
12234 print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
12236 print_recreate_exception (ada_catch_exception, b, fp);
12239 static struct breakpoint_ops catch_exception_breakpoint_ops;
12241 /* Virtual table for "catch exception unhandled" breakpoints. */
12244 dtor_catch_exception_unhandled (struct breakpoint *b)
12246 dtor_exception (ada_catch_exception_unhandled, b);
12249 static struct bp_location *
12250 allocate_location_catch_exception_unhandled (struct breakpoint *self)
12252 return allocate_location_exception (ada_catch_exception_unhandled, self);
12256 re_set_catch_exception_unhandled (struct breakpoint *b)
12258 re_set_exception (ada_catch_exception_unhandled, b);
12262 check_status_catch_exception_unhandled (bpstat bs)
12264 check_status_exception (ada_catch_exception_unhandled, bs);
12267 static enum print_stop_action
12268 print_it_catch_exception_unhandled (bpstat bs)
12270 return print_it_exception (ada_catch_exception_unhandled, bs);
12274 print_one_catch_exception_unhandled (struct breakpoint *b,
12275 struct bp_location **last_loc)
12277 print_one_exception (ada_catch_exception_unhandled, b, last_loc);
12281 print_mention_catch_exception_unhandled (struct breakpoint *b)
12283 print_mention_exception (ada_catch_exception_unhandled, b);
12287 print_recreate_catch_exception_unhandled (struct breakpoint *b,
12288 struct ui_file *fp)
12290 print_recreate_exception (ada_catch_exception_unhandled, b, fp);
12293 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
12295 /* Virtual table for "catch assert" breakpoints. */
12298 dtor_catch_assert (struct breakpoint *b)
12300 dtor_exception (ada_catch_assert, b);
12303 static struct bp_location *
12304 allocate_location_catch_assert (struct breakpoint *self)
12306 return allocate_location_exception (ada_catch_assert, self);
12310 re_set_catch_assert (struct breakpoint *b)
12312 re_set_exception (ada_catch_assert, b);
12316 check_status_catch_assert (bpstat bs)
12318 check_status_exception (ada_catch_assert, bs);
12321 static enum print_stop_action
12322 print_it_catch_assert (bpstat bs)
12324 return print_it_exception (ada_catch_assert, bs);
12328 print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
12330 print_one_exception (ada_catch_assert, b, last_loc);
12334 print_mention_catch_assert (struct breakpoint *b)
12336 print_mention_exception (ada_catch_assert, b);
12340 print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
12342 print_recreate_exception (ada_catch_assert, b, fp);
12345 static struct breakpoint_ops catch_assert_breakpoint_ops;
12347 /* Return a newly allocated copy of the first space-separated token
12348 in ARGSP, and then adjust ARGSP to point immediately after that
12351 Return NULL if ARGPS does not contain any more tokens. */
12354 ada_get_next_arg (char **argsp)
12356 char *args = *argsp;
12360 args = skip_spaces (args);
12361 if (args[0] == '\0')
12362 return NULL; /* No more arguments. */
12364 /* Find the end of the current argument. */
12366 end = skip_to_space (args);
12368 /* Adjust ARGSP to point to the start of the next argument. */
12372 /* Make a copy of the current argument and return it. */
12374 result = xmalloc (end - args + 1);
12375 strncpy (result, args, end - args);
12376 result[end - args] = '\0';
12381 /* Split the arguments specified in a "catch exception" command.
12382 Set EX to the appropriate catchpoint type.
12383 Set EXCEP_STRING to the name of the specific exception if
12384 specified by the user.
12385 If a condition is found at the end of the arguments, the condition
12386 expression is stored in COND_STRING (memory must be deallocated
12387 after use). Otherwise COND_STRING is set to NULL. */
12390 catch_ada_exception_command_split (char *args,
12391 enum ada_exception_catchpoint_kind *ex,
12392 char **excep_string,
12393 char **cond_string)
12395 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
12396 char *exception_name;
12399 exception_name = ada_get_next_arg (&args);
12400 if (exception_name != NULL && strcmp (exception_name, "if") == 0)
12402 /* This is not an exception name; this is the start of a condition
12403 expression for a catchpoint on all exceptions. So, "un-get"
12404 this token, and set exception_name to NULL. */
12405 xfree (exception_name);
12406 exception_name = NULL;
12409 make_cleanup (xfree, exception_name);
12411 /* Check to see if we have a condition. */
12413 args = skip_spaces (args);
12414 if (strncmp (args, "if", 2) == 0
12415 && (isspace (args[2]) || args[2] == '\0'))
12418 args = skip_spaces (args);
12420 if (args[0] == '\0')
12421 error (_("Condition missing after `if' keyword"));
12422 cond = xstrdup (args);
12423 make_cleanup (xfree, cond);
12425 args += strlen (args);
12428 /* Check that we do not have any more arguments. Anything else
12431 if (args[0] != '\0')
12432 error (_("Junk at end of expression"));
12434 discard_cleanups (old_chain);
12436 if (exception_name == NULL)
12438 /* Catch all exceptions. */
12439 *ex = ada_catch_exception;
12440 *excep_string = NULL;
12442 else if (strcmp (exception_name, "unhandled") == 0)
12444 /* Catch unhandled exceptions. */
12445 *ex = ada_catch_exception_unhandled;
12446 *excep_string = NULL;
12450 /* Catch a specific exception. */
12451 *ex = ada_catch_exception;
12452 *excep_string = exception_name;
12454 *cond_string = cond;
12457 /* Return the name of the symbol on which we should break in order to
12458 implement a catchpoint of the EX kind. */
12460 static const char *
12461 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex)
12463 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12465 gdb_assert (data->exception_info != NULL);
12469 case ada_catch_exception:
12470 return (data->exception_info->catch_exception_sym);
12472 case ada_catch_exception_unhandled:
12473 return (data->exception_info->catch_exception_unhandled_sym);
12475 case ada_catch_assert:
12476 return (data->exception_info->catch_assert_sym);
12479 internal_error (__FILE__, __LINE__,
12480 _("unexpected catchpoint kind (%d)"), ex);
12484 /* Return the breakpoint ops "virtual table" used for catchpoints
12487 static const struct breakpoint_ops *
12488 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex)
12492 case ada_catch_exception:
12493 return (&catch_exception_breakpoint_ops);
12495 case ada_catch_exception_unhandled:
12496 return (&catch_exception_unhandled_breakpoint_ops);
12498 case ada_catch_assert:
12499 return (&catch_assert_breakpoint_ops);
12502 internal_error (__FILE__, __LINE__,
12503 _("unexpected catchpoint kind (%d)"), ex);
12507 /* Return the condition that will be used to match the current exception
12508 being raised with the exception that the user wants to catch. This
12509 assumes that this condition is used when the inferior just triggered
12510 an exception catchpoint.
12512 The string returned is a newly allocated string that needs to be
12513 deallocated later. */
12516 ada_exception_catchpoint_cond_string (const char *excep_string)
12520 /* The standard exceptions are a special case. They are defined in
12521 runtime units that have been compiled without debugging info; if
12522 EXCEP_STRING is the not-fully-qualified name of a standard
12523 exception (e.g. "constraint_error") then, during the evaluation
12524 of the condition expression, the symbol lookup on this name would
12525 *not* return this standard exception. The catchpoint condition
12526 may then be set only on user-defined exceptions which have the
12527 same not-fully-qualified name (e.g. my_package.constraint_error).
12529 To avoid this unexcepted behavior, these standard exceptions are
12530 systematically prefixed by "standard". This means that "catch
12531 exception constraint_error" is rewritten into "catch exception
12532 standard.constraint_error".
12534 If an exception named contraint_error is defined in another package of
12535 the inferior program, then the only way to specify this exception as a
12536 breakpoint condition is to use its fully-qualified named:
12537 e.g. my_package.constraint_error. */
12539 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
12541 if (strcmp (standard_exc [i], excep_string) == 0)
12543 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12547 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string);
12550 /* Return the symtab_and_line that should be used to insert an exception
12551 catchpoint of the TYPE kind.
12553 EXCEP_STRING should contain the name of a specific exception that
12554 the catchpoint should catch, or NULL otherwise.
12556 ADDR_STRING returns the name of the function where the real
12557 breakpoint that implements the catchpoints is set, depending on the
12558 type of catchpoint we need to create. */
12560 static struct symtab_and_line
12561 ada_exception_sal (enum ada_exception_catchpoint_kind ex, char *excep_string,
12562 char **addr_string, const struct breakpoint_ops **ops)
12564 const char *sym_name;
12565 struct symbol *sym;
12567 /* First, find out which exception support info to use. */
12568 ada_exception_support_info_sniffer ();
12570 /* Then lookup the function on which we will break in order to catch
12571 the Ada exceptions requested by the user. */
12572 sym_name = ada_exception_sym_name (ex);
12573 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
12575 /* We can assume that SYM is not NULL at this stage. If the symbol
12576 did not exist, ada_exception_support_info_sniffer would have
12577 raised an exception.
12579 Also, ada_exception_support_info_sniffer should have already
12580 verified that SYM is a function symbol. */
12581 gdb_assert (sym != NULL);
12582 gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK);
12584 /* Set ADDR_STRING. */
12585 *addr_string = xstrdup (sym_name);
12588 *ops = ada_exception_breakpoint_ops (ex);
12590 return find_function_start_sal (sym, 1);
12593 /* Create an Ada exception catchpoint.
12595 EX_KIND is the kind of exception catchpoint to be created.
12597 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12598 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12599 of the exception to which this catchpoint applies. When not NULL,
12600 the string must be allocated on the heap, and its deallocation
12601 is no longer the responsibility of the caller.
12603 COND_STRING, if not NULL, is the catchpoint condition. This string
12604 must be allocated on the heap, and its deallocation is no longer
12605 the responsibility of the caller.
12607 TEMPFLAG, if nonzero, means that the underlying breakpoint
12608 should be temporary.
12610 FROM_TTY is the usual argument passed to all commands implementations. */
12613 create_ada_exception_catchpoint (struct gdbarch *gdbarch,
12614 enum ada_exception_catchpoint_kind ex_kind,
12615 char *excep_string,
12621 struct ada_catchpoint *c;
12622 char *addr_string = NULL;
12623 const struct breakpoint_ops *ops = NULL;
12624 struct symtab_and_line sal
12625 = ada_exception_sal (ex_kind, excep_string, &addr_string, &ops);
12627 c = XNEW (struct ada_catchpoint);
12628 init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string,
12629 ops, tempflag, disabled, from_tty);
12630 c->excep_string = excep_string;
12631 create_excep_cond_exprs (c);
12632 if (cond_string != NULL)
12633 set_breakpoint_condition (&c->base, cond_string, from_tty);
12634 install_breakpoint (0, &c->base, 1);
12637 /* Implement the "catch exception" command. */
12640 catch_ada_exception_command (char *arg, int from_tty,
12641 struct cmd_list_element *command)
12643 struct gdbarch *gdbarch = get_current_arch ();
12645 enum ada_exception_catchpoint_kind ex_kind;
12646 char *excep_string = NULL;
12647 char *cond_string = NULL;
12649 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12653 catch_ada_exception_command_split (arg, &ex_kind, &excep_string,
12655 create_ada_exception_catchpoint (gdbarch, ex_kind,
12656 excep_string, cond_string,
12657 tempflag, 1 /* enabled */,
12661 /* Split the arguments specified in a "catch assert" command.
12663 ARGS contains the command's arguments (or the empty string if
12664 no arguments were passed).
12666 If ARGS contains a condition, set COND_STRING to that condition
12667 (the memory needs to be deallocated after use). */
12670 catch_ada_assert_command_split (char *args, char **cond_string)
12672 args = skip_spaces (args);
12674 /* Check whether a condition was provided. */
12675 if (strncmp (args, "if", 2) == 0
12676 && (isspace (args[2]) || args[2] == '\0'))
12679 args = skip_spaces (args);
12680 if (args[0] == '\0')
12681 error (_("condition missing after `if' keyword"));
12682 *cond_string = xstrdup (args);
12685 /* Otherwise, there should be no other argument at the end of
12687 else if (args[0] != '\0')
12688 error (_("Junk at end of arguments."));
12691 /* Implement the "catch assert" command. */
12694 catch_assert_command (char *arg, int from_tty,
12695 struct cmd_list_element *command)
12697 struct gdbarch *gdbarch = get_current_arch ();
12699 char *cond_string = NULL;
12701 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12705 catch_ada_assert_command_split (arg, &cond_string);
12706 create_ada_exception_catchpoint (gdbarch, ada_catch_assert,
12708 tempflag, 1 /* enabled */,
12712 /* Return non-zero if the symbol SYM is an Ada exception object. */
12715 ada_is_exception_sym (struct symbol *sym)
12717 const char *type_name = type_name_no_tag (SYMBOL_TYPE (sym));
12719 return (SYMBOL_CLASS (sym) != LOC_TYPEDEF
12720 && SYMBOL_CLASS (sym) != LOC_BLOCK
12721 && SYMBOL_CLASS (sym) != LOC_CONST
12722 && SYMBOL_CLASS (sym) != LOC_UNRESOLVED
12723 && type_name != NULL && strcmp (type_name, "exception") == 0);
12726 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12727 Ada exception object. This matches all exceptions except the ones
12728 defined by the Ada language. */
12731 ada_is_non_standard_exception_sym (struct symbol *sym)
12735 if (!ada_is_exception_sym (sym))
12738 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
12739 if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0)
12740 return 0; /* A standard exception. */
12742 /* Numeric_Error is also a standard exception, so exclude it.
12743 See the STANDARD_EXC description for more details as to why
12744 this exception is not listed in that array. */
12745 if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0)
12751 /* A helper function for qsort, comparing two struct ada_exc_info
12754 The comparison is determined first by exception name, and then
12755 by exception address. */
12758 compare_ada_exception_info (const void *a, const void *b)
12760 const struct ada_exc_info *exc_a = (struct ada_exc_info *) a;
12761 const struct ada_exc_info *exc_b = (struct ada_exc_info *) b;
12764 result = strcmp (exc_a->name, exc_b->name);
12768 if (exc_a->addr < exc_b->addr)
12770 if (exc_a->addr > exc_b->addr)
12776 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12777 routine, but keeping the first SKIP elements untouched.
12779 All duplicates are also removed. */
12782 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info) **exceptions,
12785 struct ada_exc_info *to_sort
12786 = VEC_address (ada_exc_info, *exceptions) + skip;
12788 = VEC_length (ada_exc_info, *exceptions) - skip;
12791 qsort (to_sort, to_sort_len, sizeof (struct ada_exc_info),
12792 compare_ada_exception_info);
12794 for (i = 1, j = 1; i < to_sort_len; i++)
12795 if (compare_ada_exception_info (&to_sort[i], &to_sort[j - 1]) != 0)
12796 to_sort[j++] = to_sort[i];
12798 VEC_truncate(ada_exc_info, *exceptions, skip + to_sort_len);
12801 /* A function intended as the "name_matcher" callback in the struct
12802 quick_symbol_functions' expand_symtabs_matching method.
12804 SEARCH_NAME is the symbol's search name.
12806 If USER_DATA is not NULL, it is a pointer to a regext_t object
12807 used to match the symbol (by natural name). Otherwise, when USER_DATA
12808 is null, no filtering is performed, and all symbols are a positive
12812 ada_exc_search_name_matches (const char *search_name, void *user_data)
12814 regex_t *preg = user_data;
12819 /* In Ada, the symbol "search name" is a linkage name, whereas
12820 the regular expression used to do the matching refers to
12821 the natural name. So match against the decoded name. */
12822 return (regexec (preg, ada_decode (search_name), 0, NULL, 0) == 0);
12825 /* Add all exceptions defined by the Ada standard whose name match
12826 a regular expression.
12828 If PREG is not NULL, then this regexp_t object is used to
12829 perform the symbol name matching. Otherwise, no name-based
12830 filtering is performed.
12832 EXCEPTIONS is a vector of exceptions to which matching exceptions
12836 ada_add_standard_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions)
12840 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
12843 || regexec (preg, standard_exc[i], 0, NULL, 0) == 0)
12845 struct bound_minimal_symbol msymbol
12846 = ada_lookup_simple_minsym (standard_exc[i]);
12848 if (msymbol.minsym != NULL)
12850 struct ada_exc_info info
12851 = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)};
12853 VEC_safe_push (ada_exc_info, *exceptions, &info);
12859 /* Add all Ada exceptions defined locally and accessible from the given
12862 If PREG is not NULL, then this regexp_t object is used to
12863 perform the symbol name matching. Otherwise, no name-based
12864 filtering is performed.
12866 EXCEPTIONS is a vector of exceptions to which matching exceptions
12870 ada_add_exceptions_from_frame (regex_t *preg, struct frame_info *frame,
12871 VEC(ada_exc_info) **exceptions)
12873 const struct block *block = get_frame_block (frame, 0);
12877 struct block_iterator iter;
12878 struct symbol *sym;
12880 ALL_BLOCK_SYMBOLS (block, iter, sym)
12882 switch (SYMBOL_CLASS (sym))
12889 if (ada_is_exception_sym (sym))
12891 struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym),
12892 SYMBOL_VALUE_ADDRESS (sym)};
12894 VEC_safe_push (ada_exc_info, *exceptions, &info);
12898 if (BLOCK_FUNCTION (block) != NULL)
12900 block = BLOCK_SUPERBLOCK (block);
12904 /* Add all exceptions defined globally whose name name match
12905 a regular expression, excluding standard exceptions.
12907 The reason we exclude standard exceptions is that they need
12908 to be handled separately: Standard exceptions are defined inside
12909 a runtime unit which is normally not compiled with debugging info,
12910 and thus usually do not show up in our symbol search. However,
12911 if the unit was in fact built with debugging info, we need to
12912 exclude them because they would duplicate the entry we found
12913 during the special loop that specifically searches for those
12914 standard exceptions.
12916 If PREG is not NULL, then this regexp_t object is used to
12917 perform the symbol name matching. Otherwise, no name-based
12918 filtering is performed.
12920 EXCEPTIONS is a vector of exceptions to which matching exceptions
12924 ada_add_global_exceptions (regex_t *preg, VEC(ada_exc_info) **exceptions)
12926 struct objfile *objfile;
12929 expand_symtabs_matching (NULL, ada_exc_search_name_matches,
12930 VARIABLES_DOMAIN, preg);
12932 ALL_PRIMARY_SYMTABS (objfile, s)
12934 const struct blockvector *bv = SYMTAB_BLOCKVECTOR (s);
12937 for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++)
12939 struct block *b = BLOCKVECTOR_BLOCK (bv, i);
12940 struct block_iterator iter;
12941 struct symbol *sym;
12943 ALL_BLOCK_SYMBOLS (b, iter, sym)
12944 if (ada_is_non_standard_exception_sym (sym)
12946 || regexec (preg, SYMBOL_NATURAL_NAME (sym),
12949 struct ada_exc_info info
12950 = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)};
12952 VEC_safe_push (ada_exc_info, *exceptions, &info);
12958 /* Implements ada_exceptions_list with the regular expression passed
12959 as a regex_t, rather than a string.
12961 If not NULL, PREG is used to filter out exceptions whose names
12962 do not match. Otherwise, all exceptions are listed. */
12964 static VEC(ada_exc_info) *
12965 ada_exceptions_list_1 (regex_t *preg)
12967 VEC(ada_exc_info) *result = NULL;
12968 struct cleanup *old_chain
12969 = make_cleanup (VEC_cleanup (ada_exc_info), &result);
12972 /* First, list the known standard exceptions. These exceptions
12973 need to be handled separately, as they are usually defined in
12974 runtime units that have been compiled without debugging info. */
12976 ada_add_standard_exceptions (preg, &result);
12978 /* Next, find all exceptions whose scope is local and accessible
12979 from the currently selected frame. */
12981 if (has_stack_frames ())
12983 prev_len = VEC_length (ada_exc_info, result);
12984 ada_add_exceptions_from_frame (preg, get_selected_frame (NULL),
12986 if (VEC_length (ada_exc_info, result) > prev_len)
12987 sort_remove_dups_ada_exceptions_list (&result, prev_len);
12990 /* Add all exceptions whose scope is global. */
12992 prev_len = VEC_length (ada_exc_info, result);
12993 ada_add_global_exceptions (preg, &result);
12994 if (VEC_length (ada_exc_info, result) > prev_len)
12995 sort_remove_dups_ada_exceptions_list (&result, prev_len);
12997 discard_cleanups (old_chain);
13001 /* Return a vector of ada_exc_info.
13003 If REGEXP is NULL, all exceptions are included in the result.
13004 Otherwise, it should contain a valid regular expression,
13005 and only the exceptions whose names match that regular expression
13006 are included in the result.
13008 The exceptions are sorted in the following order:
13009 - Standard exceptions (defined by the Ada language), in
13010 alphabetical order;
13011 - Exceptions only visible from the current frame, in
13012 alphabetical order;
13013 - Exceptions whose scope is global, in alphabetical order. */
13015 VEC(ada_exc_info) *
13016 ada_exceptions_list (const char *regexp)
13018 VEC(ada_exc_info) *result = NULL;
13019 struct cleanup *old_chain = NULL;
13022 if (regexp != NULL)
13023 old_chain = compile_rx_or_error (®, regexp,
13024 _("invalid regular expression"));
13026 result = ada_exceptions_list_1 (regexp != NULL ? ® : NULL);
13028 if (old_chain != NULL)
13029 do_cleanups (old_chain);
13033 /* Implement the "info exceptions" command. */
13036 info_exceptions_command (char *regexp, int from_tty)
13038 VEC(ada_exc_info) *exceptions;
13039 struct cleanup *cleanup;
13040 struct gdbarch *gdbarch = get_current_arch ();
13042 struct ada_exc_info *info;
13044 exceptions = ada_exceptions_list (regexp);
13045 cleanup = make_cleanup (VEC_cleanup (ada_exc_info), &exceptions);
13047 if (regexp != NULL)
13049 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp);
13051 printf_filtered (_("All defined Ada exceptions:\n"));
13053 for (ix = 0; VEC_iterate(ada_exc_info, exceptions, ix, info); ix++)
13054 printf_filtered ("%s: %s\n", info->name, paddress (gdbarch, info->addr));
13056 do_cleanups (cleanup);
13060 /* Information about operators given special treatment in functions
13062 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13064 #define ADA_OPERATORS \
13065 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13066 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13067 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13068 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13069 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13070 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13071 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13072 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13073 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13074 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13075 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13076 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13077 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13078 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13079 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13080 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13081 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13082 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13083 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13086 ada_operator_length (const struct expression *exp, int pc, int *oplenp,
13089 switch (exp->elts[pc - 1].opcode)
13092 operator_length_standard (exp, pc, oplenp, argsp);
13095 #define OP_DEFN(op, len, args, binop) \
13096 case op: *oplenp = len; *argsp = args; break;
13102 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
13107 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
13112 /* Implementation of the exp_descriptor method operator_check. */
13115 ada_operator_check (struct expression *exp, int pos,
13116 int (*objfile_func) (struct objfile *objfile, void *data),
13119 const union exp_element *const elts = exp->elts;
13120 struct type *type = NULL;
13122 switch (elts[pos].opcode)
13124 case UNOP_IN_RANGE:
13126 type = elts[pos + 1].type;
13130 return operator_check_standard (exp, pos, objfile_func, data);
13133 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13135 if (type && TYPE_OBJFILE (type)
13136 && (*objfile_func) (TYPE_OBJFILE (type), data))
13143 ada_op_name (enum exp_opcode opcode)
13148 return op_name_standard (opcode);
13150 #define OP_DEFN(op, len, args, binop) case op: return #op;
13155 return "OP_AGGREGATE";
13157 return "OP_CHOICES";
13163 /* As for operator_length, but assumes PC is pointing at the first
13164 element of the operator, and gives meaningful results only for the
13165 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13168 ada_forward_operator_length (struct expression *exp, int pc,
13169 int *oplenp, int *argsp)
13171 switch (exp->elts[pc].opcode)
13174 *oplenp = *argsp = 0;
13177 #define OP_DEFN(op, len, args, binop) \
13178 case op: *oplenp = len; *argsp = args; break;
13184 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
13189 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
13195 int len = longest_to_int (exp->elts[pc + 1].longconst);
13197 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
13205 ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
13207 enum exp_opcode op = exp->elts[elt].opcode;
13212 ada_forward_operator_length (exp, elt, &oplen, &nargs);
13216 /* Ada attributes ('Foo). */
13219 case OP_ATR_LENGTH:
13223 case OP_ATR_MODULUS:
13230 case UNOP_IN_RANGE:
13232 /* XXX: gdb_sprint_host_address, type_sprint */
13233 fprintf_filtered (stream, _("Type @"));
13234 gdb_print_host_address (exp->elts[pc + 1].type, stream);
13235 fprintf_filtered (stream, " (");
13236 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
13237 fprintf_filtered (stream, ")");
13239 case BINOP_IN_BOUNDS:
13240 fprintf_filtered (stream, " (%d)",
13241 longest_to_int (exp->elts[pc + 2].longconst));
13243 case TERNOP_IN_RANGE:
13248 case OP_DISCRETE_RANGE:
13249 case OP_POSITIONAL:
13256 char *name = &exp->elts[elt + 2].string;
13257 int len = longest_to_int (exp->elts[elt + 1].longconst);
13259 fprintf_filtered (stream, "Text: `%.*s'", len, name);
13264 return dump_subexp_body_standard (exp, stream, elt);
13268 for (i = 0; i < nargs; i += 1)
13269 elt = dump_subexp (exp, stream, elt);
13274 /* The Ada extension of print_subexp (q.v.). */
13277 ada_print_subexp (struct expression *exp, int *pos,
13278 struct ui_file *stream, enum precedence prec)
13280 int oplen, nargs, i;
13282 enum exp_opcode op = exp->elts[pc].opcode;
13284 ada_forward_operator_length (exp, pc, &oplen, &nargs);
13291 print_subexp_standard (exp, pos, stream, prec);
13295 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
13298 case BINOP_IN_BOUNDS:
13299 /* XXX: sprint_subexp */
13300 print_subexp (exp, pos, stream, PREC_SUFFIX);
13301 fputs_filtered (" in ", stream);
13302 print_subexp (exp, pos, stream, PREC_SUFFIX);
13303 fputs_filtered ("'range", stream);
13304 if (exp->elts[pc + 1].longconst > 1)
13305 fprintf_filtered (stream, "(%ld)",
13306 (long) exp->elts[pc + 1].longconst);
13309 case TERNOP_IN_RANGE:
13310 if (prec >= PREC_EQUAL)
13311 fputs_filtered ("(", stream);
13312 /* XXX: sprint_subexp */
13313 print_subexp (exp, pos, stream, PREC_SUFFIX);
13314 fputs_filtered (" in ", stream);
13315 print_subexp (exp, pos, stream, PREC_EQUAL);
13316 fputs_filtered (" .. ", stream);
13317 print_subexp (exp, pos, stream, PREC_EQUAL);
13318 if (prec >= PREC_EQUAL)
13319 fputs_filtered (")", stream);
13324 case OP_ATR_LENGTH:
13328 case OP_ATR_MODULUS:
13333 if (exp->elts[*pos].opcode == OP_TYPE)
13335 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
13336 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0,
13337 &type_print_raw_options);
13341 print_subexp (exp, pos, stream, PREC_SUFFIX);
13342 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
13347 for (tem = 1; tem < nargs; tem += 1)
13349 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
13350 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
13352 fputs_filtered (")", stream);
13357 type_print (exp->elts[pc + 1].type, "", stream, 0);
13358 fputs_filtered ("'(", stream);
13359 print_subexp (exp, pos, stream, PREC_PREFIX);
13360 fputs_filtered (")", stream);
13363 case UNOP_IN_RANGE:
13364 /* XXX: sprint_subexp */
13365 print_subexp (exp, pos, stream, PREC_SUFFIX);
13366 fputs_filtered (" in ", stream);
13367 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0,
13368 &type_print_raw_options);
13371 case OP_DISCRETE_RANGE:
13372 print_subexp (exp, pos, stream, PREC_SUFFIX);
13373 fputs_filtered ("..", stream);
13374 print_subexp (exp, pos, stream, PREC_SUFFIX);
13378 fputs_filtered ("others => ", stream);
13379 print_subexp (exp, pos, stream, PREC_SUFFIX);
13383 for (i = 0; i < nargs-1; i += 1)
13386 fputs_filtered ("|", stream);
13387 print_subexp (exp, pos, stream, PREC_SUFFIX);
13389 fputs_filtered (" => ", stream);
13390 print_subexp (exp, pos, stream, PREC_SUFFIX);
13393 case OP_POSITIONAL:
13394 print_subexp (exp, pos, stream, PREC_SUFFIX);
13398 fputs_filtered ("(", stream);
13399 for (i = 0; i < nargs; i += 1)
13402 fputs_filtered (", ", stream);
13403 print_subexp (exp, pos, stream, PREC_SUFFIX);
13405 fputs_filtered (")", stream);
13410 /* Table mapping opcodes into strings for printing operators
13411 and precedences of the operators. */
13413 static const struct op_print ada_op_print_tab[] = {
13414 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
13415 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
13416 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
13417 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
13418 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
13419 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
13420 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
13421 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
13422 {"<=", BINOP_LEQ, PREC_ORDER, 0},
13423 {">=", BINOP_GEQ, PREC_ORDER, 0},
13424 {">", BINOP_GTR, PREC_ORDER, 0},
13425 {"<", BINOP_LESS, PREC_ORDER, 0},
13426 {">>", BINOP_RSH, PREC_SHIFT, 0},
13427 {"<<", BINOP_LSH, PREC_SHIFT, 0},
13428 {"+", BINOP_ADD, PREC_ADD, 0},
13429 {"-", BINOP_SUB, PREC_ADD, 0},
13430 {"&", BINOP_CONCAT, PREC_ADD, 0},
13431 {"*", BINOP_MUL, PREC_MUL, 0},
13432 {"/", BINOP_DIV, PREC_MUL, 0},
13433 {"rem", BINOP_REM, PREC_MUL, 0},
13434 {"mod", BINOP_MOD, PREC_MUL, 0},
13435 {"**", BINOP_EXP, PREC_REPEAT, 0},
13436 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
13437 {"-", UNOP_NEG, PREC_PREFIX, 0},
13438 {"+", UNOP_PLUS, PREC_PREFIX, 0},
13439 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
13440 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
13441 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
13442 {".all", UNOP_IND, PREC_SUFFIX, 1},
13443 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
13444 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
13448 enum ada_primitive_types {
13449 ada_primitive_type_int,
13450 ada_primitive_type_long,
13451 ada_primitive_type_short,
13452 ada_primitive_type_char,
13453 ada_primitive_type_float,
13454 ada_primitive_type_double,
13455 ada_primitive_type_void,
13456 ada_primitive_type_long_long,
13457 ada_primitive_type_long_double,
13458 ada_primitive_type_natural,
13459 ada_primitive_type_positive,
13460 ada_primitive_type_system_address,
13461 nr_ada_primitive_types
13465 ada_language_arch_info (struct gdbarch *gdbarch,
13466 struct language_arch_info *lai)
13468 const struct builtin_type *builtin = builtin_type (gdbarch);
13470 lai->primitive_type_vector
13471 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
13474 lai->primitive_type_vector [ada_primitive_type_int]
13475 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13477 lai->primitive_type_vector [ada_primitive_type_long]
13478 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
13479 0, "long_integer");
13480 lai->primitive_type_vector [ada_primitive_type_short]
13481 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
13482 0, "short_integer");
13483 lai->string_char_type
13484 = lai->primitive_type_vector [ada_primitive_type_char]
13485 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
13486 lai->primitive_type_vector [ada_primitive_type_float]
13487 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
13489 lai->primitive_type_vector [ada_primitive_type_double]
13490 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
13491 "long_float", NULL);
13492 lai->primitive_type_vector [ada_primitive_type_long_long]
13493 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
13494 0, "long_long_integer");
13495 lai->primitive_type_vector [ada_primitive_type_long_double]
13496 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
13497 "long_long_float", NULL);
13498 lai->primitive_type_vector [ada_primitive_type_natural]
13499 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13501 lai->primitive_type_vector [ada_primitive_type_positive]
13502 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
13504 lai->primitive_type_vector [ada_primitive_type_void]
13505 = builtin->builtin_void;
13507 lai->primitive_type_vector [ada_primitive_type_system_address]
13508 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
13509 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
13510 = "system__address";
13512 lai->bool_type_symbol = NULL;
13513 lai->bool_type_default = builtin->builtin_bool;
13516 /* Language vector */
13518 /* Not really used, but needed in the ada_language_defn. */
13521 emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
13523 ada_emit_char (c, type, stream, quoter, 1);
13527 parse (struct parser_state *ps)
13529 warnings_issued = 0;
13530 return ada_parse (ps);
13533 static const struct exp_descriptor ada_exp_descriptor = {
13535 ada_operator_length,
13536 ada_operator_check,
13538 ada_dump_subexp_body,
13539 ada_evaluate_subexp
13542 /* Implement the "la_get_symbol_name_cmp" language_defn method
13545 static symbol_name_cmp_ftype
13546 ada_get_symbol_name_cmp (const char *lookup_name)
13548 if (should_use_wild_match (lookup_name))
13551 return compare_names;
13554 /* Implement the "la_read_var_value" language_defn method for Ada. */
13556 static struct value *
13557 ada_read_var_value (struct symbol *var, struct frame_info *frame)
13559 const struct block *frame_block = NULL;
13560 struct symbol *renaming_sym = NULL;
13562 /* The only case where default_read_var_value is not sufficient
13563 is when VAR is a renaming... */
13565 frame_block = get_frame_block (frame, NULL);
13567 renaming_sym = ada_find_renaming_symbol (var, frame_block);
13568 if (renaming_sym != NULL)
13569 return ada_read_renaming_var_value (renaming_sym, frame_block);
13571 /* This is a typical case where we expect the default_read_var_value
13572 function to work. */
13573 return default_read_var_value (var, frame);
13576 const struct language_defn ada_language_defn = {
13577 "ada", /* Language name */
13581 case_sensitive_on, /* Yes, Ada is case-insensitive, but
13582 that's not quite what this means. */
13584 macro_expansion_no,
13585 &ada_exp_descriptor,
13589 ada_printchar, /* Print a character constant */
13590 ada_printstr, /* Function to print string constant */
13591 emit_char, /* Function to print single char (not used) */
13592 ada_print_type, /* Print a type using appropriate syntax */
13593 ada_print_typedef, /* Print a typedef using appropriate syntax */
13594 ada_val_print, /* Print a value using appropriate syntax */
13595 ada_value_print, /* Print a top-level value */
13596 ada_read_var_value, /* la_read_var_value */
13597 NULL, /* Language specific skip_trampoline */
13598 NULL, /* name_of_this */
13599 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
13600 basic_lookup_transparent_type, /* lookup_transparent_type */
13601 ada_la_decode, /* Language specific symbol demangler */
13602 NULL, /* Language specific
13603 class_name_from_physname */
13604 ada_op_print_tab, /* expression operators for printing */
13605 0, /* c-style arrays */
13606 1, /* String lower bound */
13607 ada_get_gdb_completer_word_break_characters,
13608 ada_make_symbol_completion_list,
13609 ada_language_arch_info,
13610 ada_print_array_index,
13611 default_pass_by_reference,
13613 ada_get_symbol_name_cmp, /* la_get_symbol_name_cmp */
13614 ada_iterate_over_symbols,
13619 /* Provide a prototype to silence -Wmissing-prototypes. */
13620 extern initialize_file_ftype _initialize_ada_language;
13622 /* Command-list for the "set/show ada" prefix command. */
13623 static struct cmd_list_element *set_ada_list;
13624 static struct cmd_list_element *show_ada_list;
13626 /* Implement the "set ada" prefix command. */
13629 set_ada_command (char *arg, int from_tty)
13631 printf_unfiltered (_(\
13632 "\"set ada\" must be followed by the name of a setting.\n"));
13633 help_list (set_ada_list, "set ada ", all_commands, gdb_stdout);
13636 /* Implement the "show ada" prefix command. */
13639 show_ada_command (char *args, int from_tty)
13641 cmd_show_list (show_ada_list, from_tty, "");
13645 initialize_ada_catchpoint_ops (void)
13647 struct breakpoint_ops *ops;
13649 initialize_breakpoint_ops ();
13651 ops = &catch_exception_breakpoint_ops;
13652 *ops = bkpt_breakpoint_ops;
13653 ops->dtor = dtor_catch_exception;
13654 ops->allocate_location = allocate_location_catch_exception;
13655 ops->re_set = re_set_catch_exception;
13656 ops->check_status = check_status_catch_exception;
13657 ops->print_it = print_it_catch_exception;
13658 ops->print_one = print_one_catch_exception;
13659 ops->print_mention = print_mention_catch_exception;
13660 ops->print_recreate = print_recreate_catch_exception;
13662 ops = &catch_exception_unhandled_breakpoint_ops;
13663 *ops = bkpt_breakpoint_ops;
13664 ops->dtor = dtor_catch_exception_unhandled;
13665 ops->allocate_location = allocate_location_catch_exception_unhandled;
13666 ops->re_set = re_set_catch_exception_unhandled;
13667 ops->check_status = check_status_catch_exception_unhandled;
13668 ops->print_it = print_it_catch_exception_unhandled;
13669 ops->print_one = print_one_catch_exception_unhandled;
13670 ops->print_mention = print_mention_catch_exception_unhandled;
13671 ops->print_recreate = print_recreate_catch_exception_unhandled;
13673 ops = &catch_assert_breakpoint_ops;
13674 *ops = bkpt_breakpoint_ops;
13675 ops->dtor = dtor_catch_assert;
13676 ops->allocate_location = allocate_location_catch_assert;
13677 ops->re_set = re_set_catch_assert;
13678 ops->check_status = check_status_catch_assert;
13679 ops->print_it = print_it_catch_assert;
13680 ops->print_one = print_one_catch_assert;
13681 ops->print_mention = print_mention_catch_assert;
13682 ops->print_recreate = print_recreate_catch_assert;
13685 /* This module's 'new_objfile' observer. */
13688 ada_new_objfile_observer (struct objfile *objfile)
13690 ada_clear_symbol_cache ();
13693 /* This module's 'free_objfile' observer. */
13696 ada_free_objfile_observer (struct objfile *objfile)
13698 ada_clear_symbol_cache ();
13702 _initialize_ada_language (void)
13704 add_language (&ada_language_defn);
13706 initialize_ada_catchpoint_ops ();
13708 add_prefix_cmd ("ada", no_class, set_ada_command,
13709 _("Prefix command for changing Ada-specfic settings"),
13710 &set_ada_list, "set ada ", 0, &setlist);
13712 add_prefix_cmd ("ada", no_class, show_ada_command,
13713 _("Generic command for showing Ada-specific settings."),
13714 &show_ada_list, "show ada ", 0, &showlist);
13716 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
13717 &trust_pad_over_xvs, _("\
13718 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13719 Show whether an optimization trusting PAD types over XVS types is activated"),
13721 This is related to the encoding used by the GNAT compiler. The debugger\n\
13722 should normally trust the contents of PAD types, but certain older versions\n\
13723 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13724 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13725 work around this bug. It is always safe to turn this option \"off\", but\n\
13726 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13727 this option to \"off\" unless necessary."),
13728 NULL, NULL, &set_ada_list, &show_ada_list);
13730 add_catch_command ("exception", _("\
13731 Catch Ada exceptions, when raised.\n\
13732 With an argument, catch only exceptions with the given name."),
13733 catch_ada_exception_command,
13737 add_catch_command ("assert", _("\
13738 Catch failed Ada assertions, when raised.\n\
13739 With an argument, catch only exceptions with the given name."),
13740 catch_assert_command,
13745 varsize_limit = 65536;
13747 add_info ("exceptions", info_exceptions_command,
13749 List all Ada exception names.\n\
13750 If a regular expression is passed as an argument, only those matching\n\
13751 the regular expression are listed."));
13753 add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd,
13754 _("Set Ada maintenance-related variables."),
13755 &maint_set_ada_cmdlist, "maintenance set ada ",
13756 0/*allow-unknown*/, &maintenance_set_cmdlist);
13758 add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd,
13759 _("Show Ada maintenance-related variables"),
13760 &maint_show_ada_cmdlist, "maintenance show ada ",
13761 0/*allow-unknown*/, &maintenance_show_cmdlist);
13763 add_setshow_boolean_cmd
13764 ("ignore-descriptive-types", class_maintenance,
13765 &ada_ignore_descriptive_types_p,
13766 _("Set whether descriptive types generated by GNAT should be ignored."),
13767 _("Show whether descriptive types generated by GNAT should be ignored."),
13769 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13770 DWARF attribute."),
13771 NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist);
13773 obstack_init (&symbol_list_obstack);
13775 decoded_names_store = htab_create_alloc
13776 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
13777 NULL, xcalloc, xfree);
13779 /* The ada-lang observers. */
13780 observer_attach_new_objfile (ada_new_objfile_observer);
13781 observer_attach_free_objfile (ada_free_objfile_observer);
13782 observer_attach_inferior_exit (ada_inferior_exit);
13784 /* Setup various context-specific data. */
13786 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);
13787 ada_pspace_data_handle
13788 = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup);