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 /* STRUCT_DOMAIN symbols are also typedefs for the type. This function tests
4395 the equivalency of two Ada symbol domain types. */
4398 ada_symbol_matches_domain (domain_enum symbol_domain
, domain_enum domain
)
4400 if (symbol_domain
== domain
4401 || ((domain
== VAR_DOMAIN
|| domain
== STRUCT_DOMAIN
)
4402 && symbol_domain
== STRUCT_DOMAIN
))
4408 /* Search our cache for an entry matching NAME and NAMESPACE.
4409 Return it if found, or NULL otherwise. */
4411 static struct cache_entry
**
4412 find_entry (const char *name
, domain_enum
namespace)
4414 struct ada_symbol_cache
*sym_cache
4415 = ada_get_symbol_cache (current_program_space
);
4416 int h
= msymbol_hash (name
) % HASH_SIZE
;
4417 struct cache_entry
**e
;
4419 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4421 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
4427 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4428 Return 1 if found, 0 otherwise.
4430 If an entry was found and SYM is not NULL, set *SYM to the entry's
4431 SYM. Same principle for BLOCK if not NULL. */
4434 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4435 struct symbol
**sym
, const struct block
**block
)
4437 struct cache_entry
**e
= find_entry (name
, namespace);
4444 *block
= (*e
)->block
;
4448 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4449 in domain NAMESPACE, save this result in our symbol cache. */
4452 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4453 const struct block
*block
)
4455 struct ada_symbol_cache
*sym_cache
4456 = ada_get_symbol_cache (current_program_space
);
4459 struct cache_entry
*e
;
4461 /* If the symbol is a local symbol, then do not cache it, as a search
4462 for that symbol depends on the context. To determine whether
4463 the symbol is local or not, we check the block where we found it
4464 against the global and static blocks of its associated symtab. */
4466 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), GLOBAL_BLOCK
) != block
4467 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), STATIC_BLOCK
) != block
)
4470 h
= msymbol_hash (name
) % HASH_SIZE
;
4471 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4473 e
->next
= sym_cache
->root
[h
];
4474 sym_cache
->root
[h
] = e
;
4475 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4476 strcpy (copy
, name
);
4478 e
->namespace = namespace;
4484 /* Return nonzero if wild matching should be used when searching for
4485 all symbols matching LOOKUP_NAME.
4487 LOOKUP_NAME is expected to be a symbol name after transformation
4488 for Ada lookups (see ada_name_for_lookup). */
4491 should_use_wild_match (const char *lookup_name
)
4493 return (strstr (lookup_name
, "__") == NULL
);
4496 /* Return the result of a standard (literal, C-like) lookup of NAME in
4497 given DOMAIN, visible from lexical block BLOCK. */
4499 static struct symbol
*
4500 standard_lookup (const char *name
, const struct block
*block
,
4503 /* Initialize it just to avoid a GCC false warning. */
4504 struct symbol
*sym
= NULL
;
4506 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4508 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4510 /* STRUCT_DOMAIN symbols also define a typedef for the type. Lookup
4511 a STRUCT_DOMAIN symbol if one is requested for VAR_DOMAIN and not
4513 if (sym
== NULL
&& domain
== VAR_DOMAIN
)
4514 sym
= lookup_symbol_in_language (name
, block
, STRUCT_DOMAIN
, language_c
, 0);
4516 cache_symbol (name
, domain
, sym
, block_found
);
4521 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4522 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4523 since they contend in overloading in the same way. */
4525 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4529 for (i
= 0; i
< n
; i
+= 1)
4530 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4531 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4532 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4538 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4539 struct types. Otherwise, they may not. */
4542 equiv_types (struct type
*type0
, struct type
*type1
)
4546 if (type0
== NULL
|| type1
== NULL
4547 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4549 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4550 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4551 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4552 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4558 /* True iff SYM0 represents the same entity as SYM1, or one that is
4559 no more defined than that of SYM1. */
4562 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4566 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4567 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4570 switch (SYMBOL_CLASS (sym0
))
4576 struct type
*type0
= SYMBOL_TYPE (sym0
);
4577 struct type
*type1
= SYMBOL_TYPE (sym1
);
4578 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4579 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4580 int len0
= strlen (name0
);
4583 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4584 && (equiv_types (type0
, type1
)
4585 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4586 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4589 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4590 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4596 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4597 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4600 add_defn_to_vec (struct obstack
*obstackp
,
4602 const struct block
*block
)
4605 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4607 /* Do not try to complete stub types, as the debugger is probably
4608 already scanning all symbols matching a certain name at the
4609 time when this function is called. Trying to replace the stub
4610 type by its associated full type will cause us to restart a scan
4611 which may lead to an infinite recursion. Instead, the client
4612 collecting the matching symbols will end up collecting several
4613 matches, with at least one of them complete. It can then filter
4614 out the stub ones if needed. */
4616 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4618 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4620 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4622 prevDefns
[i
].sym
= sym
;
4623 prevDefns
[i
].block
= block
;
4629 struct ada_symbol_info info
;
4633 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4637 /* Number of ada_symbol_info structures currently collected in
4638 current vector in *OBSTACKP. */
4641 num_defns_collected (struct obstack
*obstackp
)
4643 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4646 /* Vector of ada_symbol_info structures currently collected in current
4647 vector in *OBSTACKP. If FINISH, close off the vector and return
4648 its final address. */
4650 static struct ada_symbol_info
*
4651 defns_collected (struct obstack
*obstackp
, int finish
)
4654 return obstack_finish (obstackp
);
4656 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4659 /* Return a bound minimal symbol matching NAME according to Ada
4660 decoding rules. Returns an invalid symbol if there is no such
4661 minimal symbol. Names prefixed with "standard__" are handled
4662 specially: "standard__" is first stripped off, and only static and
4663 global symbols are searched. */
4665 struct bound_minimal_symbol
4666 ada_lookup_simple_minsym (const char *name
)
4668 struct bound_minimal_symbol result
;
4669 struct objfile
*objfile
;
4670 struct minimal_symbol
*msymbol
;
4671 const int wild_match_p
= should_use_wild_match (name
);
4673 memset (&result
, 0, sizeof (result
));
4675 /* Special case: If the user specifies a symbol name inside package
4676 Standard, do a non-wild matching of the symbol name without
4677 the "standard__" prefix. This was primarily introduced in order
4678 to allow the user to specifically access the standard exceptions
4679 using, for instance, Standard.Constraint_Error when Constraint_Error
4680 is ambiguous (due to the user defining its own Constraint_Error
4681 entity inside its program). */
4682 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4683 name
+= sizeof ("standard__") - 1;
4685 ALL_MSYMBOLS (objfile
, msymbol
)
4687 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4688 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4690 result
.minsym
= msymbol
;
4691 result
.objfile
= objfile
;
4699 /* For all subprograms that statically enclose the subprogram of the
4700 selected frame, add symbols matching identifier NAME in DOMAIN
4701 and their blocks to the list of data in OBSTACKP, as for
4702 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4703 with a wildcard prefix. */
4706 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4707 const char *name
, domain_enum
namespace,
4712 /* True if TYPE is definitely an artificial type supplied to a symbol
4713 for which no debugging information was given in the symbol file. */
4716 is_nondebugging_type (struct type
*type
)
4718 const char *name
= ada_type_name (type
);
4720 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4723 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4724 that are deemed "identical" for practical purposes.
4726 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4727 types and that their number of enumerals is identical (in other
4728 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4731 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4735 /* The heuristic we use here is fairly conservative. We consider
4736 that 2 enumerate types are identical if they have the same
4737 number of enumerals and that all enumerals have the same
4738 underlying value and name. */
4740 /* All enums in the type should have an identical underlying value. */
4741 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4742 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4745 /* All enumerals should also have the same name (modulo any numerical
4747 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4749 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4750 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4751 int len_1
= strlen (name_1
);
4752 int len_2
= strlen (name_2
);
4754 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4755 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4757 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4758 TYPE_FIELD_NAME (type2
, i
),
4766 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4767 that are deemed "identical" for practical purposes. Sometimes,
4768 enumerals are not strictly identical, but their types are so similar
4769 that they can be considered identical.
4771 For instance, consider the following code:
4773 type Color is (Black, Red, Green, Blue, White);
4774 type RGB_Color is new Color range Red .. Blue;
4776 Type RGB_Color is a subrange of an implicit type which is a copy
4777 of type Color. If we call that implicit type RGB_ColorB ("B" is
4778 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4779 As a result, when an expression references any of the enumeral
4780 by name (Eg. "print green"), the expression is technically
4781 ambiguous and the user should be asked to disambiguate. But
4782 doing so would only hinder the user, since it wouldn't matter
4783 what choice he makes, the outcome would always be the same.
4784 So, for practical purposes, we consider them as the same. */
4787 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4791 /* Before performing a thorough comparison check of each type,
4792 we perform a series of inexpensive checks. We expect that these
4793 checks will quickly fail in the vast majority of cases, and thus
4794 help prevent the unnecessary use of a more expensive comparison.
4795 Said comparison also expects us to make some of these checks
4796 (see ada_identical_enum_types_p). */
4798 /* Quick check: All symbols should have an enum type. */
4799 for (i
= 0; i
< nsyms
; i
++)
4800 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4803 /* Quick check: They should all have the same value. */
4804 for (i
= 1; i
< nsyms
; i
++)
4805 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4808 /* Quick check: They should all have the same number of enumerals. */
4809 for (i
= 1; i
< nsyms
; i
++)
4810 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4811 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4814 /* All the sanity checks passed, so we might have a set of
4815 identical enumeration types. Perform a more complete
4816 comparison of the type of each symbol. */
4817 for (i
= 1; i
< nsyms
; i
++)
4818 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4819 SYMBOL_TYPE (syms
[0].sym
)))
4825 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4826 duplicate other symbols in the list (The only case I know of where
4827 this happens is when object files containing stabs-in-ecoff are
4828 linked with files containing ordinary ecoff debugging symbols (or no
4829 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4830 Returns the number of items in the modified list. */
4833 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4837 /* We should never be called with less than 2 symbols, as there
4838 cannot be any extra symbol in that case. But it's easy to
4839 handle, since we have nothing to do in that case. */
4848 /* If two symbols have the same name and one of them is a stub type,
4849 the get rid of the stub. */
4851 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4852 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4854 for (j
= 0; j
< nsyms
; j
++)
4857 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4858 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4859 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4860 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4865 /* Two symbols with the same name, same class and same address
4866 should be identical. */
4868 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4869 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4870 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4872 for (j
= 0; j
< nsyms
; j
+= 1)
4875 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4876 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4877 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4878 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4879 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4880 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4887 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4888 syms
[j
- 1] = syms
[j
];
4895 /* If all the remaining symbols are identical enumerals, then
4896 just keep the first one and discard the rest.
4898 Unlike what we did previously, we do not discard any entry
4899 unless they are ALL identical. This is because the symbol
4900 comparison is not a strict comparison, but rather a practical
4901 comparison. If all symbols are considered identical, then
4902 we can just go ahead and use the first one and discard the rest.
4903 But if we cannot reduce the list to a single element, we have
4904 to ask the user to disambiguate anyways. And if we have to
4905 present a multiple-choice menu, it's less confusing if the list
4906 isn't missing some choices that were identical and yet distinct. */
4907 if (symbols_are_identical_enums (syms
, nsyms
))
4913 /* Given a type that corresponds to a renaming entity, use the type name
4914 to extract the scope (package name or function name, fully qualified,
4915 and following the GNAT encoding convention) where this renaming has been
4916 defined. The string returned needs to be deallocated after use. */
4919 xget_renaming_scope (struct type
*renaming_type
)
4921 /* The renaming types adhere to the following convention:
4922 <scope>__<rename>___<XR extension>.
4923 So, to extract the scope, we search for the "___XR" extension,
4924 and then backtrack until we find the first "__". */
4926 const char *name
= type_name_no_tag (renaming_type
);
4927 char *suffix
= strstr (name
, "___XR");
4932 /* Now, backtrack a bit until we find the first "__". Start looking
4933 at suffix - 3, as the <rename> part is at least one character long. */
4935 for (last
= suffix
- 3; last
> name
; last
--)
4936 if (last
[0] == '_' && last
[1] == '_')
4939 /* Make a copy of scope and return it. */
4941 scope_len
= last
- name
;
4942 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4944 strncpy (scope
, name
, scope_len
);
4945 scope
[scope_len
] = '\0';
4950 /* Return nonzero if NAME corresponds to a package name. */
4953 is_package_name (const char *name
)
4955 /* Here, We take advantage of the fact that no symbols are generated
4956 for packages, while symbols are generated for each function.
4957 So the condition for NAME represent a package becomes equivalent
4958 to NAME not existing in our list of symbols. There is only one
4959 small complication with library-level functions (see below). */
4963 /* If it is a function that has not been defined at library level,
4964 then we should be able to look it up in the symbols. */
4965 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4968 /* Library-level function names start with "_ada_". See if function
4969 "_ada_" followed by NAME can be found. */
4971 /* Do a quick check that NAME does not contain "__", since library-level
4972 functions names cannot contain "__" in them. */
4973 if (strstr (name
, "__") != NULL
)
4976 fun_name
= xstrprintf ("_ada_%s", name
);
4978 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4981 /* Return nonzero if SYM corresponds to a renaming entity that is
4982 not visible from FUNCTION_NAME. */
4985 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4988 struct cleanup
*old_chain
;
4990 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4993 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4994 old_chain
= make_cleanup (xfree
, scope
);
4996 /* If the rename has been defined in a package, then it is visible. */
4997 if (is_package_name (scope
))
4999 do_cleanups (old_chain
);
5003 /* Check that the rename is in the current function scope by checking
5004 that its name starts with SCOPE. */
5006 /* If the function name starts with "_ada_", it means that it is
5007 a library-level function. Strip this prefix before doing the
5008 comparison, as the encoding for the renaming does not contain
5010 if (strncmp (function_name
, "_ada_", 5) == 0)
5014 int is_invisible
= strncmp (function_name
, scope
, strlen (scope
)) != 0;
5016 do_cleanups (old_chain
);
5017 return is_invisible
;
5021 /* Remove entries from SYMS that corresponds to a renaming entity that
5022 is not visible from the function associated with CURRENT_BLOCK or
5023 that is superfluous due to the presence of more specific renaming
5024 information. Places surviving symbols in the initial entries of
5025 SYMS and returns the number of surviving symbols.
5028 First, in cases where an object renaming is implemented as a
5029 reference variable, GNAT may produce both the actual reference
5030 variable and the renaming encoding. In this case, we discard the
5033 Second, GNAT emits a type following a specified encoding for each renaming
5034 entity. Unfortunately, STABS currently does not support the definition
5035 of types that are local to a given lexical block, so all renamings types
5036 are emitted at library level. As a consequence, if an application
5037 contains two renaming entities using the same name, and a user tries to
5038 print the value of one of these entities, the result of the ada symbol
5039 lookup will also contain the wrong renaming type.
5041 This function partially covers for this limitation by attempting to
5042 remove from the SYMS list renaming symbols that should be visible
5043 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5044 method with the current information available. The implementation
5045 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5047 - When the user tries to print a rename in a function while there
5048 is another rename entity defined in a package: Normally, the
5049 rename in the function has precedence over the rename in the
5050 package, so the latter should be removed from the list. This is
5051 currently not the case.
5053 - This function will incorrectly remove valid renames if
5054 the CURRENT_BLOCK corresponds to a function which symbol name
5055 has been changed by an "Export" pragma. As a consequence,
5056 the user will be unable to print such rename entities. */
5059 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5060 int nsyms
, const struct block
*current_block
)
5062 struct symbol
*current_function
;
5063 const char *current_function_name
;
5065 int is_new_style_renaming
;
5067 /* If there is both a renaming foo___XR... encoded as a variable and
5068 a simple variable foo in the same block, discard the latter.
5069 First, zero out such symbols, then compress. */
5070 is_new_style_renaming
= 0;
5071 for (i
= 0; i
< nsyms
; i
+= 1)
5073 struct symbol
*sym
= syms
[i
].sym
;
5074 const struct block
*block
= syms
[i
].block
;
5078 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5080 name
= SYMBOL_LINKAGE_NAME (sym
);
5081 suffix
= strstr (name
, "___XR");
5085 int name_len
= suffix
- name
;
5088 is_new_style_renaming
= 1;
5089 for (j
= 0; j
< nsyms
; j
+= 1)
5090 if (i
!= j
&& syms
[j
].sym
!= NULL
5091 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5093 && block
== syms
[j
].block
)
5097 if (is_new_style_renaming
)
5101 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5102 if (syms
[j
].sym
!= NULL
)
5110 /* Extract the function name associated to CURRENT_BLOCK.
5111 Abort if unable to do so. */
5113 if (current_block
== NULL
)
5116 current_function
= block_linkage_function (current_block
);
5117 if (current_function
== NULL
)
5120 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5121 if (current_function_name
== NULL
)
5124 /* Check each of the symbols, and remove it from the list if it is
5125 a type corresponding to a renaming that is out of the scope of
5126 the current block. */
5131 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5132 == ADA_OBJECT_RENAMING
5133 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5137 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5138 syms
[j
- 1] = syms
[j
];
5148 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5149 whose name and domain match NAME and DOMAIN respectively.
5150 If no match was found, then extend the search to "enclosing"
5151 routines (in other words, if we're inside a nested function,
5152 search the symbols defined inside the enclosing functions).
5153 If WILD_MATCH_P is nonzero, perform the naming matching in
5154 "wild" mode (see function "wild_match" for more info).
5156 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5159 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5160 const struct block
*block
, domain_enum domain
,
5163 int block_depth
= 0;
5165 while (block
!= NULL
)
5168 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5171 /* If we found a non-function match, assume that's the one. */
5172 if (is_nonfunction (defns_collected (obstackp
, 0),
5173 num_defns_collected (obstackp
)))
5176 block
= BLOCK_SUPERBLOCK (block
);
5179 /* If no luck so far, try to find NAME as a local symbol in some lexically
5180 enclosing subprogram. */
5181 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5182 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5185 /* An object of this type is used as the user_data argument when
5186 calling the map_matching_symbols method. */
5190 struct objfile
*objfile
;
5191 struct obstack
*obstackp
;
5192 struct symbol
*arg_sym
;
5196 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5197 to a list of symbols. DATA0 is a pointer to a struct match_data *
5198 containing the obstack that collects the symbol list, the file that SYM
5199 must come from, a flag indicating whether a non-argument symbol has
5200 been found in the current block, and the last argument symbol
5201 passed in SYM within the current block (if any). When SYM is null,
5202 marking the end of a block, the argument symbol is added if no
5203 other has been found. */
5206 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5208 struct match_data
*data
= (struct match_data
*) data0
;
5212 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5213 add_defn_to_vec (data
->obstackp
,
5214 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5216 data
->found_sym
= 0;
5217 data
->arg_sym
= NULL
;
5221 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5223 else if (SYMBOL_IS_ARGUMENT (sym
))
5224 data
->arg_sym
= sym
;
5227 data
->found_sym
= 1;
5228 add_defn_to_vec (data
->obstackp
,
5229 fixup_symbol_section (sym
, data
->objfile
),
5236 /* Implements compare_names, but only applying the comparision using
5237 the given CASING. */
5240 compare_names_with_case (const char *string1
, const char *string2
,
5241 enum case_sensitivity casing
)
5243 while (*string1
!= '\0' && *string2
!= '\0')
5247 if (isspace (*string1
) || isspace (*string2
))
5248 return strcmp_iw_ordered (string1
, string2
);
5250 if (casing
== case_sensitive_off
)
5252 c1
= tolower (*string1
);
5253 c2
= tolower (*string2
);
5270 return strcmp_iw_ordered (string1
, string2
);
5272 if (*string2
== '\0')
5274 if (is_name_suffix (string1
))
5281 if (*string2
== '(')
5282 return strcmp_iw_ordered (string1
, string2
);
5285 if (casing
== case_sensitive_off
)
5286 return tolower (*string1
) - tolower (*string2
);
5288 return *string1
- *string2
;
5293 /* Compare STRING1 to STRING2, with results as for strcmp.
5294 Compatible with strcmp_iw_ordered in that...
5296 strcmp_iw_ordered (STRING1, STRING2) <= 0
5300 compare_names (STRING1, STRING2) <= 0
5302 (they may differ as to what symbols compare equal). */
5305 compare_names (const char *string1
, const char *string2
)
5309 /* Similar to what strcmp_iw_ordered does, we need to perform
5310 a case-insensitive comparison first, and only resort to
5311 a second, case-sensitive, comparison if the first one was
5312 not sufficient to differentiate the two strings. */
5314 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5316 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5321 /* Add to OBSTACKP all non-local symbols whose name and domain match
5322 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5323 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5326 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5327 domain_enum domain
, int global
,
5330 struct objfile
*objfile
;
5331 struct match_data data
;
5333 memset (&data
, 0, sizeof data
);
5334 data
.obstackp
= obstackp
;
5336 ALL_OBJFILES (objfile
)
5338 data
.objfile
= objfile
;
5342 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5343 aux_add_nonlocal_symbols
,
5344 &data
, wild_match
, NULL
);
5345 if (domain
== VAR_DOMAIN
)
5346 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
,
5347 STRUCT_DOMAIN
, global
,
5348 aux_add_nonlocal_symbols
,
5349 &data
, wild_match
, NULL
);
5353 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5354 aux_add_nonlocal_symbols
,
5357 if (domain
== VAR_DOMAIN
)
5358 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
,
5359 STRUCT_DOMAIN
, global
,
5360 aux_add_nonlocal_symbols
,
5366 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5368 ALL_OBJFILES (objfile
)
5370 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5371 strcpy (name1
, "_ada_");
5372 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5373 data
.objfile
= objfile
;
5374 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5376 aux_add_nonlocal_symbols
,
5378 full_match
, compare_names
);
5383 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5384 non-zero, enclosing scope and in global scopes, returning the number of
5386 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5387 indicating the symbols found and the blocks and symbol tables (if
5388 any) in which they were found. This vector is transient---good only to
5389 the next call of ada_lookup_symbol_list.
5391 When full_search is non-zero, any non-function/non-enumeral
5392 symbol match within the nest of blocks whose innermost member is BLOCK0,
5393 is the one match returned (no other matches in that or
5394 enclosing blocks is returned). If there are any matches in or
5395 surrounding BLOCK0, then these alone are returned.
5397 Names prefixed with "standard__" are handled specially: "standard__"
5398 is first stripped off, and only static and global symbols are searched. */
5401 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5402 domain_enum
namespace,
5403 struct ada_symbol_info
**results
,
5407 const struct block
*block
;
5409 const int wild_match_p
= should_use_wild_match (name0
);
5413 obstack_free (&symbol_list_obstack
, NULL
);
5414 obstack_init (&symbol_list_obstack
);
5418 /* Search specified block and its superiors. */
5423 /* Special case: If the user specifies a symbol name inside package
5424 Standard, do a non-wild matching of the symbol name without
5425 the "standard__" prefix. This was primarily introduced in order
5426 to allow the user to specifically access the standard exceptions
5427 using, for instance, Standard.Constraint_Error when Constraint_Error
5428 is ambiguous (due to the user defining its own Constraint_Error
5429 entity inside its program). */
5430 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5433 name
= name0
+ sizeof ("standard__") - 1;
5436 /* Check the non-global symbols. If we have ANY match, then we're done. */
5442 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5443 namespace, wild_match_p
);
5447 /* In the !full_search case we're are being called by
5448 ada_iterate_over_symbols, and we don't want to search
5450 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5451 namespace, NULL
, wild_match_p
);
5453 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5457 /* No non-global symbols found. Check our cache to see if we have
5458 already performed this search before. If we have, then return
5462 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5465 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5469 /* Search symbols from all global blocks. */
5471 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5474 /* Now add symbols from all per-file blocks if we've gotten no hits
5475 (not strictly correct, but perhaps better than an error). */
5477 if (num_defns_collected (&symbol_list_obstack
) == 0)
5478 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5482 ndefns
= num_defns_collected (&symbol_list_obstack
);
5483 *results
= defns_collected (&symbol_list_obstack
, 1);
5485 ndefns
= remove_extra_symbols (*results
, ndefns
);
5487 if (ndefns
== 0 && full_search
)
5488 cache_symbol (name0
, namespace, NULL
, NULL
);
5490 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5491 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5493 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5498 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5499 in global scopes, returning the number of matches, and setting *RESULTS
5500 to a vector of (SYM,BLOCK) tuples.
5501 See ada_lookup_symbol_list_worker for further details. */
5504 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5505 domain_enum domain
, struct ada_symbol_info
**results
)
5507 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5510 /* Implementation of the la_iterate_over_symbols method. */
5513 ada_iterate_over_symbols (const struct block
*block
,
5514 const char *name
, domain_enum domain
,
5515 symbol_found_callback_ftype
*callback
,
5519 struct ada_symbol_info
*results
;
5521 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5522 for (i
= 0; i
< ndefs
; ++i
)
5524 if (! (*callback
) (results
[i
].sym
, data
))
5529 /* If NAME is the name of an entity, return a string that should
5530 be used to look that entity up in Ada units. This string should
5531 be deallocated after use using xfree.
5533 NAME can have any form that the "break" or "print" commands might
5534 recognize. In other words, it does not have to be the "natural"
5535 name, or the "encoded" name. */
5538 ada_name_for_lookup (const char *name
)
5541 int nlen
= strlen (name
);
5543 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5545 canon
= xmalloc (nlen
- 1);
5546 memcpy (canon
, name
+ 1, nlen
- 2);
5547 canon
[nlen
- 2] = '\0';
5550 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5554 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5555 to 1, but choosing the first symbol found if there are multiple
5558 The result is stored in *INFO, which must be non-NULL.
5559 If no match is found, INFO->SYM is set to NULL. */
5562 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5563 domain_enum
namespace,
5564 struct ada_symbol_info
*info
)
5566 struct ada_symbol_info
*candidates
;
5569 gdb_assert (info
!= NULL
);
5570 memset (info
, 0, sizeof (struct ada_symbol_info
));
5572 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
);
5573 if (n_candidates
== 0)
5576 *info
= candidates
[0];
5577 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5580 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5581 scope and in global scopes, or NULL if none. NAME is folded and
5582 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5583 choosing the first symbol if there are multiple choices.
5584 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5587 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5588 domain_enum
namespace, int *is_a_field_of_this
)
5590 struct ada_symbol_info info
;
5592 if (is_a_field_of_this
!= NULL
)
5593 *is_a_field_of_this
= 0;
5595 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5596 block0
, namespace, &info
);
5600 static struct symbol
*
5601 ada_lookup_symbol_nonlocal (const char *name
,
5602 const struct block
*block
,
5603 const domain_enum domain
)
5605 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5609 /* True iff STR is a possible encoded suffix of a normal Ada name
5610 that is to be ignored for matching purposes. Suffixes of parallel
5611 names (e.g., XVE) are not included here. Currently, the possible suffixes
5612 are given by any of the regular expressions:
5614 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5615 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5616 TKB [subprogram suffix for task bodies]
5617 _E[0-9]+[bs]$ [protected object entry suffixes]
5618 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5620 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5621 match is performed. This sequence is used to differentiate homonyms,
5622 is an optional part of a valid name suffix. */
5625 is_name_suffix (const char *str
)
5628 const char *matching
;
5629 const int len
= strlen (str
);
5631 /* Skip optional leading __[0-9]+. */
5633 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5636 while (isdigit (str
[0]))
5642 if (str
[0] == '.' || str
[0] == '$')
5645 while (isdigit (matching
[0]))
5647 if (matching
[0] == '\0')
5653 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5656 while (isdigit (matching
[0]))
5658 if (matching
[0] == '\0')
5662 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5664 if (strcmp (str
, "TKB") == 0)
5668 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5669 with a N at the end. Unfortunately, the compiler uses the same
5670 convention for other internal types it creates. So treating
5671 all entity names that end with an "N" as a name suffix causes
5672 some regressions. For instance, consider the case of an enumerated
5673 type. To support the 'Image attribute, it creates an array whose
5675 Having a single character like this as a suffix carrying some
5676 information is a bit risky. Perhaps we should change the encoding
5677 to be something like "_N" instead. In the meantime, do not do
5678 the following check. */
5679 /* Protected Object Subprograms */
5680 if (len
== 1 && str
[0] == 'N')
5685 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5688 while (isdigit (matching
[0]))
5690 if ((matching
[0] == 'b' || matching
[0] == 's')
5691 && matching
[1] == '\0')
5695 /* ??? We should not modify STR directly, as we are doing below. This
5696 is fine in this case, but may become problematic later if we find
5697 that this alternative did not work, and want to try matching
5698 another one from the begining of STR. Since we modified it, we
5699 won't be able to find the begining of the string anymore! */
5703 while (str
[0] != '_' && str
[0] != '\0')
5705 if (str
[0] != 'n' && str
[0] != 'b')
5711 if (str
[0] == '\000')
5716 if (str
[1] != '_' || str
[2] == '\000')
5720 if (strcmp (str
+ 3, "JM") == 0)
5722 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5723 the LJM suffix in favor of the JM one. But we will
5724 still accept LJM as a valid suffix for a reasonable
5725 amount of time, just to allow ourselves to debug programs
5726 compiled using an older version of GNAT. */
5727 if (strcmp (str
+ 3, "LJM") == 0)
5731 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5732 || str
[4] == 'U' || str
[4] == 'P')
5734 if (str
[4] == 'R' && str
[5] != 'T')
5738 if (!isdigit (str
[2]))
5740 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5741 if (!isdigit (str
[k
]) && str
[k
] != '_')
5745 if (str
[0] == '$' && isdigit (str
[1]))
5747 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5748 if (!isdigit (str
[k
]) && str
[k
] != '_')
5755 /* Return non-zero if the string starting at NAME and ending before
5756 NAME_END contains no capital letters. */
5759 is_valid_name_for_wild_match (const char *name0
)
5761 const char *decoded_name
= ada_decode (name0
);
5764 /* If the decoded name starts with an angle bracket, it means that
5765 NAME0 does not follow the GNAT encoding format. It should then
5766 not be allowed as a possible wild match. */
5767 if (decoded_name
[0] == '<')
5770 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5771 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5777 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5778 that could start a simple name. Assumes that *NAMEP points into
5779 the string beginning at NAME0. */
5782 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5784 const char *name
= *namep
;
5794 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5797 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5802 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5803 || name
[2] == target0
))
5811 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5821 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5822 informational suffixes of NAME (i.e., for which is_name_suffix is
5823 true). Assumes that PATN is a lower-cased Ada simple name. */
5826 wild_match (const char *name
, const char *patn
)
5829 const char *name0
= name
;
5833 const char *match
= name
;
5837 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5840 if (*p
== '\0' && is_name_suffix (name
))
5841 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5843 if (name
[-1] == '_')
5846 if (!advance_wild_match (&name
, name0
, *patn
))
5851 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5852 informational suffix. */
5855 full_match (const char *sym_name
, const char *search_name
)
5857 return !match_name (sym_name
, search_name
, 0);
5861 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5862 vector *defn_symbols, updating the list of symbols in OBSTACKP
5863 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5864 OBJFILE is the section containing BLOCK. */
5867 ada_add_block_symbols (struct obstack
*obstackp
,
5868 const struct block
*block
, const char *name
,
5869 domain_enum domain
, struct objfile
*objfile
,
5872 struct block_iterator iter
;
5873 int name_len
= strlen (name
);
5874 /* A matching argument symbol, if any. */
5875 struct symbol
*arg_sym
;
5876 /* Set true when we find a matching non-argument symbol. */
5884 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5885 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5887 if (ada_symbol_matches_domain (SYMBOL_DOMAIN (sym
), domain
)
5888 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5890 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5892 else if (SYMBOL_IS_ARGUMENT (sym
))
5897 add_defn_to_vec (obstackp
,
5898 fixup_symbol_section (sym
, objfile
),
5906 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5907 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5909 if (ada_symbol_matches_domain (SYMBOL_DOMAIN (sym
), domain
))
5911 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5913 if (SYMBOL_IS_ARGUMENT (sym
))
5918 add_defn_to_vec (obstackp
,
5919 fixup_symbol_section (sym
, objfile
),
5927 if (!found_sym
&& arg_sym
!= NULL
)
5929 add_defn_to_vec (obstackp
,
5930 fixup_symbol_section (arg_sym
, objfile
),
5939 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5941 if (ada_symbol_matches_domain (SYMBOL_DOMAIN (sym
), domain
))
5945 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5948 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5950 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5955 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5957 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5959 if (SYMBOL_IS_ARGUMENT (sym
))
5964 add_defn_to_vec (obstackp
,
5965 fixup_symbol_section (sym
, objfile
),
5973 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5974 They aren't parameters, right? */
5975 if (!found_sym
&& arg_sym
!= NULL
)
5977 add_defn_to_vec (obstackp
,
5978 fixup_symbol_section (arg_sym
, objfile
),
5985 /* Symbol Completion */
5987 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5988 name in a form that's appropriate for the completion. The result
5989 does not need to be deallocated, but is only good until the next call.
5991 TEXT_LEN is equal to the length of TEXT.
5992 Perform a wild match if WILD_MATCH_P is set.
5993 ENCODED_P should be set if TEXT represents the start of a symbol name
5994 in its encoded form. */
5997 symbol_completion_match (const char *sym_name
,
5998 const char *text
, int text_len
,
5999 int wild_match_p
, int encoded_p
)
6001 const int verbatim_match
= (text
[0] == '<');
6006 /* Strip the leading angle bracket. */
6011 /* First, test against the fully qualified name of the symbol. */
6013 if (strncmp (sym_name
, text
, text_len
) == 0)
6016 if (match
&& !encoded_p
)
6018 /* One needed check before declaring a positive match is to verify
6019 that iff we are doing a verbatim match, the decoded version
6020 of the symbol name starts with '<'. Otherwise, this symbol name
6021 is not a suitable completion. */
6022 const char *sym_name_copy
= sym_name
;
6023 int has_angle_bracket
;
6025 sym_name
= ada_decode (sym_name
);
6026 has_angle_bracket
= (sym_name
[0] == '<');
6027 match
= (has_angle_bracket
== verbatim_match
);
6028 sym_name
= sym_name_copy
;
6031 if (match
&& !verbatim_match
)
6033 /* When doing non-verbatim match, another check that needs to
6034 be done is to verify that the potentially matching symbol name
6035 does not include capital letters, because the ada-mode would
6036 not be able to understand these symbol names without the
6037 angle bracket notation. */
6040 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6045 /* Second: Try wild matching... */
6047 if (!match
&& wild_match_p
)
6049 /* Since we are doing wild matching, this means that TEXT
6050 may represent an unqualified symbol name. We therefore must
6051 also compare TEXT against the unqualified name of the symbol. */
6052 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6054 if (strncmp (sym_name
, text
, text_len
) == 0)
6058 /* Finally: If we found a mach, prepare the result to return. */
6064 sym_name
= add_angle_brackets (sym_name
);
6067 sym_name
= ada_decode (sym_name
);
6072 /* A companion function to ada_make_symbol_completion_list().
6073 Check if SYM_NAME represents a symbol which name would be suitable
6074 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6075 it is appended at the end of the given string vector SV.
6077 ORIG_TEXT is the string original string from the user command
6078 that needs to be completed. WORD is the entire command on which
6079 completion should be performed. These two parameters are used to
6080 determine which part of the symbol name should be added to the
6082 if WILD_MATCH_P is set, then wild matching is performed.
6083 ENCODED_P should be set if TEXT represents a symbol name in its
6084 encoded formed (in which case the completion should also be
6088 symbol_completion_add (VEC(char_ptr
) **sv
,
6089 const char *sym_name
,
6090 const char *text
, int text_len
,
6091 const char *orig_text
, const char *word
,
6092 int wild_match_p
, int encoded_p
)
6094 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6095 wild_match_p
, encoded_p
);
6101 /* We found a match, so add the appropriate completion to the given
6104 if (word
== orig_text
)
6106 completion
= xmalloc (strlen (match
) + 5);
6107 strcpy (completion
, match
);
6109 else if (word
> orig_text
)
6111 /* Return some portion of sym_name. */
6112 completion
= xmalloc (strlen (match
) + 5);
6113 strcpy (completion
, match
+ (word
- orig_text
));
6117 /* Return some of ORIG_TEXT plus sym_name. */
6118 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6119 strncpy (completion
, word
, orig_text
- word
);
6120 completion
[orig_text
- word
] = '\0';
6121 strcat (completion
, match
);
6124 VEC_safe_push (char_ptr
, *sv
, completion
);
6127 /* An object of this type is passed as the user_data argument to the
6128 expand_symtabs_matching method. */
6129 struct add_partial_datum
6131 VEC(char_ptr
) **completions
;
6140 /* A callback for expand_symtabs_matching. */
6143 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6145 struct add_partial_datum
*data
= user_data
;
6147 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6148 data
->wild_match
, data
->encoded
) != NULL
;
6151 /* Return a list of possible symbol names completing TEXT0. WORD is
6152 the entire command on which completion is made. */
6154 static VEC (char_ptr
) *
6155 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6156 enum type_code code
)
6162 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6165 struct minimal_symbol
*msymbol
;
6166 struct objfile
*objfile
;
6167 struct block
*b
, *surrounding_static_block
= 0;
6169 struct block_iterator iter
;
6170 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6172 gdb_assert (code
== TYPE_CODE_UNDEF
);
6174 if (text0
[0] == '<')
6176 text
= xstrdup (text0
);
6177 make_cleanup (xfree
, text
);
6178 text_len
= strlen (text
);
6184 text
= xstrdup (ada_encode (text0
));
6185 make_cleanup (xfree
, text
);
6186 text_len
= strlen (text
);
6187 for (i
= 0; i
< text_len
; i
++)
6188 text
[i
] = tolower (text
[i
]);
6190 encoded_p
= (strstr (text0
, "__") != NULL
);
6191 /* If the name contains a ".", then the user is entering a fully
6192 qualified entity name, and the match must not be done in wild
6193 mode. Similarly, if the user wants to complete what looks like
6194 an encoded name, the match must not be done in wild mode. */
6195 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6198 /* First, look at the partial symtab symbols. */
6200 struct add_partial_datum data
;
6202 data
.completions
= &completions
;
6204 data
.text_len
= text_len
;
6207 data
.wild_match
= wild_match_p
;
6208 data
.encoded
= encoded_p
;
6209 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, ALL_DOMAIN
,
6213 /* At this point scan through the misc symbol vectors and add each
6214 symbol you find to the list. Eventually we want to ignore
6215 anything that isn't a text symbol (everything else will be
6216 handled by the psymtab code above). */
6218 ALL_MSYMBOLS (objfile
, msymbol
)
6221 symbol_completion_add (&completions
, MSYMBOL_LINKAGE_NAME (msymbol
),
6222 text
, text_len
, text0
, word
, wild_match_p
,
6226 /* Search upwards from currently selected frame (so that we can
6227 complete on local vars. */
6229 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6231 if (!BLOCK_SUPERBLOCK (b
))
6232 surrounding_static_block
= b
; /* For elmin of dups */
6234 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6236 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6237 text
, text_len
, text0
, word
,
6238 wild_match_p
, encoded_p
);
6242 /* Go through the symtabs and check the externs and statics for
6243 symbols which match. */
6245 ALL_SYMTABS (objfile
, s
)
6248 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6249 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6251 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6252 text
, text_len
, text0
, word
,
6253 wild_match_p
, encoded_p
);
6257 ALL_SYMTABS (objfile
, s
)
6260 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
6261 /* Don't do this block twice. */
6262 if (b
== surrounding_static_block
)
6264 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6266 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6267 text
, text_len
, text0
, word
,
6268 wild_match_p
, encoded_p
);
6272 do_cleanups (old_chain
);
6278 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6279 for tagged types. */
6282 ada_is_dispatch_table_ptr_type (struct type
*type
)
6286 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6289 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6293 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6296 /* Return non-zero if TYPE is an interface tag. */
6299 ada_is_interface_tag (struct type
*type
)
6301 const char *name
= TYPE_NAME (type
);
6306 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6309 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6310 to be invisible to users. */
6313 ada_is_ignored_field (struct type
*type
, int field_num
)
6315 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6318 /* Check the name of that field. */
6320 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6322 /* Anonymous field names should not be printed.
6323 brobecker/2007-02-20: I don't think this can actually happen
6324 but we don't want to print the value of annonymous fields anyway. */
6328 /* Normally, fields whose name start with an underscore ("_")
6329 are fields that have been internally generated by the compiler,
6330 and thus should not be printed. The "_parent" field is special,
6331 however: This is a field internally generated by the compiler
6332 for tagged types, and it contains the components inherited from
6333 the parent type. This field should not be printed as is, but
6334 should not be ignored either. */
6335 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
6339 /* If this is the dispatch table of a tagged type or an interface tag,
6341 if (ada_is_tagged_type (type
, 1)
6342 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6343 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6346 /* Not a special field, so it should not be ignored. */
6350 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6351 pointer or reference type whose ultimate target has a tag field. */
6354 ada_is_tagged_type (struct type
*type
, int refok
)
6356 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6359 /* True iff TYPE represents the type of X'Tag */
6362 ada_is_tag_type (struct type
*type
)
6364 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6368 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6370 return (name
!= NULL
6371 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6375 /* The type of the tag on VAL. */
6378 ada_tag_type (struct value
*val
)
6380 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6383 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6384 retired at Ada 05). */
6387 is_ada95_tag (struct value
*tag
)
6389 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6392 /* The value of the tag on VAL. */
6395 ada_value_tag (struct value
*val
)
6397 return ada_value_struct_elt (val
, "_tag", 0);
6400 /* The value of the tag on the object of type TYPE whose contents are
6401 saved at VALADDR, if it is non-null, or is at memory address
6404 static struct value
*
6405 value_tag_from_contents_and_address (struct type
*type
,
6406 const gdb_byte
*valaddr
,
6409 int tag_byte_offset
;
6410 struct type
*tag_type
;
6412 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6415 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6417 : valaddr
+ tag_byte_offset
);
6418 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6420 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6425 static struct type
*
6426 type_from_tag (struct value
*tag
)
6428 const char *type_name
= ada_tag_name (tag
);
6430 if (type_name
!= NULL
)
6431 return ada_find_any_type (ada_encode (type_name
));
6435 /* Given a value OBJ of a tagged type, return a value of this
6436 type at the base address of the object. The base address, as
6437 defined in Ada.Tags, it is the address of the primary tag of
6438 the object, and therefore where the field values of its full
6439 view can be fetched. */
6442 ada_tag_value_at_base_address (struct value
*obj
)
6444 volatile struct gdb_exception e
;
6446 LONGEST offset_to_top
= 0;
6447 struct type
*ptr_type
, *obj_type
;
6449 CORE_ADDR base_address
;
6451 obj_type
= value_type (obj
);
6453 /* It is the responsability of the caller to deref pointers. */
6455 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6456 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6459 tag
= ada_value_tag (obj
);
6463 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6465 if (is_ada95_tag (tag
))
6468 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6469 ptr_type
= lookup_pointer_type (ptr_type
);
6470 val
= value_cast (ptr_type
, tag
);
6474 /* It is perfectly possible that an exception be raised while
6475 trying to determine the base address, just like for the tag;
6476 see ada_tag_name for more details. We do not print the error
6477 message for the same reason. */
6479 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6481 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6487 /* If offset is null, nothing to do. */
6489 if (offset_to_top
== 0)
6492 /* -1 is a special case in Ada.Tags; however, what should be done
6493 is not quite clear from the documentation. So do nothing for
6496 if (offset_to_top
== -1)
6499 base_address
= value_address (obj
) - offset_to_top
;
6500 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6502 /* Make sure that we have a proper tag at the new address.
6503 Otherwise, offset_to_top is bogus (which can happen when
6504 the object is not initialized yet). */
6509 obj_type
= type_from_tag (tag
);
6514 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6517 /* Return the "ada__tags__type_specific_data" type. */
6519 static struct type
*
6520 ada_get_tsd_type (struct inferior
*inf
)
6522 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6524 if (data
->tsd_type
== 0)
6525 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6526 return data
->tsd_type
;
6529 /* Return the TSD (type-specific data) associated to the given TAG.
6530 TAG is assumed to be the tag of a tagged-type entity.
6532 May return NULL if we are unable to get the TSD. */
6534 static struct value
*
6535 ada_get_tsd_from_tag (struct value
*tag
)
6540 /* First option: The TSD is simply stored as a field of our TAG.
6541 Only older versions of GNAT would use this format, but we have
6542 to test it first, because there are no visible markers for
6543 the current approach except the absence of that field. */
6545 val
= ada_value_struct_elt (tag
, "tsd", 1);
6549 /* Try the second representation for the dispatch table (in which
6550 there is no explicit 'tsd' field in the referent of the tag pointer,
6551 and instead the tsd pointer is stored just before the dispatch
6554 type
= ada_get_tsd_type (current_inferior());
6557 type
= lookup_pointer_type (lookup_pointer_type (type
));
6558 val
= value_cast (type
, tag
);
6561 return value_ind (value_ptradd (val
, -1));
6564 /* Given the TSD of a tag (type-specific data), return a string
6565 containing the name of the associated type.
6567 The returned value is good until the next call. May return NULL
6568 if we are unable to determine the tag name. */
6571 ada_tag_name_from_tsd (struct value
*tsd
)
6573 static char name
[1024];
6577 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6580 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6581 for (p
= name
; *p
!= '\0'; p
+= 1)
6587 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6590 Return NULL if the TAG is not an Ada tag, or if we were unable to
6591 determine the name of that tag. The result is good until the next
6595 ada_tag_name (struct value
*tag
)
6597 volatile struct gdb_exception e
;
6600 if (!ada_is_tag_type (value_type (tag
)))
6603 /* It is perfectly possible that an exception be raised while trying
6604 to determine the TAG's name, even under normal circumstances:
6605 The associated variable may be uninitialized or corrupted, for
6606 instance. We do not let any exception propagate past this point.
6607 instead we return NULL.
6609 We also do not print the error message either (which often is very
6610 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6611 the caller print a more meaningful message if necessary. */
6612 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6614 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6617 name
= ada_tag_name_from_tsd (tsd
);
6623 /* The parent type of TYPE, or NULL if none. */
6626 ada_parent_type (struct type
*type
)
6630 type
= ada_check_typedef (type
);
6632 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6635 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6636 if (ada_is_parent_field (type
, i
))
6638 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6640 /* If the _parent field is a pointer, then dereference it. */
6641 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6642 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6643 /* If there is a parallel XVS type, get the actual base type. */
6644 parent_type
= ada_get_base_type (parent_type
);
6646 return ada_check_typedef (parent_type
);
6652 /* True iff field number FIELD_NUM of structure type TYPE contains the
6653 parent-type (inherited) fields of a derived type. Assumes TYPE is
6654 a structure type with at least FIELD_NUM+1 fields. */
6657 ada_is_parent_field (struct type
*type
, int field_num
)
6659 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6661 return (name
!= NULL
6662 && (strncmp (name
, "PARENT", 6) == 0
6663 || strncmp (name
, "_parent", 7) == 0));
6666 /* True iff field number FIELD_NUM of structure type TYPE is a
6667 transparent wrapper field (which should be silently traversed when doing
6668 field selection and flattened when printing). Assumes TYPE is a
6669 structure type with at least FIELD_NUM+1 fields. Such fields are always
6673 ada_is_wrapper_field (struct type
*type
, int field_num
)
6675 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6677 return (name
!= NULL
6678 && (strncmp (name
, "PARENT", 6) == 0
6679 || strcmp (name
, "REP") == 0
6680 || strncmp (name
, "_parent", 7) == 0
6681 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6684 /* True iff field number FIELD_NUM of structure or union type TYPE
6685 is a variant wrapper. Assumes TYPE is a structure type with at least
6686 FIELD_NUM+1 fields. */
6689 ada_is_variant_part (struct type
*type
, int field_num
)
6691 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6693 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6694 || (is_dynamic_field (type
, field_num
)
6695 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6696 == TYPE_CODE_UNION
)));
6699 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6700 whose discriminants are contained in the record type OUTER_TYPE,
6701 returns the type of the controlling discriminant for the variant.
6702 May return NULL if the type could not be found. */
6705 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6707 char *name
= ada_variant_discrim_name (var_type
);
6709 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6712 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6713 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6714 represents a 'when others' clause; otherwise 0. */
6717 ada_is_others_clause (struct type
*type
, int field_num
)
6719 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6721 return (name
!= NULL
&& name
[0] == 'O');
6724 /* Assuming that TYPE0 is the type of the variant part of a record,
6725 returns the name of the discriminant controlling the variant.
6726 The value is valid until the next call to ada_variant_discrim_name. */
6729 ada_variant_discrim_name (struct type
*type0
)
6731 static char *result
= NULL
;
6732 static size_t result_len
= 0;
6735 const char *discrim_end
;
6736 const char *discrim_start
;
6738 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6739 type
= TYPE_TARGET_TYPE (type0
);
6743 name
= ada_type_name (type
);
6745 if (name
== NULL
|| name
[0] == '\000')
6748 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6751 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6754 if (discrim_end
== name
)
6757 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6760 if (discrim_start
== name
+ 1)
6762 if ((discrim_start
> name
+ 3
6763 && strncmp (discrim_start
- 3, "___", 3) == 0)
6764 || discrim_start
[-1] == '.')
6768 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6769 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6770 result
[discrim_end
- discrim_start
] = '\0';
6774 /* Scan STR for a subtype-encoded number, beginning at position K.
6775 Put the position of the character just past the number scanned in
6776 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6777 Return 1 if there was a valid number at the given position, and 0
6778 otherwise. A "subtype-encoded" number consists of the absolute value
6779 in decimal, followed by the letter 'm' to indicate a negative number.
6780 Assumes 0m does not occur. */
6783 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6787 if (!isdigit (str
[k
]))
6790 /* Do it the hard way so as not to make any assumption about
6791 the relationship of unsigned long (%lu scan format code) and
6794 while (isdigit (str
[k
]))
6796 RU
= RU
* 10 + (str
[k
] - '0');
6803 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6809 /* NOTE on the above: Technically, C does not say what the results of
6810 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6811 number representable as a LONGEST (although either would probably work
6812 in most implementations). When RU>0, the locution in the then branch
6813 above is always equivalent to the negative of RU. */
6820 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6821 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6822 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6825 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6827 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6841 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6851 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6852 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6854 if (val
>= L
&& val
<= U
)
6866 /* FIXME: Lots of redundancy below. Try to consolidate. */
6868 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6869 ARG_TYPE, extract and return the value of one of its (non-static)
6870 fields. FIELDNO says which field. Differs from value_primitive_field
6871 only in that it can handle packed values of arbitrary type. */
6873 static struct value
*
6874 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6875 struct type
*arg_type
)
6879 arg_type
= ada_check_typedef (arg_type
);
6880 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6882 /* Handle packed fields. */
6884 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6886 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6887 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6889 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6890 offset
+ bit_pos
/ 8,
6891 bit_pos
% 8, bit_size
, type
);
6894 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6897 /* Find field with name NAME in object of type TYPE. If found,
6898 set the following for each argument that is non-null:
6899 - *FIELD_TYPE_P to the field's type;
6900 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6901 an object of that type;
6902 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6903 - *BIT_SIZE_P to its size in bits if the field is packed, and
6905 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6906 fields up to but not including the desired field, or by the total
6907 number of fields if not found. A NULL value of NAME never
6908 matches; the function just counts visible fields in this case.
6910 Returns 1 if found, 0 otherwise. */
6913 find_struct_field (const char *name
, struct type
*type
, int offset
,
6914 struct type
**field_type_p
,
6915 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6920 type
= ada_check_typedef (type
);
6922 if (field_type_p
!= NULL
)
6923 *field_type_p
= NULL
;
6924 if (byte_offset_p
!= NULL
)
6926 if (bit_offset_p
!= NULL
)
6928 if (bit_size_p
!= NULL
)
6931 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6933 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6934 int fld_offset
= offset
+ bit_pos
/ 8;
6935 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6937 if (t_field_name
== NULL
)
6940 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6942 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6944 if (field_type_p
!= NULL
)
6945 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6946 if (byte_offset_p
!= NULL
)
6947 *byte_offset_p
= fld_offset
;
6948 if (bit_offset_p
!= NULL
)
6949 *bit_offset_p
= bit_pos
% 8;
6950 if (bit_size_p
!= NULL
)
6951 *bit_size_p
= bit_size
;
6954 else if (ada_is_wrapper_field (type
, i
))
6956 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6957 field_type_p
, byte_offset_p
, bit_offset_p
,
6958 bit_size_p
, index_p
))
6961 else if (ada_is_variant_part (type
, i
))
6963 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6966 struct type
*field_type
6967 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6969 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6971 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6973 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6974 field_type_p
, byte_offset_p
,
6975 bit_offset_p
, bit_size_p
, index_p
))
6979 else if (index_p
!= NULL
)
6985 /* Number of user-visible fields in record type TYPE. */
6988 num_visible_fields (struct type
*type
)
6993 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6997 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6998 and search in it assuming it has (class) type TYPE.
6999 If found, return value, else return NULL.
7001 Searches recursively through wrapper fields (e.g., '_parent'). */
7003 static struct value
*
7004 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
7009 type
= ada_check_typedef (type
);
7010 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7012 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7014 if (t_field_name
== NULL
)
7017 else if (field_name_match (t_field_name
, name
))
7018 return ada_value_primitive_field (arg
, offset
, i
, type
);
7020 else if (ada_is_wrapper_field (type
, i
))
7022 struct value
*v
= /* Do not let indent join lines here. */
7023 ada_search_struct_field (name
, arg
,
7024 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7025 TYPE_FIELD_TYPE (type
, i
));
7031 else if (ada_is_variant_part (type
, i
))
7033 /* PNH: Do we ever get here? See find_struct_field. */
7035 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7037 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7039 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7041 struct value
*v
= ada_search_struct_field
/* Force line
7044 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7045 TYPE_FIELD_TYPE (field_type
, j
));
7055 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7056 int, struct type
*);
7059 /* Return field #INDEX in ARG, where the index is that returned by
7060 * find_struct_field through its INDEX_P argument. Adjust the address
7061 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7062 * If found, return value, else return NULL. */
7064 static struct value
*
7065 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7068 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7072 /* Auxiliary function for ada_index_struct_field. Like
7073 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7076 static struct value
*
7077 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7081 type
= ada_check_typedef (type
);
7083 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7085 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7087 else if (ada_is_wrapper_field (type
, i
))
7089 struct value
*v
= /* Do not let indent join lines here. */
7090 ada_index_struct_field_1 (index_p
, arg
,
7091 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7092 TYPE_FIELD_TYPE (type
, i
));
7098 else if (ada_is_variant_part (type
, i
))
7100 /* PNH: Do we ever get here? See ada_search_struct_field,
7101 find_struct_field. */
7102 error (_("Cannot assign this kind of variant record"));
7104 else if (*index_p
== 0)
7105 return ada_value_primitive_field (arg
, offset
, i
, type
);
7112 /* Given ARG, a value of type (pointer or reference to a)*
7113 structure/union, extract the component named NAME from the ultimate
7114 target structure/union and return it as a value with its
7117 The routine searches for NAME among all members of the structure itself
7118 and (recursively) among all members of any wrapper members
7121 If NO_ERR, then simply return NULL in case of error, rather than
7125 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7127 struct type
*t
, *t1
;
7131 t1
= t
= ada_check_typedef (value_type (arg
));
7132 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7134 t1
= TYPE_TARGET_TYPE (t
);
7137 t1
= ada_check_typedef (t1
);
7138 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7140 arg
= coerce_ref (arg
);
7145 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7147 t1
= TYPE_TARGET_TYPE (t
);
7150 t1
= ada_check_typedef (t1
);
7151 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7153 arg
= value_ind (arg
);
7160 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7164 v
= ada_search_struct_field (name
, arg
, 0, t
);
7167 int bit_offset
, bit_size
, byte_offset
;
7168 struct type
*field_type
;
7171 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7172 address
= value_address (ada_value_ind (arg
));
7174 address
= value_address (ada_coerce_ref (arg
));
7176 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7177 if (find_struct_field (name
, t1
, 0,
7178 &field_type
, &byte_offset
, &bit_offset
,
7183 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7184 arg
= ada_coerce_ref (arg
);
7186 arg
= ada_value_ind (arg
);
7187 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7188 bit_offset
, bit_size
,
7192 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7196 if (v
!= NULL
|| no_err
)
7199 error (_("There is no member named %s."), name
);
7205 error (_("Attempt to extract a component of "
7206 "a value that is not a record."));
7209 /* Given a type TYPE, look up the type of the component of type named NAME.
7210 If DISPP is non-null, add its byte displacement from the beginning of a
7211 structure (pointed to by a value) of type TYPE to *DISPP (does not
7212 work for packed fields).
7214 Matches any field whose name has NAME as a prefix, possibly
7217 TYPE can be either a struct or union. If REFOK, TYPE may also
7218 be a (pointer or reference)+ to a struct or union, and the
7219 ultimate target type will be searched.
7221 Looks recursively into variant clauses and parent types.
7223 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7224 TYPE is not a type of the right kind. */
7226 static struct type
*
7227 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7228 int noerr
, int *dispp
)
7235 if (refok
&& type
!= NULL
)
7238 type
= ada_check_typedef (type
);
7239 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7240 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7242 type
= TYPE_TARGET_TYPE (type
);
7246 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7247 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7253 target_terminal_ours ();
7254 gdb_flush (gdb_stdout
);
7256 error (_("Type (null) is not a structure or union type"));
7259 /* XXX: type_sprint */
7260 fprintf_unfiltered (gdb_stderr
, _("Type "));
7261 type_print (type
, "", gdb_stderr
, -1);
7262 error (_(" is not a structure or union type"));
7267 type
= to_static_fixed_type (type
);
7269 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7271 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7275 if (t_field_name
== NULL
)
7278 else if (field_name_match (t_field_name
, name
))
7281 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7282 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7285 else if (ada_is_wrapper_field (type
, i
))
7288 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7293 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7298 else if (ada_is_variant_part (type
, i
))
7301 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7304 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7306 /* FIXME pnh 2008/01/26: We check for a field that is
7307 NOT wrapped in a struct, since the compiler sometimes
7308 generates these for unchecked variant types. Revisit
7309 if the compiler changes this practice. */
7310 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7312 if (v_field_name
!= NULL
7313 && field_name_match (v_field_name
, name
))
7314 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7316 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7323 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7334 target_terminal_ours ();
7335 gdb_flush (gdb_stdout
);
7338 /* XXX: type_sprint */
7339 fprintf_unfiltered (gdb_stderr
, _("Type "));
7340 type_print (type
, "", gdb_stderr
, -1);
7341 error (_(" has no component named <null>"));
7345 /* XXX: type_sprint */
7346 fprintf_unfiltered (gdb_stderr
, _("Type "));
7347 type_print (type
, "", gdb_stderr
, -1);
7348 error (_(" has no component named %s"), name
);
7355 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7356 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7357 represents an unchecked union (that is, the variant part of a
7358 record that is named in an Unchecked_Union pragma). */
7361 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7363 char *discrim_name
= ada_variant_discrim_name (var_type
);
7365 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7370 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7371 within a value of type OUTER_TYPE that is stored in GDB at
7372 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7373 numbering from 0) is applicable. Returns -1 if none are. */
7376 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7377 const gdb_byte
*outer_valaddr
)
7381 char *discrim_name
= ada_variant_discrim_name (var_type
);
7382 struct value
*outer
;
7383 struct value
*discrim
;
7384 LONGEST discrim_val
;
7386 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
7387 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7388 if (discrim
== NULL
)
7390 discrim_val
= value_as_long (discrim
);
7393 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7395 if (ada_is_others_clause (var_type
, i
))
7397 else if (ada_in_variant (discrim_val
, var_type
, i
))
7401 return others_clause
;
7406 /* Dynamic-Sized Records */
7408 /* Strategy: The type ostensibly attached to a value with dynamic size
7409 (i.e., a size that is not statically recorded in the debugging
7410 data) does not accurately reflect the size or layout of the value.
7411 Our strategy is to convert these values to values with accurate,
7412 conventional types that are constructed on the fly. */
7414 /* There is a subtle and tricky problem here. In general, we cannot
7415 determine the size of dynamic records without its data. However,
7416 the 'struct value' data structure, which GDB uses to represent
7417 quantities in the inferior process (the target), requires the size
7418 of the type at the time of its allocation in order to reserve space
7419 for GDB's internal copy of the data. That's why the
7420 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7421 rather than struct value*s.
7423 However, GDB's internal history variables ($1, $2, etc.) are
7424 struct value*s containing internal copies of the data that are not, in
7425 general, the same as the data at their corresponding addresses in
7426 the target. Fortunately, the types we give to these values are all
7427 conventional, fixed-size types (as per the strategy described
7428 above), so that we don't usually have to perform the
7429 'to_fixed_xxx_type' conversions to look at their values.
7430 Unfortunately, there is one exception: if one of the internal
7431 history variables is an array whose elements are unconstrained
7432 records, then we will need to create distinct fixed types for each
7433 element selected. */
7435 /* The upshot of all of this is that many routines take a (type, host
7436 address, target address) triple as arguments to represent a value.
7437 The host address, if non-null, is supposed to contain an internal
7438 copy of the relevant data; otherwise, the program is to consult the
7439 target at the target address. */
7441 /* Assuming that VAL0 represents a pointer value, the result of
7442 dereferencing it. Differs from value_ind in its treatment of
7443 dynamic-sized types. */
7446 ada_value_ind (struct value
*val0
)
7448 struct value
*val
= value_ind (val0
);
7450 if (ada_is_tagged_type (value_type (val
), 0))
7451 val
= ada_tag_value_at_base_address (val
);
7453 return ada_to_fixed_value (val
);
7456 /* The value resulting from dereferencing any "reference to"
7457 qualifiers on VAL0. */
7459 static struct value
*
7460 ada_coerce_ref (struct value
*val0
)
7462 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7464 struct value
*val
= val0
;
7466 val
= coerce_ref (val
);
7468 if (ada_is_tagged_type (value_type (val
), 0))
7469 val
= ada_tag_value_at_base_address (val
);
7471 return ada_to_fixed_value (val
);
7477 /* Return OFF rounded upward if necessary to a multiple of
7478 ALIGNMENT (a power of 2). */
7481 align_value (unsigned int off
, unsigned int alignment
)
7483 return (off
+ alignment
- 1) & ~(alignment
- 1);
7486 /* Return the bit alignment required for field #F of template type TYPE. */
7489 field_alignment (struct type
*type
, int f
)
7491 const char *name
= TYPE_FIELD_NAME (type
, f
);
7495 /* The field name should never be null, unless the debugging information
7496 is somehow malformed. In this case, we assume the field does not
7497 require any alignment. */
7501 len
= strlen (name
);
7503 if (!isdigit (name
[len
- 1]))
7506 if (isdigit (name
[len
- 2]))
7507 align_offset
= len
- 2;
7509 align_offset
= len
- 1;
7511 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7512 return TARGET_CHAR_BIT
;
7514 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7517 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7519 static struct symbol
*
7520 ada_find_any_type_symbol (const char *name
)
7524 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7526 && (SYMBOL_DOMAIN (sym
) != VAR_DOMAIN
7527 || SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
7533 /* Find a type named NAME. Ignores ambiguity. This routine will look
7534 solely for types defined by debug info, it will not search the GDB
7537 static struct type
*
7538 ada_find_any_type (const char *name
)
7540 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7543 return SYMBOL_TYPE (sym
);
7548 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7549 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7550 symbol, in which case it is returned. Otherwise, this looks for
7551 symbols whose name is that of NAME_SYM suffixed with "___XR".
7552 Return symbol if found, and NULL otherwise. */
7555 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7557 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7560 if (strstr (name
, "___XR") != NULL
)
7563 sym
= find_old_style_renaming_symbol (name
, block
);
7568 /* Not right yet. FIXME pnh 7/20/2007. */
7569 sym
= ada_find_any_type_symbol (name
);
7570 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7576 static struct symbol
*
7577 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7579 const struct symbol
*function_sym
= block_linkage_function (block
);
7582 if (function_sym
!= NULL
)
7584 /* If the symbol is defined inside a function, NAME is not fully
7585 qualified. This means we need to prepend the function name
7586 as well as adding the ``___XR'' suffix to build the name of
7587 the associated renaming symbol. */
7588 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7589 /* Function names sometimes contain suffixes used
7590 for instance to qualify nested subprograms. When building
7591 the XR type name, we need to make sure that this suffix is
7592 not included. So do not include any suffix in the function
7593 name length below. */
7594 int function_name_len
= ada_name_prefix_len (function_name
);
7595 const int rename_len
= function_name_len
+ 2 /* "__" */
7596 + strlen (name
) + 6 /* "___XR\0" */ ;
7598 /* Strip the suffix if necessary. */
7599 ada_remove_trailing_digits (function_name
, &function_name_len
);
7600 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7601 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7603 /* Library-level functions are a special case, as GNAT adds
7604 a ``_ada_'' prefix to the function name to avoid namespace
7605 pollution. However, the renaming symbols themselves do not
7606 have this prefix, so we need to skip this prefix if present. */
7607 if (function_name_len
> 5 /* "_ada_" */
7608 && strstr (function_name
, "_ada_") == function_name
)
7611 function_name_len
-= 5;
7614 rename
= (char *) alloca (rename_len
* sizeof (char));
7615 strncpy (rename
, function_name
, function_name_len
);
7616 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7621 const int rename_len
= strlen (name
) + 6;
7623 rename
= (char *) alloca (rename_len
* sizeof (char));
7624 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7627 return ada_find_any_type_symbol (rename
);
7630 /* Because of GNAT encoding conventions, several GDB symbols may match a
7631 given type name. If the type denoted by TYPE0 is to be preferred to
7632 that of TYPE1 for purposes of type printing, return non-zero;
7633 otherwise return 0. */
7636 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7640 else if (type0
== NULL
)
7642 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7644 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7646 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7648 else if (ada_is_constrained_packed_array_type (type0
))
7650 else if (ada_is_array_descriptor_type (type0
)
7651 && !ada_is_array_descriptor_type (type1
))
7655 const char *type0_name
= type_name_no_tag (type0
);
7656 const char *type1_name
= type_name_no_tag (type1
);
7658 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7659 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7665 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7666 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7669 ada_type_name (struct type
*type
)
7673 else if (TYPE_NAME (type
) != NULL
)
7674 return TYPE_NAME (type
);
7676 return TYPE_TAG_NAME (type
);
7679 /* Search the list of "descriptive" types associated to TYPE for a type
7680 whose name is NAME. */
7682 static struct type
*
7683 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7685 struct type
*result
;
7687 if (ada_ignore_descriptive_types_p
)
7690 /* If there no descriptive-type info, then there is no parallel type
7692 if (!HAVE_GNAT_AUX_INFO (type
))
7695 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7696 while (result
!= NULL
)
7698 const char *result_name
= ada_type_name (result
);
7700 if (result_name
== NULL
)
7702 warning (_("unexpected null name on descriptive type"));
7706 /* If the names match, stop. */
7707 if (strcmp (result_name
, name
) == 0)
7710 /* Otherwise, look at the next item on the list, if any. */
7711 if (HAVE_GNAT_AUX_INFO (result
))
7712 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7717 /* If we didn't find a match, see whether this is a packed array. With
7718 older compilers, the descriptive type information is either absent or
7719 irrelevant when it comes to packed arrays so the above lookup fails.
7720 Fall back to using a parallel lookup by name in this case. */
7721 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7722 return ada_find_any_type (name
);
7727 /* Find a parallel type to TYPE with the specified NAME, using the
7728 descriptive type taken from the debugging information, if available,
7729 and otherwise using the (slower) name-based method. */
7731 static struct type
*
7732 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7734 struct type
*result
= NULL
;
7736 if (HAVE_GNAT_AUX_INFO (type
))
7737 result
= find_parallel_type_by_descriptive_type (type
, name
);
7739 result
= ada_find_any_type (name
);
7744 /* Same as above, but specify the name of the parallel type by appending
7745 SUFFIX to the name of TYPE. */
7748 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7751 const char *typename
= ada_type_name (type
);
7754 if (typename
== NULL
)
7757 len
= strlen (typename
);
7759 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7761 strcpy (name
, typename
);
7762 strcpy (name
+ len
, suffix
);
7764 return ada_find_parallel_type_with_name (type
, name
);
7767 /* If TYPE is a variable-size record type, return the corresponding template
7768 type describing its fields. Otherwise, return NULL. */
7770 static struct type
*
7771 dynamic_template_type (struct type
*type
)
7773 type
= ada_check_typedef (type
);
7775 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7776 || ada_type_name (type
) == NULL
)
7780 int len
= strlen (ada_type_name (type
));
7782 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7785 return ada_find_parallel_type (type
, "___XVE");
7789 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7790 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7793 is_dynamic_field (struct type
*templ_type
, int field_num
)
7795 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7798 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7799 && strstr (name
, "___XVL") != NULL
;
7802 /* The index of the variant field of TYPE, or -1 if TYPE does not
7803 represent a variant record type. */
7806 variant_field_index (struct type
*type
)
7810 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7813 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7815 if (ada_is_variant_part (type
, f
))
7821 /* A record type with no fields. */
7823 static struct type
*
7824 empty_record (struct type
*template)
7826 struct type
*type
= alloc_type_copy (template);
7828 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7829 TYPE_NFIELDS (type
) = 0;
7830 TYPE_FIELDS (type
) = NULL
;
7831 INIT_CPLUS_SPECIFIC (type
);
7832 TYPE_NAME (type
) = "<empty>";
7833 TYPE_TAG_NAME (type
) = NULL
;
7834 TYPE_LENGTH (type
) = 0;
7838 /* An ordinary record type (with fixed-length fields) that describes
7839 the value of type TYPE at VALADDR or ADDRESS (see comments at
7840 the beginning of this section) VAL according to GNAT conventions.
7841 DVAL0 should describe the (portion of a) record that contains any
7842 necessary discriminants. It should be NULL if value_type (VAL) is
7843 an outer-level type (i.e., as opposed to a branch of a variant.) A
7844 variant field (unless unchecked) is replaced by a particular branch
7847 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7848 length are not statically known are discarded. As a consequence,
7849 VALADDR, ADDRESS and DVAL0 are ignored.
7851 NOTE: Limitations: For now, we assume that dynamic fields and
7852 variants occupy whole numbers of bytes. However, they need not be
7856 ada_template_to_fixed_record_type_1 (struct type
*type
,
7857 const gdb_byte
*valaddr
,
7858 CORE_ADDR address
, struct value
*dval0
,
7859 int keep_dynamic_fields
)
7861 struct value
*mark
= value_mark ();
7864 int nfields
, bit_len
;
7870 /* Compute the number of fields in this record type that are going
7871 to be processed: unless keep_dynamic_fields, this includes only
7872 fields whose position and length are static will be processed. */
7873 if (keep_dynamic_fields
)
7874 nfields
= TYPE_NFIELDS (type
);
7878 while (nfields
< TYPE_NFIELDS (type
)
7879 && !ada_is_variant_part (type
, nfields
)
7880 && !is_dynamic_field (type
, nfields
))
7884 rtype
= alloc_type_copy (type
);
7885 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7886 INIT_CPLUS_SPECIFIC (rtype
);
7887 TYPE_NFIELDS (rtype
) = nfields
;
7888 TYPE_FIELDS (rtype
) = (struct field
*)
7889 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7890 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7891 TYPE_NAME (rtype
) = ada_type_name (type
);
7892 TYPE_TAG_NAME (rtype
) = NULL
;
7893 TYPE_FIXED_INSTANCE (rtype
) = 1;
7899 for (f
= 0; f
< nfields
; f
+= 1)
7901 off
= align_value (off
, field_alignment (type
, f
))
7902 + TYPE_FIELD_BITPOS (type
, f
);
7903 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7904 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7906 if (ada_is_variant_part (type
, f
))
7911 else if (is_dynamic_field (type
, f
))
7913 const gdb_byte
*field_valaddr
= valaddr
;
7914 CORE_ADDR field_address
= address
;
7915 struct type
*field_type
=
7916 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7920 /* rtype's length is computed based on the run-time
7921 value of discriminants. If the discriminants are not
7922 initialized, the type size may be completely bogus and
7923 GDB may fail to allocate a value for it. So check the
7924 size first before creating the value. */
7926 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7927 rtype
= value_type (dval
);
7932 /* If the type referenced by this field is an aligner type, we need
7933 to unwrap that aligner type, because its size might not be set.
7934 Keeping the aligner type would cause us to compute the wrong
7935 size for this field, impacting the offset of the all the fields
7936 that follow this one. */
7937 if (ada_is_aligner_type (field_type
))
7939 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7941 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7942 field_address
= cond_offset_target (field_address
, field_offset
);
7943 field_type
= ada_aligned_type (field_type
);
7946 field_valaddr
= cond_offset_host (field_valaddr
,
7947 off
/ TARGET_CHAR_BIT
);
7948 field_address
= cond_offset_target (field_address
,
7949 off
/ TARGET_CHAR_BIT
);
7951 /* Get the fixed type of the field. Note that, in this case,
7952 we do not want to get the real type out of the tag: if
7953 the current field is the parent part of a tagged record,
7954 we will get the tag of the object. Clearly wrong: the real
7955 type of the parent is not the real type of the child. We
7956 would end up in an infinite loop. */
7957 field_type
= ada_get_base_type (field_type
);
7958 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7959 field_address
, dval
, 0);
7960 /* If the field size is already larger than the maximum
7961 object size, then the record itself will necessarily
7962 be larger than the maximum object size. We need to make
7963 this check now, because the size might be so ridiculously
7964 large (due to an uninitialized variable in the inferior)
7965 that it would cause an overflow when adding it to the
7967 check_size (field_type
);
7969 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7970 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7971 /* The multiplication can potentially overflow. But because
7972 the field length has been size-checked just above, and
7973 assuming that the maximum size is a reasonable value,
7974 an overflow should not happen in practice. So rather than
7975 adding overflow recovery code to this already complex code,
7976 we just assume that it's not going to happen. */
7978 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7982 /* Note: If this field's type is a typedef, it is important
7983 to preserve the typedef layer.
7985 Otherwise, we might be transforming a typedef to a fat
7986 pointer (encoding a pointer to an unconstrained array),
7987 into a basic fat pointer (encoding an unconstrained
7988 array). As both types are implemented using the same
7989 structure, the typedef is the only clue which allows us
7990 to distinguish between the two options. Stripping it
7991 would prevent us from printing this field appropriately. */
7992 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7993 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7994 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7996 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7999 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8001 /* We need to be careful of typedefs when computing
8002 the length of our field. If this is a typedef,
8003 get the length of the target type, not the length
8005 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
8006 field_type
= ada_typedef_target_type (field_type
);
8009 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8012 if (off
+ fld_bit_len
> bit_len
)
8013 bit_len
= off
+ fld_bit_len
;
8015 TYPE_LENGTH (rtype
) =
8016 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8019 /* We handle the variant part, if any, at the end because of certain
8020 odd cases in which it is re-ordered so as NOT to be the last field of
8021 the record. This can happen in the presence of representation
8023 if (variant_field
>= 0)
8025 struct type
*branch_type
;
8027 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8031 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
8032 rtype
= value_type (dval
);
8038 to_fixed_variant_branch_type
8039 (TYPE_FIELD_TYPE (type
, variant_field
),
8040 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8041 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8042 if (branch_type
== NULL
)
8044 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8045 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8046 TYPE_NFIELDS (rtype
) -= 1;
8050 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8051 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8053 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8055 if (off
+ fld_bit_len
> bit_len
)
8056 bit_len
= off
+ fld_bit_len
;
8057 TYPE_LENGTH (rtype
) =
8058 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8062 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8063 should contain the alignment of that record, which should be a strictly
8064 positive value. If null or negative, then something is wrong, most
8065 probably in the debug info. In that case, we don't round up the size
8066 of the resulting type. If this record is not part of another structure,
8067 the current RTYPE length might be good enough for our purposes. */
8068 if (TYPE_LENGTH (type
) <= 0)
8070 if (TYPE_NAME (rtype
))
8071 warning (_("Invalid type size for `%s' detected: %d."),
8072 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8074 warning (_("Invalid type size for <unnamed> detected: %d."),
8075 TYPE_LENGTH (type
));
8079 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8080 TYPE_LENGTH (type
));
8083 value_free_to_mark (mark
);
8084 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8085 error (_("record type with dynamic size is larger than varsize-limit"));
8089 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8092 static struct type
*
8093 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8094 CORE_ADDR address
, struct value
*dval0
)
8096 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8100 /* An ordinary record type in which ___XVL-convention fields and
8101 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8102 static approximations, containing all possible fields. Uses
8103 no runtime values. Useless for use in values, but that's OK,
8104 since the results are used only for type determinations. Works on both
8105 structs and unions. Representation note: to save space, we memorize
8106 the result of this function in the TYPE_TARGET_TYPE of the
8109 static struct type
*
8110 template_to_static_fixed_type (struct type
*type0
)
8116 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8117 return TYPE_TARGET_TYPE (type0
);
8119 nfields
= TYPE_NFIELDS (type0
);
8122 for (f
= 0; f
< nfields
; f
+= 1)
8124 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8125 struct type
*new_type
;
8127 if (is_dynamic_field (type0
, f
))
8128 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8130 new_type
= static_unwrap_type (field_type
);
8131 if (type
== type0
&& new_type
!= field_type
)
8133 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8134 TYPE_CODE (type
) = TYPE_CODE (type0
);
8135 INIT_CPLUS_SPECIFIC (type
);
8136 TYPE_NFIELDS (type
) = nfields
;
8137 TYPE_FIELDS (type
) = (struct field
*)
8138 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8139 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8140 sizeof (struct field
) * nfields
);
8141 TYPE_NAME (type
) = ada_type_name (type0
);
8142 TYPE_TAG_NAME (type
) = NULL
;
8143 TYPE_FIXED_INSTANCE (type
) = 1;
8144 TYPE_LENGTH (type
) = 0;
8146 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8147 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8152 /* Given an object of type TYPE whose contents are at VALADDR and
8153 whose address in memory is ADDRESS, returns a revision of TYPE,
8154 which should be a non-dynamic-sized record, in which the variant
8155 part, if any, is replaced with the appropriate branch. Looks
8156 for discriminant values in DVAL0, which can be NULL if the record
8157 contains the necessary discriminant values. */
8159 static struct type
*
8160 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8161 CORE_ADDR address
, struct value
*dval0
)
8163 struct value
*mark
= value_mark ();
8166 struct type
*branch_type
;
8167 int nfields
= TYPE_NFIELDS (type
);
8168 int variant_field
= variant_field_index (type
);
8170 if (variant_field
== -1)
8175 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8176 type
= value_type (dval
);
8181 rtype
= alloc_type_copy (type
);
8182 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8183 INIT_CPLUS_SPECIFIC (rtype
);
8184 TYPE_NFIELDS (rtype
) = nfields
;
8185 TYPE_FIELDS (rtype
) =
8186 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8187 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8188 sizeof (struct field
) * nfields
);
8189 TYPE_NAME (rtype
) = ada_type_name (type
);
8190 TYPE_TAG_NAME (rtype
) = NULL
;
8191 TYPE_FIXED_INSTANCE (rtype
) = 1;
8192 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8194 branch_type
= to_fixed_variant_branch_type
8195 (TYPE_FIELD_TYPE (type
, variant_field
),
8196 cond_offset_host (valaddr
,
8197 TYPE_FIELD_BITPOS (type
, variant_field
)
8199 cond_offset_target (address
,
8200 TYPE_FIELD_BITPOS (type
, variant_field
)
8201 / TARGET_CHAR_BIT
), dval
);
8202 if (branch_type
== NULL
)
8206 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8207 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8208 TYPE_NFIELDS (rtype
) -= 1;
8212 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8213 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8214 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8215 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8217 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8219 value_free_to_mark (mark
);
8223 /* An ordinary record type (with fixed-length fields) that describes
8224 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8225 beginning of this section]. Any necessary discriminants' values
8226 should be in DVAL, a record value; it may be NULL if the object
8227 at ADDR itself contains any necessary discriminant values.
8228 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8229 values from the record are needed. Except in the case that DVAL,
8230 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8231 unchecked) is replaced by a particular branch of the variant.
8233 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8234 is questionable and may be removed. It can arise during the
8235 processing of an unconstrained-array-of-record type where all the
8236 variant branches have exactly the same size. This is because in
8237 such cases, the compiler does not bother to use the XVS convention
8238 when encoding the record. I am currently dubious of this
8239 shortcut and suspect the compiler should be altered. FIXME. */
8241 static struct type
*
8242 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8243 CORE_ADDR address
, struct value
*dval
)
8245 struct type
*templ_type
;
8247 if (TYPE_FIXED_INSTANCE (type0
))
8250 templ_type
= dynamic_template_type (type0
);
8252 if (templ_type
!= NULL
)
8253 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8254 else if (variant_field_index (type0
) >= 0)
8256 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8258 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8263 TYPE_FIXED_INSTANCE (type0
) = 1;
8269 /* An ordinary record type (with fixed-length fields) that describes
8270 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8271 union type. Any necessary discriminants' values should be in DVAL,
8272 a record value. That is, this routine selects the appropriate
8273 branch of the union at ADDR according to the discriminant value
8274 indicated in the union's type name. Returns VAR_TYPE0 itself if
8275 it represents a variant subject to a pragma Unchecked_Union. */
8277 static struct type
*
8278 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8279 CORE_ADDR address
, struct value
*dval
)
8282 struct type
*templ_type
;
8283 struct type
*var_type
;
8285 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8286 var_type
= TYPE_TARGET_TYPE (var_type0
);
8288 var_type
= var_type0
;
8290 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8292 if (templ_type
!= NULL
)
8293 var_type
= templ_type
;
8295 if (is_unchecked_variant (var_type
, value_type (dval
)))
8298 ada_which_variant_applies (var_type
,
8299 value_type (dval
), value_contents (dval
));
8302 return empty_record (var_type
);
8303 else if (is_dynamic_field (var_type
, which
))
8304 return to_fixed_record_type
8305 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8306 valaddr
, address
, dval
);
8307 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8309 to_fixed_record_type
8310 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8312 return TYPE_FIELD_TYPE (var_type
, which
);
8315 /* Assuming that TYPE0 is an array type describing the type of a value
8316 at ADDR, and that DVAL describes a record containing any
8317 discriminants used in TYPE0, returns a type for the value that
8318 contains no dynamic components (that is, no components whose sizes
8319 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8320 true, gives an error message if the resulting type's size is over
8323 static struct type
*
8324 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8327 struct type
*index_type_desc
;
8328 struct type
*result
;
8329 int constrained_packed_array_p
;
8331 type0
= ada_check_typedef (type0
);
8332 if (TYPE_FIXED_INSTANCE (type0
))
8335 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8336 if (constrained_packed_array_p
)
8337 type0
= decode_constrained_packed_array_type (type0
);
8339 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8340 ada_fixup_array_indexes_type (index_type_desc
);
8341 if (index_type_desc
== NULL
)
8343 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8345 /* NOTE: elt_type---the fixed version of elt_type0---should never
8346 depend on the contents of the array in properly constructed
8348 /* Create a fixed version of the array element type.
8349 We're not providing the address of an element here,
8350 and thus the actual object value cannot be inspected to do
8351 the conversion. This should not be a problem, since arrays of
8352 unconstrained objects are not allowed. In particular, all
8353 the elements of an array of a tagged type should all be of
8354 the same type specified in the debugging info. No need to
8355 consult the object tag. */
8356 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8358 /* Make sure we always create a new array type when dealing with
8359 packed array types, since we're going to fix-up the array
8360 type length and element bitsize a little further down. */
8361 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8364 result
= create_array_type (alloc_type_copy (type0
),
8365 elt_type
, TYPE_INDEX_TYPE (type0
));
8370 struct type
*elt_type0
;
8373 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8374 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8376 /* NOTE: result---the fixed version of elt_type0---should never
8377 depend on the contents of the array in properly constructed
8379 /* Create a fixed version of the array element type.
8380 We're not providing the address of an element here,
8381 and thus the actual object value cannot be inspected to do
8382 the conversion. This should not be a problem, since arrays of
8383 unconstrained objects are not allowed. In particular, all
8384 the elements of an array of a tagged type should all be of
8385 the same type specified in the debugging info. No need to
8386 consult the object tag. */
8388 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8391 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8393 struct type
*range_type
=
8394 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8396 result
= create_array_type (alloc_type_copy (elt_type0
),
8397 result
, range_type
);
8398 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8400 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8401 error (_("array type with dynamic size is larger than varsize-limit"));
8404 /* We want to preserve the type name. This can be useful when
8405 trying to get the type name of a value that has already been
8406 printed (for instance, if the user did "print VAR; whatis $". */
8407 TYPE_NAME (result
) = TYPE_NAME (type0
);
8409 if (constrained_packed_array_p
)
8411 /* So far, the resulting type has been created as if the original
8412 type was a regular (non-packed) array type. As a result, the
8413 bitsize of the array elements needs to be set again, and the array
8414 length needs to be recomputed based on that bitsize. */
8415 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8416 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8418 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8419 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8420 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8421 TYPE_LENGTH (result
)++;
8424 TYPE_FIXED_INSTANCE (result
) = 1;
8429 /* A standard type (containing no dynamically sized components)
8430 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8431 DVAL describes a record containing any discriminants used in TYPE0,
8432 and may be NULL if there are none, or if the object of type TYPE at
8433 ADDRESS or in VALADDR contains these discriminants.
8435 If CHECK_TAG is not null, in the case of tagged types, this function
8436 attempts to locate the object's tag and use it to compute the actual
8437 type. However, when ADDRESS is null, we cannot use it to determine the
8438 location of the tag, and therefore compute the tagged type's actual type.
8439 So we return the tagged type without consulting the tag. */
8441 static struct type
*
8442 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8443 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8445 type
= ada_check_typedef (type
);
8446 switch (TYPE_CODE (type
))
8450 case TYPE_CODE_STRUCT
:
8452 struct type
*static_type
= to_static_fixed_type (type
);
8453 struct type
*fixed_record_type
=
8454 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8456 /* If STATIC_TYPE is a tagged type and we know the object's address,
8457 then we can determine its tag, and compute the object's actual
8458 type from there. Note that we have to use the fixed record
8459 type (the parent part of the record may have dynamic fields
8460 and the way the location of _tag is expressed may depend on
8463 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8466 value_tag_from_contents_and_address
8470 struct type
*real_type
= type_from_tag (tag
);
8472 value_from_contents_and_address (fixed_record_type
,
8475 fixed_record_type
= value_type (obj
);
8476 if (real_type
!= NULL
)
8477 return to_fixed_record_type
8479 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8482 /* Check to see if there is a parallel ___XVZ variable.
8483 If there is, then it provides the actual size of our type. */
8484 else if (ada_type_name (fixed_record_type
) != NULL
)
8486 const char *name
= ada_type_name (fixed_record_type
);
8487 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8491 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8492 size
= get_int_var_value (xvz_name
, &xvz_found
);
8493 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8495 fixed_record_type
= copy_type (fixed_record_type
);
8496 TYPE_LENGTH (fixed_record_type
) = size
;
8498 /* The FIXED_RECORD_TYPE may have be a stub. We have
8499 observed this when the debugging info is STABS, and
8500 apparently it is something that is hard to fix.
8502 In practice, we don't need the actual type definition
8503 at all, because the presence of the XVZ variable allows us
8504 to assume that there must be a XVS type as well, which we
8505 should be able to use later, when we need the actual type
8508 In the meantime, pretend that the "fixed" type we are
8509 returning is NOT a stub, because this can cause trouble
8510 when using this type to create new types targeting it.
8511 Indeed, the associated creation routines often check
8512 whether the target type is a stub and will try to replace
8513 it, thus using a type with the wrong size. This, in turn,
8514 might cause the new type to have the wrong size too.
8515 Consider the case of an array, for instance, where the size
8516 of the array is computed from the number of elements in
8517 our array multiplied by the size of its element. */
8518 TYPE_STUB (fixed_record_type
) = 0;
8521 return fixed_record_type
;
8523 case TYPE_CODE_ARRAY
:
8524 return to_fixed_array_type (type
, dval
, 1);
8525 case TYPE_CODE_UNION
:
8529 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8533 /* The same as ada_to_fixed_type_1, except that it preserves the type
8534 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8536 The typedef layer needs be preserved in order to differentiate between
8537 arrays and array pointers when both types are implemented using the same
8538 fat pointer. In the array pointer case, the pointer is encoded as
8539 a typedef of the pointer type. For instance, considering:
8541 type String_Access is access String;
8542 S1 : String_Access := null;
8544 To the debugger, S1 is defined as a typedef of type String. But
8545 to the user, it is a pointer. So if the user tries to print S1,
8546 we should not dereference the array, but print the array address
8549 If we didn't preserve the typedef layer, we would lose the fact that
8550 the type is to be presented as a pointer (needs de-reference before
8551 being printed). And we would also use the source-level type name. */
8554 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8555 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8558 struct type
*fixed_type
=
8559 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8561 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8562 then preserve the typedef layer.
8564 Implementation note: We can only check the main-type portion of
8565 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8566 from TYPE now returns a type that has the same instance flags
8567 as TYPE. For instance, if TYPE is a "typedef const", and its
8568 target type is a "struct", then the typedef elimination will return
8569 a "const" version of the target type. See check_typedef for more
8570 details about how the typedef layer elimination is done.
8572 brobecker/2010-11-19: It seems to me that the only case where it is
8573 useful to preserve the typedef layer is when dealing with fat pointers.
8574 Perhaps, we could add a check for that and preserve the typedef layer
8575 only in that situation. But this seems unecessary so far, probably
8576 because we call check_typedef/ada_check_typedef pretty much everywhere.
8578 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8579 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8580 == TYPE_MAIN_TYPE (fixed_type
)))
8586 /* A standard (static-sized) type corresponding as well as possible to
8587 TYPE0, but based on no runtime data. */
8589 static struct type
*
8590 to_static_fixed_type (struct type
*type0
)
8597 if (TYPE_FIXED_INSTANCE (type0
))
8600 type0
= ada_check_typedef (type0
);
8602 switch (TYPE_CODE (type0
))
8606 case TYPE_CODE_STRUCT
:
8607 type
= dynamic_template_type (type0
);
8609 return template_to_static_fixed_type (type
);
8611 return template_to_static_fixed_type (type0
);
8612 case TYPE_CODE_UNION
:
8613 type
= ada_find_parallel_type (type0
, "___XVU");
8615 return template_to_static_fixed_type (type
);
8617 return template_to_static_fixed_type (type0
);
8621 /* A static approximation of TYPE with all type wrappers removed. */
8623 static struct type
*
8624 static_unwrap_type (struct type
*type
)
8626 if (ada_is_aligner_type (type
))
8628 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8629 if (ada_type_name (type1
) == NULL
)
8630 TYPE_NAME (type1
) = ada_type_name (type
);
8632 return static_unwrap_type (type1
);
8636 struct type
*raw_real_type
= ada_get_base_type (type
);
8638 if (raw_real_type
== type
)
8641 return to_static_fixed_type (raw_real_type
);
8645 /* In some cases, incomplete and private types require
8646 cross-references that are not resolved as records (for example,
8648 type FooP is access Foo;
8650 type Foo is array ...;
8651 ). In these cases, since there is no mechanism for producing
8652 cross-references to such types, we instead substitute for FooP a
8653 stub enumeration type that is nowhere resolved, and whose tag is
8654 the name of the actual type. Call these types "non-record stubs". */
8656 /* A type equivalent to TYPE that is not a non-record stub, if one
8657 exists, otherwise TYPE. */
8660 ada_check_typedef (struct type
*type
)
8665 /* If our type is a typedef type of a fat pointer, then we're done.
8666 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8667 what allows us to distinguish between fat pointers that represent
8668 array types, and fat pointers that represent array access types
8669 (in both cases, the compiler implements them as fat pointers). */
8670 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8671 && is_thick_pntr (ada_typedef_target_type (type
)))
8674 CHECK_TYPEDEF (type
);
8675 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8676 || !TYPE_STUB (type
)
8677 || TYPE_TAG_NAME (type
) == NULL
)
8681 const char *name
= TYPE_TAG_NAME (type
);
8682 struct type
*type1
= ada_find_any_type (name
);
8687 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8688 stubs pointing to arrays, as we don't create symbols for array
8689 types, only for the typedef-to-array types). If that's the case,
8690 strip the typedef layer. */
8691 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8692 type1
= ada_check_typedef (type1
);
8698 /* A value representing the data at VALADDR/ADDRESS as described by
8699 type TYPE0, but with a standard (static-sized) type that correctly
8700 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8701 type, then return VAL0 [this feature is simply to avoid redundant
8702 creation of struct values]. */
8704 static struct value
*
8705 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8708 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8710 if (type
== type0
&& val0
!= NULL
)
8713 return value_from_contents_and_address (type
, 0, address
);
8716 /* A value representing VAL, but with a standard (static-sized) type
8717 that correctly describes it. Does not necessarily create a new
8721 ada_to_fixed_value (struct value
*val
)
8723 val
= unwrap_value (val
);
8724 val
= ada_to_fixed_value_create (value_type (val
),
8725 value_address (val
),
8733 /* Table mapping attribute numbers to names.
8734 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8736 static const char *attribute_names
[] = {
8754 ada_attribute_name (enum exp_opcode n
)
8756 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8757 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8759 return attribute_names
[0];
8762 /* Evaluate the 'POS attribute applied to ARG. */
8765 pos_atr (struct value
*arg
)
8767 struct value
*val
= coerce_ref (arg
);
8768 struct type
*type
= value_type (val
);
8770 if (!discrete_type_p (type
))
8771 error (_("'POS only defined on discrete types"));
8773 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8776 LONGEST v
= value_as_long (val
);
8778 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8780 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8783 error (_("enumeration value is invalid: can't find 'POS"));
8786 return value_as_long (val
);
8789 static struct value
*
8790 value_pos_atr (struct type
*type
, struct value
*arg
)
8792 return value_from_longest (type
, pos_atr (arg
));
8795 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8797 static struct value
*
8798 value_val_atr (struct type
*type
, struct value
*arg
)
8800 if (!discrete_type_p (type
))
8801 error (_("'VAL only defined on discrete types"));
8802 if (!integer_type_p (value_type (arg
)))
8803 error (_("'VAL requires integral argument"));
8805 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8807 long pos
= value_as_long (arg
);
8809 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8810 error (_("argument to 'VAL out of range"));
8811 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8814 return value_from_longest (type
, value_as_long (arg
));
8820 /* True if TYPE appears to be an Ada character type.
8821 [At the moment, this is true only for Character and Wide_Character;
8822 It is a heuristic test that could stand improvement]. */
8825 ada_is_character_type (struct type
*type
)
8829 /* If the type code says it's a character, then assume it really is,
8830 and don't check any further. */
8831 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8834 /* Otherwise, assume it's a character type iff it is a discrete type
8835 with a known character type name. */
8836 name
= ada_type_name (type
);
8837 return (name
!= NULL
8838 && (TYPE_CODE (type
) == TYPE_CODE_INT
8839 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8840 && (strcmp (name
, "character") == 0
8841 || strcmp (name
, "wide_character") == 0
8842 || strcmp (name
, "wide_wide_character") == 0
8843 || strcmp (name
, "unsigned char") == 0));
8846 /* True if TYPE appears to be an Ada string type. */
8849 ada_is_string_type (struct type
*type
)
8851 type
= ada_check_typedef (type
);
8853 && TYPE_CODE (type
) != TYPE_CODE_PTR
8854 && (ada_is_simple_array_type (type
)
8855 || ada_is_array_descriptor_type (type
))
8856 && ada_array_arity (type
) == 1)
8858 struct type
*elttype
= ada_array_element_type (type
, 1);
8860 return ada_is_character_type (elttype
);
8866 /* The compiler sometimes provides a parallel XVS type for a given
8867 PAD type. Normally, it is safe to follow the PAD type directly,
8868 but older versions of the compiler have a bug that causes the offset
8869 of its "F" field to be wrong. Following that field in that case
8870 would lead to incorrect results, but this can be worked around
8871 by ignoring the PAD type and using the associated XVS type instead.
8873 Set to True if the debugger should trust the contents of PAD types.
8874 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8875 static int trust_pad_over_xvs
= 1;
8877 /* True if TYPE is a struct type introduced by the compiler to force the
8878 alignment of a value. Such types have a single field with a
8879 distinctive name. */
8882 ada_is_aligner_type (struct type
*type
)
8884 type
= ada_check_typedef (type
);
8886 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8889 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8890 && TYPE_NFIELDS (type
) == 1
8891 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8894 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8895 the parallel type. */
8898 ada_get_base_type (struct type
*raw_type
)
8900 struct type
*real_type_namer
;
8901 struct type
*raw_real_type
;
8903 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8906 if (ada_is_aligner_type (raw_type
))
8907 /* The encoding specifies that we should always use the aligner type.
8908 So, even if this aligner type has an associated XVS type, we should
8911 According to the compiler gurus, an XVS type parallel to an aligner
8912 type may exist because of a stabs limitation. In stabs, aligner
8913 types are empty because the field has a variable-sized type, and
8914 thus cannot actually be used as an aligner type. As a result,
8915 we need the associated parallel XVS type to decode the type.
8916 Since the policy in the compiler is to not change the internal
8917 representation based on the debugging info format, we sometimes
8918 end up having a redundant XVS type parallel to the aligner type. */
8921 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8922 if (real_type_namer
== NULL
8923 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8924 || TYPE_NFIELDS (real_type_namer
) != 1)
8927 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8929 /* This is an older encoding form where the base type needs to be
8930 looked up by name. We prefer the newer enconding because it is
8932 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8933 if (raw_real_type
== NULL
)
8936 return raw_real_type
;
8939 /* The field in our XVS type is a reference to the base type. */
8940 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8943 /* The type of value designated by TYPE, with all aligners removed. */
8946 ada_aligned_type (struct type
*type
)
8948 if (ada_is_aligner_type (type
))
8949 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8951 return ada_get_base_type (type
);
8955 /* The address of the aligned value in an object at address VALADDR
8956 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8959 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8961 if (ada_is_aligner_type (type
))
8962 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8964 TYPE_FIELD_BITPOS (type
,
8965 0) / TARGET_CHAR_BIT
);
8972 /* The printed representation of an enumeration literal with encoded
8973 name NAME. The value is good to the next call of ada_enum_name. */
8975 ada_enum_name (const char *name
)
8977 static char *result
;
8978 static size_t result_len
= 0;
8981 /* First, unqualify the enumeration name:
8982 1. Search for the last '.' character. If we find one, then skip
8983 all the preceding characters, the unqualified name starts
8984 right after that dot.
8985 2. Otherwise, we may be debugging on a target where the compiler
8986 translates dots into "__". Search forward for double underscores,
8987 but stop searching when we hit an overloading suffix, which is
8988 of the form "__" followed by digits. */
8990 tmp
= strrchr (name
, '.');
8995 while ((tmp
= strstr (name
, "__")) != NULL
)
8997 if (isdigit (tmp
[2]))
9008 if (name
[1] == 'U' || name
[1] == 'W')
9010 if (sscanf (name
+ 2, "%x", &v
) != 1)
9016 GROW_VECT (result
, result_len
, 16);
9017 if (isascii (v
) && isprint (v
))
9018 xsnprintf (result
, result_len
, "'%c'", v
);
9019 else if (name
[1] == 'U')
9020 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9022 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9028 tmp
= strstr (name
, "__");
9030 tmp
= strstr (name
, "$");
9033 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9034 strncpy (result
, name
, tmp
- name
);
9035 result
[tmp
- name
] = '\0';
9043 /* Evaluate the subexpression of EXP starting at *POS as for
9044 evaluate_type, updating *POS to point just past the evaluated
9047 static struct value
*
9048 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9050 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9053 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9056 static struct value
*
9057 unwrap_value (struct value
*val
)
9059 struct type
*type
= ada_check_typedef (value_type (val
));
9061 if (ada_is_aligner_type (type
))
9063 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9064 struct type
*val_type
= ada_check_typedef (value_type (v
));
9066 if (ada_type_name (val_type
) == NULL
)
9067 TYPE_NAME (val_type
) = ada_type_name (type
);
9069 return unwrap_value (v
);
9073 struct type
*raw_real_type
=
9074 ada_check_typedef (ada_get_base_type (type
));
9076 /* If there is no parallel XVS or XVE type, then the value is
9077 already unwrapped. Return it without further modification. */
9078 if ((type
== raw_real_type
)
9079 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9083 coerce_unspec_val_to_type
9084 (val
, ada_to_fixed_type (raw_real_type
, 0,
9085 value_address (val
),
9090 static struct value
*
9091 cast_to_fixed (struct type
*type
, struct value
*arg
)
9095 if (type
== value_type (arg
))
9097 else if (ada_is_fixed_point_type (value_type (arg
)))
9098 val
= ada_float_to_fixed (type
,
9099 ada_fixed_to_float (value_type (arg
),
9100 value_as_long (arg
)));
9103 DOUBLEST argd
= value_as_double (arg
);
9105 val
= ada_float_to_fixed (type
, argd
);
9108 return value_from_longest (type
, val
);
9111 static struct value
*
9112 cast_from_fixed (struct type
*type
, struct value
*arg
)
9114 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9115 value_as_long (arg
));
9117 return value_from_double (type
, val
);
9120 /* Given two array types T1 and T2, return nonzero iff both arrays
9121 contain the same number of elements. */
9124 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9126 LONGEST lo1
, hi1
, lo2
, hi2
;
9128 /* Get the array bounds in order to verify that the size of
9129 the two arrays match. */
9130 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9131 || !get_array_bounds (t2
, &lo2
, &hi2
))
9132 error (_("unable to determine array bounds"));
9134 /* To make things easier for size comparison, normalize a bit
9135 the case of empty arrays by making sure that the difference
9136 between upper bound and lower bound is always -1. */
9142 return (hi1
- lo1
== hi2
- lo2
);
9145 /* Assuming that VAL is an array of integrals, and TYPE represents
9146 an array with the same number of elements, but with wider integral
9147 elements, return an array "casted" to TYPE. In practice, this
9148 means that the returned array is built by casting each element
9149 of the original array into TYPE's (wider) element type. */
9151 static struct value
*
9152 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9154 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9159 /* Verify that both val and type are arrays of scalars, and
9160 that the size of val's elements is smaller than the size
9161 of type's element. */
9162 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9163 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9164 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9165 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9166 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9167 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9169 if (!get_array_bounds (type
, &lo
, &hi
))
9170 error (_("unable to determine array bounds"));
9172 res
= allocate_value (type
);
9174 /* Promote each array element. */
9175 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9177 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9179 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9180 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9186 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9187 return the converted value. */
9189 static struct value
*
9190 coerce_for_assign (struct type
*type
, struct value
*val
)
9192 struct type
*type2
= value_type (val
);
9197 type2
= ada_check_typedef (type2
);
9198 type
= ada_check_typedef (type
);
9200 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9201 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9203 val
= ada_value_ind (val
);
9204 type2
= value_type (val
);
9207 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9208 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9210 if (!ada_same_array_size_p (type
, type2
))
9211 error (_("cannot assign arrays of different length"));
9213 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9214 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9215 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9216 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9218 /* Allow implicit promotion of the array elements to
9220 return ada_promote_array_of_integrals (type
, val
);
9223 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9224 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9225 error (_("Incompatible types in assignment"));
9226 deprecated_set_value_type (val
, type
);
9231 static struct value
*
9232 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9235 struct type
*type1
, *type2
;
9238 arg1
= coerce_ref (arg1
);
9239 arg2
= coerce_ref (arg2
);
9240 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9241 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9243 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9244 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9245 return value_binop (arg1
, arg2
, op
);
9254 return value_binop (arg1
, arg2
, op
);
9257 v2
= value_as_long (arg2
);
9259 error (_("second operand of %s must not be zero."), op_string (op
));
9261 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9262 return value_binop (arg1
, arg2
, op
);
9264 v1
= value_as_long (arg1
);
9269 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9270 v
+= v
> 0 ? -1 : 1;
9278 /* Should not reach this point. */
9282 val
= allocate_value (type1
);
9283 store_unsigned_integer (value_contents_raw (val
),
9284 TYPE_LENGTH (value_type (val
)),
9285 gdbarch_byte_order (get_type_arch (type1
)), v
);
9290 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9292 if (ada_is_direct_array_type (value_type (arg1
))
9293 || ada_is_direct_array_type (value_type (arg2
)))
9295 /* Automatically dereference any array reference before
9296 we attempt to perform the comparison. */
9297 arg1
= ada_coerce_ref (arg1
);
9298 arg2
= ada_coerce_ref (arg2
);
9300 arg1
= ada_coerce_to_simple_array (arg1
);
9301 arg2
= ada_coerce_to_simple_array (arg2
);
9302 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9303 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9304 error (_("Attempt to compare array with non-array"));
9305 /* FIXME: The following works only for types whose
9306 representations use all bits (no padding or undefined bits)
9307 and do not have user-defined equality. */
9309 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9310 && memcmp (value_contents (arg1
), value_contents (arg2
),
9311 TYPE_LENGTH (value_type (arg1
))) == 0;
9313 return value_equal (arg1
, arg2
);
9316 /* Total number of component associations in the aggregate starting at
9317 index PC in EXP. Assumes that index PC is the start of an
9321 num_component_specs (struct expression
*exp
, int pc
)
9325 m
= exp
->elts
[pc
+ 1].longconst
;
9328 for (i
= 0; i
< m
; i
+= 1)
9330 switch (exp
->elts
[pc
].opcode
)
9336 n
+= exp
->elts
[pc
+ 1].longconst
;
9339 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9344 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9345 component of LHS (a simple array or a record), updating *POS past
9346 the expression, assuming that LHS is contained in CONTAINER. Does
9347 not modify the inferior's memory, nor does it modify LHS (unless
9348 LHS == CONTAINER). */
9351 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9352 struct expression
*exp
, int *pos
)
9354 struct value
*mark
= value_mark ();
9357 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9359 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9360 struct value
*index_val
= value_from_longest (index_type
, index
);
9362 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9366 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9367 elt
= ada_to_fixed_value (elt
);
9370 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9371 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9373 value_assign_to_component (container
, elt
,
9374 ada_evaluate_subexp (NULL
, exp
, pos
,
9377 value_free_to_mark (mark
);
9380 /* Assuming that LHS represents an lvalue having a record or array
9381 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9382 of that aggregate's value to LHS, advancing *POS past the
9383 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9384 lvalue containing LHS (possibly LHS itself). Does not modify
9385 the inferior's memory, nor does it modify the contents of
9386 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9388 static struct value
*
9389 assign_aggregate (struct value
*container
,
9390 struct value
*lhs
, struct expression
*exp
,
9391 int *pos
, enum noside noside
)
9393 struct type
*lhs_type
;
9394 int n
= exp
->elts
[*pos
+1].longconst
;
9395 LONGEST low_index
, high_index
;
9398 int max_indices
, num_indices
;
9402 if (noside
!= EVAL_NORMAL
)
9404 for (i
= 0; i
< n
; i
+= 1)
9405 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9409 container
= ada_coerce_ref (container
);
9410 if (ada_is_direct_array_type (value_type (container
)))
9411 container
= ada_coerce_to_simple_array (container
);
9412 lhs
= ada_coerce_ref (lhs
);
9413 if (!deprecated_value_modifiable (lhs
))
9414 error (_("Left operand of assignment is not a modifiable lvalue."));
9416 lhs_type
= value_type (lhs
);
9417 if (ada_is_direct_array_type (lhs_type
))
9419 lhs
= ada_coerce_to_simple_array (lhs
);
9420 lhs_type
= value_type (lhs
);
9421 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9422 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9424 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9427 high_index
= num_visible_fields (lhs_type
) - 1;
9430 error (_("Left-hand side must be array or record."));
9432 num_specs
= num_component_specs (exp
, *pos
- 3);
9433 max_indices
= 4 * num_specs
+ 4;
9434 indices
= alloca (max_indices
* sizeof (indices
[0]));
9435 indices
[0] = indices
[1] = low_index
- 1;
9436 indices
[2] = indices
[3] = high_index
+ 1;
9439 for (i
= 0; i
< n
; i
+= 1)
9441 switch (exp
->elts
[*pos
].opcode
)
9444 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9445 &num_indices
, max_indices
,
9446 low_index
, high_index
);
9449 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9450 &num_indices
, max_indices
,
9451 low_index
, high_index
);
9455 error (_("Misplaced 'others' clause"));
9456 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9457 num_indices
, low_index
, high_index
);
9460 error (_("Internal error: bad aggregate clause"));
9467 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9468 construct at *POS, updating *POS past the construct, given that
9469 the positions are relative to lower bound LOW, where HIGH is the
9470 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9471 updating *NUM_INDICES as needed. CONTAINER is as for
9472 assign_aggregate. */
9474 aggregate_assign_positional (struct value
*container
,
9475 struct value
*lhs
, struct expression
*exp
,
9476 int *pos
, LONGEST
*indices
, int *num_indices
,
9477 int max_indices
, LONGEST low
, LONGEST high
)
9479 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9481 if (ind
- 1 == high
)
9482 warning (_("Extra components in aggregate ignored."));
9485 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9487 assign_component (container
, lhs
, ind
, exp
, pos
);
9490 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9493 /* Assign into the components of LHS indexed by the OP_CHOICES
9494 construct at *POS, updating *POS past the construct, given that
9495 the allowable indices are LOW..HIGH. Record the indices assigned
9496 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9497 needed. CONTAINER is as for assign_aggregate. */
9499 aggregate_assign_from_choices (struct value
*container
,
9500 struct value
*lhs
, struct expression
*exp
,
9501 int *pos
, LONGEST
*indices
, int *num_indices
,
9502 int max_indices
, LONGEST low
, LONGEST high
)
9505 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9506 int choice_pos
, expr_pc
;
9507 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9509 choice_pos
= *pos
+= 3;
9511 for (j
= 0; j
< n_choices
; j
+= 1)
9512 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9514 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9516 for (j
= 0; j
< n_choices
; j
+= 1)
9518 LONGEST lower
, upper
;
9519 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9521 if (op
== OP_DISCRETE_RANGE
)
9524 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9526 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9531 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9543 name
= &exp
->elts
[choice_pos
+ 2].string
;
9546 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9549 error (_("Invalid record component association."));
9551 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9553 if (! find_struct_field (name
, value_type (lhs
), 0,
9554 NULL
, NULL
, NULL
, NULL
, &ind
))
9555 error (_("Unknown component name: %s."), name
);
9556 lower
= upper
= ind
;
9559 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9560 error (_("Index in component association out of bounds."));
9562 add_component_interval (lower
, upper
, indices
, num_indices
,
9564 while (lower
<= upper
)
9569 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9575 /* Assign the value of the expression in the OP_OTHERS construct in
9576 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9577 have not been previously assigned. The index intervals already assigned
9578 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9579 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9581 aggregate_assign_others (struct value
*container
,
9582 struct value
*lhs
, struct expression
*exp
,
9583 int *pos
, LONGEST
*indices
, int num_indices
,
9584 LONGEST low
, LONGEST high
)
9587 int expr_pc
= *pos
+ 1;
9589 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9593 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9598 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9601 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9604 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9605 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9606 modifying *SIZE as needed. It is an error if *SIZE exceeds
9607 MAX_SIZE. The resulting intervals do not overlap. */
9609 add_component_interval (LONGEST low
, LONGEST high
,
9610 LONGEST
* indices
, int *size
, int max_size
)
9614 for (i
= 0; i
< *size
; i
+= 2) {
9615 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9619 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9620 if (high
< indices
[kh
])
9622 if (low
< indices
[i
])
9624 indices
[i
+ 1] = indices
[kh
- 1];
9625 if (high
> indices
[i
+ 1])
9626 indices
[i
+ 1] = high
;
9627 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9628 *size
-= kh
- i
- 2;
9631 else if (high
< indices
[i
])
9635 if (*size
== max_size
)
9636 error (_("Internal error: miscounted aggregate components."));
9638 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9639 indices
[j
] = indices
[j
- 2];
9641 indices
[i
+ 1] = high
;
9644 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9647 static struct value
*
9648 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9650 if (type
== ada_check_typedef (value_type (arg2
)))
9653 if (ada_is_fixed_point_type (type
))
9654 return (cast_to_fixed (type
, arg2
));
9656 if (ada_is_fixed_point_type (value_type (arg2
)))
9657 return cast_from_fixed (type
, arg2
);
9659 return value_cast (type
, arg2
);
9662 /* Evaluating Ada expressions, and printing their result.
9663 ------------------------------------------------------
9668 We usually evaluate an Ada expression in order to print its value.
9669 We also evaluate an expression in order to print its type, which
9670 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9671 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9672 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9673 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9676 Evaluating expressions is a little more complicated for Ada entities
9677 than it is for entities in languages such as C. The main reason for
9678 this is that Ada provides types whose definition might be dynamic.
9679 One example of such types is variant records. Or another example
9680 would be an array whose bounds can only be known at run time.
9682 The following description is a general guide as to what should be
9683 done (and what should NOT be done) in order to evaluate an expression
9684 involving such types, and when. This does not cover how the semantic
9685 information is encoded by GNAT as this is covered separatly. For the
9686 document used as the reference for the GNAT encoding, see exp_dbug.ads
9687 in the GNAT sources.
9689 Ideally, we should embed each part of this description next to its
9690 associated code. Unfortunately, the amount of code is so vast right
9691 now that it's hard to see whether the code handling a particular
9692 situation might be duplicated or not. One day, when the code is
9693 cleaned up, this guide might become redundant with the comments
9694 inserted in the code, and we might want to remove it.
9696 2. ``Fixing'' an Entity, the Simple Case:
9697 -----------------------------------------
9699 When evaluating Ada expressions, the tricky issue is that they may
9700 reference entities whose type contents and size are not statically
9701 known. Consider for instance a variant record:
9703 type Rec (Empty : Boolean := True) is record
9706 when False => Value : Integer;
9709 Yes : Rec := (Empty => False, Value => 1);
9710 No : Rec := (empty => True);
9712 The size and contents of that record depends on the value of the
9713 descriminant (Rec.Empty). At this point, neither the debugging
9714 information nor the associated type structure in GDB are able to
9715 express such dynamic types. So what the debugger does is to create
9716 "fixed" versions of the type that applies to the specific object.
9717 We also informally refer to this opperation as "fixing" an object,
9718 which means creating its associated fixed type.
9720 Example: when printing the value of variable "Yes" above, its fixed
9721 type would look like this:
9728 On the other hand, if we printed the value of "No", its fixed type
9735 Things become a little more complicated when trying to fix an entity
9736 with a dynamic type that directly contains another dynamic type,
9737 such as an array of variant records, for instance. There are
9738 two possible cases: Arrays, and records.
9740 3. ``Fixing'' Arrays:
9741 ---------------------
9743 The type structure in GDB describes an array in terms of its bounds,
9744 and the type of its elements. By design, all elements in the array
9745 have the same type and we cannot represent an array of variant elements
9746 using the current type structure in GDB. When fixing an array,
9747 we cannot fix the array element, as we would potentially need one
9748 fixed type per element of the array. As a result, the best we can do
9749 when fixing an array is to produce an array whose bounds and size
9750 are correct (allowing us to read it from memory), but without having
9751 touched its element type. Fixing each element will be done later,
9752 when (if) necessary.
9754 Arrays are a little simpler to handle than records, because the same
9755 amount of memory is allocated for each element of the array, even if
9756 the amount of space actually used by each element differs from element
9757 to element. Consider for instance the following array of type Rec:
9759 type Rec_Array is array (1 .. 2) of Rec;
9761 The actual amount of memory occupied by each element might be different
9762 from element to element, depending on the value of their discriminant.
9763 But the amount of space reserved for each element in the array remains
9764 fixed regardless. So we simply need to compute that size using
9765 the debugging information available, from which we can then determine
9766 the array size (we multiply the number of elements of the array by
9767 the size of each element).
9769 The simplest case is when we have an array of a constrained element
9770 type. For instance, consider the following type declarations:
9772 type Bounded_String (Max_Size : Integer) is
9774 Buffer : String (1 .. Max_Size);
9776 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9778 In this case, the compiler describes the array as an array of
9779 variable-size elements (identified by its XVS suffix) for which
9780 the size can be read in the parallel XVZ variable.
9782 In the case of an array of an unconstrained element type, the compiler
9783 wraps the array element inside a private PAD type. This type should not
9784 be shown to the user, and must be "unwrap"'ed before printing. Note
9785 that we also use the adjective "aligner" in our code to designate
9786 these wrapper types.
9788 In some cases, the size allocated for each element is statically
9789 known. In that case, the PAD type already has the correct size,
9790 and the array element should remain unfixed.
9792 But there are cases when this size is not statically known.
9793 For instance, assuming that "Five" is an integer variable:
9795 type Dynamic is array (1 .. Five) of Integer;
9796 type Wrapper (Has_Length : Boolean := False) is record
9799 when True => Length : Integer;
9803 type Wrapper_Array is array (1 .. 2) of Wrapper;
9805 Hello : Wrapper_Array := (others => (Has_Length => True,
9806 Data => (others => 17),
9810 The debugging info would describe variable Hello as being an
9811 array of a PAD type. The size of that PAD type is not statically
9812 known, but can be determined using a parallel XVZ variable.
9813 In that case, a copy of the PAD type with the correct size should
9814 be used for the fixed array.
9816 3. ``Fixing'' record type objects:
9817 ----------------------------------
9819 Things are slightly different from arrays in the case of dynamic
9820 record types. In this case, in order to compute the associated
9821 fixed type, we need to determine the size and offset of each of
9822 its components. This, in turn, requires us to compute the fixed
9823 type of each of these components.
9825 Consider for instance the example:
9827 type Bounded_String (Max_Size : Natural) is record
9828 Str : String (1 .. Max_Size);
9831 My_String : Bounded_String (Max_Size => 10);
9833 In that case, the position of field "Length" depends on the size
9834 of field Str, which itself depends on the value of the Max_Size
9835 discriminant. In order to fix the type of variable My_String,
9836 we need to fix the type of field Str. Therefore, fixing a variant
9837 record requires us to fix each of its components.
9839 However, if a component does not have a dynamic size, the component
9840 should not be fixed. In particular, fields that use a PAD type
9841 should not fixed. Here is an example where this might happen
9842 (assuming type Rec above):
9844 type Container (Big : Boolean) is record
9848 when True => Another : Integer;
9852 My_Container : Container := (Big => False,
9853 First => (Empty => True),
9856 In that example, the compiler creates a PAD type for component First,
9857 whose size is constant, and then positions the component After just
9858 right after it. The offset of component After is therefore constant
9861 The debugger computes the position of each field based on an algorithm
9862 that uses, among other things, the actual position and size of the field
9863 preceding it. Let's now imagine that the user is trying to print
9864 the value of My_Container. If the type fixing was recursive, we would
9865 end up computing the offset of field After based on the size of the
9866 fixed version of field First. And since in our example First has
9867 only one actual field, the size of the fixed type is actually smaller
9868 than the amount of space allocated to that field, and thus we would
9869 compute the wrong offset of field After.
9871 To make things more complicated, we need to watch out for dynamic
9872 components of variant records (identified by the ___XVL suffix in
9873 the component name). Even if the target type is a PAD type, the size
9874 of that type might not be statically known. So the PAD type needs
9875 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9876 we might end up with the wrong size for our component. This can be
9877 observed with the following type declarations:
9879 type Octal is new Integer range 0 .. 7;
9880 type Octal_Array is array (Positive range <>) of Octal;
9881 pragma Pack (Octal_Array);
9883 type Octal_Buffer (Size : Positive) is record
9884 Buffer : Octal_Array (1 .. Size);
9888 In that case, Buffer is a PAD type whose size is unset and needs
9889 to be computed by fixing the unwrapped type.
9891 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9892 ----------------------------------------------------------
9894 Lastly, when should the sub-elements of an entity that remained unfixed
9895 thus far, be actually fixed?
9897 The answer is: Only when referencing that element. For instance
9898 when selecting one component of a record, this specific component
9899 should be fixed at that point in time. Or when printing the value
9900 of a record, each component should be fixed before its value gets
9901 printed. Similarly for arrays, the element of the array should be
9902 fixed when printing each element of the array, or when extracting
9903 one element out of that array. On the other hand, fixing should
9904 not be performed on the elements when taking a slice of an array!
9906 Note that one of the side-effects of miscomputing the offset and
9907 size of each field is that we end up also miscomputing the size
9908 of the containing type. This can have adverse results when computing
9909 the value of an entity. GDB fetches the value of an entity based
9910 on the size of its type, and thus a wrong size causes GDB to fetch
9911 the wrong amount of memory. In the case where the computed size is
9912 too small, GDB fetches too little data to print the value of our
9913 entiry. Results in this case as unpredicatble, as we usually read
9914 past the buffer containing the data =:-o. */
9916 /* Implement the evaluate_exp routine in the exp_descriptor structure
9917 for the Ada language. */
9919 static struct value
*
9920 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9921 int *pos
, enum noside noside
)
9927 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9930 struct value
**argvec
;
9934 op
= exp
->elts
[pc
].opcode
;
9940 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9942 if (noside
== EVAL_NORMAL
)
9943 arg1
= unwrap_value (arg1
);
9945 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9946 then we need to perform the conversion manually, because
9947 evaluate_subexp_standard doesn't do it. This conversion is
9948 necessary in Ada because the different kinds of float/fixed
9949 types in Ada have different representations.
9951 Similarly, we need to perform the conversion from OP_LONG
9953 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9954 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9960 struct value
*result
;
9963 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9964 /* The result type will have code OP_STRING, bashed there from
9965 OP_ARRAY. Bash it back. */
9966 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9967 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9973 type
= exp
->elts
[pc
+ 1].type
;
9974 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9975 if (noside
== EVAL_SKIP
)
9977 arg1
= ada_value_cast (type
, arg1
, noside
);
9982 type
= exp
->elts
[pc
+ 1].type
;
9983 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9986 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9987 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9989 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9990 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9992 return ada_value_assign (arg1
, arg1
);
9994 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9995 except if the lhs of our assignment is a convenience variable.
9996 In the case of assigning to a convenience variable, the lhs
9997 should be exactly the result of the evaluation of the rhs. */
9998 type
= value_type (arg1
);
9999 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10001 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10002 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10004 if (ada_is_fixed_point_type (value_type (arg1
)))
10005 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10006 else if (ada_is_fixed_point_type (value_type (arg2
)))
10008 (_("Fixed-point values must be assigned to fixed-point variables"));
10010 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10011 return ada_value_assign (arg1
, arg2
);
10014 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10015 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10016 if (noside
== EVAL_SKIP
)
10018 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10019 return (value_from_longest
10020 (value_type (arg1
),
10021 value_as_long (arg1
) + value_as_long (arg2
)));
10022 if ((ada_is_fixed_point_type (value_type (arg1
))
10023 || ada_is_fixed_point_type (value_type (arg2
)))
10024 && value_type (arg1
) != value_type (arg2
))
10025 error (_("Operands of fixed-point addition must have the same type"));
10026 /* Do the addition, and cast the result to the type of the first
10027 argument. We cannot cast the result to a reference type, so if
10028 ARG1 is a reference type, find its underlying type. */
10029 type
= value_type (arg1
);
10030 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10031 type
= TYPE_TARGET_TYPE (type
);
10032 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10033 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10036 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10037 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10038 if (noside
== EVAL_SKIP
)
10040 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
10041 return (value_from_longest
10042 (value_type (arg1
),
10043 value_as_long (arg1
) - value_as_long (arg2
)));
10044 if ((ada_is_fixed_point_type (value_type (arg1
))
10045 || ada_is_fixed_point_type (value_type (arg2
)))
10046 && value_type (arg1
) != value_type (arg2
))
10047 error (_("Operands of fixed-point subtraction "
10048 "must have the same type"));
10049 /* Do the substraction, and cast the result to the type of the first
10050 argument. We cannot cast the result to a reference type, so if
10051 ARG1 is a reference type, find its underlying type. */
10052 type
= value_type (arg1
);
10053 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10054 type
= TYPE_TARGET_TYPE (type
);
10055 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10056 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10062 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10063 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10064 if (noside
== EVAL_SKIP
)
10066 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10068 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10069 return value_zero (value_type (arg1
), not_lval
);
10073 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10074 if (ada_is_fixed_point_type (value_type (arg1
)))
10075 arg1
= cast_from_fixed (type
, arg1
);
10076 if (ada_is_fixed_point_type (value_type (arg2
)))
10077 arg2
= cast_from_fixed (type
, arg2
);
10078 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10079 return ada_value_binop (arg1
, arg2
, op
);
10083 case BINOP_NOTEQUAL
:
10084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10085 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10086 if (noside
== EVAL_SKIP
)
10088 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10092 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10093 tem
= ada_value_equal (arg1
, arg2
);
10095 if (op
== BINOP_NOTEQUAL
)
10097 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10098 return value_from_longest (type
, (LONGEST
) tem
);
10101 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10102 if (noside
== EVAL_SKIP
)
10104 else if (ada_is_fixed_point_type (value_type (arg1
)))
10105 return value_cast (value_type (arg1
), value_neg (arg1
));
10108 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10109 return value_neg (arg1
);
10112 case BINOP_LOGICAL_AND
:
10113 case BINOP_LOGICAL_OR
:
10114 case UNOP_LOGICAL_NOT
:
10119 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10120 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10121 return value_cast (type
, val
);
10124 case BINOP_BITWISE_AND
:
10125 case BINOP_BITWISE_IOR
:
10126 case BINOP_BITWISE_XOR
:
10130 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10132 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10134 return value_cast (value_type (arg1
), val
);
10140 if (noside
== EVAL_SKIP
)
10145 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10146 /* Only encountered when an unresolved symbol occurs in a
10147 context other than a function call, in which case, it is
10149 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10150 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10151 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10153 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10154 /* Check to see if this is a tagged type. We also need to handle
10155 the case where the type is a reference to a tagged type, but
10156 we have to be careful to exclude pointers to tagged types.
10157 The latter should be shown as usual (as a pointer), whereas
10158 a reference should mostly be transparent to the user. */
10159 if (ada_is_tagged_type (type
, 0)
10160 || (TYPE_CODE (type
) == TYPE_CODE_REF
10161 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10163 /* Tagged types are a little special in the fact that the real
10164 type is dynamic and can only be determined by inspecting the
10165 object's tag. This means that we need to get the object's
10166 value first (EVAL_NORMAL) and then extract the actual object
10169 Note that we cannot skip the final step where we extract
10170 the object type from its tag, because the EVAL_NORMAL phase
10171 results in dynamic components being resolved into fixed ones.
10172 This can cause problems when trying to print the type
10173 description of tagged types whose parent has a dynamic size:
10174 We use the type name of the "_parent" component in order
10175 to print the name of the ancestor type in the type description.
10176 If that component had a dynamic size, the resolution into
10177 a fixed type would result in the loss of that type name,
10178 thus preventing us from printing the name of the ancestor
10179 type in the type description. */
10180 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10182 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10184 struct type
*actual_type
;
10186 actual_type
= type_from_tag (ada_value_tag (arg1
));
10187 if (actual_type
== NULL
)
10188 /* If, for some reason, we were unable to determine
10189 the actual type from the tag, then use the static
10190 approximation that we just computed as a fallback.
10191 This can happen if the debugging information is
10192 incomplete, for instance. */
10193 actual_type
= type
;
10194 return value_zero (actual_type
, not_lval
);
10198 /* In the case of a ref, ada_coerce_ref takes care
10199 of determining the actual type. But the evaluation
10200 should return a ref as it should be valid to ask
10201 for its address; so rebuild a ref after coerce. */
10202 arg1
= ada_coerce_ref (arg1
);
10203 return value_ref (arg1
);
10209 (to_static_fixed_type
10210 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
10215 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10216 return ada_to_fixed_value (arg1
);
10222 /* Allocate arg vector, including space for the function to be
10223 called in argvec[0] and a terminating NULL. */
10224 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10226 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10228 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10229 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10230 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10231 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10234 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10235 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10238 if (noside
== EVAL_SKIP
)
10242 if (ada_is_constrained_packed_array_type
10243 (desc_base_type (value_type (argvec
[0]))))
10244 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10245 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10246 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10247 /* This is a packed array that has already been fixed, and
10248 therefore already coerced to a simple array. Nothing further
10251 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10252 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10253 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10254 argvec
[0] = value_addr (argvec
[0]);
10256 type
= ada_check_typedef (value_type (argvec
[0]));
10258 /* Ada allows us to implicitly dereference arrays when subscripting
10259 them. So, if this is an array typedef (encoding use for array
10260 access types encoded as fat pointers), strip it now. */
10261 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10262 type
= ada_typedef_target_type (type
);
10264 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10266 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10268 case TYPE_CODE_FUNC
:
10269 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10271 case TYPE_CODE_ARRAY
:
10273 case TYPE_CODE_STRUCT
:
10274 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10275 argvec
[0] = ada_value_ind (argvec
[0]);
10276 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10279 error (_("cannot subscript or call something of type `%s'"),
10280 ada_type_name (value_type (argvec
[0])));
10285 switch (TYPE_CODE (type
))
10287 case TYPE_CODE_FUNC
:
10288 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10290 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10292 if (TYPE_GNU_IFUNC (type
))
10293 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10294 return allocate_value (rtype
);
10296 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10297 case TYPE_CODE_INTERNAL_FUNCTION
:
10298 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10299 /* We don't know anything about what the internal
10300 function might return, but we have to return
10302 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10305 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10306 argvec
[0], nargs
, argvec
+ 1);
10308 case TYPE_CODE_STRUCT
:
10312 arity
= ada_array_arity (type
);
10313 type
= ada_array_element_type (type
, nargs
);
10315 error (_("cannot subscript or call a record"));
10316 if (arity
!= nargs
)
10317 error (_("wrong number of subscripts; expecting %d"), arity
);
10318 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10319 return value_zero (ada_aligned_type (type
), lval_memory
);
10321 unwrap_value (ada_value_subscript
10322 (argvec
[0], nargs
, argvec
+ 1));
10324 case TYPE_CODE_ARRAY
:
10325 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10327 type
= ada_array_element_type (type
, nargs
);
10329 error (_("element type of array unknown"));
10331 return value_zero (ada_aligned_type (type
), lval_memory
);
10334 unwrap_value (ada_value_subscript
10335 (ada_coerce_to_simple_array (argvec
[0]),
10336 nargs
, argvec
+ 1));
10337 case TYPE_CODE_PTR
: /* Pointer to array */
10338 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10339 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10341 type
= ada_array_element_type (type
, nargs
);
10343 error (_("element type of array unknown"));
10345 return value_zero (ada_aligned_type (type
), lval_memory
);
10348 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
10349 nargs
, argvec
+ 1));
10352 error (_("Attempt to index or call something other than an "
10353 "array or function"));
10358 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10359 struct value
*low_bound_val
=
10360 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10361 struct value
*high_bound_val
=
10362 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10364 LONGEST high_bound
;
10366 low_bound_val
= coerce_ref (low_bound_val
);
10367 high_bound_val
= coerce_ref (high_bound_val
);
10368 low_bound
= pos_atr (low_bound_val
);
10369 high_bound
= pos_atr (high_bound_val
);
10371 if (noside
== EVAL_SKIP
)
10374 /* If this is a reference to an aligner type, then remove all
10376 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10377 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10378 TYPE_TARGET_TYPE (value_type (array
)) =
10379 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10381 if (ada_is_constrained_packed_array_type (value_type (array
)))
10382 error (_("cannot slice a packed array"));
10384 /* If this is a reference to an array or an array lvalue,
10385 convert to a pointer. */
10386 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10387 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10388 && VALUE_LVAL (array
) == lval_memory
))
10389 array
= value_addr (array
);
10391 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10392 && ada_is_array_descriptor_type (ada_check_typedef
10393 (value_type (array
))))
10394 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10396 array
= ada_coerce_to_simple_array_ptr (array
);
10398 /* If we have more than one level of pointer indirection,
10399 dereference the value until we get only one level. */
10400 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10401 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10403 array
= value_ind (array
);
10405 /* Make sure we really do have an array type before going further,
10406 to avoid a SEGV when trying to get the index type or the target
10407 type later down the road if the debug info generated by
10408 the compiler is incorrect or incomplete. */
10409 if (!ada_is_simple_array_type (value_type (array
)))
10410 error (_("cannot take slice of non-array"));
10412 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10415 struct type
*type0
= ada_check_typedef (value_type (array
));
10417 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10418 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10421 struct type
*arr_type0
=
10422 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10424 return ada_value_slice_from_ptr (array
, arr_type0
,
10425 longest_to_int (low_bound
),
10426 longest_to_int (high_bound
));
10429 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10431 else if (high_bound
< low_bound
)
10432 return empty_array (value_type (array
), low_bound
);
10434 return ada_value_slice (array
, longest_to_int (low_bound
),
10435 longest_to_int (high_bound
));
10438 case UNOP_IN_RANGE
:
10440 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10441 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10443 if (noside
== EVAL_SKIP
)
10446 switch (TYPE_CODE (type
))
10449 lim_warning (_("Membership test incompletely implemented; "
10450 "always returns true"));
10451 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10452 return value_from_longest (type
, (LONGEST
) 1);
10454 case TYPE_CODE_RANGE
:
10455 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10456 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10457 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10458 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10459 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10461 value_from_longest (type
,
10462 (value_less (arg1
, arg3
)
10463 || value_equal (arg1
, arg3
))
10464 && (value_less (arg2
, arg1
)
10465 || value_equal (arg2
, arg1
)));
10468 case BINOP_IN_BOUNDS
:
10470 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10471 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10473 if (noside
== EVAL_SKIP
)
10476 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10478 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10479 return value_zero (type
, not_lval
);
10482 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10484 type
= ada_index_type (value_type (arg2
), tem
, "range");
10486 type
= value_type (arg1
);
10488 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10489 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10491 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10492 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10493 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10495 value_from_longest (type
,
10496 (value_less (arg1
, arg3
)
10497 || value_equal (arg1
, arg3
))
10498 && (value_less (arg2
, arg1
)
10499 || value_equal (arg2
, arg1
)));
10501 case TERNOP_IN_RANGE
:
10502 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10503 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10504 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10506 if (noside
== EVAL_SKIP
)
10509 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10510 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10511 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10513 value_from_longest (type
,
10514 (value_less (arg1
, arg3
)
10515 || value_equal (arg1
, arg3
))
10516 && (value_less (arg2
, arg1
)
10517 || value_equal (arg2
, arg1
)));
10521 case OP_ATR_LENGTH
:
10523 struct type
*type_arg
;
10525 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10527 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10529 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10533 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10537 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10538 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10539 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10542 if (noside
== EVAL_SKIP
)
10545 if (type_arg
== NULL
)
10547 arg1
= ada_coerce_ref (arg1
);
10549 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10550 arg1
= ada_coerce_to_simple_array (arg1
);
10552 if (op
== OP_ATR_LENGTH
)
10553 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10556 type
= ada_index_type (value_type (arg1
), tem
,
10557 ada_attribute_name (op
));
10559 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10562 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10563 return allocate_value (type
);
10567 default: /* Should never happen. */
10568 error (_("unexpected attribute encountered"));
10570 return value_from_longest
10571 (type
, ada_array_bound (arg1
, tem
, 0));
10573 return value_from_longest
10574 (type
, ada_array_bound (arg1
, tem
, 1));
10575 case OP_ATR_LENGTH
:
10576 return value_from_longest
10577 (type
, ada_array_length (arg1
, tem
));
10580 else if (discrete_type_p (type_arg
))
10582 struct type
*range_type
;
10583 const char *name
= ada_type_name (type_arg
);
10586 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10587 range_type
= to_fixed_range_type (type_arg
, NULL
);
10588 if (range_type
== NULL
)
10589 range_type
= type_arg
;
10593 error (_("unexpected attribute encountered"));
10595 return value_from_longest
10596 (range_type
, ada_discrete_type_low_bound (range_type
));
10598 return value_from_longest
10599 (range_type
, ada_discrete_type_high_bound (range_type
));
10600 case OP_ATR_LENGTH
:
10601 error (_("the 'length attribute applies only to array types"));
10604 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10605 error (_("unimplemented type attribute"));
10610 if (ada_is_constrained_packed_array_type (type_arg
))
10611 type_arg
= decode_constrained_packed_array_type (type_arg
);
10613 if (op
== OP_ATR_LENGTH
)
10614 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10617 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10619 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10622 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10623 return allocate_value (type
);
10628 error (_("unexpected attribute encountered"));
10630 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10631 return value_from_longest (type
, low
);
10633 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10634 return value_from_longest (type
, high
);
10635 case OP_ATR_LENGTH
:
10636 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10637 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10638 return value_from_longest (type
, high
- low
+ 1);
10644 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10645 if (noside
== EVAL_SKIP
)
10648 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10649 return value_zero (ada_tag_type (arg1
), not_lval
);
10651 return ada_value_tag (arg1
);
10655 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10656 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10657 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10658 if (noside
== EVAL_SKIP
)
10660 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10661 return value_zero (value_type (arg1
), not_lval
);
10664 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10665 return value_binop (arg1
, arg2
,
10666 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10669 case OP_ATR_MODULUS
:
10671 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10673 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10674 if (noside
== EVAL_SKIP
)
10677 if (!ada_is_modular_type (type_arg
))
10678 error (_("'modulus must be applied to modular type"));
10680 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10681 ada_modulus (type_arg
));
10686 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10687 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10688 if (noside
== EVAL_SKIP
)
10690 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10691 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10692 return value_zero (type
, not_lval
);
10694 return value_pos_atr (type
, arg1
);
10697 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10698 type
= value_type (arg1
);
10700 /* If the argument is a reference, then dereference its type, since
10701 the user is really asking for the size of the actual object,
10702 not the size of the pointer. */
10703 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10704 type
= TYPE_TARGET_TYPE (type
);
10706 if (noside
== EVAL_SKIP
)
10708 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10709 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10711 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10712 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10715 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10716 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10717 type
= exp
->elts
[pc
+ 2].type
;
10718 if (noside
== EVAL_SKIP
)
10720 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10721 return value_zero (type
, not_lval
);
10723 return value_val_atr (type
, arg1
);
10726 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10727 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10728 if (noside
== EVAL_SKIP
)
10730 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10731 return value_zero (value_type (arg1
), not_lval
);
10734 /* For integer exponentiation operations,
10735 only promote the first argument. */
10736 if (is_integral_type (value_type (arg2
)))
10737 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10739 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10741 return value_binop (arg1
, arg2
, op
);
10745 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10746 if (noside
== EVAL_SKIP
)
10752 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10753 if (noside
== EVAL_SKIP
)
10755 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10756 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10757 return value_neg (arg1
);
10762 preeval_pos
= *pos
;
10763 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10764 if (noside
== EVAL_SKIP
)
10766 type
= ada_check_typedef (value_type (arg1
));
10767 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10769 if (ada_is_array_descriptor_type (type
))
10770 /* GDB allows dereferencing GNAT array descriptors. */
10772 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10774 if (arrType
== NULL
)
10775 error (_("Attempt to dereference null array pointer."));
10776 return value_at_lazy (arrType
, 0);
10778 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10779 || TYPE_CODE (type
) == TYPE_CODE_REF
10780 /* In C you can dereference an array to get the 1st elt. */
10781 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10783 /* As mentioned in the OP_VAR_VALUE case, tagged types can
10784 only be determined by inspecting the object's tag.
10785 This means that we need to evaluate completely the
10786 expression in order to get its type. */
10788 if ((TYPE_CODE (type
) == TYPE_CODE_REF
10789 || TYPE_CODE (type
) == TYPE_CODE_PTR
)
10790 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
10792 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10794 type
= value_type (ada_value_ind (arg1
));
10798 type
= to_static_fixed_type
10800 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10803 return value_zero (type
, lval_memory
);
10805 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10807 /* GDB allows dereferencing an int. */
10808 if (expect_type
== NULL
)
10809 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10814 to_static_fixed_type (ada_aligned_type (expect_type
));
10815 return value_zero (expect_type
, lval_memory
);
10819 error (_("Attempt to take contents of a non-pointer value."));
10821 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10822 type
= ada_check_typedef (value_type (arg1
));
10824 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10825 /* GDB allows dereferencing an int. If we were given
10826 the expect_type, then use that as the target type.
10827 Otherwise, assume that the target type is an int. */
10829 if (expect_type
!= NULL
)
10830 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10833 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10834 (CORE_ADDR
) value_as_address (arg1
));
10837 if (ada_is_array_descriptor_type (type
))
10838 /* GDB allows dereferencing GNAT array descriptors. */
10839 return ada_coerce_to_simple_array (arg1
);
10841 return ada_value_ind (arg1
);
10843 case STRUCTOP_STRUCT
:
10844 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10845 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10846 preeval_pos
= *pos
;
10847 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10848 if (noside
== EVAL_SKIP
)
10850 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10852 struct type
*type1
= value_type (arg1
);
10854 if (ada_is_tagged_type (type1
, 1))
10856 type
= ada_lookup_struct_elt_type (type1
,
10857 &exp
->elts
[pc
+ 2].string
,
10860 /* If the field is not found, check if it exists in the
10861 extension of this object's type. This means that we
10862 need to evaluate completely the expression. */
10866 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
10868 arg1
= ada_value_struct_elt (arg1
,
10869 &exp
->elts
[pc
+ 2].string
,
10871 arg1
= unwrap_value (arg1
);
10872 type
= value_type (ada_to_fixed_value (arg1
));
10877 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10880 return value_zero (ada_aligned_type (type
), lval_memory
);
10883 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10884 arg1
= unwrap_value (arg1
);
10885 return ada_to_fixed_value (arg1
);
10888 /* The value is not supposed to be used. This is here to make it
10889 easier to accommodate expressions that contain types. */
10891 if (noside
== EVAL_SKIP
)
10893 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10894 return allocate_value (exp
->elts
[pc
+ 1].type
);
10896 error (_("Attempt to use a type name as an expression"));
10901 case OP_DISCRETE_RANGE
:
10902 case OP_POSITIONAL
:
10904 if (noside
== EVAL_NORMAL
)
10908 error (_("Undefined name, ambiguous name, or renaming used in "
10909 "component association: %s."), &exp
->elts
[pc
+2].string
);
10911 error (_("Aggregates only allowed on the right of an assignment"));
10913 internal_error (__FILE__
, __LINE__
,
10914 _("aggregate apparently mangled"));
10917 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10919 for (tem
= 0; tem
< nargs
; tem
+= 1)
10920 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10925 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10931 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10932 type name that encodes the 'small and 'delta information.
10933 Otherwise, return NULL. */
10935 static const char *
10936 fixed_type_info (struct type
*type
)
10938 const char *name
= ada_type_name (type
);
10939 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10941 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10943 const char *tail
= strstr (name
, "___XF_");
10950 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10951 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10956 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10959 ada_is_fixed_point_type (struct type
*type
)
10961 return fixed_type_info (type
) != NULL
;
10964 /* Return non-zero iff TYPE represents a System.Address type. */
10967 ada_is_system_address_type (struct type
*type
)
10969 return (TYPE_NAME (type
)
10970 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10973 /* Assuming that TYPE is the representation of an Ada fixed-point
10974 type, return its delta, or -1 if the type is malformed and the
10975 delta cannot be determined. */
10978 ada_delta (struct type
*type
)
10980 const char *encoding
= fixed_type_info (type
);
10983 /* Strictly speaking, num and den are encoded as integer. However,
10984 they may not fit into a long, and they will have to be converted
10985 to DOUBLEST anyway. So scan them as DOUBLEST. */
10986 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10993 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10994 factor ('SMALL value) associated with the type. */
10997 scaling_factor (struct type
*type
)
10999 const char *encoding
= fixed_type_info (type
);
11000 DOUBLEST num0
, den0
, num1
, den1
;
11003 /* Strictly speaking, num's and den's are encoded as integer. However,
11004 they may not fit into a long, and they will have to be converted
11005 to DOUBLEST anyway. So scan them as DOUBLEST. */
11006 n
= sscanf (encoding
,
11007 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
11008 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
11009 &num0
, &den0
, &num1
, &den1
);
11014 return num1
/ den1
;
11016 return num0
/ den0
;
11020 /* Assuming that X is the representation of a value of fixed-point
11021 type TYPE, return its floating-point equivalent. */
11024 ada_fixed_to_float (struct type
*type
, LONGEST x
)
11026 return (DOUBLEST
) x
*scaling_factor (type
);
11029 /* The representation of a fixed-point value of type TYPE
11030 corresponding to the value X. */
11033 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
11035 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
11042 /* Scan STR beginning at position K for a discriminant name, and
11043 return the value of that discriminant field of DVAL in *PX. If
11044 PNEW_K is not null, put the position of the character beyond the
11045 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11046 not alter *PX and *PNEW_K if unsuccessful. */
11049 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11052 static char *bound_buffer
= NULL
;
11053 static size_t bound_buffer_len
= 0;
11056 struct value
*bound_val
;
11058 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11061 pend
= strstr (str
+ k
, "__");
11065 k
+= strlen (bound
);
11069 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
11070 bound
= bound_buffer
;
11071 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11072 bound
[pend
- (str
+ k
)] = '\0';
11076 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11077 if (bound_val
== NULL
)
11080 *px
= value_as_long (bound_val
);
11081 if (pnew_k
!= NULL
)
11086 /* Value of variable named NAME in the current environment. If
11087 no such variable found, then if ERR_MSG is null, returns 0, and
11088 otherwise causes an error with message ERR_MSG. */
11090 static struct value
*
11091 get_var_value (char *name
, char *err_msg
)
11093 struct ada_symbol_info
*syms
;
11096 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11101 if (err_msg
== NULL
)
11104 error (("%s"), err_msg
);
11107 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11110 /* Value of integer variable named NAME in the current environment. If
11111 no such variable found, returns 0, and sets *FLAG to 0. If
11112 successful, sets *FLAG to 1. */
11115 get_int_var_value (char *name
, int *flag
)
11117 struct value
*var_val
= get_var_value (name
, 0);
11129 return value_as_long (var_val
);
11134 /* Return a range type whose base type is that of the range type named
11135 NAME in the current environment, and whose bounds are calculated
11136 from NAME according to the GNAT range encoding conventions.
11137 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11138 corresponding range type from debug information; fall back to using it
11139 if symbol lookup fails. If a new type must be created, allocate it
11140 like ORIG_TYPE was. The bounds information, in general, is encoded
11141 in NAME, the base type given in the named range type. */
11143 static struct type
*
11144 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11147 struct type
*base_type
;
11148 char *subtype_info
;
11150 gdb_assert (raw_type
!= NULL
);
11151 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11153 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11154 base_type
= TYPE_TARGET_TYPE (raw_type
);
11156 base_type
= raw_type
;
11158 name
= TYPE_NAME (raw_type
);
11159 subtype_info
= strstr (name
, "___XD");
11160 if (subtype_info
== NULL
)
11162 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11163 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11165 if (L
< INT_MIN
|| U
> INT_MAX
)
11168 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11173 static char *name_buf
= NULL
;
11174 static size_t name_len
= 0;
11175 int prefix_len
= subtype_info
- name
;
11181 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11182 strncpy (name_buf
, name
, prefix_len
);
11183 name_buf
[prefix_len
] = '\0';
11186 bounds_str
= strchr (subtype_info
, '_');
11189 if (*subtype_info
== 'L')
11191 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11192 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11194 if (bounds_str
[n
] == '_')
11196 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11204 strcpy (name_buf
+ prefix_len
, "___L");
11205 L
= get_int_var_value (name_buf
, &ok
);
11208 lim_warning (_("Unknown lower bound, using 1."));
11213 if (*subtype_info
== 'U')
11215 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11216 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11223 strcpy (name_buf
+ prefix_len
, "___U");
11224 U
= get_int_var_value (name_buf
, &ok
);
11227 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11232 type
= create_static_range_type (alloc_type_copy (raw_type
),
11234 TYPE_NAME (type
) = name
;
11239 /* True iff NAME is the name of a range type. */
11242 ada_is_range_type_name (const char *name
)
11244 return (name
!= NULL
&& strstr (name
, "___XD"));
11248 /* Modular types */
11250 /* True iff TYPE is an Ada modular type. */
11253 ada_is_modular_type (struct type
*type
)
11255 struct type
*subranged_type
= get_base_type (type
);
11257 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11258 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11259 && TYPE_UNSIGNED (subranged_type
));
11262 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11265 ada_modulus (struct type
*type
)
11267 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11271 /* Ada exception catchpoint support:
11272 ---------------------------------
11274 We support 3 kinds of exception catchpoints:
11275 . catchpoints on Ada exceptions
11276 . catchpoints on unhandled Ada exceptions
11277 . catchpoints on failed assertions
11279 Exceptions raised during failed assertions, or unhandled exceptions
11280 could perfectly be caught with the general catchpoint on Ada exceptions.
11281 However, we can easily differentiate these two special cases, and having
11282 the option to distinguish these two cases from the rest can be useful
11283 to zero-in on certain situations.
11285 Exception catchpoints are a specialized form of breakpoint,
11286 since they rely on inserting breakpoints inside known routines
11287 of the GNAT runtime. The implementation therefore uses a standard
11288 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11291 Support in the runtime for exception catchpoints have been changed
11292 a few times already, and these changes affect the implementation
11293 of these catchpoints. In order to be able to support several
11294 variants of the runtime, we use a sniffer that will determine
11295 the runtime variant used by the program being debugged. */
11297 /* Ada's standard exceptions. */
11299 static char *standard_exc
[] = {
11300 "constraint_error",
11306 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11308 /* A structure that describes how to support exception catchpoints
11309 for a given executable. */
11311 struct exception_support_info
11313 /* The name of the symbol to break on in order to insert
11314 a catchpoint on exceptions. */
11315 const char *catch_exception_sym
;
11317 /* The name of the symbol to break on in order to insert
11318 a catchpoint on unhandled exceptions. */
11319 const char *catch_exception_unhandled_sym
;
11321 /* The name of the symbol to break on in order to insert
11322 a catchpoint on failed assertions. */
11323 const char *catch_assert_sym
;
11325 /* Assuming that the inferior just triggered an unhandled exception
11326 catchpoint, this function is responsible for returning the address
11327 in inferior memory where the name of that exception is stored.
11328 Return zero if the address could not be computed. */
11329 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11332 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11333 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11335 /* The following exception support info structure describes how to
11336 implement exception catchpoints with the latest version of the
11337 Ada runtime (as of 2007-03-06). */
11339 static const struct exception_support_info default_exception_support_info
=
11341 "__gnat_debug_raise_exception", /* catch_exception_sym */
11342 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11343 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11344 ada_unhandled_exception_name_addr
11347 /* The following exception support info structure describes how to
11348 implement exception catchpoints with a slightly older version
11349 of the Ada runtime. */
11351 static const struct exception_support_info exception_support_info_fallback
=
11353 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11354 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11355 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11356 ada_unhandled_exception_name_addr_from_raise
11359 /* Return nonzero if we can detect the exception support routines
11360 described in EINFO.
11362 This function errors out if an abnormal situation is detected
11363 (for instance, if we find the exception support routines, but
11364 that support is found to be incomplete). */
11367 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11369 struct symbol
*sym
;
11371 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11372 that should be compiled with debugging information. As a result, we
11373 expect to find that symbol in the symtabs. */
11375 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11378 /* Perhaps we did not find our symbol because the Ada runtime was
11379 compiled without debugging info, or simply stripped of it.
11380 It happens on some GNU/Linux distributions for instance, where
11381 users have to install a separate debug package in order to get
11382 the runtime's debugging info. In that situation, let the user
11383 know why we cannot insert an Ada exception catchpoint.
11385 Note: Just for the purpose of inserting our Ada exception
11386 catchpoint, we could rely purely on the associated minimal symbol.
11387 But we would be operating in degraded mode anyway, since we are
11388 still lacking the debugging info needed later on to extract
11389 the name of the exception being raised (this name is printed in
11390 the catchpoint message, and is also used when trying to catch
11391 a specific exception). We do not handle this case for now. */
11392 struct bound_minimal_symbol msym
11393 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11395 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11396 error (_("Your Ada runtime appears to be missing some debugging "
11397 "information.\nCannot insert Ada exception catchpoint "
11398 "in this configuration."));
11403 /* Make sure that the symbol we found corresponds to a function. */
11405 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11406 error (_("Symbol \"%s\" is not a function (class = %d)"),
11407 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11412 /* Inspect the Ada runtime and determine which exception info structure
11413 should be used to provide support for exception catchpoints.
11415 This function will always set the per-inferior exception_info,
11416 or raise an error. */
11419 ada_exception_support_info_sniffer (void)
11421 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11423 /* If the exception info is already known, then no need to recompute it. */
11424 if (data
->exception_info
!= NULL
)
11427 /* Check the latest (default) exception support info. */
11428 if (ada_has_this_exception_support (&default_exception_support_info
))
11430 data
->exception_info
= &default_exception_support_info
;
11434 /* Try our fallback exception suport info. */
11435 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11437 data
->exception_info
= &exception_support_info_fallback
;
11441 /* Sometimes, it is normal for us to not be able to find the routine
11442 we are looking for. This happens when the program is linked with
11443 the shared version of the GNAT runtime, and the program has not been
11444 started yet. Inform the user of these two possible causes if
11447 if (ada_update_initial_language (language_unknown
) != language_ada
)
11448 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11450 /* If the symbol does not exist, then check that the program is
11451 already started, to make sure that shared libraries have been
11452 loaded. If it is not started, this may mean that the symbol is
11453 in a shared library. */
11455 if (ptid_get_pid (inferior_ptid
) == 0)
11456 error (_("Unable to insert catchpoint. Try to start the program first."));
11458 /* At this point, we know that we are debugging an Ada program and
11459 that the inferior has been started, but we still are not able to
11460 find the run-time symbols. That can mean that we are in
11461 configurable run time mode, or that a-except as been optimized
11462 out by the linker... In any case, at this point it is not worth
11463 supporting this feature. */
11465 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11468 /* True iff FRAME is very likely to be that of a function that is
11469 part of the runtime system. This is all very heuristic, but is
11470 intended to be used as advice as to what frames are uninteresting
11474 is_known_support_routine (struct frame_info
*frame
)
11476 struct symtab_and_line sal
;
11478 enum language func_lang
;
11480 const char *fullname
;
11482 /* If this code does not have any debugging information (no symtab),
11483 This cannot be any user code. */
11485 find_frame_sal (frame
, &sal
);
11486 if (sal
.symtab
== NULL
)
11489 /* If there is a symtab, but the associated source file cannot be
11490 located, then assume this is not user code: Selecting a frame
11491 for which we cannot display the code would not be very helpful
11492 for the user. This should also take care of case such as VxWorks
11493 where the kernel has some debugging info provided for a few units. */
11495 fullname
= symtab_to_fullname (sal
.symtab
);
11496 if (access (fullname
, R_OK
) != 0)
11499 /* Check the unit filename againt the Ada runtime file naming.
11500 We also check the name of the objfile against the name of some
11501 known system libraries that sometimes come with debugging info
11504 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11506 re_comp (known_runtime_file_name_patterns
[i
]);
11507 if (re_exec (lbasename (sal
.symtab
->filename
)))
11509 if (sal
.symtab
->objfile
!= NULL
11510 && re_exec (objfile_name (sal
.symtab
->objfile
)))
11514 /* Check whether the function is a GNAT-generated entity. */
11516 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11517 if (func_name
== NULL
)
11520 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11522 re_comp (known_auxiliary_function_name_patterns
[i
]);
11523 if (re_exec (func_name
))
11534 /* Find the first frame that contains debugging information and that is not
11535 part of the Ada run-time, starting from FI and moving upward. */
11538 ada_find_printable_frame (struct frame_info
*fi
)
11540 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11542 if (!is_known_support_routine (fi
))
11551 /* Assuming that the inferior just triggered an unhandled exception
11552 catchpoint, return the address in inferior memory where the name
11553 of the exception is stored.
11555 Return zero if the address could not be computed. */
11558 ada_unhandled_exception_name_addr (void)
11560 return parse_and_eval_address ("e.full_name");
11563 /* Same as ada_unhandled_exception_name_addr, except that this function
11564 should be used when the inferior uses an older version of the runtime,
11565 where the exception name needs to be extracted from a specific frame
11566 several frames up in the callstack. */
11569 ada_unhandled_exception_name_addr_from_raise (void)
11572 struct frame_info
*fi
;
11573 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11574 struct cleanup
*old_chain
;
11576 /* To determine the name of this exception, we need to select
11577 the frame corresponding to RAISE_SYM_NAME. This frame is
11578 at least 3 levels up, so we simply skip the first 3 frames
11579 without checking the name of their associated function. */
11580 fi
= get_current_frame ();
11581 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11583 fi
= get_prev_frame (fi
);
11585 old_chain
= make_cleanup (null_cleanup
, NULL
);
11589 enum language func_lang
;
11591 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11592 if (func_name
!= NULL
)
11594 make_cleanup (xfree
, func_name
);
11596 if (strcmp (func_name
,
11597 data
->exception_info
->catch_exception_sym
) == 0)
11598 break; /* We found the frame we were looking for... */
11599 fi
= get_prev_frame (fi
);
11602 do_cleanups (old_chain
);
11608 return parse_and_eval_address ("id.full_name");
11611 /* Assuming the inferior just triggered an Ada exception catchpoint
11612 (of any type), return the address in inferior memory where the name
11613 of the exception is stored, if applicable.
11615 Return zero if the address could not be computed, or if not relevant. */
11618 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11619 struct breakpoint
*b
)
11621 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11625 case ada_catch_exception
:
11626 return (parse_and_eval_address ("e.full_name"));
11629 case ada_catch_exception_unhandled
:
11630 return data
->exception_info
->unhandled_exception_name_addr ();
11633 case ada_catch_assert
:
11634 return 0; /* Exception name is not relevant in this case. */
11638 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11642 return 0; /* Should never be reached. */
11645 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11646 any error that ada_exception_name_addr_1 might cause to be thrown.
11647 When an error is intercepted, a warning with the error message is printed,
11648 and zero is returned. */
11651 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11652 struct breakpoint
*b
)
11654 volatile struct gdb_exception e
;
11655 CORE_ADDR result
= 0;
11657 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11659 result
= ada_exception_name_addr_1 (ex
, b
);
11664 warning (_("failed to get exception name: %s"), e
.message
);
11671 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11673 /* Ada catchpoints.
11675 In the case of catchpoints on Ada exceptions, the catchpoint will
11676 stop the target on every exception the program throws. When a user
11677 specifies the name of a specific exception, we translate this
11678 request into a condition expression (in text form), and then parse
11679 it into an expression stored in each of the catchpoint's locations.
11680 We then use this condition to check whether the exception that was
11681 raised is the one the user is interested in. If not, then the
11682 target is resumed again. We store the name of the requested
11683 exception, in order to be able to re-set the condition expression
11684 when symbols change. */
11686 /* An instance of this type is used to represent an Ada catchpoint
11687 breakpoint location. It includes a "struct bp_location" as a kind
11688 of base class; users downcast to "struct bp_location *" when
11691 struct ada_catchpoint_location
11693 /* The base class. */
11694 struct bp_location base
;
11696 /* The condition that checks whether the exception that was raised
11697 is the specific exception the user specified on catchpoint
11699 struct expression
*excep_cond_expr
;
11702 /* Implement the DTOR method in the bp_location_ops structure for all
11703 Ada exception catchpoint kinds. */
11706 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11708 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11710 xfree (al
->excep_cond_expr
);
11713 /* The vtable to be used in Ada catchpoint locations. */
11715 static const struct bp_location_ops ada_catchpoint_location_ops
=
11717 ada_catchpoint_location_dtor
11720 /* An instance of this type is used to represent an Ada catchpoint.
11721 It includes a "struct breakpoint" as a kind of base class; users
11722 downcast to "struct breakpoint *" when needed. */
11724 struct ada_catchpoint
11726 /* The base class. */
11727 struct breakpoint base
;
11729 /* The name of the specific exception the user specified. */
11730 char *excep_string
;
11733 /* Parse the exception condition string in the context of each of the
11734 catchpoint's locations, and store them for later evaluation. */
11737 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11739 struct cleanup
*old_chain
;
11740 struct bp_location
*bl
;
11743 /* Nothing to do if there's no specific exception to catch. */
11744 if (c
->excep_string
== NULL
)
11747 /* Same if there are no locations... */
11748 if (c
->base
.loc
== NULL
)
11751 /* Compute the condition expression in text form, from the specific
11752 expection we want to catch. */
11753 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11754 old_chain
= make_cleanup (xfree
, cond_string
);
11756 /* Iterate over all the catchpoint's locations, and parse an
11757 expression for each. */
11758 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11760 struct ada_catchpoint_location
*ada_loc
11761 = (struct ada_catchpoint_location
*) bl
;
11762 struct expression
*exp
= NULL
;
11764 if (!bl
->shlib_disabled
)
11766 volatile struct gdb_exception e
;
11770 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11772 exp
= parse_exp_1 (&s
, bl
->address
,
11773 block_for_pc (bl
->address
), 0);
11777 warning (_("failed to reevaluate internal exception condition "
11778 "for catchpoint %d: %s"),
11779 c
->base
.number
, e
.message
);
11780 /* There is a bug in GCC on sparc-solaris when building with
11781 optimization which causes EXP to change unexpectedly
11782 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11783 The problem should be fixed starting with GCC 4.9.
11784 In the meantime, work around it by forcing EXP back
11790 ada_loc
->excep_cond_expr
= exp
;
11793 do_cleanups (old_chain
);
11796 /* Implement the DTOR method in the breakpoint_ops structure for all
11797 exception catchpoint kinds. */
11800 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11802 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11804 xfree (c
->excep_string
);
11806 bkpt_breakpoint_ops
.dtor (b
);
11809 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11810 structure for all exception catchpoint kinds. */
11812 static struct bp_location
*
11813 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11814 struct breakpoint
*self
)
11816 struct ada_catchpoint_location
*loc
;
11818 loc
= XNEW (struct ada_catchpoint_location
);
11819 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11820 loc
->excep_cond_expr
= NULL
;
11824 /* Implement the RE_SET method in the breakpoint_ops structure for all
11825 exception catchpoint kinds. */
11828 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11830 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11832 /* Call the base class's method. This updates the catchpoint's
11834 bkpt_breakpoint_ops
.re_set (b
);
11836 /* Reparse the exception conditional expressions. One for each
11838 create_excep_cond_exprs (c
);
11841 /* Returns true if we should stop for this breakpoint hit. If the
11842 user specified a specific exception, we only want to cause a stop
11843 if the program thrown that exception. */
11846 should_stop_exception (const struct bp_location
*bl
)
11848 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11849 const struct ada_catchpoint_location
*ada_loc
11850 = (const struct ada_catchpoint_location
*) bl
;
11851 volatile struct gdb_exception ex
;
11854 /* With no specific exception, should always stop. */
11855 if (c
->excep_string
== NULL
)
11858 if (ada_loc
->excep_cond_expr
== NULL
)
11860 /* We will have a NULL expression if back when we were creating
11861 the expressions, this location's had failed to parse. */
11866 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11868 struct value
*mark
;
11870 mark
= value_mark ();
11871 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11872 value_free_to_mark (mark
);
11875 exception_fprintf (gdb_stderr
, ex
,
11876 _("Error in testing exception condition:\n"));
11880 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11881 for all exception catchpoint kinds. */
11884 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11886 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11889 /* Implement the PRINT_IT method in the breakpoint_ops structure
11890 for all exception catchpoint kinds. */
11892 static enum print_stop_action
11893 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11895 struct ui_out
*uiout
= current_uiout
;
11896 struct breakpoint
*b
= bs
->breakpoint_at
;
11898 annotate_catchpoint (b
->number
);
11900 if (ui_out_is_mi_like_p (uiout
))
11902 ui_out_field_string (uiout
, "reason",
11903 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11904 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11907 ui_out_text (uiout
,
11908 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11909 : "\nCatchpoint ");
11910 ui_out_field_int (uiout
, "bkptno", b
->number
);
11911 ui_out_text (uiout
, ", ");
11915 case ada_catch_exception
:
11916 case ada_catch_exception_unhandled
:
11918 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11919 char exception_name
[256];
11923 read_memory (addr
, (gdb_byte
*) exception_name
,
11924 sizeof (exception_name
) - 1);
11925 exception_name
[sizeof (exception_name
) - 1] = '\0';
11929 /* For some reason, we were unable to read the exception
11930 name. This could happen if the Runtime was compiled
11931 without debugging info, for instance. In that case,
11932 just replace the exception name by the generic string
11933 "exception" - it will read as "an exception" in the
11934 notification we are about to print. */
11935 memcpy (exception_name
, "exception", sizeof ("exception"));
11937 /* In the case of unhandled exception breakpoints, we print
11938 the exception name as "unhandled EXCEPTION_NAME", to make
11939 it clearer to the user which kind of catchpoint just got
11940 hit. We used ui_out_text to make sure that this extra
11941 info does not pollute the exception name in the MI case. */
11942 if (ex
== ada_catch_exception_unhandled
)
11943 ui_out_text (uiout
, "unhandled ");
11944 ui_out_field_string (uiout
, "exception-name", exception_name
);
11947 case ada_catch_assert
:
11948 /* In this case, the name of the exception is not really
11949 important. Just print "failed assertion" to make it clearer
11950 that his program just hit an assertion-failure catchpoint.
11951 We used ui_out_text because this info does not belong in
11953 ui_out_text (uiout
, "failed assertion");
11956 ui_out_text (uiout
, " at ");
11957 ada_find_printable_frame (get_current_frame ());
11959 return PRINT_SRC_AND_LOC
;
11962 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11963 for all exception catchpoint kinds. */
11966 print_one_exception (enum ada_exception_catchpoint_kind ex
,
11967 struct breakpoint
*b
, struct bp_location
**last_loc
)
11969 struct ui_out
*uiout
= current_uiout
;
11970 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11971 struct value_print_options opts
;
11973 get_user_print_options (&opts
);
11974 if (opts
.addressprint
)
11976 annotate_field (4);
11977 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11980 annotate_field (5);
11981 *last_loc
= b
->loc
;
11984 case ada_catch_exception
:
11985 if (c
->excep_string
!= NULL
)
11987 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11989 ui_out_field_string (uiout
, "what", msg
);
11993 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11997 case ada_catch_exception_unhandled
:
11998 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
12001 case ada_catch_assert
:
12002 ui_out_field_string (uiout
, "what", "failed Ada assertions");
12006 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12011 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12012 for all exception catchpoint kinds. */
12015 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
12016 struct breakpoint
*b
)
12018 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12019 struct ui_out
*uiout
= current_uiout
;
12021 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
12022 : _("Catchpoint "));
12023 ui_out_field_int (uiout
, "bkptno", b
->number
);
12024 ui_out_text (uiout
, ": ");
12028 case ada_catch_exception
:
12029 if (c
->excep_string
!= NULL
)
12031 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
12032 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
12034 ui_out_text (uiout
, info
);
12035 do_cleanups (old_chain
);
12038 ui_out_text (uiout
, _("all Ada exceptions"));
12041 case ada_catch_exception_unhandled
:
12042 ui_out_text (uiout
, _("unhandled Ada exceptions"));
12045 case ada_catch_assert
:
12046 ui_out_text (uiout
, _("failed Ada assertions"));
12050 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12055 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12056 for all exception catchpoint kinds. */
12059 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
12060 struct breakpoint
*b
, struct ui_file
*fp
)
12062 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12066 case ada_catch_exception
:
12067 fprintf_filtered (fp
, "catch exception");
12068 if (c
->excep_string
!= NULL
)
12069 fprintf_filtered (fp
, " %s", c
->excep_string
);
12072 case ada_catch_exception_unhandled
:
12073 fprintf_filtered (fp
, "catch exception unhandled");
12076 case ada_catch_assert
:
12077 fprintf_filtered (fp
, "catch assert");
12081 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12083 print_recreate_thread (b
, fp
);
12086 /* Virtual table for "catch exception" breakpoints. */
12089 dtor_catch_exception (struct breakpoint
*b
)
12091 dtor_exception (ada_catch_exception
, b
);
12094 static struct bp_location
*
12095 allocate_location_catch_exception (struct breakpoint
*self
)
12097 return allocate_location_exception (ada_catch_exception
, self
);
12101 re_set_catch_exception (struct breakpoint
*b
)
12103 re_set_exception (ada_catch_exception
, b
);
12107 check_status_catch_exception (bpstat bs
)
12109 check_status_exception (ada_catch_exception
, bs
);
12112 static enum print_stop_action
12113 print_it_catch_exception (bpstat bs
)
12115 return print_it_exception (ada_catch_exception
, bs
);
12119 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12121 print_one_exception (ada_catch_exception
, b
, last_loc
);
12125 print_mention_catch_exception (struct breakpoint
*b
)
12127 print_mention_exception (ada_catch_exception
, b
);
12131 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12133 print_recreate_exception (ada_catch_exception
, b
, fp
);
12136 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12138 /* Virtual table for "catch exception unhandled" breakpoints. */
12141 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12143 dtor_exception (ada_catch_exception_unhandled
, b
);
12146 static struct bp_location
*
12147 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12149 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12153 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12155 re_set_exception (ada_catch_exception_unhandled
, b
);
12159 check_status_catch_exception_unhandled (bpstat bs
)
12161 check_status_exception (ada_catch_exception_unhandled
, bs
);
12164 static enum print_stop_action
12165 print_it_catch_exception_unhandled (bpstat bs
)
12167 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12171 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12172 struct bp_location
**last_loc
)
12174 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12178 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12180 print_mention_exception (ada_catch_exception_unhandled
, b
);
12184 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12185 struct ui_file
*fp
)
12187 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12190 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12192 /* Virtual table for "catch assert" breakpoints. */
12195 dtor_catch_assert (struct breakpoint
*b
)
12197 dtor_exception (ada_catch_assert
, b
);
12200 static struct bp_location
*
12201 allocate_location_catch_assert (struct breakpoint
*self
)
12203 return allocate_location_exception (ada_catch_assert
, self
);
12207 re_set_catch_assert (struct breakpoint
*b
)
12209 re_set_exception (ada_catch_assert
, b
);
12213 check_status_catch_assert (bpstat bs
)
12215 check_status_exception (ada_catch_assert
, bs
);
12218 static enum print_stop_action
12219 print_it_catch_assert (bpstat bs
)
12221 return print_it_exception (ada_catch_assert
, bs
);
12225 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12227 print_one_exception (ada_catch_assert
, b
, last_loc
);
12231 print_mention_catch_assert (struct breakpoint
*b
)
12233 print_mention_exception (ada_catch_assert
, b
);
12237 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12239 print_recreate_exception (ada_catch_assert
, b
, fp
);
12242 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12244 /* Return a newly allocated copy of the first space-separated token
12245 in ARGSP, and then adjust ARGSP to point immediately after that
12248 Return NULL if ARGPS does not contain any more tokens. */
12251 ada_get_next_arg (char **argsp
)
12253 char *args
= *argsp
;
12257 args
= skip_spaces (args
);
12258 if (args
[0] == '\0')
12259 return NULL
; /* No more arguments. */
12261 /* Find the end of the current argument. */
12263 end
= skip_to_space (args
);
12265 /* Adjust ARGSP to point to the start of the next argument. */
12269 /* Make a copy of the current argument and return it. */
12271 result
= xmalloc (end
- args
+ 1);
12272 strncpy (result
, args
, end
- args
);
12273 result
[end
- args
] = '\0';
12278 /* Split the arguments specified in a "catch exception" command.
12279 Set EX to the appropriate catchpoint type.
12280 Set EXCEP_STRING to the name of the specific exception if
12281 specified by the user.
12282 If a condition is found at the end of the arguments, the condition
12283 expression is stored in COND_STRING (memory must be deallocated
12284 after use). Otherwise COND_STRING is set to NULL. */
12287 catch_ada_exception_command_split (char *args
,
12288 enum ada_exception_catchpoint_kind
*ex
,
12289 char **excep_string
,
12290 char **cond_string
)
12292 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12293 char *exception_name
;
12296 exception_name
= ada_get_next_arg (&args
);
12297 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12299 /* This is not an exception name; this is the start of a condition
12300 expression for a catchpoint on all exceptions. So, "un-get"
12301 this token, and set exception_name to NULL. */
12302 xfree (exception_name
);
12303 exception_name
= NULL
;
12306 make_cleanup (xfree
, exception_name
);
12308 /* Check to see if we have a condition. */
12310 args
= skip_spaces (args
);
12311 if (strncmp (args
, "if", 2) == 0
12312 && (isspace (args
[2]) || args
[2] == '\0'))
12315 args
= skip_spaces (args
);
12317 if (args
[0] == '\0')
12318 error (_("Condition missing after `if' keyword"));
12319 cond
= xstrdup (args
);
12320 make_cleanup (xfree
, cond
);
12322 args
+= strlen (args
);
12325 /* Check that we do not have any more arguments. Anything else
12328 if (args
[0] != '\0')
12329 error (_("Junk at end of expression"));
12331 discard_cleanups (old_chain
);
12333 if (exception_name
== NULL
)
12335 /* Catch all exceptions. */
12336 *ex
= ada_catch_exception
;
12337 *excep_string
= NULL
;
12339 else if (strcmp (exception_name
, "unhandled") == 0)
12341 /* Catch unhandled exceptions. */
12342 *ex
= ada_catch_exception_unhandled
;
12343 *excep_string
= NULL
;
12347 /* Catch a specific exception. */
12348 *ex
= ada_catch_exception
;
12349 *excep_string
= exception_name
;
12351 *cond_string
= cond
;
12354 /* Return the name of the symbol on which we should break in order to
12355 implement a catchpoint of the EX kind. */
12357 static const char *
12358 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12360 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12362 gdb_assert (data
->exception_info
!= NULL
);
12366 case ada_catch_exception
:
12367 return (data
->exception_info
->catch_exception_sym
);
12369 case ada_catch_exception_unhandled
:
12370 return (data
->exception_info
->catch_exception_unhandled_sym
);
12372 case ada_catch_assert
:
12373 return (data
->exception_info
->catch_assert_sym
);
12376 internal_error (__FILE__
, __LINE__
,
12377 _("unexpected catchpoint kind (%d)"), ex
);
12381 /* Return the breakpoint ops "virtual table" used for catchpoints
12384 static const struct breakpoint_ops
*
12385 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12389 case ada_catch_exception
:
12390 return (&catch_exception_breakpoint_ops
);
12392 case ada_catch_exception_unhandled
:
12393 return (&catch_exception_unhandled_breakpoint_ops
);
12395 case ada_catch_assert
:
12396 return (&catch_assert_breakpoint_ops
);
12399 internal_error (__FILE__
, __LINE__
,
12400 _("unexpected catchpoint kind (%d)"), ex
);
12404 /* Return the condition that will be used to match the current exception
12405 being raised with the exception that the user wants to catch. This
12406 assumes that this condition is used when the inferior just triggered
12407 an exception catchpoint.
12409 The string returned is a newly allocated string that needs to be
12410 deallocated later. */
12413 ada_exception_catchpoint_cond_string (const char *excep_string
)
12417 /* The standard exceptions are a special case. They are defined in
12418 runtime units that have been compiled without debugging info; if
12419 EXCEP_STRING is the not-fully-qualified name of a standard
12420 exception (e.g. "constraint_error") then, during the evaluation
12421 of the condition expression, the symbol lookup on this name would
12422 *not* return this standard exception. The catchpoint condition
12423 may then be set only on user-defined exceptions which have the
12424 same not-fully-qualified name (e.g. my_package.constraint_error).
12426 To avoid this unexcepted behavior, these standard exceptions are
12427 systematically prefixed by "standard". This means that "catch
12428 exception constraint_error" is rewritten into "catch exception
12429 standard.constraint_error".
12431 If an exception named contraint_error is defined in another package of
12432 the inferior program, then the only way to specify this exception as a
12433 breakpoint condition is to use its fully-qualified named:
12434 e.g. my_package.constraint_error. */
12436 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12438 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12440 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12444 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12447 /* Return the symtab_and_line that should be used to insert an exception
12448 catchpoint of the TYPE kind.
12450 EXCEP_STRING should contain the name of a specific exception that
12451 the catchpoint should catch, or NULL otherwise.
12453 ADDR_STRING returns the name of the function where the real
12454 breakpoint that implements the catchpoints is set, depending on the
12455 type of catchpoint we need to create. */
12457 static struct symtab_and_line
12458 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12459 char **addr_string
, const struct breakpoint_ops
**ops
)
12461 const char *sym_name
;
12462 struct symbol
*sym
;
12464 /* First, find out which exception support info to use. */
12465 ada_exception_support_info_sniffer ();
12467 /* Then lookup the function on which we will break in order to catch
12468 the Ada exceptions requested by the user. */
12469 sym_name
= ada_exception_sym_name (ex
);
12470 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12472 /* We can assume that SYM is not NULL at this stage. If the symbol
12473 did not exist, ada_exception_support_info_sniffer would have
12474 raised an exception.
12476 Also, ada_exception_support_info_sniffer should have already
12477 verified that SYM is a function symbol. */
12478 gdb_assert (sym
!= NULL
);
12479 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12481 /* Set ADDR_STRING. */
12482 *addr_string
= xstrdup (sym_name
);
12485 *ops
= ada_exception_breakpoint_ops (ex
);
12487 return find_function_start_sal (sym
, 1);
12490 /* Create an Ada exception catchpoint.
12492 EX_KIND is the kind of exception catchpoint to be created.
12494 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12495 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12496 of the exception to which this catchpoint applies. When not NULL,
12497 the string must be allocated on the heap, and its deallocation
12498 is no longer the responsibility of the caller.
12500 COND_STRING, if not NULL, is the catchpoint condition. This string
12501 must be allocated on the heap, and its deallocation is no longer
12502 the responsibility of the caller.
12504 TEMPFLAG, if nonzero, means that the underlying breakpoint
12505 should be temporary.
12507 FROM_TTY is the usual argument passed to all commands implementations. */
12510 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12511 enum ada_exception_catchpoint_kind ex_kind
,
12512 char *excep_string
,
12518 struct ada_catchpoint
*c
;
12519 char *addr_string
= NULL
;
12520 const struct breakpoint_ops
*ops
= NULL
;
12521 struct symtab_and_line sal
12522 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12524 c
= XNEW (struct ada_catchpoint
);
12525 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12526 ops
, tempflag
, disabled
, from_tty
);
12527 c
->excep_string
= excep_string
;
12528 create_excep_cond_exprs (c
);
12529 if (cond_string
!= NULL
)
12530 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12531 install_breakpoint (0, &c
->base
, 1);
12534 /* Implement the "catch exception" command. */
12537 catch_ada_exception_command (char *arg
, int from_tty
,
12538 struct cmd_list_element
*command
)
12540 struct gdbarch
*gdbarch
= get_current_arch ();
12542 enum ada_exception_catchpoint_kind ex_kind
;
12543 char *excep_string
= NULL
;
12544 char *cond_string
= NULL
;
12546 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12550 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12552 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12553 excep_string
, cond_string
,
12554 tempflag
, 1 /* enabled */,
12558 /* Split the arguments specified in a "catch assert" command.
12560 ARGS contains the command's arguments (or the empty string if
12561 no arguments were passed).
12563 If ARGS contains a condition, set COND_STRING to that condition
12564 (the memory needs to be deallocated after use). */
12567 catch_ada_assert_command_split (char *args
, char **cond_string
)
12569 args
= skip_spaces (args
);
12571 /* Check whether a condition was provided. */
12572 if (strncmp (args
, "if", 2) == 0
12573 && (isspace (args
[2]) || args
[2] == '\0'))
12576 args
= skip_spaces (args
);
12577 if (args
[0] == '\0')
12578 error (_("condition missing after `if' keyword"));
12579 *cond_string
= xstrdup (args
);
12582 /* Otherwise, there should be no other argument at the end of
12584 else if (args
[0] != '\0')
12585 error (_("Junk at end of arguments."));
12588 /* Implement the "catch assert" command. */
12591 catch_assert_command (char *arg
, int from_tty
,
12592 struct cmd_list_element
*command
)
12594 struct gdbarch
*gdbarch
= get_current_arch ();
12596 char *cond_string
= NULL
;
12598 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12602 catch_ada_assert_command_split (arg
, &cond_string
);
12603 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12605 tempflag
, 1 /* enabled */,
12609 /* Return non-zero if the symbol SYM is an Ada exception object. */
12612 ada_is_exception_sym (struct symbol
*sym
)
12614 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12616 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12617 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12618 && SYMBOL_CLASS (sym
) != LOC_CONST
12619 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12620 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12623 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12624 Ada exception object. This matches all exceptions except the ones
12625 defined by the Ada language. */
12628 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12632 if (!ada_is_exception_sym (sym
))
12635 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12636 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12637 return 0; /* A standard exception. */
12639 /* Numeric_Error is also a standard exception, so exclude it.
12640 See the STANDARD_EXC description for more details as to why
12641 this exception is not listed in that array. */
12642 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12648 /* A helper function for qsort, comparing two struct ada_exc_info
12651 The comparison is determined first by exception name, and then
12652 by exception address. */
12655 compare_ada_exception_info (const void *a
, const void *b
)
12657 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12658 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12661 result
= strcmp (exc_a
->name
, exc_b
->name
);
12665 if (exc_a
->addr
< exc_b
->addr
)
12667 if (exc_a
->addr
> exc_b
->addr
)
12673 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12674 routine, but keeping the first SKIP elements untouched.
12676 All duplicates are also removed. */
12679 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12682 struct ada_exc_info
*to_sort
12683 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12685 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12688 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12689 compare_ada_exception_info
);
12691 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12692 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12693 to_sort
[j
++] = to_sort
[i
];
12695 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12698 /* A function intended as the "name_matcher" callback in the struct
12699 quick_symbol_functions' expand_symtabs_matching method.
12701 SEARCH_NAME is the symbol's search name.
12703 If USER_DATA is not NULL, it is a pointer to a regext_t object
12704 used to match the symbol (by natural name). Otherwise, when USER_DATA
12705 is null, no filtering is performed, and all symbols are a positive
12709 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12711 regex_t
*preg
= user_data
;
12716 /* In Ada, the symbol "search name" is a linkage name, whereas
12717 the regular expression used to do the matching refers to
12718 the natural name. So match against the decoded name. */
12719 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12722 /* Add all exceptions defined by the Ada standard whose name match
12723 a regular expression.
12725 If PREG is not NULL, then this regexp_t object is used to
12726 perform the symbol name matching. Otherwise, no name-based
12727 filtering is performed.
12729 EXCEPTIONS is a vector of exceptions to which matching exceptions
12733 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12737 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12740 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12742 struct bound_minimal_symbol msymbol
12743 = ada_lookup_simple_minsym (standard_exc
[i
]);
12745 if (msymbol
.minsym
!= NULL
)
12747 struct ada_exc_info info
12748 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
12750 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12756 /* Add all Ada exceptions defined locally and accessible from the given
12759 If PREG is not NULL, then this regexp_t object is used to
12760 perform the symbol name matching. Otherwise, no name-based
12761 filtering is performed.
12763 EXCEPTIONS is a vector of exceptions to which matching exceptions
12767 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12768 VEC(ada_exc_info
) **exceptions
)
12770 struct block
*block
= get_frame_block (frame
, 0);
12774 struct block_iterator iter
;
12775 struct symbol
*sym
;
12777 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12779 switch (SYMBOL_CLASS (sym
))
12786 if (ada_is_exception_sym (sym
))
12788 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12789 SYMBOL_VALUE_ADDRESS (sym
)};
12791 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12795 if (BLOCK_FUNCTION (block
) != NULL
)
12797 block
= BLOCK_SUPERBLOCK (block
);
12801 /* Add all exceptions defined globally whose name name match
12802 a regular expression, excluding standard exceptions.
12804 The reason we exclude standard exceptions is that they need
12805 to be handled separately: Standard exceptions are defined inside
12806 a runtime unit which is normally not compiled with debugging info,
12807 and thus usually do not show up in our symbol search. However,
12808 if the unit was in fact built with debugging info, we need to
12809 exclude them because they would duplicate the entry we found
12810 during the special loop that specifically searches for those
12811 standard exceptions.
12813 If PREG is not NULL, then this regexp_t object is used to
12814 perform the symbol name matching. Otherwise, no name-based
12815 filtering is performed.
12817 EXCEPTIONS is a vector of exceptions to which matching exceptions
12821 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12823 struct objfile
*objfile
;
12826 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
,
12827 VARIABLES_DOMAIN
, preg
);
12829 ALL_PRIMARY_SYMTABS (objfile
, s
)
12831 struct blockvector
*bv
= BLOCKVECTOR (s
);
12834 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12836 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12837 struct block_iterator iter
;
12838 struct symbol
*sym
;
12840 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12841 if (ada_is_non_standard_exception_sym (sym
)
12843 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
12846 struct ada_exc_info info
12847 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
12849 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12855 /* Implements ada_exceptions_list with the regular expression passed
12856 as a regex_t, rather than a string.
12858 If not NULL, PREG is used to filter out exceptions whose names
12859 do not match. Otherwise, all exceptions are listed. */
12861 static VEC(ada_exc_info
) *
12862 ada_exceptions_list_1 (regex_t
*preg
)
12864 VEC(ada_exc_info
) *result
= NULL
;
12865 struct cleanup
*old_chain
12866 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
12869 /* First, list the known standard exceptions. These exceptions
12870 need to be handled separately, as they are usually defined in
12871 runtime units that have been compiled without debugging info. */
12873 ada_add_standard_exceptions (preg
, &result
);
12875 /* Next, find all exceptions whose scope is local and accessible
12876 from the currently selected frame. */
12878 if (has_stack_frames ())
12880 prev_len
= VEC_length (ada_exc_info
, result
);
12881 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12883 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12884 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12887 /* Add all exceptions whose scope is global. */
12889 prev_len
= VEC_length (ada_exc_info
, result
);
12890 ada_add_global_exceptions (preg
, &result
);
12891 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12892 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12894 discard_cleanups (old_chain
);
12898 /* Return a vector of ada_exc_info.
12900 If REGEXP is NULL, all exceptions are included in the result.
12901 Otherwise, it should contain a valid regular expression,
12902 and only the exceptions whose names match that regular expression
12903 are included in the result.
12905 The exceptions are sorted in the following order:
12906 - Standard exceptions (defined by the Ada language), in
12907 alphabetical order;
12908 - Exceptions only visible from the current frame, in
12909 alphabetical order;
12910 - Exceptions whose scope is global, in alphabetical order. */
12912 VEC(ada_exc_info
) *
12913 ada_exceptions_list (const char *regexp
)
12915 VEC(ada_exc_info
) *result
= NULL
;
12916 struct cleanup
*old_chain
= NULL
;
12919 if (regexp
!= NULL
)
12920 old_chain
= compile_rx_or_error (®
, regexp
,
12921 _("invalid regular expression"));
12923 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
12925 if (old_chain
!= NULL
)
12926 do_cleanups (old_chain
);
12930 /* Implement the "info exceptions" command. */
12933 info_exceptions_command (char *regexp
, int from_tty
)
12935 VEC(ada_exc_info
) *exceptions
;
12936 struct cleanup
*cleanup
;
12937 struct gdbarch
*gdbarch
= get_current_arch ();
12939 struct ada_exc_info
*info
;
12941 exceptions
= ada_exceptions_list (regexp
);
12942 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
12944 if (regexp
!= NULL
)
12946 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12948 printf_filtered (_("All defined Ada exceptions:\n"));
12950 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
12951 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
12953 do_cleanups (cleanup
);
12957 /* Information about operators given special treatment in functions
12959 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12961 #define ADA_OPERATORS \
12962 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12963 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12964 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12965 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12966 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12967 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12968 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12969 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12970 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12971 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12972 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12973 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12974 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12975 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12976 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12977 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12978 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12979 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12980 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12983 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12986 switch (exp
->elts
[pc
- 1].opcode
)
12989 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12992 #define OP_DEFN(op, len, args, binop) \
12993 case op: *oplenp = len; *argsp = args; break;
12999 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13004 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13009 /* Implementation of the exp_descriptor method operator_check. */
13012 ada_operator_check (struct expression
*exp
, int pos
,
13013 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13016 const union exp_element
*const elts
= exp
->elts
;
13017 struct type
*type
= NULL
;
13019 switch (elts
[pos
].opcode
)
13021 case UNOP_IN_RANGE
:
13023 type
= elts
[pos
+ 1].type
;
13027 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13030 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13032 if (type
&& TYPE_OBJFILE (type
)
13033 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13040 ada_op_name (enum exp_opcode opcode
)
13045 return op_name_standard (opcode
);
13047 #define OP_DEFN(op, len, args, binop) case op: return #op;
13052 return "OP_AGGREGATE";
13054 return "OP_CHOICES";
13060 /* As for operator_length, but assumes PC is pointing at the first
13061 element of the operator, and gives meaningful results only for the
13062 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13065 ada_forward_operator_length (struct expression
*exp
, int pc
,
13066 int *oplenp
, int *argsp
)
13068 switch (exp
->elts
[pc
].opcode
)
13071 *oplenp
= *argsp
= 0;
13074 #define OP_DEFN(op, len, args, binop) \
13075 case op: *oplenp = len; *argsp = args; break;
13081 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13086 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13092 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13094 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13102 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13104 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13109 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13113 /* Ada attributes ('Foo). */
13116 case OP_ATR_LENGTH
:
13120 case OP_ATR_MODULUS
:
13127 case UNOP_IN_RANGE
:
13129 /* XXX: gdb_sprint_host_address, type_sprint */
13130 fprintf_filtered (stream
, _("Type @"));
13131 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13132 fprintf_filtered (stream
, " (");
13133 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13134 fprintf_filtered (stream
, ")");
13136 case BINOP_IN_BOUNDS
:
13137 fprintf_filtered (stream
, " (%d)",
13138 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13140 case TERNOP_IN_RANGE
:
13145 case OP_DISCRETE_RANGE
:
13146 case OP_POSITIONAL
:
13153 char *name
= &exp
->elts
[elt
+ 2].string
;
13154 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13156 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13161 return dump_subexp_body_standard (exp
, stream
, elt
);
13165 for (i
= 0; i
< nargs
; i
+= 1)
13166 elt
= dump_subexp (exp
, stream
, elt
);
13171 /* The Ada extension of print_subexp (q.v.). */
13174 ada_print_subexp (struct expression
*exp
, int *pos
,
13175 struct ui_file
*stream
, enum precedence prec
)
13177 int oplen
, nargs
, i
;
13179 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13181 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13188 print_subexp_standard (exp
, pos
, stream
, prec
);
13192 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13195 case BINOP_IN_BOUNDS
:
13196 /* XXX: sprint_subexp */
13197 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13198 fputs_filtered (" in ", stream
);
13199 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13200 fputs_filtered ("'range", stream
);
13201 if (exp
->elts
[pc
+ 1].longconst
> 1)
13202 fprintf_filtered (stream
, "(%ld)",
13203 (long) exp
->elts
[pc
+ 1].longconst
);
13206 case TERNOP_IN_RANGE
:
13207 if (prec
>= PREC_EQUAL
)
13208 fputs_filtered ("(", stream
);
13209 /* XXX: sprint_subexp */
13210 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13211 fputs_filtered (" in ", stream
);
13212 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13213 fputs_filtered (" .. ", stream
);
13214 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13215 if (prec
>= PREC_EQUAL
)
13216 fputs_filtered (")", stream
);
13221 case OP_ATR_LENGTH
:
13225 case OP_ATR_MODULUS
:
13230 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13232 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13233 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13234 &type_print_raw_options
);
13238 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13239 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13244 for (tem
= 1; tem
< nargs
; tem
+= 1)
13246 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13247 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13249 fputs_filtered (")", stream
);
13254 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13255 fputs_filtered ("'(", stream
);
13256 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13257 fputs_filtered (")", stream
);
13260 case UNOP_IN_RANGE
:
13261 /* XXX: sprint_subexp */
13262 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13263 fputs_filtered (" in ", stream
);
13264 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13265 &type_print_raw_options
);
13268 case OP_DISCRETE_RANGE
:
13269 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13270 fputs_filtered ("..", stream
);
13271 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13275 fputs_filtered ("others => ", stream
);
13276 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13280 for (i
= 0; i
< nargs
-1; i
+= 1)
13283 fputs_filtered ("|", stream
);
13284 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13286 fputs_filtered (" => ", stream
);
13287 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13290 case OP_POSITIONAL
:
13291 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13295 fputs_filtered ("(", stream
);
13296 for (i
= 0; i
< nargs
; i
+= 1)
13299 fputs_filtered (", ", stream
);
13300 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13302 fputs_filtered (")", stream
);
13307 /* Table mapping opcodes into strings for printing operators
13308 and precedences of the operators. */
13310 static const struct op_print ada_op_print_tab
[] = {
13311 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13312 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13313 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13314 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13315 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13316 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13317 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13318 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13319 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13320 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13321 {">", BINOP_GTR
, PREC_ORDER
, 0},
13322 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13323 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13324 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13325 {"+", BINOP_ADD
, PREC_ADD
, 0},
13326 {"-", BINOP_SUB
, PREC_ADD
, 0},
13327 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13328 {"*", BINOP_MUL
, PREC_MUL
, 0},
13329 {"/", BINOP_DIV
, PREC_MUL
, 0},
13330 {"rem", BINOP_REM
, PREC_MUL
, 0},
13331 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13332 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13333 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13334 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13335 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13336 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13337 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13338 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13339 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13340 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13341 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13345 enum ada_primitive_types
{
13346 ada_primitive_type_int
,
13347 ada_primitive_type_long
,
13348 ada_primitive_type_short
,
13349 ada_primitive_type_char
,
13350 ada_primitive_type_float
,
13351 ada_primitive_type_double
,
13352 ada_primitive_type_void
,
13353 ada_primitive_type_long_long
,
13354 ada_primitive_type_long_double
,
13355 ada_primitive_type_natural
,
13356 ada_primitive_type_positive
,
13357 ada_primitive_type_system_address
,
13358 nr_ada_primitive_types
13362 ada_language_arch_info (struct gdbarch
*gdbarch
,
13363 struct language_arch_info
*lai
)
13365 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13367 lai
->primitive_type_vector
13368 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13371 lai
->primitive_type_vector
[ada_primitive_type_int
]
13372 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13374 lai
->primitive_type_vector
[ada_primitive_type_long
]
13375 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13376 0, "long_integer");
13377 lai
->primitive_type_vector
[ada_primitive_type_short
]
13378 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13379 0, "short_integer");
13380 lai
->string_char_type
13381 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13382 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13383 lai
->primitive_type_vector
[ada_primitive_type_float
]
13384 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13386 lai
->primitive_type_vector
[ada_primitive_type_double
]
13387 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13388 "long_float", NULL
);
13389 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13390 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13391 0, "long_long_integer");
13392 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13393 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13394 "long_long_float", NULL
);
13395 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13396 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13398 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13399 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13401 lai
->primitive_type_vector
[ada_primitive_type_void
]
13402 = builtin
->builtin_void
;
13404 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13405 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13406 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13407 = "system__address";
13409 lai
->bool_type_symbol
= NULL
;
13410 lai
->bool_type_default
= builtin
->builtin_bool
;
13413 /* Language vector */
13415 /* Not really used, but needed in the ada_language_defn. */
13418 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13420 ada_emit_char (c
, type
, stream
, quoter
, 1);
13424 parse (struct parser_state
*ps
)
13426 warnings_issued
= 0;
13427 return ada_parse (ps
);
13430 static const struct exp_descriptor ada_exp_descriptor
= {
13432 ada_operator_length
,
13433 ada_operator_check
,
13435 ada_dump_subexp_body
,
13436 ada_evaluate_subexp
13439 /* Implement the "la_get_symbol_name_cmp" language_defn method
13442 static symbol_name_cmp_ftype
13443 ada_get_symbol_name_cmp (const char *lookup_name
)
13445 if (should_use_wild_match (lookup_name
))
13448 return compare_names
;
13451 /* Implement the "la_read_var_value" language_defn method for Ada. */
13453 static struct value
*
13454 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13456 struct block
*frame_block
= NULL
;
13457 struct symbol
*renaming_sym
= NULL
;
13459 /* The only case where default_read_var_value is not sufficient
13460 is when VAR is a renaming... */
13462 frame_block
= get_frame_block (frame
, NULL
);
13464 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13465 if (renaming_sym
!= NULL
)
13466 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13468 /* This is a typical case where we expect the default_read_var_value
13469 function to work. */
13470 return default_read_var_value (var
, frame
);
13473 const struct language_defn ada_language_defn
= {
13474 "ada", /* Language name */
13478 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13479 that's not quite what this means. */
13481 macro_expansion_no
,
13482 &ada_exp_descriptor
,
13486 ada_printchar
, /* Print a character constant */
13487 ada_printstr
, /* Function to print string constant */
13488 emit_char
, /* Function to print single char (not used) */
13489 ada_print_type
, /* Print a type using appropriate syntax */
13490 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13491 ada_val_print
, /* Print a value using appropriate syntax */
13492 ada_value_print
, /* Print a top-level value */
13493 ada_read_var_value
, /* la_read_var_value */
13494 NULL
, /* Language specific skip_trampoline */
13495 NULL
, /* name_of_this */
13496 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13497 basic_lookup_transparent_type
, /* lookup_transparent_type */
13498 ada_la_decode
, /* Language specific symbol demangler */
13499 NULL
, /* Language specific
13500 class_name_from_physname */
13501 ada_op_print_tab
, /* expression operators for printing */
13502 0, /* c-style arrays */
13503 1, /* String lower bound */
13504 ada_get_gdb_completer_word_break_characters
,
13505 ada_make_symbol_completion_list
,
13506 ada_language_arch_info
,
13507 ada_print_array_index
,
13508 default_pass_by_reference
,
13510 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13511 ada_iterate_over_symbols
,
13516 /* Provide a prototype to silence -Wmissing-prototypes. */
13517 extern initialize_file_ftype _initialize_ada_language
;
13519 /* Command-list for the "set/show ada" prefix command. */
13520 static struct cmd_list_element
*set_ada_list
;
13521 static struct cmd_list_element
*show_ada_list
;
13523 /* Implement the "set ada" prefix command. */
13526 set_ada_command (char *arg
, int from_tty
)
13528 printf_unfiltered (_(\
13529 "\"set ada\" must be followed by the name of a setting.\n"));
13530 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
13533 /* Implement the "show ada" prefix command. */
13536 show_ada_command (char *args
, int from_tty
)
13538 cmd_show_list (show_ada_list
, from_tty
, "");
13542 initialize_ada_catchpoint_ops (void)
13544 struct breakpoint_ops
*ops
;
13546 initialize_breakpoint_ops ();
13548 ops
= &catch_exception_breakpoint_ops
;
13549 *ops
= bkpt_breakpoint_ops
;
13550 ops
->dtor
= dtor_catch_exception
;
13551 ops
->allocate_location
= allocate_location_catch_exception
;
13552 ops
->re_set
= re_set_catch_exception
;
13553 ops
->check_status
= check_status_catch_exception
;
13554 ops
->print_it
= print_it_catch_exception
;
13555 ops
->print_one
= print_one_catch_exception
;
13556 ops
->print_mention
= print_mention_catch_exception
;
13557 ops
->print_recreate
= print_recreate_catch_exception
;
13559 ops
= &catch_exception_unhandled_breakpoint_ops
;
13560 *ops
= bkpt_breakpoint_ops
;
13561 ops
->dtor
= dtor_catch_exception_unhandled
;
13562 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13563 ops
->re_set
= re_set_catch_exception_unhandled
;
13564 ops
->check_status
= check_status_catch_exception_unhandled
;
13565 ops
->print_it
= print_it_catch_exception_unhandled
;
13566 ops
->print_one
= print_one_catch_exception_unhandled
;
13567 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13568 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13570 ops
= &catch_assert_breakpoint_ops
;
13571 *ops
= bkpt_breakpoint_ops
;
13572 ops
->dtor
= dtor_catch_assert
;
13573 ops
->allocate_location
= allocate_location_catch_assert
;
13574 ops
->re_set
= re_set_catch_assert
;
13575 ops
->check_status
= check_status_catch_assert
;
13576 ops
->print_it
= print_it_catch_assert
;
13577 ops
->print_one
= print_one_catch_assert
;
13578 ops
->print_mention
= print_mention_catch_assert
;
13579 ops
->print_recreate
= print_recreate_catch_assert
;
13582 /* This module's 'new_objfile' observer. */
13585 ada_new_objfile_observer (struct objfile
*objfile
)
13587 ada_clear_symbol_cache ();
13590 /* This module's 'free_objfile' observer. */
13593 ada_free_objfile_observer (struct objfile
*objfile
)
13595 ada_clear_symbol_cache ();
13599 _initialize_ada_language (void)
13601 add_language (&ada_language_defn
);
13603 initialize_ada_catchpoint_ops ();
13605 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13606 _("Prefix command for changing Ada-specfic settings"),
13607 &set_ada_list
, "set ada ", 0, &setlist
);
13609 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13610 _("Generic command for showing Ada-specific settings."),
13611 &show_ada_list
, "show ada ", 0, &showlist
);
13613 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13614 &trust_pad_over_xvs
, _("\
13615 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13616 Show whether an optimization trusting PAD types over XVS types is activated"),
13618 This is related to the encoding used by the GNAT compiler. The debugger\n\
13619 should normally trust the contents of PAD types, but certain older versions\n\
13620 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13621 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13622 work around this bug. It is always safe to turn this option \"off\", but\n\
13623 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13624 this option to \"off\" unless necessary."),
13625 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13627 add_catch_command ("exception", _("\
13628 Catch Ada exceptions, when raised.\n\
13629 With an argument, catch only exceptions with the given name."),
13630 catch_ada_exception_command
,
13634 add_catch_command ("assert", _("\
13635 Catch failed Ada assertions, when raised.\n\
13636 With an argument, catch only exceptions with the given name."),
13637 catch_assert_command
,
13642 varsize_limit
= 65536;
13644 add_info ("exceptions", info_exceptions_command
,
13646 List all Ada exception names.\n\
13647 If a regular expression is passed as an argument, only those matching\n\
13648 the regular expression are listed."));
13650 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13651 _("Set Ada maintenance-related variables."),
13652 &maint_set_ada_cmdlist
, "maintenance set ada ",
13653 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13655 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13656 _("Show Ada maintenance-related variables"),
13657 &maint_show_ada_cmdlist
, "maintenance show ada ",
13658 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13660 add_setshow_boolean_cmd
13661 ("ignore-descriptive-types", class_maintenance
,
13662 &ada_ignore_descriptive_types_p
,
13663 _("Set whether descriptive types generated by GNAT should be ignored."),
13664 _("Show whether descriptive types generated by GNAT should be ignored."),
13666 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13667 DWARF attribute."),
13668 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13670 obstack_init (&symbol_list_obstack
);
13672 decoded_names_store
= htab_create_alloc
13673 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13674 NULL
, xcalloc
, xfree
);
13676 /* The ada-lang observers. */
13677 observer_attach_new_objfile (ada_new_objfile_observer
);
13678 observer_attach_free_objfile (ada_free_objfile_observer
);
13679 observer_attach_inferior_exit (ada_inferior_exit
);
13681 /* Setup various context-specific data. */
13683 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13684 ada_pspace_data_handle
13685 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);