1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2020 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/>. */
23 #include "gdb_regex.h"
28 #include "expression.h"
29 #include "parser-defs.h"
35 #include "breakpoint.h"
38 #include "gdb_obstack.h"
40 #include "completer.h"
47 #include "observable.h"
49 #include "typeprint.h"
50 #include "namespace.h"
51 #include "cli/cli-style.h"
54 #include "mi/mi-common.h"
55 #include "arch-utils.h"
56 #include "cli/cli-utils.h"
57 #include "gdbsupport/function-view.h"
58 #include "gdbsupport/byte-vector.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static struct type
*desc_base_type (struct type
*);
71 static struct type
*desc_bounds_type (struct type
*);
73 static struct value
*desc_bounds (struct value
*);
75 static int fat_pntr_bounds_bitpos (struct type
*);
77 static int fat_pntr_bounds_bitsize (struct type
*);
79 static struct type
*desc_data_target_type (struct type
*);
81 static struct value
*desc_data (struct value
*);
83 static int fat_pntr_data_bitpos (struct type
*);
85 static int fat_pntr_data_bitsize (struct type
*);
87 static struct value
*desc_one_bound (struct value
*, int, int);
89 static int desc_bound_bitpos (struct type
*, int, int);
91 static int desc_bound_bitsize (struct type
*, int, int);
93 static struct type
*desc_index_type (struct type
*, int);
95 static int desc_arity (struct type
*);
97 static int ada_type_match (struct type
*, struct type
*, int);
99 static int ada_args_match (struct symbol
*, struct value
**, int);
101 static struct value
*make_array_descriptor (struct type
*, struct value
*);
103 static void ada_add_block_symbols (struct obstack
*,
104 const struct block
*,
105 const lookup_name_info
&lookup_name
,
106 domain_enum
, struct objfile
*);
108 static void ada_add_all_symbols (struct obstack
*, const struct block
*,
109 const lookup_name_info
&lookup_name
,
110 domain_enum
, int, int *);
112 static int is_nonfunction (struct block_symbol
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
115 const struct block
*);
117 static int num_defns_collected (struct obstack
*);
119 static struct block_symbol
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (expression_up
*, int *, int,
123 innermost_block_tracker
*);
125 static void replace_operator_with_call (expression_up
*, int, int, int,
126 struct symbol
*, const struct block
*);
128 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
130 static const char *ada_op_name (enum exp_opcode
);
132 static const char *ada_decoded_op_name (enum exp_opcode
);
134 static int numeric_type_p (struct type
*);
136 static int integer_type_p (struct type
*);
138 static int scalar_type_p (struct type
*);
140 static int discrete_type_p (struct type
*);
142 static struct type
*ada_lookup_struct_elt_type (struct type
*, const char *,
145 static struct value
*evaluate_subexp_type (struct expression
*, int *);
147 static struct type
*ada_find_parallel_type_with_name (struct type
*,
150 static int is_dynamic_field (struct type
*, int);
152 static struct type
*to_fixed_variant_branch_type (struct type
*,
154 CORE_ADDR
, struct value
*);
156 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
158 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
160 static struct type
*to_static_fixed_type (struct type
*);
161 static struct type
*static_unwrap_type (struct type
*type
);
163 static struct value
*unwrap_value (struct value
*);
165 static struct type
*constrained_packed_array_type (struct type
*, long *);
167 static struct type
*decode_constrained_packed_array_type (struct type
*);
169 static long decode_packed_array_bitsize (struct type
*);
171 static struct value
*decode_constrained_packed_array (struct value
*);
173 static int ada_is_packed_array_type (struct type
*);
175 static int ada_is_unconstrained_packed_array_type (struct type
*);
177 static struct value
*value_subscript_packed (struct value
*, int,
180 static struct value
*coerce_unspec_val_to_type (struct value
*,
183 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
185 static int equiv_types (struct type
*, struct type
*);
187 static int is_name_suffix (const char *);
189 static int advance_wild_match (const char **, const char *, int);
191 static bool wild_match (const char *name
, const char *patn
);
193 static struct value
*ada_coerce_ref (struct value
*);
195 static LONGEST
pos_atr (struct value
*);
197 static struct value
*value_pos_atr (struct type
*, struct value
*);
199 static struct value
*val_atr (struct type
*, LONGEST
);
201 static struct value
*value_val_atr (struct type
*, struct value
*);
203 static struct symbol
*standard_lookup (const char *, const struct block
*,
206 static struct value
*ada_search_struct_field (const char *, struct value
*, int,
209 static int find_struct_field (const char *, struct type
*, int,
210 struct type
**, int *, int *, int *, int *);
212 static int ada_resolve_function (struct block_symbol
*, int,
213 struct value
**, int, const char *,
216 static int ada_is_direct_array_type (struct type
*);
218 static void ada_language_arch_info (struct gdbarch
*,
219 struct language_arch_info
*);
221 static struct value
*ada_index_struct_field (int, struct value
*, int,
224 static struct value
*assign_aggregate (struct value
*, struct value
*,
228 static void aggregate_assign_from_choices (struct value
*, struct value
*,
230 int *, LONGEST
*, int *,
231 int, LONGEST
, LONGEST
);
233 static void aggregate_assign_positional (struct value
*, struct value
*,
235 int *, LONGEST
*, int *, int,
239 static void aggregate_assign_others (struct value
*, struct value
*,
241 int *, LONGEST
*, int, LONGEST
, LONGEST
);
244 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
247 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
250 static void ada_forward_operator_length (struct expression
*, int, int *,
253 static struct type
*ada_find_any_type (const char *name
);
255 static symbol_name_matcher_ftype
*ada_get_symbol_name_matcher
256 (const lookup_name_info
&lookup_name
);
260 /* The result of a symbol lookup to be stored in our symbol cache. */
264 /* The name used to perform the lookup. */
266 /* The namespace used during the lookup. */
268 /* The symbol returned by the lookup, or NULL if no matching symbol
271 /* The block where the symbol was found, or NULL if no matching
273 const struct block
*block
;
274 /* A pointer to the next entry with the same hash. */
275 struct cache_entry
*next
;
278 /* The Ada symbol cache, used to store the result of Ada-mode symbol
279 lookups in the course of executing the user's commands.
281 The cache is implemented using a simple, fixed-sized hash.
282 The size is fixed on the grounds that there are not likely to be
283 all that many symbols looked up during any given session, regardless
284 of the size of the symbol table. If we decide to go to a resizable
285 table, let's just use the stuff from libiberty instead. */
287 #define HASH_SIZE 1009
289 struct ada_symbol_cache
291 /* An obstack used to store the entries in our cache. */
292 struct obstack cache_space
;
294 /* The root of the hash table used to implement our symbol cache. */
295 struct cache_entry
*root
[HASH_SIZE
];
298 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
300 /* Maximum-sized dynamic type. */
301 static unsigned int varsize_limit
;
303 static const char ada_completer_word_break_characters
[] =
305 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
307 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
310 /* The name of the symbol to use to get the name of the main subprogram. */
311 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
312 = "__gnat_ada_main_program_name";
314 /* Limit on the number of warnings to raise per expression evaluation. */
315 static int warning_limit
= 2;
317 /* Number of warning messages issued; reset to 0 by cleanups after
318 expression evaluation. */
319 static int warnings_issued
= 0;
321 static const char *known_runtime_file_name_patterns
[] = {
322 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
325 static const char *known_auxiliary_function_name_patterns
[] = {
326 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
329 /* Maintenance-related settings for this module. */
331 static struct cmd_list_element
*maint_set_ada_cmdlist
;
332 static struct cmd_list_element
*maint_show_ada_cmdlist
;
334 /* The "maintenance ada set/show ignore-descriptive-type" value. */
336 static bool ada_ignore_descriptive_types_p
= false;
338 /* Inferior-specific data. */
340 /* Per-inferior data for this module. */
342 struct ada_inferior_data
344 /* The ada__tags__type_specific_data type, which is used when decoding
345 tagged types. With older versions of GNAT, this type was directly
346 accessible through a component ("tsd") in the object tag. But this
347 is no longer the case, so we cache it for each inferior. */
348 struct type
*tsd_type
= nullptr;
350 /* The exception_support_info data. This data is used to determine
351 how to implement support for Ada exception catchpoints in a given
353 const struct exception_support_info
*exception_info
= nullptr;
356 /* Our key to this module's inferior data. */
357 static const struct inferior_key
<ada_inferior_data
> ada_inferior_data
;
359 /* Return our inferior data for the given inferior (INF).
361 This function always returns a valid pointer to an allocated
362 ada_inferior_data structure. If INF's inferior data has not
363 been previously set, this functions creates a new one with all
364 fields set to zero, sets INF's inferior to it, and then returns
365 a pointer to that newly allocated ada_inferior_data. */
367 static struct ada_inferior_data
*
368 get_ada_inferior_data (struct inferior
*inf
)
370 struct ada_inferior_data
*data
;
372 data
= ada_inferior_data
.get (inf
);
374 data
= ada_inferior_data
.emplace (inf
);
379 /* Perform all necessary cleanups regarding our module's inferior data
380 that is required after the inferior INF just exited. */
383 ada_inferior_exit (struct inferior
*inf
)
385 ada_inferior_data
.clear (inf
);
389 /* program-space-specific data. */
391 /* This module's per-program-space data. */
392 struct ada_pspace_data
396 if (sym_cache
!= NULL
)
397 ada_free_symbol_cache (sym_cache
);
400 /* The Ada symbol cache. */
401 struct ada_symbol_cache
*sym_cache
= nullptr;
404 /* Key to our per-program-space data. */
405 static const struct program_space_key
<ada_pspace_data
> ada_pspace_data_handle
;
407 /* Return this module's data for the given program space (PSPACE).
408 If not is found, add a zero'ed one now.
410 This function always returns a valid object. */
412 static struct ada_pspace_data
*
413 get_ada_pspace_data (struct program_space
*pspace
)
415 struct ada_pspace_data
*data
;
417 data
= ada_pspace_data_handle
.get (pspace
);
419 data
= ada_pspace_data_handle
.emplace (pspace
);
426 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
427 all typedef layers have been peeled. Otherwise, return TYPE.
429 Normally, we really expect a typedef type to only have 1 typedef layer.
430 In other words, we really expect the target type of a typedef type to be
431 a non-typedef type. This is particularly true for Ada units, because
432 the language does not have a typedef vs not-typedef distinction.
433 In that respect, the Ada compiler has been trying to eliminate as many
434 typedef definitions in the debugging information, since they generally
435 do not bring any extra information (we still use typedef under certain
436 circumstances related mostly to the GNAT encoding).
438 Unfortunately, we have seen situations where the debugging information
439 generated by the compiler leads to such multiple typedef layers. For
440 instance, consider the following example with stabs:
442 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
443 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
445 This is an error in the debugging information which causes type
446 pck__float_array___XUP to be defined twice, and the second time,
447 it is defined as a typedef of a typedef.
449 This is on the fringe of legality as far as debugging information is
450 concerned, and certainly unexpected. But it is easy to handle these
451 situations correctly, so we can afford to be lenient in this case. */
454 ada_typedef_target_type (struct type
*type
)
456 while (type
->code () == TYPE_CODE_TYPEDEF
)
457 type
= TYPE_TARGET_TYPE (type
);
461 /* Given DECODED_NAME a string holding a symbol name in its
462 decoded form (ie using the Ada dotted notation), returns
463 its unqualified name. */
466 ada_unqualified_name (const char *decoded_name
)
470 /* If the decoded name starts with '<', it means that the encoded
471 name does not follow standard naming conventions, and thus that
472 it is not your typical Ada symbol name. Trying to unqualify it
473 is therefore pointless and possibly erroneous. */
474 if (decoded_name
[0] == '<')
477 result
= strrchr (decoded_name
, '.');
479 result
++; /* Skip the dot... */
481 result
= decoded_name
;
486 /* Return a string starting with '<', followed by STR, and '>'. */
489 add_angle_brackets (const char *str
)
491 return string_printf ("<%s>", str
);
495 ada_get_gdb_completer_word_break_characters (void)
497 return ada_completer_word_break_characters
;
500 /* Print an array element index using the Ada syntax. */
503 ada_print_array_index (struct type
*index_type
, LONGEST index
,
504 struct ui_file
*stream
,
505 const struct value_print_options
*options
)
507 struct value
*index_value
= val_atr (index_type
, index
);
509 LA_VALUE_PRINT (index_value
, stream
, options
);
510 fprintf_filtered (stream
, " => ");
513 /* la_watch_location_expression for Ada. */
515 static gdb::unique_xmalloc_ptr
<char>
516 ada_watch_location_expression (struct type
*type
, CORE_ADDR addr
)
518 type
= check_typedef (TYPE_TARGET_TYPE (check_typedef (type
)));
519 std::string name
= type_to_string (type
);
520 return gdb::unique_xmalloc_ptr
<char>
521 (xstrprintf ("{%s} %s", name
.c_str (), core_addr_to_string (addr
)));
524 /* Assuming V points to an array of S objects, make sure that it contains at
525 least M objects, updating V and S as necessary. */
527 #define GROW_VECT(v, s, m) \
528 if ((s) < (m)) (v) = (char *) grow_vect (v, &(s), m, sizeof *(v));
530 /* Assuming VECT points to an array of *SIZE objects of size
531 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
532 updating *SIZE as necessary and returning the (new) array. */
535 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
537 if (*size
< min_size
)
540 if (*size
< min_size
)
542 vect
= xrealloc (vect
, *size
* element_size
);
547 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
548 suffix of FIELD_NAME beginning "___". */
551 field_name_match (const char *field_name
, const char *target
)
553 int len
= strlen (target
);
556 (strncmp (field_name
, target
, len
) == 0
557 && (field_name
[len
] == '\0'
558 || (startswith (field_name
+ len
, "___")
559 && strcmp (field_name
+ strlen (field_name
) - 6,
564 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
565 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
566 and return its index. This function also handles fields whose name
567 have ___ suffixes because the compiler sometimes alters their name
568 by adding such a suffix to represent fields with certain constraints.
569 If the field could not be found, return a negative number if
570 MAYBE_MISSING is set. Otherwise raise an error. */
573 ada_get_field_index (const struct type
*type
, const char *field_name
,
577 struct type
*struct_type
= check_typedef ((struct type
*) type
);
579 for (fieldno
= 0; fieldno
< struct_type
->num_fields (); fieldno
++)
580 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
584 error (_("Unable to find field %s in struct %s. Aborting"),
585 field_name
, struct_type
->name ());
590 /* The length of the prefix of NAME prior to any "___" suffix. */
593 ada_name_prefix_len (const char *name
)
599 const char *p
= strstr (name
, "___");
602 return strlen (name
);
608 /* Return non-zero if SUFFIX is a suffix of STR.
609 Return zero if STR is null. */
612 is_suffix (const char *str
, const char *suffix
)
619 len2
= strlen (suffix
);
620 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
623 /* The contents of value VAL, treated as a value of type TYPE. The
624 result is an lval in memory if VAL is. */
626 static struct value
*
627 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
629 type
= ada_check_typedef (type
);
630 if (value_type (val
) == type
)
634 struct value
*result
;
636 /* Make sure that the object size is not unreasonable before
637 trying to allocate some memory for it. */
638 ada_ensure_varsize_limit (type
);
641 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
642 result
= allocate_value_lazy (type
);
645 result
= allocate_value (type
);
646 value_contents_copy_raw (result
, 0, val
, 0, TYPE_LENGTH (type
));
648 set_value_component_location (result
, val
);
649 set_value_bitsize (result
, value_bitsize (val
));
650 set_value_bitpos (result
, value_bitpos (val
));
651 if (VALUE_LVAL (result
) == lval_memory
)
652 set_value_address (result
, value_address (val
));
657 static const gdb_byte
*
658 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
663 return valaddr
+ offset
;
667 cond_offset_target (CORE_ADDR address
, long offset
)
672 return address
+ offset
;
675 /* Issue a warning (as for the definition of warning in utils.c, but
676 with exactly one argument rather than ...), unless the limit on the
677 number of warnings has passed during the evaluation of the current
680 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
681 provided by "complaint". */
682 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
685 lim_warning (const char *format
, ...)
689 va_start (args
, format
);
690 warnings_issued
+= 1;
691 if (warnings_issued
<= warning_limit
)
692 vwarning (format
, args
);
697 /* Issue an error if the size of an object of type T is unreasonable,
698 i.e. if it would be a bad idea to allocate a value of this type in
702 ada_ensure_varsize_limit (const struct type
*type
)
704 if (TYPE_LENGTH (type
) > varsize_limit
)
705 error (_("object size is larger than varsize-limit"));
708 /* Maximum value of a SIZE-byte signed integer type. */
710 max_of_size (int size
)
712 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
714 return top_bit
| (top_bit
- 1);
717 /* Minimum value of a SIZE-byte signed integer type. */
719 min_of_size (int size
)
721 return -max_of_size (size
) - 1;
724 /* Maximum value of a SIZE-byte unsigned integer type. */
726 umax_of_size (int size
)
728 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
730 return top_bit
| (top_bit
- 1);
733 /* Maximum value of integral type T, as a signed quantity. */
735 max_of_type (struct type
*t
)
737 if (TYPE_UNSIGNED (t
))
738 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
740 return max_of_size (TYPE_LENGTH (t
));
743 /* Minimum value of integral type T, as a signed quantity. */
745 min_of_type (struct type
*t
)
747 if (TYPE_UNSIGNED (t
))
750 return min_of_size (TYPE_LENGTH (t
));
753 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
755 ada_discrete_type_high_bound (struct type
*type
)
757 type
= resolve_dynamic_type (type
, {}, 0);
758 switch (type
->code ())
760 case TYPE_CODE_RANGE
:
761 return TYPE_HIGH_BOUND (type
);
763 return TYPE_FIELD_ENUMVAL (type
, type
->num_fields () - 1);
768 return max_of_type (type
);
770 error (_("Unexpected type in ada_discrete_type_high_bound."));
774 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
776 ada_discrete_type_low_bound (struct type
*type
)
778 type
= resolve_dynamic_type (type
, {}, 0);
779 switch (type
->code ())
781 case TYPE_CODE_RANGE
:
782 return TYPE_LOW_BOUND (type
);
784 return TYPE_FIELD_ENUMVAL (type
, 0);
789 return min_of_type (type
);
791 error (_("Unexpected type in ada_discrete_type_low_bound."));
795 /* The identity on non-range types. For range types, the underlying
796 non-range scalar type. */
799 get_base_type (struct type
*type
)
801 while (type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
)
803 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
805 type
= TYPE_TARGET_TYPE (type
);
810 /* Return a decoded version of the given VALUE. This means returning
811 a value whose type is obtained by applying all the GNAT-specific
812 encodings, making the resulting type a static but standard description
813 of the initial type. */
816 ada_get_decoded_value (struct value
*value
)
818 struct type
*type
= ada_check_typedef (value_type (value
));
820 if (ada_is_array_descriptor_type (type
)
821 || (ada_is_constrained_packed_array_type (type
)
822 && type
->code () != TYPE_CODE_PTR
))
824 if (type
->code () == TYPE_CODE_TYPEDEF
) /* array access type. */
825 value
= ada_coerce_to_simple_array_ptr (value
);
827 value
= ada_coerce_to_simple_array (value
);
830 value
= ada_to_fixed_value (value
);
835 /* Same as ada_get_decoded_value, but with the given TYPE.
836 Because there is no associated actual value for this type,
837 the resulting type might be a best-effort approximation in
838 the case of dynamic types. */
841 ada_get_decoded_type (struct type
*type
)
843 type
= to_static_fixed_type (type
);
844 if (ada_is_constrained_packed_array_type (type
))
845 type
= ada_coerce_to_simple_array_type (type
);
851 /* Language Selection */
853 /* If the main program is in Ada, return language_ada, otherwise return LANG
854 (the main program is in Ada iif the adainit symbol is found). */
857 ada_update_initial_language (enum language lang
)
859 if (lookup_minimal_symbol ("adainit", NULL
, NULL
).minsym
!= NULL
)
865 /* If the main procedure is written in Ada, then return its name.
866 The result is good until the next call. Return NULL if the main
867 procedure doesn't appear to be in Ada. */
872 struct bound_minimal_symbol msym
;
873 static gdb::unique_xmalloc_ptr
<char> main_program_name
;
875 /* For Ada, the name of the main procedure is stored in a specific
876 string constant, generated by the binder. Look for that symbol,
877 extract its address, and then read that string. If we didn't find
878 that string, then most probably the main procedure is not written
880 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
882 if (msym
.minsym
!= NULL
)
884 CORE_ADDR main_program_name_addr
;
887 main_program_name_addr
= BMSYMBOL_VALUE_ADDRESS (msym
);
888 if (main_program_name_addr
== 0)
889 error (_("Invalid address for Ada main program name."));
891 target_read_string (main_program_name_addr
, &main_program_name
,
896 return main_program_name
.get ();
899 /* The main procedure doesn't seem to be in Ada. */
905 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
908 const struct ada_opname_map ada_opname_table
[] = {
909 {"Oadd", "\"+\"", BINOP_ADD
},
910 {"Osubtract", "\"-\"", BINOP_SUB
},
911 {"Omultiply", "\"*\"", BINOP_MUL
},
912 {"Odivide", "\"/\"", BINOP_DIV
},
913 {"Omod", "\"mod\"", BINOP_MOD
},
914 {"Orem", "\"rem\"", BINOP_REM
},
915 {"Oexpon", "\"**\"", BINOP_EXP
},
916 {"Olt", "\"<\"", BINOP_LESS
},
917 {"Ole", "\"<=\"", BINOP_LEQ
},
918 {"Ogt", "\">\"", BINOP_GTR
},
919 {"Oge", "\">=\"", BINOP_GEQ
},
920 {"Oeq", "\"=\"", BINOP_EQUAL
},
921 {"One", "\"/=\"", BINOP_NOTEQUAL
},
922 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
923 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
924 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
925 {"Oconcat", "\"&\"", BINOP_CONCAT
},
926 {"Oabs", "\"abs\"", UNOP_ABS
},
927 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
928 {"Oadd", "\"+\"", UNOP_PLUS
},
929 {"Osubtract", "\"-\"", UNOP_NEG
},
933 /* The "encoded" form of DECODED, according to GNAT conventions. The
934 result is valid until the next call to ada_encode. If
935 THROW_ERRORS, throw an error if invalid operator name is found.
936 Otherwise, return NULL in that case. */
939 ada_encode_1 (const char *decoded
, bool throw_errors
)
941 static char *encoding_buffer
= NULL
;
942 static size_t encoding_buffer_size
= 0;
949 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
950 2 * strlen (decoded
) + 10);
953 for (p
= decoded
; *p
!= '\0'; p
+= 1)
957 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
962 const struct ada_opname_map
*mapping
;
964 for (mapping
= ada_opname_table
;
965 mapping
->encoded
!= NULL
966 && !startswith (p
, mapping
->decoded
); mapping
+= 1)
968 if (mapping
->encoded
== NULL
)
971 error (_("invalid Ada operator name: %s"), p
);
975 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
976 k
+= strlen (mapping
->encoded
);
981 encoding_buffer
[k
] = *p
;
986 encoding_buffer
[k
] = '\0';
987 return encoding_buffer
;
990 /* The "encoded" form of DECODED, according to GNAT conventions.
991 The result is valid until the next call to ada_encode. */
994 ada_encode (const char *decoded
)
996 return ada_encode_1 (decoded
, true);
999 /* Return NAME folded to lower case, or, if surrounded by single
1000 quotes, unfolded, but with the quotes stripped away. Result good
1004 ada_fold_name (gdb::string_view name
)
1006 static char *fold_buffer
= NULL
;
1007 static size_t fold_buffer_size
= 0;
1009 int len
= name
.size ();
1010 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1012 if (name
[0] == '\'')
1014 strncpy (fold_buffer
, name
.data () + 1, len
- 2);
1015 fold_buffer
[len
- 2] = '\000';
1021 for (i
= 0; i
<= len
; i
+= 1)
1022 fold_buffer
[i
] = tolower (name
[i
]);
1028 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1031 is_lower_alphanum (const char c
)
1033 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1036 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1037 This function saves in LEN the length of that same symbol name but
1038 without either of these suffixes:
1044 These are suffixes introduced by the compiler for entities such as
1045 nested subprogram for instance, in order to avoid name clashes.
1046 They do not serve any purpose for the debugger. */
1049 ada_remove_trailing_digits (const char *encoded
, int *len
)
1051 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1055 while (i
> 0 && isdigit (encoded
[i
]))
1057 if (i
>= 0 && encoded
[i
] == '.')
1059 else if (i
>= 0 && encoded
[i
] == '$')
1061 else if (i
>= 2 && startswith (encoded
+ i
- 2, "___"))
1063 else if (i
>= 1 && startswith (encoded
+ i
- 1, "__"))
1068 /* Remove the suffix introduced by the compiler for protected object
1072 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1074 /* Remove trailing N. */
1076 /* Protected entry subprograms are broken into two
1077 separate subprograms: The first one is unprotected, and has
1078 a 'N' suffix; the second is the protected version, and has
1079 the 'P' suffix. The second calls the first one after handling
1080 the protection. Since the P subprograms are internally generated,
1081 we leave these names undecoded, giving the user a clue that this
1082 entity is internal. */
1085 && encoded
[*len
- 1] == 'N'
1086 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1090 /* If ENCODED follows the GNAT entity encoding conventions, then return
1091 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1092 replaced by ENCODED. */
1095 ada_decode (const char *encoded
)
1101 std::string decoded
;
1103 /* With function descriptors on PPC64, the value of a symbol named
1104 ".FN", if it exists, is the entry point of the function "FN". */
1105 if (encoded
[0] == '.')
1108 /* The name of the Ada main procedure starts with "_ada_".
1109 This prefix is not part of the decoded name, so skip this part
1110 if we see this prefix. */
1111 if (startswith (encoded
, "_ada_"))
1114 /* If the name starts with '_', then it is not a properly encoded
1115 name, so do not attempt to decode it. Similarly, if the name
1116 starts with '<', the name should not be decoded. */
1117 if (encoded
[0] == '_' || encoded
[0] == '<')
1120 len0
= strlen (encoded
);
1122 ada_remove_trailing_digits (encoded
, &len0
);
1123 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1125 /* Remove the ___X.* suffix if present. Do not forget to verify that
1126 the suffix is located before the current "end" of ENCODED. We want
1127 to avoid re-matching parts of ENCODED that have previously been
1128 marked as discarded (by decrementing LEN0). */
1129 p
= strstr (encoded
, "___");
1130 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1138 /* Remove any trailing TKB suffix. It tells us that this symbol
1139 is for the body of a task, but that information does not actually
1140 appear in the decoded name. */
1142 if (len0
> 3 && startswith (encoded
+ len0
- 3, "TKB"))
1145 /* Remove any trailing TB suffix. The TB suffix is slightly different
1146 from the TKB suffix because it is used for non-anonymous task
1149 if (len0
> 2 && startswith (encoded
+ len0
- 2, "TB"))
1152 /* Remove trailing "B" suffixes. */
1153 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1155 if (len0
> 1 && startswith (encoded
+ len0
- 1, "B"))
1158 /* Make decoded big enough for possible expansion by operator name. */
1160 decoded
.resize (2 * len0
+ 1, 'X');
1162 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1164 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1167 while ((i
>= 0 && isdigit (encoded
[i
]))
1168 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1170 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1172 else if (encoded
[i
] == '$')
1176 /* The first few characters that are not alphabetic are not part
1177 of any encoding we use, so we can copy them over verbatim. */
1179 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1180 decoded
[j
] = encoded
[i
];
1185 /* Is this a symbol function? */
1186 if (at_start_name
&& encoded
[i
] == 'O')
1190 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1192 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1193 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1195 && !isalnum (encoded
[i
+ op_len
]))
1197 strcpy (&decoded
.front() + j
, ada_opname_table
[k
].decoded
);
1200 j
+= strlen (ada_opname_table
[k
].decoded
);
1204 if (ada_opname_table
[k
].encoded
!= NULL
)
1209 /* Replace "TK__" with "__", which will eventually be translated
1210 into "." (just below). */
1212 if (i
< len0
- 4 && startswith (encoded
+ i
, "TK__"))
1215 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1216 be translated into "." (just below). These are internal names
1217 generated for anonymous blocks inside which our symbol is nested. */
1219 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1220 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1221 && isdigit (encoded
[i
+4]))
1225 while (k
< len0
&& isdigit (encoded
[k
]))
1226 k
++; /* Skip any extra digit. */
1228 /* Double-check that the "__B_{DIGITS}+" sequence we found
1229 is indeed followed by "__". */
1230 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1234 /* Remove _E{DIGITS}+[sb] */
1236 /* Just as for protected object subprograms, there are 2 categories
1237 of subprograms created by the compiler for each entry. The first
1238 one implements the actual entry code, and has a suffix following
1239 the convention above; the second one implements the barrier and
1240 uses the same convention as above, except that the 'E' is replaced
1243 Just as above, we do not decode the name of barrier functions
1244 to give the user a clue that the code he is debugging has been
1245 internally generated. */
1247 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1248 && isdigit (encoded
[i
+2]))
1252 while (k
< len0
&& isdigit (encoded
[k
]))
1256 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1259 /* Just as an extra precaution, make sure that if this
1260 suffix is followed by anything else, it is a '_'.
1261 Otherwise, we matched this sequence by accident. */
1263 || (k
< len0
&& encoded
[k
] == '_'))
1268 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1269 the GNAT front-end in protected object subprograms. */
1272 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1274 /* Backtrack a bit up until we reach either the begining of
1275 the encoded name, or "__". Make sure that we only find
1276 digits or lowercase characters. */
1277 const char *ptr
= encoded
+ i
- 1;
1279 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1282 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1286 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1288 /* This is a X[bn]* sequence not separated from the previous
1289 part of the name with a non-alpha-numeric character (in other
1290 words, immediately following an alpha-numeric character), then
1291 verify that it is placed at the end of the encoded name. If
1292 not, then the encoding is not valid and we should abort the
1293 decoding. Otherwise, just skip it, it is used in body-nested
1297 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1301 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1303 /* Replace '__' by '.'. */
1311 /* It's a character part of the decoded name, so just copy it
1313 decoded
[j
] = encoded
[i
];
1320 /* Decoded names should never contain any uppercase character.
1321 Double-check this, and abort the decoding if we find one. */
1323 for (i
= 0; i
< decoded
.length(); ++i
)
1324 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1330 if (encoded
[0] == '<')
1333 decoded
= '<' + std::string(encoded
) + '>';
1338 /* Table for keeping permanent unique copies of decoded names. Once
1339 allocated, names in this table are never released. While this is a
1340 storage leak, it should not be significant unless there are massive
1341 changes in the set of decoded names in successive versions of a
1342 symbol table loaded during a single session. */
1343 static struct htab
*decoded_names_store
;
1345 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1346 in the language-specific part of GSYMBOL, if it has not been
1347 previously computed. Tries to save the decoded name in the same
1348 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1349 in any case, the decoded symbol has a lifetime at least that of
1351 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1352 const, but nevertheless modified to a semantically equivalent form
1353 when a decoded name is cached in it. */
1356 ada_decode_symbol (const struct general_symbol_info
*arg
)
1358 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1359 const char **resultp
=
1360 &gsymbol
->language_specific
.demangled_name
;
1362 if (!gsymbol
->ada_mangled
)
1364 std::string decoded
= ada_decode (gsymbol
->linkage_name ());
1365 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1367 gsymbol
->ada_mangled
= 1;
1369 if (obstack
!= NULL
)
1370 *resultp
= obstack_strdup (obstack
, decoded
.c_str ());
1373 /* Sometimes, we can't find a corresponding objfile, in
1374 which case, we put the result on the heap. Since we only
1375 decode when needed, we hope this usually does not cause a
1376 significant memory leak (FIXME). */
1378 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1379 decoded
.c_str (), INSERT
);
1382 *slot
= xstrdup (decoded
.c_str ());
1391 ada_la_decode (const char *encoded
, int options
)
1393 return xstrdup (ada_decode (encoded
).c_str ());
1396 /* Implement la_sniff_from_mangled_name for Ada. */
1399 ada_sniff_from_mangled_name (const char *mangled
, char **out
)
1401 std::string demangled
= ada_decode (mangled
);
1405 if (demangled
!= mangled
&& demangled
[0] != '<')
1407 /* Set the gsymbol language to Ada, but still return 0.
1408 Two reasons for that:
1410 1. For Ada, we prefer computing the symbol's decoded name
1411 on the fly rather than pre-compute it, in order to save
1412 memory (Ada projects are typically very large).
1414 2. There are some areas in the definition of the GNAT
1415 encoding where, with a bit of bad luck, we might be able
1416 to decode a non-Ada symbol, generating an incorrect
1417 demangled name (Eg: names ending with "TB" for instance
1418 are identified as task bodies and so stripped from
1419 the decoded name returned).
1421 Returning 1, here, but not setting *DEMANGLED, helps us get a
1422 little bit of the best of both worlds. Because we're last,
1423 we should not affect any of the other languages that were
1424 able to demangle the symbol before us; we get to correctly
1425 tag Ada symbols as such; and even if we incorrectly tagged a
1426 non-Ada symbol, which should be rare, any routing through the
1427 Ada language should be transparent (Ada tries to behave much
1428 like C/C++ with non-Ada symbols). */
1439 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1440 generated by the GNAT compiler to describe the index type used
1441 for each dimension of an array, check whether it follows the latest
1442 known encoding. If not, fix it up to conform to the latest encoding.
1443 Otherwise, do nothing. This function also does nothing if
1444 INDEX_DESC_TYPE is NULL.
1446 The GNAT encoding used to describe the array index type evolved a bit.
1447 Initially, the information would be provided through the name of each
1448 field of the structure type only, while the type of these fields was
1449 described as unspecified and irrelevant. The debugger was then expected
1450 to perform a global type lookup using the name of that field in order
1451 to get access to the full index type description. Because these global
1452 lookups can be very expensive, the encoding was later enhanced to make
1453 the global lookup unnecessary by defining the field type as being
1454 the full index type description.
1456 The purpose of this routine is to allow us to support older versions
1457 of the compiler by detecting the use of the older encoding, and by
1458 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1459 we essentially replace each field's meaningless type by the associated
1463 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1467 if (index_desc_type
== NULL
)
1469 gdb_assert (index_desc_type
->num_fields () > 0);
1471 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1472 to check one field only, no need to check them all). If not, return
1475 If our INDEX_DESC_TYPE was generated using the older encoding,
1476 the field type should be a meaningless integer type whose name
1477 is not equal to the field name. */
1478 if (TYPE_FIELD_TYPE (index_desc_type
, 0)->name () != NULL
1479 && strcmp (TYPE_FIELD_TYPE (index_desc_type
, 0)->name (),
1480 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1483 /* Fixup each field of INDEX_DESC_TYPE. */
1484 for (i
= 0; i
< index_desc_type
->num_fields (); i
++)
1486 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1487 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1490 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1494 /* The desc_* routines return primitive portions of array descriptors
1497 /* The descriptor or array type, if any, indicated by TYPE; removes
1498 level of indirection, if needed. */
1500 static struct type
*
1501 desc_base_type (struct type
*type
)
1505 type
= ada_check_typedef (type
);
1506 if (type
->code () == TYPE_CODE_TYPEDEF
)
1507 type
= ada_typedef_target_type (type
);
1510 && (type
->code () == TYPE_CODE_PTR
1511 || type
->code () == TYPE_CODE_REF
))
1512 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1517 /* True iff TYPE indicates a "thin" array pointer type. */
1520 is_thin_pntr (struct type
*type
)
1523 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1524 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1527 /* The descriptor type for thin pointer type TYPE. */
1529 static struct type
*
1530 thin_descriptor_type (struct type
*type
)
1532 struct type
*base_type
= desc_base_type (type
);
1534 if (base_type
== NULL
)
1536 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1540 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1542 if (alt_type
== NULL
)
1549 /* A pointer to the array data for thin-pointer value VAL. */
1551 static struct value
*
1552 thin_data_pntr (struct value
*val
)
1554 struct type
*type
= ada_check_typedef (value_type (val
));
1555 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1557 data_type
= lookup_pointer_type (data_type
);
1559 if (type
->code () == TYPE_CODE_PTR
)
1560 return value_cast (data_type
, value_copy (val
));
1562 return value_from_longest (data_type
, value_address (val
));
1565 /* True iff TYPE indicates a "thick" array pointer type. */
1568 is_thick_pntr (struct type
*type
)
1570 type
= desc_base_type (type
);
1571 return (type
!= NULL
&& type
->code () == TYPE_CODE_STRUCT
1572 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1575 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1576 pointer to one, the type of its bounds data; otherwise, NULL. */
1578 static struct type
*
1579 desc_bounds_type (struct type
*type
)
1583 type
= desc_base_type (type
);
1587 else if (is_thin_pntr (type
))
1589 type
= thin_descriptor_type (type
);
1592 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1594 return ada_check_typedef (r
);
1596 else if (type
->code () == TYPE_CODE_STRUCT
)
1598 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1600 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1605 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1606 one, a pointer to its bounds data. Otherwise NULL. */
1608 static struct value
*
1609 desc_bounds (struct value
*arr
)
1611 struct type
*type
= ada_check_typedef (value_type (arr
));
1613 if (is_thin_pntr (type
))
1615 struct type
*bounds_type
=
1616 desc_bounds_type (thin_descriptor_type (type
));
1619 if (bounds_type
== NULL
)
1620 error (_("Bad GNAT array descriptor"));
1622 /* NOTE: The following calculation is not really kosher, but
1623 since desc_type is an XVE-encoded type (and shouldn't be),
1624 the correct calculation is a real pain. FIXME (and fix GCC). */
1625 if (type
->code () == TYPE_CODE_PTR
)
1626 addr
= value_as_long (arr
);
1628 addr
= value_address (arr
);
1631 value_from_longest (lookup_pointer_type (bounds_type
),
1632 addr
- TYPE_LENGTH (bounds_type
));
1635 else if (is_thick_pntr (type
))
1637 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1638 _("Bad GNAT array descriptor"));
1639 struct type
*p_bounds_type
= value_type (p_bounds
);
1642 && p_bounds_type
->code () == TYPE_CODE_PTR
)
1644 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1646 if (TYPE_STUB (target_type
))
1647 p_bounds
= value_cast (lookup_pointer_type
1648 (ada_check_typedef (target_type
)),
1652 error (_("Bad GNAT array descriptor"));
1660 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1661 position of the field containing the address of the bounds data. */
1664 fat_pntr_bounds_bitpos (struct type
*type
)
1666 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1669 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1670 size of the field containing the address of the bounds data. */
1673 fat_pntr_bounds_bitsize (struct type
*type
)
1675 type
= desc_base_type (type
);
1677 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1678 return TYPE_FIELD_BITSIZE (type
, 1);
1680 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1683 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1684 pointer to one, the type of its array data (a array-with-no-bounds type);
1685 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1688 static struct type
*
1689 desc_data_target_type (struct type
*type
)
1691 type
= desc_base_type (type
);
1693 /* NOTE: The following is bogus; see comment in desc_bounds. */
1694 if (is_thin_pntr (type
))
1695 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1696 else if (is_thick_pntr (type
))
1698 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1701 && ada_check_typedef (data_type
)->code () == TYPE_CODE_PTR
)
1702 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1708 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1711 static struct value
*
1712 desc_data (struct value
*arr
)
1714 struct type
*type
= value_type (arr
);
1716 if (is_thin_pntr (type
))
1717 return thin_data_pntr (arr
);
1718 else if (is_thick_pntr (type
))
1719 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1720 _("Bad GNAT array descriptor"));
1726 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1727 position of the field containing the address of the data. */
1730 fat_pntr_data_bitpos (struct type
*type
)
1732 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1735 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1736 size of the field containing the address of the data. */
1739 fat_pntr_data_bitsize (struct type
*type
)
1741 type
= desc_base_type (type
);
1743 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1744 return TYPE_FIELD_BITSIZE (type
, 0);
1746 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1749 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1750 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1751 bound, if WHICH is 1. The first bound is I=1. */
1753 static struct value
*
1754 desc_one_bound (struct value
*bounds
, int i
, int which
)
1756 char bound_name
[20];
1757 xsnprintf (bound_name
, sizeof (bound_name
), "%cB%d",
1758 which
? 'U' : 'L', i
- 1);
1759 return value_struct_elt (&bounds
, NULL
, bound_name
, NULL
,
1760 _("Bad GNAT array descriptor bounds"));
1763 /* If BOUNDS is an array-bounds structure type, return the bit position
1764 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1765 bound, if WHICH is 1. The first bound is I=1. */
1768 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1770 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1773 /* If BOUNDS is an array-bounds structure type, return the bit field size
1774 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1775 bound, if WHICH is 1. The first bound is I=1. */
1778 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1780 type
= desc_base_type (type
);
1782 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1783 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1785 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1788 /* If TYPE is the type of an array-bounds structure, the type of its
1789 Ith bound (numbering from 1). Otherwise, NULL. */
1791 static struct type
*
1792 desc_index_type (struct type
*type
, int i
)
1794 type
= desc_base_type (type
);
1796 if (type
->code () == TYPE_CODE_STRUCT
)
1798 char bound_name
[20];
1799 xsnprintf (bound_name
, sizeof (bound_name
), "LB%d", i
- 1);
1800 return lookup_struct_elt_type (type
, bound_name
, 1);
1806 /* The number of index positions in the array-bounds type TYPE.
1807 Return 0 if TYPE is NULL. */
1810 desc_arity (struct type
*type
)
1812 type
= desc_base_type (type
);
1815 return type
->num_fields () / 2;
1819 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1820 an array descriptor type (representing an unconstrained array
1824 ada_is_direct_array_type (struct type
*type
)
1828 type
= ada_check_typedef (type
);
1829 return (type
->code () == TYPE_CODE_ARRAY
1830 || ada_is_array_descriptor_type (type
));
1833 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1837 ada_is_array_type (struct type
*type
)
1840 && (type
->code () == TYPE_CODE_PTR
1841 || type
->code () == TYPE_CODE_REF
))
1842 type
= TYPE_TARGET_TYPE (type
);
1843 return ada_is_direct_array_type (type
);
1846 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1849 ada_is_simple_array_type (struct type
*type
)
1853 type
= ada_check_typedef (type
);
1854 return (type
->code () == TYPE_CODE_ARRAY
1855 || (type
->code () == TYPE_CODE_PTR
1856 && (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ()
1857 == TYPE_CODE_ARRAY
)));
1860 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1863 ada_is_array_descriptor_type (struct type
*type
)
1865 struct type
*data_type
= desc_data_target_type (type
);
1869 type
= ada_check_typedef (type
);
1870 return (data_type
!= NULL
1871 && data_type
->code () == TYPE_CODE_ARRAY
1872 && desc_arity (desc_bounds_type (type
)) > 0);
1875 /* Non-zero iff type is a partially mal-formed GNAT array
1876 descriptor. FIXME: This is to compensate for some problems with
1877 debugging output from GNAT. Re-examine periodically to see if it
1881 ada_is_bogus_array_descriptor (struct type
*type
)
1885 && type
->code () == TYPE_CODE_STRUCT
1886 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1887 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1888 && !ada_is_array_descriptor_type (type
);
1892 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1893 (fat pointer) returns the type of the array data described---specifically,
1894 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1895 in from the descriptor; otherwise, they are left unspecified. If
1896 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1897 returns NULL. The result is simply the type of ARR if ARR is not
1900 static struct type
*
1901 ada_type_of_array (struct value
*arr
, int bounds
)
1903 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1904 return decode_constrained_packed_array_type (value_type (arr
));
1906 if (!ada_is_array_descriptor_type (value_type (arr
)))
1907 return value_type (arr
);
1911 struct type
*array_type
=
1912 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1914 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1915 TYPE_FIELD_BITSIZE (array_type
, 0) =
1916 decode_packed_array_bitsize (value_type (arr
));
1922 struct type
*elt_type
;
1924 struct value
*descriptor
;
1926 elt_type
= ada_array_element_type (value_type (arr
), -1);
1927 arity
= ada_array_arity (value_type (arr
));
1929 if (elt_type
== NULL
|| arity
== 0)
1930 return ada_check_typedef (value_type (arr
));
1932 descriptor
= desc_bounds (arr
);
1933 if (value_as_long (descriptor
) == 0)
1937 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1938 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1939 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1940 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1943 create_static_range_type (range_type
, value_type (low
),
1944 longest_to_int (value_as_long (low
)),
1945 longest_to_int (value_as_long (high
)));
1946 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1948 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1950 /* We need to store the element packed bitsize, as well as
1951 recompute the array size, because it was previously
1952 computed based on the unpacked element size. */
1953 LONGEST lo
= value_as_long (low
);
1954 LONGEST hi
= value_as_long (high
);
1956 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1958 /* If the array has no element, then the size is already
1959 zero, and does not need to be recomputed. */
1963 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1965 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1970 return lookup_pointer_type (elt_type
);
1974 /* If ARR does not represent an array, returns ARR unchanged.
1975 Otherwise, returns either a standard GDB array with bounds set
1976 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1977 GDB array. Returns NULL if ARR is a null fat pointer. */
1980 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1982 if (ada_is_array_descriptor_type (value_type (arr
)))
1984 struct type
*arrType
= ada_type_of_array (arr
, 1);
1986 if (arrType
== NULL
)
1988 return value_cast (arrType
, value_copy (desc_data (arr
)));
1990 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1991 return decode_constrained_packed_array (arr
);
1996 /* If ARR does not represent an array, returns ARR unchanged.
1997 Otherwise, returns a standard GDB array describing ARR (which may
1998 be ARR itself if it already is in the proper form). */
2001 ada_coerce_to_simple_array (struct value
*arr
)
2003 if (ada_is_array_descriptor_type (value_type (arr
)))
2005 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2008 error (_("Bounds unavailable for null array pointer."));
2009 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal
)));
2010 return value_ind (arrVal
);
2012 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2013 return decode_constrained_packed_array (arr
);
2018 /* If TYPE represents a GNAT array type, return it translated to an
2019 ordinary GDB array type (possibly with BITSIZE fields indicating
2020 packing). For other types, is the identity. */
2023 ada_coerce_to_simple_array_type (struct type
*type
)
2025 if (ada_is_constrained_packed_array_type (type
))
2026 return decode_constrained_packed_array_type (type
);
2028 if (ada_is_array_descriptor_type (type
))
2029 return ada_check_typedef (desc_data_target_type (type
));
2034 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2037 ada_is_packed_array_type (struct type
*type
)
2041 type
= desc_base_type (type
);
2042 type
= ada_check_typedef (type
);
2044 ada_type_name (type
) != NULL
2045 && strstr (ada_type_name (type
), "___XP") != NULL
;
2048 /* Non-zero iff TYPE represents a standard GNAT constrained
2049 packed-array type. */
2052 ada_is_constrained_packed_array_type (struct type
*type
)
2054 return ada_is_packed_array_type (type
)
2055 && !ada_is_array_descriptor_type (type
);
2058 /* Non-zero iff TYPE represents an array descriptor for a
2059 unconstrained packed-array type. */
2062 ada_is_unconstrained_packed_array_type (struct type
*type
)
2064 return ada_is_packed_array_type (type
)
2065 && ada_is_array_descriptor_type (type
);
2068 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2069 return the size of its elements in bits. */
2072 decode_packed_array_bitsize (struct type
*type
)
2074 const char *raw_name
;
2078 /* Access to arrays implemented as fat pointers are encoded as a typedef
2079 of the fat pointer type. We need the name of the fat pointer type
2080 to do the decoding, so strip the typedef layer. */
2081 if (type
->code () == TYPE_CODE_TYPEDEF
)
2082 type
= ada_typedef_target_type (type
);
2084 raw_name
= ada_type_name (ada_check_typedef (type
));
2086 raw_name
= ada_type_name (desc_base_type (type
));
2091 tail
= strstr (raw_name
, "___XP");
2092 gdb_assert (tail
!= NULL
);
2094 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2097 (_("could not understand bit size information on packed array"));
2104 /* Given that TYPE is a standard GDB array type with all bounds filled
2105 in, and that the element size of its ultimate scalar constituents
2106 (that is, either its elements, or, if it is an array of arrays, its
2107 elements' elements, etc.) is *ELT_BITS, return an identical type,
2108 but with the bit sizes of its elements (and those of any
2109 constituent arrays) recorded in the BITSIZE components of its
2110 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2113 Note that, for arrays whose index type has an XA encoding where
2114 a bound references a record discriminant, getting that discriminant,
2115 and therefore the actual value of that bound, is not possible
2116 because none of the given parameters gives us access to the record.
2117 This function assumes that it is OK in the context where it is being
2118 used to return an array whose bounds are still dynamic and where
2119 the length is arbitrary. */
2121 static struct type
*
2122 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2124 struct type
*new_elt_type
;
2125 struct type
*new_type
;
2126 struct type
*index_type_desc
;
2127 struct type
*index_type
;
2128 LONGEST low_bound
, high_bound
;
2130 type
= ada_check_typedef (type
);
2131 if (type
->code () != TYPE_CODE_ARRAY
)
2134 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2135 if (index_type_desc
)
2136 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2139 index_type
= TYPE_INDEX_TYPE (type
);
2141 new_type
= alloc_type_copy (type
);
2143 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2145 create_array_type (new_type
, new_elt_type
, index_type
);
2146 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2147 new_type
->set_name (ada_type_name (type
));
2149 if ((check_typedef (index_type
)->code () == TYPE_CODE_RANGE
2150 && is_dynamic_type (check_typedef (index_type
)))
2151 || get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2152 low_bound
= high_bound
= 0;
2153 if (high_bound
< low_bound
)
2154 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2157 *elt_bits
*= (high_bound
- low_bound
+ 1);
2158 TYPE_LENGTH (new_type
) =
2159 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2162 TYPE_FIXED_INSTANCE (new_type
) = 1;
2166 /* The array type encoded by TYPE, where
2167 ada_is_constrained_packed_array_type (TYPE). */
2169 static struct type
*
2170 decode_constrained_packed_array_type (struct type
*type
)
2172 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2175 struct type
*shadow_type
;
2179 raw_name
= ada_type_name (desc_base_type (type
));
2184 name
= (char *) alloca (strlen (raw_name
) + 1);
2185 tail
= strstr (raw_name
, "___XP");
2186 type
= desc_base_type (type
);
2188 memcpy (name
, raw_name
, tail
- raw_name
);
2189 name
[tail
- raw_name
] = '\000';
2191 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2193 if (shadow_type
== NULL
)
2195 lim_warning (_("could not find bounds information on packed array"));
2198 shadow_type
= check_typedef (shadow_type
);
2200 if (shadow_type
->code () != TYPE_CODE_ARRAY
)
2202 lim_warning (_("could not understand bounds "
2203 "information on packed array"));
2207 bits
= decode_packed_array_bitsize (type
);
2208 return constrained_packed_array_type (shadow_type
, &bits
);
2211 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2212 array, returns a simple array that denotes that array. Its type is a
2213 standard GDB array type except that the BITSIZEs of the array
2214 target types are set to the number of bits in each element, and the
2215 type length is set appropriately. */
2217 static struct value
*
2218 decode_constrained_packed_array (struct value
*arr
)
2222 /* If our value is a pointer, then dereference it. Likewise if
2223 the value is a reference. Make sure that this operation does not
2224 cause the target type to be fixed, as this would indirectly cause
2225 this array to be decoded. The rest of the routine assumes that
2226 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2227 and "value_ind" routines to perform the dereferencing, as opposed
2228 to using "ada_coerce_ref" or "ada_value_ind". */
2229 arr
= coerce_ref (arr
);
2230 if (ada_check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
2231 arr
= value_ind (arr
);
2233 type
= decode_constrained_packed_array_type (value_type (arr
));
2236 error (_("can't unpack array"));
2240 if (type_byte_order (value_type (arr
)) == BFD_ENDIAN_BIG
2241 && ada_is_modular_type (value_type (arr
)))
2243 /* This is a (right-justified) modular type representing a packed
2244 array with no wrapper. In order to interpret the value through
2245 the (left-justified) packed array type we just built, we must
2246 first left-justify it. */
2247 int bit_size
, bit_pos
;
2250 mod
= ada_modulus (value_type (arr
)) - 1;
2257 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2258 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2259 bit_pos
/ HOST_CHAR_BIT
,
2260 bit_pos
% HOST_CHAR_BIT
,
2265 return coerce_unspec_val_to_type (arr
, type
);
2269 /* The value of the element of packed array ARR at the ARITY indices
2270 given in IND. ARR must be a simple array. */
2272 static struct value
*
2273 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2276 int bits
, elt_off
, bit_off
;
2277 long elt_total_bit_offset
;
2278 struct type
*elt_type
;
2282 elt_total_bit_offset
= 0;
2283 elt_type
= ada_check_typedef (value_type (arr
));
2284 for (i
= 0; i
< arity
; i
+= 1)
2286 if (elt_type
->code () != TYPE_CODE_ARRAY
2287 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2289 (_("attempt to do packed indexing of "
2290 "something other than a packed array"));
2293 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2294 LONGEST lowerbound
, upperbound
;
2297 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2299 lim_warning (_("don't know bounds of array"));
2300 lowerbound
= upperbound
= 0;
2303 idx
= pos_atr (ind
[i
]);
2304 if (idx
< lowerbound
|| idx
> upperbound
)
2305 lim_warning (_("packed array index %ld out of bounds"),
2307 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2308 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2309 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2312 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2313 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2315 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2320 /* Non-zero iff TYPE includes negative integer values. */
2323 has_negatives (struct type
*type
)
2325 switch (type
->code ())
2330 return !TYPE_UNSIGNED (type
);
2331 case TYPE_CODE_RANGE
:
2332 return TYPE_LOW_BOUND (type
) - TYPE_RANGE_DATA (type
)->bias
< 0;
2336 /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
2337 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
2338 the unpacked buffer.
2340 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2341 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2343 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2346 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
2348 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2351 ada_unpack_from_contents (const gdb_byte
*src
, int bit_offset
, int bit_size
,
2352 gdb_byte
*unpacked
, int unpacked_len
,
2353 int is_big_endian
, int is_signed_type
,
2356 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2357 int src_idx
; /* Index into the source area */
2358 int src_bytes_left
; /* Number of source bytes left to process. */
2359 int srcBitsLeft
; /* Number of source bits left to move */
2360 int unusedLS
; /* Number of bits in next significant
2361 byte of source that are unused */
2363 int unpacked_idx
; /* Index into the unpacked buffer */
2364 int unpacked_bytes_left
; /* Number of bytes left to set in unpacked. */
2366 unsigned long accum
; /* Staging area for bits being transferred */
2367 int accumSize
; /* Number of meaningful bits in accum */
2370 /* Transmit bytes from least to most significant; delta is the direction
2371 the indices move. */
2372 int delta
= is_big_endian
? -1 : 1;
2374 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2376 if ((bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
> unpacked_len
)
2377 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2378 bit_size
, unpacked_len
);
2380 srcBitsLeft
= bit_size
;
2381 src_bytes_left
= src_len
;
2382 unpacked_bytes_left
= unpacked_len
;
2387 src_idx
= src_len
- 1;
2389 && ((src
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2393 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2399 unpacked_idx
= unpacked_len
- 1;
2403 /* Non-scalar values must be aligned at a byte boundary... */
2405 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2406 /* ... And are placed at the beginning (most-significant) bytes
2408 unpacked_idx
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2409 unpacked_bytes_left
= unpacked_idx
+ 1;
2414 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2416 src_idx
= unpacked_idx
= 0;
2417 unusedLS
= bit_offset
;
2420 if (is_signed_type
&& (src
[src_len
- 1] & (1 << sign_bit_offset
)))
2425 while (src_bytes_left
> 0)
2427 /* Mask for removing bits of the next source byte that are not
2428 part of the value. */
2429 unsigned int unusedMSMask
=
2430 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2432 /* Sign-extend bits for this byte. */
2433 unsigned int signMask
= sign
& ~unusedMSMask
;
2436 (((src
[src_idx
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2437 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2438 if (accumSize
>= HOST_CHAR_BIT
)
2440 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2441 accumSize
-= HOST_CHAR_BIT
;
2442 accum
>>= HOST_CHAR_BIT
;
2443 unpacked_bytes_left
-= 1;
2444 unpacked_idx
+= delta
;
2446 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2448 src_bytes_left
-= 1;
2451 while (unpacked_bytes_left
> 0)
2453 accum
|= sign
<< accumSize
;
2454 unpacked
[unpacked_idx
] = accum
& ~(~0UL << HOST_CHAR_BIT
);
2455 accumSize
-= HOST_CHAR_BIT
;
2458 accum
>>= HOST_CHAR_BIT
;
2459 unpacked_bytes_left
-= 1;
2460 unpacked_idx
+= delta
;
2464 /* Create a new value of type TYPE from the contents of OBJ starting
2465 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2466 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2467 assigning through the result will set the field fetched from.
2468 VALADDR is ignored unless OBJ is NULL, in which case,
2469 VALADDR+OFFSET must address the start of storage containing the
2470 packed value. The value returned in this case is never an lval.
2471 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2474 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2475 long offset
, int bit_offset
, int bit_size
,
2479 const gdb_byte
*src
; /* First byte containing data to unpack */
2481 const int is_scalar
= is_scalar_type (type
);
2482 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2483 gdb::byte_vector staging
;
2485 type
= ada_check_typedef (type
);
2488 src
= valaddr
+ offset
;
2490 src
= value_contents (obj
) + offset
;
2492 if (is_dynamic_type (type
))
2494 /* The length of TYPE might by dynamic, so we need to resolve
2495 TYPE in order to know its actual size, which we then use
2496 to create the contents buffer of the value we return.
2497 The difficulty is that the data containing our object is
2498 packed, and therefore maybe not at a byte boundary. So, what
2499 we do, is unpack the data into a byte-aligned buffer, and then
2500 use that buffer as our object's value for resolving the type. */
2501 int staging_len
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2502 staging
.resize (staging_len
);
2504 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2505 staging
.data (), staging
.size (),
2506 is_big_endian
, has_negatives (type
),
2508 type
= resolve_dynamic_type (type
, staging
, 0);
2509 if (TYPE_LENGTH (type
) < (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
)
2511 /* This happens when the length of the object is dynamic,
2512 and is actually smaller than the space reserved for it.
2513 For instance, in an array of variant records, the bit_size
2514 we're given is the array stride, which is constant and
2515 normally equal to the maximum size of its element.
2516 But, in reality, each element only actually spans a portion
2518 bit_size
= TYPE_LENGTH (type
) * HOST_CHAR_BIT
;
2524 v
= allocate_value (type
);
2525 src
= valaddr
+ offset
;
2527 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2529 int src_len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2532 v
= value_at (type
, value_address (obj
) + offset
);
2533 buf
= (gdb_byte
*) alloca (src_len
);
2534 read_memory (value_address (v
), buf
, src_len
);
2539 v
= allocate_value (type
);
2540 src
= value_contents (obj
) + offset
;
2545 long new_offset
= offset
;
2547 set_value_component_location (v
, obj
);
2548 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2549 set_value_bitsize (v
, bit_size
);
2550 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2553 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2555 set_value_offset (v
, new_offset
);
2557 /* Also set the parent value. This is needed when trying to
2558 assign a new value (in inferior memory). */
2559 set_value_parent (v
, obj
);
2562 set_value_bitsize (v
, bit_size
);
2563 unpacked
= value_contents_writeable (v
);
2567 memset (unpacked
, 0, TYPE_LENGTH (type
));
2571 if (staging
.size () == TYPE_LENGTH (type
))
2573 /* Small short-cut: If we've unpacked the data into a buffer
2574 of the same size as TYPE's length, then we can reuse that,
2575 instead of doing the unpacking again. */
2576 memcpy (unpacked
, staging
.data (), staging
.size ());
2579 ada_unpack_from_contents (src
, bit_offset
, bit_size
,
2580 unpacked
, TYPE_LENGTH (type
),
2581 is_big_endian
, has_negatives (type
), is_scalar
);
2586 /* Store the contents of FROMVAL into the location of TOVAL.
2587 Return a new value with the location of TOVAL and contents of
2588 FROMVAL. Handles assignment into packed fields that have
2589 floating-point or non-scalar types. */
2591 static struct value
*
2592 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2594 struct type
*type
= value_type (toval
);
2595 int bits
= value_bitsize (toval
);
2597 toval
= ada_coerce_ref (toval
);
2598 fromval
= ada_coerce_ref (fromval
);
2600 if (ada_is_direct_array_type (value_type (toval
)))
2601 toval
= ada_coerce_to_simple_array (toval
);
2602 if (ada_is_direct_array_type (value_type (fromval
)))
2603 fromval
= ada_coerce_to_simple_array (fromval
);
2605 if (!deprecated_value_modifiable (toval
))
2606 error (_("Left operand of assignment is not a modifiable lvalue."));
2608 if (VALUE_LVAL (toval
) == lval_memory
2610 && (type
->code () == TYPE_CODE_FLT
2611 || type
->code () == TYPE_CODE_STRUCT
))
2613 int len
= (value_bitpos (toval
)
2614 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2616 gdb_byte
*buffer
= (gdb_byte
*) alloca (len
);
2618 CORE_ADDR to_addr
= value_address (toval
);
2620 if (type
->code () == TYPE_CODE_FLT
)
2621 fromval
= value_cast (type
, fromval
);
2623 read_memory (to_addr
, buffer
, len
);
2624 from_size
= value_bitsize (fromval
);
2626 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2628 const int is_big_endian
= type_byte_order (type
) == BFD_ENDIAN_BIG
;
2629 ULONGEST from_offset
= 0;
2630 if (is_big_endian
&& is_scalar_type (value_type (fromval
)))
2631 from_offset
= from_size
- bits
;
2632 copy_bitwise (buffer
, value_bitpos (toval
),
2633 value_contents (fromval
), from_offset
,
2634 bits
, is_big_endian
);
2635 write_memory_with_notification (to_addr
, buffer
, len
);
2637 val
= value_copy (toval
);
2638 memcpy (value_contents_raw (val
), value_contents (fromval
),
2639 TYPE_LENGTH (type
));
2640 deprecated_set_value_type (val
, type
);
2645 return value_assign (toval
, fromval
);
2649 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2650 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2651 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2652 COMPONENT, and not the inferior's memory. The current contents
2653 of COMPONENT are ignored.
2655 Although not part of the initial design, this function also works
2656 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2657 had a null address, and COMPONENT had an address which is equal to
2658 its offset inside CONTAINER. */
2661 value_assign_to_component (struct value
*container
, struct value
*component
,
2664 LONGEST offset_in_container
=
2665 (LONGEST
) (value_address (component
) - value_address (container
));
2666 int bit_offset_in_container
=
2667 value_bitpos (component
) - value_bitpos (container
);
2670 val
= value_cast (value_type (component
), val
);
2672 if (value_bitsize (component
) == 0)
2673 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2675 bits
= value_bitsize (component
);
2677 if (type_byte_order (value_type (container
)) == BFD_ENDIAN_BIG
)
2681 if (is_scalar_type (check_typedef (value_type (component
))))
2683 = TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
;
2686 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2687 value_bitpos (container
) + bit_offset_in_container
,
2688 value_contents (val
), src_offset
, bits
, 1);
2691 copy_bitwise (value_contents_writeable (container
) + offset_in_container
,
2692 value_bitpos (container
) + bit_offset_in_container
,
2693 value_contents (val
), 0, bits
, 0);
2696 /* Determine if TYPE is an access to an unconstrained array. */
2699 ada_is_access_to_unconstrained_array (struct type
*type
)
2701 return (type
->code () == TYPE_CODE_TYPEDEF
2702 && is_thick_pntr (ada_typedef_target_type (type
)));
2705 /* The value of the element of array ARR at the ARITY indices given in IND.
2706 ARR may be either a simple array, GNAT array descriptor, or pointer
2710 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2714 struct type
*elt_type
;
2716 elt
= ada_coerce_to_simple_array (arr
);
2718 elt_type
= ada_check_typedef (value_type (elt
));
2719 if (elt_type
->code () == TYPE_CODE_ARRAY
2720 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2721 return value_subscript_packed (elt
, arity
, ind
);
2723 for (k
= 0; k
< arity
; k
+= 1)
2725 struct type
*saved_elt_type
= TYPE_TARGET_TYPE (elt_type
);
2727 if (elt_type
->code () != TYPE_CODE_ARRAY
)
2728 error (_("too many subscripts (%d expected)"), k
);
2730 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2732 if (ada_is_access_to_unconstrained_array (saved_elt_type
)
2733 && value_type (elt
)->code () != TYPE_CODE_TYPEDEF
)
2735 /* The element is a typedef to an unconstrained array,
2736 except that the value_subscript call stripped the
2737 typedef layer. The typedef layer is GNAT's way to
2738 specify that the element is, at the source level, an
2739 access to the unconstrained array, rather than the
2740 unconstrained array. So, we need to restore that
2741 typedef layer, which we can do by forcing the element's
2742 type back to its original type. Otherwise, the returned
2743 value is going to be printed as the array, rather
2744 than as an access. Another symptom of the same issue
2745 would be that an expression trying to dereference the
2746 element would also be improperly rejected. */
2747 deprecated_set_value_type (elt
, saved_elt_type
);
2750 elt_type
= ada_check_typedef (value_type (elt
));
2756 /* Assuming ARR is a pointer to a GDB array, the value of the element
2757 of *ARR at the ARITY indices given in IND.
2758 Does not read the entire array into memory.
2760 Note: Unlike what one would expect, this function is used instead of
2761 ada_value_subscript for basically all non-packed array types. The reason
2762 for this is that a side effect of doing our own pointer arithmetics instead
2763 of relying on value_subscript is that there is no implicit typedef peeling.
2764 This is important for arrays of array accesses, where it allows us to
2765 preserve the fact that the array's element is an array access, where the
2766 access part os encoded in a typedef layer. */
2768 static struct value
*
2769 ada_value_ptr_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2772 struct value
*array_ind
= ada_value_ind (arr
);
2774 = check_typedef (value_enclosing_type (array_ind
));
2776 if (type
->code () == TYPE_CODE_ARRAY
2777 && TYPE_FIELD_BITSIZE (type
, 0) > 0)
2778 return value_subscript_packed (array_ind
, arity
, ind
);
2780 for (k
= 0; k
< arity
; k
+= 1)
2784 if (type
->code () != TYPE_CODE_ARRAY
)
2785 error (_("too many subscripts (%d expected)"), k
);
2786 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2788 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2789 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2790 type
= TYPE_TARGET_TYPE (type
);
2793 return value_ind (arr
);
2796 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2797 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2798 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2799 this array is LOW, as per Ada rules. */
2800 static struct value
*
2801 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2804 struct type
*type0
= ada_check_typedef (type
);
2805 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
));
2806 struct type
*index_type
2807 = create_static_range_type (NULL
, base_index_type
, low
, high
);
2808 struct type
*slice_type
= create_array_type_with_stride
2809 (NULL
, TYPE_TARGET_TYPE (type0
), index_type
,
2810 type0
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2811 TYPE_FIELD_BITSIZE (type0
, 0));
2812 int base_low
= ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
));
2813 LONGEST base_low_pos
, low_pos
;
2816 if (!discrete_position (base_index_type
, low
, &low_pos
)
2817 || !discrete_position (base_index_type
, base_low
, &base_low_pos
))
2819 warning (_("unable to get positions in slice, use bounds instead"));
2821 base_low_pos
= base_low
;
2824 base
= value_as_address (array_ptr
)
2825 + ((low_pos
- base_low_pos
)
2826 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2827 return value_at_lazy (slice_type
, base
);
2831 static struct value
*
2832 ada_value_slice (struct value
*array
, int low
, int high
)
2834 struct type
*type
= ada_check_typedef (value_type (array
));
2835 struct type
*base_index_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2836 struct type
*index_type
2837 = create_static_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2838 struct type
*slice_type
= create_array_type_with_stride
2839 (NULL
, TYPE_TARGET_TYPE (type
), index_type
,
2840 type
->dyn_prop (DYN_PROP_BYTE_STRIDE
),
2841 TYPE_FIELD_BITSIZE (type
, 0));
2842 LONGEST low_pos
, high_pos
;
2844 if (!discrete_position (base_index_type
, low
, &low_pos
)
2845 || !discrete_position (base_index_type
, high
, &high_pos
))
2847 warning (_("unable to get positions in slice, use bounds instead"));
2852 return value_cast (slice_type
,
2853 value_slice (array
, low
, high_pos
- low_pos
+ 1));
2856 /* If type is a record type in the form of a standard GNAT array
2857 descriptor, returns the number of dimensions for type. If arr is a
2858 simple array, returns the number of "array of"s that prefix its
2859 type designation. Otherwise, returns 0. */
2862 ada_array_arity (struct type
*type
)
2869 type
= desc_base_type (type
);
2872 if (type
->code () == TYPE_CODE_STRUCT
)
2873 return desc_arity (desc_bounds_type (type
));
2875 while (type
->code () == TYPE_CODE_ARRAY
)
2878 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2884 /* If TYPE is a record type in the form of a standard GNAT array
2885 descriptor or a simple array type, returns the element type for
2886 TYPE after indexing by NINDICES indices, or by all indices if
2887 NINDICES is -1. Otherwise, returns NULL. */
2890 ada_array_element_type (struct type
*type
, int nindices
)
2892 type
= desc_base_type (type
);
2894 if (type
->code () == TYPE_CODE_STRUCT
)
2897 struct type
*p_array_type
;
2899 p_array_type
= desc_data_target_type (type
);
2901 k
= ada_array_arity (type
);
2905 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2906 if (nindices
>= 0 && k
> nindices
)
2908 while (k
> 0 && p_array_type
!= NULL
)
2910 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2913 return p_array_type
;
2915 else if (type
->code () == TYPE_CODE_ARRAY
)
2917 while (nindices
!= 0 && type
->code () == TYPE_CODE_ARRAY
)
2919 type
= TYPE_TARGET_TYPE (type
);
2928 /* The type of nth index in arrays of given type (n numbering from 1).
2929 Does not examine memory. Throws an error if N is invalid or TYPE
2930 is not an array type. NAME is the name of the Ada attribute being
2931 evaluated ('range, 'first, 'last, or 'length); it is used in building
2932 the error message. */
2934 static struct type
*
2935 ada_index_type (struct type
*type
, int n
, const char *name
)
2937 struct type
*result_type
;
2939 type
= desc_base_type (type
);
2941 if (n
< 0 || n
> ada_array_arity (type
))
2942 error (_("invalid dimension number to '%s"), name
);
2944 if (ada_is_simple_array_type (type
))
2948 for (i
= 1; i
< n
; i
+= 1)
2949 type
= TYPE_TARGET_TYPE (type
);
2950 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2951 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2952 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2953 perhaps stabsread.c would make more sense. */
2954 if (result_type
&& result_type
->code () == TYPE_CODE_UNDEF
)
2959 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2960 if (result_type
== NULL
)
2961 error (_("attempt to take bound of something that is not an array"));
2967 /* Given that arr is an array type, returns the lower bound of the
2968 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2969 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2970 array-descriptor type. It works for other arrays with bounds supplied
2971 by run-time quantities other than discriminants. */
2974 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2976 struct type
*type
, *index_type_desc
, *index_type
;
2979 gdb_assert (which
== 0 || which
== 1);
2981 if (ada_is_constrained_packed_array_type (arr_type
))
2982 arr_type
= decode_constrained_packed_array_type (arr_type
);
2984 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2985 return (LONGEST
) - which
;
2987 if (arr_type
->code () == TYPE_CODE_PTR
)
2988 type
= TYPE_TARGET_TYPE (arr_type
);
2992 if (TYPE_FIXED_INSTANCE (type
))
2994 /* The array has already been fixed, so we do not need to
2995 check the parallel ___XA type again. That encoding has
2996 already been applied, so ignore it now. */
2997 index_type_desc
= NULL
;
3001 index_type_desc
= ada_find_parallel_type (type
, "___XA");
3002 ada_fixup_array_indexes_type (index_type_desc
);
3005 if (index_type_desc
!= NULL
)
3006 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
3010 struct type
*elt_type
= check_typedef (type
);
3012 for (i
= 1; i
< n
; i
++)
3013 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
3015 index_type
= TYPE_INDEX_TYPE (elt_type
);
3019 (LONGEST
) (which
== 0
3020 ? ada_discrete_type_low_bound (index_type
)
3021 : ada_discrete_type_high_bound (index_type
));
3024 /* Given that arr is an array value, returns the lower bound of the
3025 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3026 WHICH is 1. This routine will also work for arrays with bounds
3027 supplied by run-time quantities other than discriminants. */
3030 ada_array_bound (struct value
*arr
, int n
, int which
)
3032 struct type
*arr_type
;
3034 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3035 arr
= value_ind (arr
);
3036 arr_type
= value_enclosing_type (arr
);
3038 if (ada_is_constrained_packed_array_type (arr_type
))
3039 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
3040 else if (ada_is_simple_array_type (arr_type
))
3041 return ada_array_bound_from_type (arr_type
, n
, which
);
3043 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
3046 /* Given that arr is an array value, returns the length of the
3047 nth index. This routine will also work for arrays with bounds
3048 supplied by run-time quantities other than discriminants.
3049 Does not work for arrays indexed by enumeration types with representation
3050 clauses at the moment. */
3053 ada_array_length (struct value
*arr
, int n
)
3055 struct type
*arr_type
, *index_type
;
3058 if (check_typedef (value_type (arr
))->code () == TYPE_CODE_PTR
)
3059 arr
= value_ind (arr
);
3060 arr_type
= value_enclosing_type (arr
);
3062 if (ada_is_constrained_packed_array_type (arr_type
))
3063 return ada_array_length (decode_constrained_packed_array (arr
), n
);
3065 if (ada_is_simple_array_type (arr_type
))
3067 low
= ada_array_bound_from_type (arr_type
, n
, 0);
3068 high
= ada_array_bound_from_type (arr_type
, n
, 1);
3072 low
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0));
3073 high
= value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1));
3076 arr_type
= check_typedef (arr_type
);
3077 index_type
= ada_index_type (arr_type
, n
, "length");
3078 if (index_type
!= NULL
)
3080 struct type
*base_type
;
3081 if (index_type
->code () == TYPE_CODE_RANGE
)
3082 base_type
= TYPE_TARGET_TYPE (index_type
);
3084 base_type
= index_type
;
3086 low
= pos_atr (value_from_longest (base_type
, low
));
3087 high
= pos_atr (value_from_longest (base_type
, high
));
3089 return high
- low
+ 1;
3092 /* An array whose type is that of ARR_TYPE (an array type), with
3093 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3094 less than LOW, then LOW-1 is used. */
3096 static struct value
*
3097 empty_array (struct type
*arr_type
, int low
, int high
)
3099 struct type
*arr_type0
= ada_check_typedef (arr_type
);
3100 struct type
*index_type
3101 = create_static_range_type
3102 (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)), low
,
3103 high
< low
? low
- 1 : high
);
3104 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
3106 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
3110 /* Name resolution */
3112 /* The "decoded" name for the user-definable Ada operator corresponding
3116 ada_decoded_op_name (enum exp_opcode op
)
3120 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3122 if (ada_opname_table
[i
].op
== op
)
3123 return ada_opname_table
[i
].decoded
;
3125 error (_("Could not find operator name for opcode"));
3128 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3129 in a listing of choices during disambiguation (see sort_choices, below).
3130 The idea is that overloadings of a subprogram name from the
3131 same package should sort in their source order. We settle for ordering
3132 such symbols by their trailing number (__N or $N). */
3135 encoded_ordered_before (const char *N0
, const char *N1
)
3139 else if (N0
== NULL
)
3145 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3147 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3149 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3150 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3155 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3158 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3160 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3161 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3163 return (strcmp (N0
, N1
) < 0);
3167 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3171 sort_choices (struct block_symbol syms
[], int nsyms
)
3175 for (i
= 1; i
< nsyms
; i
+= 1)
3177 struct block_symbol sym
= syms
[i
];
3180 for (j
= i
- 1; j
>= 0; j
-= 1)
3182 if (encoded_ordered_before (syms
[j
].symbol
->linkage_name (),
3183 sym
.symbol
->linkage_name ()))
3185 syms
[j
+ 1] = syms
[j
];
3191 /* Whether GDB should display formals and return types for functions in the
3192 overloads selection menu. */
3193 static bool print_signatures
= true;
3195 /* Print the signature for SYM on STREAM according to the FLAGS options. For
3196 all but functions, the signature is just the name of the symbol. For
3197 functions, this is the name of the function, the list of types for formals
3198 and the return type (if any). */
3201 ada_print_symbol_signature (struct ui_file
*stream
, struct symbol
*sym
,
3202 const struct type_print_options
*flags
)
3204 struct type
*type
= SYMBOL_TYPE (sym
);
3206 fprintf_filtered (stream
, "%s", sym
->print_name ());
3207 if (!print_signatures
3209 || type
->code () != TYPE_CODE_FUNC
)
3212 if (type
->num_fields () > 0)
3216 fprintf_filtered (stream
, " (");
3217 for (i
= 0; i
< type
->num_fields (); ++i
)
3220 fprintf_filtered (stream
, "; ");
3221 ada_print_type (TYPE_FIELD_TYPE (type
, i
), NULL
, stream
, -1, 0,
3224 fprintf_filtered (stream
, ")");
3226 if (TYPE_TARGET_TYPE (type
) != NULL
3227 && TYPE_TARGET_TYPE (type
)->code () != TYPE_CODE_VOID
)
3229 fprintf_filtered (stream
, " return ");
3230 ada_print_type (TYPE_TARGET_TYPE (type
), NULL
, stream
, -1, 0, flags
);
3234 /* Read and validate a set of numeric choices from the user in the
3235 range 0 .. N_CHOICES-1. Place the results in increasing
3236 order in CHOICES[0 .. N-1], and return N.
3238 The user types choices as a sequence of numbers on one line
3239 separated by blanks, encoding them as follows:
3241 + A choice of 0 means to cancel the selection, throwing an error.
3242 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3243 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3245 The user is not allowed to choose more than MAX_RESULTS values.
3247 ANNOTATION_SUFFIX, if present, is used to annotate the input
3248 prompts (for use with the -f switch). */
3251 get_selections (int *choices
, int n_choices
, int max_results
,
3252 int is_all_choice
, const char *annotation_suffix
)
3257 int first_choice
= is_all_choice
? 2 : 1;
3259 prompt
= getenv ("PS2");
3263 args
= command_line_input (prompt
, annotation_suffix
);
3266 error_no_arg (_("one or more choice numbers"));
3270 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3271 order, as given in args. Choices are validated. */
3277 args
= skip_spaces (args
);
3278 if (*args
== '\0' && n_chosen
== 0)
3279 error_no_arg (_("one or more choice numbers"));
3280 else if (*args
== '\0')
3283 choice
= strtol (args
, &args2
, 10);
3284 if (args
== args2
|| choice
< 0
3285 || choice
> n_choices
+ first_choice
- 1)
3286 error (_("Argument must be choice number"));
3290 error (_("cancelled"));
3292 if (choice
< first_choice
)
3294 n_chosen
= n_choices
;
3295 for (j
= 0; j
< n_choices
; j
+= 1)
3299 choice
-= first_choice
;
3301 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3305 if (j
< 0 || choice
!= choices
[j
])
3309 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3310 choices
[k
+ 1] = choices
[k
];
3311 choices
[j
+ 1] = choice
;
3316 if (n_chosen
> max_results
)
3317 error (_("Select no more than %d of the above"), max_results
);
3322 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3323 by asking the user (if necessary), returning the number selected,
3324 and setting the first elements of SYMS items. Error if no symbols
3327 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3328 to be re-integrated one of these days. */
3331 user_select_syms (struct block_symbol
*syms
, int nsyms
, int max_results
)
3334 int *chosen
= XALLOCAVEC (int , nsyms
);
3336 int first_choice
= (max_results
== 1) ? 1 : 2;
3337 const char *select_mode
= multiple_symbols_select_mode ();
3339 if (max_results
< 1)
3340 error (_("Request to select 0 symbols!"));
3344 if (select_mode
== multiple_symbols_cancel
)
3346 canceled because the command is ambiguous\n\
3347 See set/show multiple-symbol."));
3349 /* If select_mode is "all", then return all possible symbols.
3350 Only do that if more than one symbol can be selected, of course.
3351 Otherwise, display the menu as usual. */
3352 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3355 printf_filtered (_("[0] cancel\n"));
3356 if (max_results
> 1)
3357 printf_filtered (_("[1] all\n"));
3359 sort_choices (syms
, nsyms
);
3361 for (i
= 0; i
< nsyms
; i
+= 1)
3363 if (syms
[i
].symbol
== NULL
)
3366 if (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_BLOCK
)
3368 struct symtab_and_line sal
=
3369 find_function_start_sal (syms
[i
].symbol
, 1);
3371 printf_filtered ("[%d] ", i
+ first_choice
);
3372 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3373 &type_print_raw_options
);
3374 if (sal
.symtab
== NULL
)
3375 printf_filtered (_(" at %p[<no source file available>%p]:%d\n"),
3376 metadata_style
.style ().ptr (), nullptr, sal
.line
);
3380 styled_string (file_name_style
.style (),
3381 symtab_to_filename_for_display (sal
.symtab
)),
3388 (SYMBOL_CLASS (syms
[i
].symbol
) == LOC_CONST
3389 && SYMBOL_TYPE (syms
[i
].symbol
) != NULL
3390 && SYMBOL_TYPE (syms
[i
].symbol
)->code () == TYPE_CODE_ENUM
);
3391 struct symtab
*symtab
= NULL
;
3393 if (SYMBOL_OBJFILE_OWNED (syms
[i
].symbol
))
3394 symtab
= symbol_symtab (syms
[i
].symbol
);
3396 if (SYMBOL_LINE (syms
[i
].symbol
) != 0 && symtab
!= NULL
)
3398 printf_filtered ("[%d] ", i
+ first_choice
);
3399 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3400 &type_print_raw_options
);
3401 printf_filtered (_(" at %s:%d\n"),
3402 symtab_to_filename_for_display (symtab
),
3403 SYMBOL_LINE (syms
[i
].symbol
));
3405 else if (is_enumeral
3406 && SYMBOL_TYPE (syms
[i
].symbol
)->name () != NULL
)
3408 printf_filtered (("[%d] "), i
+ first_choice
);
3409 ada_print_type (SYMBOL_TYPE (syms
[i
].symbol
), NULL
,
3410 gdb_stdout
, -1, 0, &type_print_raw_options
);
3411 printf_filtered (_("'(%s) (enumeral)\n"),
3412 syms
[i
].symbol
->print_name ());
3416 printf_filtered ("[%d] ", i
+ first_choice
);
3417 ada_print_symbol_signature (gdb_stdout
, syms
[i
].symbol
,
3418 &type_print_raw_options
);
3421 printf_filtered (is_enumeral
3422 ? _(" in %s (enumeral)\n")
3424 symtab_to_filename_for_display (symtab
));
3426 printf_filtered (is_enumeral
3427 ? _(" (enumeral)\n")
3433 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3436 for (i
= 0; i
< n_chosen
; i
+= 1)
3437 syms
[i
] = syms
[chosen
[i
]];
3442 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3443 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3444 undefined namespace) and converts operators that are
3445 user-defined into appropriate function calls. If CONTEXT_TYPE is
3446 non-null, it provides a preferred result type [at the moment, only
3447 type void has any effect---causing procedures to be preferred over
3448 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3449 return type is preferred. May change (expand) *EXP. */
3452 resolve (expression_up
*expp
, int void_context_p
, int parse_completion
,
3453 innermost_block_tracker
*tracker
)
3455 struct type
*context_type
= NULL
;
3459 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3461 resolve_subexp (expp
, &pc
, 1, context_type
, parse_completion
, tracker
);
3464 /* Resolve the operator of the subexpression beginning at
3465 position *POS of *EXPP. "Resolving" consists of replacing
3466 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3467 with their resolutions, replacing built-in operators with
3468 function calls to user-defined operators, where appropriate, and,
3469 when DEPROCEDURE_P is non-zero, converting function-valued variables
3470 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3471 are as in ada_resolve, above. */
3473 static struct value
*
3474 resolve_subexp (expression_up
*expp
, int *pos
, int deprocedure_p
,
3475 struct type
*context_type
, int parse_completion
,
3476 innermost_block_tracker
*tracker
)
3480 struct expression
*exp
; /* Convenience: == *expp. */
3481 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3482 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3483 int nargs
; /* Number of operands. */
3490 /* Pass one: resolve operands, saving their types and updating *pos,
3495 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3496 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3501 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3503 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3508 resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3513 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
),
3514 parse_completion
, tracker
);
3517 case OP_ATR_MODULUS
:
3527 case TERNOP_IN_RANGE
:
3528 case BINOP_IN_BOUNDS
:
3534 case OP_DISCRETE_RANGE
:
3536 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3545 arg1
= resolve_subexp (expp
, pos
, 0, NULL
, parse_completion
, tracker
);
3547 resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
, tracker
);
3549 resolve_subexp (expp
, pos
, 1, value_type (arg1
), parse_completion
,
3567 case BINOP_LOGICAL_AND
:
3568 case BINOP_LOGICAL_OR
:
3569 case BINOP_BITWISE_AND
:
3570 case BINOP_BITWISE_IOR
:
3571 case BINOP_BITWISE_XOR
:
3574 case BINOP_NOTEQUAL
:
3581 case BINOP_SUBSCRIPT
:
3589 case UNOP_LOGICAL_NOT
:
3599 case OP_VAR_MSYM_VALUE
:
3606 case OP_INTERNALVAR
:
3616 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3619 case STRUCTOP_STRUCT
:
3620 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3633 error (_("Unexpected operator during name resolution"));
3636 argvec
= XALLOCAVEC (struct value
*, nargs
+ 1);
3637 for (i
= 0; i
< nargs
; i
+= 1)
3638 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
, parse_completion
,
3643 /* Pass two: perform any resolution on principal operator. */
3650 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3652 std::vector
<struct block_symbol
> candidates
;
3656 ada_lookup_symbol_list (exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3657 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3660 if (n_candidates
> 1)
3662 /* Types tend to get re-introduced locally, so if there
3663 are any local symbols that are not types, first filter
3666 for (j
= 0; j
< n_candidates
; j
+= 1)
3667 switch (SYMBOL_CLASS (candidates
[j
].symbol
))
3672 case LOC_REGPARM_ADDR
:
3680 if (j
< n_candidates
)
3683 while (j
< n_candidates
)
3685 if (SYMBOL_CLASS (candidates
[j
].symbol
) == LOC_TYPEDEF
)
3687 candidates
[j
] = candidates
[n_candidates
- 1];
3696 if (n_candidates
== 0)
3697 error (_("No definition found for %s"),
3698 exp
->elts
[pc
+ 2].symbol
->print_name ());
3699 else if (n_candidates
== 1)
3701 else if (deprocedure_p
3702 && !is_nonfunction (candidates
.data (), n_candidates
))
3704 i
= ada_resolve_function
3705 (candidates
.data (), n_candidates
, NULL
, 0,
3706 exp
->elts
[pc
+ 2].symbol
->linkage_name (),
3707 context_type
, parse_completion
);
3709 error (_("Could not find a match for %s"),
3710 exp
->elts
[pc
+ 2].symbol
->print_name ());
3714 printf_filtered (_("Multiple matches for %s\n"),
3715 exp
->elts
[pc
+ 2].symbol
->print_name ());
3716 user_select_syms (candidates
.data (), n_candidates
, 1);
3720 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3721 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].symbol
;
3722 tracker
->update (candidates
[i
]);
3726 && (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
)->code ()
3729 replace_operator_with_call (expp
, pc
, 0, 4,
3730 exp
->elts
[pc
+ 2].symbol
,
3731 exp
->elts
[pc
+ 1].block
);
3738 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3739 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3741 std::vector
<struct block_symbol
> candidates
;
3745 ada_lookup_symbol_list (exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3746 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3749 if (n_candidates
== 1)
3753 i
= ada_resolve_function
3754 (candidates
.data (), n_candidates
,
3756 exp
->elts
[pc
+ 5].symbol
->linkage_name (),
3757 context_type
, parse_completion
);
3759 error (_("Could not find a match for %s"),
3760 exp
->elts
[pc
+ 5].symbol
->print_name ());
3763 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3764 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].symbol
;
3765 tracker
->update (candidates
[i
]);
3776 case BINOP_BITWISE_AND
:
3777 case BINOP_BITWISE_IOR
:
3778 case BINOP_BITWISE_XOR
:
3780 case BINOP_NOTEQUAL
:
3788 case UNOP_LOGICAL_NOT
:
3790 if (possible_user_operator_p (op
, argvec
))
3792 std::vector
<struct block_symbol
> candidates
;
3796 ada_lookup_symbol_list (ada_decoded_op_name (op
),
3800 i
= ada_resolve_function (candidates
.data (), n_candidates
, argvec
,
3801 nargs
, ada_decoded_op_name (op
), NULL
,
3806 replace_operator_with_call (expp
, pc
, nargs
, 1,
3807 candidates
[i
].symbol
,
3808 candidates
[i
].block
);
3819 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
3820 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS
,
3821 exp
->elts
[pc
+ 1].objfile
,
3822 exp
->elts
[pc
+ 2].msymbol
);
3824 return evaluate_subexp_type (exp
, pos
);
3827 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3828 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3830 /* The term "match" here is rather loose. The match is heuristic and
3834 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3836 ftype
= ada_check_typedef (ftype
);
3837 atype
= ada_check_typedef (atype
);
3839 if (ftype
->code () == TYPE_CODE_REF
)
3840 ftype
= TYPE_TARGET_TYPE (ftype
);
3841 if (atype
->code () == TYPE_CODE_REF
)
3842 atype
= TYPE_TARGET_TYPE (atype
);
3844 switch (ftype
->code ())
3847 return ftype
->code () == atype
->code ();
3849 if (atype
->code () == TYPE_CODE_PTR
)
3850 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3851 TYPE_TARGET_TYPE (atype
), 0);
3854 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3856 case TYPE_CODE_ENUM
:
3857 case TYPE_CODE_RANGE
:
3858 switch (atype
->code ())
3861 case TYPE_CODE_ENUM
:
3862 case TYPE_CODE_RANGE
:
3868 case TYPE_CODE_ARRAY
:
3869 return (atype
->code () == TYPE_CODE_ARRAY
3870 || ada_is_array_descriptor_type (atype
));
3872 case TYPE_CODE_STRUCT
:
3873 if (ada_is_array_descriptor_type (ftype
))
3874 return (atype
->code () == TYPE_CODE_ARRAY
3875 || ada_is_array_descriptor_type (atype
));
3877 return (atype
->code () == TYPE_CODE_STRUCT
3878 && !ada_is_array_descriptor_type (atype
));
3880 case TYPE_CODE_UNION
:
3882 return (atype
->code () == ftype
->code ());
3886 /* Return non-zero if the formals of FUNC "sufficiently match" the
3887 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3888 may also be an enumeral, in which case it is treated as a 0-
3889 argument function. */
3892 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3895 struct type
*func_type
= SYMBOL_TYPE (func
);
3897 if (SYMBOL_CLASS (func
) == LOC_CONST
3898 && func_type
->code () == TYPE_CODE_ENUM
)
3899 return (n_actuals
== 0);
3900 else if (func_type
== NULL
|| func_type
->code () != TYPE_CODE_FUNC
)
3903 if (func_type
->num_fields () != n_actuals
)
3906 for (i
= 0; i
< n_actuals
; i
+= 1)
3908 if (actuals
[i
] == NULL
)
3912 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3914 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3916 if (!ada_type_match (ftype
, atype
, 1))
3923 /* False iff function type FUNC_TYPE definitely does not produce a value
3924 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3925 FUNC_TYPE is not a valid function type with a non-null return type
3926 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3929 return_match (struct type
*func_type
, struct type
*context_type
)
3931 struct type
*return_type
;
3933 if (func_type
== NULL
)
3936 if (func_type
->code () == TYPE_CODE_FUNC
)
3937 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3939 return_type
= get_base_type (func_type
);
3940 if (return_type
== NULL
)
3943 context_type
= get_base_type (context_type
);
3945 if (return_type
->code () == TYPE_CODE_ENUM
)
3946 return context_type
== NULL
|| return_type
== context_type
;
3947 else if (context_type
== NULL
)
3948 return return_type
->code () != TYPE_CODE_VOID
;
3950 return return_type
->code () == context_type
->code ();
3954 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3955 function (if any) that matches the types of the NARGS arguments in
3956 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3957 that returns that type, then eliminate matches that don't. If
3958 CONTEXT_TYPE is void and there is at least one match that does not
3959 return void, eliminate all matches that do.
3961 Asks the user if there is more than one match remaining. Returns -1
3962 if there is no such symbol or none is selected. NAME is used
3963 solely for messages. May re-arrange and modify SYMS in
3964 the process; the index returned is for the modified vector. */
3967 ada_resolve_function (struct block_symbol syms
[],
3968 int nsyms
, struct value
**args
, int nargs
,
3969 const char *name
, struct type
*context_type
,
3970 int parse_completion
)
3974 int m
; /* Number of hits */
3977 /* In the first pass of the loop, we only accept functions matching
3978 context_type. If none are found, we add a second pass of the loop
3979 where every function is accepted. */
3980 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3982 for (k
= 0; k
< nsyms
; k
+= 1)
3984 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].symbol
));
3986 if (ada_args_match (syms
[k
].symbol
, args
, nargs
)
3987 && (fallback
|| return_match (type
, context_type
)))
3995 /* If we got multiple matches, ask the user which one to use. Don't do this
3996 interactive thing during completion, though, as the purpose of the
3997 completion is providing a list of all possible matches. Prompting the
3998 user to filter it down would be completely unexpected in this case. */
4001 else if (m
> 1 && !parse_completion
)
4003 printf_filtered (_("Multiple matches for %s\n"), name
);
4004 user_select_syms (syms
, m
, 1);
4010 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
4011 on the function identified by SYM and BLOCK, and taking NARGS
4012 arguments. Update *EXPP as needed to hold more space. */
4015 replace_operator_with_call (expression_up
*expp
, int pc
, int nargs
,
4016 int oplen
, struct symbol
*sym
,
4017 const struct block
*block
)
4019 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4020 symbol, -oplen for operator being replaced). */
4021 struct expression
*newexp
= (struct expression
*)
4022 xzalloc (sizeof (struct expression
)
4023 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
4024 struct expression
*exp
= expp
->get ();
4026 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
4027 newexp
->language_defn
= exp
->language_defn
;
4028 newexp
->gdbarch
= exp
->gdbarch
;
4029 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
4030 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
4031 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
4033 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
4034 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
4036 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
4037 newexp
->elts
[pc
+ 4].block
= block
;
4038 newexp
->elts
[pc
+ 5].symbol
= sym
;
4040 expp
->reset (newexp
);
4043 /* Type-class predicates */
4045 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4049 numeric_type_p (struct type
*type
)
4055 switch (type
->code ())
4060 case TYPE_CODE_RANGE
:
4061 return (type
== TYPE_TARGET_TYPE (type
)
4062 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
4069 /* True iff TYPE is integral (an INT or RANGE of INTs). */
4072 integer_type_p (struct type
*type
)
4078 switch (type
->code ())
4082 case TYPE_CODE_RANGE
:
4083 return (type
== TYPE_TARGET_TYPE (type
)
4084 || integer_type_p (TYPE_TARGET_TYPE (type
)));
4091 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
4094 scalar_type_p (struct type
*type
)
4100 switch (type
->code ())
4103 case TYPE_CODE_RANGE
:
4104 case TYPE_CODE_ENUM
:
4113 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
4116 discrete_type_p (struct type
*type
)
4122 switch (type
->code ())
4125 case TYPE_CODE_RANGE
:
4126 case TYPE_CODE_ENUM
:
4127 case TYPE_CODE_BOOL
:
4135 /* Returns non-zero if OP with operands in the vector ARGS could be
4136 a user-defined function. Errs on the side of pre-defined operators
4137 (i.e., result 0). */
4140 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
4142 struct type
*type0
=
4143 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
4144 struct type
*type1
=
4145 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
4159 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
4163 case BINOP_BITWISE_AND
:
4164 case BINOP_BITWISE_IOR
:
4165 case BINOP_BITWISE_XOR
:
4166 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
4169 case BINOP_NOTEQUAL
:
4174 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
4177 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
4180 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4184 case UNOP_LOGICAL_NOT
:
4186 return (!numeric_type_p (type0
));
4195 1. In the following, we assume that a renaming type's name may
4196 have an ___XD suffix. It would be nice if this went away at some
4198 2. We handle both the (old) purely type-based representation of
4199 renamings and the (new) variable-based encoding. At some point,
4200 it is devoutly to be hoped that the former goes away
4201 (FIXME: hilfinger-2007-07-09).
4202 3. Subprogram renamings are not implemented, although the XRS
4203 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4205 /* If SYM encodes a renaming,
4207 <renaming> renames <renamed entity>,
4209 sets *LEN to the length of the renamed entity's name,
4210 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4211 the string describing the subcomponent selected from the renamed
4212 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4213 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4214 are undefined). Otherwise, returns a value indicating the category
4215 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4216 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4217 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4218 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4219 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4220 may be NULL, in which case they are not assigned.
4222 [Currently, however, GCC does not generate subprogram renamings.] */
4224 enum ada_renaming_category
4225 ada_parse_renaming (struct symbol
*sym
,
4226 const char **renamed_entity
, int *len
,
4227 const char **renaming_expr
)
4229 enum ada_renaming_category kind
;
4234 return ADA_NOT_RENAMING
;
4235 switch (SYMBOL_CLASS (sym
))
4238 return ADA_NOT_RENAMING
;
4242 case LOC_OPTIMIZED_OUT
:
4243 info
= strstr (sym
->linkage_name (), "___XR");
4245 return ADA_NOT_RENAMING
;
4249 kind
= ADA_OBJECT_RENAMING
;
4253 kind
= ADA_EXCEPTION_RENAMING
;
4257 kind
= ADA_PACKAGE_RENAMING
;
4261 kind
= ADA_SUBPROGRAM_RENAMING
;
4265 return ADA_NOT_RENAMING
;
4269 if (renamed_entity
!= NULL
)
4270 *renamed_entity
= info
;
4271 suffix
= strstr (info
, "___XE");
4272 if (suffix
== NULL
|| suffix
== info
)
4273 return ADA_NOT_RENAMING
;
4275 *len
= strlen (info
) - strlen (suffix
);
4277 if (renaming_expr
!= NULL
)
4278 *renaming_expr
= suffix
;
4282 /* Compute the value of the given RENAMING_SYM, which is expected to
4283 be a symbol encoding a renaming expression. BLOCK is the block
4284 used to evaluate the renaming. */
4286 static struct value
*
4287 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4288 const struct block
*block
)
4290 const char *sym_name
;
4292 sym_name
= renaming_sym
->linkage_name ();
4293 expression_up expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4294 return evaluate_expression (expr
.get ());
4298 /* Evaluation: Function Calls */
4300 /* Return an lvalue containing the value VAL. This is the identity on
4301 lvalues, and otherwise has the side-effect of allocating memory
4302 in the inferior where a copy of the value contents is copied. */
4304 static struct value
*
4305 ensure_lval (struct value
*val
)
4307 if (VALUE_LVAL (val
) == not_lval
4308 || VALUE_LVAL (val
) == lval_internalvar
)
4310 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4311 const CORE_ADDR addr
=
4312 value_as_long (value_allocate_space_in_inferior (len
));
4314 VALUE_LVAL (val
) = lval_memory
;
4315 set_value_address (val
, addr
);
4316 write_memory (addr
, value_contents (val
), len
);
4322 /* Given ARG, a value of type (pointer or reference to a)*
4323 structure/union, extract the component named NAME from the ultimate
4324 target structure/union and return it as a value with its
4327 The routine searches for NAME among all members of the structure itself
4328 and (recursively) among all members of any wrapper members
4331 If NO_ERR, then simply return NULL in case of error, rather than
4334 static struct value
*
4335 ada_value_struct_elt (struct value
*arg
, const char *name
, int no_err
)
4337 struct type
*t
, *t1
;
4342 t1
= t
= ada_check_typedef (value_type (arg
));
4343 if (t
->code () == TYPE_CODE_REF
)
4345 t1
= TYPE_TARGET_TYPE (t
);
4348 t1
= ada_check_typedef (t1
);
4349 if (t1
->code () == TYPE_CODE_PTR
)
4351 arg
= coerce_ref (arg
);
4356 while (t
->code () == TYPE_CODE_PTR
)
4358 t1
= TYPE_TARGET_TYPE (t
);
4361 t1
= ada_check_typedef (t1
);
4362 if (t1
->code () == TYPE_CODE_PTR
)
4364 arg
= value_ind (arg
);
4371 if (t1
->code () != TYPE_CODE_STRUCT
&& t1
->code () != TYPE_CODE_UNION
)
4375 v
= ada_search_struct_field (name
, arg
, 0, t
);
4378 int bit_offset
, bit_size
, byte_offset
;
4379 struct type
*field_type
;
4382 if (t
->code () == TYPE_CODE_PTR
)
4383 address
= value_address (ada_value_ind (arg
));
4385 address
= value_address (ada_coerce_ref (arg
));
4387 /* Check to see if this is a tagged type. We also need to handle
4388 the case where the type is a reference to a tagged type, but
4389 we have to be careful to exclude pointers to tagged types.
4390 The latter should be shown as usual (as a pointer), whereas
4391 a reference should mostly be transparent to the user. */
4393 if (ada_is_tagged_type (t1
, 0)
4394 || (t1
->code () == TYPE_CODE_REF
4395 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1
), 0)))
4397 /* We first try to find the searched field in the current type.
4398 If not found then let's look in the fixed type. */
4400 if (!find_struct_field (name
, t1
, 0,
4401 &field_type
, &byte_offset
, &bit_offset
,
4410 /* Convert to fixed type in all cases, so that we have proper
4411 offsets to each field in unconstrained record types. */
4412 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
,
4413 address
, NULL
, check_tag
);
4415 if (find_struct_field (name
, t1
, 0,
4416 &field_type
, &byte_offset
, &bit_offset
,
4421 if (t
->code () == TYPE_CODE_REF
)
4422 arg
= ada_coerce_ref (arg
);
4424 arg
= ada_value_ind (arg
);
4425 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
4426 bit_offset
, bit_size
,
4430 v
= value_at_lazy (field_type
, address
+ byte_offset
);
4434 if (v
!= NULL
|| no_err
)
4437 error (_("There is no member named %s."), name
);
4443 error (_("Attempt to extract a component of "
4444 "a value that is not a record."));
4447 /* Return the value ACTUAL, converted to be an appropriate value for a
4448 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4449 allocating any necessary descriptors (fat pointers), or copies of
4450 values not residing in memory, updating it as needed. */
4453 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4455 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4456 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4457 struct type
*formal_target
=
4458 formal_type
->code () == TYPE_CODE_PTR
4459 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4460 struct type
*actual_target
=
4461 actual_type
->code () == TYPE_CODE_PTR
4462 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4464 if (ada_is_array_descriptor_type (formal_target
)
4465 && actual_target
->code () == TYPE_CODE_ARRAY
)
4466 return make_array_descriptor (formal_type
, actual
);
4467 else if (formal_type
->code () == TYPE_CODE_PTR
4468 || formal_type
->code () == TYPE_CODE_REF
)
4470 struct value
*result
;
4472 if (formal_target
->code () == TYPE_CODE_ARRAY
4473 && ada_is_array_descriptor_type (actual_target
))
4474 result
= desc_data (actual
);
4475 else if (formal_type
->code () != TYPE_CODE_PTR
)
4477 if (VALUE_LVAL (actual
) != lval_memory
)
4481 actual_type
= ada_check_typedef (value_type (actual
));
4482 val
= allocate_value (actual_type
);
4483 memcpy ((char *) value_contents_raw (val
),
4484 (char *) value_contents (actual
),
4485 TYPE_LENGTH (actual_type
));
4486 actual
= ensure_lval (val
);
4488 result
= value_addr (actual
);
4492 return value_cast_pointers (formal_type
, result
, 0);
4494 else if (actual_type
->code () == TYPE_CODE_PTR
)
4495 return ada_value_ind (actual
);
4496 else if (ada_is_aligner_type (formal_type
))
4498 /* We need to turn this parameter into an aligner type
4500 struct value
*aligner
= allocate_value (formal_type
);
4501 struct value
*component
= ada_value_struct_elt (aligner
, "F", 0);
4503 value_assign_to_component (aligner
, component
, actual
);
4510 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4511 type TYPE. This is usually an inefficient no-op except on some targets
4512 (such as AVR) where the representation of a pointer and an address
4516 value_pointer (struct value
*value
, struct type
*type
)
4518 struct gdbarch
*gdbarch
= get_type_arch (type
);
4519 unsigned len
= TYPE_LENGTH (type
);
4520 gdb_byte
*buf
= (gdb_byte
*) alloca (len
);
4523 addr
= value_address (value
);
4524 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4525 addr
= extract_unsigned_integer (buf
, len
, type_byte_order (type
));
4530 /* Push a descriptor of type TYPE for array value ARR on the stack at
4531 *SP, updating *SP to reflect the new descriptor. Return either
4532 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4533 to-descriptor type rather than a descriptor type), a struct value *
4534 representing a pointer to this descriptor. */
4536 static struct value
*
4537 make_array_descriptor (struct type
*type
, struct value
*arr
)
4539 struct type
*bounds_type
= desc_bounds_type (type
);
4540 struct type
*desc_type
= desc_base_type (type
);
4541 struct value
*descriptor
= allocate_value (desc_type
);
4542 struct value
*bounds
= allocate_value (bounds_type
);
4545 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4548 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4549 ada_array_bound (arr
, i
, 0),
4550 desc_bound_bitpos (bounds_type
, i
, 0),
4551 desc_bound_bitsize (bounds_type
, i
, 0));
4552 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4553 ada_array_bound (arr
, i
, 1),
4554 desc_bound_bitpos (bounds_type
, i
, 1),
4555 desc_bound_bitsize (bounds_type
, i
, 1));
4558 bounds
= ensure_lval (bounds
);
4560 modify_field (value_type (descriptor
),
4561 value_contents_writeable (descriptor
),
4562 value_pointer (ensure_lval (arr
),
4563 TYPE_FIELD_TYPE (desc_type
, 0)),
4564 fat_pntr_data_bitpos (desc_type
),
4565 fat_pntr_data_bitsize (desc_type
));
4567 modify_field (value_type (descriptor
),
4568 value_contents_writeable (descriptor
),
4569 value_pointer (bounds
,
4570 TYPE_FIELD_TYPE (desc_type
, 1)),
4571 fat_pntr_bounds_bitpos (desc_type
),
4572 fat_pntr_bounds_bitsize (desc_type
));
4574 descriptor
= ensure_lval (descriptor
);
4576 if (type
->code () == TYPE_CODE_PTR
)
4577 return value_addr (descriptor
);
4582 /* Symbol Cache Module */
4584 /* Performance measurements made as of 2010-01-15 indicate that
4585 this cache does bring some noticeable improvements. Depending
4586 on the type of entity being printed, the cache can make it as much
4587 as an order of magnitude faster than without it.
4589 The descriptive type DWARF extension has significantly reduced
4590 the need for this cache, at least when DWARF is being used. However,
4591 even in this case, some expensive name-based symbol searches are still
4592 sometimes necessary - to find an XVZ variable, mostly. */
4594 /* Initialize the contents of SYM_CACHE. */
4597 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4599 obstack_init (&sym_cache
->cache_space
);
4600 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4603 /* Free the memory used by SYM_CACHE. */
4606 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4608 obstack_free (&sym_cache
->cache_space
, NULL
);
4612 /* Return the symbol cache associated to the given program space PSPACE.
4613 If not allocated for this PSPACE yet, allocate and initialize one. */
4615 static struct ada_symbol_cache
*
4616 ada_get_symbol_cache (struct program_space
*pspace
)
4618 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4620 if (pspace_data
->sym_cache
== NULL
)
4622 pspace_data
->sym_cache
= XCNEW (struct ada_symbol_cache
);
4623 ada_init_symbol_cache (pspace_data
->sym_cache
);
4626 return pspace_data
->sym_cache
;
4629 /* Clear all entries from the symbol cache. */
4632 ada_clear_symbol_cache (void)
4634 struct ada_symbol_cache
*sym_cache
4635 = ada_get_symbol_cache (current_program_space
);
4637 obstack_free (&sym_cache
->cache_space
, NULL
);
4638 ada_init_symbol_cache (sym_cache
);
4641 /* Search our cache for an entry matching NAME and DOMAIN.
4642 Return it if found, or NULL otherwise. */
4644 static struct cache_entry
**
4645 find_entry (const char *name
, domain_enum domain
)
4647 struct ada_symbol_cache
*sym_cache
4648 = ada_get_symbol_cache (current_program_space
);
4649 int h
= msymbol_hash (name
) % HASH_SIZE
;
4650 struct cache_entry
**e
;
4652 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4654 if (domain
== (*e
)->domain
&& strcmp (name
, (*e
)->name
) == 0)
4660 /* Search the symbol cache for an entry matching NAME and DOMAIN.
4661 Return 1 if found, 0 otherwise.
4663 If an entry was found and SYM is not NULL, set *SYM to the entry's
4664 SYM. Same principle for BLOCK if not NULL. */
4667 lookup_cached_symbol (const char *name
, domain_enum domain
,
4668 struct symbol
**sym
, const struct block
**block
)
4670 struct cache_entry
**e
= find_entry (name
, domain
);
4677 *block
= (*e
)->block
;
4681 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4682 in domain DOMAIN, save this result in our symbol cache. */
4685 cache_symbol (const char *name
, domain_enum domain
, struct symbol
*sym
,
4686 const struct block
*block
)
4688 struct ada_symbol_cache
*sym_cache
4689 = ada_get_symbol_cache (current_program_space
);
4691 struct cache_entry
*e
;
4693 /* Symbols for builtin types don't have a block.
4694 For now don't cache such symbols. */
4695 if (sym
!= NULL
&& !SYMBOL_OBJFILE_OWNED (sym
))
4698 /* If the symbol is a local symbol, then do not cache it, as a search
4699 for that symbol depends on the context. To determine whether
4700 the symbol is local or not, we check the block where we found it
4701 against the global and static blocks of its associated symtab. */
4703 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4704 GLOBAL_BLOCK
) != block
4705 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym
)),
4706 STATIC_BLOCK
) != block
)
4709 h
= msymbol_hash (name
) % HASH_SIZE
;
4710 e
= XOBNEW (&sym_cache
->cache_space
, cache_entry
);
4711 e
->next
= sym_cache
->root
[h
];
4712 sym_cache
->root
[h
] = e
;
4713 e
->name
= obstack_strdup (&sym_cache
->cache_space
, name
);
4721 /* Return the symbol name match type that should be used used when
4722 searching for all symbols matching LOOKUP_NAME.
4724 LOOKUP_NAME is expected to be a symbol name after transformation
4727 static symbol_name_match_type
4728 name_match_type_from_name (const char *lookup_name
)
4730 return (strstr (lookup_name
, "__") == NULL
4731 ? symbol_name_match_type::WILD
4732 : symbol_name_match_type::FULL
);
4735 /* Return the result of a standard (literal, C-like) lookup of NAME in
4736 given DOMAIN, visible from lexical block BLOCK. */
4738 static struct symbol
*
4739 standard_lookup (const char *name
, const struct block
*block
,
4742 /* Initialize it just to avoid a GCC false warning. */
4743 struct block_symbol sym
= {};
4745 if (lookup_cached_symbol (name
, domain
, &sym
.symbol
, NULL
))
4747 ada_lookup_encoded_symbol (name
, block
, domain
, &sym
);
4748 cache_symbol (name
, domain
, sym
.symbol
, sym
.block
);
4753 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4754 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4755 since they contend in overloading in the same way. */
4757 is_nonfunction (struct block_symbol syms
[], int n
)
4761 for (i
= 0; i
< n
; i
+= 1)
4762 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_FUNC
4763 && (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
4764 || SYMBOL_CLASS (syms
[i
].symbol
) != LOC_CONST
))
4770 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4771 struct types. Otherwise, they may not. */
4774 equiv_types (struct type
*type0
, struct type
*type1
)
4778 if (type0
== NULL
|| type1
== NULL
4779 || type0
->code () != type1
->code ())
4781 if ((type0
->code () == TYPE_CODE_STRUCT
4782 || type0
->code () == TYPE_CODE_ENUM
)
4783 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4784 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4790 /* True iff SYM0 represents the same entity as SYM1, or one that is
4791 no more defined than that of SYM1. */
4794 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4798 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4799 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4802 switch (SYMBOL_CLASS (sym0
))
4808 struct type
*type0
= SYMBOL_TYPE (sym0
);
4809 struct type
*type1
= SYMBOL_TYPE (sym1
);
4810 const char *name0
= sym0
->linkage_name ();
4811 const char *name1
= sym1
->linkage_name ();
4812 int len0
= strlen (name0
);
4815 type0
->code () == type1
->code ()
4816 && (equiv_types (type0
, type1
)
4817 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4818 && startswith (name1
+ len0
, "___XV")));
4821 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4822 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4826 const char *name0
= sym0
->linkage_name ();
4827 const char *name1
= sym1
->linkage_name ();
4828 return (strcmp (name0
, name1
) == 0
4829 && SYMBOL_VALUE_ADDRESS (sym0
) == SYMBOL_VALUE_ADDRESS (sym1
));
4837 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4838 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4841 add_defn_to_vec (struct obstack
*obstackp
,
4843 const struct block
*block
)
4846 struct block_symbol
*prevDefns
= defns_collected (obstackp
, 0);
4848 /* Do not try to complete stub types, as the debugger is probably
4849 already scanning all symbols matching a certain name at the
4850 time when this function is called. Trying to replace the stub
4851 type by its associated full type will cause us to restart a scan
4852 which may lead to an infinite recursion. Instead, the client
4853 collecting the matching symbols will end up collecting several
4854 matches, with at least one of them complete. It can then filter
4855 out the stub ones if needed. */
4857 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4859 if (lesseq_defined_than (sym
, prevDefns
[i
].symbol
))
4861 else if (lesseq_defined_than (prevDefns
[i
].symbol
, sym
))
4863 prevDefns
[i
].symbol
= sym
;
4864 prevDefns
[i
].block
= block
;
4870 struct block_symbol info
;
4874 obstack_grow (obstackp
, &info
, sizeof (struct block_symbol
));
4878 /* Number of block_symbol structures currently collected in current vector in
4882 num_defns_collected (struct obstack
*obstackp
)
4884 return obstack_object_size (obstackp
) / sizeof (struct block_symbol
);
4887 /* Vector of block_symbol structures currently collected in current vector in
4888 OBSTACKP. If FINISH, close off the vector and return its final address. */
4890 static struct block_symbol
*
4891 defns_collected (struct obstack
*obstackp
, int finish
)
4894 return (struct block_symbol
*) obstack_finish (obstackp
);
4896 return (struct block_symbol
*) obstack_base (obstackp
);
4899 /* Return a bound minimal symbol matching NAME according to Ada
4900 decoding rules. Returns an invalid symbol if there is no such
4901 minimal symbol. Names prefixed with "standard__" are handled
4902 specially: "standard__" is first stripped off, and only static and
4903 global symbols are searched. */
4905 struct bound_minimal_symbol
4906 ada_lookup_simple_minsym (const char *name
)
4908 struct bound_minimal_symbol result
;
4910 memset (&result
, 0, sizeof (result
));
4912 symbol_name_match_type match_type
= name_match_type_from_name (name
);
4913 lookup_name_info
lookup_name (name
, match_type
);
4915 symbol_name_matcher_ftype
*match_name
4916 = ada_get_symbol_name_matcher (lookup_name
);
4918 for (objfile
*objfile
: current_program_space
->objfiles ())
4920 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
4922 if (match_name (msymbol
->linkage_name (), lookup_name
, NULL
)
4923 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4925 result
.minsym
= msymbol
;
4926 result
.objfile
= objfile
;
4935 /* For all subprograms that statically enclose the subprogram of the
4936 selected frame, add symbols matching identifier NAME in DOMAIN
4937 and their blocks to the list of data in OBSTACKP, as for
4938 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4939 with a wildcard prefix. */
4942 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4943 const lookup_name_info
&lookup_name
,
4948 /* True if TYPE is definitely an artificial type supplied to a symbol
4949 for which no debugging information was given in the symbol file. */
4952 is_nondebugging_type (struct type
*type
)
4954 const char *name
= ada_type_name (type
);
4956 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4959 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4960 that are deemed "identical" for practical purposes.
4962 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4963 types and that their number of enumerals is identical (in other
4964 words, type1->num_fields () == type2->num_fields ()). */
4967 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4971 /* The heuristic we use here is fairly conservative. We consider
4972 that 2 enumerate types are identical if they have the same
4973 number of enumerals and that all enumerals have the same
4974 underlying value and name. */
4976 /* All enums in the type should have an identical underlying value. */
4977 for (i
= 0; i
< type1
->num_fields (); i
++)
4978 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4981 /* All enumerals should also have the same name (modulo any numerical
4983 for (i
= 0; i
< type1
->num_fields (); i
++)
4985 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4986 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4987 int len_1
= strlen (name_1
);
4988 int len_2
= strlen (name_2
);
4990 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4991 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4993 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4994 TYPE_FIELD_NAME (type2
, i
),
5002 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
5003 that are deemed "identical" for practical purposes. Sometimes,
5004 enumerals are not strictly identical, but their types are so similar
5005 that they can be considered identical.
5007 For instance, consider the following code:
5009 type Color is (Black, Red, Green, Blue, White);
5010 type RGB_Color is new Color range Red .. Blue;
5012 Type RGB_Color is a subrange of an implicit type which is a copy
5013 of type Color. If we call that implicit type RGB_ColorB ("B" is
5014 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5015 As a result, when an expression references any of the enumeral
5016 by name (Eg. "print green"), the expression is technically
5017 ambiguous and the user should be asked to disambiguate. But
5018 doing so would only hinder the user, since it wouldn't matter
5019 what choice he makes, the outcome would always be the same.
5020 So, for practical purposes, we consider them as the same. */
5023 symbols_are_identical_enums (const std::vector
<struct block_symbol
> &syms
)
5027 /* Before performing a thorough comparison check of each type,
5028 we perform a series of inexpensive checks. We expect that these
5029 checks will quickly fail in the vast majority of cases, and thus
5030 help prevent the unnecessary use of a more expensive comparison.
5031 Said comparison also expects us to make some of these checks
5032 (see ada_identical_enum_types_p). */
5034 /* Quick check: All symbols should have an enum type. */
5035 for (i
= 0; i
< syms
.size (); i
++)
5036 if (SYMBOL_TYPE (syms
[i
].symbol
)->code () != TYPE_CODE_ENUM
)
5039 /* Quick check: They should all have the same value. */
5040 for (i
= 1; i
< syms
.size (); i
++)
5041 if (SYMBOL_VALUE (syms
[i
].symbol
) != SYMBOL_VALUE (syms
[0].symbol
))
5044 /* Quick check: They should all have the same number of enumerals. */
5045 for (i
= 1; i
< syms
.size (); i
++)
5046 if (SYMBOL_TYPE (syms
[i
].symbol
)->num_fields ()
5047 != SYMBOL_TYPE (syms
[0].symbol
)->num_fields ())
5050 /* All the sanity checks passed, so we might have a set of
5051 identical enumeration types. Perform a more complete
5052 comparison of the type of each symbol. */
5053 for (i
= 1; i
< syms
.size (); i
++)
5054 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].symbol
),
5055 SYMBOL_TYPE (syms
[0].symbol
)))
5061 /* Remove any non-debugging symbols in SYMS that definitely
5062 duplicate other symbols in the list (The only case I know of where
5063 this happens is when object files containing stabs-in-ecoff are
5064 linked with files containing ordinary ecoff debugging symbols (or no
5065 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5066 Returns the number of items in the modified list. */
5069 remove_extra_symbols (std::vector
<struct block_symbol
> *syms
)
5073 /* We should never be called with less than 2 symbols, as there
5074 cannot be any extra symbol in that case. But it's easy to
5075 handle, since we have nothing to do in that case. */
5076 if (syms
->size () < 2)
5077 return syms
->size ();
5080 while (i
< syms
->size ())
5084 /* If two symbols have the same name and one of them is a stub type,
5085 the get rid of the stub. */
5087 if (TYPE_STUB (SYMBOL_TYPE ((*syms
)[i
].symbol
))
5088 && (*syms
)[i
].symbol
->linkage_name () != NULL
)
5090 for (j
= 0; j
< syms
->size (); j
++)
5093 && !TYPE_STUB (SYMBOL_TYPE ((*syms
)[j
].symbol
))
5094 && (*syms
)[j
].symbol
->linkage_name () != NULL
5095 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5096 (*syms
)[j
].symbol
->linkage_name ()) == 0)
5101 /* Two symbols with the same name, same class and same address
5102 should be identical. */
5104 else if ((*syms
)[i
].symbol
->linkage_name () != NULL
5105 && SYMBOL_CLASS ((*syms
)[i
].symbol
) == LOC_STATIC
5106 && is_nondebugging_type (SYMBOL_TYPE ((*syms
)[i
].symbol
)))
5108 for (j
= 0; j
< syms
->size (); j
+= 1)
5111 && (*syms
)[j
].symbol
->linkage_name () != NULL
5112 && strcmp ((*syms
)[i
].symbol
->linkage_name (),
5113 (*syms
)[j
].symbol
->linkage_name ()) == 0
5114 && SYMBOL_CLASS ((*syms
)[i
].symbol
)
5115 == SYMBOL_CLASS ((*syms
)[j
].symbol
)
5116 && SYMBOL_VALUE_ADDRESS ((*syms
)[i
].symbol
)
5117 == SYMBOL_VALUE_ADDRESS ((*syms
)[j
].symbol
))
5123 syms
->erase (syms
->begin () + i
);
5128 /* If all the remaining symbols are identical enumerals, then
5129 just keep the first one and discard the rest.
5131 Unlike what we did previously, we do not discard any entry
5132 unless they are ALL identical. This is because the symbol
5133 comparison is not a strict comparison, but rather a practical
5134 comparison. If all symbols are considered identical, then
5135 we can just go ahead and use the first one and discard the rest.
5136 But if we cannot reduce the list to a single element, we have
5137 to ask the user to disambiguate anyways. And if we have to
5138 present a multiple-choice menu, it's less confusing if the list
5139 isn't missing some choices that were identical and yet distinct. */
5140 if (symbols_are_identical_enums (*syms
))
5143 return syms
->size ();
5146 /* Given a type that corresponds to a renaming entity, use the type name
5147 to extract the scope (package name or function name, fully qualified,
5148 and following the GNAT encoding convention) where this renaming has been
5152 xget_renaming_scope (struct type
*renaming_type
)
5154 /* The renaming types adhere to the following convention:
5155 <scope>__<rename>___<XR extension>.
5156 So, to extract the scope, we search for the "___XR" extension,
5157 and then backtrack until we find the first "__". */
5159 const char *name
= renaming_type
->name ();
5160 const char *suffix
= strstr (name
, "___XR");
5163 /* Now, backtrack a bit until we find the first "__". Start looking
5164 at suffix - 3, as the <rename> part is at least one character long. */
5166 for (last
= suffix
- 3; last
> name
; last
--)
5167 if (last
[0] == '_' && last
[1] == '_')
5170 /* Make a copy of scope and return it. */
5171 return std::string (name
, last
);
5174 /* Return nonzero if NAME corresponds to a package name. */
5177 is_package_name (const char *name
)
5179 /* Here, We take advantage of the fact that no symbols are generated
5180 for packages, while symbols are generated for each function.
5181 So the condition for NAME represent a package becomes equivalent
5182 to NAME not existing in our list of symbols. There is only one
5183 small complication with library-level functions (see below). */
5185 /* If it is a function that has not been defined at library level,
5186 then we should be able to look it up in the symbols. */
5187 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
5190 /* Library-level function names start with "_ada_". See if function
5191 "_ada_" followed by NAME can be found. */
5193 /* Do a quick check that NAME does not contain "__", since library-level
5194 functions names cannot contain "__" in them. */
5195 if (strstr (name
, "__") != NULL
)
5198 std::string fun_name
= string_printf ("_ada_%s", name
);
5200 return (standard_lookup (fun_name
.c_str (), NULL
, VAR_DOMAIN
) == NULL
);
5203 /* Return nonzero if SYM corresponds to a renaming entity that is
5204 not visible from FUNCTION_NAME. */
5207 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
5209 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
5212 std::string scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
5214 /* If the rename has been defined in a package, then it is visible. */
5215 if (is_package_name (scope
.c_str ()))
5218 /* Check that the rename is in the current function scope by checking
5219 that its name starts with SCOPE. */
5221 /* If the function name starts with "_ada_", it means that it is
5222 a library-level function. Strip this prefix before doing the
5223 comparison, as the encoding for the renaming does not contain
5225 if (startswith (function_name
, "_ada_"))
5228 return !startswith (function_name
, scope
.c_str ());
5231 /* Remove entries from SYMS that corresponds to a renaming entity that
5232 is not visible from the function associated with CURRENT_BLOCK or
5233 that is superfluous due to the presence of more specific renaming
5234 information. Places surviving symbols in the initial entries of
5235 SYMS and returns the number of surviving symbols.
5238 First, in cases where an object renaming is implemented as a
5239 reference variable, GNAT may produce both the actual reference
5240 variable and the renaming encoding. In this case, we discard the
5243 Second, GNAT emits a type following a specified encoding for each renaming
5244 entity. Unfortunately, STABS currently does not support the definition
5245 of types that are local to a given lexical block, so all renamings types
5246 are emitted at library level. As a consequence, if an application
5247 contains two renaming entities using the same name, and a user tries to
5248 print the value of one of these entities, the result of the ada symbol
5249 lookup will also contain the wrong renaming type.
5251 This function partially covers for this limitation by attempting to
5252 remove from the SYMS list renaming symbols that should be visible
5253 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5254 method with the current information available. The implementation
5255 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5257 - When the user tries to print a rename in a function while there
5258 is another rename entity defined in a package: Normally, the
5259 rename in the function has precedence over the rename in the
5260 package, so the latter should be removed from the list. This is
5261 currently not the case.
5263 - This function will incorrectly remove valid renames if
5264 the CURRENT_BLOCK corresponds to a function which symbol name
5265 has been changed by an "Export" pragma. As a consequence,
5266 the user will be unable to print such rename entities. */
5269 remove_irrelevant_renamings (std::vector
<struct block_symbol
> *syms
,
5270 const struct block
*current_block
)
5272 struct symbol
*current_function
;
5273 const char *current_function_name
;
5275 int is_new_style_renaming
;
5277 /* If there is both a renaming foo___XR... encoded as a variable and
5278 a simple variable foo in the same block, discard the latter.
5279 First, zero out such symbols, then compress. */
5280 is_new_style_renaming
= 0;
5281 for (i
= 0; i
< syms
->size (); i
+= 1)
5283 struct symbol
*sym
= (*syms
)[i
].symbol
;
5284 const struct block
*block
= (*syms
)[i
].block
;
5288 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5290 name
= sym
->linkage_name ();
5291 suffix
= strstr (name
, "___XR");
5295 int name_len
= suffix
- name
;
5298 is_new_style_renaming
= 1;
5299 for (j
= 0; j
< syms
->size (); j
+= 1)
5300 if (i
!= j
&& (*syms
)[j
].symbol
!= NULL
5301 && strncmp (name
, (*syms
)[j
].symbol
->linkage_name (),
5303 && block
== (*syms
)[j
].block
)
5304 (*syms
)[j
].symbol
= NULL
;
5307 if (is_new_style_renaming
)
5311 for (j
= k
= 0; j
< syms
->size (); j
+= 1)
5312 if ((*syms
)[j
].symbol
!= NULL
)
5314 (*syms
)[k
] = (*syms
)[j
];
5320 /* Extract the function name associated to CURRENT_BLOCK.
5321 Abort if unable to do so. */
5323 if (current_block
== NULL
)
5324 return syms
->size ();
5326 current_function
= block_linkage_function (current_block
);
5327 if (current_function
== NULL
)
5328 return syms
->size ();
5330 current_function_name
= current_function
->linkage_name ();
5331 if (current_function_name
== NULL
)
5332 return syms
->size ();
5334 /* Check each of the symbols, and remove it from the list if it is
5335 a type corresponding to a renaming that is out of the scope of
5336 the current block. */
5339 while (i
< syms
->size ())
5341 if (ada_parse_renaming ((*syms
)[i
].symbol
, NULL
, NULL
, NULL
)
5342 == ADA_OBJECT_RENAMING
5343 && old_renaming_is_invisible ((*syms
)[i
].symbol
,
5344 current_function_name
))
5345 syms
->erase (syms
->begin () + i
);
5350 return syms
->size ();
5353 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5354 whose name and domain match NAME and DOMAIN respectively.
5355 If no match was found, then extend the search to "enclosing"
5356 routines (in other words, if we're inside a nested function,
5357 search the symbols defined inside the enclosing functions).
5358 If WILD_MATCH_P is nonzero, perform the naming matching in
5359 "wild" mode (see function "wild_match" for more info).
5361 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5364 ada_add_local_symbols (struct obstack
*obstackp
,
5365 const lookup_name_info
&lookup_name
,
5366 const struct block
*block
, domain_enum domain
)
5368 int block_depth
= 0;
5370 while (block
!= NULL
)
5373 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5375 /* If we found a non-function match, assume that's the one. */
5376 if (is_nonfunction (defns_collected (obstackp
, 0),
5377 num_defns_collected (obstackp
)))
5380 block
= BLOCK_SUPERBLOCK (block
);
5383 /* If no luck so far, try to find NAME as a local symbol in some lexically
5384 enclosing subprogram. */
5385 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5386 add_symbols_from_enclosing_procs (obstackp
, lookup_name
, domain
);
5389 /* An object of this type is used as the user_data argument when
5390 calling the map_matching_symbols method. */
5394 struct objfile
*objfile
;
5395 struct obstack
*obstackp
;
5396 struct symbol
*arg_sym
;
5400 /* A callback for add_nonlocal_symbols that adds symbol, found in BSYM,
5401 to a list of symbols. DATA is a pointer to a struct match_data *
5402 containing the obstack that collects the symbol list, the file that SYM
5403 must come from, a flag indicating whether a non-argument symbol has
5404 been found in the current block, and the last argument symbol
5405 passed in SYM within the current block (if any). When SYM is null,
5406 marking the end of a block, the argument symbol is added if no
5407 other has been found. */
5410 aux_add_nonlocal_symbols (struct block_symbol
*bsym
,
5411 struct match_data
*data
)
5413 const struct block
*block
= bsym
->block
;
5414 struct symbol
*sym
= bsym
->symbol
;
5418 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5419 add_defn_to_vec (data
->obstackp
,
5420 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5422 data
->found_sym
= 0;
5423 data
->arg_sym
= NULL
;
5427 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5429 else if (SYMBOL_IS_ARGUMENT (sym
))
5430 data
->arg_sym
= sym
;
5433 data
->found_sym
= 1;
5434 add_defn_to_vec (data
->obstackp
,
5435 fixup_symbol_section (sym
, data
->objfile
),
5442 /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5443 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5444 symbols to OBSTACKP. Return whether we found such symbols. */
5447 ada_add_block_renamings (struct obstack
*obstackp
,
5448 const struct block
*block
,
5449 const lookup_name_info
&lookup_name
,
5452 struct using_direct
*renaming
;
5453 int defns_mark
= num_defns_collected (obstackp
);
5455 symbol_name_matcher_ftype
*name_match
5456 = ada_get_symbol_name_matcher (lookup_name
);
5458 for (renaming
= block_using (block
);
5460 renaming
= renaming
->next
)
5464 /* Avoid infinite recursions: skip this renaming if we are actually
5465 already traversing it.
5467 Currently, symbol lookup in Ada don't use the namespace machinery from
5468 C++/Fortran support: skip namespace imports that use them. */
5469 if (renaming
->searched
5470 || (renaming
->import_src
!= NULL
5471 && renaming
->import_src
[0] != '\0')
5472 || (renaming
->import_dest
!= NULL
5473 && renaming
->import_dest
[0] != '\0'))
5475 renaming
->searched
= 1;
5477 /* TODO: here, we perform another name-based symbol lookup, which can
5478 pull its own multiple overloads. In theory, we should be able to do
5479 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5480 not a simple name. But in order to do this, we would need to enhance
5481 the DWARF reader to associate a symbol to this renaming, instead of a
5482 name. So, for now, we do something simpler: re-use the C++/Fortran
5483 namespace machinery. */
5484 r_name
= (renaming
->alias
!= NULL
5486 : renaming
->declaration
);
5487 if (name_match (r_name
, lookup_name
, NULL
))
5489 lookup_name_info
decl_lookup_name (renaming
->declaration
,
5490 lookup_name
.match_type ());
5491 ada_add_all_symbols (obstackp
, block
, decl_lookup_name
, domain
,
5494 renaming
->searched
= 0;
5496 return num_defns_collected (obstackp
) != defns_mark
;
5499 /* Implements compare_names, but only applying the comparision using
5500 the given CASING. */
5503 compare_names_with_case (const char *string1
, const char *string2
,
5504 enum case_sensitivity casing
)
5506 while (*string1
!= '\0' && *string2
!= '\0')
5510 if (isspace (*string1
) || isspace (*string2
))
5511 return strcmp_iw_ordered (string1
, string2
);
5513 if (casing
== case_sensitive_off
)
5515 c1
= tolower (*string1
);
5516 c2
= tolower (*string2
);
5533 return strcmp_iw_ordered (string1
, string2
);
5535 if (*string2
== '\0')
5537 if (is_name_suffix (string1
))
5544 if (*string2
== '(')
5545 return strcmp_iw_ordered (string1
, string2
);
5548 if (casing
== case_sensitive_off
)
5549 return tolower (*string1
) - tolower (*string2
);
5551 return *string1
- *string2
;
5556 /* Compare STRING1 to STRING2, with results as for strcmp.
5557 Compatible with strcmp_iw_ordered in that...
5559 strcmp_iw_ordered (STRING1, STRING2) <= 0
5563 compare_names (STRING1, STRING2) <= 0
5565 (they may differ as to what symbols compare equal). */
5568 compare_names (const char *string1
, const char *string2
)
5572 /* Similar to what strcmp_iw_ordered does, we need to perform
5573 a case-insensitive comparison first, and only resort to
5574 a second, case-sensitive, comparison if the first one was
5575 not sufficient to differentiate the two strings. */
5577 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5579 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5584 /* Convenience function to get at the Ada encoded lookup name for
5585 LOOKUP_NAME, as a C string. */
5588 ada_lookup_name (const lookup_name_info
&lookup_name
)
5590 return lookup_name
.ada ().lookup_name ().c_str ();
5593 /* Add to OBSTACKP all non-local symbols whose name and domain match
5594 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5595 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5596 symbols otherwise. */
5599 add_nonlocal_symbols (struct obstack
*obstackp
,
5600 const lookup_name_info
&lookup_name
,
5601 domain_enum domain
, int global
)
5603 struct match_data data
;
5605 memset (&data
, 0, sizeof data
);
5606 data
.obstackp
= obstackp
;
5608 bool is_wild_match
= lookup_name
.ada ().wild_match_p ();
5610 auto callback
= [&] (struct block_symbol
*bsym
)
5612 return aux_add_nonlocal_symbols (bsym
, &data
);
5615 for (objfile
*objfile
: current_program_space
->objfiles ())
5617 data
.objfile
= objfile
;
5619 objfile
->sf
->qf
->map_matching_symbols (objfile
, lookup_name
,
5620 domain
, global
, callback
,
5622 ? NULL
: compare_names
));
5624 for (compunit_symtab
*cu
: objfile
->compunits ())
5626 const struct block
*global_block
5627 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu
), GLOBAL_BLOCK
);
5629 if (ada_add_block_renamings (obstackp
, global_block
, lookup_name
,
5635 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5637 const char *name
= ada_lookup_name (lookup_name
);
5638 std::string bracket_name
= std::string ("<_ada_") + name
+ '>';
5639 lookup_name_info
name1 (bracket_name
, symbol_name_match_type::FULL
);
5641 for (objfile
*objfile
: current_program_space
->objfiles ())
5643 data
.objfile
= objfile
;
5644 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
,
5645 domain
, global
, callback
,
5651 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5652 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5653 returning the number of matches. Add these to OBSTACKP.
5655 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5656 symbol match within the nest of blocks whose innermost member is BLOCK,
5657 is the one match returned (no other matches in that or
5658 enclosing blocks is returned). If there are any matches in or
5659 surrounding BLOCK, then these alone are returned.
5661 Names prefixed with "standard__" are handled specially:
5662 "standard__" is first stripped off (by the lookup_name
5663 constructor), and only static and global symbols are searched.
5665 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5666 to lookup global symbols. */
5669 ada_add_all_symbols (struct obstack
*obstackp
,
5670 const struct block
*block
,
5671 const lookup_name_info
&lookup_name
,
5674 int *made_global_lookup_p
)
5678 if (made_global_lookup_p
)
5679 *made_global_lookup_p
= 0;
5681 /* Special case: If the user specifies a symbol name inside package
5682 Standard, do a non-wild matching of the symbol name without
5683 the "standard__" prefix. This was primarily introduced in order
5684 to allow the user to specifically access the standard exceptions
5685 using, for instance, Standard.Constraint_Error when Constraint_Error
5686 is ambiguous (due to the user defining its own Constraint_Error
5687 entity inside its program). */
5688 if (lookup_name
.ada ().standard_p ())
5691 /* Check the non-global symbols. If we have ANY match, then we're done. */
5696 ada_add_local_symbols (obstackp
, lookup_name
, block
, domain
);
5699 /* In the !full_search case we're are being called by
5700 ada_iterate_over_symbols, and we don't want to search
5702 ada_add_block_symbols (obstackp
, block
, lookup_name
, domain
, NULL
);
5704 if (num_defns_collected (obstackp
) > 0 || !full_search
)
5708 /* No non-global symbols found. Check our cache to see if we have
5709 already performed this search before. If we have, then return
5712 if (lookup_cached_symbol (ada_lookup_name (lookup_name
),
5713 domain
, &sym
, &block
))
5716 add_defn_to_vec (obstackp
, sym
, block
);
5720 if (made_global_lookup_p
)
5721 *made_global_lookup_p
= 1;
5723 /* Search symbols from all global blocks. */
5725 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 1);
5727 /* Now add symbols from all per-file blocks if we've gotten no hits
5728 (not strictly correct, but perhaps better than an error). */
5730 if (num_defns_collected (obstackp
) == 0)
5731 add_nonlocal_symbols (obstackp
, lookup_name
, domain
, 0);
5734 /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5735 is non-zero, enclosing scope and in global scopes, returning the number of
5737 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5738 found and the blocks and symbol tables (if any) in which they were
5741 When full_search is non-zero, any non-function/non-enumeral
5742 symbol match within the nest of blocks whose innermost member is BLOCK,
5743 is the one match returned (no other matches in that or
5744 enclosing blocks is returned). If there are any matches in or
5745 surrounding BLOCK, then these alone are returned.
5747 Names prefixed with "standard__" are handled specially: "standard__"
5748 is first stripped off, and only static and global symbols are searched. */
5751 ada_lookup_symbol_list_worker (const lookup_name_info
&lookup_name
,
5752 const struct block
*block
,
5754 std::vector
<struct block_symbol
> *results
,
5757 int syms_from_global_search
;
5759 auto_obstack obstack
;
5761 ada_add_all_symbols (&obstack
, block
, lookup_name
,
5762 domain
, full_search
, &syms_from_global_search
);
5764 ndefns
= num_defns_collected (&obstack
);
5766 struct block_symbol
*base
= defns_collected (&obstack
, 1);
5767 for (int i
= 0; i
< ndefns
; ++i
)
5768 results
->push_back (base
[i
]);
5770 ndefns
= remove_extra_symbols (results
);
5772 if (ndefns
== 0 && full_search
&& syms_from_global_search
)
5773 cache_symbol (ada_lookup_name (lookup_name
), domain
, NULL
, NULL
);
5775 if (ndefns
== 1 && full_search
&& syms_from_global_search
)
5776 cache_symbol (ada_lookup_name (lookup_name
), domain
,
5777 (*results
)[0].symbol
, (*results
)[0].block
);
5779 ndefns
= remove_irrelevant_renamings (results
, block
);
5784 /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
5785 in global scopes, returning the number of matches, and filling *RESULTS
5786 with (SYM,BLOCK) tuples.
5788 See ada_lookup_symbol_list_worker for further details. */
5791 ada_lookup_symbol_list (const char *name
, const struct block
*block
,
5793 std::vector
<struct block_symbol
> *results
)
5795 symbol_name_match_type name_match_type
= name_match_type_from_name (name
);
5796 lookup_name_info
lookup_name (name
, name_match_type
);
5798 return ada_lookup_symbol_list_worker (lookup_name
, block
, domain
, results
, 1);
5801 /* Implementation of the la_iterate_over_symbols method. */
5804 ada_iterate_over_symbols
5805 (const struct block
*block
, const lookup_name_info
&name
,
5807 gdb::function_view
<symbol_found_callback_ftype
> callback
)
5810 std::vector
<struct block_symbol
> results
;
5812 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5814 for (i
= 0; i
< ndefs
; ++i
)
5816 if (!callback (&results
[i
]))
5823 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5824 to 1, but choosing the first symbol found if there are multiple
5827 The result is stored in *INFO, which must be non-NULL.
5828 If no match is found, INFO->SYM is set to NULL. */
5831 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5833 struct block_symbol
*info
)
5835 /* Since we already have an encoded name, wrap it in '<>' to force a
5836 verbatim match. Otherwise, if the name happens to not look like
5837 an encoded name (because it doesn't include a "__"),
5838 ada_lookup_name_info would re-encode/fold it again, and that
5839 would e.g., incorrectly lowercase object renaming names like
5840 "R28b" -> "r28b". */
5841 std::string verbatim
= std::string ("<") + name
+ '>';
5843 gdb_assert (info
!= NULL
);
5844 *info
= ada_lookup_symbol (verbatim
.c_str (), block
, domain
);
5847 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5848 scope and in global scopes, or NULL if none. NAME is folded and
5849 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5850 choosing the first symbol if there are multiple choices. */
5853 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5856 std::vector
<struct block_symbol
> candidates
;
5859 n_candidates
= ada_lookup_symbol_list (name
, block0
, domain
, &candidates
);
5861 if (n_candidates
== 0)
5864 block_symbol info
= candidates
[0];
5865 info
.symbol
= fixup_symbol_section (info
.symbol
, NULL
);
5869 static struct block_symbol
5870 ada_lookup_symbol_nonlocal (const struct language_defn
*langdef
,
5872 const struct block
*block
,
5873 const domain_enum domain
)
5875 struct block_symbol sym
;
5877 sym
= ada_lookup_symbol (name
, block_static_block (block
), domain
);
5878 if (sym
.symbol
!= NULL
)
5881 /* If we haven't found a match at this point, try the primitive
5882 types. In other languages, this search is performed before
5883 searching for global symbols in order to short-circuit that
5884 global-symbol search if it happens that the name corresponds
5885 to a primitive type. But we cannot do the same in Ada, because
5886 it is perfectly legitimate for a program to declare a type which
5887 has the same name as a standard type. If looking up a type in
5888 that situation, we have traditionally ignored the primitive type
5889 in favor of user-defined types. This is why, unlike most other
5890 languages, we search the primitive types this late and only after
5891 having searched the global symbols without success. */
5893 if (domain
== VAR_DOMAIN
)
5895 struct gdbarch
*gdbarch
;
5898 gdbarch
= target_gdbarch ();
5900 gdbarch
= block_gdbarch (block
);
5901 sym
.symbol
= language_lookup_primitive_type_as_symbol (langdef
, gdbarch
, name
);
5902 if (sym
.symbol
!= NULL
)
5910 /* True iff STR is a possible encoded suffix of a normal Ada name
5911 that is to be ignored for matching purposes. Suffixes of parallel
5912 names (e.g., XVE) are not included here. Currently, the possible suffixes
5913 are given by any of the regular expressions:
5915 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5916 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5917 TKB [subprogram suffix for task bodies]
5918 _E[0-9]+[bs]$ [protected object entry suffixes]
5919 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5921 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5922 match is performed. This sequence is used to differentiate homonyms,
5923 is an optional part of a valid name suffix. */
5926 is_name_suffix (const char *str
)
5929 const char *matching
;
5930 const int len
= strlen (str
);
5932 /* Skip optional leading __[0-9]+. */
5934 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5937 while (isdigit (str
[0]))
5943 if (str
[0] == '.' || str
[0] == '$')
5946 while (isdigit (matching
[0]))
5948 if (matching
[0] == '\0')
5954 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5957 while (isdigit (matching
[0]))
5959 if (matching
[0] == '\0')
5963 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5965 if (strcmp (str
, "TKB") == 0)
5969 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5970 with a N at the end. Unfortunately, the compiler uses the same
5971 convention for other internal types it creates. So treating
5972 all entity names that end with an "N" as a name suffix causes
5973 some regressions. For instance, consider the case of an enumerated
5974 type. To support the 'Image attribute, it creates an array whose
5976 Having a single character like this as a suffix carrying some
5977 information is a bit risky. Perhaps we should change the encoding
5978 to be something like "_N" instead. In the meantime, do not do
5979 the following check. */
5980 /* Protected Object Subprograms */
5981 if (len
== 1 && str
[0] == 'N')
5986 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5989 while (isdigit (matching
[0]))
5991 if ((matching
[0] == 'b' || matching
[0] == 's')
5992 && matching
[1] == '\0')
5996 /* ??? We should not modify STR directly, as we are doing below. This
5997 is fine in this case, but may become problematic later if we find
5998 that this alternative did not work, and want to try matching
5999 another one from the begining of STR. Since we modified it, we
6000 won't be able to find the begining of the string anymore! */
6004 while (str
[0] != '_' && str
[0] != '\0')
6006 if (str
[0] != 'n' && str
[0] != 'b')
6012 if (str
[0] == '\000')
6017 if (str
[1] != '_' || str
[2] == '\000')
6021 if (strcmp (str
+ 3, "JM") == 0)
6023 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6024 the LJM suffix in favor of the JM one. But we will
6025 still accept LJM as a valid suffix for a reasonable
6026 amount of time, just to allow ourselves to debug programs
6027 compiled using an older version of GNAT. */
6028 if (strcmp (str
+ 3, "LJM") == 0)
6032 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
6033 || str
[4] == 'U' || str
[4] == 'P')
6035 if (str
[4] == 'R' && str
[5] != 'T')
6039 if (!isdigit (str
[2]))
6041 for (k
= 3; str
[k
] != '\0'; k
+= 1)
6042 if (!isdigit (str
[k
]) && str
[k
] != '_')
6046 if (str
[0] == '$' && isdigit (str
[1]))
6048 for (k
= 2; str
[k
] != '\0'; k
+= 1)
6049 if (!isdigit (str
[k
]) && str
[k
] != '_')
6056 /* Return non-zero if the string starting at NAME and ending before
6057 NAME_END contains no capital letters. */
6060 is_valid_name_for_wild_match (const char *name0
)
6062 std::string decoded_name
= ada_decode (name0
);
6065 /* If the decoded name starts with an angle bracket, it means that
6066 NAME0 does not follow the GNAT encoding format. It should then
6067 not be allowed as a possible wild match. */
6068 if (decoded_name
[0] == '<')
6071 for (i
=0; decoded_name
[i
] != '\0'; i
++)
6072 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
6078 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6079 that could start a simple name. Assumes that *NAMEP points into
6080 the string beginning at NAME0. */
6083 advance_wild_match (const char **namep
, const char *name0
, int target0
)
6085 const char *name
= *namep
;
6095 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
6098 if (name
== name0
+ 5 && startswith (name0
, "_ada"))
6103 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
6104 || name
[2] == target0
))
6112 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
6122 /* Return true iff NAME encodes a name of the form prefix.PATN.
6123 Ignores any informational suffixes of NAME (i.e., for which
6124 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6128 wild_match (const char *name
, const char *patn
)
6131 const char *name0
= name
;
6135 const char *match
= name
;
6139 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
6142 if (*p
== '\0' && is_name_suffix (name
))
6143 return match
== name0
|| is_valid_name_for_wild_match (name0
);
6145 if (name
[-1] == '_')
6148 if (!advance_wild_match (&name
, name0
, *patn
))
6153 /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6154 any trailing suffixes that encode debugging information or leading
6155 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6156 information that is ignored). */
6159 full_match (const char *sym_name
, const char *search_name
)
6161 size_t search_name_len
= strlen (search_name
);
6163 if (strncmp (sym_name
, search_name
, search_name_len
) == 0
6164 && is_name_suffix (sym_name
+ search_name_len
))
6167 if (startswith (sym_name
, "_ada_")
6168 && strncmp (sym_name
+ 5, search_name
, search_name_len
) == 0
6169 && is_name_suffix (sym_name
+ search_name_len
+ 5))
6175 /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6176 *defn_symbols, updating the list of symbols in OBSTACKP (if
6177 necessary). OBJFILE is the section containing BLOCK. */
6180 ada_add_block_symbols (struct obstack
*obstackp
,
6181 const struct block
*block
,
6182 const lookup_name_info
&lookup_name
,
6183 domain_enum domain
, struct objfile
*objfile
)
6185 struct block_iterator iter
;
6186 /* A matching argument symbol, if any. */
6187 struct symbol
*arg_sym
;
6188 /* Set true when we find a matching non-argument symbol. */
6194 for (sym
= block_iter_match_first (block
, lookup_name
, &iter
);
6196 sym
= block_iter_match_next (lookup_name
, &iter
))
6198 if (symbol_matches_domain (sym
->language (), SYMBOL_DOMAIN (sym
), domain
))
6200 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6202 if (SYMBOL_IS_ARGUMENT (sym
))
6207 add_defn_to_vec (obstackp
,
6208 fixup_symbol_section (sym
, objfile
),
6215 /* Handle renamings. */
6217 if (ada_add_block_renamings (obstackp
, block
, lookup_name
, domain
))
6220 if (!found_sym
&& arg_sym
!= NULL
)
6222 add_defn_to_vec (obstackp
,
6223 fixup_symbol_section (arg_sym
, objfile
),
6227 if (!lookup_name
.ada ().wild_match_p ())
6231 const std::string
&ada_lookup_name
= lookup_name
.ada ().lookup_name ();
6232 const char *name
= ada_lookup_name
.c_str ();
6233 size_t name_len
= ada_lookup_name
.size ();
6235 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
6237 if (symbol_matches_domain (sym
->language (),
6238 SYMBOL_DOMAIN (sym
), domain
))
6242 cmp
= (int) '_' - (int) sym
->linkage_name ()[0];
6245 cmp
= !startswith (sym
->linkage_name (), "_ada_");
6247 cmp
= strncmp (name
, sym
->linkage_name () + 5,
6252 && is_name_suffix (sym
->linkage_name () + name_len
+ 5))
6254 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
6256 if (SYMBOL_IS_ARGUMENT (sym
))
6261 add_defn_to_vec (obstackp
,
6262 fixup_symbol_section (sym
, objfile
),
6270 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6271 They aren't parameters, right? */
6272 if (!found_sym
&& arg_sym
!= NULL
)
6274 add_defn_to_vec (obstackp
,
6275 fixup_symbol_section (arg_sym
, objfile
),
6282 /* Symbol Completion */
6287 ada_lookup_name_info::matches
6288 (const char *sym_name
,
6289 symbol_name_match_type match_type
,
6290 completion_match_result
*comp_match_res
) const
6293 const char *text
= m_encoded_name
.c_str ();
6294 size_t text_len
= m_encoded_name
.size ();
6296 /* First, test against the fully qualified name of the symbol. */
6298 if (strncmp (sym_name
, text
, text_len
) == 0)
6301 std::string decoded_name
= ada_decode (sym_name
);
6302 if (match
&& !m_encoded_p
)
6304 /* One needed check before declaring a positive match is to verify
6305 that iff we are doing a verbatim match, the decoded version
6306 of the symbol name starts with '<'. Otherwise, this symbol name
6307 is not a suitable completion. */
6309 bool has_angle_bracket
= (decoded_name
[0] == '<');
6310 match
= (has_angle_bracket
== m_verbatim_p
);
6313 if (match
&& !m_verbatim_p
)
6315 /* When doing non-verbatim match, another check that needs to
6316 be done is to verify that the potentially matching symbol name
6317 does not include capital letters, because the ada-mode would
6318 not be able to understand these symbol names without the
6319 angle bracket notation. */
6322 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6327 /* Second: Try wild matching... */
6329 if (!match
&& m_wild_match_p
)
6331 /* Since we are doing wild matching, this means that TEXT
6332 may represent an unqualified symbol name. We therefore must
6333 also compare TEXT against the unqualified name of the symbol. */
6334 sym_name
= ada_unqualified_name (decoded_name
.c_str ());
6336 if (strncmp (sym_name
, text
, text_len
) == 0)
6340 /* Finally: If we found a match, prepare the result to return. */
6345 if (comp_match_res
!= NULL
)
6347 std::string
&match_str
= comp_match_res
->match
.storage ();
6350 match_str
= ada_decode (sym_name
);
6354 match_str
= add_angle_brackets (sym_name
);
6356 match_str
= sym_name
;
6360 comp_match_res
->set_match (match_str
.c_str ());
6366 /* Add the list of possible symbol names completing TEXT to TRACKER.
6367 WORD is the entire command on which completion is made. */
6370 ada_collect_symbol_completion_matches (completion_tracker
&tracker
,
6371 complete_symbol_mode mode
,
6372 symbol_name_match_type name_match_type
,
6373 const char *text
, const char *word
,
6374 enum type_code code
)
6377 const struct block
*b
, *surrounding_static_block
= 0;
6378 struct block_iterator iter
;
6380 gdb_assert (code
== TYPE_CODE_UNDEF
);
6382 lookup_name_info
lookup_name (text
, name_match_type
, true);
6384 /* First, look at the partial symtab symbols. */
6385 expand_symtabs_matching (NULL
,
6391 /* At this point scan through the misc symbol vectors and add each
6392 symbol you find to the list. Eventually we want to ignore
6393 anything that isn't a text symbol (everything else will be
6394 handled by the psymtab code above). */
6396 for (objfile
*objfile
: current_program_space
->objfiles ())
6398 for (minimal_symbol
*msymbol
: objfile
->msymbols ())
6402 if (completion_skip_symbol (mode
, msymbol
))
6405 language symbol_language
= msymbol
->language ();
6407 /* Ada minimal symbols won't have their language set to Ada. If
6408 we let completion_list_add_name compare using the
6409 default/C-like matcher, then when completing e.g., symbols in a
6410 package named "pck", we'd match internal Ada symbols like
6411 "pckS", which are invalid in an Ada expression, unless you wrap
6412 them in '<' '>' to request a verbatim match.
6414 Unfortunately, some Ada encoded names successfully demangle as
6415 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6416 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6417 with the wrong language set. Paper over that issue here. */
6418 if (symbol_language
== language_auto
6419 || symbol_language
== language_cplus
)
6420 symbol_language
= language_ada
;
6422 completion_list_add_name (tracker
,
6424 msymbol
->linkage_name (),
6425 lookup_name
, text
, word
);
6429 /* Search upwards from currently selected frame (so that we can
6430 complete on local vars. */
6432 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6434 if (!BLOCK_SUPERBLOCK (b
))
6435 surrounding_static_block
= b
; /* For elmin of dups */
6437 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6439 if (completion_skip_symbol (mode
, sym
))
6442 completion_list_add_name (tracker
,
6444 sym
->linkage_name (),
6445 lookup_name
, text
, word
);
6449 /* Go through the symtabs and check the externs and statics for
6450 symbols which match. */
6452 for (objfile
*objfile
: current_program_space
->objfiles ())
6454 for (compunit_symtab
*s
: objfile
->compunits ())
6457 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6458 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6460 if (completion_skip_symbol (mode
, sym
))
6463 completion_list_add_name (tracker
,
6465 sym
->linkage_name (),
6466 lookup_name
, text
, word
);
6471 for (objfile
*objfile
: current_program_space
->objfiles ())
6473 for (compunit_symtab
*s
: objfile
->compunits ())
6476 b
= BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s
), STATIC_BLOCK
);
6477 /* Don't do this block twice. */
6478 if (b
== surrounding_static_block
)
6480 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6482 if (completion_skip_symbol (mode
, sym
))
6485 completion_list_add_name (tracker
,
6487 sym
->linkage_name (),
6488 lookup_name
, text
, word
);
6496 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6497 for tagged types. */
6500 ada_is_dispatch_table_ptr_type (struct type
*type
)
6504 if (type
->code () != TYPE_CODE_PTR
)
6507 name
= TYPE_TARGET_TYPE (type
)->name ();
6511 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6514 /* Return non-zero if TYPE is an interface tag. */
6517 ada_is_interface_tag (struct type
*type
)
6519 const char *name
= type
->name ();
6524 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6527 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6528 to be invisible to users. */
6531 ada_is_ignored_field (struct type
*type
, int field_num
)
6533 if (field_num
< 0 || field_num
> type
->num_fields ())
6536 /* Check the name of that field. */
6538 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6540 /* Anonymous field names should not be printed.
6541 brobecker/2007-02-20: I don't think this can actually happen
6542 but we don't want to print the value of anonymous fields anyway. */
6546 /* Normally, fields whose name start with an underscore ("_")
6547 are fields that have been internally generated by the compiler,
6548 and thus should not be printed. The "_parent" field is special,
6549 however: This is a field internally generated by the compiler
6550 for tagged types, and it contains the components inherited from
6551 the parent type. This field should not be printed as is, but
6552 should not be ignored either. */
6553 if (name
[0] == '_' && !startswith (name
, "_parent"))
6557 /* If this is the dispatch table of a tagged type or an interface tag,
6559 if (ada_is_tagged_type (type
, 1)
6560 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6561 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6564 /* Not a special field, so it should not be ignored. */
6568 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6569 pointer or reference type whose ultimate target has a tag field. */
6572 ada_is_tagged_type (struct type
*type
, int refok
)
6574 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1) != NULL
);
6577 /* True iff TYPE represents the type of X'Tag */
6580 ada_is_tag_type (struct type
*type
)
6582 type
= ada_check_typedef (type
);
6584 if (type
== NULL
|| type
->code () != TYPE_CODE_PTR
)
6588 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6590 return (name
!= NULL
6591 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6595 /* The type of the tag on VAL. */
6597 static struct type
*
6598 ada_tag_type (struct value
*val
)
6600 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0);
6603 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6604 retired at Ada 05). */
6607 is_ada95_tag (struct value
*tag
)
6609 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6612 /* The value of the tag on VAL. */
6614 static struct value
*
6615 ada_value_tag (struct value
*val
)
6617 return ada_value_struct_elt (val
, "_tag", 0);
6620 /* The value of the tag on the object of type TYPE whose contents are
6621 saved at VALADDR, if it is non-null, or is at memory address
6624 static struct value
*
6625 value_tag_from_contents_and_address (struct type
*type
,
6626 const gdb_byte
*valaddr
,
6629 int tag_byte_offset
;
6630 struct type
*tag_type
;
6632 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6635 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6637 : valaddr
+ tag_byte_offset
);
6638 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6640 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6645 static struct type
*
6646 type_from_tag (struct value
*tag
)
6648 const char *type_name
= ada_tag_name (tag
);
6650 if (type_name
!= NULL
)
6651 return ada_find_any_type (ada_encode (type_name
));
6655 /* Given a value OBJ of a tagged type, return a value of this
6656 type at the base address of the object. The base address, as
6657 defined in Ada.Tags, it is the address of the primary tag of
6658 the object, and therefore where the field values of its full
6659 view can be fetched. */
6662 ada_tag_value_at_base_address (struct value
*obj
)
6665 LONGEST offset_to_top
= 0;
6666 struct type
*ptr_type
, *obj_type
;
6668 CORE_ADDR base_address
;
6670 obj_type
= value_type (obj
);
6672 /* It is the responsability of the caller to deref pointers. */
6674 if (obj_type
->code () == TYPE_CODE_PTR
|| obj_type
->code () == TYPE_CODE_REF
)
6677 tag
= ada_value_tag (obj
);
6681 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6683 if (is_ada95_tag (tag
))
6686 ptr_type
= language_lookup_primitive_type
6687 (language_def (language_ada
), target_gdbarch(), "storage_offset");
6688 ptr_type
= lookup_pointer_type (ptr_type
);
6689 val
= value_cast (ptr_type
, tag
);
6693 /* It is perfectly possible that an exception be raised while
6694 trying to determine the base address, just like for the tag;
6695 see ada_tag_name for more details. We do not print the error
6696 message for the same reason. */
6700 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6703 catch (const gdb_exception_error
&e
)
6708 /* If offset is null, nothing to do. */
6710 if (offset_to_top
== 0)
6713 /* -1 is a special case in Ada.Tags; however, what should be done
6714 is not quite clear from the documentation. So do nothing for
6717 if (offset_to_top
== -1)
6720 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6721 from the base address. This was however incompatible with
6722 C++ dispatch table: C++ uses a *negative* value to *add*
6723 to the base address. Ada's convention has therefore been
6724 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6725 use the same convention. Here, we support both cases by
6726 checking the sign of OFFSET_TO_TOP. */
6728 if (offset_to_top
> 0)
6729 offset_to_top
= -offset_to_top
;
6731 base_address
= value_address (obj
) + offset_to_top
;
6732 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6734 /* Make sure that we have a proper tag at the new address.
6735 Otherwise, offset_to_top is bogus (which can happen when
6736 the object is not initialized yet). */
6741 obj_type
= type_from_tag (tag
);
6746 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6749 /* Return the "ada__tags__type_specific_data" type. */
6751 static struct type
*
6752 ada_get_tsd_type (struct inferior
*inf
)
6754 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6756 if (data
->tsd_type
== 0)
6757 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6758 return data
->tsd_type
;
6761 /* Return the TSD (type-specific data) associated to the given TAG.
6762 TAG is assumed to be the tag of a tagged-type entity.
6764 May return NULL if we are unable to get the TSD. */
6766 static struct value
*
6767 ada_get_tsd_from_tag (struct value
*tag
)
6772 /* First option: The TSD is simply stored as a field of our TAG.
6773 Only older versions of GNAT would use this format, but we have
6774 to test it first, because there are no visible markers for
6775 the current approach except the absence of that field. */
6777 val
= ada_value_struct_elt (tag
, "tsd", 1);
6781 /* Try the second representation for the dispatch table (in which
6782 there is no explicit 'tsd' field in the referent of the tag pointer,
6783 and instead the tsd pointer is stored just before the dispatch
6786 type
= ada_get_tsd_type (current_inferior());
6789 type
= lookup_pointer_type (lookup_pointer_type (type
));
6790 val
= value_cast (type
, tag
);
6793 return value_ind (value_ptradd (val
, -1));
6796 /* Given the TSD of a tag (type-specific data), return a string
6797 containing the name of the associated type.
6799 The returned value is good until the next call. May return NULL
6800 if we are unable to determine the tag name. */
6803 ada_tag_name_from_tsd (struct value
*tsd
)
6805 static char name
[1024];
6809 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6812 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6813 for (p
= name
; *p
!= '\0'; p
+= 1)
6819 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6822 Return NULL if the TAG is not an Ada tag, or if we were unable to
6823 determine the name of that tag. The result is good until the next
6827 ada_tag_name (struct value
*tag
)
6831 if (!ada_is_tag_type (value_type (tag
)))
6834 /* It is perfectly possible that an exception be raised while trying
6835 to determine the TAG's name, even under normal circumstances:
6836 The associated variable may be uninitialized or corrupted, for
6837 instance. We do not let any exception propagate past this point.
6838 instead we return NULL.
6840 We also do not print the error message either (which often is very
6841 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6842 the caller print a more meaningful message if necessary. */
6845 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6848 name
= ada_tag_name_from_tsd (tsd
);
6850 catch (const gdb_exception_error
&e
)
6857 /* The parent type of TYPE, or NULL if none. */
6860 ada_parent_type (struct type
*type
)
6864 type
= ada_check_typedef (type
);
6866 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
6869 for (i
= 0; i
< type
->num_fields (); i
+= 1)
6870 if (ada_is_parent_field (type
, i
))
6872 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6874 /* If the _parent field is a pointer, then dereference it. */
6875 if (parent_type
->code () == TYPE_CODE_PTR
)
6876 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6877 /* If there is a parallel XVS type, get the actual base type. */
6878 parent_type
= ada_get_base_type (parent_type
);
6880 return ada_check_typedef (parent_type
);
6886 /* True iff field number FIELD_NUM of structure type TYPE contains the
6887 parent-type (inherited) fields of a derived type. Assumes TYPE is
6888 a structure type with at least FIELD_NUM+1 fields. */
6891 ada_is_parent_field (struct type
*type
, int field_num
)
6893 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6895 return (name
!= NULL
6896 && (startswith (name
, "PARENT")
6897 || startswith (name
, "_parent")));
6900 /* True iff field number FIELD_NUM of structure type TYPE is a
6901 transparent wrapper field (which should be silently traversed when doing
6902 field selection and flattened when printing). Assumes TYPE is a
6903 structure type with at least FIELD_NUM+1 fields. Such fields are always
6907 ada_is_wrapper_field (struct type
*type
, int field_num
)
6909 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6911 if (name
!= NULL
&& strcmp (name
, "RETVAL") == 0)
6913 /* This happens in functions with "out" or "in out" parameters
6914 which are passed by copy. For such functions, GNAT describes
6915 the function's return type as being a struct where the return
6916 value is in a field called RETVAL, and where the other "out"
6917 or "in out" parameters are fields of that struct. This is not
6922 return (name
!= NULL
6923 && (startswith (name
, "PARENT")
6924 || strcmp (name
, "REP") == 0
6925 || startswith (name
, "_parent")
6926 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6929 /* True iff field number FIELD_NUM of structure or union type TYPE
6930 is a variant wrapper. Assumes TYPE is a structure type with at least
6931 FIELD_NUM+1 fields. */
6934 ada_is_variant_part (struct type
*type
, int field_num
)
6936 /* Only Ada types are eligible. */
6937 if (!ADA_TYPE_P (type
))
6940 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6942 return (field_type
->code () == TYPE_CODE_UNION
6943 || (is_dynamic_field (type
, field_num
)
6944 && (TYPE_TARGET_TYPE (field_type
)->code ()
6945 == TYPE_CODE_UNION
)));
6948 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6949 whose discriminants are contained in the record type OUTER_TYPE,
6950 returns the type of the controlling discriminant for the variant.
6951 May return NULL if the type could not be found. */
6954 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6956 const char *name
= ada_variant_discrim_name (var_type
);
6958 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1);
6961 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6962 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6963 represents a 'when others' clause; otherwise 0. */
6966 ada_is_others_clause (struct type
*type
, int field_num
)
6968 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6970 return (name
!= NULL
&& name
[0] == 'O');
6973 /* Assuming that TYPE0 is the type of the variant part of a record,
6974 returns the name of the discriminant controlling the variant.
6975 The value is valid until the next call to ada_variant_discrim_name. */
6978 ada_variant_discrim_name (struct type
*type0
)
6980 static char *result
= NULL
;
6981 static size_t result_len
= 0;
6984 const char *discrim_end
;
6985 const char *discrim_start
;
6987 if (type0
->code () == TYPE_CODE_PTR
)
6988 type
= TYPE_TARGET_TYPE (type0
);
6992 name
= ada_type_name (type
);
6994 if (name
== NULL
|| name
[0] == '\000')
6997 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
7000 if (startswith (discrim_end
, "___XVN"))
7003 if (discrim_end
== name
)
7006 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
7009 if (discrim_start
== name
+ 1)
7011 if ((discrim_start
> name
+ 3
7012 && startswith (discrim_start
- 3, "___"))
7013 || discrim_start
[-1] == '.')
7017 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
7018 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
7019 result
[discrim_end
- discrim_start
] = '\0';
7023 /* Scan STR for a subtype-encoded number, beginning at position K.
7024 Put the position of the character just past the number scanned in
7025 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7026 Return 1 if there was a valid number at the given position, and 0
7027 otherwise. A "subtype-encoded" number consists of the absolute value
7028 in decimal, followed by the letter 'm' to indicate a negative number.
7029 Assumes 0m does not occur. */
7032 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
7036 if (!isdigit (str
[k
]))
7039 /* Do it the hard way so as not to make any assumption about
7040 the relationship of unsigned long (%lu scan format code) and
7043 while (isdigit (str
[k
]))
7045 RU
= RU
* 10 + (str
[k
] - '0');
7052 *R
= (-(LONGEST
) (RU
- 1)) - 1;
7058 /* NOTE on the above: Technically, C does not say what the results of
7059 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7060 number representable as a LONGEST (although either would probably work
7061 in most implementations). When RU>0, the locution in the then branch
7062 above is always equivalent to the negative of RU. */
7069 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7070 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7071 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
7074 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
7076 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
7090 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
7100 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
7101 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
7103 if (val
>= L
&& val
<= U
)
7115 /* FIXME: Lots of redundancy below. Try to consolidate. */
7117 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7118 ARG_TYPE, extract and return the value of one of its (non-static)
7119 fields. FIELDNO says which field. Differs from value_primitive_field
7120 only in that it can handle packed values of arbitrary type. */
7123 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
7124 struct type
*arg_type
)
7128 arg_type
= ada_check_typedef (arg_type
);
7129 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
7131 /* Handle packed fields. It might be that the field is not packed
7132 relative to its containing structure, but the structure itself is
7133 packed; in this case we must take the bit-field path. */
7134 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0 || value_bitpos (arg1
) != 0)
7136 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
7137 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
7139 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
7140 offset
+ bit_pos
/ 8,
7141 bit_pos
% 8, bit_size
, type
);
7144 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
7147 /* Find field with name NAME in object of type TYPE. If found,
7148 set the following for each argument that is non-null:
7149 - *FIELD_TYPE_P to the field's type;
7150 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7151 an object of that type;
7152 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7153 - *BIT_SIZE_P to its size in bits if the field is packed, and
7155 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7156 fields up to but not including the desired field, or by the total
7157 number of fields if not found. A NULL value of NAME never
7158 matches; the function just counts visible fields in this case.
7160 Notice that we need to handle when a tagged record hierarchy
7161 has some components with the same name, like in this scenario:
7163 type Top_T is tagged record
7169 type Middle_T is new Top.Top_T with record
7170 N : Character := 'a';
7174 type Bottom_T is new Middle.Middle_T with record
7176 C : Character := '5';
7178 A : Character := 'J';
7181 Let's say we now have a variable declared and initialized as follow:
7183 TC : Top_A := new Bottom_T;
7185 And then we use this variable to call this function
7187 procedure Assign (Obj: in out Top_T; TV : Integer);
7191 Assign (Top_T (B), 12);
7193 Now, we're in the debugger, and we're inside that procedure
7194 then and we want to print the value of obj.c:
7196 Usually, the tagged record or one of the parent type owns the
7197 component to print and there's no issue but in this particular
7198 case, what does it mean to ask for Obj.C? Since the actual
7199 type for object is type Bottom_T, it could mean two things: type
7200 component C from the Middle_T view, but also component C from
7201 Bottom_T. So in that "undefined" case, when the component is
7202 not found in the non-resolved type (which includes all the
7203 components of the parent type), then resolve it and see if we
7204 get better luck once expanded.
7206 In the case of homonyms in the derived tagged type, we don't
7207 guaranty anything, and pick the one that's easiest for us
7210 Returns 1 if found, 0 otherwise. */
7213 find_struct_field (const char *name
, struct type
*type
, int offset
,
7214 struct type
**field_type_p
,
7215 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
7219 int parent_offset
= -1;
7221 type
= ada_check_typedef (type
);
7223 if (field_type_p
!= NULL
)
7224 *field_type_p
= NULL
;
7225 if (byte_offset_p
!= NULL
)
7227 if (bit_offset_p
!= NULL
)
7229 if (bit_size_p
!= NULL
)
7232 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7234 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
7235 int fld_offset
= offset
+ bit_pos
/ 8;
7236 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7238 if (t_field_name
== NULL
)
7241 else if (ada_is_parent_field (type
, i
))
7243 /* This is a field pointing us to the parent type of a tagged
7244 type. As hinted in this function's documentation, we give
7245 preference to fields in the current record first, so what
7246 we do here is just record the index of this field before
7247 we skip it. If it turns out we couldn't find our field
7248 in the current record, then we'll get back to it and search
7249 inside it whether the field might exist in the parent. */
7255 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
7257 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
7259 if (field_type_p
!= NULL
)
7260 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
7261 if (byte_offset_p
!= NULL
)
7262 *byte_offset_p
= fld_offset
;
7263 if (bit_offset_p
!= NULL
)
7264 *bit_offset_p
= bit_pos
% 8;
7265 if (bit_size_p
!= NULL
)
7266 *bit_size_p
= bit_size
;
7269 else if (ada_is_wrapper_field (type
, i
))
7271 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
7272 field_type_p
, byte_offset_p
, bit_offset_p
,
7273 bit_size_p
, index_p
))
7276 else if (ada_is_variant_part (type
, i
))
7278 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7281 struct type
*field_type
7282 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7284 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7286 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
7288 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7289 field_type_p
, byte_offset_p
,
7290 bit_offset_p
, bit_size_p
, index_p
))
7294 else if (index_p
!= NULL
)
7298 /* Field not found so far. If this is a tagged type which
7299 has a parent, try finding that field in the parent now. */
7301 if (parent_offset
!= -1)
7303 int bit_pos
= TYPE_FIELD_BITPOS (type
, parent_offset
);
7304 int fld_offset
= offset
+ bit_pos
/ 8;
7306 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, parent_offset
),
7307 fld_offset
, field_type_p
, byte_offset_p
,
7308 bit_offset_p
, bit_size_p
, index_p
))
7315 /* Number of user-visible fields in record type TYPE. */
7318 num_visible_fields (struct type
*type
)
7323 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
7327 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
7328 and search in it assuming it has (class) type TYPE.
7329 If found, return value, else return NULL.
7331 Searches recursively through wrapper fields (e.g., '_parent').
7333 In the case of homonyms in the tagged types, please refer to the
7334 long explanation in find_struct_field's function documentation. */
7336 static struct value
*
7337 ada_search_struct_field (const char *name
, struct value
*arg
, int offset
,
7341 int parent_offset
= -1;
7343 type
= ada_check_typedef (type
);
7344 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7346 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7348 if (t_field_name
== NULL
)
7351 else if (ada_is_parent_field (type
, i
))
7353 /* This is a field pointing us to the parent type of a tagged
7354 type. As hinted in this function's documentation, we give
7355 preference to fields in the current record first, so what
7356 we do here is just record the index of this field before
7357 we skip it. If it turns out we couldn't find our field
7358 in the current record, then we'll get back to it and search
7359 inside it whether the field might exist in the parent. */
7365 else if (field_name_match (t_field_name
, name
))
7366 return ada_value_primitive_field (arg
, offset
, i
, type
);
7368 else if (ada_is_wrapper_field (type
, i
))
7370 struct value
*v
= /* Do not let indent join lines here. */
7371 ada_search_struct_field (name
, arg
,
7372 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7373 TYPE_FIELD_TYPE (type
, i
));
7379 else if (ada_is_variant_part (type
, i
))
7381 /* PNH: Do we ever get here? See find_struct_field. */
7383 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7385 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7387 for (j
= 0; j
< field_type
->num_fields (); j
+= 1)
7389 struct value
*v
= ada_search_struct_field
/* Force line
7392 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7393 TYPE_FIELD_TYPE (field_type
, j
));
7401 /* Field not found so far. If this is a tagged type which
7402 has a parent, try finding that field in the parent now. */
7404 if (parent_offset
!= -1)
7406 struct value
*v
= ada_search_struct_field (
7407 name
, arg
, offset
+ TYPE_FIELD_BITPOS (type
, parent_offset
) / 8,
7408 TYPE_FIELD_TYPE (type
, parent_offset
));
7417 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7418 int, struct type
*);
7421 /* Return field #INDEX in ARG, where the index is that returned by
7422 * find_struct_field through its INDEX_P argument. Adjust the address
7423 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7424 * If found, return value, else return NULL. */
7426 static struct value
*
7427 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7430 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7434 /* Auxiliary function for ada_index_struct_field. Like
7435 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7438 static struct value
*
7439 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7443 type
= ada_check_typedef (type
);
7445 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7447 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7449 else if (ada_is_wrapper_field (type
, i
))
7451 struct value
*v
= /* Do not let indent join lines here. */
7452 ada_index_struct_field_1 (index_p
, arg
,
7453 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7454 TYPE_FIELD_TYPE (type
, i
));
7460 else if (ada_is_variant_part (type
, i
))
7462 /* PNH: Do we ever get here? See ada_search_struct_field,
7463 find_struct_field. */
7464 error (_("Cannot assign this kind of variant record"));
7466 else if (*index_p
== 0)
7467 return ada_value_primitive_field (arg
, offset
, i
, type
);
7474 /* Return a string representation of type TYPE. */
7477 type_as_string (struct type
*type
)
7479 string_file tmp_stream
;
7481 type_print (type
, "", &tmp_stream
, -1);
7483 return std::move (tmp_stream
.string ());
7486 /* Given a type TYPE, look up the type of the component of type named NAME.
7487 If DISPP is non-null, add its byte displacement from the beginning of a
7488 structure (pointed to by a value) of type TYPE to *DISPP (does not
7489 work for packed fields).
7491 Matches any field whose name has NAME as a prefix, possibly
7494 TYPE can be either a struct or union. If REFOK, TYPE may also
7495 be a (pointer or reference)+ to a struct or union, and the
7496 ultimate target type will be searched.
7498 Looks recursively into variant clauses and parent types.
7500 In the case of homonyms in the tagged types, please refer to the
7501 long explanation in find_struct_field's function documentation.
7503 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7504 TYPE is not a type of the right kind. */
7506 static struct type
*
7507 ada_lookup_struct_elt_type (struct type
*type
, const char *name
, int refok
,
7511 int parent_offset
= -1;
7516 if (refok
&& type
!= NULL
)
7519 type
= ada_check_typedef (type
);
7520 if (type
->code () != TYPE_CODE_PTR
&& type
->code () != TYPE_CODE_REF
)
7522 type
= TYPE_TARGET_TYPE (type
);
7526 || (type
->code () != TYPE_CODE_STRUCT
7527 && type
->code () != TYPE_CODE_UNION
))
7532 error (_("Type %s is not a structure or union type"),
7533 type
!= NULL
? type_as_string (type
).c_str () : _("(null)"));
7536 type
= to_static_fixed_type (type
);
7538 for (i
= 0; i
< type
->num_fields (); i
+= 1)
7540 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7543 if (t_field_name
== NULL
)
7546 else if (ada_is_parent_field (type
, i
))
7548 /* This is a field pointing us to the parent type of a tagged
7549 type. As hinted in this function's documentation, we give
7550 preference to fields in the current record first, so what
7551 we do here is just record the index of this field before
7552 we skip it. If it turns out we couldn't find our field
7553 in the current record, then we'll get back to it and search
7554 inside it whether the field might exist in the parent. */
7560 else if (field_name_match (t_field_name
, name
))
7561 return TYPE_FIELD_TYPE (type
, i
);
7563 else if (ada_is_wrapper_field (type
, i
))
7565 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7571 else if (ada_is_variant_part (type
, i
))
7574 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7577 for (j
= field_type
->num_fields () - 1; j
>= 0; j
-= 1)
7579 /* FIXME pnh 2008/01/26: We check for a field that is
7580 NOT wrapped in a struct, since the compiler sometimes
7581 generates these for unchecked variant types. Revisit
7582 if the compiler changes this practice. */
7583 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7585 if (v_field_name
!= NULL
7586 && field_name_match (v_field_name
, name
))
7587 t
= TYPE_FIELD_TYPE (field_type
, j
);
7589 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7600 /* Field not found so far. If this is a tagged type which
7601 has a parent, try finding that field in the parent now. */
7603 if (parent_offset
!= -1)
7607 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, parent_offset
),
7616 const char *name_str
= name
!= NULL
? name
: _("<null>");
7618 error (_("Type %s has no component named %s"),
7619 type_as_string (type
).c_str (), name_str
);
7625 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7626 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7627 represents an unchecked union (that is, the variant part of a
7628 record that is named in an Unchecked_Union pragma). */
7631 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7633 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7635 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1) == NULL
);
7639 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7640 within OUTER, determine which variant clause (field number in VAR_TYPE,
7641 numbering from 0) is applicable. Returns -1 if none are. */
7644 ada_which_variant_applies (struct type
*var_type
, struct value
*outer
)
7648 const char *discrim_name
= ada_variant_discrim_name (var_type
);
7649 struct value
*discrim
;
7650 LONGEST discrim_val
;
7652 /* Using plain value_from_contents_and_address here causes problems
7653 because we will end up trying to resolve a type that is currently
7654 being constructed. */
7655 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7656 if (discrim
== NULL
)
7658 discrim_val
= value_as_long (discrim
);
7661 for (i
= 0; i
< var_type
->num_fields (); i
+= 1)
7663 if (ada_is_others_clause (var_type
, i
))
7665 else if (ada_in_variant (discrim_val
, var_type
, i
))
7669 return others_clause
;
7674 /* Dynamic-Sized Records */
7676 /* Strategy: The type ostensibly attached to a value with dynamic size
7677 (i.e., a size that is not statically recorded in the debugging
7678 data) does not accurately reflect the size or layout of the value.
7679 Our strategy is to convert these values to values with accurate,
7680 conventional types that are constructed on the fly. */
7682 /* There is a subtle and tricky problem here. In general, we cannot
7683 determine the size of dynamic records without its data. However,
7684 the 'struct value' data structure, which GDB uses to represent
7685 quantities in the inferior process (the target), requires the size
7686 of the type at the time of its allocation in order to reserve space
7687 for GDB's internal copy of the data. That's why the
7688 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7689 rather than struct value*s.
7691 However, GDB's internal history variables ($1, $2, etc.) are
7692 struct value*s containing internal copies of the data that are not, in
7693 general, the same as the data at their corresponding addresses in
7694 the target. Fortunately, the types we give to these values are all
7695 conventional, fixed-size types (as per the strategy described
7696 above), so that we don't usually have to perform the
7697 'to_fixed_xxx_type' conversions to look at their values.
7698 Unfortunately, there is one exception: if one of the internal
7699 history variables is an array whose elements are unconstrained
7700 records, then we will need to create distinct fixed types for each
7701 element selected. */
7703 /* The upshot of all of this is that many routines take a (type, host
7704 address, target address) triple as arguments to represent a value.
7705 The host address, if non-null, is supposed to contain an internal
7706 copy of the relevant data; otherwise, the program is to consult the
7707 target at the target address. */
7709 /* Assuming that VAL0 represents a pointer value, the result of
7710 dereferencing it. Differs from value_ind in its treatment of
7711 dynamic-sized types. */
7714 ada_value_ind (struct value
*val0
)
7716 struct value
*val
= value_ind (val0
);
7718 if (ada_is_tagged_type (value_type (val
), 0))
7719 val
= ada_tag_value_at_base_address (val
);
7721 return ada_to_fixed_value (val
);
7724 /* The value resulting from dereferencing any "reference to"
7725 qualifiers on VAL0. */
7727 static struct value
*
7728 ada_coerce_ref (struct value
*val0
)
7730 if (value_type (val0
)->code () == TYPE_CODE_REF
)
7732 struct value
*val
= val0
;
7734 val
= coerce_ref (val
);
7736 if (ada_is_tagged_type (value_type (val
), 0))
7737 val
= ada_tag_value_at_base_address (val
);
7739 return ada_to_fixed_value (val
);
7745 /* Return the bit alignment required for field #F of template type TYPE. */
7748 field_alignment (struct type
*type
, int f
)
7750 const char *name
= TYPE_FIELD_NAME (type
, f
);
7754 /* The field name should never be null, unless the debugging information
7755 is somehow malformed. In this case, we assume the field does not
7756 require any alignment. */
7760 len
= strlen (name
);
7762 if (!isdigit (name
[len
- 1]))
7765 if (isdigit (name
[len
- 2]))
7766 align_offset
= len
- 2;
7768 align_offset
= len
- 1;
7770 if (align_offset
< 7 || !startswith (name
+ align_offset
- 6, "___XV"))
7771 return TARGET_CHAR_BIT
;
7773 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7776 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7778 static struct symbol
*
7779 ada_find_any_type_symbol (const char *name
)
7783 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7784 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7787 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7791 /* Find a type named NAME. Ignores ambiguity. This routine will look
7792 solely for types defined by debug info, it will not search the GDB
7795 static struct type
*
7796 ada_find_any_type (const char *name
)
7798 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7801 return SYMBOL_TYPE (sym
);
7806 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7807 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7808 symbol, in which case it is returned. Otherwise, this looks for
7809 symbols whose name is that of NAME_SYM suffixed with "___XR".
7810 Return symbol if found, and NULL otherwise. */
7813 ada_is_renaming_symbol (struct symbol
*name_sym
)
7815 const char *name
= name_sym
->linkage_name ();
7816 return strstr (name
, "___XR") != NULL
;
7819 /* Because of GNAT encoding conventions, several GDB symbols may match a
7820 given type name. If the type denoted by TYPE0 is to be preferred to
7821 that of TYPE1 for purposes of type printing, return non-zero;
7822 otherwise return 0. */
7825 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7829 else if (type0
== NULL
)
7831 else if (type1
->code () == TYPE_CODE_VOID
)
7833 else if (type0
->code () == TYPE_CODE_VOID
)
7835 else if (type1
->name () == NULL
&& type0
->name () != NULL
)
7837 else if (ada_is_constrained_packed_array_type (type0
))
7839 else if (ada_is_array_descriptor_type (type0
)
7840 && !ada_is_array_descriptor_type (type1
))
7844 const char *type0_name
= type0
->name ();
7845 const char *type1_name
= type1
->name ();
7847 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7848 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7854 /* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
7858 ada_type_name (struct type
*type
)
7862 return type
->name ();
7865 /* Search the list of "descriptive" types associated to TYPE for a type
7866 whose name is NAME. */
7868 static struct type
*
7869 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7871 struct type
*result
, *tmp
;
7873 if (ada_ignore_descriptive_types_p
)
7876 /* If there no descriptive-type info, then there is no parallel type
7878 if (!HAVE_GNAT_AUX_INFO (type
))
7881 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7882 while (result
!= NULL
)
7884 const char *result_name
= ada_type_name (result
);
7886 if (result_name
== NULL
)
7888 warning (_("unexpected null name on descriptive type"));
7892 /* If the names match, stop. */
7893 if (strcmp (result_name
, name
) == 0)
7896 /* Otherwise, look at the next item on the list, if any. */
7897 if (HAVE_GNAT_AUX_INFO (result
))
7898 tmp
= TYPE_DESCRIPTIVE_TYPE (result
);
7902 /* If not found either, try after having resolved the typedef. */
7907 result
= check_typedef (result
);
7908 if (HAVE_GNAT_AUX_INFO (result
))
7909 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7915 /* If we didn't find a match, see whether this is a packed array. With
7916 older compilers, the descriptive type information is either absent or
7917 irrelevant when it comes to packed arrays so the above lookup fails.
7918 Fall back to using a parallel lookup by name in this case. */
7919 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7920 return ada_find_any_type (name
);
7925 /* Find a parallel type to TYPE with the specified NAME, using the
7926 descriptive type taken from the debugging information, if available,
7927 and otherwise using the (slower) name-based method. */
7929 static struct type
*
7930 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7932 struct type
*result
= NULL
;
7934 if (HAVE_GNAT_AUX_INFO (type
))
7935 result
= find_parallel_type_by_descriptive_type (type
, name
);
7937 result
= ada_find_any_type (name
);
7942 /* Same as above, but specify the name of the parallel type by appending
7943 SUFFIX to the name of TYPE. */
7946 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7949 const char *type_name
= ada_type_name (type
);
7952 if (type_name
== NULL
)
7955 len
= strlen (type_name
);
7957 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7959 strcpy (name
, type_name
);
7960 strcpy (name
+ len
, suffix
);
7962 return ada_find_parallel_type_with_name (type
, name
);
7965 /* If TYPE is a variable-size record type, return the corresponding template
7966 type describing its fields. Otherwise, return NULL. */
7968 static struct type
*
7969 dynamic_template_type (struct type
*type
)
7971 type
= ada_check_typedef (type
);
7973 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
7974 || ada_type_name (type
) == NULL
)
7978 int len
= strlen (ada_type_name (type
));
7980 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7983 return ada_find_parallel_type (type
, "___XVE");
7987 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7988 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7991 is_dynamic_field (struct type
*templ_type
, int field_num
)
7993 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7996 && TYPE_FIELD_TYPE (templ_type
, field_num
)->code () == TYPE_CODE_PTR
7997 && strstr (name
, "___XVL") != NULL
;
8000 /* The index of the variant field of TYPE, or -1 if TYPE does not
8001 represent a variant record type. */
8004 variant_field_index (struct type
*type
)
8008 if (type
== NULL
|| type
->code () != TYPE_CODE_STRUCT
)
8011 for (f
= 0; f
< type
->num_fields (); f
+= 1)
8013 if (ada_is_variant_part (type
, f
))
8019 /* A record type with no fields. */
8021 static struct type
*
8022 empty_record (struct type
*templ
)
8024 struct type
*type
= alloc_type_copy (templ
);
8026 type
->set_code (TYPE_CODE_STRUCT
);
8027 INIT_NONE_SPECIFIC (type
);
8028 type
->set_name ("<empty>");
8029 TYPE_LENGTH (type
) = 0;
8033 /* An ordinary record type (with fixed-length fields) that describes
8034 the value of type TYPE at VALADDR or ADDRESS (see comments at
8035 the beginning of this section) VAL according to GNAT conventions.
8036 DVAL0 should describe the (portion of a) record that contains any
8037 necessary discriminants. It should be NULL if value_type (VAL) is
8038 an outer-level type (i.e., as opposed to a branch of a variant.) A
8039 variant field (unless unchecked) is replaced by a particular branch
8042 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8043 length are not statically known are discarded. As a consequence,
8044 VALADDR, ADDRESS and DVAL0 are ignored.
8046 NOTE: Limitations: For now, we assume that dynamic fields and
8047 variants occupy whole numbers of bytes. However, they need not be
8051 ada_template_to_fixed_record_type_1 (struct type
*type
,
8052 const gdb_byte
*valaddr
,
8053 CORE_ADDR address
, struct value
*dval0
,
8054 int keep_dynamic_fields
)
8056 struct value
*mark
= value_mark ();
8059 int nfields
, bit_len
;
8065 /* Compute the number of fields in this record type that are going
8066 to be processed: unless keep_dynamic_fields, this includes only
8067 fields whose position and length are static will be processed. */
8068 if (keep_dynamic_fields
)
8069 nfields
= type
->num_fields ();
8073 while (nfields
< type
->num_fields ()
8074 && !ada_is_variant_part (type
, nfields
)
8075 && !is_dynamic_field (type
, nfields
))
8079 rtype
= alloc_type_copy (type
);
8080 rtype
->set_code (TYPE_CODE_STRUCT
);
8081 INIT_NONE_SPECIFIC (rtype
);
8082 rtype
->set_num_fields (nfields
);
8084 ((struct field
*) TYPE_ZALLOC (rtype
, nfields
* sizeof (struct field
)));
8085 rtype
->set_name (ada_type_name (type
));
8086 TYPE_FIXED_INSTANCE (rtype
) = 1;
8092 for (f
= 0; f
< nfields
; f
+= 1)
8094 off
= align_up (off
, field_alignment (type
, f
))
8095 + TYPE_FIELD_BITPOS (type
, f
);
8096 SET_FIELD_BITPOS (rtype
->field (f
), off
);
8097 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
8099 if (ada_is_variant_part (type
, f
))
8104 else if (is_dynamic_field (type
, f
))
8106 const gdb_byte
*field_valaddr
= valaddr
;
8107 CORE_ADDR field_address
= address
;
8108 struct type
*field_type
=
8109 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
8113 /* rtype's length is computed based on the run-time
8114 value of discriminants. If the discriminants are not
8115 initialized, the type size may be completely bogus and
8116 GDB may fail to allocate a value for it. So check the
8117 size first before creating the value. */
8118 ada_ensure_varsize_limit (rtype
);
8119 /* Using plain value_from_contents_and_address here
8120 causes problems because we will end up trying to
8121 resolve a type that is currently being
8123 dval
= value_from_contents_and_address_unresolved (rtype
,
8126 rtype
= value_type (dval
);
8131 /* If the type referenced by this field is an aligner type, we need
8132 to unwrap that aligner type, because its size might not be set.
8133 Keeping the aligner type would cause us to compute the wrong
8134 size for this field, impacting the offset of the all the fields
8135 that follow this one. */
8136 if (ada_is_aligner_type (field_type
))
8138 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
8140 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
8141 field_address
= cond_offset_target (field_address
, field_offset
);
8142 field_type
= ada_aligned_type (field_type
);
8145 field_valaddr
= cond_offset_host (field_valaddr
,
8146 off
/ TARGET_CHAR_BIT
);
8147 field_address
= cond_offset_target (field_address
,
8148 off
/ TARGET_CHAR_BIT
);
8150 /* Get the fixed type of the field. Note that, in this case,
8151 we do not want to get the real type out of the tag: if
8152 the current field is the parent part of a tagged record,
8153 we will get the tag of the object. Clearly wrong: the real
8154 type of the parent is not the real type of the child. We
8155 would end up in an infinite loop. */
8156 field_type
= ada_get_base_type (field_type
);
8157 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
8158 field_address
, dval
, 0);
8159 /* If the field size is already larger than the maximum
8160 object size, then the record itself will necessarily
8161 be larger than the maximum object size. We need to make
8162 this check now, because the size might be so ridiculously
8163 large (due to an uninitialized variable in the inferior)
8164 that it would cause an overflow when adding it to the
8166 ada_ensure_varsize_limit (field_type
);
8168 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
8169 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8170 /* The multiplication can potentially overflow. But because
8171 the field length has been size-checked just above, and
8172 assuming that the maximum size is a reasonable value,
8173 an overflow should not happen in practice. So rather than
8174 adding overflow recovery code to this already complex code,
8175 we just assume that it's not going to happen. */
8177 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
8181 /* Note: If this field's type is a typedef, it is important
8182 to preserve the typedef layer.
8184 Otherwise, we might be transforming a typedef to a fat
8185 pointer (encoding a pointer to an unconstrained array),
8186 into a basic fat pointer (encoding an unconstrained
8187 array). As both types are implemented using the same
8188 structure, the typedef is the only clue which allows us
8189 to distinguish between the two options. Stripping it
8190 would prevent us from printing this field appropriately. */
8191 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
8192 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
8193 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
8195 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
8198 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
8200 /* We need to be careful of typedefs when computing
8201 the length of our field. If this is a typedef,
8202 get the length of the target type, not the length
8204 if (field_type
->code () == TYPE_CODE_TYPEDEF
)
8205 field_type
= ada_typedef_target_type (field_type
);
8208 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
8211 if (off
+ fld_bit_len
> bit_len
)
8212 bit_len
= off
+ fld_bit_len
;
8214 TYPE_LENGTH (rtype
) =
8215 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8218 /* We handle the variant part, if any, at the end because of certain
8219 odd cases in which it is re-ordered so as NOT to be the last field of
8220 the record. This can happen in the presence of representation
8222 if (variant_field
>= 0)
8224 struct type
*branch_type
;
8226 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
8230 /* Using plain value_from_contents_and_address here causes
8231 problems because we will end up trying to resolve a type
8232 that is currently being constructed. */
8233 dval
= value_from_contents_and_address_unresolved (rtype
, valaddr
,
8235 rtype
= value_type (dval
);
8241 to_fixed_variant_branch_type
8242 (TYPE_FIELD_TYPE (type
, variant_field
),
8243 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8244 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8245 if (branch_type
== NULL
)
8247 for (f
= variant_field
+ 1; f
< rtype
->num_fields (); f
+= 1)
8248 rtype
->field (f
- 1) = rtype
->field (f
);
8249 rtype
->set_num_fields (rtype
->num_fields () - 1);
8253 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8254 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8256 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8258 if (off
+ fld_bit_len
> bit_len
)
8259 bit_len
= off
+ fld_bit_len
;
8260 TYPE_LENGTH (rtype
) =
8261 align_up (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8265 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8266 should contain the alignment of that record, which should be a strictly
8267 positive value. If null or negative, then something is wrong, most
8268 probably in the debug info. In that case, we don't round up the size
8269 of the resulting type. If this record is not part of another structure,
8270 the current RTYPE length might be good enough for our purposes. */
8271 if (TYPE_LENGTH (type
) <= 0)
8274 warning (_("Invalid type size for `%s' detected: %s."),
8275 rtype
->name (), pulongest (TYPE_LENGTH (type
)));
8277 warning (_("Invalid type size for <unnamed> detected: %s."),
8278 pulongest (TYPE_LENGTH (type
)));
8282 TYPE_LENGTH (rtype
) = align_up (TYPE_LENGTH (rtype
),
8283 TYPE_LENGTH (type
));
8286 value_free_to_mark (mark
);
8287 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8288 error (_("record type with dynamic size is larger than varsize-limit"));
8292 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8295 static struct type
*
8296 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8297 CORE_ADDR address
, struct value
*dval0
)
8299 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8303 /* An ordinary record type in which ___XVL-convention fields and
8304 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8305 static approximations, containing all possible fields. Uses
8306 no runtime values. Useless for use in values, but that's OK,
8307 since the results are used only for type determinations. Works on both
8308 structs and unions. Representation note: to save space, we memorize
8309 the result of this function in the TYPE_TARGET_TYPE of the
8312 static struct type
*
8313 template_to_static_fixed_type (struct type
*type0
)
8319 /* No need no do anything if the input type is already fixed. */
8320 if (TYPE_FIXED_INSTANCE (type0
))
8323 /* Likewise if we already have computed the static approximation. */
8324 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8325 return TYPE_TARGET_TYPE (type0
);
8327 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
8329 nfields
= type0
->num_fields ();
8331 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8332 recompute all over next time. */
8333 TYPE_TARGET_TYPE (type0
) = type
;
8335 for (f
= 0; f
< nfields
; f
+= 1)
8337 struct type
*field_type
= TYPE_FIELD_TYPE (type0
, f
);
8338 struct type
*new_type
;
8340 if (is_dynamic_field (type0
, f
))
8342 field_type
= ada_check_typedef (field_type
);
8343 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8346 new_type
= static_unwrap_type (field_type
);
8348 if (new_type
!= field_type
)
8350 /* Clone TYPE0 only the first time we get a new field type. */
8353 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8354 type
->set_code (type0
->code ());
8355 INIT_NONE_SPECIFIC (type
);
8356 type
->set_num_fields (nfields
);
8360 TYPE_ALLOC (type
, nfields
* sizeof (struct field
)));
8361 memcpy (fields
, type0
->fields (),
8362 sizeof (struct field
) * nfields
);
8363 type
->set_fields (fields
);
8365 type
->set_name (ada_type_name (type0
));
8366 TYPE_FIXED_INSTANCE (type
) = 1;
8367 TYPE_LENGTH (type
) = 0;
8369 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8370 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8377 /* Given an object of type TYPE whose contents are at VALADDR and
8378 whose address in memory is ADDRESS, returns a revision of TYPE,
8379 which should be a non-dynamic-sized record, in which the variant
8380 part, if any, is replaced with the appropriate branch. Looks
8381 for discriminant values in DVAL0, which can be NULL if the record
8382 contains the necessary discriminant values. */
8384 static struct type
*
8385 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8386 CORE_ADDR address
, struct value
*dval0
)
8388 struct value
*mark
= value_mark ();
8391 struct type
*branch_type
;
8392 int nfields
= type
->num_fields ();
8393 int variant_field
= variant_field_index (type
);
8395 if (variant_field
== -1)
8400 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8401 type
= value_type (dval
);
8406 rtype
= alloc_type_copy (type
);
8407 rtype
->set_code (TYPE_CODE_STRUCT
);
8408 INIT_NONE_SPECIFIC (rtype
);
8409 rtype
->set_num_fields (nfields
);
8412 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8413 memcpy (fields
, type
->fields (), sizeof (struct field
) * nfields
);
8414 rtype
->set_fields (fields
);
8416 rtype
->set_name (ada_type_name (type
));
8417 TYPE_FIXED_INSTANCE (rtype
) = 1;
8418 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8420 branch_type
= to_fixed_variant_branch_type
8421 (TYPE_FIELD_TYPE (type
, variant_field
),
8422 cond_offset_host (valaddr
,
8423 TYPE_FIELD_BITPOS (type
, variant_field
)
8425 cond_offset_target (address
,
8426 TYPE_FIELD_BITPOS (type
, variant_field
)
8427 / TARGET_CHAR_BIT
), dval
);
8428 if (branch_type
== NULL
)
8432 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8433 rtype
->field (f
- 1) = rtype
->field (f
);
8434 rtype
->set_num_fields (rtype
->num_fields () - 1);
8438 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8439 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8440 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8441 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8443 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8445 value_free_to_mark (mark
);
8449 /* An ordinary record type (with fixed-length fields) that describes
8450 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8451 beginning of this section]. Any necessary discriminants' values
8452 should be in DVAL, a record value; it may be NULL if the object
8453 at ADDR itself contains any necessary discriminant values.
8454 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8455 values from the record are needed. Except in the case that DVAL,
8456 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8457 unchecked) is replaced by a particular branch of the variant.
8459 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8460 is questionable and may be removed. It can arise during the
8461 processing of an unconstrained-array-of-record type where all the
8462 variant branches have exactly the same size. This is because in
8463 such cases, the compiler does not bother to use the XVS convention
8464 when encoding the record. I am currently dubious of this
8465 shortcut and suspect the compiler should be altered. FIXME. */
8467 static struct type
*
8468 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8469 CORE_ADDR address
, struct value
*dval
)
8471 struct type
*templ_type
;
8473 if (TYPE_FIXED_INSTANCE (type0
))
8476 templ_type
= dynamic_template_type (type0
);
8478 if (templ_type
!= NULL
)
8479 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8480 else if (variant_field_index (type0
) >= 0)
8482 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8484 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8489 TYPE_FIXED_INSTANCE (type0
) = 1;
8495 /* An ordinary record type (with fixed-length fields) that describes
8496 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8497 union type. Any necessary discriminants' values should be in DVAL,
8498 a record value. That is, this routine selects the appropriate
8499 branch of the union at ADDR according to the discriminant value
8500 indicated in the union's type name. Returns VAR_TYPE0 itself if
8501 it represents a variant subject to a pragma Unchecked_Union. */
8503 static struct type
*
8504 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8505 CORE_ADDR address
, struct value
*dval
)
8508 struct type
*templ_type
;
8509 struct type
*var_type
;
8511 if (var_type0
->code () == TYPE_CODE_PTR
)
8512 var_type
= TYPE_TARGET_TYPE (var_type0
);
8514 var_type
= var_type0
;
8516 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8518 if (templ_type
!= NULL
)
8519 var_type
= templ_type
;
8521 if (is_unchecked_variant (var_type
, value_type (dval
)))
8523 which
= ada_which_variant_applies (var_type
, dval
);
8526 return empty_record (var_type
);
8527 else if (is_dynamic_field (var_type
, which
))
8528 return to_fixed_record_type
8529 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8530 valaddr
, address
, dval
);
8531 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8533 to_fixed_record_type
8534 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8536 return TYPE_FIELD_TYPE (var_type
, which
);
8539 /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8540 ENCODING_TYPE, a type following the GNAT conventions for discrete
8541 type encodings, only carries redundant information. */
8544 ada_is_redundant_range_encoding (struct type
*range_type
,
8545 struct type
*encoding_type
)
8547 const char *bounds_str
;
8551 gdb_assert (range_type
->code () == TYPE_CODE_RANGE
);
8553 if (get_base_type (range_type
)->code ()
8554 != get_base_type (encoding_type
)->code ())
8556 /* The compiler probably used a simple base type to describe
8557 the range type instead of the range's actual base type,
8558 expecting us to get the real base type from the encoding
8559 anyway. In this situation, the encoding cannot be ignored
8564 if (is_dynamic_type (range_type
))
8567 if (encoding_type
->name () == NULL
)
8570 bounds_str
= strstr (encoding_type
->name (), "___XDLU_");
8571 if (bounds_str
== NULL
)
8574 n
= 8; /* Skip "___XDLU_". */
8575 if (!ada_scan_number (bounds_str
, n
, &lo
, &n
))
8577 if (TYPE_LOW_BOUND (range_type
) != lo
)
8580 n
+= 2; /* Skip the "__" separator between the two bounds. */
8581 if (!ada_scan_number (bounds_str
, n
, &hi
, &n
))
8583 if (TYPE_HIGH_BOUND (range_type
) != hi
)
8589 /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8590 a type following the GNAT encoding for describing array type
8591 indices, only carries redundant information. */
8594 ada_is_redundant_index_type_desc (struct type
*array_type
,
8595 struct type
*desc_type
)
8597 struct type
*this_layer
= check_typedef (array_type
);
8600 for (i
= 0; i
< desc_type
->num_fields (); i
++)
8602 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer
),
8603 TYPE_FIELD_TYPE (desc_type
, i
)))
8605 this_layer
= check_typedef (TYPE_TARGET_TYPE (this_layer
));
8611 /* Assuming that TYPE0 is an array type describing the type of a value
8612 at ADDR, and that DVAL describes a record containing any
8613 discriminants used in TYPE0, returns a type for the value that
8614 contains no dynamic components (that is, no components whose sizes
8615 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8616 true, gives an error message if the resulting type's size is over
8619 static struct type
*
8620 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8623 struct type
*index_type_desc
;
8624 struct type
*result
;
8625 int constrained_packed_array_p
;
8626 static const char *xa_suffix
= "___XA";
8628 type0
= ada_check_typedef (type0
);
8629 if (TYPE_FIXED_INSTANCE (type0
))
8632 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8633 if (constrained_packed_array_p
)
8634 type0
= decode_constrained_packed_array_type (type0
);
8636 index_type_desc
= ada_find_parallel_type (type0
, xa_suffix
);
8638 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8639 encoding suffixed with 'P' may still be generated. If so,
8640 it should be used to find the XA type. */
8642 if (index_type_desc
== NULL
)
8644 const char *type_name
= ada_type_name (type0
);
8646 if (type_name
!= NULL
)
8648 const int len
= strlen (type_name
);
8649 char *name
= (char *) alloca (len
+ strlen (xa_suffix
));
8651 if (type_name
[len
- 1] == 'P')
8653 strcpy (name
, type_name
);
8654 strcpy (name
+ len
- 1, xa_suffix
);
8655 index_type_desc
= ada_find_parallel_type_with_name (type0
, name
);
8660 ada_fixup_array_indexes_type (index_type_desc
);
8661 if (index_type_desc
!= NULL
8662 && ada_is_redundant_index_type_desc (type0
, index_type_desc
))
8664 /* Ignore this ___XA parallel type, as it does not bring any
8665 useful information. This allows us to avoid creating fixed
8666 versions of the array's index types, which would be identical
8667 to the original ones. This, in turn, can also help avoid
8668 the creation of fixed versions of the array itself. */
8669 index_type_desc
= NULL
;
8672 if (index_type_desc
== NULL
)
8674 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8676 /* NOTE: elt_type---the fixed version of elt_type0---should never
8677 depend on the contents of the array in properly constructed
8679 /* Create a fixed version of the array element type.
8680 We're not providing the address of an element here,
8681 and thus the actual object value cannot be inspected to do
8682 the conversion. This should not be a problem, since arrays of
8683 unconstrained objects are not allowed. In particular, all
8684 the elements of an array of a tagged type should all be of
8685 the same type specified in the debugging info. No need to
8686 consult the object tag. */
8687 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8689 /* Make sure we always create a new array type when dealing with
8690 packed array types, since we're going to fix-up the array
8691 type length and element bitsize a little further down. */
8692 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8695 result
= create_array_type (alloc_type_copy (type0
),
8696 elt_type
, TYPE_INDEX_TYPE (type0
));
8701 struct type
*elt_type0
;
8704 for (i
= index_type_desc
->num_fields (); i
> 0; i
-= 1)
8705 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8707 /* NOTE: result---the fixed version of elt_type0---should never
8708 depend on the contents of the array in properly constructed
8710 /* Create a fixed version of the array element type.
8711 We're not providing the address of an element here,
8712 and thus the actual object value cannot be inspected to do
8713 the conversion. This should not be a problem, since arrays of
8714 unconstrained objects are not allowed. In particular, all
8715 the elements of an array of a tagged type should all be of
8716 the same type specified in the debugging info. No need to
8717 consult the object tag. */
8719 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8722 for (i
= index_type_desc
->num_fields () - 1; i
>= 0; i
-= 1)
8724 struct type
*range_type
=
8725 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8727 result
= create_array_type (alloc_type_copy (elt_type0
),
8728 result
, range_type
);
8729 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8731 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8732 error (_("array type with dynamic size is larger than varsize-limit"));
8735 /* We want to preserve the type name. This can be useful when
8736 trying to get the type name of a value that has already been
8737 printed (for instance, if the user did "print VAR; whatis $". */
8738 result
->set_name (type0
->name ());
8740 if (constrained_packed_array_p
)
8742 /* So far, the resulting type has been created as if the original
8743 type was a regular (non-packed) array type. As a result, the
8744 bitsize of the array elements needs to be set again, and the array
8745 length needs to be recomputed based on that bitsize. */
8746 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8747 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8749 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8750 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8751 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8752 TYPE_LENGTH (result
)++;
8755 TYPE_FIXED_INSTANCE (result
) = 1;
8760 /* A standard type (containing no dynamically sized components)
8761 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8762 DVAL describes a record containing any discriminants used in TYPE0,
8763 and may be NULL if there are none, or if the object of type TYPE at
8764 ADDRESS or in VALADDR contains these discriminants.
8766 If CHECK_TAG is not null, in the case of tagged types, this function
8767 attempts to locate the object's tag and use it to compute the actual
8768 type. However, when ADDRESS is null, we cannot use it to determine the
8769 location of the tag, and therefore compute the tagged type's actual type.
8770 So we return the tagged type without consulting the tag. */
8772 static struct type
*
8773 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8774 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8776 type
= ada_check_typedef (type
);
8778 /* Only un-fixed types need to be handled here. */
8779 if (!HAVE_GNAT_AUX_INFO (type
))
8782 switch (type
->code ())
8786 case TYPE_CODE_STRUCT
:
8788 struct type
*static_type
= to_static_fixed_type (type
);
8789 struct type
*fixed_record_type
=
8790 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8792 /* If STATIC_TYPE is a tagged type and we know the object's address,
8793 then we can determine its tag, and compute the object's actual
8794 type from there. Note that we have to use the fixed record
8795 type (the parent part of the record may have dynamic fields
8796 and the way the location of _tag is expressed may depend on
8799 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8802 value_tag_from_contents_and_address
8806 struct type
*real_type
= type_from_tag (tag
);
8808 value_from_contents_and_address (fixed_record_type
,
8811 fixed_record_type
= value_type (obj
);
8812 if (real_type
!= NULL
)
8813 return to_fixed_record_type
8815 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8818 /* Check to see if there is a parallel ___XVZ variable.
8819 If there is, then it provides the actual size of our type. */
8820 else if (ada_type_name (fixed_record_type
) != NULL
)
8822 const char *name
= ada_type_name (fixed_record_type
);
8824 = (char *) alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8825 bool xvz_found
= false;
8828 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8831 xvz_found
= get_int_var_value (xvz_name
, size
);
8833 catch (const gdb_exception_error
&except
)
8835 /* We found the variable, but somehow failed to read
8836 its value. Rethrow the same error, but with a little
8837 bit more information, to help the user understand
8838 what went wrong (Eg: the variable might have been
8840 throw_error (except
.error
,
8841 _("unable to read value of %s (%s)"),
8842 xvz_name
, except
.what ());
8845 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8847 fixed_record_type
= copy_type (fixed_record_type
);
8848 TYPE_LENGTH (fixed_record_type
) = size
;
8850 /* The FIXED_RECORD_TYPE may have be a stub. We have
8851 observed this when the debugging info is STABS, and
8852 apparently it is something that is hard to fix.
8854 In practice, we don't need the actual type definition
8855 at all, because the presence of the XVZ variable allows us
8856 to assume that there must be a XVS type as well, which we
8857 should be able to use later, when we need the actual type
8860 In the meantime, pretend that the "fixed" type we are
8861 returning is NOT a stub, because this can cause trouble
8862 when using this type to create new types targeting it.
8863 Indeed, the associated creation routines often check
8864 whether the target type is a stub and will try to replace
8865 it, thus using a type with the wrong size. This, in turn,
8866 might cause the new type to have the wrong size too.
8867 Consider the case of an array, for instance, where the size
8868 of the array is computed from the number of elements in
8869 our array multiplied by the size of its element. */
8870 TYPE_STUB (fixed_record_type
) = 0;
8873 return fixed_record_type
;
8875 case TYPE_CODE_ARRAY
:
8876 return to_fixed_array_type (type
, dval
, 1);
8877 case TYPE_CODE_UNION
:
8881 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8885 /* The same as ada_to_fixed_type_1, except that it preserves the type
8886 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8888 The typedef layer needs be preserved in order to differentiate between
8889 arrays and array pointers when both types are implemented using the same
8890 fat pointer. In the array pointer case, the pointer is encoded as
8891 a typedef of the pointer type. For instance, considering:
8893 type String_Access is access String;
8894 S1 : String_Access := null;
8896 To the debugger, S1 is defined as a typedef of type String. But
8897 to the user, it is a pointer. So if the user tries to print S1,
8898 we should not dereference the array, but print the array address
8901 If we didn't preserve the typedef layer, we would lose the fact that
8902 the type is to be presented as a pointer (needs de-reference before
8903 being printed). And we would also use the source-level type name. */
8906 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8907 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8910 struct type
*fixed_type
=
8911 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8913 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8914 then preserve the typedef layer.
8916 Implementation note: We can only check the main-type portion of
8917 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8918 from TYPE now returns a type that has the same instance flags
8919 as TYPE. For instance, if TYPE is a "typedef const", and its
8920 target type is a "struct", then the typedef elimination will return
8921 a "const" version of the target type. See check_typedef for more
8922 details about how the typedef layer elimination is done.
8924 brobecker/2010-11-19: It seems to me that the only case where it is
8925 useful to preserve the typedef layer is when dealing with fat pointers.
8926 Perhaps, we could add a check for that and preserve the typedef layer
8927 only in that situation. But this seems unnecessary so far, probably
8928 because we call check_typedef/ada_check_typedef pretty much everywhere.
8930 if (type
->code () == TYPE_CODE_TYPEDEF
8931 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8932 == TYPE_MAIN_TYPE (fixed_type
)))
8938 /* A standard (static-sized) type corresponding as well as possible to
8939 TYPE0, but based on no runtime data. */
8941 static struct type
*
8942 to_static_fixed_type (struct type
*type0
)
8949 if (TYPE_FIXED_INSTANCE (type0
))
8952 type0
= ada_check_typedef (type0
);
8954 switch (type0
->code ())
8958 case TYPE_CODE_STRUCT
:
8959 type
= dynamic_template_type (type0
);
8961 return template_to_static_fixed_type (type
);
8963 return template_to_static_fixed_type (type0
);
8964 case TYPE_CODE_UNION
:
8965 type
= ada_find_parallel_type (type0
, "___XVU");
8967 return template_to_static_fixed_type (type
);
8969 return template_to_static_fixed_type (type0
);
8973 /* A static approximation of TYPE with all type wrappers removed. */
8975 static struct type
*
8976 static_unwrap_type (struct type
*type
)
8978 if (ada_is_aligner_type (type
))
8980 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8981 if (ada_type_name (type1
) == NULL
)
8982 type1
->set_name (ada_type_name (type
));
8984 return static_unwrap_type (type1
);
8988 struct type
*raw_real_type
= ada_get_base_type (type
);
8990 if (raw_real_type
== type
)
8993 return to_static_fixed_type (raw_real_type
);
8997 /* In some cases, incomplete and private types require
8998 cross-references that are not resolved as records (for example,
9000 type FooP is access Foo;
9002 type Foo is array ...;
9003 ). In these cases, since there is no mechanism for producing
9004 cross-references to such types, we instead substitute for FooP a
9005 stub enumeration type that is nowhere resolved, and whose tag is
9006 the name of the actual type. Call these types "non-record stubs". */
9008 /* A type equivalent to TYPE that is not a non-record stub, if one
9009 exists, otherwise TYPE. */
9012 ada_check_typedef (struct type
*type
)
9017 /* If our type is an access to an unconstrained array, which is encoded
9018 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
9019 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9020 what allows us to distinguish between fat pointers that represent
9021 array types, and fat pointers that represent array access types
9022 (in both cases, the compiler implements them as fat pointers). */
9023 if (ada_is_access_to_unconstrained_array (type
))
9026 type
= check_typedef (type
);
9027 if (type
== NULL
|| type
->code () != TYPE_CODE_ENUM
9028 || !TYPE_STUB (type
)
9029 || type
->name () == NULL
)
9033 const char *name
= type
->name ();
9034 struct type
*type1
= ada_find_any_type (name
);
9039 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9040 stubs pointing to arrays, as we don't create symbols for array
9041 types, only for the typedef-to-array types). If that's the case,
9042 strip the typedef layer. */
9043 if (type1
->code () == TYPE_CODE_TYPEDEF
)
9044 type1
= ada_check_typedef (type1
);
9050 /* A value representing the data at VALADDR/ADDRESS as described by
9051 type TYPE0, but with a standard (static-sized) type that correctly
9052 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9053 type, then return VAL0 [this feature is simply to avoid redundant
9054 creation of struct values]. */
9056 static struct value
*
9057 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
9060 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
9062 if (type
== type0
&& val0
!= NULL
)
9065 if (VALUE_LVAL (val0
) != lval_memory
)
9067 /* Our value does not live in memory; it could be a convenience
9068 variable, for instance. Create a not_lval value using val0's
9070 return value_from_contents (type
, value_contents (val0
));
9073 return value_from_contents_and_address (type
, 0, address
);
9076 /* A value representing VAL, but with a standard (static-sized) type
9077 that correctly describes it. Does not necessarily create a new
9081 ada_to_fixed_value (struct value
*val
)
9083 val
= unwrap_value (val
);
9084 val
= ada_to_fixed_value_create (value_type (val
), value_address (val
), val
);
9091 /* Table mapping attribute numbers to names.
9092 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
9094 static const char *attribute_names
[] = {
9112 ada_attribute_name (enum exp_opcode n
)
9114 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
9115 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
9117 return attribute_names
[0];
9120 /* Evaluate the 'POS attribute applied to ARG. */
9123 pos_atr (struct value
*arg
)
9125 struct value
*val
= coerce_ref (arg
);
9126 struct type
*type
= value_type (val
);
9129 if (!discrete_type_p (type
))
9130 error (_("'POS only defined on discrete types"));
9132 if (!discrete_position (type
, value_as_long (val
), &result
))
9133 error (_("enumeration value is invalid: can't find 'POS"));
9138 static struct value
*
9139 value_pos_atr (struct type
*type
, struct value
*arg
)
9141 return value_from_longest (type
, pos_atr (arg
));
9144 /* Evaluate the TYPE'VAL attribute applied to ARG. */
9146 static struct value
*
9147 val_atr (struct type
*type
, LONGEST val
)
9149 gdb_assert (discrete_type_p (type
));
9150 if (type
->code () == TYPE_CODE_RANGE
)
9151 type
= TYPE_TARGET_TYPE (type
);
9152 if (type
->code () == TYPE_CODE_ENUM
)
9154 if (val
< 0 || val
>= type
->num_fields ())
9155 error (_("argument to 'VAL out of range"));
9156 val
= TYPE_FIELD_ENUMVAL (type
, val
);
9158 return value_from_longest (type
, val
);
9161 static struct value
*
9162 value_val_atr (struct type
*type
, struct value
*arg
)
9164 if (!discrete_type_p (type
))
9165 error (_("'VAL only defined on discrete types"));
9166 if (!integer_type_p (value_type (arg
)))
9167 error (_("'VAL requires integral argument"));
9169 return val_atr (type
, value_as_long (arg
));
9175 /* True if TYPE appears to be an Ada character type.
9176 [At the moment, this is true only for Character and Wide_Character;
9177 It is a heuristic test that could stand improvement]. */
9180 ada_is_character_type (struct type
*type
)
9184 /* If the type code says it's a character, then assume it really is,
9185 and don't check any further. */
9186 if (type
->code () == TYPE_CODE_CHAR
)
9189 /* Otherwise, assume it's a character type iff it is a discrete type
9190 with a known character type name. */
9191 name
= ada_type_name (type
);
9192 return (name
!= NULL
9193 && (type
->code () == TYPE_CODE_INT
9194 || type
->code () == TYPE_CODE_RANGE
)
9195 && (strcmp (name
, "character") == 0
9196 || strcmp (name
, "wide_character") == 0
9197 || strcmp (name
, "wide_wide_character") == 0
9198 || strcmp (name
, "unsigned char") == 0));
9201 /* True if TYPE appears to be an Ada string type. */
9204 ada_is_string_type (struct type
*type
)
9206 type
= ada_check_typedef (type
);
9208 && type
->code () != TYPE_CODE_PTR
9209 && (ada_is_simple_array_type (type
)
9210 || ada_is_array_descriptor_type (type
))
9211 && ada_array_arity (type
) == 1)
9213 struct type
*elttype
= ada_array_element_type (type
, 1);
9215 return ada_is_character_type (elttype
);
9221 /* The compiler sometimes provides a parallel XVS type for a given
9222 PAD type. Normally, it is safe to follow the PAD type directly,
9223 but older versions of the compiler have a bug that causes the offset
9224 of its "F" field to be wrong. Following that field in that case
9225 would lead to incorrect results, but this can be worked around
9226 by ignoring the PAD type and using the associated XVS type instead.
9228 Set to True if the debugger should trust the contents of PAD types.
9229 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9230 static bool trust_pad_over_xvs
= true;
9232 /* True if TYPE is a struct type introduced by the compiler to force the
9233 alignment of a value. Such types have a single field with a
9234 distinctive name. */
9237 ada_is_aligner_type (struct type
*type
)
9239 type
= ada_check_typedef (type
);
9241 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
9244 return (type
->code () == TYPE_CODE_STRUCT
9245 && type
->num_fields () == 1
9246 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
9249 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
9250 the parallel type. */
9253 ada_get_base_type (struct type
*raw_type
)
9255 struct type
*real_type_namer
;
9256 struct type
*raw_real_type
;
9258 if (raw_type
== NULL
|| raw_type
->code () != TYPE_CODE_STRUCT
)
9261 if (ada_is_aligner_type (raw_type
))
9262 /* The encoding specifies that we should always use the aligner type.
9263 So, even if this aligner type has an associated XVS type, we should
9266 According to the compiler gurus, an XVS type parallel to an aligner
9267 type may exist because of a stabs limitation. In stabs, aligner
9268 types are empty because the field has a variable-sized type, and
9269 thus cannot actually be used as an aligner type. As a result,
9270 we need the associated parallel XVS type to decode the type.
9271 Since the policy in the compiler is to not change the internal
9272 representation based on the debugging info format, we sometimes
9273 end up having a redundant XVS type parallel to the aligner type. */
9276 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
9277 if (real_type_namer
== NULL
9278 || real_type_namer
->code () != TYPE_CODE_STRUCT
9279 || real_type_namer
->num_fields () != 1)
9282 if (TYPE_FIELD_TYPE (real_type_namer
, 0)->code () != TYPE_CODE_REF
)
9284 /* This is an older encoding form where the base type needs to be
9285 looked up by name. We prefer the newer encoding because it is
9287 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
9288 if (raw_real_type
== NULL
)
9291 return raw_real_type
;
9294 /* The field in our XVS type is a reference to the base type. */
9295 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
9298 /* The type of value designated by TYPE, with all aligners removed. */
9301 ada_aligned_type (struct type
*type
)
9303 if (ada_is_aligner_type (type
))
9304 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
9306 return ada_get_base_type (type
);
9310 /* The address of the aligned value in an object at address VALADDR
9311 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
9314 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
9316 if (ada_is_aligner_type (type
))
9317 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
9319 TYPE_FIELD_BITPOS (type
,
9320 0) / TARGET_CHAR_BIT
);
9327 /* The printed representation of an enumeration literal with encoded
9328 name NAME. The value is good to the next call of ada_enum_name. */
9330 ada_enum_name (const char *name
)
9332 static char *result
;
9333 static size_t result_len
= 0;
9336 /* First, unqualify the enumeration name:
9337 1. Search for the last '.' character. If we find one, then skip
9338 all the preceding characters, the unqualified name starts
9339 right after that dot.
9340 2. Otherwise, we may be debugging on a target where the compiler
9341 translates dots into "__". Search forward for double underscores,
9342 but stop searching when we hit an overloading suffix, which is
9343 of the form "__" followed by digits. */
9345 tmp
= strrchr (name
, '.');
9350 while ((tmp
= strstr (name
, "__")) != NULL
)
9352 if (isdigit (tmp
[2]))
9363 if (name
[1] == 'U' || name
[1] == 'W')
9365 if (sscanf (name
+ 2, "%x", &v
) != 1)
9368 else if (((name
[1] >= '0' && name
[1] <= '9')
9369 || (name
[1] >= 'a' && name
[1] <= 'z'))
9372 GROW_VECT (result
, result_len
, 4);
9373 xsnprintf (result
, result_len
, "'%c'", name
[1]);
9379 GROW_VECT (result
, result_len
, 16);
9380 if (isascii (v
) && isprint (v
))
9381 xsnprintf (result
, result_len
, "'%c'", v
);
9382 else if (name
[1] == 'U')
9383 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
9385 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
9391 tmp
= strstr (name
, "__");
9393 tmp
= strstr (name
, "$");
9396 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
9397 strncpy (result
, name
, tmp
- name
);
9398 result
[tmp
- name
] = '\0';
9406 /* Evaluate the subexpression of EXP starting at *POS as for
9407 evaluate_type, updating *POS to point just past the evaluated
9410 static struct value
*
9411 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9413 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9416 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9419 static struct value
*
9420 unwrap_value (struct value
*val
)
9422 struct type
*type
= ada_check_typedef (value_type (val
));
9424 if (ada_is_aligner_type (type
))
9426 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9427 struct type
*val_type
= ada_check_typedef (value_type (v
));
9429 if (ada_type_name (val_type
) == NULL
)
9430 val_type
->set_name (ada_type_name (type
));
9432 return unwrap_value (v
);
9436 struct type
*raw_real_type
=
9437 ada_check_typedef (ada_get_base_type (type
));
9439 /* If there is no parallel XVS or XVE type, then the value is
9440 already unwrapped. Return it without further modification. */
9441 if ((type
== raw_real_type
)
9442 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9446 coerce_unspec_val_to_type
9447 (val
, ada_to_fixed_type (raw_real_type
, 0,
9448 value_address (val
),
9453 static struct value
*
9454 cast_from_fixed (struct type
*type
, struct value
*arg
)
9456 struct value
*scale
= ada_scaling_factor (value_type (arg
));
9457 arg
= value_cast (value_type (scale
), arg
);
9459 arg
= value_binop (arg
, scale
, BINOP_MUL
);
9460 return value_cast (type
, arg
);
9463 static struct value
*
9464 cast_to_fixed (struct type
*type
, struct value
*arg
)
9466 if (type
== value_type (arg
))
9469 struct value
*scale
= ada_scaling_factor (type
);
9470 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg
)))
9471 arg
= cast_from_fixed (value_type (scale
), arg
);
9473 arg
= value_cast (value_type (scale
), arg
);
9475 arg
= value_binop (arg
, scale
, BINOP_DIV
);
9476 return value_cast (type
, arg
);
9479 /* Given two array types T1 and T2, return nonzero iff both arrays
9480 contain the same number of elements. */
9483 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9485 LONGEST lo1
, hi1
, lo2
, hi2
;
9487 /* Get the array bounds in order to verify that the size of
9488 the two arrays match. */
9489 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9490 || !get_array_bounds (t2
, &lo2
, &hi2
))
9491 error (_("unable to determine array bounds"));
9493 /* To make things easier for size comparison, normalize a bit
9494 the case of empty arrays by making sure that the difference
9495 between upper bound and lower bound is always -1. */
9501 return (hi1
- lo1
== hi2
- lo2
);
9504 /* Assuming that VAL is an array of integrals, and TYPE represents
9505 an array with the same number of elements, but with wider integral
9506 elements, return an array "casted" to TYPE. In practice, this
9507 means that the returned array is built by casting each element
9508 of the original array into TYPE's (wider) element type. */
9510 static struct value
*
9511 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9513 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9518 /* Verify that both val and type are arrays of scalars, and
9519 that the size of val's elements is smaller than the size
9520 of type's element. */
9521 gdb_assert (type
->code () == TYPE_CODE_ARRAY
);
9522 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9523 gdb_assert (value_type (val
)->code () == TYPE_CODE_ARRAY
);
9524 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9525 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9526 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9528 if (!get_array_bounds (type
, &lo
, &hi
))
9529 error (_("unable to determine array bounds"));
9531 res
= allocate_value (type
);
9533 /* Promote each array element. */
9534 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9536 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9538 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9539 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9545 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9546 return the converted value. */
9548 static struct value
*
9549 coerce_for_assign (struct type
*type
, struct value
*val
)
9551 struct type
*type2
= value_type (val
);
9556 type2
= ada_check_typedef (type2
);
9557 type
= ada_check_typedef (type
);
9559 if (type2
->code () == TYPE_CODE_PTR
9560 && type
->code () == TYPE_CODE_ARRAY
)
9562 val
= ada_value_ind (val
);
9563 type2
= value_type (val
);
9566 if (type2
->code () == TYPE_CODE_ARRAY
9567 && type
->code () == TYPE_CODE_ARRAY
)
9569 if (!ada_same_array_size_p (type
, type2
))
9570 error (_("cannot assign arrays of different length"));
9572 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9573 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9574 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9575 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9577 /* Allow implicit promotion of the array elements to
9579 return ada_promote_array_of_integrals (type
, val
);
9582 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9583 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9584 error (_("Incompatible types in assignment"));
9585 deprecated_set_value_type (val
, type
);
9590 static struct value
*
9591 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9594 struct type
*type1
, *type2
;
9597 arg1
= coerce_ref (arg1
);
9598 arg2
= coerce_ref (arg2
);
9599 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9600 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9602 if (type1
->code () != TYPE_CODE_INT
9603 || type2
->code () != TYPE_CODE_INT
)
9604 return value_binop (arg1
, arg2
, op
);
9613 return value_binop (arg1
, arg2
, op
);
9616 v2
= value_as_long (arg2
);
9618 error (_("second operand of %s must not be zero."), op_string (op
));
9620 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9621 return value_binop (arg1
, arg2
, op
);
9623 v1
= value_as_long (arg1
);
9628 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9629 v
+= v
> 0 ? -1 : 1;
9637 /* Should not reach this point. */
9641 val
= allocate_value (type1
);
9642 store_unsigned_integer (value_contents_raw (val
),
9643 TYPE_LENGTH (value_type (val
)),
9644 type_byte_order (type1
), v
);
9649 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9651 if (ada_is_direct_array_type (value_type (arg1
))
9652 || ada_is_direct_array_type (value_type (arg2
)))
9654 struct type
*arg1_type
, *arg2_type
;
9656 /* Automatically dereference any array reference before
9657 we attempt to perform the comparison. */
9658 arg1
= ada_coerce_ref (arg1
);
9659 arg2
= ada_coerce_ref (arg2
);
9661 arg1
= ada_coerce_to_simple_array (arg1
);
9662 arg2
= ada_coerce_to_simple_array (arg2
);
9664 arg1_type
= ada_check_typedef (value_type (arg1
));
9665 arg2_type
= ada_check_typedef (value_type (arg2
));
9667 if (arg1_type
->code () != TYPE_CODE_ARRAY
9668 || arg2_type
->code () != TYPE_CODE_ARRAY
)
9669 error (_("Attempt to compare array with non-array"));
9670 /* FIXME: The following works only for types whose
9671 representations use all bits (no padding or undefined bits)
9672 and do not have user-defined equality. */
9673 return (TYPE_LENGTH (arg1_type
) == TYPE_LENGTH (arg2_type
)
9674 && memcmp (value_contents (arg1
), value_contents (arg2
),
9675 TYPE_LENGTH (arg1_type
)) == 0);
9677 return value_equal (arg1
, arg2
);
9680 /* Total number of component associations in the aggregate starting at
9681 index PC in EXP. Assumes that index PC is the start of an
9685 num_component_specs (struct expression
*exp
, int pc
)
9689 m
= exp
->elts
[pc
+ 1].longconst
;
9692 for (i
= 0; i
< m
; i
+= 1)
9694 switch (exp
->elts
[pc
].opcode
)
9700 n
+= exp
->elts
[pc
+ 1].longconst
;
9703 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9708 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9709 component of LHS (a simple array or a record), updating *POS past
9710 the expression, assuming that LHS is contained in CONTAINER. Does
9711 not modify the inferior's memory, nor does it modify LHS (unless
9712 LHS == CONTAINER). */
9715 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9716 struct expression
*exp
, int *pos
)
9718 struct value
*mark
= value_mark ();
9720 struct type
*lhs_type
= check_typedef (value_type (lhs
));
9722 if (lhs_type
->code () == TYPE_CODE_ARRAY
)
9724 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9725 struct value
*index_val
= value_from_longest (index_type
, index
);
9727 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9731 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9732 elt
= ada_to_fixed_value (elt
);
9735 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9736 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9738 value_assign_to_component (container
, elt
,
9739 ada_evaluate_subexp (NULL
, exp
, pos
,
9742 value_free_to_mark (mark
);
9745 /* Assuming that LHS represents an lvalue having a record or array
9746 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9747 of that aggregate's value to LHS, advancing *POS past the
9748 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9749 lvalue containing LHS (possibly LHS itself). Does not modify
9750 the inferior's memory, nor does it modify the contents of
9751 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9753 static struct value
*
9754 assign_aggregate (struct value
*container
,
9755 struct value
*lhs
, struct expression
*exp
,
9756 int *pos
, enum noside noside
)
9758 struct type
*lhs_type
;
9759 int n
= exp
->elts
[*pos
+1].longconst
;
9760 LONGEST low_index
, high_index
;
9763 int max_indices
, num_indices
;
9767 if (noside
!= EVAL_NORMAL
)
9769 for (i
= 0; i
< n
; i
+= 1)
9770 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9774 container
= ada_coerce_ref (container
);
9775 if (ada_is_direct_array_type (value_type (container
)))
9776 container
= ada_coerce_to_simple_array (container
);
9777 lhs
= ada_coerce_ref (lhs
);
9778 if (!deprecated_value_modifiable (lhs
))
9779 error (_("Left operand of assignment is not a modifiable lvalue."));
9781 lhs_type
= check_typedef (value_type (lhs
));
9782 if (ada_is_direct_array_type (lhs_type
))
9784 lhs
= ada_coerce_to_simple_array (lhs
);
9785 lhs_type
= check_typedef (value_type (lhs
));
9786 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9787 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9789 else if (lhs_type
->code () == TYPE_CODE_STRUCT
)
9792 high_index
= num_visible_fields (lhs_type
) - 1;
9795 error (_("Left-hand side must be array or record."));
9797 num_specs
= num_component_specs (exp
, *pos
- 3);
9798 max_indices
= 4 * num_specs
+ 4;
9799 indices
= XALLOCAVEC (LONGEST
, max_indices
);
9800 indices
[0] = indices
[1] = low_index
- 1;
9801 indices
[2] = indices
[3] = high_index
+ 1;
9804 for (i
= 0; i
< n
; i
+= 1)
9806 switch (exp
->elts
[*pos
].opcode
)
9809 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9810 &num_indices
, max_indices
,
9811 low_index
, high_index
);
9814 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9815 &num_indices
, max_indices
,
9816 low_index
, high_index
);
9820 error (_("Misplaced 'others' clause"));
9821 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9822 num_indices
, low_index
, high_index
);
9825 error (_("Internal error: bad aggregate clause"));
9832 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9833 construct at *POS, updating *POS past the construct, given that
9834 the positions are relative to lower bound LOW, where HIGH is the
9835 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9836 updating *NUM_INDICES as needed. CONTAINER is as for
9837 assign_aggregate. */
9839 aggregate_assign_positional (struct value
*container
,
9840 struct value
*lhs
, struct expression
*exp
,
9841 int *pos
, LONGEST
*indices
, int *num_indices
,
9842 int max_indices
, LONGEST low
, LONGEST high
)
9844 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9846 if (ind
- 1 == high
)
9847 warning (_("Extra components in aggregate ignored."));
9850 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9852 assign_component (container
, lhs
, ind
, exp
, pos
);
9855 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9858 /* Assign into the components of LHS indexed by the OP_CHOICES
9859 construct at *POS, updating *POS past the construct, given that
9860 the allowable indices are LOW..HIGH. Record the indices assigned
9861 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9862 needed. CONTAINER is as for assign_aggregate. */
9864 aggregate_assign_from_choices (struct value
*container
,
9865 struct value
*lhs
, struct expression
*exp
,
9866 int *pos
, LONGEST
*indices
, int *num_indices
,
9867 int max_indices
, LONGEST low
, LONGEST high
)
9870 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9871 int choice_pos
, expr_pc
;
9872 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9874 choice_pos
= *pos
+= 3;
9876 for (j
= 0; j
< n_choices
; j
+= 1)
9877 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9879 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9881 for (j
= 0; j
< n_choices
; j
+= 1)
9883 LONGEST lower
, upper
;
9884 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9886 if (op
== OP_DISCRETE_RANGE
)
9889 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9891 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9896 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9908 name
= &exp
->elts
[choice_pos
+ 2].string
;
9911 name
= exp
->elts
[choice_pos
+ 2].symbol
->natural_name ();
9914 error (_("Invalid record component association."));
9916 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9918 if (! find_struct_field (name
, value_type (lhs
), 0,
9919 NULL
, NULL
, NULL
, NULL
, &ind
))
9920 error (_("Unknown component name: %s."), name
);
9921 lower
= upper
= ind
;
9924 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9925 error (_("Index in component association out of bounds."));
9927 add_component_interval (lower
, upper
, indices
, num_indices
,
9929 while (lower
<= upper
)
9934 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9940 /* Assign the value of the expression in the OP_OTHERS construct in
9941 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9942 have not been previously assigned. The index intervals already assigned
9943 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9944 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9946 aggregate_assign_others (struct value
*container
,
9947 struct value
*lhs
, struct expression
*exp
,
9948 int *pos
, LONGEST
*indices
, int num_indices
,
9949 LONGEST low
, LONGEST high
)
9952 int expr_pc
= *pos
+ 1;
9954 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9958 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9963 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9966 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9969 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9970 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9971 modifying *SIZE as needed. It is an error if *SIZE exceeds
9972 MAX_SIZE. The resulting intervals do not overlap. */
9974 add_component_interval (LONGEST low
, LONGEST high
,
9975 LONGEST
* indices
, int *size
, int max_size
)
9979 for (i
= 0; i
< *size
; i
+= 2) {
9980 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9984 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9985 if (high
< indices
[kh
])
9987 if (low
< indices
[i
])
9989 indices
[i
+ 1] = indices
[kh
- 1];
9990 if (high
> indices
[i
+ 1])
9991 indices
[i
+ 1] = high
;
9992 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9993 *size
-= kh
- i
- 2;
9996 else if (high
< indices
[i
])
10000 if (*size
== max_size
)
10001 error (_("Internal error: miscounted aggregate components."));
10003 for (j
= *size
-1; j
>= i
+2; j
-= 1)
10004 indices
[j
] = indices
[j
- 2];
10006 indices
[i
+ 1] = high
;
10009 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10012 static struct value
*
10013 ada_value_cast (struct type
*type
, struct value
*arg2
)
10015 if (type
== ada_check_typedef (value_type (arg2
)))
10018 if (ada_is_gnat_encoded_fixed_point_type (type
))
10019 return cast_to_fixed (type
, arg2
);
10021 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10022 return cast_from_fixed (type
, arg2
);
10024 return value_cast (type
, arg2
);
10027 /* Evaluating Ada expressions, and printing their result.
10028 ------------------------------------------------------
10033 We usually evaluate an Ada expression in order to print its value.
10034 We also evaluate an expression in order to print its type, which
10035 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10036 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10037 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10038 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10041 Evaluating expressions is a little more complicated for Ada entities
10042 than it is for entities in languages such as C. The main reason for
10043 this is that Ada provides types whose definition might be dynamic.
10044 One example of such types is variant records. Or another example
10045 would be an array whose bounds can only be known at run time.
10047 The following description is a general guide as to what should be
10048 done (and what should NOT be done) in order to evaluate an expression
10049 involving such types, and when. This does not cover how the semantic
10050 information is encoded by GNAT as this is covered separatly. For the
10051 document used as the reference for the GNAT encoding, see exp_dbug.ads
10052 in the GNAT sources.
10054 Ideally, we should embed each part of this description next to its
10055 associated code. Unfortunately, the amount of code is so vast right
10056 now that it's hard to see whether the code handling a particular
10057 situation might be duplicated or not. One day, when the code is
10058 cleaned up, this guide might become redundant with the comments
10059 inserted in the code, and we might want to remove it.
10061 2. ``Fixing'' an Entity, the Simple Case:
10062 -----------------------------------------
10064 When evaluating Ada expressions, the tricky issue is that they may
10065 reference entities whose type contents and size are not statically
10066 known. Consider for instance a variant record:
10068 type Rec (Empty : Boolean := True) is record
10071 when False => Value : Integer;
10074 Yes : Rec := (Empty => False, Value => 1);
10075 No : Rec := (empty => True);
10077 The size and contents of that record depends on the value of the
10078 descriminant (Rec.Empty). At this point, neither the debugging
10079 information nor the associated type structure in GDB are able to
10080 express such dynamic types. So what the debugger does is to create
10081 "fixed" versions of the type that applies to the specific object.
10082 We also informally refer to this operation as "fixing" an object,
10083 which means creating its associated fixed type.
10085 Example: when printing the value of variable "Yes" above, its fixed
10086 type would look like this:
10093 On the other hand, if we printed the value of "No", its fixed type
10100 Things become a little more complicated when trying to fix an entity
10101 with a dynamic type that directly contains another dynamic type,
10102 such as an array of variant records, for instance. There are
10103 two possible cases: Arrays, and records.
10105 3. ``Fixing'' Arrays:
10106 ---------------------
10108 The type structure in GDB describes an array in terms of its bounds,
10109 and the type of its elements. By design, all elements in the array
10110 have the same type and we cannot represent an array of variant elements
10111 using the current type structure in GDB. When fixing an array,
10112 we cannot fix the array element, as we would potentially need one
10113 fixed type per element of the array. As a result, the best we can do
10114 when fixing an array is to produce an array whose bounds and size
10115 are correct (allowing us to read it from memory), but without having
10116 touched its element type. Fixing each element will be done later,
10117 when (if) necessary.
10119 Arrays are a little simpler to handle than records, because the same
10120 amount of memory is allocated for each element of the array, even if
10121 the amount of space actually used by each element differs from element
10122 to element. Consider for instance the following array of type Rec:
10124 type Rec_Array is array (1 .. 2) of Rec;
10126 The actual amount of memory occupied by each element might be different
10127 from element to element, depending on the value of their discriminant.
10128 But the amount of space reserved for each element in the array remains
10129 fixed regardless. So we simply need to compute that size using
10130 the debugging information available, from which we can then determine
10131 the array size (we multiply the number of elements of the array by
10132 the size of each element).
10134 The simplest case is when we have an array of a constrained element
10135 type. For instance, consider the following type declarations:
10137 type Bounded_String (Max_Size : Integer) is
10139 Buffer : String (1 .. Max_Size);
10141 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10143 In this case, the compiler describes the array as an array of
10144 variable-size elements (identified by its XVS suffix) for which
10145 the size can be read in the parallel XVZ variable.
10147 In the case of an array of an unconstrained element type, the compiler
10148 wraps the array element inside a private PAD type. This type should not
10149 be shown to the user, and must be "unwrap"'ed before printing. Note
10150 that we also use the adjective "aligner" in our code to designate
10151 these wrapper types.
10153 In some cases, the size allocated for each element is statically
10154 known. In that case, the PAD type already has the correct size,
10155 and the array element should remain unfixed.
10157 But there are cases when this size is not statically known.
10158 For instance, assuming that "Five" is an integer variable:
10160 type Dynamic is array (1 .. Five) of Integer;
10161 type Wrapper (Has_Length : Boolean := False) is record
10164 when True => Length : Integer;
10165 when False => null;
10168 type Wrapper_Array is array (1 .. 2) of Wrapper;
10170 Hello : Wrapper_Array := (others => (Has_Length => True,
10171 Data => (others => 17),
10175 The debugging info would describe variable Hello as being an
10176 array of a PAD type. The size of that PAD type is not statically
10177 known, but can be determined using a parallel XVZ variable.
10178 In that case, a copy of the PAD type with the correct size should
10179 be used for the fixed array.
10181 3. ``Fixing'' record type objects:
10182 ----------------------------------
10184 Things are slightly different from arrays in the case of dynamic
10185 record types. In this case, in order to compute the associated
10186 fixed type, we need to determine the size and offset of each of
10187 its components. This, in turn, requires us to compute the fixed
10188 type of each of these components.
10190 Consider for instance the example:
10192 type Bounded_String (Max_Size : Natural) is record
10193 Str : String (1 .. Max_Size);
10196 My_String : Bounded_String (Max_Size => 10);
10198 In that case, the position of field "Length" depends on the size
10199 of field Str, which itself depends on the value of the Max_Size
10200 discriminant. In order to fix the type of variable My_String,
10201 we need to fix the type of field Str. Therefore, fixing a variant
10202 record requires us to fix each of its components.
10204 However, if a component does not have a dynamic size, the component
10205 should not be fixed. In particular, fields that use a PAD type
10206 should not fixed. Here is an example where this might happen
10207 (assuming type Rec above):
10209 type Container (Big : Boolean) is record
10213 when True => Another : Integer;
10214 when False => null;
10217 My_Container : Container := (Big => False,
10218 First => (Empty => True),
10221 In that example, the compiler creates a PAD type for component First,
10222 whose size is constant, and then positions the component After just
10223 right after it. The offset of component After is therefore constant
10226 The debugger computes the position of each field based on an algorithm
10227 that uses, among other things, the actual position and size of the field
10228 preceding it. Let's now imagine that the user is trying to print
10229 the value of My_Container. If the type fixing was recursive, we would
10230 end up computing the offset of field After based on the size of the
10231 fixed version of field First. And since in our example First has
10232 only one actual field, the size of the fixed type is actually smaller
10233 than the amount of space allocated to that field, and thus we would
10234 compute the wrong offset of field After.
10236 To make things more complicated, we need to watch out for dynamic
10237 components of variant records (identified by the ___XVL suffix in
10238 the component name). Even if the target type is a PAD type, the size
10239 of that type might not be statically known. So the PAD type needs
10240 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10241 we might end up with the wrong size for our component. This can be
10242 observed with the following type declarations:
10244 type Octal is new Integer range 0 .. 7;
10245 type Octal_Array is array (Positive range <>) of Octal;
10246 pragma Pack (Octal_Array);
10248 type Octal_Buffer (Size : Positive) is record
10249 Buffer : Octal_Array (1 .. Size);
10253 In that case, Buffer is a PAD type whose size is unset and needs
10254 to be computed by fixing the unwrapped type.
10256 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10257 ----------------------------------------------------------
10259 Lastly, when should the sub-elements of an entity that remained unfixed
10260 thus far, be actually fixed?
10262 The answer is: Only when referencing that element. For instance
10263 when selecting one component of a record, this specific component
10264 should be fixed at that point in time. Or when printing the value
10265 of a record, each component should be fixed before its value gets
10266 printed. Similarly for arrays, the element of the array should be
10267 fixed when printing each element of the array, or when extracting
10268 one element out of that array. On the other hand, fixing should
10269 not be performed on the elements when taking a slice of an array!
10271 Note that one of the side effects of miscomputing the offset and
10272 size of each field is that we end up also miscomputing the size
10273 of the containing type. This can have adverse results when computing
10274 the value of an entity. GDB fetches the value of an entity based
10275 on the size of its type, and thus a wrong size causes GDB to fetch
10276 the wrong amount of memory. In the case where the computed size is
10277 too small, GDB fetches too little data to print the value of our
10278 entity. Results in this case are unpredictable, as we usually read
10279 past the buffer containing the data =:-o. */
10281 /* Evaluate a subexpression of EXP, at index *POS, and return a value
10282 for that subexpression cast to TO_TYPE. Advance *POS over the
10286 ada_evaluate_subexp_for_cast (expression
*exp
, int *pos
,
10287 enum noside noside
, struct type
*to_type
)
10291 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
10292 || exp
->elts
[pc
].opcode
== OP_VAR_VALUE
)
10297 if (exp
->elts
[pc
].opcode
== OP_VAR_MSYM_VALUE
)
10299 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10300 return value_zero (to_type
, not_lval
);
10302 val
= evaluate_var_msym_value (noside
,
10303 exp
->elts
[pc
+ 1].objfile
,
10304 exp
->elts
[pc
+ 2].msymbol
);
10307 val
= evaluate_var_value (noside
,
10308 exp
->elts
[pc
+ 1].block
,
10309 exp
->elts
[pc
+ 2].symbol
);
10311 if (noside
== EVAL_SKIP
)
10312 return eval_skip_value (exp
);
10314 val
= ada_value_cast (to_type
, val
);
10316 /* Follow the Ada language semantics that do not allow taking
10317 an address of the result of a cast (view conversion in Ada). */
10318 if (VALUE_LVAL (val
) == lval_memory
)
10320 if (value_lazy (val
))
10321 value_fetch_lazy (val
);
10322 VALUE_LVAL (val
) = not_lval
;
10327 value
*val
= evaluate_subexp (to_type
, exp
, pos
, noside
);
10328 if (noside
== EVAL_SKIP
)
10329 return eval_skip_value (exp
);
10330 return ada_value_cast (to_type
, val
);
10333 /* Implement the evaluate_exp routine in the exp_descriptor structure
10334 for the Ada language. */
10336 static struct value
*
10337 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
10338 int *pos
, enum noside noside
)
10340 enum exp_opcode op
;
10344 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
10347 struct value
**argvec
;
10351 op
= exp
->elts
[pc
].opcode
;
10357 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10359 if (noside
== EVAL_NORMAL
)
10360 arg1
= unwrap_value (arg1
);
10362 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
10363 then we need to perform the conversion manually, because
10364 evaluate_subexp_standard doesn't do it. This conversion is
10365 necessary in Ada because the different kinds of float/fixed
10366 types in Ada have different representations.
10368 Similarly, we need to perform the conversion from OP_LONG
10370 if ((op
== OP_FLOAT
|| op
== OP_LONG
) && expect_type
!= NULL
)
10371 arg1
= ada_value_cast (expect_type
, arg1
);
10377 struct value
*result
;
10380 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10381 /* The result type will have code OP_STRING, bashed there from
10382 OP_ARRAY. Bash it back. */
10383 if (value_type (result
)->code () == TYPE_CODE_STRING
)
10384 value_type (result
)->set_code (TYPE_CODE_ARRAY
);
10390 type
= exp
->elts
[pc
+ 1].type
;
10391 return ada_evaluate_subexp_for_cast (exp
, pos
, noside
, type
);
10395 type
= exp
->elts
[pc
+ 1].type
;
10396 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
10399 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10400 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
10402 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
10403 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10405 return ada_value_assign (arg1
, arg1
);
10407 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10408 except if the lhs of our assignment is a convenience variable.
10409 In the case of assigning to a convenience variable, the lhs
10410 should be exactly the result of the evaluation of the rhs. */
10411 type
= value_type (arg1
);
10412 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10414 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
10415 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10417 if (VALUE_LVAL (arg1
) == lval_internalvar
)
10421 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10422 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
10423 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10425 (_("Fixed-point values must be assigned to fixed-point variables"));
10427 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
10428 return ada_value_assign (arg1
, arg2
);
10431 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10432 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10433 if (noside
== EVAL_SKIP
)
10435 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10436 return (value_from_longest
10437 (value_type (arg1
),
10438 value_as_long (arg1
) + value_as_long (arg2
)));
10439 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10440 return (value_from_longest
10441 (value_type (arg2
),
10442 value_as_long (arg1
) + value_as_long (arg2
)));
10443 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10444 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10445 && value_type (arg1
) != value_type (arg2
))
10446 error (_("Operands of fixed-point addition must have the same type"));
10447 /* Do the addition, and cast the result to the type of the first
10448 argument. We cannot cast the result to a reference type, so if
10449 ARG1 is a reference type, find its underlying type. */
10450 type
= value_type (arg1
);
10451 while (type
->code () == TYPE_CODE_REF
)
10452 type
= TYPE_TARGET_TYPE (type
);
10453 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10454 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
10457 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10458 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
10459 if (noside
== EVAL_SKIP
)
10461 if (value_type (arg1
)->code () == TYPE_CODE_PTR
)
10462 return (value_from_longest
10463 (value_type (arg1
),
10464 value_as_long (arg1
) - value_as_long (arg2
)));
10465 if (value_type (arg2
)->code () == TYPE_CODE_PTR
)
10466 return (value_from_longest
10467 (value_type (arg2
),
10468 value_as_long (arg1
) - value_as_long (arg2
)));
10469 if ((ada_is_gnat_encoded_fixed_point_type (value_type (arg1
))
10470 || ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10471 && value_type (arg1
) != value_type (arg2
))
10472 error (_("Operands of fixed-point subtraction "
10473 "must have the same type"));
10474 /* Do the substraction, and cast the result to the type of the first
10475 argument. We cannot cast the result to a reference type, so if
10476 ARG1 is a reference type, find its underlying type. */
10477 type
= value_type (arg1
);
10478 while (type
->code () == TYPE_CODE_REF
)
10479 type
= TYPE_TARGET_TYPE (type
);
10480 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10481 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10487 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10488 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10489 if (noside
== EVAL_SKIP
)
10491 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10493 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10494 return value_zero (value_type (arg1
), not_lval
);
10498 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10499 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10500 arg1
= cast_from_fixed (type
, arg1
);
10501 if (ada_is_gnat_encoded_fixed_point_type (value_type (arg2
)))
10502 arg2
= cast_from_fixed (type
, arg2
);
10503 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10504 return ada_value_binop (arg1
, arg2
, op
);
10508 case BINOP_NOTEQUAL
:
10509 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10510 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10511 if (noside
== EVAL_SKIP
)
10513 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10517 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10518 tem
= ada_value_equal (arg1
, arg2
);
10520 if (op
== BINOP_NOTEQUAL
)
10522 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10523 return value_from_longest (type
, (LONGEST
) tem
);
10526 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10527 if (noside
== EVAL_SKIP
)
10529 else if (ada_is_gnat_encoded_fixed_point_type (value_type (arg1
)))
10530 return value_cast (value_type (arg1
), value_neg (arg1
));
10533 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10534 return value_neg (arg1
);
10537 case BINOP_LOGICAL_AND
:
10538 case BINOP_LOGICAL_OR
:
10539 case UNOP_LOGICAL_NOT
:
10544 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10545 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10546 return value_cast (type
, val
);
10549 case BINOP_BITWISE_AND
:
10550 case BINOP_BITWISE_IOR
:
10551 case BINOP_BITWISE_XOR
:
10555 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10557 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10559 return value_cast (value_type (arg1
), val
);
10565 if (noside
== EVAL_SKIP
)
10571 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10572 /* Only encountered when an unresolved symbol occurs in a
10573 context other than a function call, in which case, it is
10575 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10576 exp
->elts
[pc
+ 2].symbol
->print_name ());
10578 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10580 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10581 /* Check to see if this is a tagged type. We also need to handle
10582 the case where the type is a reference to a tagged type, but
10583 we have to be careful to exclude pointers to tagged types.
10584 The latter should be shown as usual (as a pointer), whereas
10585 a reference should mostly be transparent to the user. */
10586 if (ada_is_tagged_type (type
, 0)
10587 || (type
->code () == TYPE_CODE_REF
10588 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10590 /* Tagged types are a little special in the fact that the real
10591 type is dynamic and can only be determined by inspecting the
10592 object's tag. This means that we need to get the object's
10593 value first (EVAL_NORMAL) and then extract the actual object
10596 Note that we cannot skip the final step where we extract
10597 the object type from its tag, because the EVAL_NORMAL phase
10598 results in dynamic components being resolved into fixed ones.
10599 This can cause problems when trying to print the type
10600 description of tagged types whose parent has a dynamic size:
10601 We use the type name of the "_parent" component in order
10602 to print the name of the ancestor type in the type description.
10603 If that component had a dynamic size, the resolution into
10604 a fixed type would result in the loss of that type name,
10605 thus preventing us from printing the name of the ancestor
10606 type in the type description. */
10607 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10609 if (type
->code () != TYPE_CODE_REF
)
10611 struct type
*actual_type
;
10613 actual_type
= type_from_tag (ada_value_tag (arg1
));
10614 if (actual_type
== NULL
)
10615 /* If, for some reason, we were unable to determine
10616 the actual type from the tag, then use the static
10617 approximation that we just computed as a fallback.
10618 This can happen if the debugging information is
10619 incomplete, for instance. */
10620 actual_type
= type
;
10621 return value_zero (actual_type
, not_lval
);
10625 /* In the case of a ref, ada_coerce_ref takes care
10626 of determining the actual type. But the evaluation
10627 should return a ref as it should be valid to ask
10628 for its address; so rebuild a ref after coerce. */
10629 arg1
= ada_coerce_ref (arg1
);
10630 return value_ref (arg1
, TYPE_CODE_REF
);
10634 /* Records and unions for which GNAT encodings have been
10635 generated need to be statically fixed as well.
10636 Otherwise, non-static fixing produces a type where
10637 all dynamic properties are removed, which prevents "ptype"
10638 from being able to completely describe the type.
10639 For instance, a case statement in a variant record would be
10640 replaced by the relevant components based on the actual
10641 value of the discriminants. */
10642 if ((type
->code () == TYPE_CODE_STRUCT
10643 && dynamic_template_type (type
) != NULL
)
10644 || (type
->code () == TYPE_CODE_UNION
10645 && ada_find_parallel_type (type
, "___XVU") != NULL
))
10648 return value_zero (to_static_fixed_type (type
), not_lval
);
10652 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10653 return ada_to_fixed_value (arg1
);
10658 /* Allocate arg vector, including space for the function to be
10659 called in argvec[0] and a terminating NULL. */
10660 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10661 argvec
= XALLOCAVEC (struct value
*, nargs
+ 2);
10663 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10664 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10665 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10666 exp
->elts
[pc
+ 5].symbol
->print_name ());
10669 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10670 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10673 if (noside
== EVAL_SKIP
)
10677 if (ada_is_constrained_packed_array_type
10678 (desc_base_type (value_type (argvec
[0]))))
10679 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10680 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10681 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10682 /* This is a packed array that has already been fixed, and
10683 therefore already coerced to a simple array. Nothing further
10686 else if (value_type (argvec
[0])->code () == TYPE_CODE_REF
)
10688 /* Make sure we dereference references so that all the code below
10689 feels like it's really handling the referenced value. Wrapping
10690 types (for alignment) may be there, so make sure we strip them as
10692 argvec
[0] = ada_to_fixed_value (coerce_ref (argvec
[0]));
10694 else if (value_type (argvec
[0])->code () == TYPE_CODE_ARRAY
10695 && VALUE_LVAL (argvec
[0]) == lval_memory
)
10696 argvec
[0] = value_addr (argvec
[0]);
10698 type
= ada_check_typedef (value_type (argvec
[0]));
10700 /* Ada allows us to implicitly dereference arrays when subscripting
10701 them. So, if this is an array typedef (encoding use for array
10702 access types encoded as fat pointers), strip it now. */
10703 if (type
->code () == TYPE_CODE_TYPEDEF
)
10704 type
= ada_typedef_target_type (type
);
10706 if (type
->code () == TYPE_CODE_PTR
)
10708 switch (ada_check_typedef (TYPE_TARGET_TYPE (type
))->code ())
10710 case TYPE_CODE_FUNC
:
10711 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10713 case TYPE_CODE_ARRAY
:
10715 case TYPE_CODE_STRUCT
:
10716 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10717 argvec
[0] = ada_value_ind (argvec
[0]);
10718 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10721 error (_("cannot subscript or call something of type `%s'"),
10722 ada_type_name (value_type (argvec
[0])));
10727 switch (type
->code ())
10729 case TYPE_CODE_FUNC
:
10730 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10732 if (TYPE_TARGET_TYPE (type
) == NULL
)
10733 error_call_unknown_return_type (NULL
);
10734 return allocate_value (TYPE_TARGET_TYPE (type
));
10736 return call_function_by_hand (argvec
[0], NULL
,
10737 gdb::make_array_view (argvec
+ 1,
10739 case TYPE_CODE_INTERNAL_FUNCTION
:
10740 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10741 /* We don't know anything about what the internal
10742 function might return, but we have to return
10744 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10747 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10748 argvec
[0], nargs
, argvec
+ 1);
10750 case TYPE_CODE_STRUCT
:
10754 arity
= ada_array_arity (type
);
10755 type
= ada_array_element_type (type
, nargs
);
10757 error (_("cannot subscript or call a record"));
10758 if (arity
!= nargs
)
10759 error (_("wrong number of subscripts; expecting %d"), arity
);
10760 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10761 return value_zero (ada_aligned_type (type
), lval_memory
);
10763 unwrap_value (ada_value_subscript
10764 (argvec
[0], nargs
, argvec
+ 1));
10766 case TYPE_CODE_ARRAY
:
10767 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10769 type
= ada_array_element_type (type
, nargs
);
10771 error (_("element type of array unknown"));
10773 return value_zero (ada_aligned_type (type
), lval_memory
);
10776 unwrap_value (ada_value_subscript
10777 (ada_coerce_to_simple_array (argvec
[0]),
10778 nargs
, argvec
+ 1));
10779 case TYPE_CODE_PTR
: /* Pointer to array */
10780 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10782 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10783 type
= ada_array_element_type (type
, nargs
);
10785 error (_("element type of array unknown"));
10787 return value_zero (ada_aligned_type (type
), lval_memory
);
10790 unwrap_value (ada_value_ptr_subscript (argvec
[0],
10791 nargs
, argvec
+ 1));
10794 error (_("Attempt to index or call something other than an "
10795 "array or function"));
10800 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10801 struct value
*low_bound_val
=
10802 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10803 struct value
*high_bound_val
=
10804 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10806 LONGEST high_bound
;
10808 low_bound_val
= coerce_ref (low_bound_val
);
10809 high_bound_val
= coerce_ref (high_bound_val
);
10810 low_bound
= value_as_long (low_bound_val
);
10811 high_bound
= value_as_long (high_bound_val
);
10813 if (noside
== EVAL_SKIP
)
10816 /* If this is a reference to an aligner type, then remove all
10818 if (value_type (array
)->code () == TYPE_CODE_REF
10819 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10820 TYPE_TARGET_TYPE (value_type (array
)) =
10821 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10823 if (ada_is_constrained_packed_array_type (value_type (array
)))
10824 error (_("cannot slice a packed array"));
10826 /* If this is a reference to an array or an array lvalue,
10827 convert to a pointer. */
10828 if (value_type (array
)->code () == TYPE_CODE_REF
10829 || (value_type (array
)->code () == TYPE_CODE_ARRAY
10830 && VALUE_LVAL (array
) == lval_memory
))
10831 array
= value_addr (array
);
10833 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10834 && ada_is_array_descriptor_type (ada_check_typedef
10835 (value_type (array
))))
10836 return empty_array (ada_type_of_array (array
, 0), low_bound
,
10839 array
= ada_coerce_to_simple_array_ptr (array
);
10841 /* If we have more than one level of pointer indirection,
10842 dereference the value until we get only one level. */
10843 while (value_type (array
)->code () == TYPE_CODE_PTR
10844 && (TYPE_TARGET_TYPE (value_type (array
))->code ()
10846 array
= value_ind (array
);
10848 /* Make sure we really do have an array type before going further,
10849 to avoid a SEGV when trying to get the index type or the target
10850 type later down the road if the debug info generated by
10851 the compiler is incorrect or incomplete. */
10852 if (!ada_is_simple_array_type (value_type (array
)))
10853 error (_("cannot take slice of non-array"));
10855 if (ada_check_typedef (value_type (array
))->code ()
10858 struct type
*type0
= ada_check_typedef (value_type (array
));
10860 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10861 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
, high_bound
);
10864 struct type
*arr_type0
=
10865 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10867 return ada_value_slice_from_ptr (array
, arr_type0
,
10868 longest_to_int (low_bound
),
10869 longest_to_int (high_bound
));
10872 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10874 else if (high_bound
< low_bound
)
10875 return empty_array (value_type (array
), low_bound
, high_bound
);
10877 return ada_value_slice (array
, longest_to_int (low_bound
),
10878 longest_to_int (high_bound
));
10881 case UNOP_IN_RANGE
:
10883 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10884 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10886 if (noside
== EVAL_SKIP
)
10889 switch (type
->code ())
10892 lim_warning (_("Membership test incompletely implemented; "
10893 "always returns true"));
10894 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10895 return value_from_longest (type
, (LONGEST
) 1);
10897 case TYPE_CODE_RANGE
:
10898 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10899 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10900 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10901 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10902 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10904 value_from_longest (type
,
10905 (value_less (arg1
, arg3
)
10906 || value_equal (arg1
, arg3
))
10907 && (value_less (arg2
, arg1
)
10908 || value_equal (arg2
, arg1
)));
10911 case BINOP_IN_BOUNDS
:
10913 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10914 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10916 if (noside
== EVAL_SKIP
)
10919 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10921 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10922 return value_zero (type
, not_lval
);
10925 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10927 type
= ada_index_type (value_type (arg2
), tem
, "range");
10929 type
= value_type (arg1
);
10931 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10932 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10934 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10935 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10936 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10938 value_from_longest (type
,
10939 (value_less (arg1
, arg3
)
10940 || value_equal (arg1
, arg3
))
10941 && (value_less (arg2
, arg1
)
10942 || value_equal (arg2
, arg1
)));
10944 case TERNOP_IN_RANGE
:
10945 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10946 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10947 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10949 if (noside
== EVAL_SKIP
)
10952 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10953 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10954 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10956 value_from_longest (type
,
10957 (value_less (arg1
, arg3
)
10958 || value_equal (arg1
, arg3
))
10959 && (value_less (arg2
, arg1
)
10960 || value_equal (arg2
, arg1
)));
10964 case OP_ATR_LENGTH
:
10966 struct type
*type_arg
;
10968 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10970 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10972 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10976 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10980 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10981 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10982 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10985 if (noside
== EVAL_SKIP
)
10987 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10989 if (type_arg
== NULL
)
10990 type_arg
= value_type (arg1
);
10992 if (ada_is_constrained_packed_array_type (type_arg
))
10993 type_arg
= decode_constrained_packed_array_type (type_arg
);
10995 if (!discrete_type_p (type_arg
))
10999 default: /* Should never happen. */
11000 error (_("unexpected attribute encountered"));
11003 type_arg
= ada_index_type (type_arg
, tem
,
11004 ada_attribute_name (op
));
11006 case OP_ATR_LENGTH
:
11007 type_arg
= builtin_type (exp
->gdbarch
)->builtin_int
;
11012 return value_zero (type_arg
, not_lval
);
11014 else if (type_arg
== NULL
)
11016 arg1
= ada_coerce_ref (arg1
);
11018 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
11019 arg1
= ada_coerce_to_simple_array (arg1
);
11021 if (op
== OP_ATR_LENGTH
)
11022 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11025 type
= ada_index_type (value_type (arg1
), tem
,
11026 ada_attribute_name (op
));
11028 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11033 default: /* Should never happen. */
11034 error (_("unexpected attribute encountered"));
11036 return value_from_longest
11037 (type
, ada_array_bound (arg1
, tem
, 0));
11039 return value_from_longest
11040 (type
, ada_array_bound (arg1
, tem
, 1));
11041 case OP_ATR_LENGTH
:
11042 return value_from_longest
11043 (type
, ada_array_length (arg1
, tem
));
11046 else if (discrete_type_p (type_arg
))
11048 struct type
*range_type
;
11049 const char *name
= ada_type_name (type_arg
);
11052 if (name
!= NULL
&& type_arg
->code () != TYPE_CODE_ENUM
)
11053 range_type
= to_fixed_range_type (type_arg
, NULL
);
11054 if (range_type
== NULL
)
11055 range_type
= type_arg
;
11059 error (_("unexpected attribute encountered"));
11061 return value_from_longest
11062 (range_type
, ada_discrete_type_low_bound (range_type
));
11064 return value_from_longest
11065 (range_type
, ada_discrete_type_high_bound (range_type
));
11066 case OP_ATR_LENGTH
:
11067 error (_("the 'length attribute applies only to array types"));
11070 else if (type_arg
->code () == TYPE_CODE_FLT
)
11071 error (_("unimplemented type attribute"));
11076 if (ada_is_constrained_packed_array_type (type_arg
))
11077 type_arg
= decode_constrained_packed_array_type (type_arg
);
11079 if (op
== OP_ATR_LENGTH
)
11080 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11083 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
11085 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11091 error (_("unexpected attribute encountered"));
11093 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11094 return value_from_longest (type
, low
);
11096 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11097 return value_from_longest (type
, high
);
11098 case OP_ATR_LENGTH
:
11099 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
11100 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
11101 return value_from_longest (type
, high
- low
+ 1);
11107 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11108 if (noside
== EVAL_SKIP
)
11111 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11112 return value_zero (ada_tag_type (arg1
), not_lval
);
11114 return ada_value_tag (arg1
);
11118 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11119 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11120 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11121 if (noside
== EVAL_SKIP
)
11123 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11124 return value_zero (value_type (arg1
), not_lval
);
11127 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11128 return value_binop (arg1
, arg2
,
11129 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
11132 case OP_ATR_MODULUS
:
11134 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
11136 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11137 if (noside
== EVAL_SKIP
)
11140 if (!ada_is_modular_type (type_arg
))
11141 error (_("'modulus must be applied to modular type"));
11143 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
11144 ada_modulus (type_arg
));
11149 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11150 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11151 if (noside
== EVAL_SKIP
)
11153 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
11154 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11155 return value_zero (type
, not_lval
);
11157 return value_pos_atr (type
, arg1
);
11160 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11161 type
= value_type (arg1
);
11163 /* If the argument is a reference, then dereference its type, since
11164 the user is really asking for the size of the actual object,
11165 not the size of the pointer. */
11166 if (type
->code () == TYPE_CODE_REF
)
11167 type
= TYPE_TARGET_TYPE (type
);
11169 if (noside
== EVAL_SKIP
)
11171 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11172 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
11174 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
11175 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
11178 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
11179 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11180 type
= exp
->elts
[pc
+ 2].type
;
11181 if (noside
== EVAL_SKIP
)
11183 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11184 return value_zero (type
, not_lval
);
11186 return value_val_atr (type
, arg1
);
11189 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11190 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11191 if (noside
== EVAL_SKIP
)
11193 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11194 return value_zero (value_type (arg1
), not_lval
);
11197 /* For integer exponentiation operations,
11198 only promote the first argument. */
11199 if (is_integral_type (value_type (arg2
)))
11200 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11202 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
11204 return value_binop (arg1
, arg2
, op
);
11208 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11209 if (noside
== EVAL_SKIP
)
11215 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11216 if (noside
== EVAL_SKIP
)
11218 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
11219 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
11220 return value_neg (arg1
);
11225 preeval_pos
= *pos
;
11226 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11227 if (noside
== EVAL_SKIP
)
11229 type
= ada_check_typedef (value_type (arg1
));
11230 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11232 if (ada_is_array_descriptor_type (type
))
11233 /* GDB allows dereferencing GNAT array descriptors. */
11235 struct type
*arrType
= ada_type_of_array (arg1
, 0);
11237 if (arrType
== NULL
)
11238 error (_("Attempt to dereference null array pointer."));
11239 return value_at_lazy (arrType
, 0);
11241 else if (type
->code () == TYPE_CODE_PTR
11242 || type
->code () == TYPE_CODE_REF
11243 /* In C you can dereference an array to get the 1st elt. */
11244 || type
->code () == TYPE_CODE_ARRAY
)
11246 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11247 only be determined by inspecting the object's tag.
11248 This means that we need to evaluate completely the
11249 expression in order to get its type. */
11251 if ((type
->code () == TYPE_CODE_REF
11252 || type
->code () == TYPE_CODE_PTR
)
11253 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0))
11255 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11257 type
= value_type (ada_value_ind (arg1
));
11261 type
= to_static_fixed_type
11263 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
11265 ada_ensure_varsize_limit (type
);
11266 return value_zero (type
, lval_memory
);
11268 else if (type
->code () == TYPE_CODE_INT
)
11270 /* GDB allows dereferencing an int. */
11271 if (expect_type
== NULL
)
11272 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
11277 to_static_fixed_type (ada_aligned_type (expect_type
));
11278 return value_zero (expect_type
, lval_memory
);
11282 error (_("Attempt to take contents of a non-pointer value."));
11284 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
11285 type
= ada_check_typedef (value_type (arg1
));
11287 if (type
->code () == TYPE_CODE_INT
)
11288 /* GDB allows dereferencing an int. If we were given
11289 the expect_type, then use that as the target type.
11290 Otherwise, assume that the target type is an int. */
11292 if (expect_type
!= NULL
)
11293 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
11296 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
11297 (CORE_ADDR
) value_as_address (arg1
));
11300 if (ada_is_array_descriptor_type (type
))
11301 /* GDB allows dereferencing GNAT array descriptors. */
11302 return ada_coerce_to_simple_array (arg1
);
11304 return ada_value_ind (arg1
);
11306 case STRUCTOP_STRUCT
:
11307 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11308 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
11309 preeval_pos
= *pos
;
11310 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
11311 if (noside
== EVAL_SKIP
)
11313 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11315 struct type
*type1
= value_type (arg1
);
11317 if (ada_is_tagged_type (type1
, 1))
11319 type
= ada_lookup_struct_elt_type (type1
,
11320 &exp
->elts
[pc
+ 2].string
,
11323 /* If the field is not found, check if it exists in the
11324 extension of this object's type. This means that we
11325 need to evaluate completely the expression. */
11329 arg1
= evaluate_subexp (NULL_TYPE
, exp
, &preeval_pos
,
11331 arg1
= ada_value_struct_elt (arg1
,
11332 &exp
->elts
[pc
+ 2].string
,
11334 arg1
= unwrap_value (arg1
);
11335 type
= value_type (ada_to_fixed_value (arg1
));
11340 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
11343 return value_zero (ada_aligned_type (type
), lval_memory
);
11347 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
11348 arg1
= unwrap_value (arg1
);
11349 return ada_to_fixed_value (arg1
);
11353 /* The value is not supposed to be used. This is here to make it
11354 easier to accommodate expressions that contain types. */
11356 if (noside
== EVAL_SKIP
)
11358 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
11359 return allocate_value (exp
->elts
[pc
+ 1].type
);
11361 error (_("Attempt to use a type name as an expression"));
11366 case OP_DISCRETE_RANGE
:
11367 case OP_POSITIONAL
:
11369 if (noside
== EVAL_NORMAL
)
11373 error (_("Undefined name, ambiguous name, or renaming used in "
11374 "component association: %s."), &exp
->elts
[pc
+2].string
);
11376 error (_("Aggregates only allowed on the right of an assignment"));
11378 internal_error (__FILE__
, __LINE__
,
11379 _("aggregate apparently mangled"));
11382 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11384 for (tem
= 0; tem
< nargs
; tem
+= 1)
11385 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
11390 return eval_skip_value (exp
);
11396 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
11397 type name that encodes the 'small and 'delta information.
11398 Otherwise, return NULL. */
11400 static const char *
11401 gnat_encoded_fixed_type_info (struct type
*type
)
11403 const char *name
= ada_type_name (type
);
11404 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: type
->code ();
11406 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
11408 const char *tail
= strstr (name
, "___XF_");
11415 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
11416 return gnat_encoded_fixed_type_info (TYPE_TARGET_TYPE (type
));
11421 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
11424 ada_is_gnat_encoded_fixed_point_type (struct type
*type
)
11426 return gnat_encoded_fixed_type_info (type
) != NULL
;
11429 /* Return non-zero iff TYPE represents a System.Address type. */
11432 ada_is_system_address_type (struct type
*type
)
11434 return (type
->name () && strcmp (type
->name (), "system__address") == 0);
11437 /* Assuming that TYPE is the representation of an Ada fixed-point
11438 type, return the target floating-point type to be used to represent
11439 of this type during internal computation. */
11441 static struct type
*
11442 ada_scaling_type (struct type
*type
)
11444 return builtin_type (get_type_arch (type
))->builtin_long_double
;
11447 /* Assuming that TYPE is the representation of an Ada fixed-point
11448 type, return its delta, or NULL if the type is malformed and the
11449 delta cannot be determined. */
11452 gnat_encoded_fixed_point_delta (struct type
*type
)
11454 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11455 struct type
*scale_type
= ada_scaling_type (type
);
11457 long long num
, den
;
11459 if (sscanf (encoding
, "_%lld_%lld", &num
, &den
) < 2)
11462 return value_binop (value_from_longest (scale_type
, num
),
11463 value_from_longest (scale_type
, den
), BINOP_DIV
);
11466 /* Assuming that ada_is_gnat_encoded_fixed_point_type (TYPE), return
11467 the scaling factor ('SMALL value) associated with the type. */
11470 ada_scaling_factor (struct type
*type
)
11472 const char *encoding
= gnat_encoded_fixed_type_info (type
);
11473 struct type
*scale_type
= ada_scaling_type (type
);
11475 long long num0
, den0
, num1
, den1
;
11478 n
= sscanf (encoding
, "_%lld_%lld_%lld_%lld",
11479 &num0
, &den0
, &num1
, &den1
);
11482 return value_from_longest (scale_type
, 1);
11484 return value_binop (value_from_longest (scale_type
, num1
),
11485 value_from_longest (scale_type
, den1
), BINOP_DIV
);
11487 return value_binop (value_from_longest (scale_type
, num0
),
11488 value_from_longest (scale_type
, den0
), BINOP_DIV
);
11495 /* Scan STR beginning at position K for a discriminant name, and
11496 return the value of that discriminant field of DVAL in *PX. If
11497 PNEW_K is not null, put the position of the character beyond the
11498 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
11499 not alter *PX and *PNEW_K if unsuccessful. */
11502 scan_discrim_bound (const char *str
, int k
, struct value
*dval
, LONGEST
* px
,
11505 static char *bound_buffer
= NULL
;
11506 static size_t bound_buffer_len
= 0;
11507 const char *pstart
, *pend
, *bound
;
11508 struct value
*bound_val
;
11510 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
11514 pend
= strstr (pstart
, "__");
11518 k
+= strlen (bound
);
11522 int len
= pend
- pstart
;
11524 /* Strip __ and beyond. */
11525 GROW_VECT (bound_buffer
, bound_buffer_len
, len
+ 1);
11526 strncpy (bound_buffer
, pstart
, len
);
11527 bound_buffer
[len
] = '\0';
11529 bound
= bound_buffer
;
11533 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11534 if (bound_val
== NULL
)
11537 *px
= value_as_long (bound_val
);
11538 if (pnew_k
!= NULL
)
11543 /* Value of variable named NAME in the current environment. If
11544 no such variable found, then if ERR_MSG is null, returns 0, and
11545 otherwise causes an error with message ERR_MSG. */
11547 static struct value
*
11548 get_var_value (const char *name
, const char *err_msg
)
11550 lookup_name_info
lookup_name (name
, symbol_name_match_type::FULL
);
11552 std::vector
<struct block_symbol
> syms
;
11553 int nsyms
= ada_lookup_symbol_list_worker (lookup_name
,
11554 get_selected_block (0),
11555 VAR_DOMAIN
, &syms
, 1);
11559 if (err_msg
== NULL
)
11562 error (("%s"), err_msg
);
11565 return value_of_variable (syms
[0].symbol
, syms
[0].block
);
11568 /* Value of integer variable named NAME in the current environment.
11569 If no such variable is found, returns false. Otherwise, sets VALUE
11570 to the variable's value and returns true. */
11573 get_int_var_value (const char *name
, LONGEST
&value
)
11575 struct value
*var_val
= get_var_value (name
, 0);
11580 value
= value_as_long (var_val
);
11585 /* Return a range type whose base type is that of the range type named
11586 NAME in the current environment, and whose bounds are calculated
11587 from NAME according to the GNAT range encoding conventions.
11588 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11589 corresponding range type from debug information; fall back to using it
11590 if symbol lookup fails. If a new type must be created, allocate it
11591 like ORIG_TYPE was. The bounds information, in general, is encoded
11592 in NAME, the base type given in the named range type. */
11594 static struct type
*
11595 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11598 struct type
*base_type
;
11599 const char *subtype_info
;
11601 gdb_assert (raw_type
!= NULL
);
11602 gdb_assert (raw_type
->name () != NULL
);
11604 if (raw_type
->code () == TYPE_CODE_RANGE
)
11605 base_type
= TYPE_TARGET_TYPE (raw_type
);
11607 base_type
= raw_type
;
11609 name
= raw_type
->name ();
11610 subtype_info
= strstr (name
, "___XD");
11611 if (subtype_info
== NULL
)
11613 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11614 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11616 if (L
< INT_MIN
|| U
> INT_MAX
)
11619 return create_static_range_type (alloc_type_copy (raw_type
), raw_type
,
11624 static char *name_buf
= NULL
;
11625 static size_t name_len
= 0;
11626 int prefix_len
= subtype_info
- name
;
11629 const char *bounds_str
;
11632 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11633 strncpy (name_buf
, name
, prefix_len
);
11634 name_buf
[prefix_len
] = '\0';
11637 bounds_str
= strchr (subtype_info
, '_');
11640 if (*subtype_info
== 'L')
11642 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11643 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11645 if (bounds_str
[n
] == '_')
11647 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11653 strcpy (name_buf
+ prefix_len
, "___L");
11654 if (!get_int_var_value (name_buf
, L
))
11656 lim_warning (_("Unknown lower bound, using 1."));
11661 if (*subtype_info
== 'U')
11663 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11664 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11669 strcpy (name_buf
+ prefix_len
, "___U");
11670 if (!get_int_var_value (name_buf
, U
))
11672 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11677 type
= create_static_range_type (alloc_type_copy (raw_type
),
11679 /* create_static_range_type alters the resulting type's length
11680 to match the size of the base_type, which is not what we want.
11681 Set it back to the original range type's length. */
11682 TYPE_LENGTH (type
) = TYPE_LENGTH (raw_type
);
11683 type
->set_name (name
);
11688 /* True iff NAME is the name of a range type. */
11691 ada_is_range_type_name (const char *name
)
11693 return (name
!= NULL
&& strstr (name
, "___XD"));
11697 /* Modular types */
11699 /* True iff TYPE is an Ada modular type. */
11702 ada_is_modular_type (struct type
*type
)
11704 struct type
*subranged_type
= get_base_type (type
);
11706 return (subranged_type
!= NULL
&& type
->code () == TYPE_CODE_RANGE
11707 && subranged_type
->code () == TYPE_CODE_INT
11708 && TYPE_UNSIGNED (subranged_type
));
11711 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11714 ada_modulus (struct type
*type
)
11716 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11720 /* Ada exception catchpoint support:
11721 ---------------------------------
11723 We support 3 kinds of exception catchpoints:
11724 . catchpoints on Ada exceptions
11725 . catchpoints on unhandled Ada exceptions
11726 . catchpoints on failed assertions
11728 Exceptions raised during failed assertions, or unhandled exceptions
11729 could perfectly be caught with the general catchpoint on Ada exceptions.
11730 However, we can easily differentiate these two special cases, and having
11731 the option to distinguish these two cases from the rest can be useful
11732 to zero-in on certain situations.
11734 Exception catchpoints are a specialized form of breakpoint,
11735 since they rely on inserting breakpoints inside known routines
11736 of the GNAT runtime. The implementation therefore uses a standard
11737 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11740 Support in the runtime for exception catchpoints have been changed
11741 a few times already, and these changes affect the implementation
11742 of these catchpoints. In order to be able to support several
11743 variants of the runtime, we use a sniffer that will determine
11744 the runtime variant used by the program being debugged. */
11746 /* Ada's standard exceptions.
11748 The Ada 83 standard also defined Numeric_Error. But there so many
11749 situations where it was unclear from the Ada 83 Reference Manual
11750 (RM) whether Constraint_Error or Numeric_Error should be raised,
11751 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11752 Interpretation saying that anytime the RM says that Numeric_Error
11753 should be raised, the implementation may raise Constraint_Error.
11754 Ada 95 went one step further and pretty much removed Numeric_Error
11755 from the list of standard exceptions (it made it a renaming of
11756 Constraint_Error, to help preserve compatibility when compiling
11757 an Ada83 compiler). As such, we do not include Numeric_Error from
11758 this list of standard exceptions. */
11760 static const char *standard_exc
[] = {
11761 "constraint_error",
11767 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11769 /* A structure that describes how to support exception catchpoints
11770 for a given executable. */
11772 struct exception_support_info
11774 /* The name of the symbol to break on in order to insert
11775 a catchpoint on exceptions. */
11776 const char *catch_exception_sym
;
11778 /* The name of the symbol to break on in order to insert
11779 a catchpoint on unhandled exceptions. */
11780 const char *catch_exception_unhandled_sym
;
11782 /* The name of the symbol to break on in order to insert
11783 a catchpoint on failed assertions. */
11784 const char *catch_assert_sym
;
11786 /* The name of the symbol to break on in order to insert
11787 a catchpoint on exception handling. */
11788 const char *catch_handlers_sym
;
11790 /* Assuming that the inferior just triggered an unhandled exception
11791 catchpoint, this function is responsible for returning the address
11792 in inferior memory where the name of that exception is stored.
11793 Return zero if the address could not be computed. */
11794 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11797 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11798 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11800 /* The following exception support info structure describes how to
11801 implement exception catchpoints with the latest version of the
11802 Ada runtime (as of 2019-08-??). */
11804 static const struct exception_support_info default_exception_support_info
=
11806 "__gnat_debug_raise_exception", /* catch_exception_sym */
11807 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11808 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11809 "__gnat_begin_handler_v1", /* catch_handlers_sym */
11810 ada_unhandled_exception_name_addr
11813 /* The following exception support info structure describes how to
11814 implement exception catchpoints with an earlier version of the
11815 Ada runtime (as of 2007-03-06) using v0 of the EH ABI. */
11817 static const struct exception_support_info exception_support_info_v0
=
11819 "__gnat_debug_raise_exception", /* catch_exception_sym */
11820 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11821 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11822 "__gnat_begin_handler", /* catch_handlers_sym */
11823 ada_unhandled_exception_name_addr
11826 /* The following exception support info structure describes how to
11827 implement exception catchpoints with a slightly older version
11828 of the Ada runtime. */
11830 static const struct exception_support_info exception_support_info_fallback
=
11832 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11833 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11834 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11835 "__gnat_begin_handler", /* catch_handlers_sym */
11836 ada_unhandled_exception_name_addr_from_raise
11839 /* Return nonzero if we can detect the exception support routines
11840 described in EINFO.
11842 This function errors out if an abnormal situation is detected
11843 (for instance, if we find the exception support routines, but
11844 that support is found to be incomplete). */
11847 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11849 struct symbol
*sym
;
11851 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11852 that should be compiled with debugging information. As a result, we
11853 expect to find that symbol in the symtabs. */
11855 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11858 /* Perhaps we did not find our symbol because the Ada runtime was
11859 compiled without debugging info, or simply stripped of it.
11860 It happens on some GNU/Linux distributions for instance, where
11861 users have to install a separate debug package in order to get
11862 the runtime's debugging info. In that situation, let the user
11863 know why we cannot insert an Ada exception catchpoint.
11865 Note: Just for the purpose of inserting our Ada exception
11866 catchpoint, we could rely purely on the associated minimal symbol.
11867 But we would be operating in degraded mode anyway, since we are
11868 still lacking the debugging info needed later on to extract
11869 the name of the exception being raised (this name is printed in
11870 the catchpoint message, and is also used when trying to catch
11871 a specific exception). We do not handle this case for now. */
11872 struct bound_minimal_symbol msym
11873 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11875 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11876 error (_("Your Ada runtime appears to be missing some debugging "
11877 "information.\nCannot insert Ada exception catchpoint "
11878 "in this configuration."));
11883 /* Make sure that the symbol we found corresponds to a function. */
11885 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11887 error (_("Symbol \"%s\" is not a function (class = %d)"),
11888 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11892 sym
= standard_lookup (einfo
->catch_handlers_sym
, NULL
, VAR_DOMAIN
);
11895 struct bound_minimal_symbol msym
11896 = lookup_minimal_symbol (einfo
->catch_handlers_sym
, NULL
, NULL
);
11898 if (msym
.minsym
&& MSYMBOL_TYPE (msym
.minsym
) != mst_solib_trampoline
)
11899 error (_("Your Ada runtime appears to be missing some debugging "
11900 "information.\nCannot insert Ada exception catchpoint "
11901 "in this configuration."));
11906 /* Make sure that the symbol we found corresponds to a function. */
11908 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11910 error (_("Symbol \"%s\" is not a function (class = %d)"),
11911 sym
->linkage_name (), SYMBOL_CLASS (sym
));
11918 /* Inspect the Ada runtime and determine which exception info structure
11919 should be used to provide support for exception catchpoints.
11921 This function will always set the per-inferior exception_info,
11922 or raise an error. */
11925 ada_exception_support_info_sniffer (void)
11927 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11929 /* If the exception info is already known, then no need to recompute it. */
11930 if (data
->exception_info
!= NULL
)
11933 /* Check the latest (default) exception support info. */
11934 if (ada_has_this_exception_support (&default_exception_support_info
))
11936 data
->exception_info
= &default_exception_support_info
;
11940 /* Try the v0 exception suport info. */
11941 if (ada_has_this_exception_support (&exception_support_info_v0
))
11943 data
->exception_info
= &exception_support_info_v0
;
11947 /* Try our fallback exception suport info. */
11948 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11950 data
->exception_info
= &exception_support_info_fallback
;
11954 /* Sometimes, it is normal for us to not be able to find the routine
11955 we are looking for. This happens when the program is linked with
11956 the shared version of the GNAT runtime, and the program has not been
11957 started yet. Inform the user of these two possible causes if
11960 if (ada_update_initial_language (language_unknown
) != language_ada
)
11961 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11963 /* If the symbol does not exist, then check that the program is
11964 already started, to make sure that shared libraries have been
11965 loaded. If it is not started, this may mean that the symbol is
11966 in a shared library. */
11968 if (inferior_ptid
.pid () == 0)
11969 error (_("Unable to insert catchpoint. Try to start the program first."));
11971 /* At this point, we know that we are debugging an Ada program and
11972 that the inferior has been started, but we still are not able to
11973 find the run-time symbols. That can mean that we are in
11974 configurable run time mode, or that a-except as been optimized
11975 out by the linker... In any case, at this point it is not worth
11976 supporting this feature. */
11978 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11981 /* True iff FRAME is very likely to be that of a function that is
11982 part of the runtime system. This is all very heuristic, but is
11983 intended to be used as advice as to what frames are uninteresting
11987 is_known_support_routine (struct frame_info
*frame
)
11989 enum language func_lang
;
11991 const char *fullname
;
11993 /* If this code does not have any debugging information (no symtab),
11994 This cannot be any user code. */
11996 symtab_and_line sal
= find_frame_sal (frame
);
11997 if (sal
.symtab
== NULL
)
12000 /* If there is a symtab, but the associated source file cannot be
12001 located, then assume this is not user code: Selecting a frame
12002 for which we cannot display the code would not be very helpful
12003 for the user. This should also take care of case such as VxWorks
12004 where the kernel has some debugging info provided for a few units. */
12006 fullname
= symtab_to_fullname (sal
.symtab
);
12007 if (access (fullname
, R_OK
) != 0)
12010 /* Check the unit filename against the Ada runtime file naming.
12011 We also check the name of the objfile against the name of some
12012 known system libraries that sometimes come with debugging info
12015 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
12017 re_comp (known_runtime_file_name_patterns
[i
]);
12018 if (re_exec (lbasename (sal
.symtab
->filename
)))
12020 if (SYMTAB_OBJFILE (sal
.symtab
) != NULL
12021 && re_exec (objfile_name (SYMTAB_OBJFILE (sal
.symtab
))))
12025 /* Check whether the function is a GNAT-generated entity. */
12027 gdb::unique_xmalloc_ptr
<char> func_name
12028 = find_frame_funname (frame
, &func_lang
, NULL
);
12029 if (func_name
== NULL
)
12032 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
12034 re_comp (known_auxiliary_function_name_patterns
[i
]);
12035 if (re_exec (func_name
.get ()))
12042 /* Find the first frame that contains debugging information and that is not
12043 part of the Ada run-time, starting from FI and moving upward. */
12046 ada_find_printable_frame (struct frame_info
*fi
)
12048 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
12050 if (!is_known_support_routine (fi
))
12059 /* Assuming that the inferior just triggered an unhandled exception
12060 catchpoint, return the address in inferior memory where the name
12061 of the exception is stored.
12063 Return zero if the address could not be computed. */
12066 ada_unhandled_exception_name_addr (void)
12068 return parse_and_eval_address ("e.full_name");
12071 /* Same as ada_unhandled_exception_name_addr, except that this function
12072 should be used when the inferior uses an older version of the runtime,
12073 where the exception name needs to be extracted from a specific frame
12074 several frames up in the callstack. */
12077 ada_unhandled_exception_name_addr_from_raise (void)
12080 struct frame_info
*fi
;
12081 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12083 /* To determine the name of this exception, we need to select
12084 the frame corresponding to RAISE_SYM_NAME. This frame is
12085 at least 3 levels up, so we simply skip the first 3 frames
12086 without checking the name of their associated function. */
12087 fi
= get_current_frame ();
12088 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
12090 fi
= get_prev_frame (fi
);
12094 enum language func_lang
;
12096 gdb::unique_xmalloc_ptr
<char> func_name
12097 = find_frame_funname (fi
, &func_lang
, NULL
);
12098 if (func_name
!= NULL
)
12100 if (strcmp (func_name
.get (),
12101 data
->exception_info
->catch_exception_sym
) == 0)
12102 break; /* We found the frame we were looking for... */
12104 fi
= get_prev_frame (fi
);
12111 return parse_and_eval_address ("id.full_name");
12114 /* Assuming the inferior just triggered an Ada exception catchpoint
12115 (of any type), return the address in inferior memory where the name
12116 of the exception is stored, if applicable.
12118 Assumes the selected frame is the current frame.
12120 Return zero if the address could not be computed, or if not relevant. */
12123 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
12124 struct breakpoint
*b
)
12126 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12130 case ada_catch_exception
:
12131 return (parse_and_eval_address ("e.full_name"));
12134 case ada_catch_exception_unhandled
:
12135 return data
->exception_info
->unhandled_exception_name_addr ();
12138 case ada_catch_handlers
:
12139 return 0; /* The runtimes does not provide access to the exception
12143 case ada_catch_assert
:
12144 return 0; /* Exception name is not relevant in this case. */
12148 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12152 return 0; /* Should never be reached. */
12155 /* Assuming the inferior is stopped at an exception catchpoint,
12156 return the message which was associated to the exception, if
12157 available. Return NULL if the message could not be retrieved.
12159 Note: The exception message can be associated to an exception
12160 either through the use of the Raise_Exception function, or
12161 more simply (Ada 2005 and later), via:
12163 raise Exception_Name with "exception message";
12167 static gdb::unique_xmalloc_ptr
<char>
12168 ada_exception_message_1 (void)
12170 struct value
*e_msg_val
;
12173 /* For runtimes that support this feature, the exception message
12174 is passed as an unbounded string argument called "message". */
12175 e_msg_val
= parse_and_eval ("message");
12176 if (e_msg_val
== NULL
)
12177 return NULL
; /* Exception message not supported. */
12179 e_msg_val
= ada_coerce_to_simple_array (e_msg_val
);
12180 gdb_assert (e_msg_val
!= NULL
);
12181 e_msg_len
= TYPE_LENGTH (value_type (e_msg_val
));
12183 /* If the message string is empty, then treat it as if there was
12184 no exception message. */
12185 if (e_msg_len
<= 0)
12188 gdb::unique_xmalloc_ptr
<char> e_msg ((char *) xmalloc (e_msg_len
+ 1));
12189 read_memory_string (value_address (e_msg_val
), e_msg
.get (), e_msg_len
+ 1);
12190 e_msg
.get ()[e_msg_len
] = '\0';
12195 /* Same as ada_exception_message_1, except that all exceptions are
12196 contained here (returning NULL instead). */
12198 static gdb::unique_xmalloc_ptr
<char>
12199 ada_exception_message (void)
12201 gdb::unique_xmalloc_ptr
<char> e_msg
;
12205 e_msg
= ada_exception_message_1 ();
12207 catch (const gdb_exception_error
&e
)
12209 e_msg
.reset (nullptr);
12215 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
12216 any error that ada_exception_name_addr_1 might cause to be thrown.
12217 When an error is intercepted, a warning with the error message is printed,
12218 and zero is returned. */
12221 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
12222 struct breakpoint
*b
)
12224 CORE_ADDR result
= 0;
12228 result
= ada_exception_name_addr_1 (ex
, b
);
12231 catch (const gdb_exception_error
&e
)
12233 warning (_("failed to get exception name: %s"), e
.what ());
12240 static std::string ada_exception_catchpoint_cond_string
12241 (const char *excep_string
,
12242 enum ada_exception_catchpoint_kind ex
);
12244 /* Ada catchpoints.
12246 In the case of catchpoints on Ada exceptions, the catchpoint will
12247 stop the target on every exception the program throws. When a user
12248 specifies the name of a specific exception, we translate this
12249 request into a condition expression (in text form), and then parse
12250 it into an expression stored in each of the catchpoint's locations.
12251 We then use this condition to check whether the exception that was
12252 raised is the one the user is interested in. If not, then the
12253 target is resumed again. We store the name of the requested
12254 exception, in order to be able to re-set the condition expression
12255 when symbols change. */
12257 /* An instance of this type is used to represent an Ada catchpoint
12258 breakpoint location. */
12260 class ada_catchpoint_location
: public bp_location
12263 ada_catchpoint_location (breakpoint
*owner
)
12264 : bp_location (owner
, bp_loc_software_breakpoint
)
12267 /* The condition that checks whether the exception that was raised
12268 is the specific exception the user specified on catchpoint
12270 expression_up excep_cond_expr
;
12273 /* An instance of this type is used to represent an Ada catchpoint. */
12275 struct ada_catchpoint
: public breakpoint
12277 explicit ada_catchpoint (enum ada_exception_catchpoint_kind kind
)
12282 /* The name of the specific exception the user specified. */
12283 std::string excep_string
;
12285 /* What kind of catchpoint this is. */
12286 enum ada_exception_catchpoint_kind m_kind
;
12289 /* Parse the exception condition string in the context of each of the
12290 catchpoint's locations, and store them for later evaluation. */
12293 create_excep_cond_exprs (struct ada_catchpoint
*c
,
12294 enum ada_exception_catchpoint_kind ex
)
12296 struct bp_location
*bl
;
12298 /* Nothing to do if there's no specific exception to catch. */
12299 if (c
->excep_string
.empty ())
12302 /* Same if there are no locations... */
12303 if (c
->loc
== NULL
)
12306 /* Compute the condition expression in text form, from the specific
12307 expection we want to catch. */
12308 std::string cond_string
12309 = ada_exception_catchpoint_cond_string (c
->excep_string
.c_str (), ex
);
12311 /* Iterate over all the catchpoint's locations, and parse an
12312 expression for each. */
12313 for (bl
= c
->loc
; bl
!= NULL
; bl
= bl
->next
)
12315 struct ada_catchpoint_location
*ada_loc
12316 = (struct ada_catchpoint_location
*) bl
;
12319 if (!bl
->shlib_disabled
)
12323 s
= cond_string
.c_str ();
12326 exp
= parse_exp_1 (&s
, bl
->address
,
12327 block_for_pc (bl
->address
),
12330 catch (const gdb_exception_error
&e
)
12332 warning (_("failed to reevaluate internal exception condition "
12333 "for catchpoint %d: %s"),
12334 c
->number
, e
.what ());
12338 ada_loc
->excep_cond_expr
= std::move (exp
);
12342 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12343 structure for all exception catchpoint kinds. */
12345 static struct bp_location
*
12346 allocate_location_exception (struct breakpoint
*self
)
12348 return new ada_catchpoint_location (self
);
12351 /* Implement the RE_SET method in the breakpoint_ops structure for all
12352 exception catchpoint kinds. */
12355 re_set_exception (struct breakpoint
*b
)
12357 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12359 /* Call the base class's method. This updates the catchpoint's
12361 bkpt_breakpoint_ops
.re_set (b
);
12363 /* Reparse the exception conditional expressions. One for each
12365 create_excep_cond_exprs (c
, c
->m_kind
);
12368 /* Returns true if we should stop for this breakpoint hit. If the
12369 user specified a specific exception, we only want to cause a stop
12370 if the program thrown that exception. */
12373 should_stop_exception (const struct bp_location
*bl
)
12375 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
12376 const struct ada_catchpoint_location
*ada_loc
12377 = (const struct ada_catchpoint_location
*) bl
;
12380 struct internalvar
*var
= lookup_internalvar ("_ada_exception");
12381 if (c
->m_kind
== ada_catch_assert
)
12382 clear_internalvar (var
);
12389 if (c
->m_kind
== ada_catch_handlers
)
12390 expr
= ("GNAT_GCC_exception_Access(gcc_exception)"
12391 ".all.occurrence.id");
12395 struct value
*exc
= parse_and_eval (expr
);
12396 set_internalvar (var
, exc
);
12398 catch (const gdb_exception_error
&ex
)
12400 clear_internalvar (var
);
12404 /* With no specific exception, should always stop. */
12405 if (c
->excep_string
.empty ())
12408 if (ada_loc
->excep_cond_expr
== NULL
)
12410 /* We will have a NULL expression if back when we were creating
12411 the expressions, this location's had failed to parse. */
12418 struct value
*mark
;
12420 mark
= value_mark ();
12421 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
.get ()));
12422 value_free_to_mark (mark
);
12424 catch (const gdb_exception
&ex
)
12426 exception_fprintf (gdb_stderr
, ex
,
12427 _("Error in testing exception condition:\n"));
12433 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
12434 for all exception catchpoint kinds. */
12437 check_status_exception (bpstat bs
)
12439 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
12442 /* Implement the PRINT_IT method in the breakpoint_ops structure
12443 for all exception catchpoint kinds. */
12445 static enum print_stop_action
12446 print_it_exception (bpstat bs
)
12448 struct ui_out
*uiout
= current_uiout
;
12449 struct breakpoint
*b
= bs
->breakpoint_at
;
12451 annotate_catchpoint (b
->number
);
12453 if (uiout
->is_mi_like_p ())
12455 uiout
->field_string ("reason",
12456 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
12457 uiout
->field_string ("disp", bpdisp_text (b
->disposition
));
12460 uiout
->text (b
->disposition
== disp_del
12461 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12462 uiout
->field_signed ("bkptno", b
->number
);
12463 uiout
->text (", ");
12465 /* ada_exception_name_addr relies on the selected frame being the
12466 current frame. Need to do this here because this function may be
12467 called more than once when printing a stop, and below, we'll
12468 select the first frame past the Ada run-time (see
12469 ada_find_printable_frame). */
12470 select_frame (get_current_frame ());
12472 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12475 case ada_catch_exception
:
12476 case ada_catch_exception_unhandled
:
12477 case ada_catch_handlers
:
12479 const CORE_ADDR addr
= ada_exception_name_addr (c
->m_kind
, b
);
12480 char exception_name
[256];
12484 read_memory (addr
, (gdb_byte
*) exception_name
,
12485 sizeof (exception_name
) - 1);
12486 exception_name
[sizeof (exception_name
) - 1] = '\0';
12490 /* For some reason, we were unable to read the exception
12491 name. This could happen if the Runtime was compiled
12492 without debugging info, for instance. In that case,
12493 just replace the exception name by the generic string
12494 "exception" - it will read as "an exception" in the
12495 notification we are about to print. */
12496 memcpy (exception_name
, "exception", sizeof ("exception"));
12498 /* In the case of unhandled exception breakpoints, we print
12499 the exception name as "unhandled EXCEPTION_NAME", to make
12500 it clearer to the user which kind of catchpoint just got
12501 hit. We used ui_out_text to make sure that this extra
12502 info does not pollute the exception name in the MI case. */
12503 if (c
->m_kind
== ada_catch_exception_unhandled
)
12504 uiout
->text ("unhandled ");
12505 uiout
->field_string ("exception-name", exception_name
);
12508 case ada_catch_assert
:
12509 /* In this case, the name of the exception is not really
12510 important. Just print "failed assertion" to make it clearer
12511 that his program just hit an assertion-failure catchpoint.
12512 We used ui_out_text because this info does not belong in
12514 uiout
->text ("failed assertion");
12518 gdb::unique_xmalloc_ptr
<char> exception_message
= ada_exception_message ();
12519 if (exception_message
!= NULL
)
12521 uiout
->text (" (");
12522 uiout
->field_string ("exception-message", exception_message
.get ());
12526 uiout
->text (" at ");
12527 ada_find_printable_frame (get_current_frame ());
12529 return PRINT_SRC_AND_LOC
;
12532 /* Implement the PRINT_ONE method in the breakpoint_ops structure
12533 for all exception catchpoint kinds. */
12536 print_one_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12538 struct ui_out
*uiout
= current_uiout
;
12539 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12540 struct value_print_options opts
;
12542 get_user_print_options (&opts
);
12544 if (opts
.addressprint
)
12545 uiout
->field_skip ("addr");
12547 annotate_field (5);
12550 case ada_catch_exception
:
12551 if (!c
->excep_string
.empty ())
12553 std::string msg
= string_printf (_("`%s' Ada exception"),
12554 c
->excep_string
.c_str ());
12556 uiout
->field_string ("what", msg
);
12559 uiout
->field_string ("what", "all Ada exceptions");
12563 case ada_catch_exception_unhandled
:
12564 uiout
->field_string ("what", "unhandled Ada exceptions");
12567 case ada_catch_handlers
:
12568 if (!c
->excep_string
.empty ())
12570 uiout
->field_fmt ("what",
12571 _("`%s' Ada exception handlers"),
12572 c
->excep_string
.c_str ());
12575 uiout
->field_string ("what", "all Ada exceptions handlers");
12578 case ada_catch_assert
:
12579 uiout
->field_string ("what", "failed Ada assertions");
12583 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12588 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
12589 for all exception catchpoint kinds. */
12592 print_mention_exception (struct breakpoint
*b
)
12594 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12595 struct ui_out
*uiout
= current_uiout
;
12597 uiout
->text (b
->disposition
== disp_del
? _("Temporary catchpoint ")
12598 : _("Catchpoint "));
12599 uiout
->field_signed ("bkptno", b
->number
);
12600 uiout
->text (": ");
12604 case ada_catch_exception
:
12605 if (!c
->excep_string
.empty ())
12607 std::string info
= string_printf (_("`%s' Ada exception"),
12608 c
->excep_string
.c_str ());
12609 uiout
->text (info
.c_str ());
12612 uiout
->text (_("all Ada exceptions"));
12615 case ada_catch_exception_unhandled
:
12616 uiout
->text (_("unhandled Ada exceptions"));
12619 case ada_catch_handlers
:
12620 if (!c
->excep_string
.empty ())
12623 = string_printf (_("`%s' Ada exception handlers"),
12624 c
->excep_string
.c_str ());
12625 uiout
->text (info
.c_str ());
12628 uiout
->text (_("all Ada exceptions handlers"));
12631 case ada_catch_assert
:
12632 uiout
->text (_("failed Ada assertions"));
12636 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12641 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12642 for all exception catchpoint kinds. */
12645 print_recreate_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12647 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
12651 case ada_catch_exception
:
12652 fprintf_filtered (fp
, "catch exception");
12653 if (!c
->excep_string
.empty ())
12654 fprintf_filtered (fp
, " %s", c
->excep_string
.c_str ());
12657 case ada_catch_exception_unhandled
:
12658 fprintf_filtered (fp
, "catch exception unhandled");
12661 case ada_catch_handlers
:
12662 fprintf_filtered (fp
, "catch handlers");
12665 case ada_catch_assert
:
12666 fprintf_filtered (fp
, "catch assert");
12670 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12672 print_recreate_thread (b
, fp
);
12675 /* Virtual tables for various breakpoint types. */
12676 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12677 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12678 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12679 static struct breakpoint_ops catch_handlers_breakpoint_ops
;
12681 /* See ada-lang.h. */
12684 is_ada_exception_catchpoint (breakpoint
*bp
)
12686 return (bp
->ops
== &catch_exception_breakpoint_ops
12687 || bp
->ops
== &catch_exception_unhandled_breakpoint_ops
12688 || bp
->ops
== &catch_assert_breakpoint_ops
12689 || bp
->ops
== &catch_handlers_breakpoint_ops
);
12692 /* Split the arguments specified in a "catch exception" command.
12693 Set EX to the appropriate catchpoint type.
12694 Set EXCEP_STRING to the name of the specific exception if
12695 specified by the user.
12696 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12697 "catch handlers" command. False otherwise.
12698 If a condition is found at the end of the arguments, the condition
12699 expression is stored in COND_STRING (memory must be deallocated
12700 after use). Otherwise COND_STRING is set to NULL. */
12703 catch_ada_exception_command_split (const char *args
,
12704 bool is_catch_handlers_cmd
,
12705 enum ada_exception_catchpoint_kind
*ex
,
12706 std::string
*excep_string
,
12707 std::string
*cond_string
)
12709 std::string exception_name
;
12711 exception_name
= extract_arg (&args
);
12712 if (exception_name
== "if")
12714 /* This is not an exception name; this is the start of a condition
12715 expression for a catchpoint on all exceptions. So, "un-get"
12716 this token, and set exception_name to NULL. */
12717 exception_name
.clear ();
12721 /* Check to see if we have a condition. */
12723 args
= skip_spaces (args
);
12724 if (startswith (args
, "if")
12725 && (isspace (args
[2]) || args
[2] == '\0'))
12728 args
= skip_spaces (args
);
12730 if (args
[0] == '\0')
12731 error (_("Condition missing after `if' keyword"));
12732 *cond_string
= args
;
12734 args
+= strlen (args
);
12737 /* Check that we do not have any more arguments. Anything else
12740 if (args
[0] != '\0')
12741 error (_("Junk at end of expression"));
12743 if (is_catch_handlers_cmd
)
12745 /* Catch handling of exceptions. */
12746 *ex
= ada_catch_handlers
;
12747 *excep_string
= exception_name
;
12749 else if (exception_name
.empty ())
12751 /* Catch all exceptions. */
12752 *ex
= ada_catch_exception
;
12753 excep_string
->clear ();
12755 else if (exception_name
== "unhandled")
12757 /* Catch unhandled exceptions. */
12758 *ex
= ada_catch_exception_unhandled
;
12759 excep_string
->clear ();
12763 /* Catch a specific exception. */
12764 *ex
= ada_catch_exception
;
12765 *excep_string
= exception_name
;
12769 /* Return the name of the symbol on which we should break in order to
12770 implement a catchpoint of the EX kind. */
12772 static const char *
12773 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12775 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12777 gdb_assert (data
->exception_info
!= NULL
);
12781 case ada_catch_exception
:
12782 return (data
->exception_info
->catch_exception_sym
);
12784 case ada_catch_exception_unhandled
:
12785 return (data
->exception_info
->catch_exception_unhandled_sym
);
12787 case ada_catch_assert
:
12788 return (data
->exception_info
->catch_assert_sym
);
12790 case ada_catch_handlers
:
12791 return (data
->exception_info
->catch_handlers_sym
);
12794 internal_error (__FILE__
, __LINE__
,
12795 _("unexpected catchpoint kind (%d)"), ex
);
12799 /* Return the breakpoint ops "virtual table" used for catchpoints
12802 static const struct breakpoint_ops
*
12803 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12807 case ada_catch_exception
:
12808 return (&catch_exception_breakpoint_ops
);
12810 case ada_catch_exception_unhandled
:
12811 return (&catch_exception_unhandled_breakpoint_ops
);
12813 case ada_catch_assert
:
12814 return (&catch_assert_breakpoint_ops
);
12816 case ada_catch_handlers
:
12817 return (&catch_handlers_breakpoint_ops
);
12820 internal_error (__FILE__
, __LINE__
,
12821 _("unexpected catchpoint kind (%d)"), ex
);
12825 /* Return the condition that will be used to match the current exception
12826 being raised with the exception that the user wants to catch. This
12827 assumes that this condition is used when the inferior just triggered
12828 an exception catchpoint.
12829 EX: the type of catchpoints used for catching Ada exceptions. */
12832 ada_exception_catchpoint_cond_string (const char *excep_string
,
12833 enum ada_exception_catchpoint_kind ex
)
12836 bool is_standard_exc
= false;
12837 std::string result
;
12839 if (ex
== ada_catch_handlers
)
12841 /* For exception handlers catchpoints, the condition string does
12842 not use the same parameter as for the other exceptions. */
12843 result
= ("long_integer (GNAT_GCC_exception_Access"
12844 "(gcc_exception).all.occurrence.id)");
12847 result
= "long_integer (e)";
12849 /* The standard exceptions are a special case. They are defined in
12850 runtime units that have been compiled without debugging info; if
12851 EXCEP_STRING is the not-fully-qualified name of a standard
12852 exception (e.g. "constraint_error") then, during the evaluation
12853 of the condition expression, the symbol lookup on this name would
12854 *not* return this standard exception. The catchpoint condition
12855 may then be set only on user-defined exceptions which have the
12856 same not-fully-qualified name (e.g. my_package.constraint_error).
12858 To avoid this unexcepted behavior, these standard exceptions are
12859 systematically prefixed by "standard". This means that "catch
12860 exception constraint_error" is rewritten into "catch exception
12861 standard.constraint_error".
12863 If an exception named constraint_error is defined in another package of
12864 the inferior program, then the only way to specify this exception as a
12865 breakpoint condition is to use its fully-qualified named:
12866 e.g. my_package.constraint_error. */
12868 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12870 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12872 is_standard_exc
= true;
12879 if (is_standard_exc
)
12880 string_appendf (result
, "long_integer (&standard.%s)", excep_string
);
12882 string_appendf (result
, "long_integer (&%s)", excep_string
);
12887 /* Return the symtab_and_line that should be used to insert an exception
12888 catchpoint of the TYPE kind.
12890 ADDR_STRING returns the name of the function where the real
12891 breakpoint that implements the catchpoints is set, depending on the
12892 type of catchpoint we need to create. */
12894 static struct symtab_and_line
12895 ada_exception_sal (enum ada_exception_catchpoint_kind ex
,
12896 std::string
*addr_string
, const struct breakpoint_ops
**ops
)
12898 const char *sym_name
;
12899 struct symbol
*sym
;
12901 /* First, find out which exception support info to use. */
12902 ada_exception_support_info_sniffer ();
12904 /* Then lookup the function on which we will break in order to catch
12905 the Ada exceptions requested by the user. */
12906 sym_name
= ada_exception_sym_name (ex
);
12907 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12910 error (_("Catchpoint symbol not found: %s"), sym_name
);
12912 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
12913 error (_("Unable to insert catchpoint. %s is not a function."), sym_name
);
12915 /* Set ADDR_STRING. */
12916 *addr_string
= sym_name
;
12919 *ops
= ada_exception_breakpoint_ops (ex
);
12921 return find_function_start_sal (sym
, 1);
12924 /* Create an Ada exception catchpoint.
12926 EX_KIND is the kind of exception catchpoint to be created.
12928 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
12929 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12930 of the exception to which this catchpoint applies.
12932 COND_STRING, if not empty, is the catchpoint condition.
12934 TEMPFLAG, if nonzero, means that the underlying breakpoint
12935 should be temporary.
12937 FROM_TTY is the usual argument passed to all commands implementations. */
12940 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12941 enum ada_exception_catchpoint_kind ex_kind
,
12942 const std::string
&excep_string
,
12943 const std::string
&cond_string
,
12948 std::string addr_string
;
12949 const struct breakpoint_ops
*ops
= NULL
;
12950 struct symtab_and_line sal
= ada_exception_sal (ex_kind
, &addr_string
, &ops
);
12952 std::unique_ptr
<ada_catchpoint
> c (new ada_catchpoint (ex_kind
));
12953 init_ada_exception_breakpoint (c
.get (), gdbarch
, sal
, addr_string
.c_str (),
12954 ops
, tempflag
, disabled
, from_tty
);
12955 c
->excep_string
= excep_string
;
12956 create_excep_cond_exprs (c
.get (), ex_kind
);
12957 if (!cond_string
.empty ())
12958 set_breakpoint_condition (c
.get (), cond_string
.c_str (), from_tty
);
12959 install_breakpoint (0, std::move (c
), 1);
12962 /* Implement the "catch exception" command. */
12965 catch_ada_exception_command (const char *arg_entry
, int from_tty
,
12966 struct cmd_list_element
*command
)
12968 const char *arg
= arg_entry
;
12969 struct gdbarch
*gdbarch
= get_current_arch ();
12971 enum ada_exception_catchpoint_kind ex_kind
;
12972 std::string excep_string
;
12973 std::string cond_string
;
12975 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12979 catch_ada_exception_command_split (arg
, false, &ex_kind
, &excep_string
,
12981 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12982 excep_string
, cond_string
,
12983 tempflag
, 1 /* enabled */,
12987 /* Implement the "catch handlers" command. */
12990 catch_ada_handlers_command (const char *arg_entry
, int from_tty
,
12991 struct cmd_list_element
*command
)
12993 const char *arg
= arg_entry
;
12994 struct gdbarch
*gdbarch
= get_current_arch ();
12996 enum ada_exception_catchpoint_kind ex_kind
;
12997 std::string excep_string
;
12998 std::string cond_string
;
13000 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13004 catch_ada_exception_command_split (arg
, true, &ex_kind
, &excep_string
,
13006 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
13007 excep_string
, cond_string
,
13008 tempflag
, 1 /* enabled */,
13012 /* Completion function for the Ada "catch" commands. */
13015 catch_ada_completer (struct cmd_list_element
*cmd
, completion_tracker
&tracker
,
13016 const char *text
, const char *word
)
13018 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (NULL
);
13020 for (const ada_exc_info
&info
: exceptions
)
13022 if (startswith (info
.name
, word
))
13023 tracker
.add_completion (make_unique_xstrdup (info
.name
));
13027 /* Split the arguments specified in a "catch assert" command.
13029 ARGS contains the command's arguments (or the empty string if
13030 no arguments were passed).
13032 If ARGS contains a condition, set COND_STRING to that condition
13033 (the memory needs to be deallocated after use). */
13036 catch_ada_assert_command_split (const char *args
, std::string
&cond_string
)
13038 args
= skip_spaces (args
);
13040 /* Check whether a condition was provided. */
13041 if (startswith (args
, "if")
13042 && (isspace (args
[2]) || args
[2] == '\0'))
13045 args
= skip_spaces (args
);
13046 if (args
[0] == '\0')
13047 error (_("condition missing after `if' keyword"));
13048 cond_string
.assign (args
);
13051 /* Otherwise, there should be no other argument at the end of
13053 else if (args
[0] != '\0')
13054 error (_("Junk at end of arguments."));
13057 /* Implement the "catch assert" command. */
13060 catch_assert_command (const char *arg_entry
, int from_tty
,
13061 struct cmd_list_element
*command
)
13063 const char *arg
= arg_entry
;
13064 struct gdbarch
*gdbarch
= get_current_arch ();
13066 std::string cond_string
;
13068 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
13072 catch_ada_assert_command_split (arg
, cond_string
);
13073 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
13075 tempflag
, 1 /* enabled */,
13079 /* Return non-zero if the symbol SYM is an Ada exception object. */
13082 ada_is_exception_sym (struct symbol
*sym
)
13084 const char *type_name
= SYMBOL_TYPE (sym
)->name ();
13086 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
13087 && SYMBOL_CLASS (sym
) != LOC_BLOCK
13088 && SYMBOL_CLASS (sym
) != LOC_CONST
13089 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
13090 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
13093 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13094 Ada exception object. This matches all exceptions except the ones
13095 defined by the Ada language. */
13098 ada_is_non_standard_exception_sym (struct symbol
*sym
)
13102 if (!ada_is_exception_sym (sym
))
13105 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13106 if (strcmp (sym
->linkage_name (), standard_exc
[i
]) == 0)
13107 return 0; /* A standard exception. */
13109 /* Numeric_Error is also a standard exception, so exclude it.
13110 See the STANDARD_EXC description for more details as to why
13111 this exception is not listed in that array. */
13112 if (strcmp (sym
->linkage_name (), "numeric_error") == 0)
13118 /* A helper function for std::sort, comparing two struct ada_exc_info
13121 The comparison is determined first by exception name, and then
13122 by exception address. */
13125 ada_exc_info::operator< (const ada_exc_info
&other
) const
13129 result
= strcmp (name
, other
.name
);
13132 if (result
== 0 && addr
< other
.addr
)
13138 ada_exc_info::operator== (const ada_exc_info
&other
) const
13140 return addr
== other
.addr
&& strcmp (name
, other
.name
) == 0;
13143 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13144 routine, but keeping the first SKIP elements untouched.
13146 All duplicates are also removed. */
13149 sort_remove_dups_ada_exceptions_list (std::vector
<ada_exc_info
> *exceptions
,
13152 std::sort (exceptions
->begin () + skip
, exceptions
->end ());
13153 exceptions
->erase (std::unique (exceptions
->begin () + skip
, exceptions
->end ()),
13154 exceptions
->end ());
13157 /* Add all exceptions defined by the Ada standard whose name match
13158 a regular expression.
13160 If PREG is not NULL, then this regexp_t object is used to
13161 perform the symbol name matching. Otherwise, no name-based
13162 filtering is performed.
13164 EXCEPTIONS is a vector of exceptions to which matching exceptions
13168 ada_add_standard_exceptions (compiled_regex
*preg
,
13169 std::vector
<ada_exc_info
> *exceptions
)
13173 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
13176 || preg
->exec (standard_exc
[i
], 0, NULL
, 0) == 0)
13178 struct bound_minimal_symbol msymbol
13179 = ada_lookup_simple_minsym (standard_exc
[i
]);
13181 if (msymbol
.minsym
!= NULL
)
13183 struct ada_exc_info info
13184 = {standard_exc
[i
], BMSYMBOL_VALUE_ADDRESS (msymbol
)};
13186 exceptions
->push_back (info
);
13192 /* Add all Ada exceptions defined locally and accessible from the given
13195 If PREG is not NULL, then this regexp_t object is used to
13196 perform the symbol name matching. Otherwise, no name-based
13197 filtering is performed.
13199 EXCEPTIONS is a vector of exceptions to which matching exceptions
13203 ada_add_exceptions_from_frame (compiled_regex
*preg
,
13204 struct frame_info
*frame
,
13205 std::vector
<ada_exc_info
> *exceptions
)
13207 const struct block
*block
= get_frame_block (frame
, 0);
13211 struct block_iterator iter
;
13212 struct symbol
*sym
;
13214 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
13216 switch (SYMBOL_CLASS (sym
))
13223 if (ada_is_exception_sym (sym
))
13225 struct ada_exc_info info
= {sym
->print_name (),
13226 SYMBOL_VALUE_ADDRESS (sym
)};
13228 exceptions
->push_back (info
);
13232 if (BLOCK_FUNCTION (block
) != NULL
)
13234 block
= BLOCK_SUPERBLOCK (block
);
13238 /* Return true if NAME matches PREG or if PREG is NULL. */
13241 name_matches_regex (const char *name
, compiled_regex
*preg
)
13243 return (preg
== NULL
13244 || preg
->exec (ada_decode (name
).c_str (), 0, NULL
, 0) == 0);
13247 /* Add all exceptions defined globally whose name name match
13248 a regular expression, excluding standard exceptions.
13250 The reason we exclude standard exceptions is that they need
13251 to be handled separately: Standard exceptions are defined inside
13252 a runtime unit which is normally not compiled with debugging info,
13253 and thus usually do not show up in our symbol search. However,
13254 if the unit was in fact built with debugging info, we need to
13255 exclude them because they would duplicate the entry we found
13256 during the special loop that specifically searches for those
13257 standard exceptions.
13259 If PREG is not NULL, then this regexp_t object is used to
13260 perform the symbol name matching. Otherwise, no name-based
13261 filtering is performed.
13263 EXCEPTIONS is a vector of exceptions to which matching exceptions
13267 ada_add_global_exceptions (compiled_regex
*preg
,
13268 std::vector
<ada_exc_info
> *exceptions
)
13270 /* In Ada, the symbol "search name" is a linkage name, whereas the
13271 regular expression used to do the matching refers to the natural
13272 name. So match against the decoded name. */
13273 expand_symtabs_matching (NULL
,
13274 lookup_name_info::match_any (),
13275 [&] (const char *search_name
)
13277 std::string decoded
= ada_decode (search_name
);
13278 return name_matches_regex (decoded
.c_str (), preg
);
13283 for (objfile
*objfile
: current_program_space
->objfiles ())
13285 for (compunit_symtab
*s
: objfile
->compunits ())
13287 const struct blockvector
*bv
= COMPUNIT_BLOCKVECTOR (s
);
13290 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
13292 const struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
13293 struct block_iterator iter
;
13294 struct symbol
*sym
;
13296 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
13297 if (ada_is_non_standard_exception_sym (sym
)
13298 && name_matches_regex (sym
->natural_name (), preg
))
13300 struct ada_exc_info info
13301 = {sym
->print_name (), SYMBOL_VALUE_ADDRESS (sym
)};
13303 exceptions
->push_back (info
);
13310 /* Implements ada_exceptions_list with the regular expression passed
13311 as a regex_t, rather than a string.
13313 If not NULL, PREG is used to filter out exceptions whose names
13314 do not match. Otherwise, all exceptions are listed. */
13316 static std::vector
<ada_exc_info
>
13317 ada_exceptions_list_1 (compiled_regex
*preg
)
13319 std::vector
<ada_exc_info
> result
;
13322 /* First, list the known standard exceptions. These exceptions
13323 need to be handled separately, as they are usually defined in
13324 runtime units that have been compiled without debugging info. */
13326 ada_add_standard_exceptions (preg
, &result
);
13328 /* Next, find all exceptions whose scope is local and accessible
13329 from the currently selected frame. */
13331 if (has_stack_frames ())
13333 prev_len
= result
.size ();
13334 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
13336 if (result
.size () > prev_len
)
13337 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13340 /* Add all exceptions whose scope is global. */
13342 prev_len
= result
.size ();
13343 ada_add_global_exceptions (preg
, &result
);
13344 if (result
.size () > prev_len
)
13345 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
13350 /* Return a vector of ada_exc_info.
13352 If REGEXP is NULL, all exceptions are included in the result.
13353 Otherwise, it should contain a valid regular expression,
13354 and only the exceptions whose names match that regular expression
13355 are included in the result.
13357 The exceptions are sorted in the following order:
13358 - Standard exceptions (defined by the Ada language), in
13359 alphabetical order;
13360 - Exceptions only visible from the current frame, in
13361 alphabetical order;
13362 - Exceptions whose scope is global, in alphabetical order. */
13364 std::vector
<ada_exc_info
>
13365 ada_exceptions_list (const char *regexp
)
13367 if (regexp
== NULL
)
13368 return ada_exceptions_list_1 (NULL
);
13370 compiled_regex
reg (regexp
, REG_NOSUB
, _("invalid regular expression"));
13371 return ada_exceptions_list_1 (®
);
13374 /* Implement the "info exceptions" command. */
13377 info_exceptions_command (const char *regexp
, int from_tty
)
13379 struct gdbarch
*gdbarch
= get_current_arch ();
13381 std::vector
<ada_exc_info
> exceptions
= ada_exceptions_list (regexp
);
13383 if (regexp
!= NULL
)
13385 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
13387 printf_filtered (_("All defined Ada exceptions:\n"));
13389 for (const ada_exc_info
&info
: exceptions
)
13390 printf_filtered ("%s: %s\n", info
.name
, paddress (gdbarch
, info
.addr
));
13394 /* Information about operators given special treatment in functions
13396 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13398 #define ADA_OPERATORS \
13399 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13400 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13401 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13402 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13403 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13404 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13405 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13406 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13407 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13408 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13409 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13410 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13411 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13412 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13413 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
13414 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13415 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13416 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13417 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
13420 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
13423 switch (exp
->elts
[pc
- 1].opcode
)
13426 operator_length_standard (exp
, pc
, oplenp
, argsp
);
13429 #define OP_DEFN(op, len, args, binop) \
13430 case op: *oplenp = len; *argsp = args; break;
13436 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
13441 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
13446 /* Implementation of the exp_descriptor method operator_check. */
13449 ada_operator_check (struct expression
*exp
, int pos
,
13450 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
13453 const union exp_element
*const elts
= exp
->elts
;
13454 struct type
*type
= NULL
;
13456 switch (elts
[pos
].opcode
)
13458 case UNOP_IN_RANGE
:
13460 type
= elts
[pos
+ 1].type
;
13464 return operator_check_standard (exp
, pos
, objfile_func
, data
);
13467 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13469 if (type
&& TYPE_OBJFILE (type
)
13470 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
13476 static const char *
13477 ada_op_name (enum exp_opcode opcode
)
13482 return op_name_standard (opcode
);
13484 #define OP_DEFN(op, len, args, binop) case op: return #op;
13489 return "OP_AGGREGATE";
13491 return "OP_CHOICES";
13497 /* As for operator_length, but assumes PC is pointing at the first
13498 element of the operator, and gives meaningful results only for the
13499 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
13502 ada_forward_operator_length (struct expression
*exp
, int pc
,
13503 int *oplenp
, int *argsp
)
13505 switch (exp
->elts
[pc
].opcode
)
13508 *oplenp
= *argsp
= 0;
13511 #define OP_DEFN(op, len, args, binop) \
13512 case op: *oplenp = len; *argsp = args; break;
13518 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13523 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13529 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13531 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13539 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13541 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13546 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13550 /* Ada attributes ('Foo). */
13553 case OP_ATR_LENGTH
:
13557 case OP_ATR_MODULUS
:
13564 case UNOP_IN_RANGE
:
13566 /* XXX: gdb_sprint_host_address, type_sprint */
13567 fprintf_filtered (stream
, _("Type @"));
13568 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13569 fprintf_filtered (stream
, " (");
13570 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13571 fprintf_filtered (stream
, ")");
13573 case BINOP_IN_BOUNDS
:
13574 fprintf_filtered (stream
, " (%d)",
13575 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13577 case TERNOP_IN_RANGE
:
13582 case OP_DISCRETE_RANGE
:
13583 case OP_POSITIONAL
:
13590 char *name
= &exp
->elts
[elt
+ 2].string
;
13591 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13593 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13598 return dump_subexp_body_standard (exp
, stream
, elt
);
13602 for (i
= 0; i
< nargs
; i
+= 1)
13603 elt
= dump_subexp (exp
, stream
, elt
);
13608 /* The Ada extension of print_subexp (q.v.). */
13611 ada_print_subexp (struct expression
*exp
, int *pos
,
13612 struct ui_file
*stream
, enum precedence prec
)
13614 int oplen
, nargs
, i
;
13616 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13618 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13625 print_subexp_standard (exp
, pos
, stream
, prec
);
13629 fputs_filtered (exp
->elts
[pc
+ 2].symbol
->natural_name (), stream
);
13632 case BINOP_IN_BOUNDS
:
13633 /* XXX: sprint_subexp */
13634 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13635 fputs_filtered (" in ", stream
);
13636 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13637 fputs_filtered ("'range", stream
);
13638 if (exp
->elts
[pc
+ 1].longconst
> 1)
13639 fprintf_filtered (stream
, "(%ld)",
13640 (long) exp
->elts
[pc
+ 1].longconst
);
13643 case TERNOP_IN_RANGE
:
13644 if (prec
>= PREC_EQUAL
)
13645 fputs_filtered ("(", stream
);
13646 /* XXX: sprint_subexp */
13647 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13648 fputs_filtered (" in ", stream
);
13649 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13650 fputs_filtered (" .. ", stream
);
13651 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13652 if (prec
>= PREC_EQUAL
)
13653 fputs_filtered (")", stream
);
13658 case OP_ATR_LENGTH
:
13662 case OP_ATR_MODULUS
:
13667 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13669 if (exp
->elts
[*pos
+ 1].type
->code () != TYPE_CODE_VOID
)
13670 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13671 &type_print_raw_options
);
13675 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13676 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13681 for (tem
= 1; tem
< nargs
; tem
+= 1)
13683 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13684 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13686 fputs_filtered (")", stream
);
13691 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13692 fputs_filtered ("'(", stream
);
13693 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13694 fputs_filtered (")", stream
);
13697 case UNOP_IN_RANGE
:
13698 /* XXX: sprint_subexp */
13699 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13700 fputs_filtered (" in ", stream
);
13701 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13702 &type_print_raw_options
);
13705 case OP_DISCRETE_RANGE
:
13706 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13707 fputs_filtered ("..", stream
);
13708 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13712 fputs_filtered ("others => ", stream
);
13713 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13717 for (i
= 0; i
< nargs
-1; i
+= 1)
13720 fputs_filtered ("|", stream
);
13721 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13723 fputs_filtered (" => ", stream
);
13724 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13727 case OP_POSITIONAL
:
13728 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13732 fputs_filtered ("(", stream
);
13733 for (i
= 0; i
< nargs
; i
+= 1)
13736 fputs_filtered (", ", stream
);
13737 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13739 fputs_filtered (")", stream
);
13744 /* Table mapping opcodes into strings for printing operators
13745 and precedences of the operators. */
13747 static const struct op_print ada_op_print_tab
[] = {
13748 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13749 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13750 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13751 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13752 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13753 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13754 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13755 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13756 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13757 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13758 {">", BINOP_GTR
, PREC_ORDER
, 0},
13759 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13760 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13761 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13762 {"+", BINOP_ADD
, PREC_ADD
, 0},
13763 {"-", BINOP_SUB
, PREC_ADD
, 0},
13764 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13765 {"*", BINOP_MUL
, PREC_MUL
, 0},
13766 {"/", BINOP_DIV
, PREC_MUL
, 0},
13767 {"rem", BINOP_REM
, PREC_MUL
, 0},
13768 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13769 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13770 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13771 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13772 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13773 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13774 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13775 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13776 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13777 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13778 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13779 {NULL
, OP_NULL
, PREC_SUFFIX
, 0}
13782 enum ada_primitive_types
{
13783 ada_primitive_type_int
,
13784 ada_primitive_type_long
,
13785 ada_primitive_type_short
,
13786 ada_primitive_type_char
,
13787 ada_primitive_type_float
,
13788 ada_primitive_type_double
,
13789 ada_primitive_type_void
,
13790 ada_primitive_type_long_long
,
13791 ada_primitive_type_long_double
,
13792 ada_primitive_type_natural
,
13793 ada_primitive_type_positive
,
13794 ada_primitive_type_system_address
,
13795 ada_primitive_type_storage_offset
,
13796 nr_ada_primitive_types
13800 ada_language_arch_info (struct gdbarch
*gdbarch
,
13801 struct language_arch_info
*lai
)
13803 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13805 lai
->primitive_type_vector
13806 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13809 lai
->primitive_type_vector
[ada_primitive_type_int
]
13810 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13812 lai
->primitive_type_vector
[ada_primitive_type_long
]
13813 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13814 0, "long_integer");
13815 lai
->primitive_type_vector
[ada_primitive_type_short
]
13816 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13817 0, "short_integer");
13818 lai
->string_char_type
13819 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13820 = arch_character_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13821 lai
->primitive_type_vector
[ada_primitive_type_float
]
13822 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13823 "float", gdbarch_float_format (gdbarch
));
13824 lai
->primitive_type_vector
[ada_primitive_type_double
]
13825 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13826 "long_float", gdbarch_double_format (gdbarch
));
13827 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13828 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13829 0, "long_long_integer");
13830 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13831 = arch_float_type (gdbarch
, gdbarch_long_double_bit (gdbarch
),
13832 "long_long_float", gdbarch_long_double_format (gdbarch
));
13833 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13834 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13836 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13837 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13839 lai
->primitive_type_vector
[ada_primitive_type_void
]
13840 = builtin
->builtin_void
;
13842 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13843 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, TARGET_CHAR_BIT
,
13845 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13846 ->set_name ("system__address");
13848 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
13849 type. This is a signed integral type whose size is the same as
13850 the size of addresses. */
13852 unsigned int addr_length
= TYPE_LENGTH
13853 (lai
->primitive_type_vector
[ada_primitive_type_system_address
]);
13855 lai
->primitive_type_vector
[ada_primitive_type_storage_offset
]
13856 = arch_integer_type (gdbarch
, addr_length
* HOST_CHAR_BIT
, 0,
13860 lai
->bool_type_symbol
= NULL
;
13861 lai
->bool_type_default
= builtin
->builtin_bool
;
13864 /* Language vector */
13866 /* Not really used, but needed in the ada_language_defn. */
13869 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13871 ada_emit_char (c
, type
, stream
, quoter
, 1);
13875 parse (struct parser_state
*ps
)
13877 warnings_issued
= 0;
13878 return ada_parse (ps
);
13881 static const struct exp_descriptor ada_exp_descriptor
= {
13883 ada_operator_length
,
13884 ada_operator_check
,
13886 ada_dump_subexp_body
,
13887 ada_evaluate_subexp
13890 /* symbol_name_matcher_ftype adapter for wild_match. */
13893 do_wild_match (const char *symbol_search_name
,
13894 const lookup_name_info
&lookup_name
,
13895 completion_match_result
*comp_match_res
)
13897 return wild_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13900 /* symbol_name_matcher_ftype adapter for full_match. */
13903 do_full_match (const char *symbol_search_name
,
13904 const lookup_name_info
&lookup_name
,
13905 completion_match_result
*comp_match_res
)
13907 return full_match (symbol_search_name
, ada_lookup_name (lookup_name
));
13910 /* symbol_name_matcher_ftype for exact (verbatim) matches. */
13913 do_exact_match (const char *symbol_search_name
,
13914 const lookup_name_info
&lookup_name
,
13915 completion_match_result
*comp_match_res
)
13917 return strcmp (symbol_search_name
, ada_lookup_name (lookup_name
)) == 0;
13920 /* Build the Ada lookup name for LOOKUP_NAME. */
13922 ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info
&lookup_name
)
13924 gdb::string_view user_name
= lookup_name
.name ();
13926 if (user_name
[0] == '<')
13928 if (user_name
.back () == '>')
13930 = user_name
.substr (1, user_name
.size () - 2).to_string ();
13933 = user_name
.substr (1, user_name
.size () - 1).to_string ();
13934 m_encoded_p
= true;
13935 m_verbatim_p
= true;
13936 m_wild_match_p
= false;
13937 m_standard_p
= false;
13941 m_verbatim_p
= false;
13943 m_encoded_p
= user_name
.find ("__") != gdb::string_view::npos
;
13947 const char *folded
= ada_fold_name (user_name
);
13948 const char *encoded
= ada_encode_1 (folded
, false);
13949 if (encoded
!= NULL
)
13950 m_encoded_name
= encoded
;
13952 m_encoded_name
= user_name
.to_string ();
13955 m_encoded_name
= user_name
.to_string ();
13957 /* Handle the 'package Standard' special case. See description
13958 of m_standard_p. */
13959 if (startswith (m_encoded_name
.c_str (), "standard__"))
13961 m_encoded_name
= m_encoded_name
.substr (sizeof ("standard__") - 1);
13962 m_standard_p
= true;
13965 m_standard_p
= false;
13967 /* If the name contains a ".", then the user is entering a fully
13968 qualified entity name, and the match must not be done in wild
13969 mode. Similarly, if the user wants to complete what looks
13970 like an encoded name, the match must not be done in wild
13971 mode. Also, in the standard__ special case always do
13972 non-wild matching. */
13974 = (lookup_name
.match_type () != symbol_name_match_type::FULL
13977 && user_name
.find ('.') == std::string::npos
);
13981 /* symbol_name_matcher_ftype method for Ada. This only handles
13982 completion mode. */
13985 ada_symbol_name_matches (const char *symbol_search_name
,
13986 const lookup_name_info
&lookup_name
,
13987 completion_match_result
*comp_match_res
)
13989 return lookup_name
.ada ().matches (symbol_search_name
,
13990 lookup_name
.match_type (),
13994 /* A name matcher that matches the symbol name exactly, with
13998 literal_symbol_name_matcher (const char *symbol_search_name
,
13999 const lookup_name_info
&lookup_name
,
14000 completion_match_result
*comp_match_res
)
14002 gdb::string_view name_view
= lookup_name
.name ();
14004 if (lookup_name
.completion_mode ()
14005 ? (strncmp (symbol_search_name
, name_view
.data (),
14006 name_view
.size ()) == 0)
14007 : symbol_search_name
== name_view
)
14009 if (comp_match_res
!= NULL
)
14010 comp_match_res
->set_match (symbol_search_name
);
14017 /* Implement the "la_get_symbol_name_matcher" language_defn method for
14020 static symbol_name_matcher_ftype
*
14021 ada_get_symbol_name_matcher (const lookup_name_info
&lookup_name
)
14023 if (lookup_name
.match_type () == symbol_name_match_type::SEARCH_NAME
)
14024 return literal_symbol_name_matcher
;
14026 if (lookup_name
.completion_mode ())
14027 return ada_symbol_name_matches
;
14030 if (lookup_name
.ada ().wild_match_p ())
14031 return do_wild_match
;
14032 else if (lookup_name
.ada ().verbatim_p ())
14033 return do_exact_match
;
14035 return do_full_match
;
14039 /* Implement the "la_read_var_value" language_defn method for Ada. */
14041 static struct value
*
14042 ada_read_var_value (struct symbol
*var
, const struct block
*var_block
,
14043 struct frame_info
*frame
)
14045 /* The only case where default_read_var_value is not sufficient
14046 is when VAR is a renaming... */
14047 if (frame
!= nullptr)
14049 const struct block
*frame_block
= get_frame_block (frame
, NULL
);
14050 if (frame_block
!= nullptr && ada_is_renaming_symbol (var
))
14051 return ada_read_renaming_var_value (var
, frame_block
);
14054 /* This is a typical case where we expect the default_read_var_value
14055 function to work. */
14056 return default_read_var_value (var
, var_block
, frame
);
14059 static const char *ada_extensions
[] =
14061 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14064 /* Constant data that describes the Ada language. */
14066 extern const struct language_data ada_language_data
=
14068 "ada", /* Language name */
14072 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
14073 that's not quite what this means. */
14075 macro_expansion_no
,
14077 &ada_exp_descriptor
,
14080 ada_printchar
, /* Print a character constant */
14081 ada_printstr
, /* Function to print string constant */
14082 emit_char
, /* Function to print single char (not used) */
14083 ada_print_type
, /* Print a type using appropriate syntax */
14084 ada_print_typedef
, /* Print a typedef using appropriate syntax */
14085 ada_value_print_inner
, /* la_value_print_inner */
14086 ada_value_print
, /* Print a top-level value */
14087 ada_read_var_value
, /* la_read_var_value */
14088 NULL
, /* Language specific skip_trampoline */
14089 NULL
, /* name_of_this */
14090 true, /* la_store_sym_names_in_linkage_form_p */
14091 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
14092 basic_lookup_transparent_type
, /* lookup_transparent_type */
14093 ada_la_decode
, /* Language specific symbol demangler */
14094 ada_sniff_from_mangled_name
,
14095 NULL
, /* Language specific
14096 class_name_from_physname */
14097 ada_op_print_tab
, /* expression operators for printing */
14098 0, /* c-style arrays */
14099 1, /* String lower bound */
14100 ada_get_gdb_completer_word_break_characters
,
14101 ada_collect_symbol_completion_matches
,
14102 ada_language_arch_info
,
14103 ada_print_array_index
,
14104 default_pass_by_reference
,
14105 ada_watch_location_expression
,
14106 ada_get_symbol_name_matcher
, /* la_get_symbol_name_matcher */
14107 ada_iterate_over_symbols
,
14108 default_search_name_hash
,
14112 ada_is_string_type
,
14113 "(...)" /* la_struct_too_deep_ellipsis */
14116 /* Class representing the Ada language. */
14118 class ada_language
: public language_defn
14122 : language_defn (language_ada
, ada_language_data
)
14126 /* Single instance of the Ada language class. */
14128 static ada_language ada_language_defn
;
14130 /* Command-list for the "set/show ada" prefix command. */
14131 static struct cmd_list_element
*set_ada_list
;
14132 static struct cmd_list_element
*show_ada_list
;
14135 initialize_ada_catchpoint_ops (void)
14137 struct breakpoint_ops
*ops
;
14139 initialize_breakpoint_ops ();
14141 ops
= &catch_exception_breakpoint_ops
;
14142 *ops
= bkpt_breakpoint_ops
;
14143 ops
->allocate_location
= allocate_location_exception
;
14144 ops
->re_set
= re_set_exception
;
14145 ops
->check_status
= check_status_exception
;
14146 ops
->print_it
= print_it_exception
;
14147 ops
->print_one
= print_one_exception
;
14148 ops
->print_mention
= print_mention_exception
;
14149 ops
->print_recreate
= print_recreate_exception
;
14151 ops
= &catch_exception_unhandled_breakpoint_ops
;
14152 *ops
= bkpt_breakpoint_ops
;
14153 ops
->allocate_location
= allocate_location_exception
;
14154 ops
->re_set
= re_set_exception
;
14155 ops
->check_status
= check_status_exception
;
14156 ops
->print_it
= print_it_exception
;
14157 ops
->print_one
= print_one_exception
;
14158 ops
->print_mention
= print_mention_exception
;
14159 ops
->print_recreate
= print_recreate_exception
;
14161 ops
= &catch_assert_breakpoint_ops
;
14162 *ops
= bkpt_breakpoint_ops
;
14163 ops
->allocate_location
= allocate_location_exception
;
14164 ops
->re_set
= re_set_exception
;
14165 ops
->check_status
= check_status_exception
;
14166 ops
->print_it
= print_it_exception
;
14167 ops
->print_one
= print_one_exception
;
14168 ops
->print_mention
= print_mention_exception
;
14169 ops
->print_recreate
= print_recreate_exception
;
14171 ops
= &catch_handlers_breakpoint_ops
;
14172 *ops
= bkpt_breakpoint_ops
;
14173 ops
->allocate_location
= allocate_location_exception
;
14174 ops
->re_set
= re_set_exception
;
14175 ops
->check_status
= check_status_exception
;
14176 ops
->print_it
= print_it_exception
;
14177 ops
->print_one
= print_one_exception
;
14178 ops
->print_mention
= print_mention_exception
;
14179 ops
->print_recreate
= print_recreate_exception
;
14182 /* This module's 'new_objfile' observer. */
14185 ada_new_objfile_observer (struct objfile
*objfile
)
14187 ada_clear_symbol_cache ();
14190 /* This module's 'free_objfile' observer. */
14193 ada_free_objfile_observer (struct objfile
*objfile
)
14195 ada_clear_symbol_cache ();
14198 void _initialize_ada_language ();
14200 _initialize_ada_language ()
14202 initialize_ada_catchpoint_ops ();
14204 add_basic_prefix_cmd ("ada", no_class
,
14205 _("Prefix command for changing Ada-specific settings."),
14206 &set_ada_list
, "set ada ", 0, &setlist
);
14208 add_show_prefix_cmd ("ada", no_class
,
14209 _("Generic command for showing Ada-specific settings."),
14210 &show_ada_list
, "show ada ", 0, &showlist
);
14212 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
14213 &trust_pad_over_xvs
, _("\
14214 Enable or disable an optimization trusting PAD types over XVS types."), _("\
14215 Show whether an optimization trusting PAD types over XVS types is activated."),
14217 This is related to the encoding used by the GNAT compiler. The debugger\n\
14218 should normally trust the contents of PAD types, but certain older versions\n\
14219 of GNAT have a bug that sometimes causes the information in the PAD type\n\
14220 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14221 work around this bug. It is always safe to turn this option \"off\", but\n\
14222 this incurs a slight performance penalty, so it is recommended to NOT change\n\
14223 this option to \"off\" unless necessary."),
14224 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14226 add_setshow_boolean_cmd ("print-signatures", class_vars
,
14227 &print_signatures
, _("\
14228 Enable or disable the output of formal and return types for functions in the \
14229 overloads selection menu."), _("\
14230 Show whether the output of formal and return types for functions in the \
14231 overloads selection menu is activated."),
14232 NULL
, NULL
, NULL
, &set_ada_list
, &show_ada_list
);
14234 add_catch_command ("exception", _("\
14235 Catch Ada exceptions, when raised.\n\
14236 Usage: catch exception [ARG] [if CONDITION]\n\
14237 Without any argument, stop when any Ada exception is raised.\n\
14238 If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14239 being raised does not have a handler (and will therefore lead to the task's\n\
14241 Otherwise, the catchpoint only stops when the name of the exception being\n\
14242 raised is the same as ARG.\n\
14243 CONDITION is a boolean expression that is evaluated to see whether the\n\
14244 exception should cause a stop."),
14245 catch_ada_exception_command
,
14246 catch_ada_completer
,
14250 add_catch_command ("handlers", _("\
14251 Catch Ada exceptions, when handled.\n\
14252 Usage: catch handlers [ARG] [if CONDITION]\n\
14253 Without any argument, stop when any Ada exception is handled.\n\
14254 With an argument, catch only exceptions with the given name.\n\
14255 CONDITION is a boolean expression that is evaluated to see whether the\n\
14256 exception should cause a stop."),
14257 catch_ada_handlers_command
,
14258 catch_ada_completer
,
14261 add_catch_command ("assert", _("\
14262 Catch failed Ada assertions, when raised.\n\
14263 Usage: catch assert [if CONDITION]\n\
14264 CONDITION is a boolean expression that is evaluated to see whether the\n\
14265 exception should cause a stop."),
14266 catch_assert_command
,
14271 varsize_limit
= 65536;
14272 add_setshow_uinteger_cmd ("varsize-limit", class_support
,
14273 &varsize_limit
, _("\
14274 Set the maximum number of bytes allowed in a variable-size object."), _("\
14275 Show the maximum number of bytes allowed in a variable-size object."), _("\
14276 Attempts to access an object whose size is not a compile-time constant\n\
14277 and exceeds this limit will cause an error."),
14278 NULL
, NULL
, &setlist
, &showlist
);
14280 add_info ("exceptions", info_exceptions_command
,
14282 List all Ada exception names.\n\
14283 Usage: info exceptions [REGEXP]\n\
14284 If a regular expression is passed as an argument, only those matching\n\
14285 the regular expression are listed."));
14287 add_basic_prefix_cmd ("ada", class_maintenance
,
14288 _("Set Ada maintenance-related variables."),
14289 &maint_set_ada_cmdlist
, "maintenance set ada ",
14290 0/*allow-unknown*/, &maintenance_set_cmdlist
);
14292 add_show_prefix_cmd ("ada", class_maintenance
,
14293 _("Show Ada maintenance-related variables."),
14294 &maint_show_ada_cmdlist
, "maintenance show ada ",
14295 0/*allow-unknown*/, &maintenance_show_cmdlist
);
14297 add_setshow_boolean_cmd
14298 ("ignore-descriptive-types", class_maintenance
,
14299 &ada_ignore_descriptive_types_p
,
14300 _("Set whether descriptive types generated by GNAT should be ignored."),
14301 _("Show whether descriptive types generated by GNAT should be ignored."),
14303 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14304 DWARF attribute."),
14305 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
14307 decoded_names_store
= htab_create_alloc (256, htab_hash_string
, streq_hash
,
14308 NULL
, xcalloc
, xfree
);
14310 /* The ada-lang observers. */
14311 gdb::observers::new_objfile
.attach (ada_new_objfile_observer
);
14312 gdb::observers::free_objfile
.attach (ada_free_objfile_observer
);
14313 gdb::observers::inferior_exit
.attach (ada_inferior_exit
);