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/>. */
27 #include "gdb_regex.h"
32 #include "expression.h"
33 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
50 #include "dictionary.h"
51 #include "exceptions.h"
59 #include "typeprint.h"
63 #include "mi/mi-common.h"
64 #include "arch-utils.h"
65 #include "cli/cli-utils.h"
67 /* Define whether or not the C operator '/' truncates towards zero for
68 differently signed operands (truncation direction is undefined in C).
69 Copied from valarith.c. */
71 #ifndef TRUNCATION_TOWARDS_ZERO
72 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75 static struct type
*desc_base_type (struct type
*);
77 static struct type
*desc_bounds_type (struct type
*);
79 static struct value
*desc_bounds (struct value
*);
81 static int fat_pntr_bounds_bitpos (struct type
*);
83 static int fat_pntr_bounds_bitsize (struct type
*);
85 static struct type
*desc_data_target_type (struct type
*);
87 static struct value
*desc_data (struct value
*);
89 static int fat_pntr_data_bitpos (struct type
*);
91 static int fat_pntr_data_bitsize (struct type
*);
93 static struct value
*desc_one_bound (struct value
*, int, int);
95 static int desc_bound_bitpos (struct type
*, int, int);
97 static int desc_bound_bitsize (struct type
*, int, int);
99 static struct type
*desc_index_type (struct type
*, int);
101 static int desc_arity (struct type
*);
103 static int ada_type_match (struct type
*, struct type
*, int);
105 static int ada_args_match (struct symbol
*, struct value
**, int);
107 static int full_match (const char *, const char *);
109 static struct value
*make_array_descriptor (struct type
*, struct value
*);
111 static void ada_add_block_symbols (struct obstack
*,
112 const struct block
*, const char *,
113 domain_enum
, struct objfile
*, int);
115 static int is_nonfunction (struct ada_symbol_info
*, int);
117 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
118 const struct block
*);
120 static int num_defns_collected (struct obstack
*);
122 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
124 static struct value
*resolve_subexp (struct expression
**, int *, int,
127 static void replace_operator_with_call (struct expression
**, int, int, int,
128 struct symbol
*, const struct block
*);
130 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
132 static char *ada_op_name (enum exp_opcode
);
134 static const char *ada_decoded_op_name (enum exp_opcode
);
136 static int numeric_type_p (struct type
*);
138 static int integer_type_p (struct type
*);
140 static int scalar_type_p (struct type
*);
142 static int discrete_type_p (struct type
*);
144 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
149 static struct symbol
*find_old_style_renaming_symbol (const char *,
150 const struct block
*);
152 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
155 static struct value
*evaluate_subexp_type (struct expression
*, int *);
157 static struct type
*ada_find_parallel_type_with_name (struct type
*,
160 static int is_dynamic_field (struct type
*, int);
162 static struct type
*to_fixed_variant_branch_type (struct type
*,
164 CORE_ADDR
, struct value
*);
166 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
168 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
170 static struct type
*to_static_fixed_type (struct type
*);
171 static struct type
*static_unwrap_type (struct type
*type
);
173 static struct value
*unwrap_value (struct value
*);
175 static struct type
*constrained_packed_array_type (struct type
*, long *);
177 static struct type
*decode_constrained_packed_array_type (struct type
*);
179 static long decode_packed_array_bitsize (struct type
*);
181 static struct value
*decode_constrained_packed_array (struct value
*);
183 static int ada_is_packed_array_type (struct type
*);
185 static int ada_is_unconstrained_packed_array_type (struct type
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int advance_wild_match (const char **, const char *, int);
205 static int wild_match (const char *, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (const char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static int ada_resolve_function (struct ada_symbol_info
*, int,
231 struct value
**, int, const char *,
234 static int ada_is_direct_array_type (struct type
*);
236 static void ada_language_arch_info (struct gdbarch
*,
237 struct language_arch_info
*);
239 static void check_size (const struct type
*);
241 static struct value
*ada_index_struct_field (int, struct value
*, int,
244 static struct value
*assign_aggregate (struct value
*, struct value
*,
248 static void aggregate_assign_from_choices (struct value
*, struct value
*,
250 int *, LONGEST
*, int *,
251 int, LONGEST
, LONGEST
);
253 static void aggregate_assign_positional (struct value
*, struct value
*,
255 int *, LONGEST
*, int *, int,
259 static void aggregate_assign_others (struct value
*, struct value
*,
261 int *, LONGEST
*, int, LONGEST
, LONGEST
);
264 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
267 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
270 static void ada_forward_operator_length (struct expression
*, int, int *,
273 static struct type
*ada_find_any_type (const char *name
);
276 /* The result of a symbol lookup to be stored in our symbol cache. */
280 /* The name used to perform the lookup. */
282 /* The namespace used during the lookup. */
283 domain_enum
namespace;
284 /* The symbol returned by the lookup, or NULL if no matching symbol
287 /* The block where the symbol was found, or NULL if no matching
289 const struct block
*block
;
290 /* A pointer to the next entry with the same hash. */
291 struct cache_entry
*next
;
294 /* The Ada symbol cache, used to store the result of Ada-mode symbol
295 lookups in the course of executing the user's commands.
297 The cache is implemented using a simple, fixed-sized hash.
298 The size is fixed on the grounds that there are not likely to be
299 all that many symbols looked up during any given session, regardless
300 of the size of the symbol table. If we decide to go to a resizable
301 table, let's just use the stuff from libiberty instead. */
303 #define HASH_SIZE 1009
305 struct ada_symbol_cache
307 /* An obstack used to store the entries in our cache. */
308 struct obstack cache_space
;
310 /* The root of the hash table used to implement our symbol cache. */
311 struct cache_entry
*root
[HASH_SIZE
];
314 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
316 /* Maximum-sized dynamic type. */
317 static unsigned int varsize_limit
;
319 /* FIXME: brobecker/2003-09-17: No longer a const because it is
320 returned by a function that does not return a const char *. */
321 static char *ada_completer_word_break_characters
=
323 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
325 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
328 /* The name of the symbol to use to get the name of the main subprogram. */
329 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
330 = "__gnat_ada_main_program_name";
332 /* Limit on the number of warnings to raise per expression evaluation. */
333 static int warning_limit
= 2;
335 /* Number of warning messages issued; reset to 0 by cleanups after
336 expression evaluation. */
337 static int warnings_issued
= 0;
339 static const char *known_runtime_file_name_patterns
[] = {
340 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
343 static const char *known_auxiliary_function_name_patterns
[] = {
344 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
347 /* Space for allocating results of ada_lookup_symbol_list. */
348 static struct obstack symbol_list_obstack
;
350 /* Maintenance-related settings for this module. */
352 static struct cmd_list_element
*maint_set_ada_cmdlist
;
353 static struct cmd_list_element
*maint_show_ada_cmdlist
;
355 /* Implement the "maintenance set ada" (prefix) command. */
358 maint_set_ada_cmd (char *args
, int from_tty
)
360 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", -1, gdb_stdout
);
363 /* Implement the "maintenance show ada" (prefix) command. */
366 maint_show_ada_cmd (char *args
, int from_tty
)
368 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
371 /* The "maintenance ada set/show ignore-descriptive-type" value. */
373 static int ada_ignore_descriptive_types_p
= 0;
375 /* Inferior-specific data. */
377 /* Per-inferior data for this module. */
379 struct ada_inferior_data
381 /* The ada__tags__type_specific_data type, which is used when decoding
382 tagged types. With older versions of GNAT, this type was directly
383 accessible through a component ("tsd") in the object tag. But this
384 is no longer the case, so we cache it for each inferior. */
385 struct type
*tsd_type
;
387 /* The exception_support_info data. This data is used to determine
388 how to implement support for Ada exception catchpoints in a given
390 const struct exception_support_info
*exception_info
;
393 /* Our key to this module's inferior data. */
394 static const struct inferior_data
*ada_inferior_data
;
396 /* A cleanup routine for our inferior data. */
398 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
400 struct ada_inferior_data
*data
;
402 data
= inferior_data (inf
, ada_inferior_data
);
407 /* Return our inferior data for the given inferior (INF).
409 This function always returns a valid pointer to an allocated
410 ada_inferior_data structure. If INF's inferior data has not
411 been previously set, this functions creates a new one with all
412 fields set to zero, sets INF's inferior to it, and then returns
413 a pointer to that newly allocated ada_inferior_data. */
415 static struct ada_inferior_data
*
416 get_ada_inferior_data (struct inferior
*inf
)
418 struct ada_inferior_data
*data
;
420 data
= inferior_data (inf
, ada_inferior_data
);
423 data
= XCNEW (struct ada_inferior_data
);
424 set_inferior_data (inf
, ada_inferior_data
, data
);
430 /* Perform all necessary cleanups regarding our module's inferior data
431 that is required after the inferior INF just exited. */
434 ada_inferior_exit (struct inferior
*inf
)
436 ada_inferior_data_cleanup (inf
, NULL
);
437 set_inferior_data (inf
, ada_inferior_data
, NULL
);
441 /* program-space-specific data. */
443 /* This module's per-program-space data. */
444 struct ada_pspace_data
446 /* The Ada symbol cache. */
447 struct ada_symbol_cache
*sym_cache
;
450 /* Key to our per-program-space data. */
451 static const struct program_space_data
*ada_pspace_data_handle
;
453 /* Return this module's data for the given program space (PSPACE).
454 If not is found, add a zero'ed one now.
456 This function always returns a valid object. */
458 static struct ada_pspace_data
*
459 get_ada_pspace_data (struct program_space
*pspace
)
461 struct ada_pspace_data
*data
;
463 data
= program_space_data (pspace
, ada_pspace_data_handle
);
466 data
= XCNEW (struct ada_pspace_data
);
467 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
473 /* The cleanup callback for this module's per-program-space data. */
476 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
478 struct ada_pspace_data
*pspace_data
= data
;
480 if (pspace_data
->sym_cache
!= NULL
)
481 ada_free_symbol_cache (pspace_data
->sym_cache
);
487 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
488 all typedef layers have been peeled. Otherwise, return TYPE.
490 Normally, we really expect a typedef type to only have 1 typedef layer.
491 In other words, we really expect the target type of a typedef type to be
492 a non-typedef type. This is particularly true for Ada units, because
493 the language does not have a typedef vs not-typedef distinction.
494 In that respect, the Ada compiler has been trying to eliminate as many
495 typedef definitions in the debugging information, since they generally
496 do not bring any extra information (we still use typedef under certain
497 circumstances related mostly to the GNAT encoding).
499 Unfortunately, we have seen situations where the debugging information
500 generated by the compiler leads to such multiple typedef layers. For
501 instance, consider the following example with stabs:
503 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
504 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
506 This is an error in the debugging information which causes type
507 pck__float_array___XUP to be defined twice, and the second time,
508 it is defined as a typedef of a typedef.
510 This is on the fringe of legality as far as debugging information is
511 concerned, and certainly unexpected. But it is easy to handle these
512 situations correctly, so we can afford to be lenient in this case. */
515 ada_typedef_target_type (struct type
*type
)
517 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
518 type
= TYPE_TARGET_TYPE (type
);
522 /* Given DECODED_NAME a string holding a symbol name in its
523 decoded form (ie using the Ada dotted notation), returns
524 its unqualified name. */
527 ada_unqualified_name (const char *decoded_name
)
529 const char *result
= strrchr (decoded_name
, '.');
532 result
++; /* Skip the dot... */
534 result
= decoded_name
;
539 /* Return a string starting with '<', followed by STR, and '>'.
540 The result is good until the next call. */
543 add_angle_brackets (const char *str
)
545 static char *result
= NULL
;
548 result
= xstrprintf ("<%s>", str
);
553 ada_get_gdb_completer_word_break_characters (void)
555 return ada_completer_word_break_characters
;
558 /* Print an array element index using the Ada syntax. */
561 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
562 const struct value_print_options
*options
)
564 LA_VALUE_PRINT (index_value
, stream
, options
);
565 fprintf_filtered (stream
, " => ");
568 /* Assuming VECT points to an array of *SIZE objects of size
569 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
570 updating *SIZE as necessary and returning the (new) array. */
573 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
575 if (*size
< min_size
)
578 if (*size
< min_size
)
580 vect
= xrealloc (vect
, *size
* element_size
);
585 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
586 suffix of FIELD_NAME beginning "___". */
589 field_name_match (const char *field_name
, const char *target
)
591 int len
= strlen (target
);
594 (strncmp (field_name
, target
, len
) == 0
595 && (field_name
[len
] == '\0'
596 || (strncmp (field_name
+ len
, "___", 3) == 0
597 && strcmp (field_name
+ strlen (field_name
) - 6,
602 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
603 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
604 and return its index. This function also handles fields whose name
605 have ___ suffixes because the compiler sometimes alters their name
606 by adding such a suffix to represent fields with certain constraints.
607 If the field could not be found, return a negative number if
608 MAYBE_MISSING is set. Otherwise raise an error. */
611 ada_get_field_index (const struct type
*type
, const char *field_name
,
615 struct type
*struct_type
= check_typedef ((struct type
*) type
);
617 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
618 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
622 error (_("Unable to find field %s in struct %s. Aborting"),
623 field_name
, TYPE_NAME (struct_type
));
628 /* The length of the prefix of NAME prior to any "___" suffix. */
631 ada_name_prefix_len (const char *name
)
637 const char *p
= strstr (name
, "___");
640 return strlen (name
);
646 /* Return non-zero if SUFFIX is a suffix of STR.
647 Return zero if STR is null. */
650 is_suffix (const char *str
, const char *suffix
)
657 len2
= strlen (suffix
);
658 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
661 /* The contents of value VAL, treated as a value of type TYPE. The
662 result is an lval in memory if VAL is. */
664 static struct value
*
665 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
667 type
= ada_check_typedef (type
);
668 if (value_type (val
) == type
)
672 struct value
*result
;
674 /* Make sure that the object size is not unreasonable before
675 trying to allocate some memory for it. */
679 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
680 result
= allocate_value_lazy (type
);
683 result
= allocate_value (type
);
684 memcpy (value_contents_raw (result
), value_contents (val
),
687 set_value_component_location (result
, val
);
688 set_value_bitsize (result
, value_bitsize (val
));
689 set_value_bitpos (result
, value_bitpos (val
));
690 set_value_address (result
, value_address (val
));
691 set_value_optimized_out (result
, value_optimized_out_const (val
));
696 static const gdb_byte
*
697 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
702 return valaddr
+ offset
;
706 cond_offset_target (CORE_ADDR address
, long offset
)
711 return address
+ offset
;
714 /* Issue a warning (as for the definition of warning in utils.c, but
715 with exactly one argument rather than ...), unless the limit on the
716 number of warnings has passed during the evaluation of the current
719 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
720 provided by "complaint". */
721 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
724 lim_warning (const char *format
, ...)
728 va_start (args
, format
);
729 warnings_issued
+= 1;
730 if (warnings_issued
<= warning_limit
)
731 vwarning (format
, args
);
736 /* Issue an error if the size of an object of type T is unreasonable,
737 i.e. if it would be a bad idea to allocate a value of this type in
741 check_size (const struct type
*type
)
743 if (TYPE_LENGTH (type
) > varsize_limit
)
744 error (_("object size is larger than varsize-limit"));
747 /* Maximum value of a SIZE-byte signed integer type. */
749 max_of_size (int size
)
751 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
753 return top_bit
| (top_bit
- 1);
756 /* Minimum value of a SIZE-byte signed integer type. */
758 min_of_size (int size
)
760 return -max_of_size (size
) - 1;
763 /* Maximum value of a SIZE-byte unsigned integer type. */
765 umax_of_size (int size
)
767 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
769 return top_bit
| (top_bit
- 1);
772 /* Maximum value of integral type T, as a signed quantity. */
774 max_of_type (struct type
*t
)
776 if (TYPE_UNSIGNED (t
))
777 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
779 return max_of_size (TYPE_LENGTH (t
));
782 /* Minimum value of integral type T, as a signed quantity. */
784 min_of_type (struct type
*t
)
786 if (TYPE_UNSIGNED (t
))
789 return min_of_size (TYPE_LENGTH (t
));
792 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
794 ada_discrete_type_high_bound (struct type
*type
)
796 switch (TYPE_CODE (type
))
798 case TYPE_CODE_RANGE
:
799 return TYPE_HIGH_BOUND (type
);
801 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
806 return max_of_type (type
);
808 error (_("Unexpected type in ada_discrete_type_high_bound."));
812 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
814 ada_discrete_type_low_bound (struct type
*type
)
816 switch (TYPE_CODE (type
))
818 case TYPE_CODE_RANGE
:
819 return TYPE_LOW_BOUND (type
);
821 return TYPE_FIELD_ENUMVAL (type
, 0);
826 return min_of_type (type
);
828 error (_("Unexpected type in ada_discrete_type_low_bound."));
832 /* The identity on non-range types. For range types, the underlying
833 non-range scalar type. */
836 get_base_type (struct type
*type
)
838 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
840 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
842 type
= TYPE_TARGET_TYPE (type
);
847 /* Return a decoded version of the given VALUE. This means returning
848 a value whose type is obtained by applying all the GNAT-specific
849 encondings, making the resulting type a static but standard description
850 of the initial type. */
853 ada_get_decoded_value (struct value
*value
)
855 struct type
*type
= ada_check_typedef (value_type (value
));
857 if (ada_is_array_descriptor_type (type
)
858 || (ada_is_constrained_packed_array_type (type
)
859 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
861 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
862 value
= ada_coerce_to_simple_array_ptr (value
);
864 value
= ada_coerce_to_simple_array (value
);
867 value
= ada_to_fixed_value (value
);
872 /* Same as ada_get_decoded_value, but with the given TYPE.
873 Because there is no associated actual value for this type,
874 the resulting type might be a best-effort approximation in
875 the case of dynamic types. */
878 ada_get_decoded_type (struct type
*type
)
880 type
= to_static_fixed_type (type
);
881 if (ada_is_constrained_packed_array_type (type
))
882 type
= ada_coerce_to_simple_array_type (type
);
888 /* Language Selection */
890 /* If the main program is in Ada, return language_ada, otherwise return LANG
891 (the main program is in Ada iif the adainit symbol is found). */
894 ada_update_initial_language (enum language lang
)
896 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
897 (struct objfile
*) NULL
).minsym
!= NULL
)
903 /* If the main procedure is written in Ada, then return its name.
904 The result is good until the next call. Return NULL if the main
905 procedure doesn't appear to be in Ada. */
910 struct bound_minimal_symbol msym
;
911 static char *main_program_name
= NULL
;
913 /* For Ada, the name of the main procedure is stored in a specific
914 string constant, generated by the binder. Look for that symbol,
915 extract its address, and then read that string. If we didn't find
916 that string, then most probably the main procedure is not written
918 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
920 if (msym
.minsym
!= NULL
)
922 CORE_ADDR main_program_name_addr
;
925 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
926 if (main_program_name_addr
== 0)
927 error (_("Invalid address for Ada main program name."));
929 xfree (main_program_name
);
930 target_read_string (main_program_name_addr
, &main_program_name
,
935 return main_program_name
;
938 /* The main procedure doesn't seem to be in Ada. */
944 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
947 const struct ada_opname_map ada_opname_table
[] = {
948 {"Oadd", "\"+\"", BINOP_ADD
},
949 {"Osubtract", "\"-\"", BINOP_SUB
},
950 {"Omultiply", "\"*\"", BINOP_MUL
},
951 {"Odivide", "\"/\"", BINOP_DIV
},
952 {"Omod", "\"mod\"", BINOP_MOD
},
953 {"Orem", "\"rem\"", BINOP_REM
},
954 {"Oexpon", "\"**\"", BINOP_EXP
},
955 {"Olt", "\"<\"", BINOP_LESS
},
956 {"Ole", "\"<=\"", BINOP_LEQ
},
957 {"Ogt", "\">\"", BINOP_GTR
},
958 {"Oge", "\">=\"", BINOP_GEQ
},
959 {"Oeq", "\"=\"", BINOP_EQUAL
},
960 {"One", "\"/=\"", BINOP_NOTEQUAL
},
961 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
962 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
963 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
964 {"Oconcat", "\"&\"", BINOP_CONCAT
},
965 {"Oabs", "\"abs\"", UNOP_ABS
},
966 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
967 {"Oadd", "\"+\"", UNOP_PLUS
},
968 {"Osubtract", "\"-\"", UNOP_NEG
},
972 /* The "encoded" form of DECODED, according to GNAT conventions.
973 The result is valid until the next call to ada_encode. */
976 ada_encode (const char *decoded
)
978 static char *encoding_buffer
= NULL
;
979 static size_t encoding_buffer_size
= 0;
986 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
987 2 * strlen (decoded
) + 10);
990 for (p
= decoded
; *p
!= '\0'; p
+= 1)
994 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
999 const struct ada_opname_map
*mapping
;
1001 for (mapping
= ada_opname_table
;
1002 mapping
->encoded
!= NULL
1003 && strncmp (mapping
->decoded
, p
,
1004 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
1006 if (mapping
->encoded
== NULL
)
1007 error (_("invalid Ada operator name: %s"), p
);
1008 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1009 k
+= strlen (mapping
->encoded
);
1014 encoding_buffer
[k
] = *p
;
1019 encoding_buffer
[k
] = '\0';
1020 return encoding_buffer
;
1023 /* Return NAME folded to lower case, or, if surrounded by single
1024 quotes, unfolded, but with the quotes stripped away. Result good
1028 ada_fold_name (const char *name
)
1030 static char *fold_buffer
= NULL
;
1031 static size_t fold_buffer_size
= 0;
1033 int len
= strlen (name
);
1034 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1036 if (name
[0] == '\'')
1038 strncpy (fold_buffer
, name
+ 1, len
- 2);
1039 fold_buffer
[len
- 2] = '\000';
1045 for (i
= 0; i
<= len
; i
+= 1)
1046 fold_buffer
[i
] = tolower (name
[i
]);
1052 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1055 is_lower_alphanum (const char c
)
1057 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1060 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1061 This function saves in LEN the length of that same symbol name but
1062 without either of these suffixes:
1068 These are suffixes introduced by the compiler for entities such as
1069 nested subprogram for instance, in order to avoid name clashes.
1070 They do not serve any purpose for the debugger. */
1073 ada_remove_trailing_digits (const char *encoded
, int *len
)
1075 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1079 while (i
> 0 && isdigit (encoded
[i
]))
1081 if (i
>= 0 && encoded
[i
] == '.')
1083 else if (i
>= 0 && encoded
[i
] == '$')
1085 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
1087 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
1092 /* Remove the suffix introduced by the compiler for protected object
1096 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1098 /* Remove trailing N. */
1100 /* Protected entry subprograms are broken into two
1101 separate subprograms: The first one is unprotected, and has
1102 a 'N' suffix; the second is the protected version, and has
1103 the 'P' suffix. The second calls the first one after handling
1104 the protection. Since the P subprograms are internally generated,
1105 we leave these names undecoded, giving the user a clue that this
1106 entity is internal. */
1109 && encoded
[*len
- 1] == 'N'
1110 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1114 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1117 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1121 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1124 if (encoded
[i
] != 'X')
1130 if (isalnum (encoded
[i
-1]))
1134 /* If ENCODED follows the GNAT entity encoding conventions, then return
1135 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1136 replaced by ENCODED.
1138 The resulting string is valid until the next call of ada_decode.
1139 If the string is unchanged by decoding, the original string pointer
1143 ada_decode (const char *encoded
)
1150 static char *decoding_buffer
= NULL
;
1151 static size_t decoding_buffer_size
= 0;
1153 /* The name of the Ada main procedure starts with "_ada_".
1154 This prefix is not part of the decoded name, so skip this part
1155 if we see this prefix. */
1156 if (strncmp (encoded
, "_ada_", 5) == 0)
1159 /* If the name starts with '_', then it is not a properly encoded
1160 name, so do not attempt to decode it. Similarly, if the name
1161 starts with '<', the name should not be decoded. */
1162 if (encoded
[0] == '_' || encoded
[0] == '<')
1165 len0
= strlen (encoded
);
1167 ada_remove_trailing_digits (encoded
, &len0
);
1168 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1170 /* Remove the ___X.* suffix if present. Do not forget to verify that
1171 the suffix is located before the current "end" of ENCODED. We want
1172 to avoid re-matching parts of ENCODED that have previously been
1173 marked as discarded (by decrementing LEN0). */
1174 p
= strstr (encoded
, "___");
1175 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1183 /* Remove any trailing TKB suffix. It tells us that this symbol
1184 is for the body of a task, but that information does not actually
1185 appear in the decoded name. */
1187 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1190 /* Remove any trailing TB suffix. The TB suffix is slightly different
1191 from the TKB suffix because it is used for non-anonymous task
1194 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1197 /* Remove trailing "B" suffixes. */
1198 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1200 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1203 /* Make decoded big enough for possible expansion by operator name. */
1205 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1206 decoded
= decoding_buffer
;
1208 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1210 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1213 while ((i
>= 0 && isdigit (encoded
[i
]))
1214 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1216 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1218 else if (encoded
[i
] == '$')
1222 /* The first few characters that are not alphabetic are not part
1223 of any encoding we use, so we can copy them over verbatim. */
1225 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1226 decoded
[j
] = encoded
[i
];
1231 /* Is this a symbol function? */
1232 if (at_start_name
&& encoded
[i
] == 'O')
1236 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1238 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1239 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1241 && !isalnum (encoded
[i
+ op_len
]))
1243 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1246 j
+= strlen (ada_opname_table
[k
].decoded
);
1250 if (ada_opname_table
[k
].encoded
!= NULL
)
1255 /* Replace "TK__" with "__", which will eventually be translated
1256 into "." (just below). */
1258 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1261 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1262 be translated into "." (just below). These are internal names
1263 generated for anonymous blocks inside which our symbol is nested. */
1265 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1266 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1267 && isdigit (encoded
[i
+4]))
1271 while (k
< len0
&& isdigit (encoded
[k
]))
1272 k
++; /* Skip any extra digit. */
1274 /* Double-check that the "__B_{DIGITS}+" sequence we found
1275 is indeed followed by "__". */
1276 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1280 /* Remove _E{DIGITS}+[sb] */
1282 /* Just as for protected object subprograms, there are 2 categories
1283 of subprograms created by the compiler for each entry. The first
1284 one implements the actual entry code, and has a suffix following
1285 the convention above; the second one implements the barrier and
1286 uses the same convention as above, except that the 'E' is replaced
1289 Just as above, we do not decode the name of barrier functions
1290 to give the user a clue that the code he is debugging has been
1291 internally generated. */
1293 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1294 && isdigit (encoded
[i
+2]))
1298 while (k
< len0
&& isdigit (encoded
[k
]))
1302 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1305 /* Just as an extra precaution, make sure that if this
1306 suffix is followed by anything else, it is a '_'.
1307 Otherwise, we matched this sequence by accident. */
1309 || (k
< len0
&& encoded
[k
] == '_'))
1314 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1315 the GNAT front-end in protected object subprograms. */
1318 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1320 /* Backtrack a bit up until we reach either the begining of
1321 the encoded name, or "__". Make sure that we only find
1322 digits or lowercase characters. */
1323 const char *ptr
= encoded
+ i
- 1;
1325 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1328 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1332 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1334 /* This is a X[bn]* sequence not separated from the previous
1335 part of the name with a non-alpha-numeric character (in other
1336 words, immediately following an alpha-numeric character), then
1337 verify that it is placed at the end of the encoded name. If
1338 not, then the encoding is not valid and we should abort the
1339 decoding. Otherwise, just skip it, it is used in body-nested
1343 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1347 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1349 /* Replace '__' by '.'. */
1357 /* It's a character part of the decoded name, so just copy it
1359 decoded
[j
] = encoded
[i
];
1364 decoded
[j
] = '\000';
1366 /* Decoded names should never contain any uppercase character.
1367 Double-check this, and abort the decoding if we find one. */
1369 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1370 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1373 if (strcmp (decoded
, encoded
) == 0)
1379 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1380 decoded
= decoding_buffer
;
1381 if (encoded
[0] == '<')
1382 strcpy (decoded
, encoded
);
1384 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1389 /* Table for keeping permanent unique copies of decoded names. Once
1390 allocated, names in this table are never released. While this is a
1391 storage leak, it should not be significant unless there are massive
1392 changes in the set of decoded names in successive versions of a
1393 symbol table loaded during a single session. */
1394 static struct htab
*decoded_names_store
;
1396 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1397 in the language-specific part of GSYMBOL, if it has not been
1398 previously computed. Tries to save the decoded name in the same
1399 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1400 in any case, the decoded symbol has a lifetime at least that of
1402 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1403 const, but nevertheless modified to a semantically equivalent form
1404 when a decoded name is cached in it. */
1407 ada_decode_symbol (const struct general_symbol_info
*arg
)
1409 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1410 const char **resultp
=
1411 &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1413 if (!gsymbol
->ada_mangled
)
1415 const char *decoded
= ada_decode (gsymbol
->name
);
1416 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1418 gsymbol
->ada_mangled
= 1;
1420 if (obstack
!= NULL
)
1421 *resultp
= obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1424 /* Sometimes, we can't find a corresponding objfile, in
1425 which case, we put the result on the heap. Since we only
1426 decode when needed, we hope this usually does not cause a
1427 significant memory leak (FIXME). */
1429 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1433 *slot
= xstrdup (decoded
);
1442 ada_la_decode (const char *encoded
, int options
)
1444 return xstrdup (ada_decode (encoded
));
1447 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1448 suffixes that encode debugging information or leading _ada_ on
1449 SYM_NAME (see is_name_suffix commentary for the debugging
1450 information that is ignored). If WILD, then NAME need only match a
1451 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1452 either argument is NULL. */
1455 match_name (const char *sym_name
, const char *name
, int wild
)
1457 if (sym_name
== NULL
|| name
== NULL
)
1460 return wild_match (sym_name
, name
) == 0;
1463 int len_name
= strlen (name
);
1465 return (strncmp (sym_name
, name
, len_name
) == 0
1466 && is_name_suffix (sym_name
+ len_name
))
1467 || (strncmp (sym_name
, "_ada_", 5) == 0
1468 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1469 && is_name_suffix (sym_name
+ len_name
+ 5));
1476 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1477 generated by the GNAT compiler to describe the index type used
1478 for each dimension of an array, check whether it follows the latest
1479 known encoding. If not, fix it up to conform to the latest encoding.
1480 Otherwise, do nothing. This function also does nothing if
1481 INDEX_DESC_TYPE is NULL.
1483 The GNAT encoding used to describle the array index type evolved a bit.
1484 Initially, the information would be provided through the name of each
1485 field of the structure type only, while the type of these fields was
1486 described as unspecified and irrelevant. The debugger was then expected
1487 to perform a global type lookup using the name of that field in order
1488 to get access to the full index type description. Because these global
1489 lookups can be very expensive, the encoding was later enhanced to make
1490 the global lookup unnecessary by defining the field type as being
1491 the full index type description.
1493 The purpose of this routine is to allow us to support older versions
1494 of the compiler by detecting the use of the older encoding, and by
1495 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1496 we essentially replace each field's meaningless type by the associated
1500 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1504 if (index_desc_type
== NULL
)
1506 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1508 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1509 to check one field only, no need to check them all). If not, return
1512 If our INDEX_DESC_TYPE was generated using the older encoding,
1513 the field type should be a meaningless integer type whose name
1514 is not equal to the field name. */
1515 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1516 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1517 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1520 /* Fixup each field of INDEX_DESC_TYPE. */
1521 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1523 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1524 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1527 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1531 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1533 static char *bound_name
[] = {
1534 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1535 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1538 /* Maximum number of array dimensions we are prepared to handle. */
1540 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1543 /* The desc_* routines return primitive portions of array descriptors
1546 /* The descriptor or array type, if any, indicated by TYPE; removes
1547 level of indirection, if needed. */
1549 static struct type
*
1550 desc_base_type (struct type
*type
)
1554 type
= ada_check_typedef (type
);
1555 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1556 type
= ada_typedef_target_type (type
);
1559 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1560 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1561 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1566 /* True iff TYPE indicates a "thin" array pointer type. */
1569 is_thin_pntr (struct type
*type
)
1572 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1573 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1576 /* The descriptor type for thin pointer type TYPE. */
1578 static struct type
*
1579 thin_descriptor_type (struct type
*type
)
1581 struct type
*base_type
= desc_base_type (type
);
1583 if (base_type
== NULL
)
1585 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1589 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1591 if (alt_type
== NULL
)
1598 /* A pointer to the array data for thin-pointer value VAL. */
1600 static struct value
*
1601 thin_data_pntr (struct value
*val
)
1603 struct type
*type
= ada_check_typedef (value_type (val
));
1604 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1606 data_type
= lookup_pointer_type (data_type
);
1608 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1609 return value_cast (data_type
, value_copy (val
));
1611 return value_from_longest (data_type
, value_address (val
));
1614 /* True iff TYPE indicates a "thick" array pointer type. */
1617 is_thick_pntr (struct type
*type
)
1619 type
= desc_base_type (type
);
1620 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1621 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1624 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1625 pointer to one, the type of its bounds data; otherwise, NULL. */
1627 static struct type
*
1628 desc_bounds_type (struct type
*type
)
1632 type
= desc_base_type (type
);
1636 else if (is_thin_pntr (type
))
1638 type
= thin_descriptor_type (type
);
1641 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1643 return ada_check_typedef (r
);
1645 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1647 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1649 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1654 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1655 one, a pointer to its bounds data. Otherwise NULL. */
1657 static struct value
*
1658 desc_bounds (struct value
*arr
)
1660 struct type
*type
= ada_check_typedef (value_type (arr
));
1662 if (is_thin_pntr (type
))
1664 struct type
*bounds_type
=
1665 desc_bounds_type (thin_descriptor_type (type
));
1668 if (bounds_type
== NULL
)
1669 error (_("Bad GNAT array descriptor"));
1671 /* NOTE: The following calculation is not really kosher, but
1672 since desc_type is an XVE-encoded type (and shouldn't be),
1673 the correct calculation is a real pain. FIXME (and fix GCC). */
1674 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1675 addr
= value_as_long (arr
);
1677 addr
= value_address (arr
);
1680 value_from_longest (lookup_pointer_type (bounds_type
),
1681 addr
- TYPE_LENGTH (bounds_type
));
1684 else if (is_thick_pntr (type
))
1686 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1687 _("Bad GNAT array descriptor"));
1688 struct type
*p_bounds_type
= value_type (p_bounds
);
1691 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1693 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1695 if (TYPE_STUB (target_type
))
1696 p_bounds
= value_cast (lookup_pointer_type
1697 (ada_check_typedef (target_type
)),
1701 error (_("Bad GNAT array descriptor"));
1709 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1710 position of the field containing the address of the bounds data. */
1713 fat_pntr_bounds_bitpos (struct type
*type
)
1715 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1718 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1719 size of the field containing the address of the bounds data. */
1722 fat_pntr_bounds_bitsize (struct type
*type
)
1724 type
= desc_base_type (type
);
1726 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1727 return TYPE_FIELD_BITSIZE (type
, 1);
1729 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1732 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1733 pointer to one, the type of its array data (a array-with-no-bounds type);
1734 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1737 static struct type
*
1738 desc_data_target_type (struct type
*type
)
1740 type
= desc_base_type (type
);
1742 /* NOTE: The following is bogus; see comment in desc_bounds. */
1743 if (is_thin_pntr (type
))
1744 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1745 else if (is_thick_pntr (type
))
1747 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1750 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1751 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1757 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1760 static struct value
*
1761 desc_data (struct value
*arr
)
1763 struct type
*type
= value_type (arr
);
1765 if (is_thin_pntr (type
))
1766 return thin_data_pntr (arr
);
1767 else if (is_thick_pntr (type
))
1768 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1769 _("Bad GNAT array descriptor"));
1775 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1776 position of the field containing the address of the data. */
1779 fat_pntr_data_bitpos (struct type
*type
)
1781 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1784 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1785 size of the field containing the address of the data. */
1788 fat_pntr_data_bitsize (struct type
*type
)
1790 type
= desc_base_type (type
);
1792 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1793 return TYPE_FIELD_BITSIZE (type
, 0);
1795 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1798 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1799 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1800 bound, if WHICH is 1. The first bound is I=1. */
1802 static struct value
*
1803 desc_one_bound (struct value
*bounds
, int i
, int which
)
1805 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1806 _("Bad GNAT array descriptor bounds"));
1809 /* If BOUNDS is an array-bounds structure type, return the bit position
1810 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1811 bound, if WHICH is 1. The first bound is I=1. */
1814 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1816 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1819 /* If BOUNDS is an array-bounds structure type, return the bit field size
1820 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1821 bound, if WHICH is 1. The first bound is I=1. */
1824 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1826 type
= desc_base_type (type
);
1828 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1829 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1831 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1834 /* If TYPE is the type of an array-bounds structure, the type of its
1835 Ith bound (numbering from 1). Otherwise, NULL. */
1837 static struct type
*
1838 desc_index_type (struct type
*type
, int i
)
1840 type
= desc_base_type (type
);
1842 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1843 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1848 /* The number of index positions in the array-bounds type TYPE.
1849 Return 0 if TYPE is NULL. */
1852 desc_arity (struct type
*type
)
1854 type
= desc_base_type (type
);
1857 return TYPE_NFIELDS (type
) / 2;
1861 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1862 an array descriptor type (representing an unconstrained array
1866 ada_is_direct_array_type (struct type
*type
)
1870 type
= ada_check_typedef (type
);
1871 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1872 || ada_is_array_descriptor_type (type
));
1875 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1879 ada_is_array_type (struct type
*type
)
1882 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1883 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1884 type
= TYPE_TARGET_TYPE (type
);
1885 return ada_is_direct_array_type (type
);
1888 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1891 ada_is_simple_array_type (struct type
*type
)
1895 type
= ada_check_typedef (type
);
1896 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1897 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1898 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1899 == TYPE_CODE_ARRAY
));
1902 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1905 ada_is_array_descriptor_type (struct type
*type
)
1907 struct type
*data_type
= desc_data_target_type (type
);
1911 type
= ada_check_typedef (type
);
1912 return (data_type
!= NULL
1913 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1914 && desc_arity (desc_bounds_type (type
)) > 0);
1917 /* Non-zero iff type is a partially mal-formed GNAT array
1918 descriptor. FIXME: This is to compensate for some problems with
1919 debugging output from GNAT. Re-examine periodically to see if it
1923 ada_is_bogus_array_descriptor (struct type
*type
)
1927 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1928 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1929 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1930 && !ada_is_array_descriptor_type (type
);
1934 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1935 (fat pointer) returns the type of the array data described---specifically,
1936 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1937 in from the descriptor; otherwise, they are left unspecified. If
1938 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1939 returns NULL. The result is simply the type of ARR if ARR is not
1942 ada_type_of_array (struct value
*arr
, int bounds
)
1944 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1945 return decode_constrained_packed_array_type (value_type (arr
));
1947 if (!ada_is_array_descriptor_type (value_type (arr
)))
1948 return value_type (arr
);
1952 struct type
*array_type
=
1953 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1955 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1956 TYPE_FIELD_BITSIZE (array_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1963 struct type
*elt_type
;
1965 struct value
*descriptor
;
1967 elt_type
= ada_array_element_type (value_type (arr
), -1);
1968 arity
= ada_array_arity (value_type (arr
));
1970 if (elt_type
== NULL
|| arity
== 0)
1971 return ada_check_typedef (value_type (arr
));
1973 descriptor
= desc_bounds (arr
);
1974 if (value_as_long (descriptor
) == 0)
1978 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1979 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1980 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1981 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1984 create_static_range_type (range_type
, value_type (low
),
1985 longest_to_int (value_as_long (low
)),
1986 longest_to_int (value_as_long (high
)));
1987 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1989 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1991 /* We need to store the element packed bitsize, as well as
1992 recompute the array size, because it was previously
1993 computed based on the unpacked element size. */
1994 LONGEST lo
= value_as_long (low
);
1995 LONGEST hi
= value_as_long (high
);
1997 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1998 decode_packed_array_bitsize (value_type (arr
));
1999 /* If the array has no element, then the size is already
2000 zero, and does not need to be recomputed. */
2004 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2006 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2011 return lookup_pointer_type (elt_type
);
2015 /* If ARR does not represent an array, returns ARR unchanged.
2016 Otherwise, returns either a standard GDB array with bounds set
2017 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2018 GDB array. Returns NULL if ARR is a null fat pointer. */
2021 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2023 if (ada_is_array_descriptor_type (value_type (arr
)))
2025 struct type
*arrType
= ada_type_of_array (arr
, 1);
2027 if (arrType
== NULL
)
2029 return value_cast (arrType
, value_copy (desc_data (arr
)));
2031 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2032 return decode_constrained_packed_array (arr
);
2037 /* If ARR does not represent an array, returns ARR unchanged.
2038 Otherwise, returns a standard GDB array describing ARR (which may
2039 be ARR itself if it already is in the proper form). */
2042 ada_coerce_to_simple_array (struct value
*arr
)
2044 if (ada_is_array_descriptor_type (value_type (arr
)))
2046 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2049 error (_("Bounds unavailable for null array pointer."));
2050 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
2051 return value_ind (arrVal
);
2053 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2054 return decode_constrained_packed_array (arr
);
2059 /* If TYPE represents a GNAT array type, return it translated to an
2060 ordinary GDB array type (possibly with BITSIZE fields indicating
2061 packing). For other types, is the identity. */
2064 ada_coerce_to_simple_array_type (struct type
*type
)
2066 if (ada_is_constrained_packed_array_type (type
))
2067 return decode_constrained_packed_array_type (type
);
2069 if (ada_is_array_descriptor_type (type
))
2070 return ada_check_typedef (desc_data_target_type (type
));
2075 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2078 ada_is_packed_array_type (struct type
*type
)
2082 type
= desc_base_type (type
);
2083 type
= ada_check_typedef (type
);
2085 ada_type_name (type
) != NULL
2086 && strstr (ada_type_name (type
), "___XP") != NULL
;
2089 /* Non-zero iff TYPE represents a standard GNAT constrained
2090 packed-array type. */
2093 ada_is_constrained_packed_array_type (struct type
*type
)
2095 return ada_is_packed_array_type (type
)
2096 && !ada_is_array_descriptor_type (type
);
2099 /* Non-zero iff TYPE represents an array descriptor for a
2100 unconstrained packed-array type. */
2103 ada_is_unconstrained_packed_array_type (struct type
*type
)
2105 return ada_is_packed_array_type (type
)
2106 && ada_is_array_descriptor_type (type
);
2109 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2110 return the size of its elements in bits. */
2113 decode_packed_array_bitsize (struct type
*type
)
2115 const char *raw_name
;
2119 /* Access to arrays implemented as fat pointers are encoded as a typedef
2120 of the fat pointer type. We need the name of the fat pointer type
2121 to do the decoding, so strip the typedef layer. */
2122 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2123 type
= ada_typedef_target_type (type
);
2125 raw_name
= ada_type_name (ada_check_typedef (type
));
2127 raw_name
= ada_type_name (desc_base_type (type
));
2132 tail
= strstr (raw_name
, "___XP");
2133 gdb_assert (tail
!= NULL
);
2135 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2138 (_("could not understand bit size information on packed array"));
2145 /* Given that TYPE is a standard GDB array type with all bounds filled
2146 in, and that the element size of its ultimate scalar constituents
2147 (that is, either its elements, or, if it is an array of arrays, its
2148 elements' elements, etc.) is *ELT_BITS, return an identical type,
2149 but with the bit sizes of its elements (and those of any
2150 constituent arrays) recorded in the BITSIZE components of its
2151 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2154 static struct type
*
2155 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2157 struct type
*new_elt_type
;
2158 struct type
*new_type
;
2159 struct type
*index_type_desc
;
2160 struct type
*index_type
;
2161 LONGEST low_bound
, high_bound
;
2163 type
= ada_check_typedef (type
);
2164 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2167 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2168 if (index_type_desc
)
2169 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2172 index_type
= TYPE_INDEX_TYPE (type
);
2174 new_type
= alloc_type_copy (type
);
2176 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2178 create_array_type (new_type
, new_elt_type
, index_type
);
2179 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2180 TYPE_NAME (new_type
) = ada_type_name (type
);
2182 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2183 low_bound
= high_bound
= 0;
2184 if (high_bound
< low_bound
)
2185 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2188 *elt_bits
*= (high_bound
- low_bound
+ 1);
2189 TYPE_LENGTH (new_type
) =
2190 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2193 TYPE_FIXED_INSTANCE (new_type
) = 1;
2197 /* The array type encoded by TYPE, where
2198 ada_is_constrained_packed_array_type (TYPE). */
2200 static struct type
*
2201 decode_constrained_packed_array_type (struct type
*type
)
2203 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2206 struct type
*shadow_type
;
2210 raw_name
= ada_type_name (desc_base_type (type
));
2215 name
= (char *) alloca (strlen (raw_name
) + 1);
2216 tail
= strstr (raw_name
, "___XP");
2217 type
= desc_base_type (type
);
2219 memcpy (name
, raw_name
, tail
- raw_name
);
2220 name
[tail
- raw_name
] = '\000';
2222 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2224 if (shadow_type
== NULL
)
2226 lim_warning (_("could not find bounds information on packed array"));
2229 CHECK_TYPEDEF (shadow_type
);
2231 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2233 lim_warning (_("could not understand bounds "
2234 "information on packed array"));
2238 bits
= decode_packed_array_bitsize (type
);
2239 return constrained_packed_array_type (shadow_type
, &bits
);
2242 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2243 array, returns a simple array that denotes that array. Its type is a
2244 standard GDB array type except that the BITSIZEs of the array
2245 target types are set to the number of bits in each element, and the
2246 type length is set appropriately. */
2248 static struct value
*
2249 decode_constrained_packed_array (struct value
*arr
)
2253 /* If our value is a pointer, then dereference it. Likewise if
2254 the value is a reference. Make sure that this operation does not
2255 cause the target type to be fixed, as this would indirectly cause
2256 this array to be decoded. The rest of the routine assumes that
2257 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2258 and "value_ind" routines to perform the dereferencing, as opposed
2259 to using "ada_coerce_ref" or "ada_value_ind". */
2260 arr
= coerce_ref (arr
);
2261 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2262 arr
= value_ind (arr
);
2264 type
= decode_constrained_packed_array_type (value_type (arr
));
2267 error (_("can't unpack array"));
2271 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2272 && ada_is_modular_type (value_type (arr
)))
2274 /* This is a (right-justified) modular type representing a packed
2275 array with no wrapper. In order to interpret the value through
2276 the (left-justified) packed array type we just built, we must
2277 first left-justify it. */
2278 int bit_size
, bit_pos
;
2281 mod
= ada_modulus (value_type (arr
)) - 1;
2288 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2289 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2290 bit_pos
/ HOST_CHAR_BIT
,
2291 bit_pos
% HOST_CHAR_BIT
,
2296 return coerce_unspec_val_to_type (arr
, type
);
2300 /* The value of the element of packed array ARR at the ARITY indices
2301 given in IND. ARR must be a simple array. */
2303 static struct value
*
2304 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2307 int bits
, elt_off
, bit_off
;
2308 long elt_total_bit_offset
;
2309 struct type
*elt_type
;
2313 elt_total_bit_offset
= 0;
2314 elt_type
= ada_check_typedef (value_type (arr
));
2315 for (i
= 0; i
< arity
; i
+= 1)
2317 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2318 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2320 (_("attempt to do packed indexing of "
2321 "something other than a packed array"));
2324 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2325 LONGEST lowerbound
, upperbound
;
2328 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2330 lim_warning (_("don't know bounds of array"));
2331 lowerbound
= upperbound
= 0;
2334 idx
= pos_atr (ind
[i
]);
2335 if (idx
< lowerbound
|| idx
> upperbound
)
2336 lim_warning (_("packed array index %ld out of bounds"),
2338 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2339 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2340 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2343 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2344 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2346 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2351 /* Non-zero iff TYPE includes negative integer values. */
2354 has_negatives (struct type
*type
)
2356 switch (TYPE_CODE (type
))
2361 return !TYPE_UNSIGNED (type
);
2362 case TYPE_CODE_RANGE
:
2363 return TYPE_LOW_BOUND (type
) < 0;
2368 /* Create a new value of type TYPE from the contents of OBJ starting
2369 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2370 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2371 assigning through the result will set the field fetched from.
2372 VALADDR is ignored unless OBJ is NULL, in which case,
2373 VALADDR+OFFSET must address the start of storage containing the
2374 packed value. The value returned in this case is never an lval.
2375 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2378 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2379 long offset
, int bit_offset
, int bit_size
,
2383 int src
, /* Index into the source area */
2384 targ
, /* Index into the target area */
2385 srcBitsLeft
, /* Number of source bits left to move */
2386 nsrc
, ntarg
, /* Number of source and target bytes */
2387 unusedLS
, /* Number of bits in next significant
2388 byte of source that are unused */
2389 accumSize
; /* Number of meaningful bits in accum */
2390 unsigned char *bytes
; /* First byte containing data to unpack */
2391 unsigned char *unpacked
;
2392 unsigned long accum
; /* Staging area for bits being transferred */
2394 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2395 /* Transmit bytes from least to most significant; delta is the direction
2396 the indices move. */
2397 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2399 type
= ada_check_typedef (type
);
2403 v
= allocate_value (type
);
2404 bytes
= (unsigned char *) (valaddr
+ offset
);
2406 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2408 v
= value_at (type
, value_address (obj
));
2409 type
= value_type (v
);
2410 bytes
= (unsigned char *) alloca (len
);
2411 read_memory (value_address (v
) + offset
, bytes
, len
);
2415 v
= allocate_value (type
);
2416 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2421 long new_offset
= offset
;
2423 set_value_component_location (v
, obj
);
2424 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2425 set_value_bitsize (v
, bit_size
);
2426 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2429 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2431 set_value_offset (v
, new_offset
);
2433 /* Also set the parent value. This is needed when trying to
2434 assign a new value (in inferior memory). */
2435 set_value_parent (v
, obj
);
2438 set_value_bitsize (v
, bit_size
);
2439 unpacked
= (unsigned char *) value_contents (v
);
2441 srcBitsLeft
= bit_size
;
2443 ntarg
= TYPE_LENGTH (type
);
2447 memset (unpacked
, 0, TYPE_LENGTH (type
));
2450 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2453 if (has_negatives (type
)
2454 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2458 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2461 switch (TYPE_CODE (type
))
2463 case TYPE_CODE_ARRAY
:
2464 case TYPE_CODE_UNION
:
2465 case TYPE_CODE_STRUCT
:
2466 /* Non-scalar values must be aligned at a byte boundary... */
2468 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2469 /* ... And are placed at the beginning (most-significant) bytes
2471 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2476 targ
= TYPE_LENGTH (type
) - 1;
2482 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2485 unusedLS
= bit_offset
;
2488 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2495 /* Mask for removing bits of the next source byte that are not
2496 part of the value. */
2497 unsigned int unusedMSMask
=
2498 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2500 /* Sign-extend bits for this byte. */
2501 unsigned int signMask
= sign
& ~unusedMSMask
;
2504 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2505 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2506 if (accumSize
>= HOST_CHAR_BIT
)
2508 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2509 accumSize
-= HOST_CHAR_BIT
;
2510 accum
>>= HOST_CHAR_BIT
;
2514 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2521 accum
|= sign
<< accumSize
;
2522 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2523 accumSize
-= HOST_CHAR_BIT
;
2524 accum
>>= HOST_CHAR_BIT
;
2532 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2533 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2536 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2537 int src_offset
, int n
, int bits_big_endian_p
)
2539 unsigned int accum
, mask
;
2540 int accum_bits
, chunk_size
;
2542 target
+= targ_offset
/ HOST_CHAR_BIT
;
2543 targ_offset
%= HOST_CHAR_BIT
;
2544 source
+= src_offset
/ HOST_CHAR_BIT
;
2545 src_offset
%= HOST_CHAR_BIT
;
2546 if (bits_big_endian_p
)
2548 accum
= (unsigned char) *source
;
2550 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2556 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2557 accum_bits
+= HOST_CHAR_BIT
;
2559 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2562 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2563 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2566 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2568 accum_bits
-= chunk_size
;
2575 accum
= (unsigned char) *source
>> src_offset
;
2577 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2581 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2582 accum_bits
+= HOST_CHAR_BIT
;
2584 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2587 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2588 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2590 accum_bits
-= chunk_size
;
2591 accum
>>= chunk_size
;
2598 /* Store the contents of FROMVAL into the location of TOVAL.
2599 Return a new value with the location of TOVAL and contents of
2600 FROMVAL. Handles assignment into packed fields that have
2601 floating-point or non-scalar types. */
2603 static struct value
*
2604 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2606 struct type
*type
= value_type (toval
);
2607 int bits
= value_bitsize (toval
);
2609 toval
= ada_coerce_ref (toval
);
2610 fromval
= ada_coerce_ref (fromval
);
2612 if (ada_is_direct_array_type (value_type (toval
)))
2613 toval
= ada_coerce_to_simple_array (toval
);
2614 if (ada_is_direct_array_type (value_type (fromval
)))
2615 fromval
= ada_coerce_to_simple_array (fromval
);
2617 if (!deprecated_value_modifiable (toval
))
2618 error (_("Left operand of assignment is not a modifiable lvalue."));
2620 if (VALUE_LVAL (toval
) == lval_memory
2622 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2623 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2625 int len
= (value_bitpos (toval
)
2626 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2628 gdb_byte
*buffer
= alloca (len
);
2630 CORE_ADDR to_addr
= value_address (toval
);
2632 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2633 fromval
= value_cast (type
, fromval
);
2635 read_memory (to_addr
, buffer
, len
);
2636 from_size
= value_bitsize (fromval
);
2638 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2639 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2640 move_bits (buffer
, value_bitpos (toval
),
2641 value_contents (fromval
), from_size
- bits
, bits
, 1);
2643 move_bits (buffer
, value_bitpos (toval
),
2644 value_contents (fromval
), 0, bits
, 0);
2645 write_memory_with_notification (to_addr
, buffer
, len
);
2647 val
= value_copy (toval
);
2648 memcpy (value_contents_raw (val
), value_contents (fromval
),
2649 TYPE_LENGTH (type
));
2650 deprecated_set_value_type (val
, type
);
2655 return value_assign (toval
, fromval
);
2659 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2660 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2661 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2662 * COMPONENT, and not the inferior's memory. The current contents
2663 * of COMPONENT are ignored. */
2665 value_assign_to_component (struct value
*container
, struct value
*component
,
2668 LONGEST offset_in_container
=
2669 (LONGEST
) (value_address (component
) - value_address (container
));
2670 int bit_offset_in_container
=
2671 value_bitpos (component
) - value_bitpos (container
);
2674 val
= value_cast (value_type (component
), val
);
2676 if (value_bitsize (component
) == 0)
2677 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2679 bits
= value_bitsize (component
);
2681 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2682 move_bits (value_contents_writeable (container
) + offset_in_container
,
2683 value_bitpos (container
) + bit_offset_in_container
,
2684 value_contents (val
),
2685 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2688 move_bits (value_contents_writeable (container
) + offset_in_container
,
2689 value_bitpos (container
) + bit_offset_in_container
,
2690 value_contents (val
), 0, bits
, 0);
2693 /* The value of the element of array ARR at the ARITY indices given in IND.
2694 ARR may be either a simple array, GNAT array descriptor, or pointer
2698 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2702 struct type
*elt_type
;
2704 elt
= ada_coerce_to_simple_array (arr
);
2706 elt_type
= ada_check_typedef (value_type (elt
));
2707 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2708 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2709 return value_subscript_packed (elt
, arity
, ind
);
2711 for (k
= 0; k
< arity
; k
+= 1)
2713 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2714 error (_("too many subscripts (%d expected)"), k
);
2715 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2720 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2721 value of the element of *ARR at the ARITY indices given in
2722 IND. Does not read the entire array into memory. */
2724 static struct value
*
2725 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2730 for (k
= 0; k
< arity
; k
+= 1)
2734 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2735 error (_("too many subscripts (%d expected)"), k
);
2736 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2738 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2739 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2740 type
= TYPE_TARGET_TYPE (type
);
2743 return value_ind (arr
);
2746 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2747 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2748 elements starting at index LOW. The lower bound of this array is LOW, as
2750 static struct value
*
2751 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2754 struct type
*type0
= ada_check_typedef (type
);
2755 CORE_ADDR base
= value_as_address (array_ptr
)
2756 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2757 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2758 struct type
*index_type
2759 = create_static_range_type (NULL
,
2760 TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2762 struct type
*slice_type
=
2763 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2765 return value_at_lazy (slice_type
, base
);
2769 static struct value
*
2770 ada_value_slice (struct value
*array
, int low
, int high
)
2772 struct type
*type
= ada_check_typedef (value_type (array
));
2773 struct type
*index_type
2774 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2775 struct type
*slice_type
=
2776 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2778 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2781 /* If type is a record type in the form of a standard GNAT array
2782 descriptor, returns the number of dimensions for type. If arr is a
2783 simple array, returns the number of "array of"s that prefix its
2784 type designation. Otherwise, returns 0. */
2787 ada_array_arity (struct type
*type
)
2794 type
= desc_base_type (type
);
2797 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2798 return desc_arity (desc_bounds_type (type
));
2800 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2803 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2809 /* If TYPE is a record type in the form of a standard GNAT array
2810 descriptor or a simple array type, returns the element type for
2811 TYPE after indexing by NINDICES indices, or by all indices if
2812 NINDICES is -1. Otherwise, returns NULL. */
2815 ada_array_element_type (struct type
*type
, int nindices
)
2817 type
= desc_base_type (type
);
2819 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2822 struct type
*p_array_type
;
2824 p_array_type
= desc_data_target_type (type
);
2826 k
= ada_array_arity (type
);
2830 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2831 if (nindices
>= 0 && k
> nindices
)
2833 while (k
> 0 && p_array_type
!= NULL
)
2835 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2838 return p_array_type
;
2840 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2842 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2844 type
= TYPE_TARGET_TYPE (type
);
2853 /* The type of nth index in arrays of given type (n numbering from 1).
2854 Does not examine memory. Throws an error if N is invalid or TYPE
2855 is not an array type. NAME is the name of the Ada attribute being
2856 evaluated ('range, 'first, 'last, or 'length); it is used in building
2857 the error message. */
2859 static struct type
*
2860 ada_index_type (struct type
*type
, int n
, const char *name
)
2862 struct type
*result_type
;
2864 type
= desc_base_type (type
);
2866 if (n
< 0 || n
> ada_array_arity (type
))
2867 error (_("invalid dimension number to '%s"), name
);
2869 if (ada_is_simple_array_type (type
))
2873 for (i
= 1; i
< n
; i
+= 1)
2874 type
= TYPE_TARGET_TYPE (type
);
2875 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2876 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2877 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2878 perhaps stabsread.c would make more sense. */
2879 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2884 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2885 if (result_type
== NULL
)
2886 error (_("attempt to take bound of something that is not an array"));
2892 /* Given that arr is an array type, returns the lower bound of the
2893 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2894 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2895 array-descriptor type. It works for other arrays with bounds supplied
2896 by run-time quantities other than discriminants. */
2899 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2901 struct type
*type
, *index_type_desc
, *index_type
;
2904 gdb_assert (which
== 0 || which
== 1);
2906 if (ada_is_constrained_packed_array_type (arr_type
))
2907 arr_type
= decode_constrained_packed_array_type (arr_type
);
2909 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2910 return (LONGEST
) - which
;
2912 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2913 type
= TYPE_TARGET_TYPE (arr_type
);
2917 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2918 ada_fixup_array_indexes_type (index_type_desc
);
2919 if (index_type_desc
!= NULL
)
2920 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2924 struct type
*elt_type
= check_typedef (type
);
2926 for (i
= 1; i
< n
; i
++)
2927 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2929 index_type
= TYPE_INDEX_TYPE (elt_type
);
2933 (LONGEST
) (which
== 0
2934 ? ada_discrete_type_low_bound (index_type
)
2935 : ada_discrete_type_high_bound (index_type
));
2938 /* Given that arr is an array value, returns the lower bound of the
2939 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2940 WHICH is 1. This routine will also work for arrays with bounds
2941 supplied by run-time quantities other than discriminants. */
2944 ada_array_bound (struct value
*arr
, int n
, int which
)
2946 struct type
*arr_type
= value_type (arr
);
2948 if (ada_is_constrained_packed_array_type (arr_type
))
2949 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2950 else if (ada_is_simple_array_type (arr_type
))
2951 return ada_array_bound_from_type (arr_type
, n
, which
);
2953 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2956 /* Given that arr is an array value, returns the length of the
2957 nth index. This routine will also work for arrays with bounds
2958 supplied by run-time quantities other than discriminants.
2959 Does not work for arrays indexed by enumeration types with representation
2960 clauses at the moment. */
2963 ada_array_length (struct value
*arr
, int n
)
2965 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2967 if (ada_is_constrained_packed_array_type (arr_type
))
2968 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2970 if (ada_is_simple_array_type (arr_type
))
2971 return (ada_array_bound_from_type (arr_type
, n
, 1)
2972 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2974 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2975 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2978 /* An empty array whose type is that of ARR_TYPE (an array type),
2979 with bounds LOW to LOW-1. */
2981 static struct value
*
2982 empty_array (struct type
*arr_type
, int low
)
2984 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2985 struct type
*index_type
2986 = create_static_range_type
2987 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
, low
- 1);
2988 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2990 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2994 /* Name resolution */
2996 /* The "decoded" name for the user-definable Ada operator corresponding
3000 ada_decoded_op_name (enum exp_opcode op
)
3004 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3006 if (ada_opname_table
[i
].op
== op
)
3007 return ada_opname_table
[i
].decoded
;
3009 error (_("Could not find operator name for opcode"));
3013 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3014 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3015 undefined namespace) and converts operators that are
3016 user-defined into appropriate function calls. If CONTEXT_TYPE is
3017 non-null, it provides a preferred result type [at the moment, only
3018 type void has any effect---causing procedures to be preferred over
3019 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3020 return type is preferred. May change (expand) *EXP. */
3023 resolve (struct expression
**expp
, int void_context_p
)
3025 struct type
*context_type
= NULL
;
3029 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3031 resolve_subexp (expp
, &pc
, 1, context_type
);
3034 /* Resolve the operator of the subexpression beginning at
3035 position *POS of *EXPP. "Resolving" consists of replacing
3036 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3037 with their resolutions, replacing built-in operators with
3038 function calls to user-defined operators, where appropriate, and,
3039 when DEPROCEDURE_P is non-zero, converting function-valued variables
3040 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3041 are as in ada_resolve, above. */
3043 static struct value
*
3044 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3045 struct type
*context_type
)
3049 struct expression
*exp
; /* Convenience: == *expp. */
3050 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3051 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3052 int nargs
; /* Number of operands. */
3059 /* Pass one: resolve operands, saving their types and updating *pos,
3064 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3065 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3070 resolve_subexp (expp
, pos
, 0, NULL
);
3072 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3077 resolve_subexp (expp
, pos
, 0, NULL
);
3082 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3085 case OP_ATR_MODULUS
:
3095 case TERNOP_IN_RANGE
:
3096 case BINOP_IN_BOUNDS
:
3102 case OP_DISCRETE_RANGE
:
3104 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3113 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3115 resolve_subexp (expp
, pos
, 1, NULL
);
3117 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3134 case BINOP_LOGICAL_AND
:
3135 case BINOP_LOGICAL_OR
:
3136 case BINOP_BITWISE_AND
:
3137 case BINOP_BITWISE_IOR
:
3138 case BINOP_BITWISE_XOR
:
3141 case BINOP_NOTEQUAL
:
3148 case BINOP_SUBSCRIPT
:
3156 case UNOP_LOGICAL_NOT
:
3172 case OP_INTERNALVAR
:
3182 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3185 case STRUCTOP_STRUCT
:
3186 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3199 error (_("Unexpected operator during name resolution"));
3202 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3203 for (i
= 0; i
< nargs
; i
+= 1)
3204 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3208 /* Pass two: perform any resolution on principal operator. */
3215 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3217 struct ada_symbol_info
*candidates
;
3221 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3222 (exp
->elts
[pc
+ 2].symbol
),
3223 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3226 if (n_candidates
> 1)
3228 /* Types tend to get re-introduced locally, so if there
3229 are any local symbols that are not types, first filter
3232 for (j
= 0; j
< n_candidates
; j
+= 1)
3233 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3238 case LOC_REGPARM_ADDR
:
3246 if (j
< n_candidates
)
3249 while (j
< n_candidates
)
3251 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3253 candidates
[j
] = candidates
[n_candidates
- 1];
3262 if (n_candidates
== 0)
3263 error (_("No definition found for %s"),
3264 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3265 else if (n_candidates
== 1)
3267 else if (deprocedure_p
3268 && !is_nonfunction (candidates
, n_candidates
))
3270 i
= ada_resolve_function
3271 (candidates
, n_candidates
, NULL
, 0,
3272 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3275 error (_("Could not find a match for %s"),
3276 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3280 printf_filtered (_("Multiple matches for %s\n"),
3281 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3282 user_select_syms (candidates
, n_candidates
, 1);
3286 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3287 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3288 if (innermost_block
== NULL
3289 || contained_in (candidates
[i
].block
, innermost_block
))
3290 innermost_block
= candidates
[i
].block
;
3294 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3297 replace_operator_with_call (expp
, pc
, 0, 0,
3298 exp
->elts
[pc
+ 2].symbol
,
3299 exp
->elts
[pc
+ 1].block
);
3306 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3307 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3309 struct ada_symbol_info
*candidates
;
3313 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3314 (exp
->elts
[pc
+ 5].symbol
),
3315 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3317 if (n_candidates
== 1)
3321 i
= ada_resolve_function
3322 (candidates
, n_candidates
,
3324 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3327 error (_("Could not find a match for %s"),
3328 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3331 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3332 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3333 if (innermost_block
== NULL
3334 || contained_in (candidates
[i
].block
, innermost_block
))
3335 innermost_block
= candidates
[i
].block
;
3346 case BINOP_BITWISE_AND
:
3347 case BINOP_BITWISE_IOR
:
3348 case BINOP_BITWISE_XOR
:
3350 case BINOP_NOTEQUAL
:
3358 case UNOP_LOGICAL_NOT
:
3360 if (possible_user_operator_p (op
, argvec
))
3362 struct ada_symbol_info
*candidates
;
3366 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3367 (struct block
*) NULL
, VAR_DOMAIN
,
3369 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3370 ada_decoded_op_name (op
), NULL
);
3374 replace_operator_with_call (expp
, pc
, nargs
, 1,
3375 candidates
[i
].sym
, candidates
[i
].block
);
3386 return evaluate_subexp_type (exp
, pos
);
3389 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3390 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3392 /* The term "match" here is rather loose. The match is heuristic and
3396 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3398 ftype
= ada_check_typedef (ftype
);
3399 atype
= ada_check_typedef (atype
);
3401 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3402 ftype
= TYPE_TARGET_TYPE (ftype
);
3403 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3404 atype
= TYPE_TARGET_TYPE (atype
);
3406 switch (TYPE_CODE (ftype
))
3409 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3411 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3412 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3413 TYPE_TARGET_TYPE (atype
), 0);
3416 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3418 case TYPE_CODE_ENUM
:
3419 case TYPE_CODE_RANGE
:
3420 switch (TYPE_CODE (atype
))
3423 case TYPE_CODE_ENUM
:
3424 case TYPE_CODE_RANGE
:
3430 case TYPE_CODE_ARRAY
:
3431 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3432 || ada_is_array_descriptor_type (atype
));
3434 case TYPE_CODE_STRUCT
:
3435 if (ada_is_array_descriptor_type (ftype
))
3436 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3437 || ada_is_array_descriptor_type (atype
));
3439 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3440 && !ada_is_array_descriptor_type (atype
));
3442 case TYPE_CODE_UNION
:
3444 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3448 /* Return non-zero if the formals of FUNC "sufficiently match" the
3449 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3450 may also be an enumeral, in which case it is treated as a 0-
3451 argument function. */
3454 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3457 struct type
*func_type
= SYMBOL_TYPE (func
);
3459 if (SYMBOL_CLASS (func
) == LOC_CONST
3460 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3461 return (n_actuals
== 0);
3462 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3465 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3468 for (i
= 0; i
< n_actuals
; i
+= 1)
3470 if (actuals
[i
] == NULL
)
3474 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3476 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3478 if (!ada_type_match (ftype
, atype
, 1))
3485 /* False iff function type FUNC_TYPE definitely does not produce a value
3486 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3487 FUNC_TYPE is not a valid function type with a non-null return type
3488 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3491 return_match (struct type
*func_type
, struct type
*context_type
)
3493 struct type
*return_type
;
3495 if (func_type
== NULL
)
3498 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3499 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3501 return_type
= get_base_type (func_type
);
3502 if (return_type
== NULL
)
3505 context_type
= get_base_type (context_type
);
3507 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3508 return context_type
== NULL
|| return_type
== context_type
;
3509 else if (context_type
== NULL
)
3510 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3512 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3516 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3517 function (if any) that matches the types of the NARGS arguments in
3518 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3519 that returns that type, then eliminate matches that don't. If
3520 CONTEXT_TYPE is void and there is at least one match that does not
3521 return void, eliminate all matches that do.
3523 Asks the user if there is more than one match remaining. Returns -1
3524 if there is no such symbol or none is selected. NAME is used
3525 solely for messages. May re-arrange and modify SYMS in
3526 the process; the index returned is for the modified vector. */
3529 ada_resolve_function (struct ada_symbol_info syms
[],
3530 int nsyms
, struct value
**args
, int nargs
,
3531 const char *name
, struct type
*context_type
)
3535 int m
; /* Number of hits */
3538 /* In the first pass of the loop, we only accept functions matching
3539 context_type. If none are found, we add a second pass of the loop
3540 where every function is accepted. */
3541 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3543 for (k
= 0; k
< nsyms
; k
+= 1)
3545 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3547 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3548 && (fallback
|| return_match (type
, context_type
)))
3560 printf_filtered (_("Multiple matches for %s\n"), name
);
3561 user_select_syms (syms
, m
, 1);
3567 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3568 in a listing of choices during disambiguation (see sort_choices, below).
3569 The idea is that overloadings of a subprogram name from the
3570 same package should sort in their source order. We settle for ordering
3571 such symbols by their trailing number (__N or $N). */
3574 encoded_ordered_before (const char *N0
, const char *N1
)
3578 else if (N0
== NULL
)
3584 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3586 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3588 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3589 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3594 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3597 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3599 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3600 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3602 return (strcmp (N0
, N1
) < 0);
3606 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3610 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3614 for (i
= 1; i
< nsyms
; i
+= 1)
3616 struct ada_symbol_info sym
= syms
[i
];
3619 for (j
= i
- 1; j
>= 0; j
-= 1)
3621 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3622 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3624 syms
[j
+ 1] = syms
[j
];
3630 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3631 by asking the user (if necessary), returning the number selected,
3632 and setting the first elements of SYMS items. Error if no symbols
3635 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3636 to be re-integrated one of these days. */
3639 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3642 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3644 int first_choice
= (max_results
== 1) ? 1 : 2;
3645 const char *select_mode
= multiple_symbols_select_mode ();
3647 if (max_results
< 1)
3648 error (_("Request to select 0 symbols!"));
3652 if (select_mode
== multiple_symbols_cancel
)
3654 canceled because the command is ambiguous\n\
3655 See set/show multiple-symbol."));
3657 /* If select_mode is "all", then return all possible symbols.
3658 Only do that if more than one symbol can be selected, of course.
3659 Otherwise, display the menu as usual. */
3660 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3663 printf_unfiltered (_("[0] cancel\n"));
3664 if (max_results
> 1)
3665 printf_unfiltered (_("[1] all\n"));
3667 sort_choices (syms
, nsyms
);
3669 for (i
= 0; i
< nsyms
; i
+= 1)
3671 if (syms
[i
].sym
== NULL
)
3674 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3676 struct symtab_and_line sal
=
3677 find_function_start_sal (syms
[i
].sym
, 1);
3679 if (sal
.symtab
== NULL
)
3680 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3682 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3685 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3686 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3687 symtab_to_filename_for_display (sal
.symtab
),
3694 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3695 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3696 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3697 struct symtab
*symtab
= SYMBOL_SYMTAB (syms
[i
].sym
);
3699 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3700 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3702 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3703 symtab_to_filename_for_display (symtab
),
3704 SYMBOL_LINE (syms
[i
].sym
));
3705 else if (is_enumeral
3706 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3708 printf_unfiltered (("[%d] "), i
+ first_choice
);
3709 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3710 gdb_stdout
, -1, 0, &type_print_raw_options
);
3711 printf_unfiltered (_("'(%s) (enumeral)\n"),
3712 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3714 else if (symtab
!= NULL
)
3715 printf_unfiltered (is_enumeral
3716 ? _("[%d] %s in %s (enumeral)\n")
3717 : _("[%d] %s at %s:?\n"),
3719 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3720 symtab_to_filename_for_display (symtab
));
3722 printf_unfiltered (is_enumeral
3723 ? _("[%d] %s (enumeral)\n")
3724 : _("[%d] %s at ?\n"),
3726 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3730 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3733 for (i
= 0; i
< n_chosen
; i
+= 1)
3734 syms
[i
] = syms
[chosen
[i
]];
3739 /* Read and validate a set of numeric choices from the user in the
3740 range 0 .. N_CHOICES-1. Place the results in increasing
3741 order in CHOICES[0 .. N-1], and return N.
3743 The user types choices as a sequence of numbers on one line
3744 separated by blanks, encoding them as follows:
3746 + A choice of 0 means to cancel the selection, throwing an error.
3747 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3748 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3750 The user is not allowed to choose more than MAX_RESULTS values.
3752 ANNOTATION_SUFFIX, if present, is used to annotate the input
3753 prompts (for use with the -f switch). */
3756 get_selections (int *choices
, int n_choices
, int max_results
,
3757 int is_all_choice
, char *annotation_suffix
)
3762 int first_choice
= is_all_choice
? 2 : 1;
3764 prompt
= getenv ("PS2");
3768 args
= command_line_input (prompt
, 0, annotation_suffix
);
3771 error_no_arg (_("one or more choice numbers"));
3775 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3776 order, as given in args. Choices are validated. */
3782 args
= skip_spaces (args
);
3783 if (*args
== '\0' && n_chosen
== 0)
3784 error_no_arg (_("one or more choice numbers"));
3785 else if (*args
== '\0')
3788 choice
= strtol (args
, &args2
, 10);
3789 if (args
== args2
|| choice
< 0
3790 || choice
> n_choices
+ first_choice
- 1)
3791 error (_("Argument must be choice number"));
3795 error (_("cancelled"));
3797 if (choice
< first_choice
)
3799 n_chosen
= n_choices
;
3800 for (j
= 0; j
< n_choices
; j
+= 1)
3804 choice
-= first_choice
;
3806 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3810 if (j
< 0 || choice
!= choices
[j
])
3814 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3815 choices
[k
+ 1] = choices
[k
];
3816 choices
[j
+ 1] = choice
;
3821 if (n_chosen
> max_results
)
3822 error (_("Select no more than %d of the above"), max_results
);
3827 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3828 on the function identified by SYM and BLOCK, and taking NARGS
3829 arguments. Update *EXPP as needed to hold more space. */
3832 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3833 int oplen
, struct symbol
*sym
,
3834 const struct block
*block
)
3836 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3837 symbol, -oplen for operator being replaced). */
3838 struct expression
*newexp
= (struct expression
*)
3839 xzalloc (sizeof (struct expression
)
3840 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3841 struct expression
*exp
= *expp
;
3843 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3844 newexp
->language_defn
= exp
->language_defn
;
3845 newexp
->gdbarch
= exp
->gdbarch
;
3846 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3847 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3848 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3850 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3851 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3853 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3854 newexp
->elts
[pc
+ 4].block
= block
;
3855 newexp
->elts
[pc
+ 5].symbol
= sym
;
3861 /* Type-class predicates */
3863 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3867 numeric_type_p (struct type
*type
)
3873 switch (TYPE_CODE (type
))
3878 case TYPE_CODE_RANGE
:
3879 return (type
== TYPE_TARGET_TYPE (type
)
3880 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3887 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3890 integer_type_p (struct type
*type
)
3896 switch (TYPE_CODE (type
))
3900 case TYPE_CODE_RANGE
:
3901 return (type
== TYPE_TARGET_TYPE (type
)
3902 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3909 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3912 scalar_type_p (struct type
*type
)
3918 switch (TYPE_CODE (type
))
3921 case TYPE_CODE_RANGE
:
3922 case TYPE_CODE_ENUM
:
3931 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3934 discrete_type_p (struct type
*type
)
3940 switch (TYPE_CODE (type
))
3943 case TYPE_CODE_RANGE
:
3944 case TYPE_CODE_ENUM
:
3945 case TYPE_CODE_BOOL
:
3953 /* Returns non-zero if OP with operands in the vector ARGS could be
3954 a user-defined function. Errs on the side of pre-defined operators
3955 (i.e., result 0). */
3958 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3960 struct type
*type0
=
3961 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3962 struct type
*type1
=
3963 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3977 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3981 case BINOP_BITWISE_AND
:
3982 case BINOP_BITWISE_IOR
:
3983 case BINOP_BITWISE_XOR
:
3984 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3987 case BINOP_NOTEQUAL
:
3992 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3995 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3998 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4002 case UNOP_LOGICAL_NOT
:
4004 return (!numeric_type_p (type0
));
4013 1. In the following, we assume that a renaming type's name may
4014 have an ___XD suffix. It would be nice if this went away at some
4016 2. We handle both the (old) purely type-based representation of
4017 renamings and the (new) variable-based encoding. At some point,
4018 it is devoutly to be hoped that the former goes away
4019 (FIXME: hilfinger-2007-07-09).
4020 3. Subprogram renamings are not implemented, although the XRS
4021 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4023 /* If SYM encodes a renaming,
4025 <renaming> renames <renamed entity>,
4027 sets *LEN to the length of the renamed entity's name,
4028 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4029 the string describing the subcomponent selected from the renamed
4030 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4031 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4032 are undefined). Otherwise, returns a value indicating the category
4033 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4034 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4035 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4036 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4037 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4038 may be NULL, in which case they are not assigned.
4040 [Currently, however, GCC does not generate subprogram renamings.] */
4042 enum ada_renaming_category
4043 ada_parse_renaming (struct symbol
*sym
,
4044 const char **renamed_entity
, int *len
,
4045 const char **renaming_expr
)
4047 enum ada_renaming_category kind
;
4052 return ADA_NOT_RENAMING
;
4053 switch (SYMBOL_CLASS (sym
))
4056 return ADA_NOT_RENAMING
;
4058 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4059 renamed_entity
, len
, renaming_expr
);
4063 case LOC_OPTIMIZED_OUT
:
4064 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4066 return ADA_NOT_RENAMING
;
4070 kind
= ADA_OBJECT_RENAMING
;
4074 kind
= ADA_EXCEPTION_RENAMING
;
4078 kind
= ADA_PACKAGE_RENAMING
;
4082 kind
= ADA_SUBPROGRAM_RENAMING
;
4086 return ADA_NOT_RENAMING
;
4090 if (renamed_entity
!= NULL
)
4091 *renamed_entity
= info
;
4092 suffix
= strstr (info
, "___XE");
4093 if (suffix
== NULL
|| suffix
== info
)
4094 return ADA_NOT_RENAMING
;
4096 *len
= strlen (info
) - strlen (suffix
);
4098 if (renaming_expr
!= NULL
)
4099 *renaming_expr
= suffix
;
4103 /* Assuming TYPE encodes a renaming according to the old encoding in
4104 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4105 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4106 ADA_NOT_RENAMING otherwise. */
4107 static enum ada_renaming_category
4108 parse_old_style_renaming (struct type
*type
,
4109 const char **renamed_entity
, int *len
,
4110 const char **renaming_expr
)
4112 enum ada_renaming_category kind
;
4117 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4118 || TYPE_NFIELDS (type
) != 1)
4119 return ADA_NOT_RENAMING
;
4121 name
= type_name_no_tag (type
);
4123 return ADA_NOT_RENAMING
;
4125 name
= strstr (name
, "___XR");
4127 return ADA_NOT_RENAMING
;
4132 kind
= ADA_OBJECT_RENAMING
;
4135 kind
= ADA_EXCEPTION_RENAMING
;
4138 kind
= ADA_PACKAGE_RENAMING
;
4141 kind
= ADA_SUBPROGRAM_RENAMING
;
4144 return ADA_NOT_RENAMING
;
4147 info
= TYPE_FIELD_NAME (type
, 0);
4149 return ADA_NOT_RENAMING
;
4150 if (renamed_entity
!= NULL
)
4151 *renamed_entity
= info
;
4152 suffix
= strstr (info
, "___XE");
4153 if (renaming_expr
!= NULL
)
4154 *renaming_expr
= suffix
+ 5;
4155 if (suffix
== NULL
|| suffix
== info
)
4156 return ADA_NOT_RENAMING
;
4158 *len
= suffix
- info
;
4162 /* Compute the value of the given RENAMING_SYM, which is expected to
4163 be a symbol encoding a renaming expression. BLOCK is the block
4164 used to evaluate the renaming. */
4166 static struct value
*
4167 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4168 struct block
*block
)
4170 const char *sym_name
;
4171 struct expression
*expr
;
4172 struct value
*value
;
4173 struct cleanup
*old_chain
= NULL
;
4175 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4176 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4177 old_chain
= make_cleanup (free_current_contents
, &expr
);
4178 value
= evaluate_expression (expr
);
4180 do_cleanups (old_chain
);
4185 /* Evaluation: Function Calls */
4187 /* Return an lvalue containing the value VAL. This is the identity on
4188 lvalues, and otherwise has the side-effect of allocating memory
4189 in the inferior where a copy of the value contents is copied. */
4191 static struct value
*
4192 ensure_lval (struct value
*val
)
4194 if (VALUE_LVAL (val
) == not_lval
4195 || VALUE_LVAL (val
) == lval_internalvar
)
4197 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4198 const CORE_ADDR addr
=
4199 value_as_long (value_allocate_space_in_inferior (len
));
4201 set_value_address (val
, addr
);
4202 VALUE_LVAL (val
) = lval_memory
;
4203 write_memory (addr
, value_contents (val
), len
);
4209 /* Return the value ACTUAL, converted to be an appropriate value for a
4210 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4211 allocating any necessary descriptors (fat pointers), or copies of
4212 values not residing in memory, updating it as needed. */
4215 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4217 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4218 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4219 struct type
*formal_target
=
4220 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4221 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4222 struct type
*actual_target
=
4223 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4224 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4226 if (ada_is_array_descriptor_type (formal_target
)
4227 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4228 return make_array_descriptor (formal_type
, actual
);
4229 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4230 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4232 struct value
*result
;
4234 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4235 && ada_is_array_descriptor_type (actual_target
))
4236 result
= desc_data (actual
);
4237 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4239 if (VALUE_LVAL (actual
) != lval_memory
)
4243 actual_type
= ada_check_typedef (value_type (actual
));
4244 val
= allocate_value (actual_type
);
4245 memcpy ((char *) value_contents_raw (val
),
4246 (char *) value_contents (actual
),
4247 TYPE_LENGTH (actual_type
));
4248 actual
= ensure_lval (val
);
4250 result
= value_addr (actual
);
4254 return value_cast_pointers (formal_type
, result
, 0);
4256 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4257 return ada_value_ind (actual
);
4262 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4263 type TYPE. This is usually an inefficient no-op except on some targets
4264 (such as AVR) where the representation of a pointer and an address
4268 value_pointer (struct value
*value
, struct type
*type
)
4270 struct gdbarch
*gdbarch
= get_type_arch (type
);
4271 unsigned len
= TYPE_LENGTH (type
);
4272 gdb_byte
*buf
= alloca (len
);
4275 addr
= value_address (value
);
4276 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4277 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4282 /* Push a descriptor of type TYPE for array value ARR on the stack at
4283 *SP, updating *SP to reflect the new descriptor. Return either
4284 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4285 to-descriptor type rather than a descriptor type), a struct value *
4286 representing a pointer to this descriptor. */
4288 static struct value
*
4289 make_array_descriptor (struct type
*type
, struct value
*arr
)
4291 struct type
*bounds_type
= desc_bounds_type (type
);
4292 struct type
*desc_type
= desc_base_type (type
);
4293 struct value
*descriptor
= allocate_value (desc_type
);
4294 struct value
*bounds
= allocate_value (bounds_type
);
4297 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4300 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4301 ada_array_bound (arr
, i
, 0),
4302 desc_bound_bitpos (bounds_type
, i
, 0),
4303 desc_bound_bitsize (bounds_type
, i
, 0));
4304 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4305 ada_array_bound (arr
, i
, 1),
4306 desc_bound_bitpos (bounds_type
, i
, 1),
4307 desc_bound_bitsize (bounds_type
, i
, 1));
4310 bounds
= ensure_lval (bounds
);
4312 modify_field (value_type (descriptor
),
4313 value_contents_writeable (descriptor
),
4314 value_pointer (ensure_lval (arr
),
4315 TYPE_FIELD_TYPE (desc_type
, 0)),
4316 fat_pntr_data_bitpos (desc_type
),
4317 fat_pntr_data_bitsize (desc_type
));
4319 modify_field (value_type (descriptor
),
4320 value_contents_writeable (descriptor
),
4321 value_pointer (bounds
,
4322 TYPE_FIELD_TYPE (desc_type
, 1)),
4323 fat_pntr_bounds_bitpos (desc_type
),
4324 fat_pntr_bounds_bitsize (desc_type
));
4326 descriptor
= ensure_lval (descriptor
);
4328 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4329 return value_addr (descriptor
);
4334 /* Symbol Cache Module */
4336 /* Performance measurements made as of 2010-01-15 indicate that
4337 this cache does bring some noticeable improvements. Depending
4338 on the type of entity being printed, the cache can make it as much
4339 as an order of magnitude faster than without it.
4341 The descriptive type DWARF extension has significantly reduced
4342 the need for this cache, at least when DWARF is being used. However,
4343 even in this case, some expensive name-based symbol searches are still
4344 sometimes necessary - to find an XVZ variable, mostly. */
4346 /* Initialize the contents of SYM_CACHE. */
4349 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4351 obstack_init (&sym_cache
->cache_space
);
4352 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4355 /* Free the memory used by SYM_CACHE. */
4358 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4360 obstack_free (&sym_cache
->cache_space
, NULL
);
4364 /* Return the symbol cache associated to the given program space PSPACE.
4365 If not allocated for this PSPACE yet, allocate and initialize one. */
4367 static struct ada_symbol_cache
*
4368 ada_get_symbol_cache (struct program_space
*pspace
)
4370 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4371 struct ada_symbol_cache
*sym_cache
= pspace_data
->sym_cache
;
4373 if (sym_cache
== NULL
)
4375 sym_cache
= XCNEW (struct ada_symbol_cache
);
4376 ada_init_symbol_cache (sym_cache
);
4382 /* Clear all entries from the symbol cache. */
4385 ada_clear_symbol_cache (void)
4387 struct ada_symbol_cache
*sym_cache
4388 = ada_get_symbol_cache (current_program_space
);
4390 obstack_free (&sym_cache
->cache_space
, NULL
);
4391 ada_init_symbol_cache (sym_cache
);
4394 /* Search our cache for an entry matching NAME and NAMESPACE.
4395 Return it if found, or NULL otherwise. */
4397 static struct cache_entry
**
4398 find_entry (const char *name
, domain_enum
namespace)
4400 struct ada_symbol_cache
*sym_cache
4401 = ada_get_symbol_cache (current_program_space
);
4402 int h
= msymbol_hash (name
) % HASH_SIZE
;
4403 struct cache_entry
**e
;
4405 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4407 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
4413 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4414 Return 1 if found, 0 otherwise.
4416 If an entry was found and SYM is not NULL, set *SYM to the entry's
4417 SYM. Same principle for BLOCK if not NULL. */
4420 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4421 struct symbol
**sym
, const struct block
**block
)
4423 struct cache_entry
**e
= find_entry (name
, namespace);
4430 *block
= (*e
)->block
;
4434 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4435 in domain NAMESPACE, save this result in our symbol cache. */
4438 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4439 const struct block
*block
)
4441 struct ada_symbol_cache
*sym_cache
4442 = ada_get_symbol_cache (current_program_space
);
4445 struct cache_entry
*e
;
4447 /* If the symbol is a local symbol, then do not cache it, as a search
4448 for that symbol depends on the context. To determine whether
4449 the symbol is local or not, we check the block where we found it
4450 against the global and static blocks of its associated symtab. */
4452 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), GLOBAL_BLOCK
) != block
4453 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), STATIC_BLOCK
) != block
)
4456 h
= msymbol_hash (name
) % HASH_SIZE
;
4457 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4459 e
->next
= sym_cache
->root
[h
];
4460 sym_cache
->root
[h
] = e
;
4461 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4462 strcpy (copy
, name
);
4464 e
->namespace = namespace;
4470 /* Return nonzero if wild matching should be used when searching for
4471 all symbols matching LOOKUP_NAME.
4473 LOOKUP_NAME is expected to be a symbol name after transformation
4474 for Ada lookups (see ada_name_for_lookup). */
4477 should_use_wild_match (const char *lookup_name
)
4479 return (strstr (lookup_name
, "__") == NULL
);
4482 /* Return the result of a standard (literal, C-like) lookup of NAME in
4483 given DOMAIN, visible from lexical block BLOCK. */
4485 static struct symbol
*
4486 standard_lookup (const char *name
, const struct block
*block
,
4489 /* Initialize it just to avoid a GCC false warning. */
4490 struct symbol
*sym
= NULL
;
4492 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4494 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4495 cache_symbol (name
, domain
, sym
, block_found
);
4500 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4501 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4502 since they contend in overloading in the same way. */
4504 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4508 for (i
= 0; i
< n
; i
+= 1)
4509 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4510 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4511 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4517 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4518 struct types. Otherwise, they may not. */
4521 equiv_types (struct type
*type0
, struct type
*type1
)
4525 if (type0
== NULL
|| type1
== NULL
4526 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4528 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4529 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4530 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4531 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4537 /* True iff SYM0 represents the same entity as SYM1, or one that is
4538 no more defined than that of SYM1. */
4541 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4545 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4546 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4549 switch (SYMBOL_CLASS (sym0
))
4555 struct type
*type0
= SYMBOL_TYPE (sym0
);
4556 struct type
*type1
= SYMBOL_TYPE (sym1
);
4557 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4558 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4559 int len0
= strlen (name0
);
4562 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4563 && (equiv_types (type0
, type1
)
4564 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4565 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4568 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4569 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4575 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4576 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4579 add_defn_to_vec (struct obstack
*obstackp
,
4581 const struct block
*block
)
4584 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4586 /* Do not try to complete stub types, as the debugger is probably
4587 already scanning all symbols matching a certain name at the
4588 time when this function is called. Trying to replace the stub
4589 type by its associated full type will cause us to restart a scan
4590 which may lead to an infinite recursion. Instead, the client
4591 collecting the matching symbols will end up collecting several
4592 matches, with at least one of them complete. It can then filter
4593 out the stub ones if needed. */
4595 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4597 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4599 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4601 prevDefns
[i
].sym
= sym
;
4602 prevDefns
[i
].block
= block
;
4608 struct ada_symbol_info info
;
4612 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4616 /* Number of ada_symbol_info structures currently collected in
4617 current vector in *OBSTACKP. */
4620 num_defns_collected (struct obstack
*obstackp
)
4622 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4625 /* Vector of ada_symbol_info structures currently collected in current
4626 vector in *OBSTACKP. If FINISH, close off the vector and return
4627 its final address. */
4629 static struct ada_symbol_info
*
4630 defns_collected (struct obstack
*obstackp
, int finish
)
4633 return obstack_finish (obstackp
);
4635 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4638 /* Return a bound minimal symbol matching NAME according to Ada
4639 decoding rules. Returns an invalid symbol if there is no such
4640 minimal symbol. Names prefixed with "standard__" are handled
4641 specially: "standard__" is first stripped off, and only static and
4642 global symbols are searched. */
4644 struct bound_minimal_symbol
4645 ada_lookup_simple_minsym (const char *name
)
4647 struct bound_minimal_symbol result
;
4648 struct objfile
*objfile
;
4649 struct minimal_symbol
*msymbol
;
4650 const int wild_match_p
= should_use_wild_match (name
);
4652 memset (&result
, 0, sizeof (result
));
4654 /* Special case: If the user specifies a symbol name inside package
4655 Standard, do a non-wild matching of the symbol name without
4656 the "standard__" prefix. This was primarily introduced in order
4657 to allow the user to specifically access the standard exceptions
4658 using, for instance, Standard.Constraint_Error when Constraint_Error
4659 is ambiguous (due to the user defining its own Constraint_Error
4660 entity inside its program). */
4661 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4662 name
+= sizeof ("standard__") - 1;
4664 ALL_MSYMBOLS (objfile
, msymbol
)
4666 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4667 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4669 result
.minsym
= msymbol
;
4670 result
.objfile
= objfile
;
4678 /* For all subprograms that statically enclose the subprogram of the
4679 selected frame, add symbols matching identifier NAME in DOMAIN
4680 and their blocks to the list of data in OBSTACKP, as for
4681 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4682 with a wildcard prefix. */
4685 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4686 const char *name
, domain_enum
namespace,
4691 /* True if TYPE is definitely an artificial type supplied to a symbol
4692 for which no debugging information was given in the symbol file. */
4695 is_nondebugging_type (struct type
*type
)
4697 const char *name
= ada_type_name (type
);
4699 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4702 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4703 that are deemed "identical" for practical purposes.
4705 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4706 types and that their number of enumerals is identical (in other
4707 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4710 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4714 /* The heuristic we use here is fairly conservative. We consider
4715 that 2 enumerate types are identical if they have the same
4716 number of enumerals and that all enumerals have the same
4717 underlying value and name. */
4719 /* All enums in the type should have an identical underlying value. */
4720 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4721 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4724 /* All enumerals should also have the same name (modulo any numerical
4726 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4728 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4729 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4730 int len_1
= strlen (name_1
);
4731 int len_2
= strlen (name_2
);
4733 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4734 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4736 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4737 TYPE_FIELD_NAME (type2
, i
),
4745 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4746 that are deemed "identical" for practical purposes. Sometimes,
4747 enumerals are not strictly identical, but their types are so similar
4748 that they can be considered identical.
4750 For instance, consider the following code:
4752 type Color is (Black, Red, Green, Blue, White);
4753 type RGB_Color is new Color range Red .. Blue;
4755 Type RGB_Color is a subrange of an implicit type which is a copy
4756 of type Color. If we call that implicit type RGB_ColorB ("B" is
4757 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4758 As a result, when an expression references any of the enumeral
4759 by name (Eg. "print green"), the expression is technically
4760 ambiguous and the user should be asked to disambiguate. But
4761 doing so would only hinder the user, since it wouldn't matter
4762 what choice he makes, the outcome would always be the same.
4763 So, for practical purposes, we consider them as the same. */
4766 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4770 /* Before performing a thorough comparison check of each type,
4771 we perform a series of inexpensive checks. We expect that these
4772 checks will quickly fail in the vast majority of cases, and thus
4773 help prevent the unnecessary use of a more expensive comparison.
4774 Said comparison also expects us to make some of these checks
4775 (see ada_identical_enum_types_p). */
4777 /* Quick check: All symbols should have an enum type. */
4778 for (i
= 0; i
< nsyms
; i
++)
4779 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4782 /* Quick check: They should all have the same value. */
4783 for (i
= 1; i
< nsyms
; i
++)
4784 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4787 /* Quick check: They should all have the same number of enumerals. */
4788 for (i
= 1; i
< nsyms
; i
++)
4789 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4790 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4793 /* All the sanity checks passed, so we might have a set of
4794 identical enumeration types. Perform a more complete
4795 comparison of the type of each symbol. */
4796 for (i
= 1; i
< nsyms
; i
++)
4797 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4798 SYMBOL_TYPE (syms
[0].sym
)))
4804 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4805 duplicate other symbols in the list (The only case I know of where
4806 this happens is when object files containing stabs-in-ecoff are
4807 linked with files containing ordinary ecoff debugging symbols (or no
4808 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4809 Returns the number of items in the modified list. */
4812 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4816 /* We should never be called with less than 2 symbols, as there
4817 cannot be any extra symbol in that case. But it's easy to
4818 handle, since we have nothing to do in that case. */
4827 /* If two symbols have the same name and one of them is a stub type,
4828 the get rid of the stub. */
4830 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4831 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4833 for (j
= 0; j
< nsyms
; j
++)
4836 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4837 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4838 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4839 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4844 /* Two symbols with the same name, same class and same address
4845 should be identical. */
4847 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4848 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4849 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4851 for (j
= 0; j
< nsyms
; j
+= 1)
4854 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4855 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4856 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4857 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4858 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4859 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4866 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4867 syms
[j
- 1] = syms
[j
];
4874 /* If all the remaining symbols are identical enumerals, then
4875 just keep the first one and discard the rest.
4877 Unlike what we did previously, we do not discard any entry
4878 unless they are ALL identical. This is because the symbol
4879 comparison is not a strict comparison, but rather a practical
4880 comparison. If all symbols are considered identical, then
4881 we can just go ahead and use the first one and discard the rest.
4882 But if we cannot reduce the list to a single element, we have
4883 to ask the user to disambiguate anyways. And if we have to
4884 present a multiple-choice menu, it's less confusing if the list
4885 isn't missing some choices that were identical and yet distinct. */
4886 if (symbols_are_identical_enums (syms
, nsyms
))
4892 /* Given a type that corresponds to a renaming entity, use the type name
4893 to extract the scope (package name or function name, fully qualified,
4894 and following the GNAT encoding convention) where this renaming has been
4895 defined. The string returned needs to be deallocated after use. */
4898 xget_renaming_scope (struct type
*renaming_type
)
4900 /* The renaming types adhere to the following convention:
4901 <scope>__<rename>___<XR extension>.
4902 So, to extract the scope, we search for the "___XR" extension,
4903 and then backtrack until we find the first "__". */
4905 const char *name
= type_name_no_tag (renaming_type
);
4906 char *suffix
= strstr (name
, "___XR");
4911 /* Now, backtrack a bit until we find the first "__". Start looking
4912 at suffix - 3, as the <rename> part is at least one character long. */
4914 for (last
= suffix
- 3; last
> name
; last
--)
4915 if (last
[0] == '_' && last
[1] == '_')
4918 /* Make a copy of scope and return it. */
4920 scope_len
= last
- name
;
4921 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4923 strncpy (scope
, name
, scope_len
);
4924 scope
[scope_len
] = '\0';
4929 /* Return nonzero if NAME corresponds to a package name. */
4932 is_package_name (const char *name
)
4934 /* Here, We take advantage of the fact that no symbols are generated
4935 for packages, while symbols are generated for each function.
4936 So the condition for NAME represent a package becomes equivalent
4937 to NAME not existing in our list of symbols. There is only one
4938 small complication with library-level functions (see below). */
4942 /* If it is a function that has not been defined at library level,
4943 then we should be able to look it up in the symbols. */
4944 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4947 /* Library-level function names start with "_ada_". See if function
4948 "_ada_" followed by NAME can be found. */
4950 /* Do a quick check that NAME does not contain "__", since library-level
4951 functions names cannot contain "__" in them. */
4952 if (strstr (name
, "__") != NULL
)
4955 fun_name
= xstrprintf ("_ada_%s", name
);
4957 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4960 /* Return nonzero if SYM corresponds to a renaming entity that is
4961 not visible from FUNCTION_NAME. */
4964 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4967 struct cleanup
*old_chain
;
4969 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4972 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4973 old_chain
= make_cleanup (xfree
, scope
);
4975 /* If the rename has been defined in a package, then it is visible. */
4976 if (is_package_name (scope
))
4978 do_cleanups (old_chain
);
4982 /* Check that the rename is in the current function scope by checking
4983 that its name starts with SCOPE. */
4985 /* If the function name starts with "_ada_", it means that it is
4986 a library-level function. Strip this prefix before doing the
4987 comparison, as the encoding for the renaming does not contain
4989 if (strncmp (function_name
, "_ada_", 5) == 0)
4993 int is_invisible
= strncmp (function_name
, scope
, strlen (scope
)) != 0;
4995 do_cleanups (old_chain
);
4996 return is_invisible
;
5000 /* Remove entries from SYMS that corresponds to a renaming entity that
5001 is not visible from the function associated with CURRENT_BLOCK or
5002 that is superfluous due to the presence of more specific renaming
5003 information. Places surviving symbols in the initial entries of
5004 SYMS and returns the number of surviving symbols.
5007 First, in cases where an object renaming is implemented as a
5008 reference variable, GNAT may produce both the actual reference
5009 variable and the renaming encoding. In this case, we discard the
5012 Second, GNAT emits a type following a specified encoding for each renaming
5013 entity. Unfortunately, STABS currently does not support the definition
5014 of types that are local to a given lexical block, so all renamings types
5015 are emitted at library level. As a consequence, if an application
5016 contains two renaming entities using the same name, and a user tries to
5017 print the value of one of these entities, the result of the ada symbol
5018 lookup will also contain the wrong renaming type.
5020 This function partially covers for this limitation by attempting to
5021 remove from the SYMS list renaming symbols that should be visible
5022 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5023 method with the current information available. The implementation
5024 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5026 - When the user tries to print a rename in a function while there
5027 is another rename entity defined in a package: Normally, the
5028 rename in the function has precedence over the rename in the
5029 package, so the latter should be removed from the list. This is
5030 currently not the case.
5032 - This function will incorrectly remove valid renames if
5033 the CURRENT_BLOCK corresponds to a function which symbol name
5034 has been changed by an "Export" pragma. As a consequence,
5035 the user will be unable to print such rename entities. */
5038 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5039 int nsyms
, const struct block
*current_block
)
5041 struct symbol
*current_function
;
5042 const char *current_function_name
;
5044 int is_new_style_renaming
;
5046 /* If there is both a renaming foo___XR... encoded as a variable and
5047 a simple variable foo in the same block, discard the latter.
5048 First, zero out such symbols, then compress. */
5049 is_new_style_renaming
= 0;
5050 for (i
= 0; i
< nsyms
; i
+= 1)
5052 struct symbol
*sym
= syms
[i
].sym
;
5053 const struct block
*block
= syms
[i
].block
;
5057 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5059 name
= SYMBOL_LINKAGE_NAME (sym
);
5060 suffix
= strstr (name
, "___XR");
5064 int name_len
= suffix
- name
;
5067 is_new_style_renaming
= 1;
5068 for (j
= 0; j
< nsyms
; j
+= 1)
5069 if (i
!= j
&& syms
[j
].sym
!= NULL
5070 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5072 && block
== syms
[j
].block
)
5076 if (is_new_style_renaming
)
5080 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5081 if (syms
[j
].sym
!= NULL
)
5089 /* Extract the function name associated to CURRENT_BLOCK.
5090 Abort if unable to do so. */
5092 if (current_block
== NULL
)
5095 current_function
= block_linkage_function (current_block
);
5096 if (current_function
== NULL
)
5099 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5100 if (current_function_name
== NULL
)
5103 /* Check each of the symbols, and remove it from the list if it is
5104 a type corresponding to a renaming that is out of the scope of
5105 the current block. */
5110 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5111 == ADA_OBJECT_RENAMING
5112 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5116 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5117 syms
[j
- 1] = syms
[j
];
5127 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5128 whose name and domain match NAME and DOMAIN respectively.
5129 If no match was found, then extend the search to "enclosing"
5130 routines (in other words, if we're inside a nested function,
5131 search the symbols defined inside the enclosing functions).
5132 If WILD_MATCH_P is nonzero, perform the naming matching in
5133 "wild" mode (see function "wild_match" for more info).
5135 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5138 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5139 const struct block
*block
, domain_enum domain
,
5142 int block_depth
= 0;
5144 while (block
!= NULL
)
5147 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5150 /* If we found a non-function match, assume that's the one. */
5151 if (is_nonfunction (defns_collected (obstackp
, 0),
5152 num_defns_collected (obstackp
)))
5155 block
= BLOCK_SUPERBLOCK (block
);
5158 /* If no luck so far, try to find NAME as a local symbol in some lexically
5159 enclosing subprogram. */
5160 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5161 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5164 /* An object of this type is used as the user_data argument when
5165 calling the map_matching_symbols method. */
5169 struct objfile
*objfile
;
5170 struct obstack
*obstackp
;
5171 struct symbol
*arg_sym
;
5175 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5176 to a list of symbols. DATA0 is a pointer to a struct match_data *
5177 containing the obstack that collects the symbol list, the file that SYM
5178 must come from, a flag indicating whether a non-argument symbol has
5179 been found in the current block, and the last argument symbol
5180 passed in SYM within the current block (if any). When SYM is null,
5181 marking the end of a block, the argument symbol is added if no
5182 other has been found. */
5185 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5187 struct match_data
*data
= (struct match_data
*) data0
;
5191 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5192 add_defn_to_vec (data
->obstackp
,
5193 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5195 data
->found_sym
= 0;
5196 data
->arg_sym
= NULL
;
5200 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5202 else if (SYMBOL_IS_ARGUMENT (sym
))
5203 data
->arg_sym
= sym
;
5206 data
->found_sym
= 1;
5207 add_defn_to_vec (data
->obstackp
,
5208 fixup_symbol_section (sym
, data
->objfile
),
5215 /* Implements compare_names, but only applying the comparision using
5216 the given CASING. */
5219 compare_names_with_case (const char *string1
, const char *string2
,
5220 enum case_sensitivity casing
)
5222 while (*string1
!= '\0' && *string2
!= '\0')
5226 if (isspace (*string1
) || isspace (*string2
))
5227 return strcmp_iw_ordered (string1
, string2
);
5229 if (casing
== case_sensitive_off
)
5231 c1
= tolower (*string1
);
5232 c2
= tolower (*string2
);
5249 return strcmp_iw_ordered (string1
, string2
);
5251 if (*string2
== '\0')
5253 if (is_name_suffix (string1
))
5260 if (*string2
== '(')
5261 return strcmp_iw_ordered (string1
, string2
);
5264 if (casing
== case_sensitive_off
)
5265 return tolower (*string1
) - tolower (*string2
);
5267 return *string1
- *string2
;
5272 /* Compare STRING1 to STRING2, with results as for strcmp.
5273 Compatible with strcmp_iw_ordered in that...
5275 strcmp_iw_ordered (STRING1, STRING2) <= 0
5279 compare_names (STRING1, STRING2) <= 0
5281 (they may differ as to what symbols compare equal). */
5284 compare_names (const char *string1
, const char *string2
)
5288 /* Similar to what strcmp_iw_ordered does, we need to perform
5289 a case-insensitive comparison first, and only resort to
5290 a second, case-sensitive, comparison if the first one was
5291 not sufficient to differentiate the two strings. */
5293 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5295 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5300 /* Add to OBSTACKP all non-local symbols whose name and domain match
5301 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5302 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5305 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5306 domain_enum domain
, int global
,
5309 struct objfile
*objfile
;
5310 struct match_data data
;
5312 memset (&data
, 0, sizeof data
);
5313 data
.obstackp
= obstackp
;
5315 ALL_OBJFILES (objfile
)
5317 data
.objfile
= objfile
;
5320 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5321 aux_add_nonlocal_symbols
, &data
,
5324 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5325 aux_add_nonlocal_symbols
, &data
,
5326 full_match
, compare_names
);
5329 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5331 ALL_OBJFILES (objfile
)
5333 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5334 strcpy (name1
, "_ada_");
5335 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5336 data
.objfile
= objfile
;
5337 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5339 aux_add_nonlocal_symbols
,
5341 full_match
, compare_names
);
5346 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5347 non-zero, enclosing scope and in global scopes, returning the number of
5349 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5350 indicating the symbols found and the blocks and symbol tables (if
5351 any) in which they were found. This vector is transient---good only to
5352 the next call of ada_lookup_symbol_list.
5354 When full_search is non-zero, any non-function/non-enumeral
5355 symbol match within the nest of blocks whose innermost member is BLOCK0,
5356 is the one match returned (no other matches in that or
5357 enclosing blocks is returned). If there are any matches in or
5358 surrounding BLOCK0, then these alone are returned.
5360 Names prefixed with "standard__" are handled specially: "standard__"
5361 is first stripped off, and only static and global symbols are searched. */
5364 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5365 domain_enum
namespace,
5366 struct ada_symbol_info
**results
,
5370 const struct block
*block
;
5372 const int wild_match_p
= should_use_wild_match (name0
);
5376 obstack_free (&symbol_list_obstack
, NULL
);
5377 obstack_init (&symbol_list_obstack
);
5381 /* Search specified block and its superiors. */
5386 /* Special case: If the user specifies a symbol name inside package
5387 Standard, do a non-wild matching of the symbol name without
5388 the "standard__" prefix. This was primarily introduced in order
5389 to allow the user to specifically access the standard exceptions
5390 using, for instance, Standard.Constraint_Error when Constraint_Error
5391 is ambiguous (due to the user defining its own Constraint_Error
5392 entity inside its program). */
5393 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5396 name
= name0
+ sizeof ("standard__") - 1;
5399 /* Check the non-global symbols. If we have ANY match, then we're done. */
5405 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5406 namespace, wild_match_p
);
5410 /* In the !full_search case we're are being called by
5411 ada_iterate_over_symbols, and we don't want to search
5413 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5414 namespace, NULL
, wild_match_p
);
5416 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5420 /* No non-global symbols found. Check our cache to see if we have
5421 already performed this search before. If we have, then return
5425 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5428 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5432 /* Search symbols from all global blocks. */
5434 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5437 /* Now add symbols from all per-file blocks if we've gotten no hits
5438 (not strictly correct, but perhaps better than an error). */
5440 if (num_defns_collected (&symbol_list_obstack
) == 0)
5441 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5445 ndefns
= num_defns_collected (&symbol_list_obstack
);
5446 *results
= defns_collected (&symbol_list_obstack
, 1);
5448 ndefns
= remove_extra_symbols (*results
, ndefns
);
5450 if (ndefns
== 0 && full_search
)
5451 cache_symbol (name0
, namespace, NULL
, NULL
);
5453 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5454 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5456 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5461 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5462 in global scopes, returning the number of matches, and setting *RESULTS
5463 to a vector of (SYM,BLOCK) tuples.
5464 See ada_lookup_symbol_list_worker for further details. */
5467 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5468 domain_enum domain
, struct ada_symbol_info
**results
)
5470 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5473 /* Implementation of the la_iterate_over_symbols method. */
5476 ada_iterate_over_symbols (const struct block
*block
,
5477 const char *name
, domain_enum domain
,
5478 symbol_found_callback_ftype
*callback
,
5482 struct ada_symbol_info
*results
;
5484 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5485 for (i
= 0; i
< ndefs
; ++i
)
5487 if (! (*callback
) (results
[i
].sym
, data
))
5492 /* If NAME is the name of an entity, return a string that should
5493 be used to look that entity up in Ada units. This string should
5494 be deallocated after use using xfree.
5496 NAME can have any form that the "break" or "print" commands might
5497 recognize. In other words, it does not have to be the "natural"
5498 name, or the "encoded" name. */
5501 ada_name_for_lookup (const char *name
)
5504 int nlen
= strlen (name
);
5506 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5508 canon
= xmalloc (nlen
- 1);
5509 memcpy (canon
, name
+ 1, nlen
- 2);
5510 canon
[nlen
- 2] = '\0';
5513 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5517 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5518 to 1, but choosing the first symbol found if there are multiple
5521 The result is stored in *INFO, which must be non-NULL.
5522 If no match is found, INFO->SYM is set to NULL. */
5525 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5526 domain_enum
namespace,
5527 struct ada_symbol_info
*info
)
5529 struct ada_symbol_info
*candidates
;
5532 gdb_assert (info
!= NULL
);
5533 memset (info
, 0, sizeof (struct ada_symbol_info
));
5535 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
);
5536 if (n_candidates
== 0)
5539 *info
= candidates
[0];
5540 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5543 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5544 scope and in global scopes, or NULL if none. NAME is folded and
5545 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5546 choosing the first symbol if there are multiple choices.
5547 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5550 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5551 domain_enum
namespace, int *is_a_field_of_this
)
5553 struct ada_symbol_info info
;
5555 if (is_a_field_of_this
!= NULL
)
5556 *is_a_field_of_this
= 0;
5558 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5559 block0
, namespace, &info
);
5563 static struct symbol
*
5564 ada_lookup_symbol_nonlocal (const char *name
,
5565 const struct block
*block
,
5566 const domain_enum domain
)
5568 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5572 /* True iff STR is a possible encoded suffix of a normal Ada name
5573 that is to be ignored for matching purposes. Suffixes of parallel
5574 names (e.g., XVE) are not included here. Currently, the possible suffixes
5575 are given by any of the regular expressions:
5577 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5578 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5579 TKB [subprogram suffix for task bodies]
5580 _E[0-9]+[bs]$ [protected object entry suffixes]
5581 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5583 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5584 match is performed. This sequence is used to differentiate homonyms,
5585 is an optional part of a valid name suffix. */
5588 is_name_suffix (const char *str
)
5591 const char *matching
;
5592 const int len
= strlen (str
);
5594 /* Skip optional leading __[0-9]+. */
5596 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5599 while (isdigit (str
[0]))
5605 if (str
[0] == '.' || str
[0] == '$')
5608 while (isdigit (matching
[0]))
5610 if (matching
[0] == '\0')
5616 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5619 while (isdigit (matching
[0]))
5621 if (matching
[0] == '\0')
5625 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5627 if (strcmp (str
, "TKB") == 0)
5631 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5632 with a N at the end. Unfortunately, the compiler uses the same
5633 convention for other internal types it creates. So treating
5634 all entity names that end with an "N" as a name suffix causes
5635 some regressions. For instance, consider the case of an enumerated
5636 type. To support the 'Image attribute, it creates an array whose
5638 Having a single character like this as a suffix carrying some
5639 information is a bit risky. Perhaps we should change the encoding
5640 to be something like "_N" instead. In the meantime, do not do
5641 the following check. */
5642 /* Protected Object Subprograms */
5643 if (len
== 1 && str
[0] == 'N')
5648 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5651 while (isdigit (matching
[0]))
5653 if ((matching
[0] == 'b' || matching
[0] == 's')
5654 && matching
[1] == '\0')
5658 /* ??? We should not modify STR directly, as we are doing below. This
5659 is fine in this case, but may become problematic later if we find
5660 that this alternative did not work, and want to try matching
5661 another one from the begining of STR. Since we modified it, we
5662 won't be able to find the begining of the string anymore! */
5666 while (str
[0] != '_' && str
[0] != '\0')
5668 if (str
[0] != 'n' && str
[0] != 'b')
5674 if (str
[0] == '\000')
5679 if (str
[1] != '_' || str
[2] == '\000')
5683 if (strcmp (str
+ 3, "JM") == 0)
5685 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5686 the LJM suffix in favor of the JM one. But we will
5687 still accept LJM as a valid suffix for a reasonable
5688 amount of time, just to allow ourselves to debug programs
5689 compiled using an older version of GNAT. */
5690 if (strcmp (str
+ 3, "LJM") == 0)
5694 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5695 || str
[4] == 'U' || str
[4] == 'P')
5697 if (str
[4] == 'R' && str
[5] != 'T')
5701 if (!isdigit (str
[2]))
5703 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5704 if (!isdigit (str
[k
]) && str
[k
] != '_')
5708 if (str
[0] == '$' && isdigit (str
[1]))
5710 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5711 if (!isdigit (str
[k
]) && str
[k
] != '_')
5718 /* Return non-zero if the string starting at NAME and ending before
5719 NAME_END contains no capital letters. */
5722 is_valid_name_for_wild_match (const char *name0
)
5724 const char *decoded_name
= ada_decode (name0
);
5727 /* If the decoded name starts with an angle bracket, it means that
5728 NAME0 does not follow the GNAT encoding format. It should then
5729 not be allowed as a possible wild match. */
5730 if (decoded_name
[0] == '<')
5733 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5734 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5740 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5741 that could start a simple name. Assumes that *NAMEP points into
5742 the string beginning at NAME0. */
5745 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5747 const char *name
= *namep
;
5757 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5760 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5765 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5766 || name
[2] == target0
))
5774 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5784 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5785 informational suffixes of NAME (i.e., for which is_name_suffix is
5786 true). Assumes that PATN is a lower-cased Ada simple name. */
5789 wild_match (const char *name
, const char *patn
)
5792 const char *name0
= name
;
5796 const char *match
= name
;
5800 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5803 if (*p
== '\0' && is_name_suffix (name
))
5804 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5806 if (name
[-1] == '_')
5809 if (!advance_wild_match (&name
, name0
, *patn
))
5814 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5815 informational suffix. */
5818 full_match (const char *sym_name
, const char *search_name
)
5820 return !match_name (sym_name
, search_name
, 0);
5824 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5825 vector *defn_symbols, updating the list of symbols in OBSTACKP
5826 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5827 OBJFILE is the section containing BLOCK. */
5830 ada_add_block_symbols (struct obstack
*obstackp
,
5831 const struct block
*block
, const char *name
,
5832 domain_enum domain
, struct objfile
*objfile
,
5835 struct block_iterator iter
;
5836 int name_len
= strlen (name
);
5837 /* A matching argument symbol, if any. */
5838 struct symbol
*arg_sym
;
5839 /* Set true when we find a matching non-argument symbol. */
5847 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5848 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5850 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5851 SYMBOL_DOMAIN (sym
), domain
)
5852 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5854 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5856 else if (SYMBOL_IS_ARGUMENT (sym
))
5861 add_defn_to_vec (obstackp
,
5862 fixup_symbol_section (sym
, objfile
),
5870 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5871 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5873 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5874 SYMBOL_DOMAIN (sym
), domain
))
5876 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5878 if (SYMBOL_IS_ARGUMENT (sym
))
5883 add_defn_to_vec (obstackp
,
5884 fixup_symbol_section (sym
, objfile
),
5892 if (!found_sym
&& arg_sym
!= NULL
)
5894 add_defn_to_vec (obstackp
,
5895 fixup_symbol_section (arg_sym
, objfile
),
5904 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5906 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5907 SYMBOL_DOMAIN (sym
), domain
))
5911 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5914 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5916 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5921 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5923 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5925 if (SYMBOL_IS_ARGUMENT (sym
))
5930 add_defn_to_vec (obstackp
,
5931 fixup_symbol_section (sym
, objfile
),
5939 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5940 They aren't parameters, right? */
5941 if (!found_sym
&& arg_sym
!= NULL
)
5943 add_defn_to_vec (obstackp
,
5944 fixup_symbol_section (arg_sym
, objfile
),
5951 /* Symbol Completion */
5953 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5954 name in a form that's appropriate for the completion. The result
5955 does not need to be deallocated, but is only good until the next call.
5957 TEXT_LEN is equal to the length of TEXT.
5958 Perform a wild match if WILD_MATCH_P is set.
5959 ENCODED_P should be set if TEXT represents the start of a symbol name
5960 in its encoded form. */
5963 symbol_completion_match (const char *sym_name
,
5964 const char *text
, int text_len
,
5965 int wild_match_p
, int encoded_p
)
5967 const int verbatim_match
= (text
[0] == '<');
5972 /* Strip the leading angle bracket. */
5977 /* First, test against the fully qualified name of the symbol. */
5979 if (strncmp (sym_name
, text
, text_len
) == 0)
5982 if (match
&& !encoded_p
)
5984 /* One needed check before declaring a positive match is to verify
5985 that iff we are doing a verbatim match, the decoded version
5986 of the symbol name starts with '<'. Otherwise, this symbol name
5987 is not a suitable completion. */
5988 const char *sym_name_copy
= sym_name
;
5989 int has_angle_bracket
;
5991 sym_name
= ada_decode (sym_name
);
5992 has_angle_bracket
= (sym_name
[0] == '<');
5993 match
= (has_angle_bracket
== verbatim_match
);
5994 sym_name
= sym_name_copy
;
5997 if (match
&& !verbatim_match
)
5999 /* When doing non-verbatim match, another check that needs to
6000 be done is to verify that the potentially matching symbol name
6001 does not include capital letters, because the ada-mode would
6002 not be able to understand these symbol names without the
6003 angle bracket notation. */
6006 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6011 /* Second: Try wild matching... */
6013 if (!match
&& wild_match_p
)
6015 /* Since we are doing wild matching, this means that TEXT
6016 may represent an unqualified symbol name. We therefore must
6017 also compare TEXT against the unqualified name of the symbol. */
6018 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6020 if (strncmp (sym_name
, text
, text_len
) == 0)
6024 /* Finally: If we found a mach, prepare the result to return. */
6030 sym_name
= add_angle_brackets (sym_name
);
6033 sym_name
= ada_decode (sym_name
);
6038 /* A companion function to ada_make_symbol_completion_list().
6039 Check if SYM_NAME represents a symbol which name would be suitable
6040 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6041 it is appended at the end of the given string vector SV.
6043 ORIG_TEXT is the string original string from the user command
6044 that needs to be completed. WORD is the entire command on which
6045 completion should be performed. These two parameters are used to
6046 determine which part of the symbol name should be added to the
6048 if WILD_MATCH_P is set, then wild matching is performed.
6049 ENCODED_P should be set if TEXT represents a symbol name in its
6050 encoded formed (in which case the completion should also be
6054 symbol_completion_add (VEC(char_ptr
) **sv
,
6055 const char *sym_name
,
6056 const char *text
, int text_len
,
6057 const char *orig_text
, const char *word
,
6058 int wild_match_p
, int encoded_p
)
6060 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6061 wild_match_p
, encoded_p
);
6067 /* We found a match, so add the appropriate completion to the given
6070 if (word
== orig_text
)
6072 completion
= xmalloc (strlen (match
) + 5);
6073 strcpy (completion
, match
);
6075 else if (word
> orig_text
)
6077 /* Return some portion of sym_name. */
6078 completion
= xmalloc (strlen (match
) + 5);
6079 strcpy (completion
, match
+ (word
- orig_text
));
6083 /* Return some of ORIG_TEXT plus sym_name. */
6084 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6085 strncpy (completion
, word
, orig_text
- word
);
6086 completion
[orig_text
- word
] = '\0';
6087 strcat (completion
, match
);
6090 VEC_safe_push (char_ptr
, *sv
, completion
);
6093 /* An object of this type is passed as the user_data argument to the
6094 expand_symtabs_matching method. */
6095 struct add_partial_datum
6097 VEC(char_ptr
) **completions
;
6106 /* A callback for expand_symtabs_matching. */
6109 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6111 struct add_partial_datum
*data
= user_data
;
6113 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6114 data
->wild_match
, data
->encoded
) != NULL
;
6117 /* Return a list of possible symbol names completing TEXT0. WORD is
6118 the entire command on which completion is made. */
6120 static VEC (char_ptr
) *
6121 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6122 enum type_code code
)
6128 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6131 struct minimal_symbol
*msymbol
;
6132 struct objfile
*objfile
;
6133 struct block
*b
, *surrounding_static_block
= 0;
6135 struct block_iterator iter
;
6136 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6138 gdb_assert (code
== TYPE_CODE_UNDEF
);
6140 if (text0
[0] == '<')
6142 text
= xstrdup (text0
);
6143 make_cleanup (xfree
, text
);
6144 text_len
= strlen (text
);
6150 text
= xstrdup (ada_encode (text0
));
6151 make_cleanup (xfree
, text
);
6152 text_len
= strlen (text
);
6153 for (i
= 0; i
< text_len
; i
++)
6154 text
[i
] = tolower (text
[i
]);
6156 encoded_p
= (strstr (text0
, "__") != NULL
);
6157 /* If the name contains a ".", then the user is entering a fully
6158 qualified entity name, and the match must not be done in wild
6159 mode. Similarly, if the user wants to complete what looks like
6160 an encoded name, the match must not be done in wild mode. */
6161 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6164 /* First, look at the partial symtab symbols. */
6166 struct add_partial_datum data
;
6168 data
.completions
= &completions
;
6170 data
.text_len
= text_len
;
6173 data
.wild_match
= wild_match_p
;
6174 data
.encoded
= encoded_p
;
6175 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, ALL_DOMAIN
,
6179 /* At this point scan through the misc symbol vectors and add each
6180 symbol you find to the list. Eventually we want to ignore
6181 anything that isn't a text symbol (everything else will be
6182 handled by the psymtab code above). */
6184 ALL_MSYMBOLS (objfile
, msymbol
)
6187 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6188 text
, text_len
, text0
, word
, wild_match_p
,
6192 /* Search upwards from currently selected frame (so that we can
6193 complete on local vars. */
6195 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6197 if (!BLOCK_SUPERBLOCK (b
))
6198 surrounding_static_block
= b
; /* For elmin of dups */
6200 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6202 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6203 text
, text_len
, text0
, word
,
6204 wild_match_p
, encoded_p
);
6208 /* Go through the symtabs and check the externs and statics for
6209 symbols which match. */
6211 ALL_SYMTABS (objfile
, s
)
6214 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6215 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6217 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6218 text
, text_len
, text0
, word
,
6219 wild_match_p
, encoded_p
);
6223 ALL_SYMTABS (objfile
, s
)
6226 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
6227 /* Don't do this block twice. */
6228 if (b
== surrounding_static_block
)
6230 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6232 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6233 text
, text_len
, text0
, word
,
6234 wild_match_p
, encoded_p
);
6238 do_cleanups (old_chain
);
6244 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6245 for tagged types. */
6248 ada_is_dispatch_table_ptr_type (struct type
*type
)
6252 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6255 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6259 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6262 /* Return non-zero if TYPE is an interface tag. */
6265 ada_is_interface_tag (struct type
*type
)
6267 const char *name
= TYPE_NAME (type
);
6272 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6275 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6276 to be invisible to users. */
6279 ada_is_ignored_field (struct type
*type
, int field_num
)
6281 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6284 /* Check the name of that field. */
6286 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6288 /* Anonymous field names should not be printed.
6289 brobecker/2007-02-20: I don't think this can actually happen
6290 but we don't want to print the value of annonymous fields anyway. */
6294 /* Normally, fields whose name start with an underscore ("_")
6295 are fields that have been internally generated by the compiler,
6296 and thus should not be printed. The "_parent" field is special,
6297 however: This is a field internally generated by the compiler
6298 for tagged types, and it contains the components inherited from
6299 the parent type. This field should not be printed as is, but
6300 should not be ignored either. */
6301 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
6305 /* If this is the dispatch table of a tagged type or an interface tag,
6307 if (ada_is_tagged_type (type
, 1)
6308 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6309 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6312 /* Not a special field, so it should not be ignored. */
6316 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6317 pointer or reference type whose ultimate target has a tag field. */
6320 ada_is_tagged_type (struct type
*type
, int refok
)
6322 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6325 /* True iff TYPE represents the type of X'Tag */
6328 ada_is_tag_type (struct type
*type
)
6330 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6334 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6336 return (name
!= NULL
6337 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6341 /* The type of the tag on VAL. */
6344 ada_tag_type (struct value
*val
)
6346 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6349 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6350 retired at Ada 05). */
6353 is_ada95_tag (struct value
*tag
)
6355 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6358 /* The value of the tag on VAL. */
6361 ada_value_tag (struct value
*val
)
6363 return ada_value_struct_elt (val
, "_tag", 0);
6366 /* The value of the tag on the object of type TYPE whose contents are
6367 saved at VALADDR, if it is non-null, or is at memory address
6370 static struct value
*
6371 value_tag_from_contents_and_address (struct type
*type
,
6372 const gdb_byte
*valaddr
,
6375 int tag_byte_offset
;
6376 struct type
*tag_type
;
6378 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6381 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6383 : valaddr
+ tag_byte_offset
);
6384 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6386 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6391 static struct type
*
6392 type_from_tag (struct value
*tag
)
6394 const char *type_name
= ada_tag_name (tag
);
6396 if (type_name
!= NULL
)
6397 return ada_find_any_type (ada_encode (type_name
));
6401 /* Given a value OBJ of a tagged type, return a value of this
6402 type at the base address of the object. The base address, as
6403 defined in Ada.Tags, it is the address of the primary tag of
6404 the object, and therefore where the field values of its full
6405 view can be fetched. */
6408 ada_tag_value_at_base_address (struct value
*obj
)
6410 volatile struct gdb_exception e
;
6412 LONGEST offset_to_top
= 0;
6413 struct type
*ptr_type
, *obj_type
;
6415 CORE_ADDR base_address
;
6417 obj_type
= value_type (obj
);
6419 /* It is the responsability of the caller to deref pointers. */
6421 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6422 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6425 tag
= ada_value_tag (obj
);
6429 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6431 if (is_ada95_tag (tag
))
6434 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6435 ptr_type
= lookup_pointer_type (ptr_type
);
6436 val
= value_cast (ptr_type
, tag
);
6440 /* It is perfectly possible that an exception be raised while
6441 trying to determine the base address, just like for the tag;
6442 see ada_tag_name for more details. We do not print the error
6443 message for the same reason. */
6445 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6447 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6453 /* If offset is null, nothing to do. */
6455 if (offset_to_top
== 0)
6458 /* -1 is a special case in Ada.Tags; however, what should be done
6459 is not quite clear from the documentation. So do nothing for
6462 if (offset_to_top
== -1)
6465 base_address
= value_address (obj
) - offset_to_top
;
6466 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6468 /* Make sure that we have a proper tag at the new address.
6469 Otherwise, offset_to_top is bogus (which can happen when
6470 the object is not initialized yet). */
6475 obj_type
= type_from_tag (tag
);
6480 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6483 /* Return the "ada__tags__type_specific_data" type. */
6485 static struct type
*
6486 ada_get_tsd_type (struct inferior
*inf
)
6488 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6490 if (data
->tsd_type
== 0)
6491 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6492 return data
->tsd_type
;
6495 /* Return the TSD (type-specific data) associated to the given TAG.
6496 TAG is assumed to be the tag of a tagged-type entity.
6498 May return NULL if we are unable to get the TSD. */
6500 static struct value
*
6501 ada_get_tsd_from_tag (struct value
*tag
)
6506 /* First option: The TSD is simply stored as a field of our TAG.
6507 Only older versions of GNAT would use this format, but we have
6508 to test it first, because there are no visible markers for
6509 the current approach except the absence of that field. */
6511 val
= ada_value_struct_elt (tag
, "tsd", 1);
6515 /* Try the second representation for the dispatch table (in which
6516 there is no explicit 'tsd' field in the referent of the tag pointer,
6517 and instead the tsd pointer is stored just before the dispatch
6520 type
= ada_get_tsd_type (current_inferior());
6523 type
= lookup_pointer_type (lookup_pointer_type (type
));
6524 val
= value_cast (type
, tag
);
6527 return value_ind (value_ptradd (val
, -1));
6530 /* Given the TSD of a tag (type-specific data), return a string
6531 containing the name of the associated type.
6533 The returned value is good until the next call. May return NULL
6534 if we are unable to determine the tag name. */
6537 ada_tag_name_from_tsd (struct value
*tsd
)
6539 static char name
[1024];
6543 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6546 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6547 for (p
= name
; *p
!= '\0'; p
+= 1)
6553 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6556 Return NULL if the TAG is not an Ada tag, or if we were unable to
6557 determine the name of that tag. The result is good until the next
6561 ada_tag_name (struct value
*tag
)
6563 volatile struct gdb_exception e
;
6566 if (!ada_is_tag_type (value_type (tag
)))
6569 /* It is perfectly possible that an exception be raised while trying
6570 to determine the TAG's name, even under normal circumstances:
6571 The associated variable may be uninitialized or corrupted, for
6572 instance. We do not let any exception propagate past this point.
6573 instead we return NULL.
6575 We also do not print the error message either (which often is very
6576 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6577 the caller print a more meaningful message if necessary. */
6578 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6580 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6583 name
= ada_tag_name_from_tsd (tsd
);
6589 /* The parent type of TYPE, or NULL if none. */
6592 ada_parent_type (struct type
*type
)
6596 type
= ada_check_typedef (type
);
6598 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6601 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6602 if (ada_is_parent_field (type
, i
))
6604 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6606 /* If the _parent field is a pointer, then dereference it. */
6607 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6608 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6609 /* If there is a parallel XVS type, get the actual base type. */
6610 parent_type
= ada_get_base_type (parent_type
);
6612 return ada_check_typedef (parent_type
);
6618 /* True iff field number FIELD_NUM of structure type TYPE contains the
6619 parent-type (inherited) fields of a derived type. Assumes TYPE is
6620 a structure type with at least FIELD_NUM+1 fields. */
6623 ada_is_parent_field (struct type
*type
, int field_num
)
6625 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6627 return (name
!= NULL
6628 && (strncmp (name
, "PARENT", 6) == 0
6629 || strncmp (name
, "_parent", 7) == 0));
6632 /* True iff field number FIELD_NUM of structure type TYPE is a
6633 transparent wrapper field (which should be silently traversed when doing
6634 field selection and flattened when printing). Assumes TYPE is a
6635 structure type with at least FIELD_NUM+1 fields. Such fields are always
6639 ada_is_wrapper_field (struct type
*type
, int field_num
)
6641 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6643 return (name
!= NULL
6644 && (strncmp (name
, "PARENT", 6) == 0
6645 || strcmp (name
, "REP") == 0
6646 || strncmp (name
, "_parent", 7) == 0
6647 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6650 /* True iff field number FIELD_NUM of structure or union type TYPE
6651 is a variant wrapper. Assumes TYPE is a structure type with at least
6652 FIELD_NUM+1 fields. */
6655 ada_is_variant_part (struct type
*type
, int field_num
)
6657 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6659 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6660 || (is_dynamic_field (type
, field_num
)
6661 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6662 == TYPE_CODE_UNION
)));
6665 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6666 whose discriminants are contained in the record type OUTER_TYPE,
6667 returns the type of the controlling discriminant for the variant.
6668 May return NULL if the type could not be found. */
6671 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6673 char *name
= ada_variant_discrim_name (var_type
);
6675 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6678 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6679 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6680 represents a 'when others' clause; otherwise 0. */
6683 ada_is_others_clause (struct type
*type
, int field_num
)
6685 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6687 return (name
!= NULL
&& name
[0] == 'O');
6690 /* Assuming that TYPE0 is the type of the variant part of a record,
6691 returns the name of the discriminant controlling the variant.
6692 The value is valid until the next call to ada_variant_discrim_name. */
6695 ada_variant_discrim_name (struct type
*type0
)
6697 static char *result
= NULL
;
6698 static size_t result_len
= 0;
6701 const char *discrim_end
;
6702 const char *discrim_start
;
6704 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6705 type
= TYPE_TARGET_TYPE (type0
);
6709 name
= ada_type_name (type
);
6711 if (name
== NULL
|| name
[0] == '\000')
6714 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6717 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6720 if (discrim_end
== name
)
6723 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6726 if (discrim_start
== name
+ 1)
6728 if ((discrim_start
> name
+ 3
6729 && strncmp (discrim_start
- 3, "___", 3) == 0)
6730 || discrim_start
[-1] == '.')
6734 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6735 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6736 result
[discrim_end
- discrim_start
] = '\0';
6740 /* Scan STR for a subtype-encoded number, beginning at position K.
6741 Put the position of the character just past the number scanned in
6742 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6743 Return 1 if there was a valid number at the given position, and 0
6744 otherwise. A "subtype-encoded" number consists of the absolute value
6745 in decimal, followed by the letter 'm' to indicate a negative number.
6746 Assumes 0m does not occur. */
6749 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6753 if (!isdigit (str
[k
]))
6756 /* Do it the hard way so as not to make any assumption about
6757 the relationship of unsigned long (%lu scan format code) and
6760 while (isdigit (str
[k
]))
6762 RU
= RU
* 10 + (str
[k
] - '0');
6769 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6775 /* NOTE on the above: Technically, C does not say what the results of
6776 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6777 number representable as a LONGEST (although either would probably work
6778 in most implementations). When RU>0, the locution in the then branch
6779 above is always equivalent to the negative of RU. */
6786 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6787 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6788 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6791 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6793 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6807 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6817 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6818 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6820 if (val
>= L
&& val
<= U
)
6832 /* FIXME: Lots of redundancy below. Try to consolidate. */
6834 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6835 ARG_TYPE, extract and return the value of one of its (non-static)
6836 fields. FIELDNO says which field. Differs from value_primitive_field
6837 only in that it can handle packed values of arbitrary type. */
6839 static struct value
*
6840 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6841 struct type
*arg_type
)
6845 arg_type
= ada_check_typedef (arg_type
);
6846 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6848 /* Handle packed fields. */
6850 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6852 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6853 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6855 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6856 offset
+ bit_pos
/ 8,
6857 bit_pos
% 8, bit_size
, type
);
6860 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6863 /* Find field with name NAME in object of type TYPE. If found,
6864 set the following for each argument that is non-null:
6865 - *FIELD_TYPE_P to the field's type;
6866 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6867 an object of that type;
6868 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6869 - *BIT_SIZE_P to its size in bits if the field is packed, and
6871 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6872 fields up to but not including the desired field, or by the total
6873 number of fields if not found. A NULL value of NAME never
6874 matches; the function just counts visible fields in this case.
6876 Returns 1 if found, 0 otherwise. */
6879 find_struct_field (const char *name
, struct type
*type
, int offset
,
6880 struct type
**field_type_p
,
6881 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6886 type
= ada_check_typedef (type
);
6888 if (field_type_p
!= NULL
)
6889 *field_type_p
= NULL
;
6890 if (byte_offset_p
!= NULL
)
6892 if (bit_offset_p
!= NULL
)
6894 if (bit_size_p
!= NULL
)
6897 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6899 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6900 int fld_offset
= offset
+ bit_pos
/ 8;
6901 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6903 if (t_field_name
== NULL
)
6906 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6908 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6910 if (field_type_p
!= NULL
)
6911 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6912 if (byte_offset_p
!= NULL
)
6913 *byte_offset_p
= fld_offset
;
6914 if (bit_offset_p
!= NULL
)
6915 *bit_offset_p
= bit_pos
% 8;
6916 if (bit_size_p
!= NULL
)
6917 *bit_size_p
= bit_size
;
6920 else if (ada_is_wrapper_field (type
, i
))
6922 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6923 field_type_p
, byte_offset_p
, bit_offset_p
,
6924 bit_size_p
, index_p
))
6927 else if (ada_is_variant_part (type
, i
))
6929 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6932 struct type
*field_type
6933 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6935 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6937 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6939 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6940 field_type_p
, byte_offset_p
,
6941 bit_offset_p
, bit_size_p
, index_p
))
6945 else if (index_p
!= NULL
)
6951 /* Number of user-visible fields in record type TYPE. */
6954 num_visible_fields (struct type
*type
)
6959 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6963 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6964 and search in it assuming it has (class) type TYPE.
6965 If found, return value, else return NULL.
6967 Searches recursively through wrapper fields (e.g., '_parent'). */
6969 static struct value
*
6970 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6975 type
= ada_check_typedef (type
);
6976 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6978 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6980 if (t_field_name
== NULL
)
6983 else if (field_name_match (t_field_name
, name
))
6984 return ada_value_primitive_field (arg
, offset
, i
, type
);
6986 else if (ada_is_wrapper_field (type
, i
))
6988 struct value
*v
= /* Do not let indent join lines here. */
6989 ada_search_struct_field (name
, arg
,
6990 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6991 TYPE_FIELD_TYPE (type
, i
));
6997 else if (ada_is_variant_part (type
, i
))
6999 /* PNH: Do we ever get here? See find_struct_field. */
7001 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7003 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7005 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7007 struct value
*v
= ada_search_struct_field
/* Force line
7010 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7011 TYPE_FIELD_TYPE (field_type
, j
));
7021 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7022 int, struct type
*);
7025 /* Return field #INDEX in ARG, where the index is that returned by
7026 * find_struct_field through its INDEX_P argument. Adjust the address
7027 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7028 * If found, return value, else return NULL. */
7030 static struct value
*
7031 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7034 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7038 /* Auxiliary function for ada_index_struct_field. Like
7039 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7042 static struct value
*
7043 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7047 type
= ada_check_typedef (type
);
7049 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7051 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7053 else if (ada_is_wrapper_field (type
, i
))
7055 struct value
*v
= /* Do not let indent join lines here. */
7056 ada_index_struct_field_1 (index_p
, arg
,
7057 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7058 TYPE_FIELD_TYPE (type
, i
));
7064 else if (ada_is_variant_part (type
, i
))
7066 /* PNH: Do we ever get here? See ada_search_struct_field,
7067 find_struct_field. */
7068 error (_("Cannot assign this kind of variant record"));
7070 else if (*index_p
== 0)
7071 return ada_value_primitive_field (arg
, offset
, i
, type
);
7078 /* Given ARG, a value of type (pointer or reference to a)*
7079 structure/union, extract the component named NAME from the ultimate
7080 target structure/union and return it as a value with its
7083 The routine searches for NAME among all members of the structure itself
7084 and (recursively) among all members of any wrapper members
7087 If NO_ERR, then simply return NULL in case of error, rather than
7091 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7093 struct type
*t
, *t1
;
7097 t1
= t
= ada_check_typedef (value_type (arg
));
7098 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7100 t1
= TYPE_TARGET_TYPE (t
);
7103 t1
= ada_check_typedef (t1
);
7104 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7106 arg
= coerce_ref (arg
);
7111 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7113 t1
= TYPE_TARGET_TYPE (t
);
7116 t1
= ada_check_typedef (t1
);
7117 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7119 arg
= value_ind (arg
);
7126 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7130 v
= ada_search_struct_field (name
, arg
, 0, t
);
7133 int bit_offset
, bit_size
, byte_offset
;
7134 struct type
*field_type
;
7137 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7138 address
= value_address (ada_value_ind (arg
));
7140 address
= value_address (ada_coerce_ref (arg
));
7142 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7143 if (find_struct_field (name
, t1
, 0,
7144 &field_type
, &byte_offset
, &bit_offset
,
7149 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7150 arg
= ada_coerce_ref (arg
);
7152 arg
= ada_value_ind (arg
);
7153 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7154 bit_offset
, bit_size
,
7158 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7162 if (v
!= NULL
|| no_err
)
7165 error (_("There is no member named %s."), name
);
7171 error (_("Attempt to extract a component of "
7172 "a value that is not a record."));
7175 /* Given a type TYPE, look up the type of the component of type named NAME.
7176 If DISPP is non-null, add its byte displacement from the beginning of a
7177 structure (pointed to by a value) of type TYPE to *DISPP (does not
7178 work for packed fields).
7180 Matches any field whose name has NAME as a prefix, possibly
7183 TYPE can be either a struct or union. If REFOK, TYPE may also
7184 be a (pointer or reference)+ to a struct or union, and the
7185 ultimate target type will be searched.
7187 Looks recursively into variant clauses and parent types.
7189 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7190 TYPE is not a type of the right kind. */
7192 static struct type
*
7193 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7194 int noerr
, int *dispp
)
7201 if (refok
&& type
!= NULL
)
7204 type
= ada_check_typedef (type
);
7205 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7206 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7208 type
= TYPE_TARGET_TYPE (type
);
7212 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7213 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7219 target_terminal_ours ();
7220 gdb_flush (gdb_stdout
);
7222 error (_("Type (null) is not a structure or union type"));
7225 /* XXX: type_sprint */
7226 fprintf_unfiltered (gdb_stderr
, _("Type "));
7227 type_print (type
, "", gdb_stderr
, -1);
7228 error (_(" is not a structure or union type"));
7233 type
= to_static_fixed_type (type
);
7235 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7237 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7241 if (t_field_name
== NULL
)
7244 else if (field_name_match (t_field_name
, name
))
7247 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7248 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7251 else if (ada_is_wrapper_field (type
, i
))
7254 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7259 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7264 else if (ada_is_variant_part (type
, i
))
7267 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7270 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7272 /* FIXME pnh 2008/01/26: We check for a field that is
7273 NOT wrapped in a struct, since the compiler sometimes
7274 generates these for unchecked variant types. Revisit
7275 if the compiler changes this practice. */
7276 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7278 if (v_field_name
!= NULL
7279 && field_name_match (v_field_name
, name
))
7280 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7282 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7289 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7300 target_terminal_ours ();
7301 gdb_flush (gdb_stdout
);
7304 /* XXX: type_sprint */
7305 fprintf_unfiltered (gdb_stderr
, _("Type "));
7306 type_print (type
, "", gdb_stderr
, -1);
7307 error (_(" has no component named <null>"));
7311 /* XXX: type_sprint */
7312 fprintf_unfiltered (gdb_stderr
, _("Type "));
7313 type_print (type
, "", gdb_stderr
, -1);
7314 error (_(" has no component named %s"), name
);
7321 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7322 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7323 represents an unchecked union (that is, the variant part of a
7324 record that is named in an Unchecked_Union pragma). */
7327 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7329 char *discrim_name
= ada_variant_discrim_name (var_type
);
7331 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7336 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7337 within a value of type OUTER_TYPE that is stored in GDB at
7338 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7339 numbering from 0) is applicable. Returns -1 if none are. */
7342 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7343 const gdb_byte
*outer_valaddr
)
7347 char *discrim_name
= ada_variant_discrim_name (var_type
);
7348 struct value
*outer
;
7349 struct value
*discrim
;
7350 LONGEST discrim_val
;
7352 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
7353 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7354 if (discrim
== NULL
)
7356 discrim_val
= value_as_long (discrim
);
7359 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7361 if (ada_is_others_clause (var_type
, i
))
7363 else if (ada_in_variant (discrim_val
, var_type
, i
))
7367 return others_clause
;
7372 /* Dynamic-Sized Records */
7374 /* Strategy: The type ostensibly attached to a value with dynamic size
7375 (i.e., a size that is not statically recorded in the debugging
7376 data) does not accurately reflect the size or layout of the value.
7377 Our strategy is to convert these values to values with accurate,
7378 conventional types that are constructed on the fly. */
7380 /* There is a subtle and tricky problem here. In general, we cannot
7381 determine the size of dynamic records without its data. However,
7382 the 'struct value' data structure, which GDB uses to represent
7383 quantities in the inferior process (the target), requires the size
7384 of the type at the time of its allocation in order to reserve space
7385 for GDB's internal copy of the data. That's why the
7386 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7387 rather than struct value*s.
7389 However, GDB's internal history variables ($1, $2, etc.) are
7390 struct value*s containing internal copies of the data that are not, in
7391 general, the same as the data at their corresponding addresses in
7392 the target. Fortunately, the types we give to these values are all
7393 conventional, fixed-size types (as per the strategy described
7394 above), so that we don't usually have to perform the
7395 'to_fixed_xxx_type' conversions to look at their values.
7396 Unfortunately, there is one exception: if one of the internal
7397 history variables is an array whose elements are unconstrained
7398 records, then we will need to create distinct fixed types for each
7399 element selected. */
7401 /* The upshot of all of this is that many routines take a (type, host
7402 address, target address) triple as arguments to represent a value.
7403 The host address, if non-null, is supposed to contain an internal
7404 copy of the relevant data; otherwise, the program is to consult the
7405 target at the target address. */
7407 /* Assuming that VAL0 represents a pointer value, the result of
7408 dereferencing it. Differs from value_ind in its treatment of
7409 dynamic-sized types. */
7412 ada_value_ind (struct value
*val0
)
7414 struct value
*val
= value_ind (val0
);
7416 if (ada_is_tagged_type (value_type (val
), 0))
7417 val
= ada_tag_value_at_base_address (val
);
7419 return ada_to_fixed_value (val
);
7422 /* The value resulting from dereferencing any "reference to"
7423 qualifiers on VAL0. */
7425 static struct value
*
7426 ada_coerce_ref (struct value
*val0
)
7428 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7430 struct value
*val
= val0
;
7432 val
= coerce_ref (val
);
7434 if (ada_is_tagged_type (value_type (val
), 0))
7435 val
= ada_tag_value_at_base_address (val
);
7437 return ada_to_fixed_value (val
);
7443 /* Return OFF rounded upward if necessary to a multiple of
7444 ALIGNMENT (a power of 2). */
7447 align_value (unsigned int off
, unsigned int alignment
)
7449 return (off
+ alignment
- 1) & ~(alignment
- 1);
7452 /* Return the bit alignment required for field #F of template type TYPE. */
7455 field_alignment (struct type
*type
, int f
)
7457 const char *name
= TYPE_FIELD_NAME (type
, f
);
7461 /* The field name should never be null, unless the debugging information
7462 is somehow malformed. In this case, we assume the field does not
7463 require any alignment. */
7467 len
= strlen (name
);
7469 if (!isdigit (name
[len
- 1]))
7472 if (isdigit (name
[len
- 2]))
7473 align_offset
= len
- 2;
7475 align_offset
= len
- 1;
7477 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7478 return TARGET_CHAR_BIT
;
7480 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7483 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7485 static struct symbol
*
7486 ada_find_any_type_symbol (const char *name
)
7490 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7491 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7494 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7498 /* Find a type named NAME. Ignores ambiguity. This routine will look
7499 solely for types defined by debug info, it will not search the GDB
7502 static struct type
*
7503 ada_find_any_type (const char *name
)
7505 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7508 return SYMBOL_TYPE (sym
);
7513 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7514 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7515 symbol, in which case it is returned. Otherwise, this looks for
7516 symbols whose name is that of NAME_SYM suffixed with "___XR".
7517 Return symbol if found, and NULL otherwise. */
7520 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7522 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7525 if (strstr (name
, "___XR") != NULL
)
7528 sym
= find_old_style_renaming_symbol (name
, block
);
7533 /* Not right yet. FIXME pnh 7/20/2007. */
7534 sym
= ada_find_any_type_symbol (name
);
7535 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7541 static struct symbol
*
7542 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7544 const struct symbol
*function_sym
= block_linkage_function (block
);
7547 if (function_sym
!= NULL
)
7549 /* If the symbol is defined inside a function, NAME is not fully
7550 qualified. This means we need to prepend the function name
7551 as well as adding the ``___XR'' suffix to build the name of
7552 the associated renaming symbol. */
7553 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7554 /* Function names sometimes contain suffixes used
7555 for instance to qualify nested subprograms. When building
7556 the XR type name, we need to make sure that this suffix is
7557 not included. So do not include any suffix in the function
7558 name length below. */
7559 int function_name_len
= ada_name_prefix_len (function_name
);
7560 const int rename_len
= function_name_len
+ 2 /* "__" */
7561 + strlen (name
) + 6 /* "___XR\0" */ ;
7563 /* Strip the suffix if necessary. */
7564 ada_remove_trailing_digits (function_name
, &function_name_len
);
7565 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7566 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7568 /* Library-level functions are a special case, as GNAT adds
7569 a ``_ada_'' prefix to the function name to avoid namespace
7570 pollution. However, the renaming symbols themselves do not
7571 have this prefix, so we need to skip this prefix if present. */
7572 if (function_name_len
> 5 /* "_ada_" */
7573 && strstr (function_name
, "_ada_") == function_name
)
7576 function_name_len
-= 5;
7579 rename
= (char *) alloca (rename_len
* sizeof (char));
7580 strncpy (rename
, function_name
, function_name_len
);
7581 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7586 const int rename_len
= strlen (name
) + 6;
7588 rename
= (char *) alloca (rename_len
* sizeof (char));
7589 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7592 return ada_find_any_type_symbol (rename
);
7595 /* Because of GNAT encoding conventions, several GDB symbols may match a
7596 given type name. If the type denoted by TYPE0 is to be preferred to
7597 that of TYPE1 for purposes of type printing, return non-zero;
7598 otherwise return 0. */
7601 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7605 else if (type0
== NULL
)
7607 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7609 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7611 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7613 else if (ada_is_constrained_packed_array_type (type0
))
7615 else if (ada_is_array_descriptor_type (type0
)
7616 && !ada_is_array_descriptor_type (type1
))
7620 const char *type0_name
= type_name_no_tag (type0
);
7621 const char *type1_name
= type_name_no_tag (type1
);
7623 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7624 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7630 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7631 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7634 ada_type_name (struct type
*type
)
7638 else if (TYPE_NAME (type
) != NULL
)
7639 return TYPE_NAME (type
);
7641 return TYPE_TAG_NAME (type
);
7644 /* Search the list of "descriptive" types associated to TYPE for a type
7645 whose name is NAME. */
7647 static struct type
*
7648 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7650 struct type
*result
;
7652 if (ada_ignore_descriptive_types_p
)
7655 /* If there no descriptive-type info, then there is no parallel type
7657 if (!HAVE_GNAT_AUX_INFO (type
))
7660 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7661 while (result
!= NULL
)
7663 const char *result_name
= ada_type_name (result
);
7665 if (result_name
== NULL
)
7667 warning (_("unexpected null name on descriptive type"));
7671 /* If the names match, stop. */
7672 if (strcmp (result_name
, name
) == 0)
7675 /* Otherwise, look at the next item on the list, if any. */
7676 if (HAVE_GNAT_AUX_INFO (result
))
7677 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7682 /* If we didn't find a match, see whether this is a packed array. With
7683 older compilers, the descriptive type information is either absent or
7684 irrelevant when it comes to packed arrays so the above lookup fails.
7685 Fall back to using a parallel lookup by name in this case. */
7686 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7687 return ada_find_any_type (name
);
7692 /* Find a parallel type to TYPE with the specified NAME, using the
7693 descriptive type taken from the debugging information, if available,
7694 and otherwise using the (slower) name-based method. */
7696 static struct type
*
7697 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7699 struct type
*result
= NULL
;
7701 if (HAVE_GNAT_AUX_INFO (type
))
7702 result
= find_parallel_type_by_descriptive_type (type
, name
);
7704 result
= ada_find_any_type (name
);
7709 /* Same as above, but specify the name of the parallel type by appending
7710 SUFFIX to the name of TYPE. */
7713 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7716 const char *typename
= ada_type_name (type
);
7719 if (typename
== NULL
)
7722 len
= strlen (typename
);
7724 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7726 strcpy (name
, typename
);
7727 strcpy (name
+ len
, suffix
);
7729 return ada_find_parallel_type_with_name (type
, name
);
7732 /* If TYPE is a variable-size record type, return the corresponding template
7733 type describing its fields. Otherwise, return NULL. */
7735 static struct type
*
7736 dynamic_template_type (struct type
*type
)
7738 type
= ada_check_typedef (type
);
7740 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7741 || ada_type_name (type
) == NULL
)
7745 int len
= strlen (ada_type_name (type
));
7747 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7750 return ada_find_parallel_type (type
, "___XVE");
7754 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7755 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7758 is_dynamic_field (struct type
*templ_type
, int field_num
)
7760 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7763 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7764 && strstr (name
, "___XVL") != NULL
;
7767 /* The index of the variant field of TYPE, or -1 if TYPE does not
7768 represent a variant record type. */
7771 variant_field_index (struct type
*type
)
7775 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7778 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7780 if (ada_is_variant_part (type
, f
))
7786 /* A record type with no fields. */
7788 static struct type
*
7789 empty_record (struct type
*template)
7791 struct type
*type
= alloc_type_copy (template);
7793 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7794 TYPE_NFIELDS (type
) = 0;
7795 TYPE_FIELDS (type
) = NULL
;
7796 INIT_CPLUS_SPECIFIC (type
);
7797 TYPE_NAME (type
) = "<empty>";
7798 TYPE_TAG_NAME (type
) = NULL
;
7799 TYPE_LENGTH (type
) = 0;
7803 /* An ordinary record type (with fixed-length fields) that describes
7804 the value of type TYPE at VALADDR or ADDRESS (see comments at
7805 the beginning of this section) VAL according to GNAT conventions.
7806 DVAL0 should describe the (portion of a) record that contains any
7807 necessary discriminants. It should be NULL if value_type (VAL) is
7808 an outer-level type (i.e., as opposed to a branch of a variant.) A
7809 variant field (unless unchecked) is replaced by a particular branch
7812 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7813 length are not statically known are discarded. As a consequence,
7814 VALADDR, ADDRESS and DVAL0 are ignored.
7816 NOTE: Limitations: For now, we assume that dynamic fields and
7817 variants occupy whole numbers of bytes. However, they need not be
7821 ada_template_to_fixed_record_type_1 (struct type
*type
,
7822 const gdb_byte
*valaddr
,
7823 CORE_ADDR address
, struct value
*dval0
,
7824 int keep_dynamic_fields
)
7826 struct value
*mark
= value_mark ();
7829 int nfields
, bit_len
;
7835 /* Compute the number of fields in this record type that are going
7836 to be processed: unless keep_dynamic_fields, this includes only
7837 fields whose position and length are static will be processed. */
7838 if (keep_dynamic_fields
)
7839 nfields
= TYPE_NFIELDS (type
);
7843 while (nfields
< TYPE_NFIELDS (type
)
7844 && !ada_is_variant_part (type
, nfields
)
7845 && !is_dynamic_field (type
, nfields
))
7849 rtype
= alloc_type_copy (type
);
7850 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7851 INIT_CPLUS_SPECIFIC (rtype
);
7852 TYPE_NFIELDS (rtype
) = nfields
;
7853 TYPE_FIELDS (rtype
) = (struct field
*)
7854 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7855 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7856 TYPE_NAME (rtype
) = ada_type_name (type
);
7857 TYPE_TAG_NAME (rtype
) = NULL
;
7858 TYPE_FIXED_INSTANCE (rtype
) = 1;
7864 for (f
= 0; f
< nfields
; f
+= 1)
7866 off
= align_value (off
, field_alignment (type
, f
))
7867 + TYPE_FIELD_BITPOS (type
, f
);
7868 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7869 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7871 if (ada_is_variant_part (type
, f
))
7876 else if (is_dynamic_field (type
, f
))
7878 const gdb_byte
*field_valaddr
= valaddr
;
7879 CORE_ADDR field_address
= address
;
7880 struct type
*field_type
=
7881 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7885 /* rtype's length is computed based on the run-time
7886 value of discriminants. If the discriminants are not
7887 initialized, the type size may be completely bogus and
7888 GDB may fail to allocate a value for it. So check the
7889 size first before creating the value. */
7891 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7892 rtype
= value_type (dval
);
7897 /* If the type referenced by this field is an aligner type, we need
7898 to unwrap that aligner type, because its size might not be set.
7899 Keeping the aligner type would cause us to compute the wrong
7900 size for this field, impacting the offset of the all the fields
7901 that follow this one. */
7902 if (ada_is_aligner_type (field_type
))
7904 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7906 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7907 field_address
= cond_offset_target (field_address
, field_offset
);
7908 field_type
= ada_aligned_type (field_type
);
7911 field_valaddr
= cond_offset_host (field_valaddr
,
7912 off
/ TARGET_CHAR_BIT
);
7913 field_address
= cond_offset_target (field_address
,
7914 off
/ TARGET_CHAR_BIT
);
7916 /* Get the fixed type of the field. Note that, in this case,
7917 we do not want to get the real type out of the tag: if
7918 the current field is the parent part of a tagged record,
7919 we will get the tag of the object. Clearly wrong: the real
7920 type of the parent is not the real type of the child. We
7921 would end up in an infinite loop. */
7922 field_type
= ada_get_base_type (field_type
);
7923 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7924 field_address
, dval
, 0);
7925 /* If the field size is already larger than the maximum
7926 object size, then the record itself will necessarily
7927 be larger than the maximum object size. We need to make
7928 this check now, because the size might be so ridiculously
7929 large (due to an uninitialized variable in the inferior)
7930 that it would cause an overflow when adding it to the
7932 check_size (field_type
);
7934 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7935 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7936 /* The multiplication can potentially overflow. But because
7937 the field length has been size-checked just above, and
7938 assuming that the maximum size is a reasonable value,
7939 an overflow should not happen in practice. So rather than
7940 adding overflow recovery code to this already complex code,
7941 we just assume that it's not going to happen. */
7943 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7947 /* Note: If this field's type is a typedef, it is important
7948 to preserve the typedef layer.
7950 Otherwise, we might be transforming a typedef to a fat
7951 pointer (encoding a pointer to an unconstrained array),
7952 into a basic fat pointer (encoding an unconstrained
7953 array). As both types are implemented using the same
7954 structure, the typedef is the only clue which allows us
7955 to distinguish between the two options. Stripping it
7956 would prevent us from printing this field appropriately. */
7957 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7958 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7959 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7961 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7964 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7966 /* We need to be careful of typedefs when computing
7967 the length of our field. If this is a typedef,
7968 get the length of the target type, not the length
7970 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7971 field_type
= ada_typedef_target_type (field_type
);
7974 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7977 if (off
+ fld_bit_len
> bit_len
)
7978 bit_len
= off
+ fld_bit_len
;
7980 TYPE_LENGTH (rtype
) =
7981 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7984 /* We handle the variant part, if any, at the end because of certain
7985 odd cases in which it is re-ordered so as NOT to be the last field of
7986 the record. This can happen in the presence of representation
7988 if (variant_field
>= 0)
7990 struct type
*branch_type
;
7992 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7996 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7997 rtype
= value_type (dval
);
8003 to_fixed_variant_branch_type
8004 (TYPE_FIELD_TYPE (type
, variant_field
),
8005 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8006 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8007 if (branch_type
== NULL
)
8009 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8010 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8011 TYPE_NFIELDS (rtype
) -= 1;
8015 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8016 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8018 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8020 if (off
+ fld_bit_len
> bit_len
)
8021 bit_len
= off
+ fld_bit_len
;
8022 TYPE_LENGTH (rtype
) =
8023 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8027 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8028 should contain the alignment of that record, which should be a strictly
8029 positive value. If null or negative, then something is wrong, most
8030 probably in the debug info. In that case, we don't round up the size
8031 of the resulting type. If this record is not part of another structure,
8032 the current RTYPE length might be good enough for our purposes. */
8033 if (TYPE_LENGTH (type
) <= 0)
8035 if (TYPE_NAME (rtype
))
8036 warning (_("Invalid type size for `%s' detected: %d."),
8037 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8039 warning (_("Invalid type size for <unnamed> detected: %d."),
8040 TYPE_LENGTH (type
));
8044 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8045 TYPE_LENGTH (type
));
8048 value_free_to_mark (mark
);
8049 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8050 error (_("record type with dynamic size is larger than varsize-limit"));
8054 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8057 static struct type
*
8058 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8059 CORE_ADDR address
, struct value
*dval0
)
8061 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8065 /* An ordinary record type in which ___XVL-convention fields and
8066 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8067 static approximations, containing all possible fields. Uses
8068 no runtime values. Useless for use in values, but that's OK,
8069 since the results are used only for type determinations. Works on both
8070 structs and unions. Representation note: to save space, we memorize
8071 the result of this function in the TYPE_TARGET_TYPE of the
8074 static struct type
*
8075 template_to_static_fixed_type (struct type
*type0
)
8081 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8082 return TYPE_TARGET_TYPE (type0
);
8084 nfields
= TYPE_NFIELDS (type0
);
8087 for (f
= 0; f
< nfields
; f
+= 1)
8089 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8090 struct type
*new_type
;
8092 if (is_dynamic_field (type0
, f
))
8093 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8095 new_type
= static_unwrap_type (field_type
);
8096 if (type
== type0
&& new_type
!= field_type
)
8098 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8099 TYPE_CODE (type
) = TYPE_CODE (type0
);
8100 INIT_CPLUS_SPECIFIC (type
);
8101 TYPE_NFIELDS (type
) = nfields
;
8102 TYPE_FIELDS (type
) = (struct field
*)
8103 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8104 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8105 sizeof (struct field
) * nfields
);
8106 TYPE_NAME (type
) = ada_type_name (type0
);
8107 TYPE_TAG_NAME (type
) = NULL
;
8108 TYPE_FIXED_INSTANCE (type
) = 1;
8109 TYPE_LENGTH (type
) = 0;
8111 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8112 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8117 /* Given an object of type TYPE whose contents are at VALADDR and
8118 whose address in memory is ADDRESS, returns a revision of TYPE,
8119 which should be a non-dynamic-sized record, in which the variant
8120 part, if any, is replaced with the appropriate branch. Looks
8121 for discriminant values in DVAL0, which can be NULL if the record
8122 contains the necessary discriminant values. */
8124 static struct type
*
8125 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8126 CORE_ADDR address
, struct value
*dval0
)
8128 struct value
*mark
= value_mark ();
8131 struct type
*branch_type
;
8132 int nfields
= TYPE_NFIELDS (type
);
8133 int variant_field
= variant_field_index (type
);
8135 if (variant_field
== -1)
8140 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8141 type
= value_type (dval
);
8146 rtype
= alloc_type_copy (type
);
8147 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8148 INIT_CPLUS_SPECIFIC (rtype
);
8149 TYPE_NFIELDS (rtype
) = nfields
;
8150 TYPE_FIELDS (rtype
) =
8151 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8152 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8153 sizeof (struct field
) * nfields
);
8154 TYPE_NAME (rtype
) = ada_type_name (type
);
8155 TYPE_TAG_NAME (rtype
) = NULL
;
8156 TYPE_FIXED_INSTANCE (rtype
) = 1;
8157 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8159 branch_type
= to_fixed_variant_branch_type
8160 (TYPE_FIELD_TYPE (type
, variant_field
),
8161 cond_offset_host (valaddr
,
8162 TYPE_FIELD_BITPOS (type
, variant_field
)
8164 cond_offset_target (address
,
8165 TYPE_FIELD_BITPOS (type
, variant_field
)
8166 / TARGET_CHAR_BIT
), dval
);
8167 if (branch_type
== NULL
)
8171 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8172 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8173 TYPE_NFIELDS (rtype
) -= 1;
8177 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8178 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8179 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8180 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8182 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8184 value_free_to_mark (mark
);
8188 /* An ordinary record type (with fixed-length fields) that describes
8189 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8190 beginning of this section]. Any necessary discriminants' values
8191 should be in DVAL, a record value; it may be NULL if the object
8192 at ADDR itself contains any necessary discriminant values.
8193 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8194 values from the record are needed. Except in the case that DVAL,
8195 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8196 unchecked) is replaced by a particular branch of the variant.
8198 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8199 is questionable and may be removed. It can arise during the
8200 processing of an unconstrained-array-of-record type where all the
8201 variant branches have exactly the same size. This is because in
8202 such cases, the compiler does not bother to use the XVS convention
8203 when encoding the record. I am currently dubious of this
8204 shortcut and suspect the compiler should be altered. FIXME. */
8206 static struct type
*
8207 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8208 CORE_ADDR address
, struct value
*dval
)
8210 struct type
*templ_type
;
8212 if (TYPE_FIXED_INSTANCE (type0
))
8215 templ_type
= dynamic_template_type (type0
);
8217 if (templ_type
!= NULL
)
8218 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8219 else if (variant_field_index (type0
) >= 0)
8221 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8223 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8228 TYPE_FIXED_INSTANCE (type0
) = 1;
8234 /* An ordinary record type (with fixed-length fields) that describes
8235 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8236 union type. Any necessary discriminants' values should be in DVAL,
8237 a record value. That is, this routine selects the appropriate
8238 branch of the union at ADDR according to the discriminant value
8239 indicated in the union's type name. Returns VAR_TYPE0 itself if
8240 it represents a variant subject to a pragma Unchecked_Union. */
8242 static struct type
*
8243 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8244 CORE_ADDR address
, struct value
*dval
)
8247 struct type
*templ_type
;
8248 struct type
*var_type
;
8250 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8251 var_type
= TYPE_TARGET_TYPE (var_type0
);
8253 var_type
= var_type0
;
8255 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8257 if (templ_type
!= NULL
)
8258 var_type
= templ_type
;
8260 if (is_unchecked_variant (var_type
, value_type (dval
)))
8263 ada_which_variant_applies (var_type
,
8264 value_type (dval
), value_contents (dval
));
8267 return empty_record (var_type
);
8268 else if (is_dynamic_field (var_type
, which
))
8269 return to_fixed_record_type
8270 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8271 valaddr
, address
, dval
);
8272 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8274 to_fixed_record_type
8275 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8277 return TYPE_FIELD_TYPE (var_type
, which
);
8280 /* Assuming that TYPE0 is an array type describing the type of a value
8281 at ADDR, and that DVAL describes a record containing any
8282 discriminants used in TYPE0, returns a type for the value that
8283 contains no dynamic components (that is, no components whose sizes
8284 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8285 true, gives an error message if the resulting type's size is over
8288 static struct type
*
8289 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8292 struct type
*index_type_desc
;
8293 struct type
*result
;
8294 int constrained_packed_array_p
;
8296 type0
= ada_check_typedef (type0
);
8297 if (TYPE_FIXED_INSTANCE (type0
))
8300 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8301 if (constrained_packed_array_p
)
8302 type0
= decode_constrained_packed_array_type (type0
);
8304 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8305 ada_fixup_array_indexes_type (index_type_desc
);
8306 if (index_type_desc
== NULL
)
8308 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8310 /* NOTE: elt_type---the fixed version of elt_type0---should never
8311 depend on the contents of the array in properly constructed
8313 /* Create a fixed version of the array element type.
8314 We're not providing the address of an element here,
8315 and thus the actual object value cannot be inspected to do
8316 the conversion. This should not be a problem, since arrays of
8317 unconstrained objects are not allowed. In particular, all
8318 the elements of an array of a tagged type should all be of
8319 the same type specified in the debugging info. No need to
8320 consult the object tag. */
8321 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8323 /* Make sure we always create a new array type when dealing with
8324 packed array types, since we're going to fix-up the array
8325 type length and element bitsize a little further down. */
8326 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8329 result
= create_array_type (alloc_type_copy (type0
),
8330 elt_type
, TYPE_INDEX_TYPE (type0
));
8335 struct type
*elt_type0
;
8338 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8339 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8341 /* NOTE: result---the fixed version of elt_type0---should never
8342 depend on the contents of the array in properly constructed
8344 /* Create a fixed version of the array element type.
8345 We're not providing the address of an element here,
8346 and thus the actual object value cannot be inspected to do
8347 the conversion. This should not be a problem, since arrays of
8348 unconstrained objects are not allowed. In particular, all
8349 the elements of an array of a tagged type should all be of
8350 the same type specified in the debugging info. No need to
8351 consult the object tag. */
8353 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8356 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8358 struct type
*range_type
=
8359 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8361 result
= create_array_type (alloc_type_copy (elt_type0
),
8362 result
, range_type
);
8363 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8365 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8366 error (_("array type with dynamic size is larger than varsize-limit"));
8369 /* We want to preserve the type name. This can be useful when
8370 trying to get the type name of a value that has already been
8371 printed (for instance, if the user did "print VAR; whatis $". */
8372 TYPE_NAME (result
) = TYPE_NAME (type0
);
8374 if (constrained_packed_array_p
)
8376 /* So far, the resulting type has been created as if the original
8377 type was a regular (non-packed) array type. As a result, the
8378 bitsize of the array elements needs to be set again, and the array
8379 length needs to be recomputed based on that bitsize. */
8380 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8381 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8383 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8384 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8385 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8386 TYPE_LENGTH (result
)++;
8389 TYPE_FIXED_INSTANCE (result
) = 1;
8394 /* A standard type (containing no dynamically sized components)
8395 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8396 DVAL describes a record containing any discriminants used in TYPE0,
8397 and may be NULL if there are none, or if the object of type TYPE at
8398 ADDRESS or in VALADDR contains these discriminants.
8400 If CHECK_TAG is not null, in the case of tagged types, this function
8401 attempts to locate the object's tag and use it to compute the actual
8402 type. However, when ADDRESS is null, we cannot use it to determine the
8403 location of the tag, and therefore compute the tagged type's actual type.
8404 So we return the tagged type without consulting the tag. */
8406 static struct type
*
8407 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8408 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8410 type
= ada_check_typedef (type
);
8411 switch (TYPE_CODE (type
))
8415 case TYPE_CODE_STRUCT
:
8417 struct type
*static_type
= to_static_fixed_type (type
);
8418 struct type
*fixed_record_type
=
8419 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8421 /* If STATIC_TYPE is a tagged type and we know the object's address,
8422 then we can determine its tag, and compute the object's actual
8423 type from there. Note that we have to use the fixed record
8424 type (the parent part of the record may have dynamic fields
8425 and the way the location of _tag is expressed may depend on
8428 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8431 value_tag_from_contents_and_address
8435 struct type
*real_type
= type_from_tag (tag
);
8437 value_from_contents_and_address (fixed_record_type
,
8440 fixed_record_type
= value_type (obj
);
8441 if (real_type
!= NULL
)
8442 return to_fixed_record_type
8444 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8447 /* Check to see if there is a parallel ___XVZ variable.
8448 If there is, then it provides the actual size of our type. */
8449 else if (ada_type_name (fixed_record_type
) != NULL
)
8451 const char *name
= ada_type_name (fixed_record_type
);
8452 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8456 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8457 size
= get_int_var_value (xvz_name
, &xvz_found
);
8458 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8460 fixed_record_type
= copy_type (fixed_record_type
);
8461 TYPE_LENGTH (fixed_record_type
) = size
;
8463 /* The FIXED_RECORD_TYPE may have be a stub. We have
8464 observed this when the debugging info is STABS, and
8465 apparently it is something that is hard to fix.
8467 In practice, we don't need the actual type definition
8468 at all, because the presence of the XVZ variable allows us
8469 to assume that there must be a XVS type as well, which we
8470 should be able to use later, when we need the actual type
8473 In the meantime, pretend that the "fixed" type we are
8474 returning is NOT a stub, because this can cause trouble
8475 when using this type to create new types targeting it.
8476 Indeed, the associated creation routines often check
8477 whether the target type is a stub and will try to replace
8478 it, thus using a type with the wrong size. This, in turn,
8479 might cause the new type to have the wrong size too.
8480 Consider the case of an array, for instance, where the size
8481 of the array is computed from the number of elements in
8482 our array multiplied by the size of its element. */
8483 TYPE_STUB (fixed_record_type
) = 0;
8486 return fixed_record_type
;
8488 case TYPE_CODE_ARRAY
:
8489 return to_fixed_array_type (type
, dval
, 1);
8490 case TYPE_CODE_UNION
:
8494 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8498 /* The same as ada_to_fixed_type_1, except that it preserves the type
8499 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8501 The typedef layer needs be preserved in order to differentiate between
8502 arrays and array pointers when both types are implemented using the same
8503 fat pointer. In the array pointer case, the pointer is encoded as
8504 a typedef of the pointer type. For instance, considering:
8506 type String_Access is access String;
8507 S1 : String_Access := null;
8509 To the debugger, S1 is defined as a typedef of type String. But
8510 to the user, it is a pointer. So if the user tries to print S1,
8511 we should not dereference the array, but print the array address
8514 If we didn't preserve the typedef layer, we would lose the fact that
8515 the type is to be presented as a pointer (needs de-reference before
8516 being printed). And we would also use the source-level type name. */
8519 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8520 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8523 struct type
*fixed_type
=
8524 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8526 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8527 then preserve the typedef layer.
8529 Implementation note: We can only check the main-type portion of
8530 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8531 from TYPE now returns a type that has the same instance flags
8532 as TYPE. For instance, if TYPE is a "typedef const", and its
8533 target type is a "struct", then the typedef elimination will return
8534 a "const" version of the target type. See check_typedef for more
8535 details about how the typedef layer elimination is done.
8537 brobecker/2010-11-19: It seems to me that the only case where it is
8538 useful to preserve the typedef layer is when dealing with fat pointers.
8539 Perhaps, we could add a check for that and preserve the typedef layer
8540 only in that situation. But this seems unecessary so far, probably
8541 because we call check_typedef/ada_check_typedef pretty much everywhere.
8543 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8544 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8545 == TYPE_MAIN_TYPE (fixed_type
)))
8551 /* A standard (static-sized) type corresponding as well as possible to
8552 TYPE0, but based on no runtime data. */
8554 static struct type
*
8555 to_static_fixed_type (struct type
*type0
)
8562 if (TYPE_FIXED_INSTANCE (type0
))
8565 type0
= ada_check_typedef (type0
);
8567 switch (TYPE_CODE (type0
))
8571 case TYPE_CODE_STRUCT
:
8572 type
= dynamic_template_type (type0
);
8574 return template_to_static_fixed_type (type
);
8576 return template_to_static_fixed_type (type0
);
8577 case TYPE_CODE_UNION
:
8578 type
= ada_find_parallel_type (type0
, "___XVU");
8580 return template_to_static_fixed_type (type
);
8582 return template_to_static_fixed_type (type0
);
8586 /* A static approximation of TYPE with all type wrappers removed. */
8588 static struct type
*
8589 static_unwrap_type (struct type
*type
)
8591 if (ada_is_aligner_type (type
))
8593 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8594 if (ada_type_name (type1
) == NULL
)
8595 TYPE_NAME (type1
) = ada_type_name (type
);
8597 return static_unwrap_type (type1
);
8601 struct type
*raw_real_type
= ada_get_base_type (type
);
8603 if (raw_real_type
== type
)
8606 return to_static_fixed_type (raw_real_type
);
8610 /* In some cases, incomplete and private types require
8611 cross-references that are not resolved as records (for example,
8613 type FooP is access Foo;
8615 type Foo is array ...;
8616 ). In these cases, since there is no mechanism for producing
8617 cross-references to such types, we instead substitute for FooP a
8618 stub enumeration type that is nowhere resolved, and whose tag is
8619 the name of the actual type. Call these types "non-record stubs". */
8621 /* A type equivalent to TYPE that is not a non-record stub, if one
8622 exists, otherwise TYPE. */
8625 ada_check_typedef (struct type
*type
)
8630 /* If our type is a typedef type of a fat pointer, then we're done.
8631 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8632 what allows us to distinguish between fat pointers that represent
8633 array types, and fat pointers that represent array access types
8634 (in both cases, the compiler implements them as fat pointers). */
8635 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8636 && is_thick_pntr (ada_typedef_target_type (type
)))
8639 CHECK_TYPEDEF (type
);
8640 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8641 || !TYPE_STUB (type
)
8642 || TYPE_TAG_NAME (type
) == NULL
)
8646 const char *name
= TYPE_TAG_NAME (type
);
8647 struct type
*type1
= ada_find_any_type (name
);
8652 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8653 stubs pointing to arrays, as we don't create symbols for array
8654 types, only for the typedef-to-array types). If that's the case,
8655 strip the typedef layer. */
8656 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8657 type1
= ada_check_typedef (type1
);
8663 /* A value representing the data at VALADDR/ADDRESS as described by
8664 type TYPE0, but with a standard (static-sized) type that correctly
8665 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8666 type, then return VAL0 [this feature is simply to avoid redundant
8667 creation of struct values]. */
8669 static struct value
*
8670 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8673 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8675 if (type
== type0
&& val0
!= NULL
)
8678 return value_from_contents_and_address (type
, 0, address
);
8681 /* A value representing VAL, but with a standard (static-sized) type
8682 that correctly describes it. Does not necessarily create a new
8686 ada_to_fixed_value (struct value
*val
)
8688 val
= unwrap_value (val
);
8689 val
= ada_to_fixed_value_create (value_type (val
),
8690 value_address (val
),
8698 /* Table mapping attribute numbers to names.
8699 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8701 static const char *attribute_names
[] = {
8719 ada_attribute_name (enum exp_opcode n
)
8721 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8722 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8724 return attribute_names
[0];
8727 /* Evaluate the 'POS attribute applied to ARG. */
8730 pos_atr (struct value
*arg
)
8732 struct value
*val
= coerce_ref (arg
);
8733 struct type
*type
= value_type (val
);
8735 if (!discrete_type_p (type
))
8736 error (_("'POS only defined on discrete types"));
8738 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8741 LONGEST v
= value_as_long (val
);
8743 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8745 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8748 error (_("enumeration value is invalid: can't find 'POS"));
8751 return value_as_long (val
);
8754 static struct value
*
8755 value_pos_atr (struct type
*type
, struct value
*arg
)
8757 return value_from_longest (type
, pos_atr (arg
));
8760 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8762 static struct value
*
8763 value_val_atr (struct type
*type
, struct value
*arg
)
8765 if (!discrete_type_p (type
))
8766 error (_("'VAL only defined on discrete types"));
8767 if (!integer_type_p (value_type (arg
)))
8768 error (_("'VAL requires integral argument"));
8770 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8772 long pos
= value_as_long (arg
);
8774 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8775 error (_("argument to 'VAL out of range"));
8776 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8779 return value_from_longest (type
, value_as_long (arg
));
8785 /* True if TYPE appears to be an Ada character type.
8786 [At the moment, this is true only for Character and Wide_Character;
8787 It is a heuristic test that could stand improvement]. */
8790 ada_is_character_type (struct type
*type
)
8794 /* If the type code says it's a character, then assume it really is,
8795 and don't check any further. */
8796 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8799 /* Otherwise, assume it's a character type iff it is a discrete type
8800 with a known character type name. */
8801 name
= ada_type_name (type
);
8802 return (name
!= NULL
8803 && (TYPE_CODE (type
) == TYPE_CODE_INT
8804 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8805 && (strcmp (name
, "character") == 0
8806 || strcmp (name
, "wide_character") == 0
8807 || strcmp (name
, "wide_wide_character") == 0
8808 || strcmp (name
, "unsigned char") == 0));
8811 /* True if TYPE appears to be an Ada string type. */
8814 ada_is_string_type (struct type
*type
)
8816 type
= ada_check_typedef (type
);
8818 && TYPE_CODE (type
) != TYPE_CODE_PTR
8819 && (ada_is_simple_array_type (type
)
8820 || ada_is_array_descriptor_type (type
))
8821 && ada_array_arity (type
) == 1)
8823 struct type
*elttype
= ada_array_element_type (type
, 1);
8825 return ada_is_character_type (elttype
);
8831 /* The compiler sometimes provides a parallel XVS type for a given
8832 PAD type. Normally, it is safe to follow the PAD type directly,
8833 but older versions of the compiler have a bug that causes the offset
8834 of its "F" field to be wrong. Following that field in that case
8835 would lead to incorrect results, but this can be worked around
8836 by ignoring the PAD type and using the associated XVS type instead.
8838 Set to True if the debugger should trust the contents of PAD types.
8839 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8840 static int trust_pad_over_xvs
= 1;
8842 /* True if TYPE is a struct type introduced by the compiler to force the
8843 alignment of a value. Such types have a single field with a
8844 distinctive name. */
8847 ada_is_aligner_type (struct type
*type
)
8849 type
= ada_check_typedef (type
);
8851 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8854 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8855 && TYPE_NFIELDS (type
) == 1
8856 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8859 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8860 the parallel type. */
8863 ada_get_base_type (struct type
*raw_type
)
8865 struct type
*real_type_namer
;
8866 struct type
*raw_real_type
;
8868 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8871 if (ada_is_aligner_type (raw_type
))
8872 /* The encoding specifies that we should always use the aligner type.
8873 So, even if this aligner type has an associated XVS type, we should
8876 According to the compiler gurus, an XVS type parallel to an aligner
8877 type may exist because of a stabs limitation. In stabs, aligner
8878 types are empty because the field has a variable-sized type, and
8879 thus cannot actually be used as an aligner type. As a result,
8880 we need the associated parallel XVS type to decode the type.
8881 Since the policy in the compiler is to not change the internal
8882 representation based on the debugging info format, we sometimes
8883 end up having a redundant XVS type parallel to the aligner type. */
8886 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8887 if (real_type_namer
== NULL
8888 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8889 || TYPE_NFIELDS (real_type_namer
) != 1)
8892 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8894 /* This is an older encoding form where the base type needs to be
8895 looked up by name. We prefer the newer enconding because it is
8897 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8898 if (raw_real_type
== NULL
)
8901 return raw_real_type
;
8904 /* The field in our XVS type is a reference to the base type. */
8905 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8908 /* The type of value designated by TYPE, with all aligners removed. */
8911 ada_aligned_type (struct type
*type
)
8913 if (ada_is_aligner_type (type
))
8914 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8916 return ada_get_base_type (type
);
8920 /* The address of the aligned value in an object at address VALADDR
8921 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8924 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8926 if (ada_is_aligner_type (type
))
8927 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8929 TYPE_FIELD_BITPOS (type
,
8930 0) / TARGET_CHAR_BIT
);
8937 /* The printed representation of an enumeration literal with encoded
8938 name NAME. The value is good to the next call of ada_enum_name. */
8940 ada_enum_name (const char *name
)
8942 static char *result
;
8943 static size_t result_len
= 0;
8946 /* First, unqualify the enumeration name:
8947 1. Search for the last '.' character. If we find one, then skip
8948 all the preceding characters, the unqualified name starts
8949 right after that dot.
8950 2. Otherwise, we may be debugging on a target where the compiler
8951 translates dots into "__". Search forward for double underscores,
8952 but stop searching when we hit an overloading suffix, which is
8953 of the form "__" followed by digits. */
8955 tmp
= strrchr (name
, '.');
8960 while ((tmp
= strstr (name
, "__")) != NULL
)
8962 if (isdigit (tmp
[2]))
8973 if (name
[1] == 'U' || name
[1] == 'W')
8975 if (sscanf (name
+ 2, "%x", &v
) != 1)
8981 GROW_VECT (result
, result_len
, 16);
8982 if (isascii (v
) && isprint (v
))
8983 xsnprintf (result
, result_len
, "'%c'", v
);
8984 else if (name
[1] == 'U')
8985 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8987 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8993 tmp
= strstr (name
, "__");
8995 tmp
= strstr (name
, "$");
8998 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8999 strncpy (result
, name
, tmp
- name
);
9000 result
[tmp
- name
] = '\0';
9008 /* Evaluate the subexpression of EXP starting at *POS as for
9009 evaluate_type, updating *POS to point just past the evaluated
9012 static struct value
*
9013 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9015 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9018 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9021 static struct value
*
9022 unwrap_value (struct value
*val
)
9024 struct type
*type
= ada_check_typedef (value_type (val
));
9026 if (ada_is_aligner_type (type
))
9028 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9029 struct type
*val_type
= ada_check_typedef (value_type (v
));
9031 if (ada_type_name (val_type
) == NULL
)
9032 TYPE_NAME (val_type
) = ada_type_name (type
);
9034 return unwrap_value (v
);
9038 struct type
*raw_real_type
=
9039 ada_check_typedef (ada_get_base_type (type
));
9041 /* If there is no parallel XVS or XVE type, then the value is
9042 already unwrapped. Return it without further modification. */
9043 if ((type
== raw_real_type
)
9044 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9048 coerce_unspec_val_to_type
9049 (val
, ada_to_fixed_type (raw_real_type
, 0,
9050 value_address (val
),
9055 static struct value
*
9056 cast_to_fixed (struct type
*type
, struct value
*arg
)
9060 if (type
== value_type (arg
))
9062 else if (ada_is_fixed_point_type (value_type (arg
)))
9063 val
= ada_float_to_fixed (type
,
9064 ada_fixed_to_float (value_type (arg
),
9065 value_as_long (arg
)));
9068 DOUBLEST argd
= value_as_double (arg
);
9070 val
= ada_float_to_fixed (type
, argd
);
9073 return value_from_longest (type
, val
);
9076 static struct value
*
9077 cast_from_fixed (struct type
*type
, struct value
*arg
)
9079 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9080 value_as_long (arg
));
9082 return value_from_double (type
, val
);
9085 /* Given two array types T1 and T2, return nonzero iff both arrays
9086 contain the same number of elements. */
9089 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9091 LONGEST lo1
, hi1
, lo2
, hi2
;
9093 /* Get the array bounds in order to verify that the size of
9094 the two arrays match. */
9095 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9096 || !get_array_bounds (t2
, &lo2
, &hi2
))
9097 error (_("unable to determine array bounds"));
9099 /* To make things easier for size comparison, normalize a bit
9100 the case of empty arrays by making sure that the difference
9101 between upper bound and lower bound is always -1. */
9107 return (hi1
- lo1
== hi2
- lo2
);
9110 /* Assuming that VAL is an array of integrals, and TYPE represents
9111 an array with the same number of elements, but with wider integral
9112 elements, return an array "casted" to TYPE. In practice, this
9113 means that the returned array is built by casting each element
9114 of the original array into TYPE's (wider) element type. */
9116 static struct value
*
9117 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9119 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9124 /* Verify that both val and type are arrays of scalars, and
9125 that the size of val's elements is smaller than the size
9126 of type's element. */
9127 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9128 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9129 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9130 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9131 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9132 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9134 if (!get_array_bounds (type
, &lo
, &hi
))
9135 error (_("unable to determine array bounds"));
9137 res
= allocate_value (type
);
9139 /* Promote each array element. */
9140 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9142 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9144 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9145 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9151 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9152 return the converted value. */
9154 static struct value
*
9155 coerce_for_assign (struct type
*type
, struct value
*val
)
9157 struct type
*type2
= value_type (val
);
9162 type2
= ada_check_typedef (type2
);
9163 type
= ada_check_typedef (type
);
9165 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9166 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9168 val
= ada_value_ind (val
);
9169 type2
= value_type (val
);
9172 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9173 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9175 if (!ada_same_array_size_p (type
, type2
))
9176 error (_("cannot assign arrays of different length"));
9178 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9179 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9180 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9181 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9183 /* Allow implicit promotion of the array elements to
9185 return ada_promote_array_of_integrals (type
, val
);
9188 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9189 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9190 error (_("Incompatible types in assignment"));
9191 deprecated_set_value_type (val
, type
);
9196 static struct value
*
9197 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9200 struct type
*type1
, *type2
;
9203 arg1
= coerce_ref (arg1
);
9204 arg2
= coerce_ref (arg2
);
9205 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9206 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9208 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9209 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9210 return value_binop (arg1
, arg2
, op
);
9219 return value_binop (arg1
, arg2
, op
);
9222 v2
= value_as_long (arg2
);
9224 error (_("second operand of %s must not be zero."), op_string (op
));
9226 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9227 return value_binop (arg1
, arg2
, op
);
9229 v1
= value_as_long (arg1
);
9234 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9235 v
+= v
> 0 ? -1 : 1;
9243 /* Should not reach this point. */
9247 val
= allocate_value (type1
);
9248 store_unsigned_integer (value_contents_raw (val
),
9249 TYPE_LENGTH (value_type (val
)),
9250 gdbarch_byte_order (get_type_arch (type1
)), v
);
9255 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9257 if (ada_is_direct_array_type (value_type (arg1
))
9258 || ada_is_direct_array_type (value_type (arg2
)))
9260 /* Automatically dereference any array reference before
9261 we attempt to perform the comparison. */
9262 arg1
= ada_coerce_ref (arg1
);
9263 arg2
= ada_coerce_ref (arg2
);
9265 arg1
= ada_coerce_to_simple_array (arg1
);
9266 arg2
= ada_coerce_to_simple_array (arg2
);
9267 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9268 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9269 error (_("Attempt to compare array with non-array"));
9270 /* FIXME: The following works only for types whose
9271 representations use all bits (no padding or undefined bits)
9272 and do not have user-defined equality. */
9274 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9275 && memcmp (value_contents (arg1
), value_contents (arg2
),
9276 TYPE_LENGTH (value_type (arg1
))) == 0;
9278 return value_equal (arg1
, arg2
);
9281 /* Total number of component associations in the aggregate starting at
9282 index PC in EXP. Assumes that index PC is the start of an
9286 num_component_specs (struct expression
*exp
, int pc
)
9290 m
= exp
->elts
[pc
+ 1].longconst
;
9293 for (i
= 0; i
< m
; i
+= 1)
9295 switch (exp
->elts
[pc
].opcode
)
9301 n
+= exp
->elts
[pc
+ 1].longconst
;
9304 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9309 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9310 component of LHS (a simple array or a record), updating *POS past
9311 the expression, assuming that LHS is contained in CONTAINER. Does
9312 not modify the inferior's memory, nor does it modify LHS (unless
9313 LHS == CONTAINER). */
9316 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9317 struct expression
*exp
, int *pos
)
9319 struct value
*mark
= value_mark ();
9322 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9324 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9325 struct value
*index_val
= value_from_longest (index_type
, index
);
9327 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9331 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9332 elt
= ada_to_fixed_value (elt
);
9335 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9336 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9338 value_assign_to_component (container
, elt
,
9339 ada_evaluate_subexp (NULL
, exp
, pos
,
9342 value_free_to_mark (mark
);
9345 /* Assuming that LHS represents an lvalue having a record or array
9346 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9347 of that aggregate's value to LHS, advancing *POS past the
9348 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9349 lvalue containing LHS (possibly LHS itself). Does not modify
9350 the inferior's memory, nor does it modify the contents of
9351 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9353 static struct value
*
9354 assign_aggregate (struct value
*container
,
9355 struct value
*lhs
, struct expression
*exp
,
9356 int *pos
, enum noside noside
)
9358 struct type
*lhs_type
;
9359 int n
= exp
->elts
[*pos
+1].longconst
;
9360 LONGEST low_index
, high_index
;
9363 int max_indices
, num_indices
;
9367 if (noside
!= EVAL_NORMAL
)
9369 for (i
= 0; i
< n
; i
+= 1)
9370 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9374 container
= ada_coerce_ref (container
);
9375 if (ada_is_direct_array_type (value_type (container
)))
9376 container
= ada_coerce_to_simple_array (container
);
9377 lhs
= ada_coerce_ref (lhs
);
9378 if (!deprecated_value_modifiable (lhs
))
9379 error (_("Left operand of assignment is not a modifiable lvalue."));
9381 lhs_type
= value_type (lhs
);
9382 if (ada_is_direct_array_type (lhs_type
))
9384 lhs
= ada_coerce_to_simple_array (lhs
);
9385 lhs_type
= value_type (lhs
);
9386 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9387 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9389 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9392 high_index
= num_visible_fields (lhs_type
) - 1;
9395 error (_("Left-hand side must be array or record."));
9397 num_specs
= num_component_specs (exp
, *pos
- 3);
9398 max_indices
= 4 * num_specs
+ 4;
9399 indices
= alloca (max_indices
* sizeof (indices
[0]));
9400 indices
[0] = indices
[1] = low_index
- 1;
9401 indices
[2] = indices
[3] = high_index
+ 1;
9404 for (i
= 0; i
< n
; i
+= 1)
9406 switch (exp
->elts
[*pos
].opcode
)
9409 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9410 &num_indices
, max_indices
,
9411 low_index
, high_index
);
9414 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9415 &num_indices
, max_indices
,
9416 low_index
, high_index
);
9420 error (_("Misplaced 'others' clause"));
9421 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9422 num_indices
, low_index
, high_index
);
9425 error (_("Internal error: bad aggregate clause"));
9432 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9433 construct at *POS, updating *POS past the construct, given that
9434 the positions are relative to lower bound LOW, where HIGH is the
9435 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9436 updating *NUM_INDICES as needed. CONTAINER is as for
9437 assign_aggregate. */
9439 aggregate_assign_positional (struct value
*container
,
9440 struct value
*lhs
, struct expression
*exp
,
9441 int *pos
, LONGEST
*indices
, int *num_indices
,
9442 int max_indices
, LONGEST low
, LONGEST high
)
9444 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9446 if (ind
- 1 == high
)
9447 warning (_("Extra components in aggregate ignored."));
9450 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9452 assign_component (container
, lhs
, ind
, exp
, pos
);
9455 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9458 /* Assign into the components of LHS indexed by the OP_CHOICES
9459 construct at *POS, updating *POS past the construct, given that
9460 the allowable indices are LOW..HIGH. Record the indices assigned
9461 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9462 needed. CONTAINER is as for assign_aggregate. */
9464 aggregate_assign_from_choices (struct value
*container
,
9465 struct value
*lhs
, struct expression
*exp
,
9466 int *pos
, LONGEST
*indices
, int *num_indices
,
9467 int max_indices
, LONGEST low
, LONGEST high
)
9470 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9471 int choice_pos
, expr_pc
;
9472 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9474 choice_pos
= *pos
+= 3;
9476 for (j
= 0; j
< n_choices
; j
+= 1)
9477 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9479 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9481 for (j
= 0; j
< n_choices
; j
+= 1)
9483 LONGEST lower
, upper
;
9484 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9486 if (op
== OP_DISCRETE_RANGE
)
9489 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9491 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9496 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9508 name
= &exp
->elts
[choice_pos
+ 2].string
;
9511 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9514 error (_("Invalid record component association."));
9516 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9518 if (! find_struct_field (name
, value_type (lhs
), 0,
9519 NULL
, NULL
, NULL
, NULL
, &ind
))
9520 error (_("Unknown component name: %s."), name
);
9521 lower
= upper
= ind
;
9524 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9525 error (_("Index in component association out of bounds."));
9527 add_component_interval (lower
, upper
, indices
, num_indices
,
9529 while (lower
<= upper
)
9534 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9540 /* Assign the value of the expression in the OP_OTHERS construct in
9541 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9542 have not been previously assigned. The index intervals already assigned
9543 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9544 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9546 aggregate_assign_others (struct value
*container
,
9547 struct value
*lhs
, struct expression
*exp
,
9548 int *pos
, LONGEST
*indices
, int num_indices
,
9549 LONGEST low
, LONGEST high
)
9552 int expr_pc
= *pos
+ 1;
9554 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9558 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9563 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9566 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9569 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9570 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9571 modifying *SIZE as needed. It is an error if *SIZE exceeds
9572 MAX_SIZE. The resulting intervals do not overlap. */
9574 add_component_interval (LONGEST low
, LONGEST high
,
9575 LONGEST
* indices
, int *size
, int max_size
)
9579 for (i
= 0; i
< *size
; i
+= 2) {
9580 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9584 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9585 if (high
< indices
[kh
])
9587 if (low
< indices
[i
])
9589 indices
[i
+ 1] = indices
[kh
- 1];
9590 if (high
> indices
[i
+ 1])
9591 indices
[i
+ 1] = high
;
9592 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9593 *size
-= kh
- i
- 2;
9596 else if (high
< indices
[i
])
9600 if (*size
== max_size
)
9601 error (_("Internal error: miscounted aggregate components."));
9603 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9604 indices
[j
] = indices
[j
- 2];
9606 indices
[i
+ 1] = high
;
9609 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9612 static struct value
*
9613 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9615 if (type
== ada_check_typedef (value_type (arg2
)))
9618 if (ada_is_fixed_point_type (type
))
9619 return (cast_to_fixed (type
, arg2
));
9621 if (ada_is_fixed_point_type (value_type (arg2
)))
9622 return cast_from_fixed (type
, arg2
);
9624 return value_cast (type
, arg2
);
9627 /* Evaluating Ada expressions, and printing their result.
9628 ------------------------------------------------------
9633 We usually evaluate an Ada expression in order to print its value.
9634 We also evaluate an expression in order to print its type, which
9635 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9636 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9637 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9638 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9641 Evaluating expressions is a little more complicated for Ada entities
9642 than it is for entities in languages such as C. The main reason for
9643 this is that Ada provides types whose definition might be dynamic.
9644 One example of such types is variant records. Or another example
9645 would be an array whose bounds can only be known at run time.
9647 The following description is a general guide as to what should be
9648 done (and what should NOT be done) in order to evaluate an expression
9649 involving such types, and when. This does not cover how the semantic
9650 information is encoded by GNAT as this is covered separatly. For the
9651 document used as the reference for the GNAT encoding, see exp_dbug.ads
9652 in the GNAT sources.
9654 Ideally, we should embed each part of this description next to its
9655 associated code. Unfortunately, the amount of code is so vast right
9656 now that it's hard to see whether the code handling a particular
9657 situation might be duplicated or not. One day, when the code is
9658 cleaned up, this guide might become redundant with the comments
9659 inserted in the code, and we might want to remove it.
9661 2. ``Fixing'' an Entity, the Simple Case:
9662 -----------------------------------------
9664 When evaluating Ada expressions, the tricky issue is that they may
9665 reference entities whose type contents and size are not statically
9666 known. Consider for instance a variant record:
9668 type Rec (Empty : Boolean := True) is record
9671 when False => Value : Integer;
9674 Yes : Rec := (Empty => False, Value => 1);
9675 No : Rec := (empty => True);
9677 The size and contents of that record depends on the value of the
9678 descriminant (Rec.Empty). At this point, neither the debugging
9679 information nor the associated type structure in GDB are able to
9680 express such dynamic types. So what the debugger does is to create
9681 "fixed" versions of the type that applies to the specific object.
9682 We also informally refer to this opperation as "fixing" an object,
9683 which means creating its associated fixed type.
9685 Example: when printing the value of variable "Yes" above, its fixed
9686 type would look like this:
9693 On the other hand, if we printed the value of "No", its fixed type
9700 Things become a little more complicated when trying to fix an entity
9701 with a dynamic type that directly contains another dynamic type,
9702 such as an array of variant records, for instance. There are
9703 two possible cases: Arrays, and records.
9705 3. ``Fixing'' Arrays:
9706 ---------------------
9708 The type structure in GDB describes an array in terms of its bounds,
9709 and the type of its elements. By design, all elements in the array
9710 have the same type and we cannot represent an array of variant elements
9711 using the current type structure in GDB. When fixing an array,
9712 we cannot fix the array element, as we would potentially need one
9713 fixed type per element of the array. As a result, the best we can do
9714 when fixing an array is to produce an array whose bounds and size
9715 are correct (allowing us to read it from memory), but without having
9716 touched its element type. Fixing each element will be done later,
9717 when (if) necessary.
9719 Arrays are a little simpler to handle than records, because the same
9720 amount of memory is allocated for each element of the array, even if
9721 the amount of space actually used by each element differs from element
9722 to element. Consider for instance the following array of type Rec:
9724 type Rec_Array is array (1 .. 2) of Rec;
9726 The actual amount of memory occupied by each element might be different
9727 from element to element, depending on the value of their discriminant.
9728 But the amount of space reserved for each element in the array remains
9729 fixed regardless. So we simply need to compute that size using
9730 the debugging information available, from which we can then determine
9731 the array size (we multiply the number of elements of the array by
9732 the size of each element).
9734 The simplest case is when we have an array of a constrained element
9735 type. For instance, consider the following type declarations:
9737 type Bounded_String (Max_Size : Integer) is
9739 Buffer : String (1 .. Max_Size);
9741 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9743 In this case, the compiler describes the array as an array of
9744 variable-size elements (identified by its XVS suffix) for which
9745 the size can be read in the parallel XVZ variable.
9747 In the case of an array of an unconstrained element type, the compiler
9748 wraps the array element inside a private PAD type. This type should not
9749 be shown to the user, and must be "unwrap"'ed before printing. Note
9750 that we also use the adjective "aligner" in our code to designate
9751 these wrapper types.
9753 In some cases, the size allocated for each element is statically
9754 known. In that case, the PAD type already has the correct size,
9755 and the array element should remain unfixed.
9757 But there are cases when this size is not statically known.
9758 For instance, assuming that "Five" is an integer variable:
9760 type Dynamic is array (1 .. Five) of Integer;
9761 type Wrapper (Has_Length : Boolean := False) is record
9764 when True => Length : Integer;
9768 type Wrapper_Array is array (1 .. 2) of Wrapper;
9770 Hello : Wrapper_Array := (others => (Has_Length => True,
9771 Data => (others => 17),
9775 The debugging info would describe variable Hello as being an
9776 array of a PAD type. The size of that PAD type is not statically
9777 known, but can be determined using a parallel XVZ variable.
9778 In that case, a copy of the PAD type with the correct size should
9779 be used for the fixed array.
9781 3. ``Fixing'' record type objects:
9782 ----------------------------------
9784 Things are slightly different from arrays in the case of dynamic
9785 record types. In this case, in order to compute the associated
9786 fixed type, we need to determine the size and offset of each of
9787 its components. This, in turn, requires us to compute the fixed
9788 type of each of these components.
9790 Consider for instance the example:
9792 type Bounded_String (Max_Size : Natural) is record
9793 Str : String (1 .. Max_Size);
9796 My_String : Bounded_String (Max_Size => 10);
9798 In that case, the position of field "Length" depends on the size
9799 of field Str, which itself depends on the value of the Max_Size
9800 discriminant. In order to fix the type of variable My_String,
9801 we need to fix the type of field Str. Therefore, fixing a variant
9802 record requires us to fix each of its components.
9804 However, if a component does not have a dynamic size, the component
9805 should not be fixed. In particular, fields that use a PAD type
9806 should not fixed. Here is an example where this might happen
9807 (assuming type Rec above):
9809 type Container (Big : Boolean) is record
9813 when True => Another : Integer;
9817 My_Container : Container := (Big => False,
9818 First => (Empty => True),
9821 In that example, the compiler creates a PAD type for component First,
9822 whose size is constant, and then positions the component After just
9823 right after it. The offset of component After is therefore constant
9826 The debugger computes the position of each field based on an algorithm
9827 that uses, among other things, the actual position and size of the field
9828 preceding it. Let's now imagine that the user is trying to print
9829 the value of My_Container. If the type fixing was recursive, we would
9830 end up computing the offset of field After based on the size of the
9831 fixed version of field First. And since in our example First has
9832 only one actual field, the size of the fixed type is actually smaller
9833 than the amount of space allocated to that field, and thus we would
9834 compute the wrong offset of field After.
9836 To make things more complicated, we need to watch out for dynamic
9837 components of variant records (identified by the ___XVL suffix in
9838 the component name). Even if the target type is a PAD type, the size
9839 of that type might not be statically known. So the PAD type needs
9840 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9841 we might end up with the wrong size for our component. This can be
9842 observed with the following type declarations:
9844 type Octal is new Integer range 0 .. 7;
9845 type Octal_Array is array (Positive range <>) of Octal;
9846 pragma Pack (Octal_Array);
9848 type Octal_Buffer (Size : Positive) is record
9849 Buffer : Octal_Array (1 .. Size);
9853 In that case, Buffer is a PAD type whose size is unset and needs
9854 to be computed by fixing the unwrapped type.
9856 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9857 ----------------------------------------------------------
9859 Lastly, when should the sub-elements of an entity that remained unfixed
9860 thus far, be actually fixed?
9862 The answer is: Only when referencing that element. For instance
9863 when selecting one component of a record, this specific component
9864 should be fixed at that point in time. Or when printing the value
9865 of a record, each component should be fixed before its value gets
9866 printed. Similarly for arrays, the element of the array should be
9867 fixed when printing each element of the array, or when extracting
9868 one element out of that array. On the other hand, fixing should
9869 not be performed on the elements when taking a slice of an array!
9871 Note that one of the side-effects of miscomputing the offset and
9872 size of each field is that we end up also miscomputing the size
9873 of the containing type. This can have adverse results when computing
9874 the value of an entity. GDB fetches the value of an entity based
9875 on the size of its type, and thus a wrong size causes GDB to fetch
9876 the wrong amount of memory. In the case where the computed size is
9877 too small, GDB fetches too little data to print the value of our
9878 entiry. Results in this case as unpredicatble, as we usually read
9879 past the buffer containing the data =:-o. */
9881 /* Implement the evaluate_exp routine in the exp_descriptor structure
9882 for the Ada language. */
9884 static struct value
*
9885 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9886 int *pos
, enum noside noside
)
9892 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9895 struct value
**argvec
;
9899 op
= exp
->elts
[pc
].opcode
;
9905 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9907 if (noside
== EVAL_NORMAL
)
9908 arg1
= unwrap_value (arg1
);
9910 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9911 then we need to perform the conversion manually, because
9912 evaluate_subexp_standard doesn't do it. This conversion is
9913 necessary in Ada because the different kinds of float/fixed
9914 types in Ada have different representations.
9916 Similarly, we need to perform the conversion from OP_LONG
9918 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9919 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9925 struct value
*result
;
9928 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9929 /* The result type will have code OP_STRING, bashed there from
9930 OP_ARRAY. Bash it back. */
9931 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9932 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9938 type
= exp
->elts
[pc
+ 1].type
;
9939 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9940 if (noside
== EVAL_SKIP
)
9942 arg1
= ada_value_cast (type
, arg1
, noside
);
9947 type
= exp
->elts
[pc
+ 1].type
;
9948 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9951 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9952 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9954 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9955 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9957 return ada_value_assign (arg1
, arg1
);
9959 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9960 except if the lhs of our assignment is a convenience variable.
9961 In the case of assigning to a convenience variable, the lhs
9962 should be exactly the result of the evaluation of the rhs. */
9963 type
= value_type (arg1
);
9964 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9966 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9967 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9969 if (ada_is_fixed_point_type (value_type (arg1
)))
9970 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9971 else if (ada_is_fixed_point_type (value_type (arg2
)))
9973 (_("Fixed-point values must be assigned to fixed-point variables"));
9975 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9976 return ada_value_assign (arg1
, arg2
);
9979 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9980 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9981 if (noside
== EVAL_SKIP
)
9983 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9984 return (value_from_longest
9986 value_as_long (arg1
) + value_as_long (arg2
)));
9987 if ((ada_is_fixed_point_type (value_type (arg1
))
9988 || ada_is_fixed_point_type (value_type (arg2
)))
9989 && value_type (arg1
) != value_type (arg2
))
9990 error (_("Operands of fixed-point addition must have the same type"));
9991 /* Do the addition, and cast the result to the type of the first
9992 argument. We cannot cast the result to a reference type, so if
9993 ARG1 is a reference type, find its underlying type. */
9994 type
= value_type (arg1
);
9995 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9996 type
= TYPE_TARGET_TYPE (type
);
9997 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9998 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10001 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10002 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10003 if (noside
== EVAL_SKIP
)
10005 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10006 return (value_from_longest
10007 (value_type (arg1
),
10008 value_as_long (arg1
) - value_as_long (arg2
)));
10009 if ((ada_is_fixed_point_type (value_type (arg1
))
10010 || ada_is_fixed_point_type (value_type (arg2
)))
10011 && value_type (arg1
) != value_type (arg2
))
10012 error (_("Operands of fixed-point subtraction "
10013 "must have the same type"));
10014 /* Do the substraction, and cast the result to the type of the first
10015 argument. We cannot cast the result to a reference type, so if
10016 ARG1 is a reference type, find its underlying type. */
10017 type
= value_type (arg1
);
10018 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10019 type
= TYPE_TARGET_TYPE (type
);
10020 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10021 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10027 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10028 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10029 if (noside
== EVAL_SKIP
)
10031 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10033 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10034 return value_zero (value_type (arg1
), not_lval
);
10038 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10039 if (ada_is_fixed_point_type (value_type (arg1
)))
10040 arg1
= cast_from_fixed (type
, arg1
);
10041 if (ada_is_fixed_point_type (value_type (arg2
)))
10042 arg2
= cast_from_fixed (type
, arg2
);
10043 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10044 return ada_value_binop (arg1
, arg2
, op
);
10048 case BINOP_NOTEQUAL
:
10049 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10050 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10051 if (noside
== EVAL_SKIP
)
10053 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10057 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10058 tem
= ada_value_equal (arg1
, arg2
);
10060 if (op
== BINOP_NOTEQUAL
)
10062 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10063 return value_from_longest (type
, (LONGEST
) tem
);
10066 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10067 if (noside
== EVAL_SKIP
)
10069 else if (ada_is_fixed_point_type (value_type (arg1
)))
10070 return value_cast (value_type (arg1
), value_neg (arg1
));
10073 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10074 return value_neg (arg1
);
10077 case BINOP_LOGICAL_AND
:
10078 case BINOP_LOGICAL_OR
:
10079 case UNOP_LOGICAL_NOT
:
10084 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10085 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10086 return value_cast (type
, val
);
10089 case BINOP_BITWISE_AND
:
10090 case BINOP_BITWISE_IOR
:
10091 case BINOP_BITWISE_XOR
:
10095 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10097 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10099 return value_cast (value_type (arg1
), val
);
10105 if (noside
== EVAL_SKIP
)
10110 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10111 /* Only encountered when an unresolved symbol occurs in a
10112 context other than a function call, in which case, it is
10114 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10115 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10116 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10118 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10119 /* Check to see if this is a tagged type. We also need to handle
10120 the case where the type is a reference to a tagged type, but
10121 we have to be careful to exclude pointers to tagged types.
10122 The latter should be shown as usual (as a pointer), whereas
10123 a reference should mostly be transparent to the user. */
10124 if (ada_is_tagged_type (type
, 0)
10125 || (TYPE_CODE (type
) == TYPE_CODE_REF
10126 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10128 /* Tagged types are a little special in the fact that the real
10129 type is dynamic and can only be determined by inspecting the
10130 object's tag. This means that we need to get the object's
10131 value first (EVAL_NORMAL) and then extract the actual object
10134 Note that we cannot skip the final step where we extract
10135 the object type from its tag, because the EVAL_NORMAL phase
10136 results in dynamic components being resolved into fixed ones.
10137 This can cause problems when trying to print the type
10138 description of tagged types whose parent has a dynamic size:
10139 We use the type name of the "_parent" component in order
10140 to print the name of the ancestor type in the type description.
10141 If that component had a dynamic size, the resolution into
10142 a fixed type would result in the loss of that type name,
10143 thus preventing us from printing the name of the ancestor
10144 type in the type description. */
10145 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10147 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10149 struct type
*actual_type
;
10151 actual_type
= type_from_tag (ada_value_tag (arg1
));
10152 if (actual_type
== NULL
)
10153 /* If, for some reason, we were unable to determine
10154 the actual type from the tag, then use the static
10155 approximation that we just computed as a fallback.
10156 This can happen if the debugging information is
10157 incomplete, for instance. */
10158 actual_type
= type
;
10159 return value_zero (actual_type
, not_lval
);
10163 /* In the case of a ref, ada_coerce_ref takes care
10164 of determining the actual type. But the evaluation
10165 should return a ref as it should be valid to ask
10166 for its address; so rebuild a ref after coerce. */
10167 arg1
= ada_coerce_ref (arg1
);
10168 return value_ref (arg1
);
10174 (to_static_fixed_type
10175 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
10180 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10181 return ada_to_fixed_value (arg1
);
10187 /* Allocate arg vector, including space for the function to be
10188 called in argvec[0] and a terminating NULL. */
10189 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10191 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10193 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10194 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10195 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10196 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10199 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10200 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10203 if (noside
== EVAL_SKIP
)
10207 if (ada_is_constrained_packed_array_type
10208 (desc_base_type (value_type (argvec
[0]))))
10209 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10210 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10211 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10212 /* This is a packed array that has already been fixed, and
10213 therefore already coerced to a simple array. Nothing further
10216 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10217 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10218 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10219 argvec
[0] = value_addr (argvec
[0]);
10221 type
= ada_check_typedef (value_type (argvec
[0]));
10223 /* Ada allows us to implicitly dereference arrays when subscripting
10224 them. So, if this is an array typedef (encoding use for array
10225 access types encoded as fat pointers), strip it now. */
10226 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10227 type
= ada_typedef_target_type (type
);
10229 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10231 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10233 case TYPE_CODE_FUNC
:
10234 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10236 case TYPE_CODE_ARRAY
:
10238 case TYPE_CODE_STRUCT
:
10239 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10240 argvec
[0] = ada_value_ind (argvec
[0]);
10241 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10244 error (_("cannot subscript or call something of type `%s'"),
10245 ada_type_name (value_type (argvec
[0])));
10250 switch (TYPE_CODE (type
))
10252 case TYPE_CODE_FUNC
:
10253 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10255 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10257 if (TYPE_GNU_IFUNC (type
))
10258 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10259 return allocate_value (rtype
);
10261 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10262 case TYPE_CODE_INTERNAL_FUNCTION
:
10263 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10264 /* We don't know anything about what the internal
10265 function might return, but we have to return
10267 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10270 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10271 argvec
[0], nargs
, argvec
+ 1);
10273 case TYPE_CODE_STRUCT
:
10277 arity
= ada_array_arity (type
);
10278 type
= ada_array_element_type (type
, nargs
);
10280 error (_("cannot subscript or call a record"));
10281 if (arity
!= nargs
)
10282 error (_("wrong number of subscripts; expecting %d"), arity
);
10283 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10284 return value_zero (ada_aligned_type (type
), lval_memory
);
10286 unwrap_value (ada_value_subscript
10287 (argvec
[0], nargs
, argvec
+ 1));
10289 case TYPE_CODE_ARRAY
:
10290 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10292 type
= ada_array_element_type (type
, nargs
);
10294 error (_("element type of array unknown"));
10296 return value_zero (ada_aligned_type (type
), lval_memory
);
10299 unwrap_value (ada_value_subscript
10300 (ada_coerce_to_simple_array (argvec
[0]),
10301 nargs
, argvec
+ 1));
10302 case TYPE_CODE_PTR
: /* Pointer to array */
10303 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10304 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10306 type
= ada_array_element_type (type
, nargs
);
10308 error (_("element type of array unknown"));
10310 return value_zero (ada_aligned_type (type
), lval_memory
);
10313 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
10314 nargs
, argvec
+ 1));
10317 error (_("Attempt to index or call something other than an "
10318 "array or function"));
10323 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10324 struct value
*low_bound_val
=
10325 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10326 struct value
*high_bound_val
=
10327 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10329 LONGEST high_bound
;
10331 low_bound_val
= coerce_ref (low_bound_val
);
10332 high_bound_val
= coerce_ref (high_bound_val
);
10333 low_bound
= pos_atr (low_bound_val
);
10334 high_bound
= pos_atr (high_bound_val
);
10336 if (noside
== EVAL_SKIP
)
10339 /* If this is a reference to an aligner type, then remove all
10341 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10342 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10343 TYPE_TARGET_TYPE (value_type (array
)) =
10344 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10346 if (ada_is_constrained_packed_array_type (value_type (array
)))
10347 error (_("cannot slice a packed array"));
10349 /* If this is a reference to an array or an array lvalue,
10350 convert to a pointer. */
10351 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10352 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10353 && VALUE_LVAL (array
) == lval_memory
))
10354 array
= value_addr (array
);
10356 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10357 && ada_is_array_descriptor_type (ada_check_typedef
10358 (value_type (array
))))
10359 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10361 array
= ada_coerce_to_simple_array_ptr (array
);
10363 /* If we have more than one level of pointer indirection,
10364 dereference the value until we get only one level. */
10365 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10366 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10368 array
= value_ind (array
);
10370 /* Make sure we really do have an array type before going further,
10371 to avoid a SEGV when trying to get the index type or the target
10372 type later down the road if the debug info generated by
10373 the compiler is incorrect or incomplete. */
10374 if (!ada_is_simple_array_type (value_type (array
)))
10375 error (_("cannot take slice of non-array"));
10377 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10380 struct type
*type0
= ada_check_typedef (value_type (array
));
10382 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10383 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10386 struct type
*arr_type0
=
10387 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10389 return ada_value_slice_from_ptr (array
, arr_type0
,
10390 longest_to_int (low_bound
),
10391 longest_to_int (high_bound
));
10394 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10396 else if (high_bound
< low_bound
)
10397 return empty_array (value_type (array
), low_bound
);
10399 return ada_value_slice (array
, longest_to_int (low_bound
),
10400 longest_to_int (high_bound
));
10403 case UNOP_IN_RANGE
:
10405 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10406 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10408 if (noside
== EVAL_SKIP
)
10411 switch (TYPE_CODE (type
))
10414 lim_warning (_("Membership test incompletely implemented; "
10415 "always returns true"));
10416 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10417 return value_from_longest (type
, (LONGEST
) 1);
10419 case TYPE_CODE_RANGE
:
10420 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10421 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10422 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10423 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10424 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10426 value_from_longest (type
,
10427 (value_less (arg1
, arg3
)
10428 || value_equal (arg1
, arg3
))
10429 && (value_less (arg2
, arg1
)
10430 || value_equal (arg2
, arg1
)));
10433 case BINOP_IN_BOUNDS
:
10435 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10436 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10438 if (noside
== EVAL_SKIP
)
10441 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10443 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10444 return value_zero (type
, not_lval
);
10447 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10449 type
= ada_index_type (value_type (arg2
), tem
, "range");
10451 type
= value_type (arg1
);
10453 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10454 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10456 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10457 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10458 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10460 value_from_longest (type
,
10461 (value_less (arg1
, arg3
)
10462 || value_equal (arg1
, arg3
))
10463 && (value_less (arg2
, arg1
)
10464 || value_equal (arg2
, arg1
)));
10466 case TERNOP_IN_RANGE
:
10467 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10468 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10469 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10471 if (noside
== EVAL_SKIP
)
10474 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10475 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10476 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10478 value_from_longest (type
,
10479 (value_less (arg1
, arg3
)
10480 || value_equal (arg1
, arg3
))
10481 && (value_less (arg2
, arg1
)
10482 || value_equal (arg2
, arg1
)));
10486 case OP_ATR_LENGTH
:
10488 struct type
*type_arg
;
10490 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10492 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10494 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10498 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10502 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10503 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10504 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10507 if (noside
== EVAL_SKIP
)
10510 if (type_arg
== NULL
)
10512 arg1
= ada_coerce_ref (arg1
);
10514 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10515 arg1
= ada_coerce_to_simple_array (arg1
);
10517 if (op
== OP_ATR_LENGTH
)
10518 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10521 type
= ada_index_type (value_type (arg1
), tem
,
10522 ada_attribute_name (op
));
10524 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10527 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10528 return allocate_value (type
);
10532 default: /* Should never happen. */
10533 error (_("unexpected attribute encountered"));
10535 return value_from_longest
10536 (type
, ada_array_bound (arg1
, tem
, 0));
10538 return value_from_longest
10539 (type
, ada_array_bound (arg1
, tem
, 1));
10540 case OP_ATR_LENGTH
:
10541 return value_from_longest
10542 (type
, ada_array_length (arg1
, tem
));
10545 else if (discrete_type_p (type_arg
))
10547 struct type
*range_type
;
10548 const char *name
= ada_type_name (type_arg
);
10551 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10552 range_type
= to_fixed_range_type (type_arg
, NULL
);
10553 if (range_type
== NULL
)
10554 range_type
= type_arg
;
10558 error (_("unexpected attribute encountered"));
10560 return value_from_longest
10561 (range_type
, ada_discrete_type_low_bound (range_type
));
10563 return value_from_longest
10564 (range_type
, ada_discrete_type_high_bound (range_type
));
10565 case OP_ATR_LENGTH
:
10566 error (_("the 'length attribute applies only to array types"));
10569 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10570 error (_("unimplemented type attribute"));
10575 if (ada_is_constrained_packed_array_type (type_arg
))
10576 type_arg
= decode_constrained_packed_array_type (type_arg
);
10578 if (op
== OP_ATR_LENGTH
)
10579 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10582 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10584 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10587 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10588 return allocate_value (type
);
10593 error (_("unexpected attribute encountered"));
10595 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10596 return value_from_longest (type
, low
);
10598 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10599 return value_from_longest (type
, high
);
10600 case OP_ATR_LENGTH
:
10601 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10602 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10603 return value_from_longest (type
, high
- low
+ 1);
10609 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10610 if (noside
== EVAL_SKIP
)
10613 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10614 return value_zero (ada_tag_type (arg1
), not_lval
);
10616 return ada_value_tag (arg1
);
10620 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10621 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10622 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10623 if (noside
== EVAL_SKIP
)
10625 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10626 return value_zero (value_type (arg1
), not_lval
);
10629 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10630 return value_binop (arg1
, arg2
,
10631 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10634 case OP_ATR_MODULUS
:
10636 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10638 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10639 if (noside
== EVAL_SKIP
)
10642 if (!ada_is_modular_type (type_arg
))
10643 error (_("'modulus must be applied to modular type"));
10645 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10646 ada_modulus (type_arg
));
10651 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10652 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10653 if (noside
== EVAL_SKIP
)
10655 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10656 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10657 return value_zero (type
, not_lval
);
10659 return value_pos_atr (type
, arg1
);
10662 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10663 type
= value_type (arg1
);
10665 /* If the argument is a reference, then dereference its type, since
10666 the user is really asking for the size of the actual object,
10667 not the size of the pointer. */
10668 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10669 type
= TYPE_TARGET_TYPE (type
);
10671 if (noside
== EVAL_SKIP
)
10673 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10674 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10676 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10677 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10680 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10681 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10682 type
= exp
->elts
[pc
+ 2].type
;
10683 if (noside
== EVAL_SKIP
)
10685 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10686 return value_zero (type
, not_lval
);
10688 return value_val_atr (type
, arg1
);
10691 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10692 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10693 if (noside
== EVAL_SKIP
)
10695 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10696 return value_zero (value_type (arg1
), not_lval
);
10699 /* For integer exponentiation operations,
10700 only promote the first argument. */
10701 if (is_integral_type (value_type (arg2
)))
10702 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10704 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10706 return value_binop (arg1
, arg2
, op
);
10710 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10711 if (noside
== EVAL_SKIP
)
10717 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10718 if (noside
== EVAL_SKIP
)
10720 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10721 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10722 return value_neg (arg1
);
10727 preeval_pos
= *pos
;
10728 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10729 if (noside
== EVAL_SKIP
)
10731 type
= ada_check_typedef (value_type (arg1
));
10732 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10734 if (ada_is_array_descriptor_type (type
))
10735 /* GDB allows dereferencing GNAT array descriptors. */
10737 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10739 if (arrType
== NULL
)
10740 error (_("Attempt to dereference null array pointer."));
10741 return value_at_lazy (arrType
, 0);
10743 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10744 || TYPE_CODE (type
) == TYPE_CODE_REF
10745 /* In C you can dereference an array to get the 1st elt. */
10746 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10748 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10749 only be determined by inspecting the object's tag.
10750 This means that we need to evaluate completely the
10751 expression in order to get its type. */
10753 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10754 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10755 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10757 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10759 type
= value_type (ada_value_ind (arg1
));
10763 type
= to_static_fixed_type
10765 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10768 return value_zero (type
, lval_memory
);
10770 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10772 /* GDB allows dereferencing an int. */
10773 if (expect_type
== NULL
)
10774 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10779 to_static_fixed_type (ada_aligned_type (expect_type
));
10780 return value_zero (expect_type
, lval_memory
);
10784 error (_("Attempt to take contents of a non-pointer value."));
10786 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10787 type
= ada_check_typedef (value_type (arg1
));
10789 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10790 /* GDB allows dereferencing an int. If we were given
10791 the expect_type, then use that as the target type.
10792 Otherwise, assume that the target type is an int. */
10794 if (expect_type
!= NULL
)
10795 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10798 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10799 (CORE_ADDR
) value_as_address (arg1
));
10802 if (ada_is_array_descriptor_type (type
))
10803 /* GDB allows dereferencing GNAT array descriptors. */
10804 return ada_coerce_to_simple_array (arg1
);
10806 return ada_value_ind (arg1
);
10808 case STRUCTOP_STRUCT
:
10809 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10810 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10811 preeval_pos
= *pos
;
10812 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10813 if (noside
== EVAL_SKIP
)
10815 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10817 struct type
*type1
= value_type (arg1
);
10819 if (ada_is_tagged_type (type1
, 1))
10821 type
= ada_lookup_struct_elt_type (type1
,
10822 &exp
->elts
[pc
+ 2].string
,
10825 /* If the field is not found, check if it exists in the
10826 extension of this object's type. This means that we
10827 need to evaluate completely the expression. */
10831 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10833 arg1
= ada_value_struct_elt (arg1
,
10834 &exp
->elts
[pc
+ 2].string
,
10836 arg1
= unwrap_value (arg1
);
10837 type
= value_type (ada_to_fixed_value (arg1
));
10842 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10845 return value_zero (ada_aligned_type (type
), lval_memory
);
10848 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10849 arg1
= unwrap_value (arg1
);
10850 return ada_to_fixed_value (arg1
);
10853 /* The value is not supposed to be used. This is here to make it
10854 easier to accommodate expressions that contain types. */
10856 if (noside
== EVAL_SKIP
)
10858 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10859 return allocate_value (exp
->elts
[pc
+ 1].type
);
10861 error (_("Attempt to use a type name as an expression"));
10866 case OP_DISCRETE_RANGE
:
10867 case OP_POSITIONAL
:
10869 if (noside
== EVAL_NORMAL
)
10873 error (_("Undefined name, ambiguous name, or renaming used in "
10874 "component association: %s."), &exp
->elts
[pc
+2].string
);
10876 error (_("Aggregates only allowed on the right of an assignment"));
10878 internal_error (__FILE__
, __LINE__
,
10879 _("aggregate apparently mangled"));
10882 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10884 for (tem
= 0; tem
< nargs
; tem
+= 1)
10885 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10890 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10896 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10897 type name that encodes the 'small and 'delta information.
10898 Otherwise, return NULL. */
10900 static const char *
10901 fixed_type_info (struct type
*type
)
10903 const char *name
= ada_type_name (type
);
10904 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10906 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10908 const char *tail
= strstr (name
, "___XF_");
10915 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10916 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10921 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10924 ada_is_fixed_point_type (struct type
*type
)
10926 return fixed_type_info (type
) != NULL
;
10929 /* Return non-zero iff TYPE represents a System.Address type. */
10932 ada_is_system_address_type (struct type
*type
)
10934 return (TYPE_NAME (type
)
10935 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10938 /* Assuming that TYPE is the representation of an Ada fixed-point
10939 type, return its delta, or -1 if the type is malformed and the
10940 delta cannot be determined. */
10943 ada_delta (struct type
*type
)
10945 const char *encoding
= fixed_type_info (type
);
10948 /* Strictly speaking, num and den are encoded as integer. However,
10949 they may not fit into a long, and they will have to be converted
10950 to DOUBLEST anyway. So scan them as DOUBLEST. */
10951 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10958 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10959 factor ('SMALL value) associated with the type. */
10962 scaling_factor (struct type
*type
)
10964 const char *encoding
= fixed_type_info (type
);
10965 DOUBLEST num0
, den0
, num1
, den1
;
10968 /* Strictly speaking, num's and den's are encoded as integer. However,
10969 they may not fit into a long, and they will have to be converted
10970 to DOUBLEST anyway. So scan them as DOUBLEST. */
10971 n
= sscanf (encoding
,
10972 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10973 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10974 &num0
, &den0
, &num1
, &den1
);
10979 return num1
/ den1
;
10981 return num0
/ den0
;
10985 /* Assuming that X is the representation of a value of fixed-point
10986 type TYPE, return its floating-point equivalent. */
10989 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10991 return (DOUBLEST
) x
*scaling_factor (type
);
10994 /* The representation of a fixed-point value of type TYPE
10995 corresponding to the value X. */
10998 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11000 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11007 /* Scan STR beginning at position K for a discriminant name, and
11008 return the value of that discriminant field of DVAL in *PX. If
11009 PNEW_K is not null, put the position of the character beyond the
11010 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11011 not alter *PX and *PNEW_K if unsuccessful. */
11014 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11017 static char *bound_buffer
= NULL
;
11018 static size_t bound_buffer_len
= 0;
11021 struct value
*bound_val
;
11023 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11026 pend
= strstr (str
+ k
, "__");
11030 k
+= strlen (bound
);
11034 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11035 bound
= bound_buffer
;
11036 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11037 bound
[pend
- (str
+ k
)] = '\0';
11041 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11042 if (bound_val
== NULL
)
11045 *px
= value_as_long (bound_val
);
11046 if (pnew_k
!= NULL
)
11051 /* Value of variable named NAME in the current environment. If
11052 no such variable found, then if ERR_MSG is null, returns 0, and
11053 otherwise causes an error with message ERR_MSG. */
11055 static struct value
*
11056 get_var_value (char *name
, char *err_msg
)
11058 struct ada_symbol_info
*syms
;
11061 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11066 if (err_msg
== NULL
)
11069 error (("%s"), err_msg
);
11072 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11075 /* Value of integer variable named NAME in the current environment. If
11076 no such variable found, returns 0, and sets *FLAG to 0. If
11077 successful, sets *FLAG to 1. */
11080 get_int_var_value (char *name
, int *flag
)
11082 struct value
*var_val
= get_var_value (name
, 0);
11094 return value_as_long (var_val
);
11099 /* Return a range type whose base type is that of the range type named
11100 NAME in the current environment, and whose bounds are calculated
11101 from NAME according to the GNAT range encoding conventions.
11102 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11103 corresponding range type from debug information; fall back to using it
11104 if symbol lookup fails. If a new type must be created, allocate it
11105 like ORIG_TYPE was. The bounds information, in general, is encoded
11106 in NAME, the base type given in the named range type. */
11108 static struct type
*
11109 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11112 struct type
*base_type
;
11113 char *subtype_info
;
11115 gdb_assert (raw_type
!= NULL
);
11116 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11118 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11119 base_type
= TYPE_TARGET_TYPE (raw_type
);
11121 base_type
= raw_type
;
11123 name
= TYPE_NAME (raw_type
);
11124 subtype_info
= strstr (name
, "___XD");
11125 if (subtype_info
== NULL
)
11127 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11128 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11130 if (L
< INT_MIN
|| U
> INT_MAX
)
11133 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11138 static char *name_buf
= NULL
;
11139 static size_t name_len
= 0;
11140 int prefix_len
= subtype_info
- name
;
11146 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11147 strncpy (name_buf
, name
, prefix_len
);
11148 name_buf
[prefix_len
] = '\0';
11151 bounds_str
= strchr (subtype_info
, '_');
11154 if (*subtype_info
== 'L')
11156 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11157 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11159 if (bounds_str
[n
] == '_')
11161 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11169 strcpy (name_buf
+ prefix_len
, "___L");
11170 L
= get_int_var_value (name_buf
, &ok
);
11173 lim_warning (_("Unknown lower bound, using 1."));
11178 if (*subtype_info
== 'U')
11180 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11181 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11188 strcpy (name_buf
+ prefix_len
, "___U");
11189 U
= get_int_var_value (name_buf
, &ok
);
11192 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11197 type
= create_static_range_type (alloc_type_copy (raw_type
),
11199 TYPE_NAME (type
) = name
;
11204 /* True iff NAME is the name of a range type. */
11207 ada_is_range_type_name (const char *name
)
11209 return (name
!= NULL
&& strstr (name
, "___XD"));
11213 /* Modular types */
11215 /* True iff TYPE is an Ada modular type. */
11218 ada_is_modular_type (struct type
*type
)
11220 struct type
*subranged_type
= get_base_type (type
);
11222 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11223 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11224 && TYPE_UNSIGNED (subranged_type
));
11227 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11230 ada_modulus (struct type
*type
)
11232 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11236 /* Ada exception catchpoint support:
11237 ---------------------------------
11239 We support 3 kinds of exception catchpoints:
11240 . catchpoints on Ada exceptions
11241 . catchpoints on unhandled Ada exceptions
11242 . catchpoints on failed assertions
11244 Exceptions raised during failed assertions, or unhandled exceptions
11245 could perfectly be caught with the general catchpoint on Ada exceptions.
11246 However, we can easily differentiate these two special cases, and having
11247 the option to distinguish these two cases from the rest can be useful
11248 to zero-in on certain situations.
11250 Exception catchpoints are a specialized form of breakpoint,
11251 since they rely on inserting breakpoints inside known routines
11252 of the GNAT runtime. The implementation therefore uses a standard
11253 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11256 Support in the runtime for exception catchpoints have been changed
11257 a few times already, and these changes affect the implementation
11258 of these catchpoints. In order to be able to support several
11259 variants of the runtime, we use a sniffer that will determine
11260 the runtime variant used by the program being debugged. */
11262 /* Ada's standard exceptions. */
11264 static char *standard_exc
[] = {
11265 "constraint_error",
11271 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11273 /* A structure that describes how to support exception catchpoints
11274 for a given executable. */
11276 struct exception_support_info
11278 /* The name of the symbol to break on in order to insert
11279 a catchpoint on exceptions. */
11280 const char *catch_exception_sym
;
11282 /* The name of the symbol to break on in order to insert
11283 a catchpoint on unhandled exceptions. */
11284 const char *catch_exception_unhandled_sym
;
11286 /* The name of the symbol to break on in order to insert
11287 a catchpoint on failed assertions. */
11288 const char *catch_assert_sym
;
11290 /* Assuming that the inferior just triggered an unhandled exception
11291 catchpoint, this function is responsible for returning the address
11292 in inferior memory where the name of that exception is stored.
11293 Return zero if the address could not be computed. */
11294 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11297 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11298 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11300 /* The following exception support info structure describes how to
11301 implement exception catchpoints with the latest version of the
11302 Ada runtime (as of 2007-03-06). */
11304 static const struct exception_support_info default_exception_support_info
=
11306 "__gnat_debug_raise_exception", /* catch_exception_sym */
11307 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11308 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11309 ada_unhandled_exception_name_addr
11312 /* The following exception support info structure describes how to
11313 implement exception catchpoints with a slightly older version
11314 of the Ada runtime. */
11316 static const struct exception_support_info exception_support_info_fallback
=
11318 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11319 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11320 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11321 ada_unhandled_exception_name_addr_from_raise
11324 /* Return nonzero if we can detect the exception support routines
11325 described in EINFO.
11327 This function errors out if an abnormal situation is detected
11328 (for instance, if we find the exception support routines, but
11329 that support is found to be incomplete). */
11332 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11334 struct symbol
*sym
;
11336 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11337 that should be compiled with debugging information. As a result, we
11338 expect to find that symbol in the symtabs. */
11340 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11343 /* Perhaps we did not find our symbol because the Ada runtime was
11344 compiled without debugging info, or simply stripped of it.
11345 It happens on some GNU/Linux distributions for instance, where
11346 users have to install a separate debug package in order to get
11347 the runtime's debugging info. In that situation, let the user
11348 know why we cannot insert an Ada exception catchpoint.
11350 Note: Just for the purpose of inserting our Ada exception
11351 catchpoint, we could rely purely on the associated minimal symbol.
11352 But we would be operating in degraded mode anyway, since we are
11353 still lacking the debugging info needed later on to extract
11354 the name of the exception being raised (this name is printed in
11355 the catchpoint message, and is also used when trying to catch
11356 a specific exception). We do not handle this case for now. */
11357 struct bound_minimal_symbol msym
11358 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11360 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11361 error (_("Your Ada runtime appears to be missing some debugging "
11362 "information.\nCannot insert Ada exception catchpoint "
11363 "in this configuration."));
11368 /* Make sure that the symbol we found corresponds to a function. */
11370 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11371 error (_("Symbol \"%s\" is not a function (class = %d)"),
11372 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11377 /* Inspect the Ada runtime and determine which exception info structure
11378 should be used to provide support for exception catchpoints.
11380 This function will always set the per-inferior exception_info,
11381 or raise an error. */
11384 ada_exception_support_info_sniffer (void)
11386 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11388 /* If the exception info is already known, then no need to recompute it. */
11389 if (data
->exception_info
!= NULL
)
11392 /* Check the latest (default) exception support info. */
11393 if (ada_has_this_exception_support (&default_exception_support_info
))
11395 data
->exception_info
= &default_exception_support_info
;
11399 /* Try our fallback exception suport info. */
11400 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11402 data
->exception_info
= &exception_support_info_fallback
;
11406 /* Sometimes, it is normal for us to not be able to find the routine
11407 we are looking for. This happens when the program is linked with
11408 the shared version of the GNAT runtime, and the program has not been
11409 started yet. Inform the user of these two possible causes if
11412 if (ada_update_initial_language (language_unknown
) != language_ada
)
11413 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11415 /* If the symbol does not exist, then check that the program is
11416 already started, to make sure that shared libraries have been
11417 loaded. If it is not started, this may mean that the symbol is
11418 in a shared library. */
11420 if (ptid_get_pid (inferior_ptid
) == 0)
11421 error (_("Unable to insert catchpoint. Try to start the program first."));
11423 /* At this point, we know that we are debugging an Ada program and
11424 that the inferior has been started, but we still are not able to
11425 find the run-time symbols. That can mean that we are in
11426 configurable run time mode, or that a-except as been optimized
11427 out by the linker... In any case, at this point it is not worth
11428 supporting this feature. */
11430 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11433 /* True iff FRAME is very likely to be that of a function that is
11434 part of the runtime system. This is all very heuristic, but is
11435 intended to be used as advice as to what frames are uninteresting
11439 is_known_support_routine (struct frame_info
*frame
)
11441 struct symtab_and_line sal
;
11443 enum language func_lang
;
11445 const char *fullname
;
11447 /* If this code does not have any debugging information (no symtab),
11448 This cannot be any user code. */
11450 find_frame_sal (frame
, &sal
);
11451 if (sal
.symtab
== NULL
)
11454 /* If there is a symtab, but the associated source file cannot be
11455 located, then assume this is not user code: Selecting a frame
11456 for which we cannot display the code would not be very helpful
11457 for the user. This should also take care of case such as VxWorks
11458 where the kernel has some debugging info provided for a few units. */
11460 fullname
= symtab_to_fullname (sal
.symtab
);
11461 if (access (fullname
, R_OK
) != 0)
11464 /* Check the unit filename againt the Ada runtime file naming.
11465 We also check the name of the objfile against the name of some
11466 known system libraries that sometimes come with debugging info
11469 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11471 re_comp (known_runtime_file_name_patterns
[i
]);
11472 if (re_exec (lbasename (sal
.symtab
->filename
)))
11474 if (sal
.symtab
->objfile
!= NULL
11475 && re_exec (objfile_name (sal
.symtab
->objfile
)))
11479 /* Check whether the function is a GNAT-generated entity. */
11481 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11482 if (func_name
== NULL
)
11485 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11487 re_comp (known_auxiliary_function_name_patterns
[i
]);
11488 if (re_exec (func_name
))
11499 /* Find the first frame that contains debugging information and that is not
11500 part of the Ada run-time, starting from FI and moving upward. */
11503 ada_find_printable_frame (struct frame_info
*fi
)
11505 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11507 if (!is_known_support_routine (fi
))
11516 /* Assuming that the inferior just triggered an unhandled exception
11517 catchpoint, return the address in inferior memory where the name
11518 of the exception is stored.
11520 Return zero if the address could not be computed. */
11523 ada_unhandled_exception_name_addr (void)
11525 return parse_and_eval_address ("e.full_name");
11528 /* Same as ada_unhandled_exception_name_addr, except that this function
11529 should be used when the inferior uses an older version of the runtime,
11530 where the exception name needs to be extracted from a specific frame
11531 several frames up in the callstack. */
11534 ada_unhandled_exception_name_addr_from_raise (void)
11537 struct frame_info
*fi
;
11538 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11539 struct cleanup
*old_chain
;
11541 /* To determine the name of this exception, we need to select
11542 the frame corresponding to RAISE_SYM_NAME. This frame is
11543 at least 3 levels up, so we simply skip the first 3 frames
11544 without checking the name of their associated function. */
11545 fi
= get_current_frame ();
11546 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11548 fi
= get_prev_frame (fi
);
11550 old_chain
= make_cleanup (null_cleanup
, NULL
);
11554 enum language func_lang
;
11556 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11557 if (func_name
!= NULL
)
11559 make_cleanup (xfree
, func_name
);
11561 if (strcmp (func_name
,
11562 data
->exception_info
->catch_exception_sym
) == 0)
11563 break; /* We found the frame we were looking for... */
11564 fi
= get_prev_frame (fi
);
11567 do_cleanups (old_chain
);
11573 return parse_and_eval_address ("id.full_name");
11576 /* Assuming the inferior just triggered an Ada exception catchpoint
11577 (of any type), return the address in inferior memory where the name
11578 of the exception is stored, if applicable.
11580 Return zero if the address could not be computed, or if not relevant. */
11583 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11584 struct breakpoint
*b
)
11586 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11590 case ada_catch_exception
:
11591 return (parse_and_eval_address ("e.full_name"));
11594 case ada_catch_exception_unhandled
:
11595 return data
->exception_info
->unhandled_exception_name_addr ();
11598 case ada_catch_assert
:
11599 return 0; /* Exception name is not relevant in this case. */
11603 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11607 return 0; /* Should never be reached. */
11610 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11611 any error that ada_exception_name_addr_1 might cause to be thrown.
11612 When an error is intercepted, a warning with the error message is printed,
11613 and zero is returned. */
11616 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11617 struct breakpoint
*b
)
11619 volatile struct gdb_exception e
;
11620 CORE_ADDR result
= 0;
11622 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11624 result
= ada_exception_name_addr_1 (ex
, b
);
11629 warning (_("failed to get exception name: %s"), e
.message
);
11636 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11638 /* Ada catchpoints.
11640 In the case of catchpoints on Ada exceptions, the catchpoint will
11641 stop the target on every exception the program throws. When a user
11642 specifies the name of a specific exception, we translate this
11643 request into a condition expression (in text form), and then parse
11644 it into an expression stored in each of the catchpoint's locations.
11645 We then use this condition to check whether the exception that was
11646 raised is the one the user is interested in. If not, then the
11647 target is resumed again. We store the name of the requested
11648 exception, in order to be able to re-set the condition expression
11649 when symbols change. */
11651 /* An instance of this type is used to represent an Ada catchpoint
11652 breakpoint location. It includes a "struct bp_location" as a kind
11653 of base class; users downcast to "struct bp_location *" when
11656 struct ada_catchpoint_location
11658 /* The base class. */
11659 struct bp_location base
;
11661 /* The condition that checks whether the exception that was raised
11662 is the specific exception the user specified on catchpoint
11664 struct expression
*excep_cond_expr
;
11667 /* Implement the DTOR method in the bp_location_ops structure for all
11668 Ada exception catchpoint kinds. */
11671 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11673 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11675 xfree (al
->excep_cond_expr
);
11678 /* The vtable to be used in Ada catchpoint locations. */
11680 static const struct bp_location_ops ada_catchpoint_location_ops
=
11682 ada_catchpoint_location_dtor
11685 /* An instance of this type is used to represent an Ada catchpoint.
11686 It includes a "struct breakpoint" as a kind of base class; users
11687 downcast to "struct breakpoint *" when needed. */
11689 struct ada_catchpoint
11691 /* The base class. */
11692 struct breakpoint base
;
11694 /* The name of the specific exception the user specified. */
11695 char *excep_string
;
11698 /* Parse the exception condition string in the context of each of the
11699 catchpoint's locations, and store them for later evaluation. */
11702 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11704 struct cleanup
*old_chain
;
11705 struct bp_location
*bl
;
11708 /* Nothing to do if there's no specific exception to catch. */
11709 if (c
->excep_string
== NULL
)
11712 /* Same if there are no locations... */
11713 if (c
->base
.loc
== NULL
)
11716 /* Compute the condition expression in text form, from the specific
11717 expection we want to catch. */
11718 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11719 old_chain
= make_cleanup (xfree
, cond_string
);
11721 /* Iterate over all the catchpoint's locations, and parse an
11722 expression for each. */
11723 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11725 struct ada_catchpoint_location
*ada_loc
11726 = (struct ada_catchpoint_location
*) bl
;
11727 struct expression
*exp
= NULL
;
11729 if (!bl
->shlib_disabled
)
11731 volatile struct gdb_exception e
;
11735 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11737 exp
= parse_exp_1 (&s
, bl
->address
,
11738 block_for_pc (bl
->address
), 0);
11742 warning (_("failed to reevaluate internal exception condition "
11743 "for catchpoint %d: %s"),
11744 c
->base
.number
, e
.message
);
11745 /* There is a bug in GCC on sparc-solaris when building with
11746 optimization which causes EXP to change unexpectedly
11747 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11748 The problem should be fixed starting with GCC 4.9.
11749 In the meantime, work around it by forcing EXP back
11755 ada_loc
->excep_cond_expr
= exp
;
11758 do_cleanups (old_chain
);
11761 /* Implement the DTOR method in the breakpoint_ops structure for all
11762 exception catchpoint kinds. */
11765 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11767 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11769 xfree (c
->excep_string
);
11771 bkpt_breakpoint_ops
.dtor (b
);
11774 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11775 structure for all exception catchpoint kinds. */
11777 static struct bp_location
*
11778 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11779 struct breakpoint
*self
)
11781 struct ada_catchpoint_location
*loc
;
11783 loc
= XNEW (struct ada_catchpoint_location
);
11784 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11785 loc
->excep_cond_expr
= NULL
;
11789 /* Implement the RE_SET method in the breakpoint_ops structure for all
11790 exception catchpoint kinds. */
11793 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11795 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11797 /* Call the base class's method. This updates the catchpoint's
11799 bkpt_breakpoint_ops
.re_set (b
);
11801 /* Reparse the exception conditional expressions. One for each
11803 create_excep_cond_exprs (c
);
11806 /* Returns true if we should stop for this breakpoint hit. If the
11807 user specified a specific exception, we only want to cause a stop
11808 if the program thrown that exception. */
11811 should_stop_exception (const struct bp_location
*bl
)
11813 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11814 const struct ada_catchpoint_location
*ada_loc
11815 = (const struct ada_catchpoint_location
*) bl
;
11816 volatile struct gdb_exception ex
;
11819 /* With no specific exception, should always stop. */
11820 if (c
->excep_string
== NULL
)
11823 if (ada_loc
->excep_cond_expr
== NULL
)
11825 /* We will have a NULL expression if back when we were creating
11826 the expressions, this location's had failed to parse. */
11831 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11833 struct value
*mark
;
11835 mark
= value_mark ();
11836 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11837 value_free_to_mark (mark
);
11840 exception_fprintf (gdb_stderr
, ex
,
11841 _("Error in testing exception condition:\n"));
11845 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11846 for all exception catchpoint kinds. */
11849 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11851 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11854 /* Implement the PRINT_IT method in the breakpoint_ops structure
11855 for all exception catchpoint kinds. */
11857 static enum print_stop_action
11858 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11860 struct ui_out
*uiout
= current_uiout
;
11861 struct breakpoint
*b
= bs
->breakpoint_at
;
11863 annotate_catchpoint (b
->number
);
11865 if (ui_out_is_mi_like_p (uiout
))
11867 ui_out_field_string (uiout
, "reason",
11868 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11869 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11872 ui_out_text (uiout
,
11873 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11874 : "\nCatchpoint ");
11875 ui_out_field_int (uiout
, "bkptno", b
->number
);
11876 ui_out_text (uiout
, ", ");
11880 case ada_catch_exception
:
11881 case ada_catch_exception_unhandled
:
11883 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11884 char exception_name
[256];
11888 read_memory (addr
, (gdb_byte
*) exception_name
,
11889 sizeof (exception_name
) - 1);
11890 exception_name
[sizeof (exception_name
) - 1] = '\0';
11894 /* For some reason, we were unable to read the exception
11895 name. This could happen if the Runtime was compiled
11896 without debugging info, for instance. In that case,
11897 just replace the exception name by the generic string
11898 "exception" - it will read as "an exception" in the
11899 notification we are about to print. */
11900 memcpy (exception_name
, "exception", sizeof ("exception"));
11902 /* In the case of unhandled exception breakpoints, we print
11903 the exception name as "unhandled EXCEPTION_NAME", to make
11904 it clearer to the user which kind of catchpoint just got
11905 hit. We used ui_out_text to make sure that this extra
11906 info does not pollute the exception name in the MI case. */
11907 if (ex
== ada_catch_exception_unhandled
)
11908 ui_out_text (uiout
, "unhandled ");
11909 ui_out_field_string (uiout
, "exception-name", exception_name
);
11912 case ada_catch_assert
:
11913 /* In this case, the name of the exception is not really
11914 important. Just print "failed assertion" to make it clearer
11915 that his program just hit an assertion-failure catchpoint.
11916 We used ui_out_text because this info does not belong in
11918 ui_out_text (uiout
, "failed assertion");
11921 ui_out_text (uiout
, " at ");
11922 ada_find_printable_frame (get_current_frame ());
11924 return PRINT_SRC_AND_LOC
;
11927 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11928 for all exception catchpoint kinds. */
11931 print_one_exception (enum ada_exception_catchpoint_kind ex
,
11932 struct breakpoint
*b
, struct bp_location
**last_loc
)
11934 struct ui_out
*uiout
= current_uiout
;
11935 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11936 struct value_print_options opts
;
11938 get_user_print_options (&opts
);
11939 if (opts
.addressprint
)
11941 annotate_field (4);
11942 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11945 annotate_field (5);
11946 *last_loc
= b
->loc
;
11949 case ada_catch_exception
:
11950 if (c
->excep_string
!= NULL
)
11952 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11954 ui_out_field_string (uiout
, "what", msg
);
11958 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11962 case ada_catch_exception_unhandled
:
11963 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11966 case ada_catch_assert
:
11967 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11971 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11976 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11977 for all exception catchpoint kinds. */
11980 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
11981 struct breakpoint
*b
)
11983 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11984 struct ui_out
*uiout
= current_uiout
;
11986 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11987 : _("Catchpoint "));
11988 ui_out_field_int (uiout
, "bkptno", b
->number
);
11989 ui_out_text (uiout
, ": ");
11993 case ada_catch_exception
:
11994 if (c
->excep_string
!= NULL
)
11996 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11997 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11999 ui_out_text (uiout
, info
);
12000 do_cleanups (old_chain
);
12003 ui_out_text (uiout
, _("all Ada exceptions"));
12006 case ada_catch_exception_unhandled
:
12007 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12010 case ada_catch_assert
:
12011 ui_out_text (uiout
, _("failed Ada assertions"));
12015 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12020 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12021 for all exception catchpoint kinds. */
12024 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12025 struct breakpoint
*b
, struct ui_file
*fp
)
12027 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12031 case ada_catch_exception
:
12032 fprintf_filtered (fp
, "catch exception");
12033 if (c
->excep_string
!= NULL
)
12034 fprintf_filtered (fp
, " %s", c
->excep_string
);
12037 case ada_catch_exception_unhandled
:
12038 fprintf_filtered (fp
, "catch exception unhandled");
12041 case ada_catch_assert
:
12042 fprintf_filtered (fp
, "catch assert");
12046 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12048 print_recreate_thread (b
, fp
);
12051 /* Virtual table for "catch exception" breakpoints. */
12054 dtor_catch_exception (struct breakpoint
*b
)
12056 dtor_exception (ada_catch_exception
, b
);
12059 static struct bp_location
*
12060 allocate_location_catch_exception (struct breakpoint
*self
)
12062 return allocate_location_exception (ada_catch_exception
, self
);
12066 re_set_catch_exception (struct breakpoint
*b
)
12068 re_set_exception (ada_catch_exception
, b
);
12072 check_status_catch_exception (bpstat bs
)
12074 check_status_exception (ada_catch_exception
, bs
);
12077 static enum print_stop_action
12078 print_it_catch_exception (bpstat bs
)
12080 return print_it_exception (ada_catch_exception
, bs
);
12084 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12086 print_one_exception (ada_catch_exception
, b
, last_loc
);
12090 print_mention_catch_exception (struct breakpoint
*b
)
12092 print_mention_exception (ada_catch_exception
, b
);
12096 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12098 print_recreate_exception (ada_catch_exception
, b
, fp
);
12101 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12103 /* Virtual table for "catch exception unhandled" breakpoints. */
12106 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12108 dtor_exception (ada_catch_exception_unhandled
, b
);
12111 static struct bp_location
*
12112 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12114 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12118 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12120 re_set_exception (ada_catch_exception_unhandled
, b
);
12124 check_status_catch_exception_unhandled (bpstat bs
)
12126 check_status_exception (ada_catch_exception_unhandled
, bs
);
12129 static enum print_stop_action
12130 print_it_catch_exception_unhandled (bpstat bs
)
12132 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12136 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12137 struct bp_location
**last_loc
)
12139 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12143 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12145 print_mention_exception (ada_catch_exception_unhandled
, b
);
12149 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12150 struct ui_file
*fp
)
12152 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12155 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12157 /* Virtual table for "catch assert" breakpoints. */
12160 dtor_catch_assert (struct breakpoint
*b
)
12162 dtor_exception (ada_catch_assert
, b
);
12165 static struct bp_location
*
12166 allocate_location_catch_assert (struct breakpoint
*self
)
12168 return allocate_location_exception (ada_catch_assert
, self
);
12172 re_set_catch_assert (struct breakpoint
*b
)
12174 re_set_exception (ada_catch_assert
, b
);
12178 check_status_catch_assert (bpstat bs
)
12180 check_status_exception (ada_catch_assert
, bs
);
12183 static enum print_stop_action
12184 print_it_catch_assert (bpstat bs
)
12186 return print_it_exception (ada_catch_assert
, bs
);
12190 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12192 print_one_exception (ada_catch_assert
, b
, last_loc
);
12196 print_mention_catch_assert (struct breakpoint
*b
)
12198 print_mention_exception (ada_catch_assert
, b
);
12202 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12204 print_recreate_exception (ada_catch_assert
, b
, fp
);
12207 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12209 /* Return a newly allocated copy of the first space-separated token
12210 in ARGSP, and then adjust ARGSP to point immediately after that
12213 Return NULL if ARGPS does not contain any more tokens. */
12216 ada_get_next_arg (char **argsp
)
12218 char *args
= *argsp
;
12222 args
= skip_spaces (args
);
12223 if (args
[0] == '\0')
12224 return NULL
; /* No more arguments. */
12226 /* Find the end of the current argument. */
12228 end
= skip_to_space (args
);
12230 /* Adjust ARGSP to point to the start of the next argument. */
12234 /* Make a copy of the current argument and return it. */
12236 result
= xmalloc (end
- args
+ 1);
12237 strncpy (result
, args
, end
- args
);
12238 result
[end
- args
] = '\0';
12243 /* Split the arguments specified in a "catch exception" command.
12244 Set EX to the appropriate catchpoint type.
12245 Set EXCEP_STRING to the name of the specific exception if
12246 specified by the user.
12247 If a condition is found at the end of the arguments, the condition
12248 expression is stored in COND_STRING (memory must be deallocated
12249 after use). Otherwise COND_STRING is set to NULL. */
12252 catch_ada_exception_command_split (char *args
,
12253 enum ada_exception_catchpoint_kind
*ex
,
12254 char **excep_string
,
12255 char **cond_string
)
12257 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12258 char *exception_name
;
12261 exception_name
= ada_get_next_arg (&args
);
12262 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12264 /* This is not an exception name; this is the start of a condition
12265 expression for a catchpoint on all exceptions. So, "un-get"
12266 this token, and set exception_name to NULL. */
12267 xfree (exception_name
);
12268 exception_name
= NULL
;
12271 make_cleanup (xfree
, exception_name
);
12273 /* Check to see if we have a condition. */
12275 args
= skip_spaces (args
);
12276 if (strncmp (args
, "if", 2) == 0
12277 && (isspace (args
[2]) || args
[2] == '\0'))
12280 args
= skip_spaces (args
);
12282 if (args
[0] == '\0')
12283 error (_("Condition missing after `if' keyword"));
12284 cond
= xstrdup (args
);
12285 make_cleanup (xfree
, cond
);
12287 args
+= strlen (args
);
12290 /* Check that we do not have any more arguments. Anything else
12293 if (args
[0] != '\0')
12294 error (_("Junk at end of expression"));
12296 discard_cleanups (old_chain
);
12298 if (exception_name
== NULL
)
12300 /* Catch all exceptions. */
12301 *ex
= ada_catch_exception
;
12302 *excep_string
= NULL
;
12304 else if (strcmp (exception_name
, "unhandled") == 0)
12306 /* Catch unhandled exceptions. */
12307 *ex
= ada_catch_exception_unhandled
;
12308 *excep_string
= NULL
;
12312 /* Catch a specific exception. */
12313 *ex
= ada_catch_exception
;
12314 *excep_string
= exception_name
;
12316 *cond_string
= cond
;
12319 /* Return the name of the symbol on which we should break in order to
12320 implement a catchpoint of the EX kind. */
12322 static const char *
12323 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12325 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12327 gdb_assert (data
->exception_info
!= NULL
);
12331 case ada_catch_exception
:
12332 return (data
->exception_info
->catch_exception_sym
);
12334 case ada_catch_exception_unhandled
:
12335 return (data
->exception_info
->catch_exception_unhandled_sym
);
12337 case ada_catch_assert
:
12338 return (data
->exception_info
->catch_assert_sym
);
12341 internal_error (__FILE__
, __LINE__
,
12342 _("unexpected catchpoint kind (%d)"), ex
);
12346 /* Return the breakpoint ops "virtual table" used for catchpoints
12349 static const struct breakpoint_ops
*
12350 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12354 case ada_catch_exception
:
12355 return (&catch_exception_breakpoint_ops
);
12357 case ada_catch_exception_unhandled
:
12358 return (&catch_exception_unhandled_breakpoint_ops
);
12360 case ada_catch_assert
:
12361 return (&catch_assert_breakpoint_ops
);
12364 internal_error (__FILE__
, __LINE__
,
12365 _("unexpected catchpoint kind (%d)"), ex
);
12369 /* Return the condition that will be used to match the current exception
12370 being raised with the exception that the user wants to catch. This
12371 assumes that this condition is used when the inferior just triggered
12372 an exception catchpoint.
12374 The string returned is a newly allocated string that needs to be
12375 deallocated later. */
12378 ada_exception_catchpoint_cond_string (const char *excep_string
)
12382 /* The standard exceptions are a special case. They are defined in
12383 runtime units that have been compiled without debugging info; if
12384 EXCEP_STRING is the not-fully-qualified name of a standard
12385 exception (e.g. "constraint_error") then, during the evaluation
12386 of the condition expression, the symbol lookup on this name would
12387 *not* return this standard exception. The catchpoint condition
12388 may then be set only on user-defined exceptions which have the
12389 same not-fully-qualified name (e.g. my_package.constraint_error).
12391 To avoid this unexcepted behavior, these standard exceptions are
12392 systematically prefixed by "standard". This means that "catch
12393 exception constraint_error" is rewritten into "catch exception
12394 standard.constraint_error".
12396 If an exception named contraint_error is defined in another package of
12397 the inferior program, then the only way to specify this exception as a
12398 breakpoint condition is to use its fully-qualified named:
12399 e.g. my_package.constraint_error. */
12401 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12403 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12405 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12409 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12412 /* Return the symtab_and_line that should be used to insert an exception
12413 catchpoint of the TYPE kind.
12415 EXCEP_STRING should contain the name of a specific exception that
12416 the catchpoint should catch, or NULL otherwise.
12418 ADDR_STRING returns the name of the function where the real
12419 breakpoint that implements the catchpoints is set, depending on the
12420 type of catchpoint we need to create. */
12422 static struct symtab_and_line
12423 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12424 char **addr_string
, const struct breakpoint_ops
**ops
)
12426 const char *sym_name
;
12427 struct symbol
*sym
;
12429 /* First, find out which exception support info to use. */
12430 ada_exception_support_info_sniffer ();
12432 /* Then lookup the function on which we will break in order to catch
12433 the Ada exceptions requested by the user. */
12434 sym_name
= ada_exception_sym_name (ex
);
12435 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12437 /* We can assume that SYM is not NULL at this stage. If the symbol
12438 did not exist, ada_exception_support_info_sniffer would have
12439 raised an exception.
12441 Also, ada_exception_support_info_sniffer should have already
12442 verified that SYM is a function symbol. */
12443 gdb_assert (sym
!= NULL
);
12444 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12446 /* Set ADDR_STRING. */
12447 *addr_string
= xstrdup (sym_name
);
12450 *ops
= ada_exception_breakpoint_ops (ex
);
12452 return find_function_start_sal (sym
, 1);
12455 /* Create an Ada exception catchpoint.
12457 EX_KIND is the kind of exception catchpoint to be created.
12459 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12460 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12461 of the exception to which this catchpoint applies. When not NULL,
12462 the string must be allocated on the heap, and its deallocation
12463 is no longer the responsibility of the caller.
12465 COND_STRING, if not NULL, is the catchpoint condition. This string
12466 must be allocated on the heap, and its deallocation is no longer
12467 the responsibility of the caller.
12469 TEMPFLAG, if nonzero, means that the underlying breakpoint
12470 should be temporary.
12472 FROM_TTY is the usual argument passed to all commands implementations. */
12475 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12476 enum ada_exception_catchpoint_kind ex_kind
,
12477 char *excep_string
,
12483 struct ada_catchpoint
*c
;
12484 char *addr_string
= NULL
;
12485 const struct breakpoint_ops
*ops
= NULL
;
12486 struct symtab_and_line sal
12487 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12489 c
= XNEW (struct ada_catchpoint
);
12490 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12491 ops
, tempflag
, disabled
, from_tty
);
12492 c
->excep_string
= excep_string
;
12493 create_excep_cond_exprs (c
);
12494 if (cond_string
!= NULL
)
12495 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12496 install_breakpoint (0, &c
->base
, 1);
12499 /* Implement the "catch exception" command. */
12502 catch_ada_exception_command (char *arg
, int from_tty
,
12503 struct cmd_list_element
*command
)
12505 struct gdbarch
*gdbarch
= get_current_arch ();
12507 enum ada_exception_catchpoint_kind ex_kind
;
12508 char *excep_string
= NULL
;
12509 char *cond_string
= NULL
;
12511 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12515 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12517 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12518 excep_string
, cond_string
,
12519 tempflag
, 1 /* enabled */,
12523 /* Split the arguments specified in a "catch assert" command.
12525 ARGS contains the command's arguments (or the empty string if
12526 no arguments were passed).
12528 If ARGS contains a condition, set COND_STRING to that condition
12529 (the memory needs to be deallocated after use). */
12532 catch_ada_assert_command_split (char *args
, char **cond_string
)
12534 args
= skip_spaces (args
);
12536 /* Check whether a condition was provided. */
12537 if (strncmp (args
, "if", 2) == 0
12538 && (isspace (args
[2]) || args
[2] == '\0'))
12541 args
= skip_spaces (args
);
12542 if (args
[0] == '\0')
12543 error (_("condition missing after `if' keyword"));
12544 *cond_string
= xstrdup (args
);
12547 /* Otherwise, there should be no other argument at the end of
12549 else if (args
[0] != '\0')
12550 error (_("Junk at end of arguments."));
12553 /* Implement the "catch assert" command. */
12556 catch_assert_command (char *arg
, int from_tty
,
12557 struct cmd_list_element
*command
)
12559 struct gdbarch
*gdbarch
= get_current_arch ();
12561 char *cond_string
= NULL
;
12563 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12567 catch_ada_assert_command_split (arg
, &cond_string
);
12568 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12570 tempflag
, 1 /* enabled */,
12574 /* Return non-zero if the symbol SYM is an Ada exception object. */
12577 ada_is_exception_sym (struct symbol
*sym
)
12579 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12581 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12582 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12583 && SYMBOL_CLASS (sym
) != LOC_CONST
12584 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12585 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12588 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12589 Ada exception object. This matches all exceptions except the ones
12590 defined by the Ada language. */
12593 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12597 if (!ada_is_exception_sym (sym
))
12600 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12601 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12602 return 0; /* A standard exception. */
12604 /* Numeric_Error is also a standard exception, so exclude it.
12605 See the STANDARD_EXC description for more details as to why
12606 this exception is not listed in that array. */
12607 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12613 /* A helper function for qsort, comparing two struct ada_exc_info
12616 The comparison is determined first by exception name, and then
12617 by exception address. */
12620 compare_ada_exception_info (const void *a
, const void *b
)
12622 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12623 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12626 result
= strcmp (exc_a
->name
, exc_b
->name
);
12630 if (exc_a
->addr
< exc_b
->addr
)
12632 if (exc_a
->addr
> exc_b
->addr
)
12638 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12639 routine, but keeping the first SKIP elements untouched.
12641 All duplicates are also removed. */
12644 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12647 struct ada_exc_info
*to_sort
12648 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12650 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12653 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12654 compare_ada_exception_info
);
12656 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12657 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12658 to_sort
[j
++] = to_sort
[i
];
12660 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12663 /* A function intended as the "name_matcher" callback in the struct
12664 quick_symbol_functions' expand_symtabs_matching method.
12666 SEARCH_NAME is the symbol's search name.
12668 If USER_DATA is not NULL, it is a pointer to a regext_t object
12669 used to match the symbol (by natural name). Otherwise, when USER_DATA
12670 is null, no filtering is performed, and all symbols are a positive
12674 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12676 regex_t
*preg
= user_data
;
12681 /* In Ada, the symbol "search name" is a linkage name, whereas
12682 the regular expression used to do the matching refers to
12683 the natural name. So match against the decoded name. */
12684 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12687 /* Add all exceptions defined by the Ada standard whose name match
12688 a regular expression.
12690 If PREG is not NULL, then this regexp_t object is used to
12691 perform the symbol name matching. Otherwise, no name-based
12692 filtering is performed.
12694 EXCEPTIONS is a vector of exceptions to which matching exceptions
12698 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12702 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12705 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12707 struct bound_minimal_symbol msymbol
12708 = ada_lookup_simple_minsym (standard_exc
[i
]);
12710 if (msymbol
.minsym
!= NULL
)
12712 struct ada_exc_info info
12713 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12715 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12721 /* Add all Ada exceptions defined locally and accessible from the given
12724 If PREG is not NULL, then this regexp_t object is used to
12725 perform the symbol name matching. Otherwise, no name-based
12726 filtering is performed.
12728 EXCEPTIONS is a vector of exceptions to which matching exceptions
12732 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12733 VEC(ada_exc_info
) **exceptions
)
12735 struct block
*block
= get_frame_block (frame
, 0);
12739 struct block_iterator iter
;
12740 struct symbol
*sym
;
12742 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12744 switch (SYMBOL_CLASS (sym
))
12751 if (ada_is_exception_sym (sym
))
12753 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12754 SYMBOL_VALUE_ADDRESS (sym
)};
12756 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12760 if (BLOCK_FUNCTION (block
) != NULL
)
12762 block
= BLOCK_SUPERBLOCK (block
);
12766 /* Add all exceptions defined globally whose name name match
12767 a regular expression, excluding standard exceptions.
12769 The reason we exclude standard exceptions is that they need
12770 to be handled separately: Standard exceptions are defined inside
12771 a runtime unit which is normally not compiled with debugging info,
12772 and thus usually do not show up in our symbol search. However,
12773 if the unit was in fact built with debugging info, we need to
12774 exclude them because they would duplicate the entry we found
12775 during the special loop that specifically searches for those
12776 standard exceptions.
12778 If PREG is not NULL, then this regexp_t object is used to
12779 perform the symbol name matching. Otherwise, no name-based
12780 filtering is performed.
12782 EXCEPTIONS is a vector of exceptions to which matching exceptions
12786 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12788 struct objfile
*objfile
;
12791 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
,
12792 VARIABLES_DOMAIN
, preg
);
12794 ALL_PRIMARY_SYMTABS (objfile
, s
)
12796 struct blockvector
*bv
= BLOCKVECTOR (s
);
12799 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12801 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12802 struct block_iterator iter
;
12803 struct symbol
*sym
;
12805 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12806 if (ada_is_non_standard_exception_sym (sym
)
12808 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
12811 struct ada_exc_info info
12812 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
12814 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12820 /* Implements ada_exceptions_list with the regular expression passed
12821 as a regex_t, rather than a string.
12823 If not NULL, PREG is used to filter out exceptions whose names
12824 do not match. Otherwise, all exceptions are listed. */
12826 static VEC(ada_exc_info
) *
12827 ada_exceptions_list_1 (regex_t
*preg
)
12829 VEC(ada_exc_info
) *result
= NULL
;
12830 struct cleanup
*old_chain
12831 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
12834 /* First, list the known standard exceptions. These exceptions
12835 need to be handled separately, as they are usually defined in
12836 runtime units that have been compiled without debugging info. */
12838 ada_add_standard_exceptions (preg
, &result
);
12840 /* Next, find all exceptions whose scope is local and accessible
12841 from the currently selected frame. */
12843 if (has_stack_frames ())
12845 prev_len
= VEC_length (ada_exc_info
, result
);
12846 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12848 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12849 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12852 /* Add all exceptions whose scope is global. */
12854 prev_len
= VEC_length (ada_exc_info
, result
);
12855 ada_add_global_exceptions (preg
, &result
);
12856 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12857 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12859 discard_cleanups (old_chain
);
12863 /* Return a vector of ada_exc_info.
12865 If REGEXP is NULL, all exceptions are included in the result.
12866 Otherwise, it should contain a valid regular expression,
12867 and only the exceptions whose names match that regular expression
12868 are included in the result.
12870 The exceptions are sorted in the following order:
12871 - Standard exceptions (defined by the Ada language), in
12872 alphabetical order;
12873 - Exceptions only visible from the current frame, in
12874 alphabetical order;
12875 - Exceptions whose scope is global, in alphabetical order. */
12877 VEC(ada_exc_info
) *
12878 ada_exceptions_list (const char *regexp
)
12880 VEC(ada_exc_info
) *result
= NULL
;
12881 struct cleanup
*old_chain
= NULL
;
12884 if (regexp
!= NULL
)
12885 old_chain
= compile_rx_or_error (®
, regexp
,
12886 _("invalid regular expression"));
12888 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
12890 if (old_chain
!= NULL
)
12891 do_cleanups (old_chain
);
12895 /* Implement the "info exceptions" command. */
12898 info_exceptions_command (char *regexp
, int from_tty
)
12900 VEC(ada_exc_info
) *exceptions
;
12901 struct cleanup
*cleanup
;
12902 struct gdbarch
*gdbarch
= get_current_arch ();
12904 struct ada_exc_info
*info
;
12906 exceptions
= ada_exceptions_list (regexp
);
12907 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
12909 if (regexp
!= NULL
)
12911 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12913 printf_filtered (_("All defined Ada exceptions:\n"));
12915 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
12916 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
12918 do_cleanups (cleanup
);
12922 /* Information about operators given special treatment in functions
12924 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12926 #define ADA_OPERATORS \
12927 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12928 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12929 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12930 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12931 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12932 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12933 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12934 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12935 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12936 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12937 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12938 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12939 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12940 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12941 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12942 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12943 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12944 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12945 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12948 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12951 switch (exp
->elts
[pc
- 1].opcode
)
12954 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12957 #define OP_DEFN(op, len, args, binop) \
12958 case op: *oplenp = len; *argsp = args; break;
12964 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
12969 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
12974 /* Implementation of the exp_descriptor method operator_check. */
12977 ada_operator_check (struct expression
*exp
, int pos
,
12978 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
12981 const union exp_element
*const elts
= exp
->elts
;
12982 struct type
*type
= NULL
;
12984 switch (elts
[pos
].opcode
)
12986 case UNOP_IN_RANGE
:
12988 type
= elts
[pos
+ 1].type
;
12992 return operator_check_standard (exp
, pos
, objfile_func
, data
);
12995 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12997 if (type
&& TYPE_OBJFILE (type
)
12998 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13005 ada_op_name (enum exp_opcode opcode
)
13010 return op_name_standard (opcode
);
13012 #define OP_DEFN(op, len, args, binop) case op: return #op;
13017 return "OP_AGGREGATE";
13019 return "OP_CHOICES";
13025 /* As for operator_length, but assumes PC is pointing at the first
13026 element of the operator, and gives meaningful results only for the
13027 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13030 ada_forward_operator_length (struct expression
*exp
, int pc
,
13031 int *oplenp
, int *argsp
)
13033 switch (exp
->elts
[pc
].opcode
)
13036 *oplenp
= *argsp
= 0;
13039 #define OP_DEFN(op, len, args, binop) \
13040 case op: *oplenp = len; *argsp = args; break;
13046 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13051 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13057 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13059 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13067 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13069 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13074 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13078 /* Ada attributes ('Foo). */
13081 case OP_ATR_LENGTH
:
13085 case OP_ATR_MODULUS
:
13092 case UNOP_IN_RANGE
:
13094 /* XXX: gdb_sprint_host_address, type_sprint */
13095 fprintf_filtered (stream
, _("Type @"));
13096 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13097 fprintf_filtered (stream
, " (");
13098 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13099 fprintf_filtered (stream
, ")");
13101 case BINOP_IN_BOUNDS
:
13102 fprintf_filtered (stream
, " (%d)",
13103 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13105 case TERNOP_IN_RANGE
:
13110 case OP_DISCRETE_RANGE
:
13111 case OP_POSITIONAL
:
13118 char *name
= &exp
->elts
[elt
+ 2].string
;
13119 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13121 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13126 return dump_subexp_body_standard (exp
, stream
, elt
);
13130 for (i
= 0; i
< nargs
; i
+= 1)
13131 elt
= dump_subexp (exp
, stream
, elt
);
13136 /* The Ada extension of print_subexp (q.v.). */
13139 ada_print_subexp (struct expression
*exp
, int *pos
,
13140 struct ui_file
*stream
, enum precedence prec
)
13142 int oplen
, nargs
, i
;
13144 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13146 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13153 print_subexp_standard (exp
, pos
, stream
, prec
);
13157 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13160 case BINOP_IN_BOUNDS
:
13161 /* XXX: sprint_subexp */
13162 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13163 fputs_filtered (" in ", stream
);
13164 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13165 fputs_filtered ("'range", stream
);
13166 if (exp
->elts
[pc
+ 1].longconst
> 1)
13167 fprintf_filtered (stream
, "(%ld)",
13168 (long) exp
->elts
[pc
+ 1].longconst
);
13171 case TERNOP_IN_RANGE
:
13172 if (prec
>= PREC_EQUAL
)
13173 fputs_filtered ("(", stream
);
13174 /* XXX: sprint_subexp */
13175 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13176 fputs_filtered (" in ", stream
);
13177 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13178 fputs_filtered (" .. ", stream
);
13179 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13180 if (prec
>= PREC_EQUAL
)
13181 fputs_filtered (")", stream
);
13186 case OP_ATR_LENGTH
:
13190 case OP_ATR_MODULUS
:
13195 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13197 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13198 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13199 &type_print_raw_options
);
13203 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13204 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13209 for (tem
= 1; tem
< nargs
; tem
+= 1)
13211 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13212 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13214 fputs_filtered (")", stream
);
13219 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13220 fputs_filtered ("'(", stream
);
13221 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13222 fputs_filtered (")", stream
);
13225 case UNOP_IN_RANGE
:
13226 /* XXX: sprint_subexp */
13227 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13228 fputs_filtered (" in ", stream
);
13229 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13230 &type_print_raw_options
);
13233 case OP_DISCRETE_RANGE
:
13234 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13235 fputs_filtered ("..", stream
);
13236 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13240 fputs_filtered ("others => ", stream
);
13241 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13245 for (i
= 0; i
< nargs
-1; i
+= 1)
13248 fputs_filtered ("|", stream
);
13249 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13251 fputs_filtered (" => ", stream
);
13252 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13255 case OP_POSITIONAL
:
13256 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13260 fputs_filtered ("(", stream
);
13261 for (i
= 0; i
< nargs
; i
+= 1)
13264 fputs_filtered (", ", stream
);
13265 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13267 fputs_filtered (")", stream
);
13272 /* Table mapping opcodes into strings for printing operators
13273 and precedences of the operators. */
13275 static const struct op_print ada_op_print_tab
[] = {
13276 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13277 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13278 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13279 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13280 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13281 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13282 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13283 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13284 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13285 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13286 {">", BINOP_GTR
, PREC_ORDER
, 0},
13287 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13288 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13289 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13290 {"+", BINOP_ADD
, PREC_ADD
, 0},
13291 {"-", BINOP_SUB
, PREC_ADD
, 0},
13292 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13293 {"*", BINOP_MUL
, PREC_MUL
, 0},
13294 {"/", BINOP_DIV
, PREC_MUL
, 0},
13295 {"rem", BINOP_REM
, PREC_MUL
, 0},
13296 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13297 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13298 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13299 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13300 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13301 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13302 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13303 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13304 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13305 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13306 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13310 enum ada_primitive_types
{
13311 ada_primitive_type_int
,
13312 ada_primitive_type_long
,
13313 ada_primitive_type_short
,
13314 ada_primitive_type_char
,
13315 ada_primitive_type_float
,
13316 ada_primitive_type_double
,
13317 ada_primitive_type_void
,
13318 ada_primitive_type_long_long
,
13319 ada_primitive_type_long_double
,
13320 ada_primitive_type_natural
,
13321 ada_primitive_type_positive
,
13322 ada_primitive_type_system_address
,
13323 nr_ada_primitive_types
13327 ada_language_arch_info (struct gdbarch
*gdbarch
,
13328 struct language_arch_info
*lai
)
13330 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13332 lai
->primitive_type_vector
13333 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13336 lai
->primitive_type_vector
[ada_primitive_type_int
]
13337 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13339 lai
->primitive_type_vector
[ada_primitive_type_long
]
13340 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13341 0, "long_integer");
13342 lai
->primitive_type_vector
[ada_primitive_type_short
]
13343 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13344 0, "short_integer");
13345 lai
->string_char_type
13346 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13347 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13348 lai
->primitive_type_vector
[ada_primitive_type_float
]
13349 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13351 lai
->primitive_type_vector
[ada_primitive_type_double
]
13352 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13353 "long_float", NULL
);
13354 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13355 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13356 0, "long_long_integer");
13357 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13358 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13359 "long_long_float", NULL
);
13360 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13361 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13363 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13364 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13366 lai
->primitive_type_vector
[ada_primitive_type_void
]
13367 = builtin
->builtin_void
;
13369 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13370 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13371 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13372 = "system__address";
13374 lai
->bool_type_symbol
= NULL
;
13375 lai
->bool_type_default
= builtin
->builtin_bool
;
13378 /* Language vector */
13380 /* Not really used, but needed in the ada_language_defn. */
13383 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13385 ada_emit_char (c
, type
, stream
, quoter
, 1);
13389 parse (struct parser_state
*ps
)
13391 warnings_issued
= 0;
13392 return ada_parse (ps
);
13395 static const struct exp_descriptor ada_exp_descriptor
= {
13397 ada_operator_length
,
13398 ada_operator_check
,
13400 ada_dump_subexp_body
,
13401 ada_evaluate_subexp
13404 /* Implement the "la_get_symbol_name_cmp" language_defn method
13407 static symbol_name_cmp_ftype
13408 ada_get_symbol_name_cmp (const char *lookup_name
)
13410 if (should_use_wild_match (lookup_name
))
13413 return compare_names
;
13416 /* Implement the "la_read_var_value" language_defn method for Ada. */
13418 static struct value
*
13419 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13421 struct block
*frame_block
= NULL
;
13422 struct symbol
*renaming_sym
= NULL
;
13424 /* The only case where default_read_var_value is not sufficient
13425 is when VAR is a renaming... */
13427 frame_block
= get_frame_block (frame
, NULL
);
13429 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13430 if (renaming_sym
!= NULL
)
13431 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13433 /* This is a typical case where we expect the default_read_var_value
13434 function to work. */
13435 return default_read_var_value (var
, frame
);
13438 const struct language_defn ada_language_defn
= {
13439 "ada", /* Language name */
13443 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13444 that's not quite what this means. */
13446 macro_expansion_no
,
13447 &ada_exp_descriptor
,
13451 ada_printchar
, /* Print a character constant */
13452 ada_printstr
, /* Function to print string constant */
13453 emit_char
, /* Function to print single char (not used) */
13454 ada_print_type
, /* Print a type using appropriate syntax */
13455 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13456 ada_val_print
, /* Print a value using appropriate syntax */
13457 ada_value_print
, /* Print a top-level value */
13458 ada_read_var_value
, /* la_read_var_value */
13459 NULL
, /* Language specific skip_trampoline */
13460 NULL
, /* name_of_this */
13461 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13462 basic_lookup_transparent_type
, /* lookup_transparent_type */
13463 ada_la_decode
, /* Language specific symbol demangler */
13464 NULL
, /* Language specific
13465 class_name_from_physname */
13466 ada_op_print_tab
, /* expression operators for printing */
13467 0, /* c-style arrays */
13468 1, /* String lower bound */
13469 ada_get_gdb_completer_word_break_characters
,
13470 ada_make_symbol_completion_list
,
13471 ada_language_arch_info
,
13472 ada_print_array_index
,
13473 default_pass_by_reference
,
13475 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13476 ada_iterate_over_symbols
,
13481 /* Provide a prototype to silence -Wmissing-prototypes. */
13482 extern initialize_file_ftype _initialize_ada_language
;
13484 /* Command-list for the "set/show ada" prefix command. */
13485 static struct cmd_list_element
*set_ada_list
;
13486 static struct cmd_list_element
*show_ada_list
;
13488 /* Implement the "set ada" prefix command. */
13491 set_ada_command (char *arg
, int from_tty
)
13493 printf_unfiltered (_(\
13494 "\"set ada\" must be followed by the name of a setting.\n"));
13495 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
13498 /* Implement the "show ada" prefix command. */
13501 show_ada_command (char *args
, int from_tty
)
13503 cmd_show_list (show_ada_list
, from_tty
, "");
13507 initialize_ada_catchpoint_ops (void)
13509 struct breakpoint_ops
*ops
;
13511 initialize_breakpoint_ops ();
13513 ops
= &catch_exception_breakpoint_ops
;
13514 *ops
= bkpt_breakpoint_ops
;
13515 ops
->dtor
= dtor_catch_exception
;
13516 ops
->allocate_location
= allocate_location_catch_exception
;
13517 ops
->re_set
= re_set_catch_exception
;
13518 ops
->check_status
= check_status_catch_exception
;
13519 ops
->print_it
= print_it_catch_exception
;
13520 ops
->print_one
= print_one_catch_exception
;
13521 ops
->print_mention
= print_mention_catch_exception
;
13522 ops
->print_recreate
= print_recreate_catch_exception
;
13524 ops
= &catch_exception_unhandled_breakpoint_ops
;
13525 *ops
= bkpt_breakpoint_ops
;
13526 ops
->dtor
= dtor_catch_exception_unhandled
;
13527 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13528 ops
->re_set
= re_set_catch_exception_unhandled
;
13529 ops
->check_status
= check_status_catch_exception_unhandled
;
13530 ops
->print_it
= print_it_catch_exception_unhandled
;
13531 ops
->print_one
= print_one_catch_exception_unhandled
;
13532 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13533 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13535 ops
= &catch_assert_breakpoint_ops
;
13536 *ops
= bkpt_breakpoint_ops
;
13537 ops
->dtor
= dtor_catch_assert
;
13538 ops
->allocate_location
= allocate_location_catch_assert
;
13539 ops
->re_set
= re_set_catch_assert
;
13540 ops
->check_status
= check_status_catch_assert
;
13541 ops
->print_it
= print_it_catch_assert
;
13542 ops
->print_one
= print_one_catch_assert
;
13543 ops
->print_mention
= print_mention_catch_assert
;
13544 ops
->print_recreate
= print_recreate_catch_assert
;
13547 /* This module's 'new_objfile' observer. */
13550 ada_new_objfile_observer (struct objfile
*objfile
)
13552 ada_clear_symbol_cache ();
13555 /* This module's 'free_objfile' observer. */
13558 ada_free_objfile_observer (struct objfile
*objfile
)
13560 ada_clear_symbol_cache ();
13564 _initialize_ada_language (void)
13566 add_language (&ada_language_defn
);
13568 initialize_ada_catchpoint_ops ();
13570 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13571 _("Prefix command for changing Ada-specfic settings"),
13572 &set_ada_list
, "set ada ", 0, &setlist
);
13574 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13575 _("Generic command for showing Ada-specific settings."),
13576 &show_ada_list
, "show ada ", 0, &showlist
);
13578 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13579 &trust_pad_over_xvs
, _("\
13580 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13581 Show whether an optimization trusting PAD types over XVS types is activated"),
13583 This is related to the encoding used by the GNAT compiler. The debugger\n\
13584 should normally trust the contents of PAD types, but certain older versions\n\
13585 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13586 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13587 work around this bug. It is always safe to turn this option \"off\", but\n\
13588 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13589 this option to \"off\" unless necessary."),
13590 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13592 add_catch_command ("exception", _("\
13593 Catch Ada exceptions, when raised.\n\
13594 With an argument, catch only exceptions with the given name."),
13595 catch_ada_exception_command
,
13599 add_catch_command ("assert", _("\
13600 Catch failed Ada assertions, when raised.\n\
13601 With an argument, catch only exceptions with the given name."),
13602 catch_assert_command
,
13607 varsize_limit
= 65536;
13609 add_info ("exceptions", info_exceptions_command
,
13611 List all Ada exception names.\n\
13612 If a regular expression is passed as an argument, only those matching\n\
13613 the regular expression are listed."));
13615 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13616 _("Set Ada maintenance-related variables."),
13617 &maint_set_ada_cmdlist
, "maintenance set ada ",
13618 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13620 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13621 _("Show Ada maintenance-related variables"),
13622 &maint_show_ada_cmdlist
, "maintenance show ada ",
13623 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13625 add_setshow_boolean_cmd
13626 ("ignore-descriptive-types", class_maintenance
,
13627 &ada_ignore_descriptive_types_p
,
13628 _("Set whether descriptive types generated by GNAT should be ignored."),
13629 _("Show whether descriptive types generated by GNAT should be ignored."),
13631 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13632 DWARF attribute."),
13633 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13635 obstack_init (&symbol_list_obstack
);
13637 decoded_names_store
= htab_create_alloc
13638 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13639 NULL
, xcalloc
, xfree
);
13641 /* The ada-lang observers. */
13642 observer_attach_new_objfile (ada_new_objfile_observer
);
13643 observer_attach_free_objfile (ada_free_objfile_observer
);
13644 observer_attach_inferior_exit (ada_inferior_exit
);
13646 /* Setup various context-specific data. */
13648 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13649 ada_pspace_data_handle
13650 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);