1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-2014 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
27 #include "gdb_regex.h"
32 #include "expression.h"
33 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
50 #include "dictionary.h"
51 #include "exceptions.h"
59 #include "typeprint.h"
63 #include "mi/mi-common.h"
64 #include "arch-utils.h"
65 #include "cli/cli-utils.h"
67 /* Define whether or not the C operator '/' truncates towards zero for
68 differently signed operands (truncation direction is undefined in C).
69 Copied from valarith.c. */
71 #ifndef TRUNCATION_TOWARDS_ZERO
72 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75 static struct type
*desc_base_type (struct type
*);
77 static struct type
*desc_bounds_type (struct type
*);
79 static struct value
*desc_bounds (struct value
*);
81 static int fat_pntr_bounds_bitpos (struct type
*);
83 static int fat_pntr_bounds_bitsize (struct type
*);
85 static struct type
*desc_data_target_type (struct type
*);
87 static struct value
*desc_data (struct value
*);
89 static int fat_pntr_data_bitpos (struct type
*);
91 static int fat_pntr_data_bitsize (struct type
*);
93 static struct value
*desc_one_bound (struct value
*, int, int);
95 static int desc_bound_bitpos (struct type
*, int, int);
97 static int desc_bound_bitsize (struct type
*, int, int);
99 static struct type
*desc_index_type (struct type
*, int);
101 static int desc_arity (struct type
*);
103 static int ada_type_match (struct type
*, struct type
*, int);
105 static int ada_args_match (struct symbol
*, struct value
**, int);
107 static int full_match (const char *, const char *);
109 static struct value
*make_array_descriptor (struct type
*, struct value
*);
111 static void ada_add_block_symbols (struct obstack
*,
112 const struct block
*, const char *,
113 domain_enum
, struct objfile
*, int);
115 static int is_nonfunction (struct ada_symbol_info
*, int);
117 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
118 const struct block
*);
120 static int num_defns_collected (struct obstack
*);
122 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
124 static struct value
*resolve_subexp (struct expression
**, int *, int,
127 static void replace_operator_with_call (struct expression
**, int, int, int,
128 struct symbol
*, const struct block
*);
130 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
132 static char *ada_op_name (enum exp_opcode
);
134 static const char *ada_decoded_op_name (enum exp_opcode
);
136 static int numeric_type_p (struct type
*);
138 static int integer_type_p (struct type
*);
140 static int scalar_type_p (struct type
*);
142 static int discrete_type_p (struct type
*);
144 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
149 static struct symbol
*find_old_style_renaming_symbol (const char *,
150 const struct block
*);
152 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
155 static struct value
*evaluate_subexp_type (struct expression
*, int *);
157 static struct type
*ada_find_parallel_type_with_name (struct type
*,
160 static int is_dynamic_field (struct type
*, int);
162 static struct type
*to_fixed_variant_branch_type (struct type
*,
164 CORE_ADDR
, struct value
*);
166 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
168 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
170 static struct type
*to_static_fixed_type (struct type
*);
171 static struct type
*static_unwrap_type (struct type
*type
);
173 static struct value
*unwrap_value (struct value
*);
175 static struct type
*constrained_packed_array_type (struct type
*, long *);
177 static struct type
*decode_constrained_packed_array_type (struct type
*);
179 static long decode_packed_array_bitsize (struct type
*);
181 static struct value
*decode_constrained_packed_array (struct value
*);
183 static int ada_is_packed_array_type (struct type
*);
185 static int ada_is_unconstrained_packed_array_type (struct type
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int advance_wild_match (const char **, const char *, int);
205 static int wild_match (const char *, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (const char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static int ada_resolve_function (struct ada_symbol_info
*, int,
231 struct value
**, int, const char *,
234 static int ada_is_direct_array_type (struct type
*);
236 static void ada_language_arch_info (struct gdbarch
*,
237 struct language_arch_info
*);
239 static void check_size (const struct type
*);
241 static struct value
*ada_index_struct_field (int, struct value
*, int,
244 static struct value
*assign_aggregate (struct value
*, struct value
*,
248 static void aggregate_assign_from_choices (struct value
*, struct value
*,
250 int *, LONGEST
*, int *,
251 int, LONGEST
, LONGEST
);
253 static void aggregate_assign_positional (struct value
*, struct value
*,
255 int *, LONGEST
*, int *, int,
259 static void aggregate_assign_others (struct value
*, struct value
*,
261 int *, LONGEST
*, int, LONGEST
, LONGEST
);
264 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
267 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
270 static void ada_forward_operator_length (struct expression
*, int, int *,
273 static struct type
*ada_find_any_type (const char *name
);
276 /* The result of a symbol lookup to be stored in our symbol cache. */
280 /* The name used to perform the lookup. */
282 /* The namespace used during the lookup. */
283 domain_enum
namespace;
284 /* The symbol returned by the lookup, or NULL if no matching symbol
287 /* The block where the symbol was found, or NULL if no matching
289 const struct block
*block
;
290 /* A pointer to the next entry with the same hash. */
291 struct cache_entry
*next
;
294 /* The Ada symbol cache, used to store the result of Ada-mode symbol
295 lookups in the course of executing the user's commands.
297 The cache is implemented using a simple, fixed-sized hash.
298 The size is fixed on the grounds that there are not likely to be
299 all that many symbols looked up during any given session, regardless
300 of the size of the symbol table. If we decide to go to a resizable
301 table, let's just use the stuff from libiberty instead. */
303 #define HASH_SIZE 1009
305 struct ada_symbol_cache
307 /* An obstack used to store the entries in our cache. */
308 struct obstack cache_space
;
310 /* The root of the hash table used to implement our symbol cache. */
311 struct cache_entry
*root
[HASH_SIZE
];
314 static void ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
);
316 /* Maximum-sized dynamic type. */
317 static unsigned int varsize_limit
;
319 /* FIXME: brobecker/2003-09-17: No longer a const because it is
320 returned by a function that does not return a const char *. */
321 static char *ada_completer_word_break_characters
=
323 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
325 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
328 /* The name of the symbol to use to get the name of the main subprogram. */
329 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
330 = "__gnat_ada_main_program_name";
332 /* Limit on the number of warnings to raise per expression evaluation. */
333 static int warning_limit
= 2;
335 /* Number of warning messages issued; reset to 0 by cleanups after
336 expression evaluation. */
337 static int warnings_issued
= 0;
339 static const char *known_runtime_file_name_patterns
[] = {
340 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
343 static const char *known_auxiliary_function_name_patterns
[] = {
344 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
347 /* Space for allocating results of ada_lookup_symbol_list. */
348 static struct obstack symbol_list_obstack
;
350 /* Maintenance-related settings for this module. */
352 static struct cmd_list_element
*maint_set_ada_cmdlist
;
353 static struct cmd_list_element
*maint_show_ada_cmdlist
;
355 /* Implement the "maintenance set ada" (prefix) command. */
358 maint_set_ada_cmd (char *args
, int from_tty
)
360 help_list (maint_set_ada_cmdlist
, "maintenance set ada ", -1, gdb_stdout
);
363 /* Implement the "maintenance show ada" (prefix) command. */
366 maint_show_ada_cmd (char *args
, int from_tty
)
368 cmd_show_list (maint_show_ada_cmdlist
, from_tty
, "");
371 /* The "maintenance ada set/show ignore-descriptive-type" value. */
373 static int ada_ignore_descriptive_types_p
= 0;
375 /* Inferior-specific data. */
377 /* Per-inferior data for this module. */
379 struct ada_inferior_data
381 /* The ada__tags__type_specific_data type, which is used when decoding
382 tagged types. With older versions of GNAT, this type was directly
383 accessible through a component ("tsd") in the object tag. But this
384 is no longer the case, so we cache it for each inferior. */
385 struct type
*tsd_type
;
387 /* The exception_support_info data. This data is used to determine
388 how to implement support for Ada exception catchpoints in a given
390 const struct exception_support_info
*exception_info
;
393 /* Our key to this module's inferior data. */
394 static const struct inferior_data
*ada_inferior_data
;
396 /* A cleanup routine for our inferior data. */
398 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
400 struct ada_inferior_data
*data
;
402 data
= inferior_data (inf
, ada_inferior_data
);
407 /* Return our inferior data for the given inferior (INF).
409 This function always returns a valid pointer to an allocated
410 ada_inferior_data structure. If INF's inferior data has not
411 been previously set, this functions creates a new one with all
412 fields set to zero, sets INF's inferior to it, and then returns
413 a pointer to that newly allocated ada_inferior_data. */
415 static struct ada_inferior_data
*
416 get_ada_inferior_data (struct inferior
*inf
)
418 struct ada_inferior_data
*data
;
420 data
= inferior_data (inf
, ada_inferior_data
);
423 data
= XCNEW (struct ada_inferior_data
);
424 set_inferior_data (inf
, ada_inferior_data
, data
);
430 /* Perform all necessary cleanups regarding our module's inferior data
431 that is required after the inferior INF just exited. */
434 ada_inferior_exit (struct inferior
*inf
)
436 ada_inferior_data_cleanup (inf
, NULL
);
437 set_inferior_data (inf
, ada_inferior_data
, NULL
);
441 /* program-space-specific data. */
443 /* This module's per-program-space data. */
444 struct ada_pspace_data
446 /* The Ada symbol cache. */
447 struct ada_symbol_cache
*sym_cache
;
450 /* Key to our per-program-space data. */
451 static const struct program_space_data
*ada_pspace_data_handle
;
453 /* Return this module's data for the given program space (PSPACE).
454 If not is found, add a zero'ed one now.
456 This function always returns a valid object. */
458 static struct ada_pspace_data
*
459 get_ada_pspace_data (struct program_space
*pspace
)
461 struct ada_pspace_data
*data
;
463 data
= program_space_data (pspace
, ada_pspace_data_handle
);
466 data
= XCNEW (struct ada_pspace_data
);
467 set_program_space_data (pspace
, ada_pspace_data_handle
, data
);
473 /* The cleanup callback for this module's per-program-space data. */
476 ada_pspace_data_cleanup (struct program_space
*pspace
, void *data
)
478 struct ada_pspace_data
*pspace_data
= data
;
480 if (pspace_data
->sym_cache
!= NULL
)
481 ada_free_symbol_cache (pspace_data
->sym_cache
);
487 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
488 all typedef layers have been peeled. Otherwise, return TYPE.
490 Normally, we really expect a typedef type to only have 1 typedef layer.
491 In other words, we really expect the target type of a typedef type to be
492 a non-typedef type. This is particularly true for Ada units, because
493 the language does not have a typedef vs not-typedef distinction.
494 In that respect, the Ada compiler has been trying to eliminate as many
495 typedef definitions in the debugging information, since they generally
496 do not bring any extra information (we still use typedef under certain
497 circumstances related mostly to the GNAT encoding).
499 Unfortunately, we have seen situations where the debugging information
500 generated by the compiler leads to such multiple typedef layers. For
501 instance, consider the following example with stabs:
503 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
504 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
506 This is an error in the debugging information which causes type
507 pck__float_array___XUP to be defined twice, and the second time,
508 it is defined as a typedef of a typedef.
510 This is on the fringe of legality as far as debugging information is
511 concerned, and certainly unexpected. But it is easy to handle these
512 situations correctly, so we can afford to be lenient in this case. */
515 ada_typedef_target_type (struct type
*type
)
517 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
518 type
= TYPE_TARGET_TYPE (type
);
522 /* Given DECODED_NAME a string holding a symbol name in its
523 decoded form (ie using the Ada dotted notation), returns
524 its unqualified name. */
527 ada_unqualified_name (const char *decoded_name
)
529 const char *result
= strrchr (decoded_name
, '.');
532 result
++; /* Skip the dot... */
534 result
= decoded_name
;
539 /* Return a string starting with '<', followed by STR, and '>'.
540 The result is good until the next call. */
543 add_angle_brackets (const char *str
)
545 static char *result
= NULL
;
548 result
= xstrprintf ("<%s>", str
);
553 ada_get_gdb_completer_word_break_characters (void)
555 return ada_completer_word_break_characters
;
558 /* Print an array element index using the Ada syntax. */
561 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
562 const struct value_print_options
*options
)
564 LA_VALUE_PRINT (index_value
, stream
, options
);
565 fprintf_filtered (stream
, " => ");
568 /* Assuming VECT points to an array of *SIZE objects of size
569 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
570 updating *SIZE as necessary and returning the (new) array. */
573 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
575 if (*size
< min_size
)
578 if (*size
< min_size
)
580 vect
= xrealloc (vect
, *size
* element_size
);
585 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
586 suffix of FIELD_NAME beginning "___". */
589 field_name_match (const char *field_name
, const char *target
)
591 int len
= strlen (target
);
594 (strncmp (field_name
, target
, len
) == 0
595 && (field_name
[len
] == '\0'
596 || (strncmp (field_name
+ len
, "___", 3) == 0
597 && strcmp (field_name
+ strlen (field_name
) - 6,
602 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
603 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
604 and return its index. This function also handles fields whose name
605 have ___ suffixes because the compiler sometimes alters their name
606 by adding such a suffix to represent fields with certain constraints.
607 If the field could not be found, return a negative number if
608 MAYBE_MISSING is set. Otherwise raise an error. */
611 ada_get_field_index (const struct type
*type
, const char *field_name
,
615 struct type
*struct_type
= check_typedef ((struct type
*) type
);
617 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
618 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
622 error (_("Unable to find field %s in struct %s. Aborting"),
623 field_name
, TYPE_NAME (struct_type
));
628 /* The length of the prefix of NAME prior to any "___" suffix. */
631 ada_name_prefix_len (const char *name
)
637 const char *p
= strstr (name
, "___");
640 return strlen (name
);
646 /* Return non-zero if SUFFIX is a suffix of STR.
647 Return zero if STR is null. */
650 is_suffix (const char *str
, const char *suffix
)
657 len2
= strlen (suffix
);
658 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
661 /* The contents of value VAL, treated as a value of type TYPE. The
662 result is an lval in memory if VAL is. */
664 static struct value
*
665 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
667 type
= ada_check_typedef (type
);
668 if (value_type (val
) == type
)
672 struct value
*result
;
674 /* Make sure that the object size is not unreasonable before
675 trying to allocate some memory for it. */
679 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
680 result
= allocate_value_lazy (type
);
683 result
= allocate_value (type
);
684 memcpy (value_contents_raw (result
), value_contents (val
),
687 set_value_component_location (result
, val
);
688 set_value_bitsize (result
, value_bitsize (val
));
689 set_value_bitpos (result
, value_bitpos (val
));
690 set_value_address (result
, value_address (val
));
691 set_value_optimized_out (result
, value_optimized_out_const (val
));
696 static const gdb_byte
*
697 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
702 return valaddr
+ offset
;
706 cond_offset_target (CORE_ADDR address
, long offset
)
711 return address
+ offset
;
714 /* Issue a warning (as for the definition of warning in utils.c, but
715 with exactly one argument rather than ...), unless the limit on the
716 number of warnings has passed during the evaluation of the current
719 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
720 provided by "complaint". */
721 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
724 lim_warning (const char *format
, ...)
728 va_start (args
, format
);
729 warnings_issued
+= 1;
730 if (warnings_issued
<= warning_limit
)
731 vwarning (format
, args
);
736 /* Issue an error if the size of an object of type T is unreasonable,
737 i.e. if it would be a bad idea to allocate a value of this type in
741 check_size (const struct type
*type
)
743 if (TYPE_LENGTH (type
) > varsize_limit
)
744 error (_("object size is larger than varsize-limit"));
747 /* Maximum value of a SIZE-byte signed integer type. */
749 max_of_size (int size
)
751 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
753 return top_bit
| (top_bit
- 1);
756 /* Minimum value of a SIZE-byte signed integer type. */
758 min_of_size (int size
)
760 return -max_of_size (size
) - 1;
763 /* Maximum value of a SIZE-byte unsigned integer type. */
765 umax_of_size (int size
)
767 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
769 return top_bit
| (top_bit
- 1);
772 /* Maximum value of integral type T, as a signed quantity. */
774 max_of_type (struct type
*t
)
776 if (TYPE_UNSIGNED (t
))
777 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
779 return max_of_size (TYPE_LENGTH (t
));
782 /* Minimum value of integral type T, as a signed quantity. */
784 min_of_type (struct type
*t
)
786 if (TYPE_UNSIGNED (t
))
789 return min_of_size (TYPE_LENGTH (t
));
792 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
794 ada_discrete_type_high_bound (struct type
*type
)
796 switch (TYPE_CODE (type
))
798 case TYPE_CODE_RANGE
:
799 return TYPE_HIGH_BOUND (type
);
801 return TYPE_FIELD_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
806 return max_of_type (type
);
808 error (_("Unexpected type in ada_discrete_type_high_bound."));
812 /* The smallest value in the domain of TYPE, a discrete type, as an integer. */
814 ada_discrete_type_low_bound (struct type
*type
)
816 switch (TYPE_CODE (type
))
818 case TYPE_CODE_RANGE
:
819 return TYPE_LOW_BOUND (type
);
821 return TYPE_FIELD_ENUMVAL (type
, 0);
826 return min_of_type (type
);
828 error (_("Unexpected type in ada_discrete_type_low_bound."));
832 /* The identity on non-range types. For range types, the underlying
833 non-range scalar type. */
836 get_base_type (struct type
*type
)
838 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
840 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
842 type
= TYPE_TARGET_TYPE (type
);
847 /* Return a decoded version of the given VALUE. This means returning
848 a value whose type is obtained by applying all the GNAT-specific
849 encondings, making the resulting type a static but standard description
850 of the initial type. */
853 ada_get_decoded_value (struct value
*value
)
855 struct type
*type
= ada_check_typedef (value_type (value
));
857 if (ada_is_array_descriptor_type (type
)
858 || (ada_is_constrained_packed_array_type (type
)
859 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
861 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
862 value
= ada_coerce_to_simple_array_ptr (value
);
864 value
= ada_coerce_to_simple_array (value
);
867 value
= ada_to_fixed_value (value
);
872 /* Same as ada_get_decoded_value, but with the given TYPE.
873 Because there is no associated actual value for this type,
874 the resulting type might be a best-effort approximation in
875 the case of dynamic types. */
878 ada_get_decoded_type (struct type
*type
)
880 type
= to_static_fixed_type (type
);
881 if (ada_is_constrained_packed_array_type (type
))
882 type
= ada_coerce_to_simple_array_type (type
);
888 /* Language Selection */
890 /* If the main program is in Ada, return language_ada, otherwise return LANG
891 (the main program is in Ada iif the adainit symbol is found). */
894 ada_update_initial_language (enum language lang
)
896 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
897 (struct objfile
*) NULL
) != NULL
)
903 /* If the main procedure is written in Ada, then return its name.
904 The result is good until the next call. Return NULL if the main
905 procedure doesn't appear to be in Ada. */
910 struct minimal_symbol
*msym
;
911 static char *main_program_name
= NULL
;
913 /* For Ada, the name of the main procedure is stored in a specific
914 string constant, generated by the binder. Look for that symbol,
915 extract its address, and then read that string. If we didn't find
916 that string, then most probably the main procedure is not written
918 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
922 CORE_ADDR main_program_name_addr
;
925 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
926 if (main_program_name_addr
== 0)
927 error (_("Invalid address for Ada main program name."));
929 xfree (main_program_name
);
930 target_read_string (main_program_name_addr
, &main_program_name
,
935 return main_program_name
;
938 /* The main procedure doesn't seem to be in Ada. */
944 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
947 const struct ada_opname_map ada_opname_table
[] = {
948 {"Oadd", "\"+\"", BINOP_ADD
},
949 {"Osubtract", "\"-\"", BINOP_SUB
},
950 {"Omultiply", "\"*\"", BINOP_MUL
},
951 {"Odivide", "\"/\"", BINOP_DIV
},
952 {"Omod", "\"mod\"", BINOP_MOD
},
953 {"Orem", "\"rem\"", BINOP_REM
},
954 {"Oexpon", "\"**\"", BINOP_EXP
},
955 {"Olt", "\"<\"", BINOP_LESS
},
956 {"Ole", "\"<=\"", BINOP_LEQ
},
957 {"Ogt", "\">\"", BINOP_GTR
},
958 {"Oge", "\">=\"", BINOP_GEQ
},
959 {"Oeq", "\"=\"", BINOP_EQUAL
},
960 {"One", "\"/=\"", BINOP_NOTEQUAL
},
961 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
962 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
963 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
964 {"Oconcat", "\"&\"", BINOP_CONCAT
},
965 {"Oabs", "\"abs\"", UNOP_ABS
},
966 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
967 {"Oadd", "\"+\"", UNOP_PLUS
},
968 {"Osubtract", "\"-\"", UNOP_NEG
},
972 /* The "encoded" form of DECODED, according to GNAT conventions.
973 The result is valid until the next call to ada_encode. */
976 ada_encode (const char *decoded
)
978 static char *encoding_buffer
= NULL
;
979 static size_t encoding_buffer_size
= 0;
986 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
987 2 * strlen (decoded
) + 10);
990 for (p
= decoded
; *p
!= '\0'; p
+= 1)
994 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
999 const struct ada_opname_map
*mapping
;
1001 for (mapping
= ada_opname_table
;
1002 mapping
->encoded
!= NULL
1003 && strncmp (mapping
->decoded
, p
,
1004 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
1006 if (mapping
->encoded
== NULL
)
1007 error (_("invalid Ada operator name: %s"), p
);
1008 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
1009 k
+= strlen (mapping
->encoded
);
1014 encoding_buffer
[k
] = *p
;
1019 encoding_buffer
[k
] = '\0';
1020 return encoding_buffer
;
1023 /* Return NAME folded to lower case, or, if surrounded by single
1024 quotes, unfolded, but with the quotes stripped away. Result good
1028 ada_fold_name (const char *name
)
1030 static char *fold_buffer
= NULL
;
1031 static size_t fold_buffer_size
= 0;
1033 int len
= strlen (name
);
1034 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
1036 if (name
[0] == '\'')
1038 strncpy (fold_buffer
, name
+ 1, len
- 2);
1039 fold_buffer
[len
- 2] = '\000';
1045 for (i
= 0; i
<= len
; i
+= 1)
1046 fold_buffer
[i
] = tolower (name
[i
]);
1052 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
1055 is_lower_alphanum (const char c
)
1057 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
1060 /* ENCODED is the linkage name of a symbol and LEN contains its length.
1061 This function saves in LEN the length of that same symbol name but
1062 without either of these suffixes:
1068 These are suffixes introduced by the compiler for entities such as
1069 nested subprogram for instance, in order to avoid name clashes.
1070 They do not serve any purpose for the debugger. */
1073 ada_remove_trailing_digits (const char *encoded
, int *len
)
1075 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
1079 while (i
> 0 && isdigit (encoded
[i
]))
1081 if (i
>= 0 && encoded
[i
] == '.')
1083 else if (i
>= 0 && encoded
[i
] == '$')
1085 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
1087 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
1092 /* Remove the suffix introduced by the compiler for protected object
1096 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
1098 /* Remove trailing N. */
1100 /* Protected entry subprograms are broken into two
1101 separate subprograms: The first one is unprotected, and has
1102 a 'N' suffix; the second is the protected version, and has
1103 the 'P' suffix. The second calls the first one after handling
1104 the protection. Since the P subprograms are internally generated,
1105 we leave these names undecoded, giving the user a clue that this
1106 entity is internal. */
1109 && encoded
[*len
- 1] == 'N'
1110 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1114 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1117 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1121 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1124 if (encoded
[i
] != 'X')
1130 if (isalnum (encoded
[i
-1]))
1134 /* If ENCODED follows the GNAT entity encoding conventions, then return
1135 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1136 replaced by ENCODED.
1138 The resulting string is valid until the next call of ada_decode.
1139 If the string is unchanged by decoding, the original string pointer
1143 ada_decode (const char *encoded
)
1150 static char *decoding_buffer
= NULL
;
1151 static size_t decoding_buffer_size
= 0;
1153 /* The name of the Ada main procedure starts with "_ada_".
1154 This prefix is not part of the decoded name, so skip this part
1155 if we see this prefix. */
1156 if (strncmp (encoded
, "_ada_", 5) == 0)
1159 /* If the name starts with '_', then it is not a properly encoded
1160 name, so do not attempt to decode it. Similarly, if the name
1161 starts with '<', the name should not be decoded. */
1162 if (encoded
[0] == '_' || encoded
[0] == '<')
1165 len0
= strlen (encoded
);
1167 ada_remove_trailing_digits (encoded
, &len0
);
1168 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1170 /* Remove the ___X.* suffix if present. Do not forget to verify that
1171 the suffix is located before the current "end" of ENCODED. We want
1172 to avoid re-matching parts of ENCODED that have previously been
1173 marked as discarded (by decrementing LEN0). */
1174 p
= strstr (encoded
, "___");
1175 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1183 /* Remove any trailing TKB suffix. It tells us that this symbol
1184 is for the body of a task, but that information does not actually
1185 appear in the decoded name. */
1187 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1190 /* Remove any trailing TB suffix. The TB suffix is slightly different
1191 from the TKB suffix because it is used for non-anonymous task
1194 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1197 /* Remove trailing "B" suffixes. */
1198 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1200 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1203 /* Make decoded big enough for possible expansion by operator name. */
1205 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1206 decoded
= decoding_buffer
;
1208 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1210 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1213 while ((i
>= 0 && isdigit (encoded
[i
]))
1214 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1216 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1218 else if (encoded
[i
] == '$')
1222 /* The first few characters that are not alphabetic are not part
1223 of any encoding we use, so we can copy them over verbatim. */
1225 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1226 decoded
[j
] = encoded
[i
];
1231 /* Is this a symbol function? */
1232 if (at_start_name
&& encoded
[i
] == 'O')
1236 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1238 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1239 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1241 && !isalnum (encoded
[i
+ op_len
]))
1243 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1246 j
+= strlen (ada_opname_table
[k
].decoded
);
1250 if (ada_opname_table
[k
].encoded
!= NULL
)
1255 /* Replace "TK__" with "__", which will eventually be translated
1256 into "." (just below). */
1258 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1261 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1262 be translated into "." (just below). These are internal names
1263 generated for anonymous blocks inside which our symbol is nested. */
1265 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1266 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1267 && isdigit (encoded
[i
+4]))
1271 while (k
< len0
&& isdigit (encoded
[k
]))
1272 k
++; /* Skip any extra digit. */
1274 /* Double-check that the "__B_{DIGITS}+" sequence we found
1275 is indeed followed by "__". */
1276 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1280 /* Remove _E{DIGITS}+[sb] */
1282 /* Just as for protected object subprograms, there are 2 categories
1283 of subprograms created by the compiler for each entry. The first
1284 one implements the actual entry code, and has a suffix following
1285 the convention above; the second one implements the barrier and
1286 uses the same convention as above, except that the 'E' is replaced
1289 Just as above, we do not decode the name of barrier functions
1290 to give the user a clue that the code he is debugging has been
1291 internally generated. */
1293 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1294 && isdigit (encoded
[i
+2]))
1298 while (k
< len0
&& isdigit (encoded
[k
]))
1302 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1305 /* Just as an extra precaution, make sure that if this
1306 suffix is followed by anything else, it is a '_'.
1307 Otherwise, we matched this sequence by accident. */
1309 || (k
< len0
&& encoded
[k
] == '_'))
1314 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1315 the GNAT front-end in protected object subprograms. */
1318 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1320 /* Backtrack a bit up until we reach either the begining of
1321 the encoded name, or "__". Make sure that we only find
1322 digits or lowercase characters. */
1323 const char *ptr
= encoded
+ i
- 1;
1325 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1328 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1332 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1334 /* This is a X[bn]* sequence not separated from the previous
1335 part of the name with a non-alpha-numeric character (in other
1336 words, immediately following an alpha-numeric character), then
1337 verify that it is placed at the end of the encoded name. If
1338 not, then the encoding is not valid and we should abort the
1339 decoding. Otherwise, just skip it, it is used in body-nested
1343 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1347 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1349 /* Replace '__' by '.'. */
1357 /* It's a character part of the decoded name, so just copy it
1359 decoded
[j
] = encoded
[i
];
1364 decoded
[j
] = '\000';
1366 /* Decoded names should never contain any uppercase character.
1367 Double-check this, and abort the decoding if we find one. */
1369 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1370 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1373 if (strcmp (decoded
, encoded
) == 0)
1379 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1380 decoded
= decoding_buffer
;
1381 if (encoded
[0] == '<')
1382 strcpy (decoded
, encoded
);
1384 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1389 /* Table for keeping permanent unique copies of decoded names. Once
1390 allocated, names in this table are never released. While this is a
1391 storage leak, it should not be significant unless there are massive
1392 changes in the set of decoded names in successive versions of a
1393 symbol table loaded during a single session. */
1394 static struct htab
*decoded_names_store
;
1396 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1397 in the language-specific part of GSYMBOL, if it has not been
1398 previously computed. Tries to save the decoded name in the same
1399 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1400 in any case, the decoded symbol has a lifetime at least that of
1402 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1403 const, but nevertheless modified to a semantically equivalent form
1404 when a decoded name is cached in it. */
1407 ada_decode_symbol (const struct general_symbol_info
*arg
)
1409 struct general_symbol_info
*gsymbol
= (struct general_symbol_info
*) arg
;
1410 const char **resultp
=
1411 &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1413 if (!gsymbol
->ada_mangled
)
1415 const char *decoded
= ada_decode (gsymbol
->name
);
1416 struct obstack
*obstack
= gsymbol
->language_specific
.obstack
;
1418 gsymbol
->ada_mangled
= 1;
1420 if (obstack
!= NULL
)
1421 *resultp
= obstack_copy0 (obstack
, decoded
, strlen (decoded
));
1424 /* Sometimes, we can't find a corresponding objfile, in
1425 which case, we put the result on the heap. Since we only
1426 decode when needed, we hope this usually does not cause a
1427 significant memory leak (FIXME). */
1429 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1433 *slot
= xstrdup (decoded
);
1442 ada_la_decode (const char *encoded
, int options
)
1444 return xstrdup (ada_decode (encoded
));
1447 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1448 suffixes that encode debugging information or leading _ada_ on
1449 SYM_NAME (see is_name_suffix commentary for the debugging
1450 information that is ignored). If WILD, then NAME need only match a
1451 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1452 either argument is NULL. */
1455 match_name (const char *sym_name
, const char *name
, int wild
)
1457 if (sym_name
== NULL
|| name
== NULL
)
1460 return wild_match (sym_name
, name
) == 0;
1463 int len_name
= strlen (name
);
1465 return (strncmp (sym_name
, name
, len_name
) == 0
1466 && is_name_suffix (sym_name
+ len_name
))
1467 || (strncmp (sym_name
, "_ada_", 5) == 0
1468 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1469 && is_name_suffix (sym_name
+ len_name
+ 5));
1476 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1477 generated by the GNAT compiler to describe the index type used
1478 for each dimension of an array, check whether it follows the latest
1479 known encoding. If not, fix it up to conform to the latest encoding.
1480 Otherwise, do nothing. This function also does nothing if
1481 INDEX_DESC_TYPE is NULL.
1483 The GNAT encoding used to describle the array index type evolved a bit.
1484 Initially, the information would be provided through the name of each
1485 field of the structure type only, while the type of these fields was
1486 described as unspecified and irrelevant. The debugger was then expected
1487 to perform a global type lookup using the name of that field in order
1488 to get access to the full index type description. Because these global
1489 lookups can be very expensive, the encoding was later enhanced to make
1490 the global lookup unnecessary by defining the field type as being
1491 the full index type description.
1493 The purpose of this routine is to allow us to support older versions
1494 of the compiler by detecting the use of the older encoding, and by
1495 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1496 we essentially replace each field's meaningless type by the associated
1500 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1504 if (index_desc_type
== NULL
)
1506 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1508 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1509 to check one field only, no need to check them all). If not, return
1512 If our INDEX_DESC_TYPE was generated using the older encoding,
1513 the field type should be a meaningless integer type whose name
1514 is not equal to the field name. */
1515 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1516 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1517 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1520 /* Fixup each field of INDEX_DESC_TYPE. */
1521 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1523 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1524 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1527 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1531 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1533 static char *bound_name
[] = {
1534 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1535 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1538 /* Maximum number of array dimensions we are prepared to handle. */
1540 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1543 /* The desc_* routines return primitive portions of array descriptors
1546 /* The descriptor or array type, if any, indicated by TYPE; removes
1547 level of indirection, if needed. */
1549 static struct type
*
1550 desc_base_type (struct type
*type
)
1554 type
= ada_check_typedef (type
);
1555 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1556 type
= ada_typedef_target_type (type
);
1559 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1560 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1561 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1566 /* True iff TYPE indicates a "thin" array pointer type. */
1569 is_thin_pntr (struct type
*type
)
1572 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1573 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1576 /* The descriptor type for thin pointer type TYPE. */
1578 static struct type
*
1579 thin_descriptor_type (struct type
*type
)
1581 struct type
*base_type
= desc_base_type (type
);
1583 if (base_type
== NULL
)
1585 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1589 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1591 if (alt_type
== NULL
)
1598 /* A pointer to the array data for thin-pointer value VAL. */
1600 static struct value
*
1601 thin_data_pntr (struct value
*val
)
1603 struct type
*type
= ada_check_typedef (value_type (val
));
1604 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1606 data_type
= lookup_pointer_type (data_type
);
1608 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1609 return value_cast (data_type
, value_copy (val
));
1611 return value_from_longest (data_type
, value_address (val
));
1614 /* True iff TYPE indicates a "thick" array pointer type. */
1617 is_thick_pntr (struct type
*type
)
1619 type
= desc_base_type (type
);
1620 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1621 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1624 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1625 pointer to one, the type of its bounds data; otherwise, NULL. */
1627 static struct type
*
1628 desc_bounds_type (struct type
*type
)
1632 type
= desc_base_type (type
);
1636 else if (is_thin_pntr (type
))
1638 type
= thin_descriptor_type (type
);
1641 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1643 return ada_check_typedef (r
);
1645 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1647 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1649 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1654 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1655 one, a pointer to its bounds data. Otherwise NULL. */
1657 static struct value
*
1658 desc_bounds (struct value
*arr
)
1660 struct type
*type
= ada_check_typedef (value_type (arr
));
1662 if (is_thin_pntr (type
))
1664 struct type
*bounds_type
=
1665 desc_bounds_type (thin_descriptor_type (type
));
1668 if (bounds_type
== NULL
)
1669 error (_("Bad GNAT array descriptor"));
1671 /* NOTE: The following calculation is not really kosher, but
1672 since desc_type is an XVE-encoded type (and shouldn't be),
1673 the correct calculation is a real pain. FIXME (and fix GCC). */
1674 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1675 addr
= value_as_long (arr
);
1677 addr
= value_address (arr
);
1680 value_from_longest (lookup_pointer_type (bounds_type
),
1681 addr
- TYPE_LENGTH (bounds_type
));
1684 else if (is_thick_pntr (type
))
1686 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1687 _("Bad GNAT array descriptor"));
1688 struct type
*p_bounds_type
= value_type (p_bounds
);
1691 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1693 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1695 if (TYPE_STUB (target_type
))
1696 p_bounds
= value_cast (lookup_pointer_type
1697 (ada_check_typedef (target_type
)),
1701 error (_("Bad GNAT array descriptor"));
1709 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1710 position of the field containing the address of the bounds data. */
1713 fat_pntr_bounds_bitpos (struct type
*type
)
1715 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1718 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1719 size of the field containing the address of the bounds data. */
1722 fat_pntr_bounds_bitsize (struct type
*type
)
1724 type
= desc_base_type (type
);
1726 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1727 return TYPE_FIELD_BITSIZE (type
, 1);
1729 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1732 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1733 pointer to one, the type of its array data (a array-with-no-bounds type);
1734 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1737 static struct type
*
1738 desc_data_target_type (struct type
*type
)
1740 type
= desc_base_type (type
);
1742 /* NOTE: The following is bogus; see comment in desc_bounds. */
1743 if (is_thin_pntr (type
))
1744 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1745 else if (is_thick_pntr (type
))
1747 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1750 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1751 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1757 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1760 static struct value
*
1761 desc_data (struct value
*arr
)
1763 struct type
*type
= value_type (arr
);
1765 if (is_thin_pntr (type
))
1766 return thin_data_pntr (arr
);
1767 else if (is_thick_pntr (type
))
1768 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1769 _("Bad GNAT array descriptor"));
1775 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1776 position of the field containing the address of the data. */
1779 fat_pntr_data_bitpos (struct type
*type
)
1781 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1784 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1785 size of the field containing the address of the data. */
1788 fat_pntr_data_bitsize (struct type
*type
)
1790 type
= desc_base_type (type
);
1792 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1793 return TYPE_FIELD_BITSIZE (type
, 0);
1795 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1798 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1799 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1800 bound, if WHICH is 1. The first bound is I=1. */
1802 static struct value
*
1803 desc_one_bound (struct value
*bounds
, int i
, int which
)
1805 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1806 _("Bad GNAT array descriptor bounds"));
1809 /* If BOUNDS is an array-bounds structure type, return the bit position
1810 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1811 bound, if WHICH is 1. The first bound is I=1. */
1814 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1816 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1819 /* If BOUNDS is an array-bounds structure type, return the bit field size
1820 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1821 bound, if WHICH is 1. The first bound is I=1. */
1824 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1826 type
= desc_base_type (type
);
1828 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1829 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1831 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1834 /* If TYPE is the type of an array-bounds structure, the type of its
1835 Ith bound (numbering from 1). Otherwise, NULL. */
1837 static struct type
*
1838 desc_index_type (struct type
*type
, int i
)
1840 type
= desc_base_type (type
);
1842 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1843 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1848 /* The number of index positions in the array-bounds type TYPE.
1849 Return 0 if TYPE is NULL. */
1852 desc_arity (struct type
*type
)
1854 type
= desc_base_type (type
);
1857 return TYPE_NFIELDS (type
) / 2;
1861 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1862 an array descriptor type (representing an unconstrained array
1866 ada_is_direct_array_type (struct type
*type
)
1870 type
= ada_check_typedef (type
);
1871 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1872 || ada_is_array_descriptor_type (type
));
1875 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1879 ada_is_array_type (struct type
*type
)
1882 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1883 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1884 type
= TYPE_TARGET_TYPE (type
);
1885 return ada_is_direct_array_type (type
);
1888 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1891 ada_is_simple_array_type (struct type
*type
)
1895 type
= ada_check_typedef (type
);
1896 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1897 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1898 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1899 == TYPE_CODE_ARRAY
));
1902 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1905 ada_is_array_descriptor_type (struct type
*type
)
1907 struct type
*data_type
= desc_data_target_type (type
);
1911 type
= ada_check_typedef (type
);
1912 return (data_type
!= NULL
1913 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1914 && desc_arity (desc_bounds_type (type
)) > 0);
1917 /* Non-zero iff type is a partially mal-formed GNAT array
1918 descriptor. FIXME: This is to compensate for some problems with
1919 debugging output from GNAT. Re-examine periodically to see if it
1923 ada_is_bogus_array_descriptor (struct type
*type
)
1927 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1928 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1929 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1930 && !ada_is_array_descriptor_type (type
);
1934 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1935 (fat pointer) returns the type of the array data described---specifically,
1936 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1937 in from the descriptor; otherwise, they are left unspecified. If
1938 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1939 returns NULL. The result is simply the type of ARR if ARR is not
1942 ada_type_of_array (struct value
*arr
, int bounds
)
1944 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1945 return decode_constrained_packed_array_type (value_type (arr
));
1947 if (!ada_is_array_descriptor_type (value_type (arr
)))
1948 return value_type (arr
);
1952 struct type
*array_type
=
1953 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1955 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1956 TYPE_FIELD_BITSIZE (array_type
, 0) =
1957 decode_packed_array_bitsize (value_type (arr
));
1963 struct type
*elt_type
;
1965 struct value
*descriptor
;
1967 elt_type
= ada_array_element_type (value_type (arr
), -1);
1968 arity
= ada_array_arity (value_type (arr
));
1970 if (elt_type
== NULL
|| arity
== 0)
1971 return ada_check_typedef (value_type (arr
));
1973 descriptor
= desc_bounds (arr
);
1974 if (value_as_long (descriptor
) == 0)
1978 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1979 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1980 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1981 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1984 create_range_type (range_type
, value_type (low
),
1985 longest_to_int (value_as_long (low
)),
1986 longest_to_int (value_as_long (high
)));
1987 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1989 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1991 /* We need to store the element packed bitsize, as well as
1992 recompute the array size, because it was previously
1993 computed based on the unpacked element size. */
1994 LONGEST lo
= value_as_long (low
);
1995 LONGEST hi
= value_as_long (high
);
1997 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1998 decode_packed_array_bitsize (value_type (arr
));
1999 /* If the array has no element, then the size is already
2000 zero, and does not need to be recomputed. */
2004 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
2006 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
2011 return lookup_pointer_type (elt_type
);
2015 /* If ARR does not represent an array, returns ARR unchanged.
2016 Otherwise, returns either a standard GDB array with bounds set
2017 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2018 GDB array. Returns NULL if ARR is a null fat pointer. */
2021 ada_coerce_to_simple_array_ptr (struct value
*arr
)
2023 if (ada_is_array_descriptor_type (value_type (arr
)))
2025 struct type
*arrType
= ada_type_of_array (arr
, 1);
2027 if (arrType
== NULL
)
2029 return value_cast (arrType
, value_copy (desc_data (arr
)));
2031 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2032 return decode_constrained_packed_array (arr
);
2037 /* If ARR does not represent an array, returns ARR unchanged.
2038 Otherwise, returns a standard GDB array describing ARR (which may
2039 be ARR itself if it already is in the proper form). */
2042 ada_coerce_to_simple_array (struct value
*arr
)
2044 if (ada_is_array_descriptor_type (value_type (arr
)))
2046 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
2049 error (_("Bounds unavailable for null array pointer."));
2050 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
2051 return value_ind (arrVal
);
2053 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
2054 return decode_constrained_packed_array (arr
);
2059 /* If TYPE represents a GNAT array type, return it translated to an
2060 ordinary GDB array type (possibly with BITSIZE fields indicating
2061 packing). For other types, is the identity. */
2064 ada_coerce_to_simple_array_type (struct type
*type
)
2066 if (ada_is_constrained_packed_array_type (type
))
2067 return decode_constrained_packed_array_type (type
);
2069 if (ada_is_array_descriptor_type (type
))
2070 return ada_check_typedef (desc_data_target_type (type
));
2075 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2078 ada_is_packed_array_type (struct type
*type
)
2082 type
= desc_base_type (type
);
2083 type
= ada_check_typedef (type
);
2085 ada_type_name (type
) != NULL
2086 && strstr (ada_type_name (type
), "___XP") != NULL
;
2089 /* Non-zero iff TYPE represents a standard GNAT constrained
2090 packed-array type. */
2093 ada_is_constrained_packed_array_type (struct type
*type
)
2095 return ada_is_packed_array_type (type
)
2096 && !ada_is_array_descriptor_type (type
);
2099 /* Non-zero iff TYPE represents an array descriptor for a
2100 unconstrained packed-array type. */
2103 ada_is_unconstrained_packed_array_type (struct type
*type
)
2105 return ada_is_packed_array_type (type
)
2106 && ada_is_array_descriptor_type (type
);
2109 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2110 return the size of its elements in bits. */
2113 decode_packed_array_bitsize (struct type
*type
)
2115 const char *raw_name
;
2119 /* Access to arrays implemented as fat pointers are encoded as a typedef
2120 of the fat pointer type. We need the name of the fat pointer type
2121 to do the decoding, so strip the typedef layer. */
2122 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2123 type
= ada_typedef_target_type (type
);
2125 raw_name
= ada_type_name (ada_check_typedef (type
));
2127 raw_name
= ada_type_name (desc_base_type (type
));
2132 tail
= strstr (raw_name
, "___XP");
2133 gdb_assert (tail
!= NULL
);
2135 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2138 (_("could not understand bit size information on packed array"));
2145 /* Given that TYPE is a standard GDB array type with all bounds filled
2146 in, and that the element size of its ultimate scalar constituents
2147 (that is, either its elements, or, if it is an array of arrays, its
2148 elements' elements, etc.) is *ELT_BITS, return an identical type,
2149 but with the bit sizes of its elements (and those of any
2150 constituent arrays) recorded in the BITSIZE components of its
2151 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2154 static struct type
*
2155 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2157 struct type
*new_elt_type
;
2158 struct type
*new_type
;
2159 struct type
*index_type_desc
;
2160 struct type
*index_type
;
2161 LONGEST low_bound
, high_bound
;
2163 type
= ada_check_typedef (type
);
2164 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2167 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2168 if (index_type_desc
)
2169 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2172 index_type
= TYPE_INDEX_TYPE (type
);
2174 new_type
= alloc_type_copy (type
);
2176 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2178 create_array_type (new_type
, new_elt_type
, index_type
);
2179 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2180 TYPE_NAME (new_type
) = ada_type_name (type
);
2182 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2183 low_bound
= high_bound
= 0;
2184 if (high_bound
< low_bound
)
2185 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2188 *elt_bits
*= (high_bound
- low_bound
+ 1);
2189 TYPE_LENGTH (new_type
) =
2190 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2193 TYPE_FIXED_INSTANCE (new_type
) = 1;
2197 /* The array type encoded by TYPE, where
2198 ada_is_constrained_packed_array_type (TYPE). */
2200 static struct type
*
2201 decode_constrained_packed_array_type (struct type
*type
)
2203 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2206 struct type
*shadow_type
;
2210 raw_name
= ada_type_name (desc_base_type (type
));
2215 name
= (char *) alloca (strlen (raw_name
) + 1);
2216 tail
= strstr (raw_name
, "___XP");
2217 type
= desc_base_type (type
);
2219 memcpy (name
, raw_name
, tail
- raw_name
);
2220 name
[tail
- raw_name
] = '\000';
2222 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2224 if (shadow_type
== NULL
)
2226 lim_warning (_("could not find bounds information on packed array"));
2229 CHECK_TYPEDEF (shadow_type
);
2231 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2233 lim_warning (_("could not understand bounds "
2234 "information on packed array"));
2238 bits
= decode_packed_array_bitsize (type
);
2239 return constrained_packed_array_type (shadow_type
, &bits
);
2242 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2243 array, returns a simple array that denotes that array. Its type is a
2244 standard GDB array type except that the BITSIZEs of the array
2245 target types are set to the number of bits in each element, and the
2246 type length is set appropriately. */
2248 static struct value
*
2249 decode_constrained_packed_array (struct value
*arr
)
2253 arr
= ada_coerce_ref (arr
);
2255 /* If our value is a pointer, then dererence it. Make sure that
2256 this operation does not cause the target type to be fixed, as
2257 this would indirectly cause this array to be decoded. The rest
2258 of the routine assumes that the array hasn't been decoded yet,
2259 so we use the basic "value_ind" routine to perform the dereferencing,
2260 as opposed to using "ada_value_ind". */
2261 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2262 arr
= value_ind (arr
);
2264 type
= decode_constrained_packed_array_type (value_type (arr
));
2267 error (_("can't unpack array"));
2271 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2272 && ada_is_modular_type (value_type (arr
)))
2274 /* This is a (right-justified) modular type representing a packed
2275 array with no wrapper. In order to interpret the value through
2276 the (left-justified) packed array type we just built, we must
2277 first left-justify it. */
2278 int bit_size
, bit_pos
;
2281 mod
= ada_modulus (value_type (arr
)) - 1;
2288 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2289 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2290 bit_pos
/ HOST_CHAR_BIT
,
2291 bit_pos
% HOST_CHAR_BIT
,
2296 return coerce_unspec_val_to_type (arr
, type
);
2300 /* The value of the element of packed array ARR at the ARITY indices
2301 given in IND. ARR must be a simple array. */
2303 static struct value
*
2304 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2307 int bits
, elt_off
, bit_off
;
2308 long elt_total_bit_offset
;
2309 struct type
*elt_type
;
2313 elt_total_bit_offset
= 0;
2314 elt_type
= ada_check_typedef (value_type (arr
));
2315 for (i
= 0; i
< arity
; i
+= 1)
2317 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2318 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2320 (_("attempt to do packed indexing of "
2321 "something other than a packed array"));
2324 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2325 LONGEST lowerbound
, upperbound
;
2328 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2330 lim_warning (_("don't know bounds of array"));
2331 lowerbound
= upperbound
= 0;
2334 idx
= pos_atr (ind
[i
]);
2335 if (idx
< lowerbound
|| idx
> upperbound
)
2336 lim_warning (_("packed array index %ld out of bounds"),
2338 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2339 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2340 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2343 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2344 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2346 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2351 /* Non-zero iff TYPE includes negative integer values. */
2354 has_negatives (struct type
*type
)
2356 switch (TYPE_CODE (type
))
2361 return !TYPE_UNSIGNED (type
);
2362 case TYPE_CODE_RANGE
:
2363 return TYPE_LOW_BOUND (type
) < 0;
2368 /* Create a new value of type TYPE from the contents of OBJ starting
2369 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2370 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2371 assigning through the result will set the field fetched from.
2372 VALADDR is ignored unless OBJ is NULL, in which case,
2373 VALADDR+OFFSET must address the start of storage containing the
2374 packed value. The value returned in this case is never an lval.
2375 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2378 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2379 long offset
, int bit_offset
, int bit_size
,
2383 int src
, /* Index into the source area */
2384 targ
, /* Index into the target area */
2385 srcBitsLeft
, /* Number of source bits left to move */
2386 nsrc
, ntarg
, /* Number of source and target bytes */
2387 unusedLS
, /* Number of bits in next significant
2388 byte of source that are unused */
2389 accumSize
; /* Number of meaningful bits in accum */
2390 unsigned char *bytes
; /* First byte containing data to unpack */
2391 unsigned char *unpacked
;
2392 unsigned long accum
; /* Staging area for bits being transferred */
2394 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2395 /* Transmit bytes from least to most significant; delta is the direction
2396 the indices move. */
2397 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2399 type
= ada_check_typedef (type
);
2403 v
= allocate_value (type
);
2404 bytes
= (unsigned char *) (valaddr
+ offset
);
2406 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2408 v
= value_at (type
, value_address (obj
));
2409 bytes
= (unsigned char *) alloca (len
);
2410 read_memory (value_address (v
) + offset
, bytes
, len
);
2414 v
= allocate_value (type
);
2415 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2420 long new_offset
= offset
;
2422 set_value_component_location (v
, obj
);
2423 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2424 set_value_bitsize (v
, bit_size
);
2425 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2428 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2430 set_value_offset (v
, new_offset
);
2432 /* Also set the parent value. This is needed when trying to
2433 assign a new value (in inferior memory). */
2434 set_value_parent (v
, obj
);
2437 set_value_bitsize (v
, bit_size
);
2438 unpacked
= (unsigned char *) value_contents (v
);
2440 srcBitsLeft
= bit_size
;
2442 ntarg
= TYPE_LENGTH (type
);
2446 memset (unpacked
, 0, TYPE_LENGTH (type
));
2449 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2452 if (has_negatives (type
)
2453 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2457 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2460 switch (TYPE_CODE (type
))
2462 case TYPE_CODE_ARRAY
:
2463 case TYPE_CODE_UNION
:
2464 case TYPE_CODE_STRUCT
:
2465 /* Non-scalar values must be aligned at a byte boundary... */
2467 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2468 /* ... And are placed at the beginning (most-significant) bytes
2470 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2475 targ
= TYPE_LENGTH (type
) - 1;
2481 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2484 unusedLS
= bit_offset
;
2487 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2494 /* Mask for removing bits of the next source byte that are not
2495 part of the value. */
2496 unsigned int unusedMSMask
=
2497 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2499 /* Sign-extend bits for this byte. */
2500 unsigned int signMask
= sign
& ~unusedMSMask
;
2503 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2504 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2505 if (accumSize
>= HOST_CHAR_BIT
)
2507 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2508 accumSize
-= HOST_CHAR_BIT
;
2509 accum
>>= HOST_CHAR_BIT
;
2513 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2520 accum
|= sign
<< accumSize
;
2521 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2522 accumSize
-= HOST_CHAR_BIT
;
2523 accum
>>= HOST_CHAR_BIT
;
2531 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2532 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2535 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2536 int src_offset
, int n
, int bits_big_endian_p
)
2538 unsigned int accum
, mask
;
2539 int accum_bits
, chunk_size
;
2541 target
+= targ_offset
/ HOST_CHAR_BIT
;
2542 targ_offset
%= HOST_CHAR_BIT
;
2543 source
+= src_offset
/ HOST_CHAR_BIT
;
2544 src_offset
%= HOST_CHAR_BIT
;
2545 if (bits_big_endian_p
)
2547 accum
= (unsigned char) *source
;
2549 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2555 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2556 accum_bits
+= HOST_CHAR_BIT
;
2558 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2561 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2562 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2565 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2567 accum_bits
-= chunk_size
;
2574 accum
= (unsigned char) *source
>> src_offset
;
2576 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2580 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2581 accum_bits
+= HOST_CHAR_BIT
;
2583 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2586 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2587 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2589 accum_bits
-= chunk_size
;
2590 accum
>>= chunk_size
;
2597 /* Store the contents of FROMVAL into the location of TOVAL.
2598 Return a new value with the location of TOVAL and contents of
2599 FROMVAL. Handles assignment into packed fields that have
2600 floating-point or non-scalar types. */
2602 static struct value
*
2603 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2605 struct type
*type
= value_type (toval
);
2606 int bits
= value_bitsize (toval
);
2608 toval
= ada_coerce_ref (toval
);
2609 fromval
= ada_coerce_ref (fromval
);
2611 if (ada_is_direct_array_type (value_type (toval
)))
2612 toval
= ada_coerce_to_simple_array (toval
);
2613 if (ada_is_direct_array_type (value_type (fromval
)))
2614 fromval
= ada_coerce_to_simple_array (fromval
);
2616 if (!deprecated_value_modifiable (toval
))
2617 error (_("Left operand of assignment is not a modifiable lvalue."));
2619 if (VALUE_LVAL (toval
) == lval_memory
2621 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2622 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2624 int len
= (value_bitpos (toval
)
2625 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2627 gdb_byte
*buffer
= alloca (len
);
2629 CORE_ADDR to_addr
= value_address (toval
);
2631 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2632 fromval
= value_cast (type
, fromval
);
2634 read_memory (to_addr
, buffer
, len
);
2635 from_size
= value_bitsize (fromval
);
2637 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2638 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2639 move_bits (buffer
, value_bitpos (toval
),
2640 value_contents (fromval
), from_size
- bits
, bits
, 1);
2642 move_bits (buffer
, value_bitpos (toval
),
2643 value_contents (fromval
), 0, bits
, 0);
2644 write_memory_with_notification (to_addr
, buffer
, len
);
2646 val
= value_copy (toval
);
2647 memcpy (value_contents_raw (val
), value_contents (fromval
),
2648 TYPE_LENGTH (type
));
2649 deprecated_set_value_type (val
, type
);
2654 return value_assign (toval
, fromval
);
2658 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2659 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2660 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2661 * COMPONENT, and not the inferior's memory. The current contents
2662 * of COMPONENT are ignored. */
2664 value_assign_to_component (struct value
*container
, struct value
*component
,
2667 LONGEST offset_in_container
=
2668 (LONGEST
) (value_address (component
) - value_address (container
));
2669 int bit_offset_in_container
=
2670 value_bitpos (component
) - value_bitpos (container
);
2673 val
= value_cast (value_type (component
), val
);
2675 if (value_bitsize (component
) == 0)
2676 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2678 bits
= value_bitsize (component
);
2680 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2681 move_bits (value_contents_writeable (container
) + offset_in_container
,
2682 value_bitpos (container
) + bit_offset_in_container
,
2683 value_contents (val
),
2684 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2687 move_bits (value_contents_writeable (container
) + offset_in_container
,
2688 value_bitpos (container
) + bit_offset_in_container
,
2689 value_contents (val
), 0, bits
, 0);
2692 /* The value of the element of array ARR at the ARITY indices given in IND.
2693 ARR may be either a simple array, GNAT array descriptor, or pointer
2697 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2701 struct type
*elt_type
;
2703 elt
= ada_coerce_to_simple_array (arr
);
2705 elt_type
= ada_check_typedef (value_type (elt
));
2706 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2707 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2708 return value_subscript_packed (elt
, arity
, ind
);
2710 for (k
= 0; k
< arity
; k
+= 1)
2712 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2713 error (_("too many subscripts (%d expected)"), k
);
2714 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2719 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2720 value of the element of *ARR at the ARITY indices given in
2721 IND. Does not read the entire array into memory. */
2723 static struct value
*
2724 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2729 for (k
= 0; k
< arity
; k
+= 1)
2733 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2734 error (_("too many subscripts (%d expected)"), k
);
2735 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2737 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2738 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2739 type
= TYPE_TARGET_TYPE (type
);
2742 return value_ind (arr
);
2745 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2746 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2747 elements starting at index LOW. The lower bound of this array is LOW, as
2749 static struct value
*
2750 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2753 struct type
*type0
= ada_check_typedef (type
);
2754 CORE_ADDR base
= value_as_address (array_ptr
)
2755 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2756 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2757 struct type
*index_type
=
2758 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2760 struct type
*slice_type
=
2761 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2763 return value_at_lazy (slice_type
, base
);
2767 static struct value
*
2768 ada_value_slice (struct value
*array
, int low
, int high
)
2770 struct type
*type
= ada_check_typedef (value_type (array
));
2771 struct type
*index_type
=
2772 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2773 struct type
*slice_type
=
2774 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2776 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2779 /* If type is a record type in the form of a standard GNAT array
2780 descriptor, returns the number of dimensions for type. If arr is a
2781 simple array, returns the number of "array of"s that prefix its
2782 type designation. Otherwise, returns 0. */
2785 ada_array_arity (struct type
*type
)
2792 type
= desc_base_type (type
);
2795 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2796 return desc_arity (desc_bounds_type (type
));
2798 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2801 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2807 /* If TYPE is a record type in the form of a standard GNAT array
2808 descriptor or a simple array type, returns the element type for
2809 TYPE after indexing by NINDICES indices, or by all indices if
2810 NINDICES is -1. Otherwise, returns NULL. */
2813 ada_array_element_type (struct type
*type
, int nindices
)
2815 type
= desc_base_type (type
);
2817 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2820 struct type
*p_array_type
;
2822 p_array_type
= desc_data_target_type (type
);
2824 k
= ada_array_arity (type
);
2828 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2829 if (nindices
>= 0 && k
> nindices
)
2831 while (k
> 0 && p_array_type
!= NULL
)
2833 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2836 return p_array_type
;
2838 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2840 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2842 type
= TYPE_TARGET_TYPE (type
);
2851 /* The type of nth index in arrays of given type (n numbering from 1).
2852 Does not examine memory. Throws an error if N is invalid or TYPE
2853 is not an array type. NAME is the name of the Ada attribute being
2854 evaluated ('range, 'first, 'last, or 'length); it is used in building
2855 the error message. */
2857 static struct type
*
2858 ada_index_type (struct type
*type
, int n
, const char *name
)
2860 struct type
*result_type
;
2862 type
= desc_base_type (type
);
2864 if (n
< 0 || n
> ada_array_arity (type
))
2865 error (_("invalid dimension number to '%s"), name
);
2867 if (ada_is_simple_array_type (type
))
2871 for (i
= 1; i
< n
; i
+= 1)
2872 type
= TYPE_TARGET_TYPE (type
);
2873 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2874 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2875 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2876 perhaps stabsread.c would make more sense. */
2877 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2882 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2883 if (result_type
== NULL
)
2884 error (_("attempt to take bound of something that is not an array"));
2890 /* Given that arr is an array type, returns the lower bound of the
2891 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2892 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2893 array-descriptor type. It works for other arrays with bounds supplied
2894 by run-time quantities other than discriminants. */
2897 ada_array_bound_from_type (struct type
*arr_type
, int n
, int which
)
2899 struct type
*type
, *index_type_desc
, *index_type
;
2902 gdb_assert (which
== 0 || which
== 1);
2904 if (ada_is_constrained_packed_array_type (arr_type
))
2905 arr_type
= decode_constrained_packed_array_type (arr_type
);
2907 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2908 return (LONGEST
) - which
;
2910 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2911 type
= TYPE_TARGET_TYPE (arr_type
);
2915 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2916 ada_fixup_array_indexes_type (index_type_desc
);
2917 if (index_type_desc
!= NULL
)
2918 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2922 struct type
*elt_type
= check_typedef (type
);
2924 for (i
= 1; i
< n
; i
++)
2925 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
2927 index_type
= TYPE_INDEX_TYPE (elt_type
);
2931 (LONGEST
) (which
== 0
2932 ? ada_discrete_type_low_bound (index_type
)
2933 : ada_discrete_type_high_bound (index_type
));
2936 /* Given that arr is an array value, returns the lower bound of the
2937 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2938 WHICH is 1. This routine will also work for arrays with bounds
2939 supplied by run-time quantities other than discriminants. */
2942 ada_array_bound (struct value
*arr
, int n
, int which
)
2944 struct type
*arr_type
= value_type (arr
);
2946 if (ada_is_constrained_packed_array_type (arr_type
))
2947 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2948 else if (ada_is_simple_array_type (arr_type
))
2949 return ada_array_bound_from_type (arr_type
, n
, which
);
2951 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2954 /* Given that arr is an array value, returns the length of the
2955 nth index. This routine will also work for arrays with bounds
2956 supplied by run-time quantities other than discriminants.
2957 Does not work for arrays indexed by enumeration types with representation
2958 clauses at the moment. */
2961 ada_array_length (struct value
*arr
, int n
)
2963 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2965 if (ada_is_constrained_packed_array_type (arr_type
))
2966 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2968 if (ada_is_simple_array_type (arr_type
))
2969 return (ada_array_bound_from_type (arr_type
, n
, 1)
2970 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2972 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2973 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2976 /* An empty array whose type is that of ARR_TYPE (an array type),
2977 with bounds LOW to LOW-1. */
2979 static struct value
*
2980 empty_array (struct type
*arr_type
, int low
)
2982 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2983 struct type
*index_type
=
2984 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)),
2986 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2988 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2992 /* Name resolution */
2994 /* The "decoded" name for the user-definable Ada operator corresponding
2998 ada_decoded_op_name (enum exp_opcode op
)
3002 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
3004 if (ada_opname_table
[i
].op
== op
)
3005 return ada_opname_table
[i
].decoded
;
3007 error (_("Could not find operator name for opcode"));
3011 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3012 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3013 undefined namespace) and converts operators that are
3014 user-defined into appropriate function calls. If CONTEXT_TYPE is
3015 non-null, it provides a preferred result type [at the moment, only
3016 type void has any effect---causing procedures to be preferred over
3017 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
3018 return type is preferred. May change (expand) *EXP. */
3021 resolve (struct expression
**expp
, int void_context_p
)
3023 struct type
*context_type
= NULL
;
3027 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
3029 resolve_subexp (expp
, &pc
, 1, context_type
);
3032 /* Resolve the operator of the subexpression beginning at
3033 position *POS of *EXPP. "Resolving" consists of replacing
3034 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3035 with their resolutions, replacing built-in operators with
3036 function calls to user-defined operators, where appropriate, and,
3037 when DEPROCEDURE_P is non-zero, converting function-valued variables
3038 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3039 are as in ada_resolve, above. */
3041 static struct value
*
3042 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
3043 struct type
*context_type
)
3047 struct expression
*exp
; /* Convenience: == *expp. */
3048 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
3049 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
3050 int nargs
; /* Number of operands. */
3057 /* Pass one: resolve operands, saving their types and updating *pos,
3062 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3063 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3068 resolve_subexp (expp
, pos
, 0, NULL
);
3070 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
3075 resolve_subexp (expp
, pos
, 0, NULL
);
3080 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
3083 case OP_ATR_MODULUS
:
3093 case TERNOP_IN_RANGE
:
3094 case BINOP_IN_BOUNDS
:
3100 case OP_DISCRETE_RANGE
:
3102 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3111 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3113 resolve_subexp (expp
, pos
, 1, NULL
);
3115 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3132 case BINOP_LOGICAL_AND
:
3133 case BINOP_LOGICAL_OR
:
3134 case BINOP_BITWISE_AND
:
3135 case BINOP_BITWISE_IOR
:
3136 case BINOP_BITWISE_XOR
:
3139 case BINOP_NOTEQUAL
:
3146 case BINOP_SUBSCRIPT
:
3154 case UNOP_LOGICAL_NOT
:
3170 case OP_INTERNALVAR
:
3180 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3183 case STRUCTOP_STRUCT
:
3184 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3197 error (_("Unexpected operator during name resolution"));
3200 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3201 for (i
= 0; i
< nargs
; i
+= 1)
3202 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3206 /* Pass two: perform any resolution on principal operator. */
3213 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3215 struct ada_symbol_info
*candidates
;
3219 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3220 (exp
->elts
[pc
+ 2].symbol
),
3221 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3224 if (n_candidates
> 1)
3226 /* Types tend to get re-introduced locally, so if there
3227 are any local symbols that are not types, first filter
3230 for (j
= 0; j
< n_candidates
; j
+= 1)
3231 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3236 case LOC_REGPARM_ADDR
:
3244 if (j
< n_candidates
)
3247 while (j
< n_candidates
)
3249 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3251 candidates
[j
] = candidates
[n_candidates
- 1];
3260 if (n_candidates
== 0)
3261 error (_("No definition found for %s"),
3262 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3263 else if (n_candidates
== 1)
3265 else if (deprocedure_p
3266 && !is_nonfunction (candidates
, n_candidates
))
3268 i
= ada_resolve_function
3269 (candidates
, n_candidates
, NULL
, 0,
3270 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3273 error (_("Could not find a match for %s"),
3274 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3278 printf_filtered (_("Multiple matches for %s\n"),
3279 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3280 user_select_syms (candidates
, n_candidates
, 1);
3284 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3285 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3286 if (innermost_block
== NULL
3287 || contained_in (candidates
[i
].block
, innermost_block
))
3288 innermost_block
= candidates
[i
].block
;
3292 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3295 replace_operator_with_call (expp
, pc
, 0, 0,
3296 exp
->elts
[pc
+ 2].symbol
,
3297 exp
->elts
[pc
+ 1].block
);
3304 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3305 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3307 struct ada_symbol_info
*candidates
;
3311 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3312 (exp
->elts
[pc
+ 5].symbol
),
3313 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3315 if (n_candidates
== 1)
3319 i
= ada_resolve_function
3320 (candidates
, n_candidates
,
3322 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3325 error (_("Could not find a match for %s"),
3326 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3329 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3330 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3331 if (innermost_block
== NULL
3332 || contained_in (candidates
[i
].block
, innermost_block
))
3333 innermost_block
= candidates
[i
].block
;
3344 case BINOP_BITWISE_AND
:
3345 case BINOP_BITWISE_IOR
:
3346 case BINOP_BITWISE_XOR
:
3348 case BINOP_NOTEQUAL
:
3356 case UNOP_LOGICAL_NOT
:
3358 if (possible_user_operator_p (op
, argvec
))
3360 struct ada_symbol_info
*candidates
;
3364 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3365 (struct block
*) NULL
, VAR_DOMAIN
,
3367 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3368 ada_decoded_op_name (op
), NULL
);
3372 replace_operator_with_call (expp
, pc
, nargs
, 1,
3373 candidates
[i
].sym
, candidates
[i
].block
);
3384 return evaluate_subexp_type (exp
, pos
);
3387 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3388 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3390 /* The term "match" here is rather loose. The match is heuristic and
3394 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3396 ftype
= ada_check_typedef (ftype
);
3397 atype
= ada_check_typedef (atype
);
3399 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3400 ftype
= TYPE_TARGET_TYPE (ftype
);
3401 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3402 atype
= TYPE_TARGET_TYPE (atype
);
3404 switch (TYPE_CODE (ftype
))
3407 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3409 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3410 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3411 TYPE_TARGET_TYPE (atype
), 0);
3414 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3416 case TYPE_CODE_ENUM
:
3417 case TYPE_CODE_RANGE
:
3418 switch (TYPE_CODE (atype
))
3421 case TYPE_CODE_ENUM
:
3422 case TYPE_CODE_RANGE
:
3428 case TYPE_CODE_ARRAY
:
3429 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3430 || ada_is_array_descriptor_type (atype
));
3432 case TYPE_CODE_STRUCT
:
3433 if (ada_is_array_descriptor_type (ftype
))
3434 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3435 || ada_is_array_descriptor_type (atype
));
3437 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3438 && !ada_is_array_descriptor_type (atype
));
3440 case TYPE_CODE_UNION
:
3442 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3446 /* Return non-zero if the formals of FUNC "sufficiently match" the
3447 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3448 may also be an enumeral, in which case it is treated as a 0-
3449 argument function. */
3452 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3455 struct type
*func_type
= SYMBOL_TYPE (func
);
3457 if (SYMBOL_CLASS (func
) == LOC_CONST
3458 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3459 return (n_actuals
== 0);
3460 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3463 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3466 for (i
= 0; i
< n_actuals
; i
+= 1)
3468 if (actuals
[i
] == NULL
)
3472 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3474 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3476 if (!ada_type_match (ftype
, atype
, 1))
3483 /* False iff function type FUNC_TYPE definitely does not produce a value
3484 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3485 FUNC_TYPE is not a valid function type with a non-null return type
3486 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3489 return_match (struct type
*func_type
, struct type
*context_type
)
3491 struct type
*return_type
;
3493 if (func_type
== NULL
)
3496 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3497 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3499 return_type
= get_base_type (func_type
);
3500 if (return_type
== NULL
)
3503 context_type
= get_base_type (context_type
);
3505 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3506 return context_type
== NULL
|| return_type
== context_type
;
3507 else if (context_type
== NULL
)
3508 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3510 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3514 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3515 function (if any) that matches the types of the NARGS arguments in
3516 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3517 that returns that type, then eliminate matches that don't. If
3518 CONTEXT_TYPE is void and there is at least one match that does not
3519 return void, eliminate all matches that do.
3521 Asks the user if there is more than one match remaining. Returns -1
3522 if there is no such symbol or none is selected. NAME is used
3523 solely for messages. May re-arrange and modify SYMS in
3524 the process; the index returned is for the modified vector. */
3527 ada_resolve_function (struct ada_symbol_info syms
[],
3528 int nsyms
, struct value
**args
, int nargs
,
3529 const char *name
, struct type
*context_type
)
3533 int m
; /* Number of hits */
3536 /* In the first pass of the loop, we only accept functions matching
3537 context_type. If none are found, we add a second pass of the loop
3538 where every function is accepted. */
3539 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3541 for (k
= 0; k
< nsyms
; k
+= 1)
3543 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3545 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3546 && (fallback
|| return_match (type
, context_type
)))
3558 printf_filtered (_("Multiple matches for %s\n"), name
);
3559 user_select_syms (syms
, m
, 1);
3565 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3566 in a listing of choices during disambiguation (see sort_choices, below).
3567 The idea is that overloadings of a subprogram name from the
3568 same package should sort in their source order. We settle for ordering
3569 such symbols by their trailing number (__N or $N). */
3572 encoded_ordered_before (const char *N0
, const char *N1
)
3576 else if (N0
== NULL
)
3582 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3584 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3586 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3587 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3592 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3595 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3597 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3598 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3600 return (strcmp (N0
, N1
) < 0);
3604 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3608 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3612 for (i
= 1; i
< nsyms
; i
+= 1)
3614 struct ada_symbol_info sym
= syms
[i
];
3617 for (j
= i
- 1; j
>= 0; j
-= 1)
3619 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3620 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3622 syms
[j
+ 1] = syms
[j
];
3628 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3629 by asking the user (if necessary), returning the number selected,
3630 and setting the first elements of SYMS items. Error if no symbols
3633 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3634 to be re-integrated one of these days. */
3637 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3640 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3642 int first_choice
= (max_results
== 1) ? 1 : 2;
3643 const char *select_mode
= multiple_symbols_select_mode ();
3645 if (max_results
< 1)
3646 error (_("Request to select 0 symbols!"));
3650 if (select_mode
== multiple_symbols_cancel
)
3652 canceled because the command is ambiguous\n\
3653 See set/show multiple-symbol."));
3655 /* If select_mode is "all", then return all possible symbols.
3656 Only do that if more than one symbol can be selected, of course.
3657 Otherwise, display the menu as usual. */
3658 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3661 printf_unfiltered (_("[0] cancel\n"));
3662 if (max_results
> 1)
3663 printf_unfiltered (_("[1] all\n"));
3665 sort_choices (syms
, nsyms
);
3667 for (i
= 0; i
< nsyms
; i
+= 1)
3669 if (syms
[i
].sym
== NULL
)
3672 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3674 struct symtab_and_line sal
=
3675 find_function_start_sal (syms
[i
].sym
, 1);
3677 if (sal
.symtab
== NULL
)
3678 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3680 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3683 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3684 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3685 symtab_to_filename_for_display (sal
.symtab
),
3692 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3693 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3694 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3695 struct symtab
*symtab
= SYMBOL_SYMTAB (syms
[i
].sym
);
3697 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3698 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3700 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3701 symtab_to_filename_for_display (symtab
),
3702 SYMBOL_LINE (syms
[i
].sym
));
3703 else if (is_enumeral
3704 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3706 printf_unfiltered (("[%d] "), i
+ first_choice
);
3707 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3708 gdb_stdout
, -1, 0, &type_print_raw_options
);
3709 printf_unfiltered (_("'(%s) (enumeral)\n"),
3710 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3712 else if (symtab
!= NULL
)
3713 printf_unfiltered (is_enumeral
3714 ? _("[%d] %s in %s (enumeral)\n")
3715 : _("[%d] %s at %s:?\n"),
3717 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3718 symtab_to_filename_for_display (symtab
));
3720 printf_unfiltered (is_enumeral
3721 ? _("[%d] %s (enumeral)\n")
3722 : _("[%d] %s at ?\n"),
3724 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3728 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3731 for (i
= 0; i
< n_chosen
; i
+= 1)
3732 syms
[i
] = syms
[chosen
[i
]];
3737 /* Read and validate a set of numeric choices from the user in the
3738 range 0 .. N_CHOICES-1. Place the results in increasing
3739 order in CHOICES[0 .. N-1], and return N.
3741 The user types choices as a sequence of numbers on one line
3742 separated by blanks, encoding them as follows:
3744 + A choice of 0 means to cancel the selection, throwing an error.
3745 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3746 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3748 The user is not allowed to choose more than MAX_RESULTS values.
3750 ANNOTATION_SUFFIX, if present, is used to annotate the input
3751 prompts (for use with the -f switch). */
3754 get_selections (int *choices
, int n_choices
, int max_results
,
3755 int is_all_choice
, char *annotation_suffix
)
3760 int first_choice
= is_all_choice
? 2 : 1;
3762 prompt
= getenv ("PS2");
3766 args
= command_line_input (prompt
, 0, annotation_suffix
);
3769 error_no_arg (_("one or more choice numbers"));
3773 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3774 order, as given in args. Choices are validated. */
3780 args
= skip_spaces (args
);
3781 if (*args
== '\0' && n_chosen
== 0)
3782 error_no_arg (_("one or more choice numbers"));
3783 else if (*args
== '\0')
3786 choice
= strtol (args
, &args2
, 10);
3787 if (args
== args2
|| choice
< 0
3788 || choice
> n_choices
+ first_choice
- 1)
3789 error (_("Argument must be choice number"));
3793 error (_("cancelled"));
3795 if (choice
< first_choice
)
3797 n_chosen
= n_choices
;
3798 for (j
= 0; j
< n_choices
; j
+= 1)
3802 choice
-= first_choice
;
3804 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3808 if (j
< 0 || choice
!= choices
[j
])
3812 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3813 choices
[k
+ 1] = choices
[k
];
3814 choices
[j
+ 1] = choice
;
3819 if (n_chosen
> max_results
)
3820 error (_("Select no more than %d of the above"), max_results
);
3825 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3826 on the function identified by SYM and BLOCK, and taking NARGS
3827 arguments. Update *EXPP as needed to hold more space. */
3830 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3831 int oplen
, struct symbol
*sym
,
3832 const struct block
*block
)
3834 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3835 symbol, -oplen for operator being replaced). */
3836 struct expression
*newexp
= (struct expression
*)
3837 xzalloc (sizeof (struct expression
)
3838 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3839 struct expression
*exp
= *expp
;
3841 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3842 newexp
->language_defn
= exp
->language_defn
;
3843 newexp
->gdbarch
= exp
->gdbarch
;
3844 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3845 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3846 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3848 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3849 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3851 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3852 newexp
->elts
[pc
+ 4].block
= block
;
3853 newexp
->elts
[pc
+ 5].symbol
= sym
;
3859 /* Type-class predicates */
3861 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3865 numeric_type_p (struct type
*type
)
3871 switch (TYPE_CODE (type
))
3876 case TYPE_CODE_RANGE
:
3877 return (type
== TYPE_TARGET_TYPE (type
)
3878 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3885 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3888 integer_type_p (struct type
*type
)
3894 switch (TYPE_CODE (type
))
3898 case TYPE_CODE_RANGE
:
3899 return (type
== TYPE_TARGET_TYPE (type
)
3900 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3907 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3910 scalar_type_p (struct type
*type
)
3916 switch (TYPE_CODE (type
))
3919 case TYPE_CODE_RANGE
:
3920 case TYPE_CODE_ENUM
:
3929 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3932 discrete_type_p (struct type
*type
)
3938 switch (TYPE_CODE (type
))
3941 case TYPE_CODE_RANGE
:
3942 case TYPE_CODE_ENUM
:
3943 case TYPE_CODE_BOOL
:
3951 /* Returns non-zero if OP with operands in the vector ARGS could be
3952 a user-defined function. Errs on the side of pre-defined operators
3953 (i.e., result 0). */
3956 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3958 struct type
*type0
=
3959 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3960 struct type
*type1
=
3961 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3975 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3979 case BINOP_BITWISE_AND
:
3980 case BINOP_BITWISE_IOR
:
3981 case BINOP_BITWISE_XOR
:
3982 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3985 case BINOP_NOTEQUAL
:
3990 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3993 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3996 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
4000 case UNOP_LOGICAL_NOT
:
4002 return (!numeric_type_p (type0
));
4011 1. In the following, we assume that a renaming type's name may
4012 have an ___XD suffix. It would be nice if this went away at some
4014 2. We handle both the (old) purely type-based representation of
4015 renamings and the (new) variable-based encoding. At some point,
4016 it is devoutly to be hoped that the former goes away
4017 (FIXME: hilfinger-2007-07-09).
4018 3. Subprogram renamings are not implemented, although the XRS
4019 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4021 /* If SYM encodes a renaming,
4023 <renaming> renames <renamed entity>,
4025 sets *LEN to the length of the renamed entity's name,
4026 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4027 the string describing the subcomponent selected from the renamed
4028 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
4029 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4030 are undefined). Otherwise, returns a value indicating the category
4031 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4032 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4033 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4034 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4035 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4036 may be NULL, in which case they are not assigned.
4038 [Currently, however, GCC does not generate subprogram renamings.] */
4040 enum ada_renaming_category
4041 ada_parse_renaming (struct symbol
*sym
,
4042 const char **renamed_entity
, int *len
,
4043 const char **renaming_expr
)
4045 enum ada_renaming_category kind
;
4050 return ADA_NOT_RENAMING
;
4051 switch (SYMBOL_CLASS (sym
))
4054 return ADA_NOT_RENAMING
;
4056 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
4057 renamed_entity
, len
, renaming_expr
);
4061 case LOC_OPTIMIZED_OUT
:
4062 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
4064 return ADA_NOT_RENAMING
;
4068 kind
= ADA_OBJECT_RENAMING
;
4072 kind
= ADA_EXCEPTION_RENAMING
;
4076 kind
= ADA_PACKAGE_RENAMING
;
4080 kind
= ADA_SUBPROGRAM_RENAMING
;
4084 return ADA_NOT_RENAMING
;
4088 if (renamed_entity
!= NULL
)
4089 *renamed_entity
= info
;
4090 suffix
= strstr (info
, "___XE");
4091 if (suffix
== NULL
|| suffix
== info
)
4092 return ADA_NOT_RENAMING
;
4094 *len
= strlen (info
) - strlen (suffix
);
4096 if (renaming_expr
!= NULL
)
4097 *renaming_expr
= suffix
;
4101 /* Assuming TYPE encodes a renaming according to the old encoding in
4102 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4103 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4104 ADA_NOT_RENAMING otherwise. */
4105 static enum ada_renaming_category
4106 parse_old_style_renaming (struct type
*type
,
4107 const char **renamed_entity
, int *len
,
4108 const char **renaming_expr
)
4110 enum ada_renaming_category kind
;
4115 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4116 || TYPE_NFIELDS (type
) != 1)
4117 return ADA_NOT_RENAMING
;
4119 name
= type_name_no_tag (type
);
4121 return ADA_NOT_RENAMING
;
4123 name
= strstr (name
, "___XR");
4125 return ADA_NOT_RENAMING
;
4130 kind
= ADA_OBJECT_RENAMING
;
4133 kind
= ADA_EXCEPTION_RENAMING
;
4136 kind
= ADA_PACKAGE_RENAMING
;
4139 kind
= ADA_SUBPROGRAM_RENAMING
;
4142 return ADA_NOT_RENAMING
;
4145 info
= TYPE_FIELD_NAME (type
, 0);
4147 return ADA_NOT_RENAMING
;
4148 if (renamed_entity
!= NULL
)
4149 *renamed_entity
= info
;
4150 suffix
= strstr (info
, "___XE");
4151 if (renaming_expr
!= NULL
)
4152 *renaming_expr
= suffix
+ 5;
4153 if (suffix
== NULL
|| suffix
== info
)
4154 return ADA_NOT_RENAMING
;
4156 *len
= suffix
- info
;
4160 /* Compute the value of the given RENAMING_SYM, which is expected to
4161 be a symbol encoding a renaming expression. BLOCK is the block
4162 used to evaluate the renaming. */
4164 static struct value
*
4165 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4166 struct block
*block
)
4168 const char *sym_name
;
4169 struct expression
*expr
;
4170 struct value
*value
;
4171 struct cleanup
*old_chain
= NULL
;
4173 sym_name
= SYMBOL_LINKAGE_NAME (renaming_sym
);
4174 expr
= parse_exp_1 (&sym_name
, 0, block
, 0);
4175 old_chain
= make_cleanup (free_current_contents
, &expr
);
4176 value
= evaluate_expression (expr
);
4178 do_cleanups (old_chain
);
4183 /* Evaluation: Function Calls */
4185 /* Return an lvalue containing the value VAL. This is the identity on
4186 lvalues, and otherwise has the side-effect of allocating memory
4187 in the inferior where a copy of the value contents is copied. */
4189 static struct value
*
4190 ensure_lval (struct value
*val
)
4192 if (VALUE_LVAL (val
) == not_lval
4193 || VALUE_LVAL (val
) == lval_internalvar
)
4195 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4196 const CORE_ADDR addr
=
4197 value_as_long (value_allocate_space_in_inferior (len
));
4199 set_value_address (val
, addr
);
4200 VALUE_LVAL (val
) = lval_memory
;
4201 write_memory (addr
, value_contents (val
), len
);
4207 /* Return the value ACTUAL, converted to be an appropriate value for a
4208 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4209 allocating any necessary descriptors (fat pointers), or copies of
4210 values not residing in memory, updating it as needed. */
4213 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4215 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4216 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4217 struct type
*formal_target
=
4218 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4219 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4220 struct type
*actual_target
=
4221 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4222 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4224 if (ada_is_array_descriptor_type (formal_target
)
4225 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4226 return make_array_descriptor (formal_type
, actual
);
4227 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4228 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4230 struct value
*result
;
4232 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4233 && ada_is_array_descriptor_type (actual_target
))
4234 result
= desc_data (actual
);
4235 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4237 if (VALUE_LVAL (actual
) != lval_memory
)
4241 actual_type
= ada_check_typedef (value_type (actual
));
4242 val
= allocate_value (actual_type
);
4243 memcpy ((char *) value_contents_raw (val
),
4244 (char *) value_contents (actual
),
4245 TYPE_LENGTH (actual_type
));
4246 actual
= ensure_lval (val
);
4248 result
= value_addr (actual
);
4252 return value_cast_pointers (formal_type
, result
, 0);
4254 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4255 return ada_value_ind (actual
);
4260 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4261 type TYPE. This is usually an inefficient no-op except on some targets
4262 (such as AVR) where the representation of a pointer and an address
4266 value_pointer (struct value
*value
, struct type
*type
)
4268 struct gdbarch
*gdbarch
= get_type_arch (type
);
4269 unsigned len
= TYPE_LENGTH (type
);
4270 gdb_byte
*buf
= alloca (len
);
4273 addr
= value_address (value
);
4274 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4275 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4280 /* Push a descriptor of type TYPE for array value ARR on the stack at
4281 *SP, updating *SP to reflect the new descriptor. Return either
4282 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4283 to-descriptor type rather than a descriptor type), a struct value *
4284 representing a pointer to this descriptor. */
4286 static struct value
*
4287 make_array_descriptor (struct type
*type
, struct value
*arr
)
4289 struct type
*bounds_type
= desc_bounds_type (type
);
4290 struct type
*desc_type
= desc_base_type (type
);
4291 struct value
*descriptor
= allocate_value (desc_type
);
4292 struct value
*bounds
= allocate_value (bounds_type
);
4295 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4298 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4299 ada_array_bound (arr
, i
, 0),
4300 desc_bound_bitpos (bounds_type
, i
, 0),
4301 desc_bound_bitsize (bounds_type
, i
, 0));
4302 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4303 ada_array_bound (arr
, i
, 1),
4304 desc_bound_bitpos (bounds_type
, i
, 1),
4305 desc_bound_bitsize (bounds_type
, i
, 1));
4308 bounds
= ensure_lval (bounds
);
4310 modify_field (value_type (descriptor
),
4311 value_contents_writeable (descriptor
),
4312 value_pointer (ensure_lval (arr
),
4313 TYPE_FIELD_TYPE (desc_type
, 0)),
4314 fat_pntr_data_bitpos (desc_type
),
4315 fat_pntr_data_bitsize (desc_type
));
4317 modify_field (value_type (descriptor
),
4318 value_contents_writeable (descriptor
),
4319 value_pointer (bounds
,
4320 TYPE_FIELD_TYPE (desc_type
, 1)),
4321 fat_pntr_bounds_bitpos (desc_type
),
4322 fat_pntr_bounds_bitsize (desc_type
));
4324 descriptor
= ensure_lval (descriptor
);
4326 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4327 return value_addr (descriptor
);
4332 /* Symbol Cache Module */
4334 /* Performance measurements made as of 2010-01-15 indicate that
4335 this cache does bring some noticeable improvements. Depending
4336 on the type of entity being printed, the cache can make it as much
4337 as an order of magnitude faster than without it.
4339 The descriptive type DWARF extension has significantly reduced
4340 the need for this cache, at least when DWARF is being used. However,
4341 even in this case, some expensive name-based symbol searches are still
4342 sometimes necessary - to find an XVZ variable, mostly. */
4344 /* Initialize the contents of SYM_CACHE. */
4347 ada_init_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4349 obstack_init (&sym_cache
->cache_space
);
4350 memset (sym_cache
->root
, '\000', sizeof (sym_cache
->root
));
4353 /* Free the memory used by SYM_CACHE. */
4356 ada_free_symbol_cache (struct ada_symbol_cache
*sym_cache
)
4358 obstack_free (&sym_cache
->cache_space
, NULL
);
4362 /* Return the symbol cache associated to the given program space PSPACE.
4363 If not allocated for this PSPACE yet, allocate and initialize one. */
4365 static struct ada_symbol_cache
*
4366 ada_get_symbol_cache (struct program_space
*pspace
)
4368 struct ada_pspace_data
*pspace_data
= get_ada_pspace_data (pspace
);
4369 struct ada_symbol_cache
*sym_cache
= pspace_data
->sym_cache
;
4371 if (sym_cache
== NULL
)
4373 sym_cache
= XCNEW (struct ada_symbol_cache
);
4374 ada_init_symbol_cache (sym_cache
);
4380 /* Clear all entries from the symbol cache. */
4383 ada_clear_symbol_cache (void)
4385 struct ada_symbol_cache
*sym_cache
4386 = ada_get_symbol_cache (current_program_space
);
4388 obstack_free (&sym_cache
->cache_space
, NULL
);
4389 ada_init_symbol_cache (sym_cache
);
4392 /* Search our cache for an entry matching NAME and NAMESPACE.
4393 Return it if found, or NULL otherwise. */
4395 static struct cache_entry
**
4396 find_entry (const char *name
, domain_enum
namespace)
4398 struct ada_symbol_cache
*sym_cache
4399 = ada_get_symbol_cache (current_program_space
);
4400 int h
= msymbol_hash (name
) % HASH_SIZE
;
4401 struct cache_entry
**e
;
4403 for (e
= &sym_cache
->root
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
4405 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
4411 /* Search the symbol cache for an entry matching NAME and NAMESPACE.
4412 Return 1 if found, 0 otherwise.
4414 If an entry was found and SYM is not NULL, set *SYM to the entry's
4415 SYM. Same principle for BLOCK if not NULL. */
4418 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4419 struct symbol
**sym
, const struct block
**block
)
4421 struct cache_entry
**e
= find_entry (name
, namespace);
4428 *block
= (*e
)->block
;
4432 /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
4433 in domain NAMESPACE, save this result in our symbol cache. */
4436 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4437 const struct block
*block
)
4439 struct ada_symbol_cache
*sym_cache
4440 = ada_get_symbol_cache (current_program_space
);
4443 struct cache_entry
*e
;
4445 /* If the symbol is a local symbol, then do not cache it, as a search
4446 for that symbol depends on the context. To determine whether
4447 the symbol is local or not, we check the block where we found it
4448 against the global and static blocks of its associated symtab. */
4450 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), GLOBAL_BLOCK
) != block
4451 && BLOCKVECTOR_BLOCK (BLOCKVECTOR (sym
->symtab
), STATIC_BLOCK
) != block
)
4454 h
= msymbol_hash (name
) % HASH_SIZE
;
4455 e
= (struct cache_entry
*) obstack_alloc (&sym_cache
->cache_space
,
4457 e
->next
= sym_cache
->root
[h
];
4458 sym_cache
->root
[h
] = e
;
4459 e
->name
= copy
= obstack_alloc (&sym_cache
->cache_space
, strlen (name
) + 1);
4460 strcpy (copy
, name
);
4462 e
->namespace = namespace;
4468 /* Return nonzero if wild matching should be used when searching for
4469 all symbols matching LOOKUP_NAME.
4471 LOOKUP_NAME is expected to be a symbol name after transformation
4472 for Ada lookups (see ada_name_for_lookup). */
4475 should_use_wild_match (const char *lookup_name
)
4477 return (strstr (lookup_name
, "__") == NULL
);
4480 /* Return the result of a standard (literal, C-like) lookup of NAME in
4481 given DOMAIN, visible from lexical block BLOCK. */
4483 static struct symbol
*
4484 standard_lookup (const char *name
, const struct block
*block
,
4487 /* Initialize it just to avoid a GCC false warning. */
4488 struct symbol
*sym
= NULL
;
4490 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4492 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4493 cache_symbol (name
, domain
, sym
, block_found
);
4498 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4499 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4500 since they contend in overloading in the same way. */
4502 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4506 for (i
= 0; i
< n
; i
+= 1)
4507 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4508 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4509 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4515 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4516 struct types. Otherwise, they may not. */
4519 equiv_types (struct type
*type0
, struct type
*type1
)
4523 if (type0
== NULL
|| type1
== NULL
4524 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4526 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4527 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4528 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4529 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4535 /* True iff SYM0 represents the same entity as SYM1, or one that is
4536 no more defined than that of SYM1. */
4539 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4543 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4544 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4547 switch (SYMBOL_CLASS (sym0
))
4553 struct type
*type0
= SYMBOL_TYPE (sym0
);
4554 struct type
*type1
= SYMBOL_TYPE (sym1
);
4555 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4556 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4557 int len0
= strlen (name0
);
4560 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4561 && (equiv_types (type0
, type1
)
4562 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4563 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4566 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4567 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4573 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4574 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4577 add_defn_to_vec (struct obstack
*obstackp
,
4579 const struct block
*block
)
4582 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4584 /* Do not try to complete stub types, as the debugger is probably
4585 already scanning all symbols matching a certain name at the
4586 time when this function is called. Trying to replace the stub
4587 type by its associated full type will cause us to restart a scan
4588 which may lead to an infinite recursion. Instead, the client
4589 collecting the matching symbols will end up collecting several
4590 matches, with at least one of them complete. It can then filter
4591 out the stub ones if needed. */
4593 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4595 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4597 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4599 prevDefns
[i
].sym
= sym
;
4600 prevDefns
[i
].block
= block
;
4606 struct ada_symbol_info info
;
4610 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4614 /* Number of ada_symbol_info structures currently collected in
4615 current vector in *OBSTACKP. */
4618 num_defns_collected (struct obstack
*obstackp
)
4620 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4623 /* Vector of ada_symbol_info structures currently collected in current
4624 vector in *OBSTACKP. If FINISH, close off the vector and return
4625 its final address. */
4627 static struct ada_symbol_info
*
4628 defns_collected (struct obstack
*obstackp
, int finish
)
4631 return obstack_finish (obstackp
);
4633 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4636 /* Return a bound minimal symbol matching NAME according to Ada
4637 decoding rules. Returns an invalid symbol if there is no such
4638 minimal symbol. Names prefixed with "standard__" are handled
4639 specially: "standard__" is first stripped off, and only static and
4640 global symbols are searched. */
4642 struct bound_minimal_symbol
4643 ada_lookup_simple_minsym (const char *name
)
4645 struct bound_minimal_symbol result
;
4646 struct objfile
*objfile
;
4647 struct minimal_symbol
*msymbol
;
4648 const int wild_match_p
= should_use_wild_match (name
);
4650 memset (&result
, 0, sizeof (result
));
4652 /* Special case: If the user specifies a symbol name inside package
4653 Standard, do a non-wild matching of the symbol name without
4654 the "standard__" prefix. This was primarily introduced in order
4655 to allow the user to specifically access the standard exceptions
4656 using, for instance, Standard.Constraint_Error when Constraint_Error
4657 is ambiguous (due to the user defining its own Constraint_Error
4658 entity inside its program). */
4659 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4660 name
+= sizeof ("standard__") - 1;
4662 ALL_MSYMBOLS (objfile
, msymbol
)
4664 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4665 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4667 result
.minsym
= msymbol
;
4668 result
.objfile
= objfile
;
4676 /* For all subprograms that statically enclose the subprogram of the
4677 selected frame, add symbols matching identifier NAME in DOMAIN
4678 and their blocks to the list of data in OBSTACKP, as for
4679 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4680 with a wildcard prefix. */
4683 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4684 const char *name
, domain_enum
namespace,
4689 /* True if TYPE is definitely an artificial type supplied to a symbol
4690 for which no debugging information was given in the symbol file. */
4693 is_nondebugging_type (struct type
*type
)
4695 const char *name
= ada_type_name (type
);
4697 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4700 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4701 that are deemed "identical" for practical purposes.
4703 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4704 types and that their number of enumerals is identical (in other
4705 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4708 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4712 /* The heuristic we use here is fairly conservative. We consider
4713 that 2 enumerate types are identical if they have the same
4714 number of enumerals and that all enumerals have the same
4715 underlying value and name. */
4717 /* All enums in the type should have an identical underlying value. */
4718 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4719 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4722 /* All enumerals should also have the same name (modulo any numerical
4724 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4726 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4727 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4728 int len_1
= strlen (name_1
);
4729 int len_2
= strlen (name_2
);
4731 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4732 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4734 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4735 TYPE_FIELD_NAME (type2
, i
),
4743 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4744 that are deemed "identical" for practical purposes. Sometimes,
4745 enumerals are not strictly identical, but their types are so similar
4746 that they can be considered identical.
4748 For instance, consider the following code:
4750 type Color is (Black, Red, Green, Blue, White);
4751 type RGB_Color is new Color range Red .. Blue;
4753 Type RGB_Color is a subrange of an implicit type which is a copy
4754 of type Color. If we call that implicit type RGB_ColorB ("B" is
4755 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4756 As a result, when an expression references any of the enumeral
4757 by name (Eg. "print green"), the expression is technically
4758 ambiguous and the user should be asked to disambiguate. But
4759 doing so would only hinder the user, since it wouldn't matter
4760 what choice he makes, the outcome would always be the same.
4761 So, for practical purposes, we consider them as the same. */
4764 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4768 /* Before performing a thorough comparison check of each type,
4769 we perform a series of inexpensive checks. We expect that these
4770 checks will quickly fail in the vast majority of cases, and thus
4771 help prevent the unnecessary use of a more expensive comparison.
4772 Said comparison also expects us to make some of these checks
4773 (see ada_identical_enum_types_p). */
4775 /* Quick check: All symbols should have an enum type. */
4776 for (i
= 0; i
< nsyms
; i
++)
4777 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4780 /* Quick check: They should all have the same value. */
4781 for (i
= 1; i
< nsyms
; i
++)
4782 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4785 /* Quick check: They should all have the same number of enumerals. */
4786 for (i
= 1; i
< nsyms
; i
++)
4787 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4788 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4791 /* All the sanity checks passed, so we might have a set of
4792 identical enumeration types. Perform a more complete
4793 comparison of the type of each symbol. */
4794 for (i
= 1; i
< nsyms
; i
++)
4795 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4796 SYMBOL_TYPE (syms
[0].sym
)))
4802 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4803 duplicate other symbols in the list (The only case I know of where
4804 this happens is when object files containing stabs-in-ecoff are
4805 linked with files containing ordinary ecoff debugging symbols (or no
4806 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4807 Returns the number of items in the modified list. */
4810 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4814 /* We should never be called with less than 2 symbols, as there
4815 cannot be any extra symbol in that case. But it's easy to
4816 handle, since we have nothing to do in that case. */
4825 /* If two symbols have the same name and one of them is a stub type,
4826 the get rid of the stub. */
4828 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4829 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4831 for (j
= 0; j
< nsyms
; j
++)
4834 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4835 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4836 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4837 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4842 /* Two symbols with the same name, same class and same address
4843 should be identical. */
4845 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4846 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4847 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4849 for (j
= 0; j
< nsyms
; j
+= 1)
4852 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4853 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4854 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4855 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4856 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4857 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4864 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4865 syms
[j
- 1] = syms
[j
];
4872 /* If all the remaining symbols are identical enumerals, then
4873 just keep the first one and discard the rest.
4875 Unlike what we did previously, we do not discard any entry
4876 unless they are ALL identical. This is because the symbol
4877 comparison is not a strict comparison, but rather a practical
4878 comparison. If all symbols are considered identical, then
4879 we can just go ahead and use the first one and discard the rest.
4880 But if we cannot reduce the list to a single element, we have
4881 to ask the user to disambiguate anyways. And if we have to
4882 present a multiple-choice menu, it's less confusing if the list
4883 isn't missing some choices that were identical and yet distinct. */
4884 if (symbols_are_identical_enums (syms
, nsyms
))
4890 /* Given a type that corresponds to a renaming entity, use the type name
4891 to extract the scope (package name or function name, fully qualified,
4892 and following the GNAT encoding convention) where this renaming has been
4893 defined. The string returned needs to be deallocated after use. */
4896 xget_renaming_scope (struct type
*renaming_type
)
4898 /* The renaming types adhere to the following convention:
4899 <scope>__<rename>___<XR extension>.
4900 So, to extract the scope, we search for the "___XR" extension,
4901 and then backtrack until we find the first "__". */
4903 const char *name
= type_name_no_tag (renaming_type
);
4904 char *suffix
= strstr (name
, "___XR");
4909 /* Now, backtrack a bit until we find the first "__". Start looking
4910 at suffix - 3, as the <rename> part is at least one character long. */
4912 for (last
= suffix
- 3; last
> name
; last
--)
4913 if (last
[0] == '_' && last
[1] == '_')
4916 /* Make a copy of scope and return it. */
4918 scope_len
= last
- name
;
4919 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4921 strncpy (scope
, name
, scope_len
);
4922 scope
[scope_len
] = '\0';
4927 /* Return nonzero if NAME corresponds to a package name. */
4930 is_package_name (const char *name
)
4932 /* Here, We take advantage of the fact that no symbols are generated
4933 for packages, while symbols are generated for each function.
4934 So the condition for NAME represent a package becomes equivalent
4935 to NAME not existing in our list of symbols. There is only one
4936 small complication with library-level functions (see below). */
4940 /* If it is a function that has not been defined at library level,
4941 then we should be able to look it up in the symbols. */
4942 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4945 /* Library-level function names start with "_ada_". See if function
4946 "_ada_" followed by NAME can be found. */
4948 /* Do a quick check that NAME does not contain "__", since library-level
4949 functions names cannot contain "__" in them. */
4950 if (strstr (name
, "__") != NULL
)
4953 fun_name
= xstrprintf ("_ada_%s", name
);
4955 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4958 /* Return nonzero if SYM corresponds to a renaming entity that is
4959 not visible from FUNCTION_NAME. */
4962 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4965 struct cleanup
*old_chain
;
4967 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4970 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4971 old_chain
= make_cleanup (xfree
, scope
);
4973 /* If the rename has been defined in a package, then it is visible. */
4974 if (is_package_name (scope
))
4976 do_cleanups (old_chain
);
4980 /* Check that the rename is in the current function scope by checking
4981 that its name starts with SCOPE. */
4983 /* If the function name starts with "_ada_", it means that it is
4984 a library-level function. Strip this prefix before doing the
4985 comparison, as the encoding for the renaming does not contain
4987 if (strncmp (function_name
, "_ada_", 5) == 0)
4991 int is_invisible
= strncmp (function_name
, scope
, strlen (scope
)) != 0;
4993 do_cleanups (old_chain
);
4994 return is_invisible
;
4998 /* Remove entries from SYMS that corresponds to a renaming entity that
4999 is not visible from the function associated with CURRENT_BLOCK or
5000 that is superfluous due to the presence of more specific renaming
5001 information. Places surviving symbols in the initial entries of
5002 SYMS and returns the number of surviving symbols.
5005 First, in cases where an object renaming is implemented as a
5006 reference variable, GNAT may produce both the actual reference
5007 variable and the renaming encoding. In this case, we discard the
5010 Second, GNAT emits a type following a specified encoding for each renaming
5011 entity. Unfortunately, STABS currently does not support the definition
5012 of types that are local to a given lexical block, so all renamings types
5013 are emitted at library level. As a consequence, if an application
5014 contains two renaming entities using the same name, and a user tries to
5015 print the value of one of these entities, the result of the ada symbol
5016 lookup will also contain the wrong renaming type.
5018 This function partially covers for this limitation by attempting to
5019 remove from the SYMS list renaming symbols that should be visible
5020 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5021 method with the current information available. The implementation
5022 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5024 - When the user tries to print a rename in a function while there
5025 is another rename entity defined in a package: Normally, the
5026 rename in the function has precedence over the rename in the
5027 package, so the latter should be removed from the list. This is
5028 currently not the case.
5030 - This function will incorrectly remove valid renames if
5031 the CURRENT_BLOCK corresponds to a function which symbol name
5032 has been changed by an "Export" pragma. As a consequence,
5033 the user will be unable to print such rename entities. */
5036 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
5037 int nsyms
, const struct block
*current_block
)
5039 struct symbol
*current_function
;
5040 const char *current_function_name
;
5042 int is_new_style_renaming
;
5044 /* If there is both a renaming foo___XR... encoded as a variable and
5045 a simple variable foo in the same block, discard the latter.
5046 First, zero out such symbols, then compress. */
5047 is_new_style_renaming
= 0;
5048 for (i
= 0; i
< nsyms
; i
+= 1)
5050 struct symbol
*sym
= syms
[i
].sym
;
5051 const struct block
*block
= syms
[i
].block
;
5055 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
5057 name
= SYMBOL_LINKAGE_NAME (sym
);
5058 suffix
= strstr (name
, "___XR");
5062 int name_len
= suffix
- name
;
5065 is_new_style_renaming
= 1;
5066 for (j
= 0; j
< nsyms
; j
+= 1)
5067 if (i
!= j
&& syms
[j
].sym
!= NULL
5068 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
5070 && block
== syms
[j
].block
)
5074 if (is_new_style_renaming
)
5078 for (j
= k
= 0; j
< nsyms
; j
+= 1)
5079 if (syms
[j
].sym
!= NULL
)
5087 /* Extract the function name associated to CURRENT_BLOCK.
5088 Abort if unable to do so. */
5090 if (current_block
== NULL
)
5093 current_function
= block_linkage_function (current_block
);
5094 if (current_function
== NULL
)
5097 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
5098 if (current_function_name
== NULL
)
5101 /* Check each of the symbols, and remove it from the list if it is
5102 a type corresponding to a renaming that is out of the scope of
5103 the current block. */
5108 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
5109 == ADA_OBJECT_RENAMING
5110 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
5114 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
5115 syms
[j
- 1] = syms
[j
];
5125 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5126 whose name and domain match NAME and DOMAIN respectively.
5127 If no match was found, then extend the search to "enclosing"
5128 routines (in other words, if we're inside a nested function,
5129 search the symbols defined inside the enclosing functions).
5130 If WILD_MATCH_P is nonzero, perform the naming matching in
5131 "wild" mode (see function "wild_match" for more info).
5133 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5136 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
5137 const struct block
*block
, domain_enum domain
,
5140 int block_depth
= 0;
5142 while (block
!= NULL
)
5145 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
5148 /* If we found a non-function match, assume that's the one. */
5149 if (is_nonfunction (defns_collected (obstackp
, 0),
5150 num_defns_collected (obstackp
)))
5153 block
= BLOCK_SUPERBLOCK (block
);
5156 /* If no luck so far, try to find NAME as a local symbol in some lexically
5157 enclosing subprogram. */
5158 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
5159 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
5162 /* An object of this type is used as the user_data argument when
5163 calling the map_matching_symbols method. */
5167 struct objfile
*objfile
;
5168 struct obstack
*obstackp
;
5169 struct symbol
*arg_sym
;
5173 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
5174 to a list of symbols. DATA0 is a pointer to a struct match_data *
5175 containing the obstack that collects the symbol list, the file that SYM
5176 must come from, a flag indicating whether a non-argument symbol has
5177 been found in the current block, and the last argument symbol
5178 passed in SYM within the current block (if any). When SYM is null,
5179 marking the end of a block, the argument symbol is added if no
5180 other has been found. */
5183 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
5185 struct match_data
*data
= (struct match_data
*) data0
;
5189 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
5190 add_defn_to_vec (data
->obstackp
,
5191 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
5193 data
->found_sym
= 0;
5194 data
->arg_sym
= NULL
;
5198 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5200 else if (SYMBOL_IS_ARGUMENT (sym
))
5201 data
->arg_sym
= sym
;
5204 data
->found_sym
= 1;
5205 add_defn_to_vec (data
->obstackp
,
5206 fixup_symbol_section (sym
, data
->objfile
),
5213 /* Implements compare_names, but only applying the comparision using
5214 the given CASING. */
5217 compare_names_with_case (const char *string1
, const char *string2
,
5218 enum case_sensitivity casing
)
5220 while (*string1
!= '\0' && *string2
!= '\0')
5224 if (isspace (*string1
) || isspace (*string2
))
5225 return strcmp_iw_ordered (string1
, string2
);
5227 if (casing
== case_sensitive_off
)
5229 c1
= tolower (*string1
);
5230 c2
= tolower (*string2
);
5247 return strcmp_iw_ordered (string1
, string2
);
5249 if (*string2
== '\0')
5251 if (is_name_suffix (string1
))
5258 if (*string2
== '(')
5259 return strcmp_iw_ordered (string1
, string2
);
5262 if (casing
== case_sensitive_off
)
5263 return tolower (*string1
) - tolower (*string2
);
5265 return *string1
- *string2
;
5270 /* Compare STRING1 to STRING2, with results as for strcmp.
5271 Compatible with strcmp_iw_ordered in that...
5273 strcmp_iw_ordered (STRING1, STRING2) <= 0
5277 compare_names (STRING1, STRING2) <= 0
5279 (they may differ as to what symbols compare equal). */
5282 compare_names (const char *string1
, const char *string2
)
5286 /* Similar to what strcmp_iw_ordered does, we need to perform
5287 a case-insensitive comparison first, and only resort to
5288 a second, case-sensitive, comparison if the first one was
5289 not sufficient to differentiate the two strings. */
5291 result
= compare_names_with_case (string1
, string2
, case_sensitive_off
);
5293 result
= compare_names_with_case (string1
, string2
, case_sensitive_on
);
5298 /* Add to OBSTACKP all non-local symbols whose name and domain match
5299 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5300 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5303 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5304 domain_enum domain
, int global
,
5307 struct objfile
*objfile
;
5308 struct match_data data
;
5310 memset (&data
, 0, sizeof data
);
5311 data
.obstackp
= obstackp
;
5313 ALL_OBJFILES (objfile
)
5315 data
.objfile
= objfile
;
5318 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5319 aux_add_nonlocal_symbols
, &data
,
5322 objfile
->sf
->qf
->map_matching_symbols (objfile
, name
, domain
, global
,
5323 aux_add_nonlocal_symbols
, &data
,
5324 full_match
, compare_names
);
5327 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5329 ALL_OBJFILES (objfile
)
5331 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5332 strcpy (name1
, "_ada_");
5333 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5334 data
.objfile
= objfile
;
5335 objfile
->sf
->qf
->map_matching_symbols (objfile
, name1
, domain
,
5337 aux_add_nonlocal_symbols
,
5339 full_match
, compare_names
);
5344 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and, if full_search is
5345 non-zero, enclosing scope and in global scopes, returning the number of
5347 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5348 indicating the symbols found and the blocks and symbol tables (if
5349 any) in which they were found. This vector is transient---good only to
5350 the next call of ada_lookup_symbol_list.
5352 When full_search is non-zero, any non-function/non-enumeral
5353 symbol match within the nest of blocks whose innermost member is BLOCK0,
5354 is the one match returned (no other matches in that or
5355 enclosing blocks is returned). If there are any matches in or
5356 surrounding BLOCK0, then these alone are returned.
5358 Names prefixed with "standard__" are handled specially: "standard__"
5359 is first stripped off, and only static and global symbols are searched. */
5362 ada_lookup_symbol_list_worker (const char *name0
, const struct block
*block0
,
5363 domain_enum
namespace,
5364 struct ada_symbol_info
**results
,
5368 const struct block
*block
;
5370 const int wild_match_p
= should_use_wild_match (name0
);
5374 obstack_free (&symbol_list_obstack
, NULL
);
5375 obstack_init (&symbol_list_obstack
);
5379 /* Search specified block and its superiors. */
5384 /* Special case: If the user specifies a symbol name inside package
5385 Standard, do a non-wild matching of the symbol name without
5386 the "standard__" prefix. This was primarily introduced in order
5387 to allow the user to specifically access the standard exceptions
5388 using, for instance, Standard.Constraint_Error when Constraint_Error
5389 is ambiguous (due to the user defining its own Constraint_Error
5390 entity inside its program). */
5391 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5394 name
= name0
+ sizeof ("standard__") - 1;
5397 /* Check the non-global symbols. If we have ANY match, then we're done. */
5403 ada_add_local_symbols (&symbol_list_obstack
, name
, block
,
5404 namespace, wild_match_p
);
5408 /* In the !full_search case we're are being called by
5409 ada_iterate_over_symbols, and we don't want to search
5411 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
5412 namespace, NULL
, wild_match_p
);
5414 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5418 /* No non-global symbols found. Check our cache to see if we have
5419 already performed this search before. If we have, then return
5423 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5426 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5430 /* Search symbols from all global blocks. */
5432 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5435 /* Now add symbols from all per-file blocks if we've gotten no hits
5436 (not strictly correct, but perhaps better than an error). */
5438 if (num_defns_collected (&symbol_list_obstack
) == 0)
5439 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5443 ndefns
= num_defns_collected (&symbol_list_obstack
);
5444 *results
= defns_collected (&symbol_list_obstack
, 1);
5446 ndefns
= remove_extra_symbols (*results
, ndefns
);
5448 if (ndefns
== 0 && full_search
)
5449 cache_symbol (name0
, namespace, NULL
, NULL
);
5451 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5452 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5454 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5459 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing scope and
5460 in global scopes, returning the number of matches, and setting *RESULTS
5461 to a vector of (SYM,BLOCK) tuples.
5462 See ada_lookup_symbol_list_worker for further details. */
5465 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5466 domain_enum domain
, struct ada_symbol_info
**results
)
5468 return ada_lookup_symbol_list_worker (name0
, block0
, domain
, results
, 1);
5471 /* Implementation of the la_iterate_over_symbols method. */
5474 ada_iterate_over_symbols (const struct block
*block
,
5475 const char *name
, domain_enum domain
,
5476 symbol_found_callback_ftype
*callback
,
5480 struct ada_symbol_info
*results
;
5482 ndefs
= ada_lookup_symbol_list_worker (name
, block
, domain
, &results
, 0);
5483 for (i
= 0; i
< ndefs
; ++i
)
5485 if (! (*callback
) (results
[i
].sym
, data
))
5490 /* If NAME is the name of an entity, return a string that should
5491 be used to look that entity up in Ada units. This string should
5492 be deallocated after use using xfree.
5494 NAME can have any form that the "break" or "print" commands might
5495 recognize. In other words, it does not have to be the "natural"
5496 name, or the "encoded" name. */
5499 ada_name_for_lookup (const char *name
)
5502 int nlen
= strlen (name
);
5504 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5506 canon
= xmalloc (nlen
- 1);
5507 memcpy (canon
, name
+ 1, nlen
- 2);
5508 canon
[nlen
- 2] = '\0';
5511 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5515 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5516 to 1, but choosing the first symbol found if there are multiple
5519 The result is stored in *INFO, which must be non-NULL.
5520 If no match is found, INFO->SYM is set to NULL. */
5523 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5524 domain_enum
namespace,
5525 struct ada_symbol_info
*info
)
5527 struct ada_symbol_info
*candidates
;
5530 gdb_assert (info
!= NULL
);
5531 memset (info
, 0, sizeof (struct ada_symbol_info
));
5533 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
);
5534 if (n_candidates
== 0)
5537 *info
= candidates
[0];
5538 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5541 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5542 scope and in global scopes, or NULL if none. NAME is folded and
5543 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5544 choosing the first symbol if there are multiple choices.
5545 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5548 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5549 domain_enum
namespace, int *is_a_field_of_this
)
5551 struct ada_symbol_info info
;
5553 if (is_a_field_of_this
!= NULL
)
5554 *is_a_field_of_this
= 0;
5556 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5557 block0
, namespace, &info
);
5561 static struct symbol
*
5562 ada_lookup_symbol_nonlocal (const char *name
,
5563 const struct block
*block
,
5564 const domain_enum domain
)
5566 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5570 /* True iff STR is a possible encoded suffix of a normal Ada name
5571 that is to be ignored for matching purposes. Suffixes of parallel
5572 names (e.g., XVE) are not included here. Currently, the possible suffixes
5573 are given by any of the regular expressions:
5575 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5576 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5577 TKB [subprogram suffix for task bodies]
5578 _E[0-9]+[bs]$ [protected object entry suffixes]
5579 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5581 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5582 match is performed. This sequence is used to differentiate homonyms,
5583 is an optional part of a valid name suffix. */
5586 is_name_suffix (const char *str
)
5589 const char *matching
;
5590 const int len
= strlen (str
);
5592 /* Skip optional leading __[0-9]+. */
5594 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5597 while (isdigit (str
[0]))
5603 if (str
[0] == '.' || str
[0] == '$')
5606 while (isdigit (matching
[0]))
5608 if (matching
[0] == '\0')
5614 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5617 while (isdigit (matching
[0]))
5619 if (matching
[0] == '\0')
5623 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5625 if (strcmp (str
, "TKB") == 0)
5629 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5630 with a N at the end. Unfortunately, the compiler uses the same
5631 convention for other internal types it creates. So treating
5632 all entity names that end with an "N" as a name suffix causes
5633 some regressions. For instance, consider the case of an enumerated
5634 type. To support the 'Image attribute, it creates an array whose
5636 Having a single character like this as a suffix carrying some
5637 information is a bit risky. Perhaps we should change the encoding
5638 to be something like "_N" instead. In the meantime, do not do
5639 the following check. */
5640 /* Protected Object Subprograms */
5641 if (len
== 1 && str
[0] == 'N')
5646 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5649 while (isdigit (matching
[0]))
5651 if ((matching
[0] == 'b' || matching
[0] == 's')
5652 && matching
[1] == '\0')
5656 /* ??? We should not modify STR directly, as we are doing below. This
5657 is fine in this case, but may become problematic later if we find
5658 that this alternative did not work, and want to try matching
5659 another one from the begining of STR. Since we modified it, we
5660 won't be able to find the begining of the string anymore! */
5664 while (str
[0] != '_' && str
[0] != '\0')
5666 if (str
[0] != 'n' && str
[0] != 'b')
5672 if (str
[0] == '\000')
5677 if (str
[1] != '_' || str
[2] == '\000')
5681 if (strcmp (str
+ 3, "JM") == 0)
5683 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5684 the LJM suffix in favor of the JM one. But we will
5685 still accept LJM as a valid suffix for a reasonable
5686 amount of time, just to allow ourselves to debug programs
5687 compiled using an older version of GNAT. */
5688 if (strcmp (str
+ 3, "LJM") == 0)
5692 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5693 || str
[4] == 'U' || str
[4] == 'P')
5695 if (str
[4] == 'R' && str
[5] != 'T')
5699 if (!isdigit (str
[2]))
5701 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5702 if (!isdigit (str
[k
]) && str
[k
] != '_')
5706 if (str
[0] == '$' && isdigit (str
[1]))
5708 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5709 if (!isdigit (str
[k
]) && str
[k
] != '_')
5716 /* Return non-zero if the string starting at NAME and ending before
5717 NAME_END contains no capital letters. */
5720 is_valid_name_for_wild_match (const char *name0
)
5722 const char *decoded_name
= ada_decode (name0
);
5725 /* If the decoded name starts with an angle bracket, it means that
5726 NAME0 does not follow the GNAT encoding format. It should then
5727 not be allowed as a possible wild match. */
5728 if (decoded_name
[0] == '<')
5731 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5732 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5738 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5739 that could start a simple name. Assumes that *NAMEP points into
5740 the string beginning at NAME0. */
5743 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5745 const char *name
= *namep
;
5755 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5758 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5763 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5764 || name
[2] == target0
))
5772 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5782 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5783 informational suffixes of NAME (i.e., for which is_name_suffix is
5784 true). Assumes that PATN is a lower-cased Ada simple name. */
5787 wild_match (const char *name
, const char *patn
)
5790 const char *name0
= name
;
5794 const char *match
= name
;
5798 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5801 if (*p
== '\0' && is_name_suffix (name
))
5802 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5804 if (name
[-1] == '_')
5807 if (!advance_wild_match (&name
, name0
, *patn
))
5812 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5813 informational suffix. */
5816 full_match (const char *sym_name
, const char *search_name
)
5818 return !match_name (sym_name
, search_name
, 0);
5822 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5823 vector *defn_symbols, updating the list of symbols in OBSTACKP
5824 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5825 OBJFILE is the section containing BLOCK. */
5828 ada_add_block_symbols (struct obstack
*obstackp
,
5829 const struct block
*block
, const char *name
,
5830 domain_enum domain
, struct objfile
*objfile
,
5833 struct block_iterator iter
;
5834 int name_len
= strlen (name
);
5835 /* A matching argument symbol, if any. */
5836 struct symbol
*arg_sym
;
5837 /* Set true when we find a matching non-argument symbol. */
5845 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5846 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5848 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5849 SYMBOL_DOMAIN (sym
), domain
)
5850 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5852 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5854 else if (SYMBOL_IS_ARGUMENT (sym
))
5859 add_defn_to_vec (obstackp
,
5860 fixup_symbol_section (sym
, objfile
),
5868 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5869 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5871 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5872 SYMBOL_DOMAIN (sym
), domain
))
5874 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5876 if (SYMBOL_IS_ARGUMENT (sym
))
5881 add_defn_to_vec (obstackp
,
5882 fixup_symbol_section (sym
, objfile
),
5890 if (!found_sym
&& arg_sym
!= NULL
)
5892 add_defn_to_vec (obstackp
,
5893 fixup_symbol_section (arg_sym
, objfile
),
5902 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5904 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5905 SYMBOL_DOMAIN (sym
), domain
))
5909 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5912 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5914 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5919 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5921 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5923 if (SYMBOL_IS_ARGUMENT (sym
))
5928 add_defn_to_vec (obstackp
,
5929 fixup_symbol_section (sym
, objfile
),
5937 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5938 They aren't parameters, right? */
5939 if (!found_sym
&& arg_sym
!= NULL
)
5941 add_defn_to_vec (obstackp
,
5942 fixup_symbol_section (arg_sym
, objfile
),
5949 /* Symbol Completion */
5951 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5952 name in a form that's appropriate for the completion. The result
5953 does not need to be deallocated, but is only good until the next call.
5955 TEXT_LEN is equal to the length of TEXT.
5956 Perform a wild match if WILD_MATCH_P is set.
5957 ENCODED_P should be set if TEXT represents the start of a symbol name
5958 in its encoded form. */
5961 symbol_completion_match (const char *sym_name
,
5962 const char *text
, int text_len
,
5963 int wild_match_p
, int encoded_p
)
5965 const int verbatim_match
= (text
[0] == '<');
5970 /* Strip the leading angle bracket. */
5975 /* First, test against the fully qualified name of the symbol. */
5977 if (strncmp (sym_name
, text
, text_len
) == 0)
5980 if (match
&& !encoded_p
)
5982 /* One needed check before declaring a positive match is to verify
5983 that iff we are doing a verbatim match, the decoded version
5984 of the symbol name starts with '<'. Otherwise, this symbol name
5985 is not a suitable completion. */
5986 const char *sym_name_copy
= sym_name
;
5987 int has_angle_bracket
;
5989 sym_name
= ada_decode (sym_name
);
5990 has_angle_bracket
= (sym_name
[0] == '<');
5991 match
= (has_angle_bracket
== verbatim_match
);
5992 sym_name
= sym_name_copy
;
5995 if (match
&& !verbatim_match
)
5997 /* When doing non-verbatim match, another check that needs to
5998 be done is to verify that the potentially matching symbol name
5999 does not include capital letters, because the ada-mode would
6000 not be able to understand these symbol names without the
6001 angle bracket notation. */
6004 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
6009 /* Second: Try wild matching... */
6011 if (!match
&& wild_match_p
)
6013 /* Since we are doing wild matching, this means that TEXT
6014 may represent an unqualified symbol name. We therefore must
6015 also compare TEXT against the unqualified name of the symbol. */
6016 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
6018 if (strncmp (sym_name
, text
, text_len
) == 0)
6022 /* Finally: If we found a mach, prepare the result to return. */
6028 sym_name
= add_angle_brackets (sym_name
);
6031 sym_name
= ada_decode (sym_name
);
6036 /* A companion function to ada_make_symbol_completion_list().
6037 Check if SYM_NAME represents a symbol which name would be suitable
6038 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
6039 it is appended at the end of the given string vector SV.
6041 ORIG_TEXT is the string original string from the user command
6042 that needs to be completed. WORD is the entire command on which
6043 completion should be performed. These two parameters are used to
6044 determine which part of the symbol name should be added to the
6046 if WILD_MATCH_P is set, then wild matching is performed.
6047 ENCODED_P should be set if TEXT represents a symbol name in its
6048 encoded formed (in which case the completion should also be
6052 symbol_completion_add (VEC(char_ptr
) **sv
,
6053 const char *sym_name
,
6054 const char *text
, int text_len
,
6055 const char *orig_text
, const char *word
,
6056 int wild_match_p
, int encoded_p
)
6058 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
6059 wild_match_p
, encoded_p
);
6065 /* We found a match, so add the appropriate completion to the given
6068 if (word
== orig_text
)
6070 completion
= xmalloc (strlen (match
) + 5);
6071 strcpy (completion
, match
);
6073 else if (word
> orig_text
)
6075 /* Return some portion of sym_name. */
6076 completion
= xmalloc (strlen (match
) + 5);
6077 strcpy (completion
, match
+ (word
- orig_text
));
6081 /* Return some of ORIG_TEXT plus sym_name. */
6082 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
6083 strncpy (completion
, word
, orig_text
- word
);
6084 completion
[orig_text
- word
] = '\0';
6085 strcat (completion
, match
);
6088 VEC_safe_push (char_ptr
, *sv
, completion
);
6091 /* An object of this type is passed as the user_data argument to the
6092 expand_symtabs_matching method. */
6093 struct add_partial_datum
6095 VEC(char_ptr
) **completions
;
6104 /* A callback for expand_symtabs_matching. */
6107 ada_complete_symbol_matcher (const char *name
, void *user_data
)
6109 struct add_partial_datum
*data
= user_data
;
6111 return symbol_completion_match (name
, data
->text
, data
->text_len
,
6112 data
->wild_match
, data
->encoded
) != NULL
;
6115 /* Return a list of possible symbol names completing TEXT0. WORD is
6116 the entire command on which completion is made. */
6118 static VEC (char_ptr
) *
6119 ada_make_symbol_completion_list (const char *text0
, const char *word
,
6120 enum type_code code
)
6126 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
6129 struct minimal_symbol
*msymbol
;
6130 struct objfile
*objfile
;
6131 struct block
*b
, *surrounding_static_block
= 0;
6133 struct block_iterator iter
;
6134 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
6136 gdb_assert (code
== TYPE_CODE_UNDEF
);
6138 if (text0
[0] == '<')
6140 text
= xstrdup (text0
);
6141 make_cleanup (xfree
, text
);
6142 text_len
= strlen (text
);
6148 text
= xstrdup (ada_encode (text0
));
6149 make_cleanup (xfree
, text
);
6150 text_len
= strlen (text
);
6151 for (i
= 0; i
< text_len
; i
++)
6152 text
[i
] = tolower (text
[i
]);
6154 encoded_p
= (strstr (text0
, "__") != NULL
);
6155 /* If the name contains a ".", then the user is entering a fully
6156 qualified entity name, and the match must not be done in wild
6157 mode. Similarly, if the user wants to complete what looks like
6158 an encoded name, the match must not be done in wild mode. */
6159 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
6162 /* First, look at the partial symtab symbols. */
6164 struct add_partial_datum data
;
6166 data
.completions
= &completions
;
6168 data
.text_len
= text_len
;
6171 data
.wild_match
= wild_match_p
;
6172 data
.encoded
= encoded_p
;
6173 expand_symtabs_matching (NULL
, ada_complete_symbol_matcher
, ALL_DOMAIN
,
6177 /* At this point scan through the misc symbol vectors and add each
6178 symbol you find to the list. Eventually we want to ignore
6179 anything that isn't a text symbol (everything else will be
6180 handled by the psymtab code above). */
6182 ALL_MSYMBOLS (objfile
, msymbol
)
6185 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
6186 text
, text_len
, text0
, word
, wild_match_p
,
6190 /* Search upwards from currently selected frame (so that we can
6191 complete on local vars. */
6193 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
6195 if (!BLOCK_SUPERBLOCK (b
))
6196 surrounding_static_block
= b
; /* For elmin of dups */
6198 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6200 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6201 text
, text_len
, text0
, word
,
6202 wild_match_p
, encoded_p
);
6206 /* Go through the symtabs and check the externs and statics for
6207 symbols which match. */
6209 ALL_SYMTABS (objfile
, s
)
6212 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
6213 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6215 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6216 text
, text_len
, text0
, word
,
6217 wild_match_p
, encoded_p
);
6221 ALL_SYMTABS (objfile
, s
)
6224 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
6225 /* Don't do this block twice. */
6226 if (b
== surrounding_static_block
)
6228 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
6230 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
6231 text
, text_len
, text0
, word
,
6232 wild_match_p
, encoded_p
);
6236 do_cleanups (old_chain
);
6242 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6243 for tagged types. */
6246 ada_is_dispatch_table_ptr_type (struct type
*type
)
6250 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
6253 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
6257 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
6260 /* Return non-zero if TYPE is an interface tag. */
6263 ada_is_interface_tag (struct type
*type
)
6265 const char *name
= TYPE_NAME (type
);
6270 return (strcmp (name
, "ada__tags__interface_tag") == 0);
6273 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6274 to be invisible to users. */
6277 ada_is_ignored_field (struct type
*type
, int field_num
)
6279 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6282 /* Check the name of that field. */
6284 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6286 /* Anonymous field names should not be printed.
6287 brobecker/2007-02-20: I don't think this can actually happen
6288 but we don't want to print the value of annonymous fields anyway. */
6292 /* Normally, fields whose name start with an underscore ("_")
6293 are fields that have been internally generated by the compiler,
6294 and thus should not be printed. The "_parent" field is special,
6295 however: This is a field internally generated by the compiler
6296 for tagged types, and it contains the components inherited from
6297 the parent type. This field should not be printed as is, but
6298 should not be ignored either. */
6299 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
6303 /* If this is the dispatch table of a tagged type or an interface tag,
6305 if (ada_is_tagged_type (type
, 1)
6306 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
))
6307 || ada_is_interface_tag (TYPE_FIELD_TYPE (type
, field_num
))))
6310 /* Not a special field, so it should not be ignored. */
6314 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6315 pointer or reference type whose ultimate target has a tag field. */
6318 ada_is_tagged_type (struct type
*type
, int refok
)
6320 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6323 /* True iff TYPE represents the type of X'Tag */
6326 ada_is_tag_type (struct type
*type
)
6328 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6332 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6334 return (name
!= NULL
6335 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6339 /* The type of the tag on VAL. */
6342 ada_tag_type (struct value
*val
)
6344 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6347 /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6348 retired at Ada 05). */
6351 is_ada95_tag (struct value
*tag
)
6353 return ada_value_struct_elt (tag
, "tsd", 1) != NULL
;
6356 /* The value of the tag on VAL. */
6359 ada_value_tag (struct value
*val
)
6361 return ada_value_struct_elt (val
, "_tag", 0);
6364 /* The value of the tag on the object of type TYPE whose contents are
6365 saved at VALADDR, if it is non-null, or is at memory address
6368 static struct value
*
6369 value_tag_from_contents_and_address (struct type
*type
,
6370 const gdb_byte
*valaddr
,
6373 int tag_byte_offset
;
6374 struct type
*tag_type
;
6376 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6379 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6381 : valaddr
+ tag_byte_offset
);
6382 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6384 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6389 static struct type
*
6390 type_from_tag (struct value
*tag
)
6392 const char *type_name
= ada_tag_name (tag
);
6394 if (type_name
!= NULL
)
6395 return ada_find_any_type (ada_encode (type_name
));
6399 /* Given a value OBJ of a tagged type, return a value of this
6400 type at the base address of the object. The base address, as
6401 defined in Ada.Tags, it is the address of the primary tag of
6402 the object, and therefore where the field values of its full
6403 view can be fetched. */
6406 ada_tag_value_at_base_address (struct value
*obj
)
6408 volatile struct gdb_exception e
;
6410 LONGEST offset_to_top
= 0;
6411 struct type
*ptr_type
, *obj_type
;
6413 CORE_ADDR base_address
;
6415 obj_type
= value_type (obj
);
6417 /* It is the responsability of the caller to deref pointers. */
6419 if (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
6420 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
)
6423 tag
= ada_value_tag (obj
);
6427 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6429 if (is_ada95_tag (tag
))
6432 ptr_type
= builtin_type (target_gdbarch ())->builtin_data_ptr
;
6433 ptr_type
= lookup_pointer_type (ptr_type
);
6434 val
= value_cast (ptr_type
, tag
);
6438 /* It is perfectly possible that an exception be raised while
6439 trying to determine the base address, just like for the tag;
6440 see ada_tag_name for more details. We do not print the error
6441 message for the same reason. */
6443 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6445 offset_to_top
= value_as_long (value_ind (value_ptradd (val
, -2)));
6451 /* If offset is null, nothing to do. */
6453 if (offset_to_top
== 0)
6456 /* -1 is a special case in Ada.Tags; however, what should be done
6457 is not quite clear from the documentation. So do nothing for
6460 if (offset_to_top
== -1)
6463 base_address
= value_address (obj
) - offset_to_top
;
6464 tag
= value_tag_from_contents_and_address (obj_type
, NULL
, base_address
);
6466 /* Make sure that we have a proper tag at the new address.
6467 Otherwise, offset_to_top is bogus (which can happen when
6468 the object is not initialized yet). */
6473 obj_type
= type_from_tag (tag
);
6478 return value_from_contents_and_address (obj_type
, NULL
, base_address
);
6481 /* Return the "ada__tags__type_specific_data" type. */
6483 static struct type
*
6484 ada_get_tsd_type (struct inferior
*inf
)
6486 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6488 if (data
->tsd_type
== 0)
6489 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6490 return data
->tsd_type
;
6493 /* Return the TSD (type-specific data) associated to the given TAG.
6494 TAG is assumed to be the tag of a tagged-type entity.
6496 May return NULL if we are unable to get the TSD. */
6498 static struct value
*
6499 ada_get_tsd_from_tag (struct value
*tag
)
6504 /* First option: The TSD is simply stored as a field of our TAG.
6505 Only older versions of GNAT would use this format, but we have
6506 to test it first, because there are no visible markers for
6507 the current approach except the absence of that field. */
6509 val
= ada_value_struct_elt (tag
, "tsd", 1);
6513 /* Try the second representation for the dispatch table (in which
6514 there is no explicit 'tsd' field in the referent of the tag pointer,
6515 and instead the tsd pointer is stored just before the dispatch
6518 type
= ada_get_tsd_type (current_inferior());
6521 type
= lookup_pointer_type (lookup_pointer_type (type
));
6522 val
= value_cast (type
, tag
);
6525 return value_ind (value_ptradd (val
, -1));
6528 /* Given the TSD of a tag (type-specific data), return a string
6529 containing the name of the associated type.
6531 The returned value is good until the next call. May return NULL
6532 if we are unable to determine the tag name. */
6535 ada_tag_name_from_tsd (struct value
*tsd
)
6537 static char name
[1024];
6541 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6544 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6545 for (p
= name
; *p
!= '\0'; p
+= 1)
6551 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6554 Return NULL if the TAG is not an Ada tag, or if we were unable to
6555 determine the name of that tag. The result is good until the next
6559 ada_tag_name (struct value
*tag
)
6561 volatile struct gdb_exception e
;
6564 if (!ada_is_tag_type (value_type (tag
)))
6567 /* It is perfectly possible that an exception be raised while trying
6568 to determine the TAG's name, even under normal circumstances:
6569 The associated variable may be uninitialized or corrupted, for
6570 instance. We do not let any exception propagate past this point.
6571 instead we return NULL.
6573 We also do not print the error message either (which often is very
6574 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6575 the caller print a more meaningful message if necessary. */
6576 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6578 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6581 name
= ada_tag_name_from_tsd (tsd
);
6587 /* The parent type of TYPE, or NULL if none. */
6590 ada_parent_type (struct type
*type
)
6594 type
= ada_check_typedef (type
);
6596 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6599 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6600 if (ada_is_parent_field (type
, i
))
6602 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6604 /* If the _parent field is a pointer, then dereference it. */
6605 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6606 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6607 /* If there is a parallel XVS type, get the actual base type. */
6608 parent_type
= ada_get_base_type (parent_type
);
6610 return ada_check_typedef (parent_type
);
6616 /* True iff field number FIELD_NUM of structure type TYPE contains the
6617 parent-type (inherited) fields of a derived type. Assumes TYPE is
6618 a structure type with at least FIELD_NUM+1 fields. */
6621 ada_is_parent_field (struct type
*type
, int field_num
)
6623 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6625 return (name
!= NULL
6626 && (strncmp (name
, "PARENT", 6) == 0
6627 || strncmp (name
, "_parent", 7) == 0));
6630 /* True iff field number FIELD_NUM of structure type TYPE is a
6631 transparent wrapper field (which should be silently traversed when doing
6632 field selection and flattened when printing). Assumes TYPE is a
6633 structure type with at least FIELD_NUM+1 fields. Such fields are always
6637 ada_is_wrapper_field (struct type
*type
, int field_num
)
6639 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6641 return (name
!= NULL
6642 && (strncmp (name
, "PARENT", 6) == 0
6643 || strcmp (name
, "REP") == 0
6644 || strncmp (name
, "_parent", 7) == 0
6645 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6648 /* True iff field number FIELD_NUM of structure or union type TYPE
6649 is a variant wrapper. Assumes TYPE is a structure type with at least
6650 FIELD_NUM+1 fields. */
6653 ada_is_variant_part (struct type
*type
, int field_num
)
6655 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6657 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6658 || (is_dynamic_field (type
, field_num
)
6659 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6660 == TYPE_CODE_UNION
)));
6663 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6664 whose discriminants are contained in the record type OUTER_TYPE,
6665 returns the type of the controlling discriminant for the variant.
6666 May return NULL if the type could not be found. */
6669 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6671 char *name
= ada_variant_discrim_name (var_type
);
6673 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6676 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6677 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6678 represents a 'when others' clause; otherwise 0. */
6681 ada_is_others_clause (struct type
*type
, int field_num
)
6683 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6685 return (name
!= NULL
&& name
[0] == 'O');
6688 /* Assuming that TYPE0 is the type of the variant part of a record,
6689 returns the name of the discriminant controlling the variant.
6690 The value is valid until the next call to ada_variant_discrim_name. */
6693 ada_variant_discrim_name (struct type
*type0
)
6695 static char *result
= NULL
;
6696 static size_t result_len
= 0;
6699 const char *discrim_end
;
6700 const char *discrim_start
;
6702 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6703 type
= TYPE_TARGET_TYPE (type0
);
6707 name
= ada_type_name (type
);
6709 if (name
== NULL
|| name
[0] == '\000')
6712 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6715 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6718 if (discrim_end
== name
)
6721 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6724 if (discrim_start
== name
+ 1)
6726 if ((discrim_start
> name
+ 3
6727 && strncmp (discrim_start
- 3, "___", 3) == 0)
6728 || discrim_start
[-1] == '.')
6732 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6733 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6734 result
[discrim_end
- discrim_start
] = '\0';
6738 /* Scan STR for a subtype-encoded number, beginning at position K.
6739 Put the position of the character just past the number scanned in
6740 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6741 Return 1 if there was a valid number at the given position, and 0
6742 otherwise. A "subtype-encoded" number consists of the absolute value
6743 in decimal, followed by the letter 'm' to indicate a negative number.
6744 Assumes 0m does not occur. */
6747 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6751 if (!isdigit (str
[k
]))
6754 /* Do it the hard way so as not to make any assumption about
6755 the relationship of unsigned long (%lu scan format code) and
6758 while (isdigit (str
[k
]))
6760 RU
= RU
* 10 + (str
[k
] - '0');
6767 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6773 /* NOTE on the above: Technically, C does not say what the results of
6774 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6775 number representable as a LONGEST (although either would probably work
6776 in most implementations). When RU>0, the locution in the then branch
6777 above is always equivalent to the negative of RU. */
6784 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6785 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6786 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6789 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6791 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6805 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6815 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6816 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6818 if (val
>= L
&& val
<= U
)
6830 /* FIXME: Lots of redundancy below. Try to consolidate. */
6832 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6833 ARG_TYPE, extract and return the value of one of its (non-static)
6834 fields. FIELDNO says which field. Differs from value_primitive_field
6835 only in that it can handle packed values of arbitrary type. */
6837 static struct value
*
6838 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6839 struct type
*arg_type
)
6843 arg_type
= ada_check_typedef (arg_type
);
6844 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6846 /* Handle packed fields. */
6848 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6850 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6851 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6853 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6854 offset
+ bit_pos
/ 8,
6855 bit_pos
% 8, bit_size
, type
);
6858 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6861 /* Find field with name NAME in object of type TYPE. If found,
6862 set the following for each argument that is non-null:
6863 - *FIELD_TYPE_P to the field's type;
6864 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6865 an object of that type;
6866 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6867 - *BIT_SIZE_P to its size in bits if the field is packed, and
6869 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6870 fields up to but not including the desired field, or by the total
6871 number of fields if not found. A NULL value of NAME never
6872 matches; the function just counts visible fields in this case.
6874 Returns 1 if found, 0 otherwise. */
6877 find_struct_field (const char *name
, struct type
*type
, int offset
,
6878 struct type
**field_type_p
,
6879 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6884 type
= ada_check_typedef (type
);
6886 if (field_type_p
!= NULL
)
6887 *field_type_p
= NULL
;
6888 if (byte_offset_p
!= NULL
)
6890 if (bit_offset_p
!= NULL
)
6892 if (bit_size_p
!= NULL
)
6895 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6897 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6898 int fld_offset
= offset
+ bit_pos
/ 8;
6899 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6901 if (t_field_name
== NULL
)
6904 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6906 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6908 if (field_type_p
!= NULL
)
6909 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6910 if (byte_offset_p
!= NULL
)
6911 *byte_offset_p
= fld_offset
;
6912 if (bit_offset_p
!= NULL
)
6913 *bit_offset_p
= bit_pos
% 8;
6914 if (bit_size_p
!= NULL
)
6915 *bit_size_p
= bit_size
;
6918 else if (ada_is_wrapper_field (type
, i
))
6920 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6921 field_type_p
, byte_offset_p
, bit_offset_p
,
6922 bit_size_p
, index_p
))
6925 else if (ada_is_variant_part (type
, i
))
6927 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6930 struct type
*field_type
6931 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6933 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6935 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6937 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6938 field_type_p
, byte_offset_p
,
6939 bit_offset_p
, bit_size_p
, index_p
))
6943 else if (index_p
!= NULL
)
6949 /* Number of user-visible fields in record type TYPE. */
6952 num_visible_fields (struct type
*type
)
6957 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6961 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6962 and search in it assuming it has (class) type TYPE.
6963 If found, return value, else return NULL.
6965 Searches recursively through wrapper fields (e.g., '_parent'). */
6967 static struct value
*
6968 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6973 type
= ada_check_typedef (type
);
6974 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6976 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6978 if (t_field_name
== NULL
)
6981 else if (field_name_match (t_field_name
, name
))
6982 return ada_value_primitive_field (arg
, offset
, i
, type
);
6984 else if (ada_is_wrapper_field (type
, i
))
6986 struct value
*v
= /* Do not let indent join lines here. */
6987 ada_search_struct_field (name
, arg
,
6988 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6989 TYPE_FIELD_TYPE (type
, i
));
6995 else if (ada_is_variant_part (type
, i
))
6997 /* PNH: Do we ever get here? See find_struct_field. */
6999 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7001 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7003 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
7005 struct value
*v
= ada_search_struct_field
/* Force line
7008 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
7009 TYPE_FIELD_TYPE (field_type
, j
));
7019 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
7020 int, struct type
*);
7023 /* Return field #INDEX in ARG, where the index is that returned by
7024 * find_struct_field through its INDEX_P argument. Adjust the address
7025 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
7026 * If found, return value, else return NULL. */
7028 static struct value
*
7029 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
7032 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
7036 /* Auxiliary function for ada_index_struct_field. Like
7037 * ada_index_struct_field, but takes index from *INDEX_P and modifies
7040 static struct value
*
7041 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
7045 type
= ada_check_typedef (type
);
7047 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7049 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
7051 else if (ada_is_wrapper_field (type
, i
))
7053 struct value
*v
= /* Do not let indent join lines here. */
7054 ada_index_struct_field_1 (index_p
, arg
,
7055 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
7056 TYPE_FIELD_TYPE (type
, i
));
7062 else if (ada_is_variant_part (type
, i
))
7064 /* PNH: Do we ever get here? See ada_search_struct_field,
7065 find_struct_field. */
7066 error (_("Cannot assign this kind of variant record"));
7068 else if (*index_p
== 0)
7069 return ada_value_primitive_field (arg
, offset
, i
, type
);
7076 /* Given ARG, a value of type (pointer or reference to a)*
7077 structure/union, extract the component named NAME from the ultimate
7078 target structure/union and return it as a value with its
7081 The routine searches for NAME among all members of the structure itself
7082 and (recursively) among all members of any wrapper members
7085 If NO_ERR, then simply return NULL in case of error, rather than
7089 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
7091 struct type
*t
, *t1
;
7095 t1
= t
= ada_check_typedef (value_type (arg
));
7096 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7098 t1
= TYPE_TARGET_TYPE (t
);
7101 t1
= ada_check_typedef (t1
);
7102 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7104 arg
= coerce_ref (arg
);
7109 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7111 t1
= TYPE_TARGET_TYPE (t
);
7114 t1
= ada_check_typedef (t1
);
7115 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7117 arg
= value_ind (arg
);
7124 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7128 v
= ada_search_struct_field (name
, arg
, 0, t
);
7131 int bit_offset
, bit_size
, byte_offset
;
7132 struct type
*field_type
;
7135 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7136 address
= value_address (ada_value_ind (arg
));
7138 address
= value_address (ada_coerce_ref (arg
));
7140 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
7141 if (find_struct_field (name
, t1
, 0,
7142 &field_type
, &byte_offset
, &bit_offset
,
7147 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
7148 arg
= ada_coerce_ref (arg
);
7150 arg
= ada_value_ind (arg
);
7151 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7152 bit_offset
, bit_size
,
7156 v
= value_at_lazy (field_type
, address
+ byte_offset
);
7160 if (v
!= NULL
|| no_err
)
7163 error (_("There is no member named %s."), name
);
7169 error (_("Attempt to extract a component of "
7170 "a value that is not a record."));
7173 /* Given a type TYPE, look up the type of the component of type named NAME.
7174 If DISPP is non-null, add its byte displacement from the beginning of a
7175 structure (pointed to by a value) of type TYPE to *DISPP (does not
7176 work for packed fields).
7178 Matches any field whose name has NAME as a prefix, possibly
7181 TYPE can be either a struct or union. If REFOK, TYPE may also
7182 be a (pointer or reference)+ to a struct or union, and the
7183 ultimate target type will be searched.
7185 Looks recursively into variant clauses and parent types.
7187 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7188 TYPE is not a type of the right kind. */
7190 static struct type
*
7191 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7192 int noerr
, int *dispp
)
7199 if (refok
&& type
!= NULL
)
7202 type
= ada_check_typedef (type
);
7203 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7204 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7206 type
= TYPE_TARGET_TYPE (type
);
7210 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
7211 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
7217 target_terminal_ours ();
7218 gdb_flush (gdb_stdout
);
7220 error (_("Type (null) is not a structure or union type"));
7223 /* XXX: type_sprint */
7224 fprintf_unfiltered (gdb_stderr
, _("Type "));
7225 type_print (type
, "", gdb_stderr
, -1);
7226 error (_(" is not a structure or union type"));
7231 type
= to_static_fixed_type (type
);
7233 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7235 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7239 if (t_field_name
== NULL
)
7242 else if (field_name_match (t_field_name
, name
))
7245 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7246 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
7249 else if (ada_is_wrapper_field (type
, i
))
7252 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7257 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7262 else if (ada_is_variant_part (type
, i
))
7265 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
7268 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7270 /* FIXME pnh 2008/01/26: We check for a field that is
7271 NOT wrapped in a struct, since the compiler sometimes
7272 generates these for unchecked variant types. Revisit
7273 if the compiler changes this practice. */
7274 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
7276 if (v_field_name
!= NULL
7277 && field_name_match (v_field_name
, name
))
7278 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
7280 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
7287 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7298 target_terminal_ours ();
7299 gdb_flush (gdb_stdout
);
7302 /* XXX: type_sprint */
7303 fprintf_unfiltered (gdb_stderr
, _("Type "));
7304 type_print (type
, "", gdb_stderr
, -1);
7305 error (_(" has no component named <null>"));
7309 /* XXX: type_sprint */
7310 fprintf_unfiltered (gdb_stderr
, _("Type "));
7311 type_print (type
, "", gdb_stderr
, -1);
7312 error (_(" has no component named %s"), name
);
7319 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7320 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7321 represents an unchecked union (that is, the variant part of a
7322 record that is named in an Unchecked_Union pragma). */
7325 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
7327 char *discrim_name
= ada_variant_discrim_name (var_type
);
7329 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
7334 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7335 within a value of type OUTER_TYPE that is stored in GDB at
7336 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7337 numbering from 0) is applicable. Returns -1 if none are. */
7340 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7341 const gdb_byte
*outer_valaddr
)
7345 char *discrim_name
= ada_variant_discrim_name (var_type
);
7346 struct value
*outer
;
7347 struct value
*discrim
;
7348 LONGEST discrim_val
;
7350 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
7351 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
7352 if (discrim
== NULL
)
7354 discrim_val
= value_as_long (discrim
);
7357 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7359 if (ada_is_others_clause (var_type
, i
))
7361 else if (ada_in_variant (discrim_val
, var_type
, i
))
7365 return others_clause
;
7370 /* Dynamic-Sized Records */
7372 /* Strategy: The type ostensibly attached to a value with dynamic size
7373 (i.e., a size that is not statically recorded in the debugging
7374 data) does not accurately reflect the size or layout of the value.
7375 Our strategy is to convert these values to values with accurate,
7376 conventional types that are constructed on the fly. */
7378 /* There is a subtle and tricky problem here. In general, we cannot
7379 determine the size of dynamic records without its data. However,
7380 the 'struct value' data structure, which GDB uses to represent
7381 quantities in the inferior process (the target), requires the size
7382 of the type at the time of its allocation in order to reserve space
7383 for GDB's internal copy of the data. That's why the
7384 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7385 rather than struct value*s.
7387 However, GDB's internal history variables ($1, $2, etc.) are
7388 struct value*s containing internal copies of the data that are not, in
7389 general, the same as the data at their corresponding addresses in
7390 the target. Fortunately, the types we give to these values are all
7391 conventional, fixed-size types (as per the strategy described
7392 above), so that we don't usually have to perform the
7393 'to_fixed_xxx_type' conversions to look at their values.
7394 Unfortunately, there is one exception: if one of the internal
7395 history variables is an array whose elements are unconstrained
7396 records, then we will need to create distinct fixed types for each
7397 element selected. */
7399 /* The upshot of all of this is that many routines take a (type, host
7400 address, target address) triple as arguments to represent a value.
7401 The host address, if non-null, is supposed to contain an internal
7402 copy of the relevant data; otherwise, the program is to consult the
7403 target at the target address. */
7405 /* Assuming that VAL0 represents a pointer value, the result of
7406 dereferencing it. Differs from value_ind in its treatment of
7407 dynamic-sized types. */
7410 ada_value_ind (struct value
*val0
)
7412 struct value
*val
= value_ind (val0
);
7414 if (ada_is_tagged_type (value_type (val
), 0))
7415 val
= ada_tag_value_at_base_address (val
);
7417 return ada_to_fixed_value (val
);
7420 /* The value resulting from dereferencing any "reference to"
7421 qualifiers on VAL0. */
7423 static struct value
*
7424 ada_coerce_ref (struct value
*val0
)
7426 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7428 struct value
*val
= val0
;
7430 val
= coerce_ref (val
);
7432 if (ada_is_tagged_type (value_type (val
), 0))
7433 val
= ada_tag_value_at_base_address (val
);
7435 return ada_to_fixed_value (val
);
7441 /* Return OFF rounded upward if necessary to a multiple of
7442 ALIGNMENT (a power of 2). */
7445 align_value (unsigned int off
, unsigned int alignment
)
7447 return (off
+ alignment
- 1) & ~(alignment
- 1);
7450 /* Return the bit alignment required for field #F of template type TYPE. */
7453 field_alignment (struct type
*type
, int f
)
7455 const char *name
= TYPE_FIELD_NAME (type
, f
);
7459 /* The field name should never be null, unless the debugging information
7460 is somehow malformed. In this case, we assume the field does not
7461 require any alignment. */
7465 len
= strlen (name
);
7467 if (!isdigit (name
[len
- 1]))
7470 if (isdigit (name
[len
- 2]))
7471 align_offset
= len
- 2;
7473 align_offset
= len
- 1;
7475 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7476 return TARGET_CHAR_BIT
;
7478 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7481 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7483 static struct symbol
*
7484 ada_find_any_type_symbol (const char *name
)
7488 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7489 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7492 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7496 /* Find a type named NAME. Ignores ambiguity. This routine will look
7497 solely for types defined by debug info, it will not search the GDB
7500 static struct type
*
7501 ada_find_any_type (const char *name
)
7503 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7506 return SYMBOL_TYPE (sym
);
7511 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7512 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7513 symbol, in which case it is returned. Otherwise, this looks for
7514 symbols whose name is that of NAME_SYM suffixed with "___XR".
7515 Return symbol if found, and NULL otherwise. */
7518 ada_find_renaming_symbol (struct symbol
*name_sym
, const struct block
*block
)
7520 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7523 if (strstr (name
, "___XR") != NULL
)
7526 sym
= find_old_style_renaming_symbol (name
, block
);
7531 /* Not right yet. FIXME pnh 7/20/2007. */
7532 sym
= ada_find_any_type_symbol (name
);
7533 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7539 static struct symbol
*
7540 find_old_style_renaming_symbol (const char *name
, const struct block
*block
)
7542 const struct symbol
*function_sym
= block_linkage_function (block
);
7545 if (function_sym
!= NULL
)
7547 /* If the symbol is defined inside a function, NAME is not fully
7548 qualified. This means we need to prepend the function name
7549 as well as adding the ``___XR'' suffix to build the name of
7550 the associated renaming symbol. */
7551 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7552 /* Function names sometimes contain suffixes used
7553 for instance to qualify nested subprograms. When building
7554 the XR type name, we need to make sure that this suffix is
7555 not included. So do not include any suffix in the function
7556 name length below. */
7557 int function_name_len
= ada_name_prefix_len (function_name
);
7558 const int rename_len
= function_name_len
+ 2 /* "__" */
7559 + strlen (name
) + 6 /* "___XR\0" */ ;
7561 /* Strip the suffix if necessary. */
7562 ada_remove_trailing_digits (function_name
, &function_name_len
);
7563 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7564 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7566 /* Library-level functions are a special case, as GNAT adds
7567 a ``_ada_'' prefix to the function name to avoid namespace
7568 pollution. However, the renaming symbols themselves do not
7569 have this prefix, so we need to skip this prefix if present. */
7570 if (function_name_len
> 5 /* "_ada_" */
7571 && strstr (function_name
, "_ada_") == function_name
)
7574 function_name_len
-= 5;
7577 rename
= (char *) alloca (rename_len
* sizeof (char));
7578 strncpy (rename
, function_name
, function_name_len
);
7579 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7584 const int rename_len
= strlen (name
) + 6;
7586 rename
= (char *) alloca (rename_len
* sizeof (char));
7587 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7590 return ada_find_any_type_symbol (rename
);
7593 /* Because of GNAT encoding conventions, several GDB symbols may match a
7594 given type name. If the type denoted by TYPE0 is to be preferred to
7595 that of TYPE1 for purposes of type printing, return non-zero;
7596 otherwise return 0. */
7599 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7603 else if (type0
== NULL
)
7605 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7607 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7609 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7611 else if (ada_is_constrained_packed_array_type (type0
))
7613 else if (ada_is_array_descriptor_type (type0
)
7614 && !ada_is_array_descriptor_type (type1
))
7618 const char *type0_name
= type_name_no_tag (type0
);
7619 const char *type1_name
= type_name_no_tag (type1
);
7621 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7622 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7628 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7629 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7632 ada_type_name (struct type
*type
)
7636 else if (TYPE_NAME (type
) != NULL
)
7637 return TYPE_NAME (type
);
7639 return TYPE_TAG_NAME (type
);
7642 /* Search the list of "descriptive" types associated to TYPE for a type
7643 whose name is NAME. */
7645 static struct type
*
7646 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7648 struct type
*result
;
7650 if (ada_ignore_descriptive_types_p
)
7653 /* If there no descriptive-type info, then there is no parallel type
7655 if (!HAVE_GNAT_AUX_INFO (type
))
7658 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7659 while (result
!= NULL
)
7661 const char *result_name
= ada_type_name (result
);
7663 if (result_name
== NULL
)
7665 warning (_("unexpected null name on descriptive type"));
7669 /* If the names match, stop. */
7670 if (strcmp (result_name
, name
) == 0)
7673 /* Otherwise, look at the next item on the list, if any. */
7674 if (HAVE_GNAT_AUX_INFO (result
))
7675 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7680 /* If we didn't find a match, see whether this is a packed array. With
7681 older compilers, the descriptive type information is either absent or
7682 irrelevant when it comes to packed arrays so the above lookup fails.
7683 Fall back to using a parallel lookup by name in this case. */
7684 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7685 return ada_find_any_type (name
);
7690 /* Find a parallel type to TYPE with the specified NAME, using the
7691 descriptive type taken from the debugging information, if available,
7692 and otherwise using the (slower) name-based method. */
7694 static struct type
*
7695 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7697 struct type
*result
= NULL
;
7699 if (HAVE_GNAT_AUX_INFO (type
))
7700 result
= find_parallel_type_by_descriptive_type (type
, name
);
7702 result
= ada_find_any_type (name
);
7707 /* Same as above, but specify the name of the parallel type by appending
7708 SUFFIX to the name of TYPE. */
7711 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7714 const char *typename
= ada_type_name (type
);
7717 if (typename
== NULL
)
7720 len
= strlen (typename
);
7722 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7724 strcpy (name
, typename
);
7725 strcpy (name
+ len
, suffix
);
7727 return ada_find_parallel_type_with_name (type
, name
);
7730 /* If TYPE is a variable-size record type, return the corresponding template
7731 type describing its fields. Otherwise, return NULL. */
7733 static struct type
*
7734 dynamic_template_type (struct type
*type
)
7736 type
= ada_check_typedef (type
);
7738 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7739 || ada_type_name (type
) == NULL
)
7743 int len
= strlen (ada_type_name (type
));
7745 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7748 return ada_find_parallel_type (type
, "___XVE");
7752 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7753 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7756 is_dynamic_field (struct type
*templ_type
, int field_num
)
7758 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7761 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7762 && strstr (name
, "___XVL") != NULL
;
7765 /* The index of the variant field of TYPE, or -1 if TYPE does not
7766 represent a variant record type. */
7769 variant_field_index (struct type
*type
)
7773 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7776 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7778 if (ada_is_variant_part (type
, f
))
7784 /* A record type with no fields. */
7786 static struct type
*
7787 empty_record (struct type
*template)
7789 struct type
*type
= alloc_type_copy (template);
7791 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7792 TYPE_NFIELDS (type
) = 0;
7793 TYPE_FIELDS (type
) = NULL
;
7794 INIT_CPLUS_SPECIFIC (type
);
7795 TYPE_NAME (type
) = "<empty>";
7796 TYPE_TAG_NAME (type
) = NULL
;
7797 TYPE_LENGTH (type
) = 0;
7801 /* An ordinary record type (with fixed-length fields) that describes
7802 the value of type TYPE at VALADDR or ADDRESS (see comments at
7803 the beginning of this section) VAL according to GNAT conventions.
7804 DVAL0 should describe the (portion of a) record that contains any
7805 necessary discriminants. It should be NULL if value_type (VAL) is
7806 an outer-level type (i.e., as opposed to a branch of a variant.) A
7807 variant field (unless unchecked) is replaced by a particular branch
7810 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7811 length are not statically known are discarded. As a consequence,
7812 VALADDR, ADDRESS and DVAL0 are ignored.
7814 NOTE: Limitations: For now, we assume that dynamic fields and
7815 variants occupy whole numbers of bytes. However, they need not be
7819 ada_template_to_fixed_record_type_1 (struct type
*type
,
7820 const gdb_byte
*valaddr
,
7821 CORE_ADDR address
, struct value
*dval0
,
7822 int keep_dynamic_fields
)
7824 struct value
*mark
= value_mark ();
7827 int nfields
, bit_len
;
7833 /* Compute the number of fields in this record type that are going
7834 to be processed: unless keep_dynamic_fields, this includes only
7835 fields whose position and length are static will be processed. */
7836 if (keep_dynamic_fields
)
7837 nfields
= TYPE_NFIELDS (type
);
7841 while (nfields
< TYPE_NFIELDS (type
)
7842 && !ada_is_variant_part (type
, nfields
)
7843 && !is_dynamic_field (type
, nfields
))
7847 rtype
= alloc_type_copy (type
);
7848 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7849 INIT_CPLUS_SPECIFIC (rtype
);
7850 TYPE_NFIELDS (rtype
) = nfields
;
7851 TYPE_FIELDS (rtype
) = (struct field
*)
7852 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7853 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7854 TYPE_NAME (rtype
) = ada_type_name (type
);
7855 TYPE_TAG_NAME (rtype
) = NULL
;
7856 TYPE_FIXED_INSTANCE (rtype
) = 1;
7862 for (f
= 0; f
< nfields
; f
+= 1)
7864 off
= align_value (off
, field_alignment (type
, f
))
7865 + TYPE_FIELD_BITPOS (type
, f
);
7866 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7867 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7869 if (ada_is_variant_part (type
, f
))
7874 else if (is_dynamic_field (type
, f
))
7876 const gdb_byte
*field_valaddr
= valaddr
;
7877 CORE_ADDR field_address
= address
;
7878 struct type
*field_type
=
7879 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7883 /* rtype's length is computed based on the run-time
7884 value of discriminants. If the discriminants are not
7885 initialized, the type size may be completely bogus and
7886 GDB may fail to allocate a value for it. So check the
7887 size first before creating the value. */
7889 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7894 /* If the type referenced by this field is an aligner type, we need
7895 to unwrap that aligner type, because its size might not be set.
7896 Keeping the aligner type would cause us to compute the wrong
7897 size for this field, impacting the offset of the all the fields
7898 that follow this one. */
7899 if (ada_is_aligner_type (field_type
))
7901 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7903 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7904 field_address
= cond_offset_target (field_address
, field_offset
);
7905 field_type
= ada_aligned_type (field_type
);
7908 field_valaddr
= cond_offset_host (field_valaddr
,
7909 off
/ TARGET_CHAR_BIT
);
7910 field_address
= cond_offset_target (field_address
,
7911 off
/ TARGET_CHAR_BIT
);
7913 /* Get the fixed type of the field. Note that, in this case,
7914 we do not want to get the real type out of the tag: if
7915 the current field is the parent part of a tagged record,
7916 we will get the tag of the object. Clearly wrong: the real
7917 type of the parent is not the real type of the child. We
7918 would end up in an infinite loop. */
7919 field_type
= ada_get_base_type (field_type
);
7920 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7921 field_address
, dval
, 0);
7922 /* If the field size is already larger than the maximum
7923 object size, then the record itself will necessarily
7924 be larger than the maximum object size. We need to make
7925 this check now, because the size might be so ridiculously
7926 large (due to an uninitialized variable in the inferior)
7927 that it would cause an overflow when adding it to the
7929 check_size (field_type
);
7931 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7932 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7933 /* The multiplication can potentially overflow. But because
7934 the field length has been size-checked just above, and
7935 assuming that the maximum size is a reasonable value,
7936 an overflow should not happen in practice. So rather than
7937 adding overflow recovery code to this already complex code,
7938 we just assume that it's not going to happen. */
7940 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7944 /* Note: If this field's type is a typedef, it is important
7945 to preserve the typedef layer.
7947 Otherwise, we might be transforming a typedef to a fat
7948 pointer (encoding a pointer to an unconstrained array),
7949 into a basic fat pointer (encoding an unconstrained
7950 array). As both types are implemented using the same
7951 structure, the typedef is the only clue which allows us
7952 to distinguish between the two options. Stripping it
7953 would prevent us from printing this field appropriately. */
7954 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7955 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7956 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7958 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7961 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7963 /* We need to be careful of typedefs when computing
7964 the length of our field. If this is a typedef,
7965 get the length of the target type, not the length
7967 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7968 field_type
= ada_typedef_target_type (field_type
);
7971 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7974 if (off
+ fld_bit_len
> bit_len
)
7975 bit_len
= off
+ fld_bit_len
;
7977 TYPE_LENGTH (rtype
) =
7978 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7981 /* We handle the variant part, if any, at the end because of certain
7982 odd cases in which it is re-ordered so as NOT to be the last field of
7983 the record. This can happen in the presence of representation
7985 if (variant_field
>= 0)
7987 struct type
*branch_type
;
7989 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7992 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7997 to_fixed_variant_branch_type
7998 (TYPE_FIELD_TYPE (type
, variant_field
),
7999 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
8000 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
8001 if (branch_type
== NULL
)
8003 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
8004 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8005 TYPE_NFIELDS (rtype
) -= 1;
8009 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8010 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8012 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
8014 if (off
+ fld_bit_len
> bit_len
)
8015 bit_len
= off
+ fld_bit_len
;
8016 TYPE_LENGTH (rtype
) =
8017 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
8021 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8022 should contain the alignment of that record, which should be a strictly
8023 positive value. If null or negative, then something is wrong, most
8024 probably in the debug info. In that case, we don't round up the size
8025 of the resulting type. If this record is not part of another structure,
8026 the current RTYPE length might be good enough for our purposes. */
8027 if (TYPE_LENGTH (type
) <= 0)
8029 if (TYPE_NAME (rtype
))
8030 warning (_("Invalid type size for `%s' detected: %d."),
8031 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
8033 warning (_("Invalid type size for <unnamed> detected: %d."),
8034 TYPE_LENGTH (type
));
8038 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
8039 TYPE_LENGTH (type
));
8042 value_free_to_mark (mark
);
8043 if (TYPE_LENGTH (rtype
) > varsize_limit
)
8044 error (_("record type with dynamic size is larger than varsize-limit"));
8048 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8051 static struct type
*
8052 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
8053 CORE_ADDR address
, struct value
*dval0
)
8055 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
8059 /* An ordinary record type in which ___XVL-convention fields and
8060 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8061 static approximations, containing all possible fields. Uses
8062 no runtime values. Useless for use in values, but that's OK,
8063 since the results are used only for type determinations. Works on both
8064 structs and unions. Representation note: to save space, we memorize
8065 the result of this function in the TYPE_TARGET_TYPE of the
8068 static struct type
*
8069 template_to_static_fixed_type (struct type
*type0
)
8075 if (TYPE_TARGET_TYPE (type0
) != NULL
)
8076 return TYPE_TARGET_TYPE (type0
);
8078 nfields
= TYPE_NFIELDS (type0
);
8081 for (f
= 0; f
< nfields
; f
+= 1)
8083 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
8084 struct type
*new_type
;
8086 if (is_dynamic_field (type0
, f
))
8087 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
8089 new_type
= static_unwrap_type (field_type
);
8090 if (type
== type0
&& new_type
!= field_type
)
8092 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
8093 TYPE_CODE (type
) = TYPE_CODE (type0
);
8094 INIT_CPLUS_SPECIFIC (type
);
8095 TYPE_NFIELDS (type
) = nfields
;
8096 TYPE_FIELDS (type
) = (struct field
*)
8097 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
8098 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
8099 sizeof (struct field
) * nfields
);
8100 TYPE_NAME (type
) = ada_type_name (type0
);
8101 TYPE_TAG_NAME (type
) = NULL
;
8102 TYPE_FIXED_INSTANCE (type
) = 1;
8103 TYPE_LENGTH (type
) = 0;
8105 TYPE_FIELD_TYPE (type
, f
) = new_type
;
8106 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
8111 /* Given an object of type TYPE whose contents are at VALADDR and
8112 whose address in memory is ADDRESS, returns a revision of TYPE,
8113 which should be a non-dynamic-sized record, in which the variant
8114 part, if any, is replaced with the appropriate branch. Looks
8115 for discriminant values in DVAL0, which can be NULL if the record
8116 contains the necessary discriminant values. */
8118 static struct type
*
8119 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
8120 CORE_ADDR address
, struct value
*dval0
)
8122 struct value
*mark
= value_mark ();
8125 struct type
*branch_type
;
8126 int nfields
= TYPE_NFIELDS (type
);
8127 int variant_field
= variant_field_index (type
);
8129 if (variant_field
== -1)
8133 dval
= value_from_contents_and_address (type
, valaddr
, address
);
8137 rtype
= alloc_type_copy (type
);
8138 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
8139 INIT_CPLUS_SPECIFIC (rtype
);
8140 TYPE_NFIELDS (rtype
) = nfields
;
8141 TYPE_FIELDS (rtype
) =
8142 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
8143 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
8144 sizeof (struct field
) * nfields
);
8145 TYPE_NAME (rtype
) = ada_type_name (type
);
8146 TYPE_TAG_NAME (rtype
) = NULL
;
8147 TYPE_FIXED_INSTANCE (rtype
) = 1;
8148 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
8150 branch_type
= to_fixed_variant_branch_type
8151 (TYPE_FIELD_TYPE (type
, variant_field
),
8152 cond_offset_host (valaddr
,
8153 TYPE_FIELD_BITPOS (type
, variant_field
)
8155 cond_offset_target (address
,
8156 TYPE_FIELD_BITPOS (type
, variant_field
)
8157 / TARGET_CHAR_BIT
), dval
);
8158 if (branch_type
== NULL
)
8162 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
8163 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
8164 TYPE_NFIELDS (rtype
) -= 1;
8168 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
8169 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
8170 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
8171 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
8173 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
8175 value_free_to_mark (mark
);
8179 /* An ordinary record type (with fixed-length fields) that describes
8180 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8181 beginning of this section]. Any necessary discriminants' values
8182 should be in DVAL, a record value; it may be NULL if the object
8183 at ADDR itself contains any necessary discriminant values.
8184 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8185 values from the record are needed. Except in the case that DVAL,
8186 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8187 unchecked) is replaced by a particular branch of the variant.
8189 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8190 is questionable and may be removed. It can arise during the
8191 processing of an unconstrained-array-of-record type where all the
8192 variant branches have exactly the same size. This is because in
8193 such cases, the compiler does not bother to use the XVS convention
8194 when encoding the record. I am currently dubious of this
8195 shortcut and suspect the compiler should be altered. FIXME. */
8197 static struct type
*
8198 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
8199 CORE_ADDR address
, struct value
*dval
)
8201 struct type
*templ_type
;
8203 if (TYPE_FIXED_INSTANCE (type0
))
8206 templ_type
= dynamic_template_type (type0
);
8208 if (templ_type
!= NULL
)
8209 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
8210 else if (variant_field_index (type0
) >= 0)
8212 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
8214 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
8219 TYPE_FIXED_INSTANCE (type0
) = 1;
8225 /* An ordinary record type (with fixed-length fields) that describes
8226 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8227 union type. Any necessary discriminants' values should be in DVAL,
8228 a record value. That is, this routine selects the appropriate
8229 branch of the union at ADDR according to the discriminant value
8230 indicated in the union's type name. Returns VAR_TYPE0 itself if
8231 it represents a variant subject to a pragma Unchecked_Union. */
8233 static struct type
*
8234 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
8235 CORE_ADDR address
, struct value
*dval
)
8238 struct type
*templ_type
;
8239 struct type
*var_type
;
8241 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
8242 var_type
= TYPE_TARGET_TYPE (var_type0
);
8244 var_type
= var_type0
;
8246 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
8248 if (templ_type
!= NULL
)
8249 var_type
= templ_type
;
8251 if (is_unchecked_variant (var_type
, value_type (dval
)))
8254 ada_which_variant_applies (var_type
,
8255 value_type (dval
), value_contents (dval
));
8258 return empty_record (var_type
);
8259 else if (is_dynamic_field (var_type
, which
))
8260 return to_fixed_record_type
8261 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
8262 valaddr
, address
, dval
);
8263 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
8265 to_fixed_record_type
8266 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
8268 return TYPE_FIELD_TYPE (var_type
, which
);
8271 /* Assuming that TYPE0 is an array type describing the type of a value
8272 at ADDR, and that DVAL describes a record containing any
8273 discriminants used in TYPE0, returns a type for the value that
8274 contains no dynamic components (that is, no components whose sizes
8275 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8276 true, gives an error message if the resulting type's size is over
8279 static struct type
*
8280 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
8283 struct type
*index_type_desc
;
8284 struct type
*result
;
8285 int constrained_packed_array_p
;
8287 type0
= ada_check_typedef (type0
);
8288 if (TYPE_FIXED_INSTANCE (type0
))
8291 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
8292 if (constrained_packed_array_p
)
8293 type0
= decode_constrained_packed_array_type (type0
);
8295 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
8296 ada_fixup_array_indexes_type (index_type_desc
);
8297 if (index_type_desc
== NULL
)
8299 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
8301 /* NOTE: elt_type---the fixed version of elt_type0---should never
8302 depend on the contents of the array in properly constructed
8304 /* Create a fixed version of the array element type.
8305 We're not providing the address of an element here,
8306 and thus the actual object value cannot be inspected to do
8307 the conversion. This should not be a problem, since arrays of
8308 unconstrained objects are not allowed. In particular, all
8309 the elements of an array of a tagged type should all be of
8310 the same type specified in the debugging info. No need to
8311 consult the object tag. */
8312 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
8314 /* Make sure we always create a new array type when dealing with
8315 packed array types, since we're going to fix-up the array
8316 type length and element bitsize a little further down. */
8317 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
8320 result
= create_array_type (alloc_type_copy (type0
),
8321 elt_type
, TYPE_INDEX_TYPE (type0
));
8326 struct type
*elt_type0
;
8329 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
8330 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8332 /* NOTE: result---the fixed version of elt_type0---should never
8333 depend on the contents of the array in properly constructed
8335 /* Create a fixed version of the array element type.
8336 We're not providing the address of an element here,
8337 and thus the actual object value cannot be inspected to do
8338 the conversion. This should not be a problem, since arrays of
8339 unconstrained objects are not allowed. In particular, all
8340 the elements of an array of a tagged type should all be of
8341 the same type specified in the debugging info. No need to
8342 consult the object tag. */
8344 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
8347 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
8349 struct type
*range_type
=
8350 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
8352 result
= create_array_type (alloc_type_copy (elt_type0
),
8353 result
, range_type
);
8354 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
8356 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
8357 error (_("array type with dynamic size is larger than varsize-limit"));
8360 /* We want to preserve the type name. This can be useful when
8361 trying to get the type name of a value that has already been
8362 printed (for instance, if the user did "print VAR; whatis $". */
8363 TYPE_NAME (result
) = TYPE_NAME (type0
);
8365 if (constrained_packed_array_p
)
8367 /* So far, the resulting type has been created as if the original
8368 type was a regular (non-packed) array type. As a result, the
8369 bitsize of the array elements needs to be set again, and the array
8370 length needs to be recomputed based on that bitsize. */
8371 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
8372 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
8374 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
8375 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
8376 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
8377 TYPE_LENGTH (result
)++;
8380 TYPE_FIXED_INSTANCE (result
) = 1;
8385 /* A standard type (containing no dynamically sized components)
8386 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8387 DVAL describes a record containing any discriminants used in TYPE0,
8388 and may be NULL if there are none, or if the object of type TYPE at
8389 ADDRESS or in VALADDR contains these discriminants.
8391 If CHECK_TAG is not null, in the case of tagged types, this function
8392 attempts to locate the object's tag and use it to compute the actual
8393 type. However, when ADDRESS is null, we cannot use it to determine the
8394 location of the tag, and therefore compute the tagged type's actual type.
8395 So we return the tagged type without consulting the tag. */
8397 static struct type
*
8398 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
8399 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8401 type
= ada_check_typedef (type
);
8402 switch (TYPE_CODE (type
))
8406 case TYPE_CODE_STRUCT
:
8408 struct type
*static_type
= to_static_fixed_type (type
);
8409 struct type
*fixed_record_type
=
8410 to_fixed_record_type (type
, valaddr
, address
, NULL
);
8412 /* If STATIC_TYPE is a tagged type and we know the object's address,
8413 then we can determine its tag, and compute the object's actual
8414 type from there. Note that we have to use the fixed record
8415 type (the parent part of the record may have dynamic fields
8416 and the way the location of _tag is expressed may depend on
8419 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
8422 value_tag_from_contents_and_address
8426 struct type
*real_type
= type_from_tag (tag
);
8428 value_from_contents_and_address (fixed_record_type
,
8431 if (real_type
!= NULL
)
8432 return to_fixed_record_type
8434 value_address (ada_tag_value_at_base_address (obj
)), NULL
);
8437 /* Check to see if there is a parallel ___XVZ variable.
8438 If there is, then it provides the actual size of our type. */
8439 else if (ada_type_name (fixed_record_type
) != NULL
)
8441 const char *name
= ada_type_name (fixed_record_type
);
8442 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8446 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8447 size
= get_int_var_value (xvz_name
, &xvz_found
);
8448 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8450 fixed_record_type
= copy_type (fixed_record_type
);
8451 TYPE_LENGTH (fixed_record_type
) = size
;
8453 /* The FIXED_RECORD_TYPE may have be a stub. We have
8454 observed this when the debugging info is STABS, and
8455 apparently it is something that is hard to fix.
8457 In practice, we don't need the actual type definition
8458 at all, because the presence of the XVZ variable allows us
8459 to assume that there must be a XVS type as well, which we
8460 should be able to use later, when we need the actual type
8463 In the meantime, pretend that the "fixed" type we are
8464 returning is NOT a stub, because this can cause trouble
8465 when using this type to create new types targeting it.
8466 Indeed, the associated creation routines often check
8467 whether the target type is a stub and will try to replace
8468 it, thus using a type with the wrong size. This, in turn,
8469 might cause the new type to have the wrong size too.
8470 Consider the case of an array, for instance, where the size
8471 of the array is computed from the number of elements in
8472 our array multiplied by the size of its element. */
8473 TYPE_STUB (fixed_record_type
) = 0;
8476 return fixed_record_type
;
8478 case TYPE_CODE_ARRAY
:
8479 return to_fixed_array_type (type
, dval
, 1);
8480 case TYPE_CODE_UNION
:
8484 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8488 /* The same as ada_to_fixed_type_1, except that it preserves the type
8489 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8491 The typedef layer needs be preserved in order to differentiate between
8492 arrays and array pointers when both types are implemented using the same
8493 fat pointer. In the array pointer case, the pointer is encoded as
8494 a typedef of the pointer type. For instance, considering:
8496 type String_Access is access String;
8497 S1 : String_Access := null;
8499 To the debugger, S1 is defined as a typedef of type String. But
8500 to the user, it is a pointer. So if the user tries to print S1,
8501 we should not dereference the array, but print the array address
8504 If we didn't preserve the typedef layer, we would lose the fact that
8505 the type is to be presented as a pointer (needs de-reference before
8506 being printed). And we would also use the source-level type name. */
8509 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8510 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8513 struct type
*fixed_type
=
8514 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8516 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8517 then preserve the typedef layer.
8519 Implementation note: We can only check the main-type portion of
8520 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8521 from TYPE now returns a type that has the same instance flags
8522 as TYPE. For instance, if TYPE is a "typedef const", and its
8523 target type is a "struct", then the typedef elimination will return
8524 a "const" version of the target type. See check_typedef for more
8525 details about how the typedef layer elimination is done.
8527 brobecker/2010-11-19: It seems to me that the only case where it is
8528 useful to preserve the typedef layer is when dealing with fat pointers.
8529 Perhaps, we could add a check for that and preserve the typedef layer
8530 only in that situation. But this seems unecessary so far, probably
8531 because we call check_typedef/ada_check_typedef pretty much everywhere.
8533 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8534 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8535 == TYPE_MAIN_TYPE (fixed_type
)))
8541 /* A standard (static-sized) type corresponding as well as possible to
8542 TYPE0, but based on no runtime data. */
8544 static struct type
*
8545 to_static_fixed_type (struct type
*type0
)
8552 if (TYPE_FIXED_INSTANCE (type0
))
8555 type0
= ada_check_typedef (type0
);
8557 switch (TYPE_CODE (type0
))
8561 case TYPE_CODE_STRUCT
:
8562 type
= dynamic_template_type (type0
);
8564 return template_to_static_fixed_type (type
);
8566 return template_to_static_fixed_type (type0
);
8567 case TYPE_CODE_UNION
:
8568 type
= ada_find_parallel_type (type0
, "___XVU");
8570 return template_to_static_fixed_type (type
);
8572 return template_to_static_fixed_type (type0
);
8576 /* A static approximation of TYPE with all type wrappers removed. */
8578 static struct type
*
8579 static_unwrap_type (struct type
*type
)
8581 if (ada_is_aligner_type (type
))
8583 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8584 if (ada_type_name (type1
) == NULL
)
8585 TYPE_NAME (type1
) = ada_type_name (type
);
8587 return static_unwrap_type (type1
);
8591 struct type
*raw_real_type
= ada_get_base_type (type
);
8593 if (raw_real_type
== type
)
8596 return to_static_fixed_type (raw_real_type
);
8600 /* In some cases, incomplete and private types require
8601 cross-references that are not resolved as records (for example,
8603 type FooP is access Foo;
8605 type Foo is array ...;
8606 ). In these cases, since there is no mechanism for producing
8607 cross-references to such types, we instead substitute for FooP a
8608 stub enumeration type that is nowhere resolved, and whose tag is
8609 the name of the actual type. Call these types "non-record stubs". */
8611 /* A type equivalent to TYPE that is not a non-record stub, if one
8612 exists, otherwise TYPE. */
8615 ada_check_typedef (struct type
*type
)
8620 /* If our type is a typedef type of a fat pointer, then we're done.
8621 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8622 what allows us to distinguish between fat pointers that represent
8623 array types, and fat pointers that represent array access types
8624 (in both cases, the compiler implements them as fat pointers). */
8625 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8626 && is_thick_pntr (ada_typedef_target_type (type
)))
8629 CHECK_TYPEDEF (type
);
8630 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8631 || !TYPE_STUB (type
)
8632 || TYPE_TAG_NAME (type
) == NULL
)
8636 const char *name
= TYPE_TAG_NAME (type
);
8637 struct type
*type1
= ada_find_any_type (name
);
8642 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8643 stubs pointing to arrays, as we don't create symbols for array
8644 types, only for the typedef-to-array types). If that's the case,
8645 strip the typedef layer. */
8646 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8647 type1
= ada_check_typedef (type1
);
8653 /* A value representing the data at VALADDR/ADDRESS as described by
8654 type TYPE0, but with a standard (static-sized) type that correctly
8655 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8656 type, then return VAL0 [this feature is simply to avoid redundant
8657 creation of struct values]. */
8659 static struct value
*
8660 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8663 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8665 if (type
== type0
&& val0
!= NULL
)
8668 return value_from_contents_and_address (type
, 0, address
);
8671 /* A value representing VAL, but with a standard (static-sized) type
8672 that correctly describes it. Does not necessarily create a new
8676 ada_to_fixed_value (struct value
*val
)
8678 val
= unwrap_value (val
);
8679 val
= ada_to_fixed_value_create (value_type (val
),
8680 value_address (val
),
8688 /* Table mapping attribute numbers to names.
8689 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8691 static const char *attribute_names
[] = {
8709 ada_attribute_name (enum exp_opcode n
)
8711 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8712 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8714 return attribute_names
[0];
8717 /* Evaluate the 'POS attribute applied to ARG. */
8720 pos_atr (struct value
*arg
)
8722 struct value
*val
= coerce_ref (arg
);
8723 struct type
*type
= value_type (val
);
8725 if (!discrete_type_p (type
))
8726 error (_("'POS only defined on discrete types"));
8728 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8731 LONGEST v
= value_as_long (val
);
8733 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8735 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8738 error (_("enumeration value is invalid: can't find 'POS"));
8741 return value_as_long (val
);
8744 static struct value
*
8745 value_pos_atr (struct type
*type
, struct value
*arg
)
8747 return value_from_longest (type
, pos_atr (arg
));
8750 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8752 static struct value
*
8753 value_val_atr (struct type
*type
, struct value
*arg
)
8755 if (!discrete_type_p (type
))
8756 error (_("'VAL only defined on discrete types"));
8757 if (!integer_type_p (value_type (arg
)))
8758 error (_("'VAL requires integral argument"));
8760 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8762 long pos
= value_as_long (arg
);
8764 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8765 error (_("argument to 'VAL out of range"));
8766 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8769 return value_from_longest (type
, value_as_long (arg
));
8775 /* True if TYPE appears to be an Ada character type.
8776 [At the moment, this is true only for Character and Wide_Character;
8777 It is a heuristic test that could stand improvement]. */
8780 ada_is_character_type (struct type
*type
)
8784 /* If the type code says it's a character, then assume it really is,
8785 and don't check any further. */
8786 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8789 /* Otherwise, assume it's a character type iff it is a discrete type
8790 with a known character type name. */
8791 name
= ada_type_name (type
);
8792 return (name
!= NULL
8793 && (TYPE_CODE (type
) == TYPE_CODE_INT
8794 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8795 && (strcmp (name
, "character") == 0
8796 || strcmp (name
, "wide_character") == 0
8797 || strcmp (name
, "wide_wide_character") == 0
8798 || strcmp (name
, "unsigned char") == 0));
8801 /* True if TYPE appears to be an Ada string type. */
8804 ada_is_string_type (struct type
*type
)
8806 type
= ada_check_typedef (type
);
8808 && TYPE_CODE (type
) != TYPE_CODE_PTR
8809 && (ada_is_simple_array_type (type
)
8810 || ada_is_array_descriptor_type (type
))
8811 && ada_array_arity (type
) == 1)
8813 struct type
*elttype
= ada_array_element_type (type
, 1);
8815 return ada_is_character_type (elttype
);
8821 /* The compiler sometimes provides a parallel XVS type for a given
8822 PAD type. Normally, it is safe to follow the PAD type directly,
8823 but older versions of the compiler have a bug that causes the offset
8824 of its "F" field to be wrong. Following that field in that case
8825 would lead to incorrect results, but this can be worked around
8826 by ignoring the PAD type and using the associated XVS type instead.
8828 Set to True if the debugger should trust the contents of PAD types.
8829 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8830 static int trust_pad_over_xvs
= 1;
8832 /* True if TYPE is a struct type introduced by the compiler to force the
8833 alignment of a value. Such types have a single field with a
8834 distinctive name. */
8837 ada_is_aligner_type (struct type
*type
)
8839 type
= ada_check_typedef (type
);
8841 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8844 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8845 && TYPE_NFIELDS (type
) == 1
8846 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8849 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8850 the parallel type. */
8853 ada_get_base_type (struct type
*raw_type
)
8855 struct type
*real_type_namer
;
8856 struct type
*raw_real_type
;
8858 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8861 if (ada_is_aligner_type (raw_type
))
8862 /* The encoding specifies that we should always use the aligner type.
8863 So, even if this aligner type has an associated XVS type, we should
8866 According to the compiler gurus, an XVS type parallel to an aligner
8867 type may exist because of a stabs limitation. In stabs, aligner
8868 types are empty because the field has a variable-sized type, and
8869 thus cannot actually be used as an aligner type. As a result,
8870 we need the associated parallel XVS type to decode the type.
8871 Since the policy in the compiler is to not change the internal
8872 representation based on the debugging info format, we sometimes
8873 end up having a redundant XVS type parallel to the aligner type. */
8876 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8877 if (real_type_namer
== NULL
8878 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8879 || TYPE_NFIELDS (real_type_namer
) != 1)
8882 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8884 /* This is an older encoding form where the base type needs to be
8885 looked up by name. We prefer the newer enconding because it is
8887 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8888 if (raw_real_type
== NULL
)
8891 return raw_real_type
;
8894 /* The field in our XVS type is a reference to the base type. */
8895 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8898 /* The type of value designated by TYPE, with all aligners removed. */
8901 ada_aligned_type (struct type
*type
)
8903 if (ada_is_aligner_type (type
))
8904 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8906 return ada_get_base_type (type
);
8910 /* The address of the aligned value in an object at address VALADDR
8911 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8914 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8916 if (ada_is_aligner_type (type
))
8917 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8919 TYPE_FIELD_BITPOS (type
,
8920 0) / TARGET_CHAR_BIT
);
8927 /* The printed representation of an enumeration literal with encoded
8928 name NAME. The value is good to the next call of ada_enum_name. */
8930 ada_enum_name (const char *name
)
8932 static char *result
;
8933 static size_t result_len
= 0;
8936 /* First, unqualify the enumeration name:
8937 1. Search for the last '.' character. If we find one, then skip
8938 all the preceding characters, the unqualified name starts
8939 right after that dot.
8940 2. Otherwise, we may be debugging on a target where the compiler
8941 translates dots into "__". Search forward for double underscores,
8942 but stop searching when we hit an overloading suffix, which is
8943 of the form "__" followed by digits. */
8945 tmp
= strrchr (name
, '.');
8950 while ((tmp
= strstr (name
, "__")) != NULL
)
8952 if (isdigit (tmp
[2]))
8963 if (name
[1] == 'U' || name
[1] == 'W')
8965 if (sscanf (name
+ 2, "%x", &v
) != 1)
8971 GROW_VECT (result
, result_len
, 16);
8972 if (isascii (v
) && isprint (v
))
8973 xsnprintf (result
, result_len
, "'%c'", v
);
8974 else if (name
[1] == 'U')
8975 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8977 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8983 tmp
= strstr (name
, "__");
8985 tmp
= strstr (name
, "$");
8988 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8989 strncpy (result
, name
, tmp
- name
);
8990 result
[tmp
- name
] = '\0';
8998 /* Evaluate the subexpression of EXP starting at *POS as for
8999 evaluate_type, updating *POS to point just past the evaluated
9002 static struct value
*
9003 evaluate_subexp_type (struct expression
*exp
, int *pos
)
9005 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9008 /* If VAL is wrapped in an aligner or subtype wrapper, return the
9011 static struct value
*
9012 unwrap_value (struct value
*val
)
9014 struct type
*type
= ada_check_typedef (value_type (val
));
9016 if (ada_is_aligner_type (type
))
9018 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
9019 struct type
*val_type
= ada_check_typedef (value_type (v
));
9021 if (ada_type_name (val_type
) == NULL
)
9022 TYPE_NAME (val_type
) = ada_type_name (type
);
9024 return unwrap_value (v
);
9028 struct type
*raw_real_type
=
9029 ada_check_typedef (ada_get_base_type (type
));
9031 /* If there is no parallel XVS or XVE type, then the value is
9032 already unwrapped. Return it without further modification. */
9033 if ((type
== raw_real_type
)
9034 && ada_find_parallel_type (type
, "___XVE") == NULL
)
9038 coerce_unspec_val_to_type
9039 (val
, ada_to_fixed_type (raw_real_type
, 0,
9040 value_address (val
),
9045 static struct value
*
9046 cast_to_fixed (struct type
*type
, struct value
*arg
)
9050 if (type
== value_type (arg
))
9052 else if (ada_is_fixed_point_type (value_type (arg
)))
9053 val
= ada_float_to_fixed (type
,
9054 ada_fixed_to_float (value_type (arg
),
9055 value_as_long (arg
)));
9058 DOUBLEST argd
= value_as_double (arg
);
9060 val
= ada_float_to_fixed (type
, argd
);
9063 return value_from_longest (type
, val
);
9066 static struct value
*
9067 cast_from_fixed (struct type
*type
, struct value
*arg
)
9069 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
9070 value_as_long (arg
));
9072 return value_from_double (type
, val
);
9075 /* Given two array types T1 and T2, return nonzero iff both arrays
9076 contain the same number of elements. */
9079 ada_same_array_size_p (struct type
*t1
, struct type
*t2
)
9081 LONGEST lo1
, hi1
, lo2
, hi2
;
9083 /* Get the array bounds in order to verify that the size of
9084 the two arrays match. */
9085 if (!get_array_bounds (t1
, &lo1
, &hi1
)
9086 || !get_array_bounds (t2
, &lo2
, &hi2
))
9087 error (_("unable to determine array bounds"));
9089 /* To make things easier for size comparison, normalize a bit
9090 the case of empty arrays by making sure that the difference
9091 between upper bound and lower bound is always -1. */
9097 return (hi1
- lo1
== hi2
- lo2
);
9100 /* Assuming that VAL is an array of integrals, and TYPE represents
9101 an array with the same number of elements, but with wider integral
9102 elements, return an array "casted" to TYPE. In practice, this
9103 means that the returned array is built by casting each element
9104 of the original array into TYPE's (wider) element type. */
9106 static struct value
*
9107 ada_promote_array_of_integrals (struct type
*type
, struct value
*val
)
9109 struct type
*elt_type
= TYPE_TARGET_TYPE (type
);
9114 /* Verify that both val and type are arrays of scalars, and
9115 that the size of val's elements is smaller than the size
9116 of type's element. */
9117 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ARRAY
);
9118 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type
)));
9119 gdb_assert (TYPE_CODE (value_type (val
)) == TYPE_CODE_ARRAY
);
9120 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val
))));
9121 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type
))
9122 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val
))));
9124 if (!get_array_bounds (type
, &lo
, &hi
))
9125 error (_("unable to determine array bounds"));
9127 res
= allocate_value (type
);
9129 /* Promote each array element. */
9130 for (i
= 0; i
< hi
- lo
+ 1; i
++)
9132 struct value
*elt
= value_cast (elt_type
, value_subscript (val
, lo
+ i
));
9134 memcpy (value_contents_writeable (res
) + (i
* TYPE_LENGTH (elt_type
)),
9135 value_contents_all (elt
), TYPE_LENGTH (elt_type
));
9141 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9142 return the converted value. */
9144 static struct value
*
9145 coerce_for_assign (struct type
*type
, struct value
*val
)
9147 struct type
*type2
= value_type (val
);
9152 type2
= ada_check_typedef (type2
);
9153 type
= ada_check_typedef (type
);
9155 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
9156 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9158 val
= ada_value_ind (val
);
9159 type2
= value_type (val
);
9162 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
9163 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9165 if (!ada_same_array_size_p (type
, type2
))
9166 error (_("cannot assign arrays of different length"));
9168 if (is_integral_type (TYPE_TARGET_TYPE (type
))
9169 && is_integral_type (TYPE_TARGET_TYPE (type2
))
9170 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9171 < TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9173 /* Allow implicit promotion of the array elements to
9175 return ada_promote_array_of_integrals (type
, val
);
9178 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
9179 != TYPE_LENGTH (TYPE_TARGET_TYPE (type
)))
9180 error (_("Incompatible types in assignment"));
9181 deprecated_set_value_type (val
, type
);
9186 static struct value
*
9187 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
9190 struct type
*type1
, *type2
;
9193 arg1
= coerce_ref (arg1
);
9194 arg2
= coerce_ref (arg2
);
9195 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
9196 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
9198 if (TYPE_CODE (type1
) != TYPE_CODE_INT
9199 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
9200 return value_binop (arg1
, arg2
, op
);
9209 return value_binop (arg1
, arg2
, op
);
9212 v2
= value_as_long (arg2
);
9214 error (_("second operand of %s must not be zero."), op_string (op
));
9216 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
9217 return value_binop (arg1
, arg2
, op
);
9219 v1
= value_as_long (arg1
);
9224 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
9225 v
+= v
> 0 ? -1 : 1;
9233 /* Should not reach this point. */
9237 val
= allocate_value (type1
);
9238 store_unsigned_integer (value_contents_raw (val
),
9239 TYPE_LENGTH (value_type (val
)),
9240 gdbarch_byte_order (get_type_arch (type1
)), v
);
9245 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
9247 if (ada_is_direct_array_type (value_type (arg1
))
9248 || ada_is_direct_array_type (value_type (arg2
)))
9250 /* Automatically dereference any array reference before
9251 we attempt to perform the comparison. */
9252 arg1
= ada_coerce_ref (arg1
);
9253 arg2
= ada_coerce_ref (arg2
);
9255 arg1
= ada_coerce_to_simple_array (arg1
);
9256 arg2
= ada_coerce_to_simple_array (arg2
);
9257 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
9258 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
9259 error (_("Attempt to compare array with non-array"));
9260 /* FIXME: The following works only for types whose
9261 representations use all bits (no padding or undefined bits)
9262 and do not have user-defined equality. */
9264 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
9265 && memcmp (value_contents (arg1
), value_contents (arg2
),
9266 TYPE_LENGTH (value_type (arg1
))) == 0;
9268 return value_equal (arg1
, arg2
);
9271 /* Total number of component associations in the aggregate starting at
9272 index PC in EXP. Assumes that index PC is the start of an
9276 num_component_specs (struct expression
*exp
, int pc
)
9280 m
= exp
->elts
[pc
+ 1].longconst
;
9283 for (i
= 0; i
< m
; i
+= 1)
9285 switch (exp
->elts
[pc
].opcode
)
9291 n
+= exp
->elts
[pc
+ 1].longconst
;
9294 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
9299 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
9300 component of LHS (a simple array or a record), updating *POS past
9301 the expression, assuming that LHS is contained in CONTAINER. Does
9302 not modify the inferior's memory, nor does it modify LHS (unless
9303 LHS == CONTAINER). */
9306 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
9307 struct expression
*exp
, int *pos
)
9309 struct value
*mark
= value_mark ();
9312 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
9314 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9315 struct value
*index_val
= value_from_longest (index_type
, index
);
9317 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
9321 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
9322 elt
= ada_to_fixed_value (elt
);
9325 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9326 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
9328 value_assign_to_component (container
, elt
,
9329 ada_evaluate_subexp (NULL
, exp
, pos
,
9332 value_free_to_mark (mark
);
9335 /* Assuming that LHS represents an lvalue having a record or array
9336 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9337 of that aggregate's value to LHS, advancing *POS past the
9338 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9339 lvalue containing LHS (possibly LHS itself). Does not modify
9340 the inferior's memory, nor does it modify the contents of
9341 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
9343 static struct value
*
9344 assign_aggregate (struct value
*container
,
9345 struct value
*lhs
, struct expression
*exp
,
9346 int *pos
, enum noside noside
)
9348 struct type
*lhs_type
;
9349 int n
= exp
->elts
[*pos
+1].longconst
;
9350 LONGEST low_index
, high_index
;
9353 int max_indices
, num_indices
;
9357 if (noside
!= EVAL_NORMAL
)
9359 for (i
= 0; i
< n
; i
+= 1)
9360 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9364 container
= ada_coerce_ref (container
);
9365 if (ada_is_direct_array_type (value_type (container
)))
9366 container
= ada_coerce_to_simple_array (container
);
9367 lhs
= ada_coerce_ref (lhs
);
9368 if (!deprecated_value_modifiable (lhs
))
9369 error (_("Left operand of assignment is not a modifiable lvalue."));
9371 lhs_type
= value_type (lhs
);
9372 if (ada_is_direct_array_type (lhs_type
))
9374 lhs
= ada_coerce_to_simple_array (lhs
);
9375 lhs_type
= value_type (lhs
);
9376 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
9377 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
9379 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
9382 high_index
= num_visible_fields (lhs_type
) - 1;
9385 error (_("Left-hand side must be array or record."));
9387 num_specs
= num_component_specs (exp
, *pos
- 3);
9388 max_indices
= 4 * num_specs
+ 4;
9389 indices
= alloca (max_indices
* sizeof (indices
[0]));
9390 indices
[0] = indices
[1] = low_index
- 1;
9391 indices
[2] = indices
[3] = high_index
+ 1;
9394 for (i
= 0; i
< n
; i
+= 1)
9396 switch (exp
->elts
[*pos
].opcode
)
9399 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
9400 &num_indices
, max_indices
,
9401 low_index
, high_index
);
9404 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
9405 &num_indices
, max_indices
,
9406 low_index
, high_index
);
9410 error (_("Misplaced 'others' clause"));
9411 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
9412 num_indices
, low_index
, high_index
);
9415 error (_("Internal error: bad aggregate clause"));
9422 /* Assign into the component of LHS indexed by the OP_POSITIONAL
9423 construct at *POS, updating *POS past the construct, given that
9424 the positions are relative to lower bound LOW, where HIGH is the
9425 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
9426 updating *NUM_INDICES as needed. CONTAINER is as for
9427 assign_aggregate. */
9429 aggregate_assign_positional (struct value
*container
,
9430 struct value
*lhs
, struct expression
*exp
,
9431 int *pos
, LONGEST
*indices
, int *num_indices
,
9432 int max_indices
, LONGEST low
, LONGEST high
)
9434 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
9436 if (ind
- 1 == high
)
9437 warning (_("Extra components in aggregate ignored."));
9440 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
9442 assign_component (container
, lhs
, ind
, exp
, pos
);
9445 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9448 /* Assign into the components of LHS indexed by the OP_CHOICES
9449 construct at *POS, updating *POS past the construct, given that
9450 the allowable indices are LOW..HIGH. Record the indices assigned
9451 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
9452 needed. CONTAINER is as for assign_aggregate. */
9454 aggregate_assign_from_choices (struct value
*container
,
9455 struct value
*lhs
, struct expression
*exp
,
9456 int *pos
, LONGEST
*indices
, int *num_indices
,
9457 int max_indices
, LONGEST low
, LONGEST high
)
9460 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
9461 int choice_pos
, expr_pc
;
9462 int is_array
= ada_is_direct_array_type (value_type (lhs
));
9464 choice_pos
= *pos
+= 3;
9466 for (j
= 0; j
< n_choices
; j
+= 1)
9467 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9469 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9471 for (j
= 0; j
< n_choices
; j
+= 1)
9473 LONGEST lower
, upper
;
9474 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
9476 if (op
== OP_DISCRETE_RANGE
)
9479 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9481 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
9486 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
9498 name
= &exp
->elts
[choice_pos
+ 2].string
;
9501 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
9504 error (_("Invalid record component association."));
9506 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
9508 if (! find_struct_field (name
, value_type (lhs
), 0,
9509 NULL
, NULL
, NULL
, NULL
, &ind
))
9510 error (_("Unknown component name: %s."), name
);
9511 lower
= upper
= ind
;
9514 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9515 error (_("Index in component association out of bounds."));
9517 add_component_interval (lower
, upper
, indices
, num_indices
,
9519 while (lower
<= upper
)
9524 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9530 /* Assign the value of the expression in the OP_OTHERS construct in
9531 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9532 have not been previously assigned. The index intervals already assigned
9533 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9534 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9536 aggregate_assign_others (struct value
*container
,
9537 struct value
*lhs
, struct expression
*exp
,
9538 int *pos
, LONGEST
*indices
, int num_indices
,
9539 LONGEST low
, LONGEST high
)
9542 int expr_pc
= *pos
+ 1;
9544 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9548 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9553 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9556 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9559 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9560 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9561 modifying *SIZE as needed. It is an error if *SIZE exceeds
9562 MAX_SIZE. The resulting intervals do not overlap. */
9564 add_component_interval (LONGEST low
, LONGEST high
,
9565 LONGEST
* indices
, int *size
, int max_size
)
9569 for (i
= 0; i
< *size
; i
+= 2) {
9570 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9574 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9575 if (high
< indices
[kh
])
9577 if (low
< indices
[i
])
9579 indices
[i
+ 1] = indices
[kh
- 1];
9580 if (high
> indices
[i
+ 1])
9581 indices
[i
+ 1] = high
;
9582 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9583 *size
-= kh
- i
- 2;
9586 else if (high
< indices
[i
])
9590 if (*size
== max_size
)
9591 error (_("Internal error: miscounted aggregate components."));
9593 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9594 indices
[j
] = indices
[j
- 2];
9596 indices
[i
+ 1] = high
;
9599 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9602 static struct value
*
9603 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9605 if (type
== ada_check_typedef (value_type (arg2
)))
9608 if (ada_is_fixed_point_type (type
))
9609 return (cast_to_fixed (type
, arg2
));
9611 if (ada_is_fixed_point_type (value_type (arg2
)))
9612 return cast_from_fixed (type
, arg2
);
9614 return value_cast (type
, arg2
);
9617 /* Evaluating Ada expressions, and printing their result.
9618 ------------------------------------------------------
9623 We usually evaluate an Ada expression in order to print its value.
9624 We also evaluate an expression in order to print its type, which
9625 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9626 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9627 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9628 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9631 Evaluating expressions is a little more complicated for Ada entities
9632 than it is for entities in languages such as C. The main reason for
9633 this is that Ada provides types whose definition might be dynamic.
9634 One example of such types is variant records. Or another example
9635 would be an array whose bounds can only be known at run time.
9637 The following description is a general guide as to what should be
9638 done (and what should NOT be done) in order to evaluate an expression
9639 involving such types, and when. This does not cover how the semantic
9640 information is encoded by GNAT as this is covered separatly. For the
9641 document used as the reference for the GNAT encoding, see exp_dbug.ads
9642 in the GNAT sources.
9644 Ideally, we should embed each part of this description next to its
9645 associated code. Unfortunately, the amount of code is so vast right
9646 now that it's hard to see whether the code handling a particular
9647 situation might be duplicated or not. One day, when the code is
9648 cleaned up, this guide might become redundant with the comments
9649 inserted in the code, and we might want to remove it.
9651 2. ``Fixing'' an Entity, the Simple Case:
9652 -----------------------------------------
9654 When evaluating Ada expressions, the tricky issue is that they may
9655 reference entities whose type contents and size are not statically
9656 known. Consider for instance a variant record:
9658 type Rec (Empty : Boolean := True) is record
9661 when False => Value : Integer;
9664 Yes : Rec := (Empty => False, Value => 1);
9665 No : Rec := (empty => True);
9667 The size and contents of that record depends on the value of the
9668 descriminant (Rec.Empty). At this point, neither the debugging
9669 information nor the associated type structure in GDB are able to
9670 express such dynamic types. So what the debugger does is to create
9671 "fixed" versions of the type that applies to the specific object.
9672 We also informally refer to this opperation as "fixing" an object,
9673 which means creating its associated fixed type.
9675 Example: when printing the value of variable "Yes" above, its fixed
9676 type would look like this:
9683 On the other hand, if we printed the value of "No", its fixed type
9690 Things become a little more complicated when trying to fix an entity
9691 with a dynamic type that directly contains another dynamic type,
9692 such as an array of variant records, for instance. There are
9693 two possible cases: Arrays, and records.
9695 3. ``Fixing'' Arrays:
9696 ---------------------
9698 The type structure in GDB describes an array in terms of its bounds,
9699 and the type of its elements. By design, all elements in the array
9700 have the same type and we cannot represent an array of variant elements
9701 using the current type structure in GDB. When fixing an array,
9702 we cannot fix the array element, as we would potentially need one
9703 fixed type per element of the array. As a result, the best we can do
9704 when fixing an array is to produce an array whose bounds and size
9705 are correct (allowing us to read it from memory), but without having
9706 touched its element type. Fixing each element will be done later,
9707 when (if) necessary.
9709 Arrays are a little simpler to handle than records, because the same
9710 amount of memory is allocated for each element of the array, even if
9711 the amount of space actually used by each element differs from element
9712 to element. Consider for instance the following array of type Rec:
9714 type Rec_Array is array (1 .. 2) of Rec;
9716 The actual amount of memory occupied by each element might be different
9717 from element to element, depending on the value of their discriminant.
9718 But the amount of space reserved for each element in the array remains
9719 fixed regardless. So we simply need to compute that size using
9720 the debugging information available, from which we can then determine
9721 the array size (we multiply the number of elements of the array by
9722 the size of each element).
9724 The simplest case is when we have an array of a constrained element
9725 type. For instance, consider the following type declarations:
9727 type Bounded_String (Max_Size : Integer) is
9729 Buffer : String (1 .. Max_Size);
9731 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9733 In this case, the compiler describes the array as an array of
9734 variable-size elements (identified by its XVS suffix) for which
9735 the size can be read in the parallel XVZ variable.
9737 In the case of an array of an unconstrained element type, the compiler
9738 wraps the array element inside a private PAD type. This type should not
9739 be shown to the user, and must be "unwrap"'ed before printing. Note
9740 that we also use the adjective "aligner" in our code to designate
9741 these wrapper types.
9743 In some cases, the size allocated for each element is statically
9744 known. In that case, the PAD type already has the correct size,
9745 and the array element should remain unfixed.
9747 But there are cases when this size is not statically known.
9748 For instance, assuming that "Five" is an integer variable:
9750 type Dynamic is array (1 .. Five) of Integer;
9751 type Wrapper (Has_Length : Boolean := False) is record
9754 when True => Length : Integer;
9758 type Wrapper_Array is array (1 .. 2) of Wrapper;
9760 Hello : Wrapper_Array := (others => (Has_Length => True,
9761 Data => (others => 17),
9765 The debugging info would describe variable Hello as being an
9766 array of a PAD type. The size of that PAD type is not statically
9767 known, but can be determined using a parallel XVZ variable.
9768 In that case, a copy of the PAD type with the correct size should
9769 be used for the fixed array.
9771 3. ``Fixing'' record type objects:
9772 ----------------------------------
9774 Things are slightly different from arrays in the case of dynamic
9775 record types. In this case, in order to compute the associated
9776 fixed type, we need to determine the size and offset of each of
9777 its components. This, in turn, requires us to compute the fixed
9778 type of each of these components.
9780 Consider for instance the example:
9782 type Bounded_String (Max_Size : Natural) is record
9783 Str : String (1 .. Max_Size);
9786 My_String : Bounded_String (Max_Size => 10);
9788 In that case, the position of field "Length" depends on the size
9789 of field Str, which itself depends on the value of the Max_Size
9790 discriminant. In order to fix the type of variable My_String,
9791 we need to fix the type of field Str. Therefore, fixing a variant
9792 record requires us to fix each of its components.
9794 However, if a component does not have a dynamic size, the component
9795 should not be fixed. In particular, fields that use a PAD type
9796 should not fixed. Here is an example where this might happen
9797 (assuming type Rec above):
9799 type Container (Big : Boolean) is record
9803 when True => Another : Integer;
9807 My_Container : Container := (Big => False,
9808 First => (Empty => True),
9811 In that example, the compiler creates a PAD type for component First,
9812 whose size is constant, and then positions the component After just
9813 right after it. The offset of component After is therefore constant
9816 The debugger computes the position of each field based on an algorithm
9817 that uses, among other things, the actual position and size of the field
9818 preceding it. Let's now imagine that the user is trying to print
9819 the value of My_Container. If the type fixing was recursive, we would
9820 end up computing the offset of field After based on the size of the
9821 fixed version of field First. And since in our example First has
9822 only one actual field, the size of the fixed type is actually smaller
9823 than the amount of space allocated to that field, and thus we would
9824 compute the wrong offset of field After.
9826 To make things more complicated, we need to watch out for dynamic
9827 components of variant records (identified by the ___XVL suffix in
9828 the component name). Even if the target type is a PAD type, the size
9829 of that type might not be statically known. So the PAD type needs
9830 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9831 we might end up with the wrong size for our component. This can be
9832 observed with the following type declarations:
9834 type Octal is new Integer range 0 .. 7;
9835 type Octal_Array is array (Positive range <>) of Octal;
9836 pragma Pack (Octal_Array);
9838 type Octal_Buffer (Size : Positive) is record
9839 Buffer : Octal_Array (1 .. Size);
9843 In that case, Buffer is a PAD type whose size is unset and needs
9844 to be computed by fixing the unwrapped type.
9846 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9847 ----------------------------------------------------------
9849 Lastly, when should the sub-elements of an entity that remained unfixed
9850 thus far, be actually fixed?
9852 The answer is: Only when referencing that element. For instance
9853 when selecting one component of a record, this specific component
9854 should be fixed at that point in time. Or when printing the value
9855 of a record, each component should be fixed before its value gets
9856 printed. Similarly for arrays, the element of the array should be
9857 fixed when printing each element of the array, or when extracting
9858 one element out of that array. On the other hand, fixing should
9859 not be performed on the elements when taking a slice of an array!
9861 Note that one of the side-effects of miscomputing the offset and
9862 size of each field is that we end up also miscomputing the size
9863 of the containing type. This can have adverse results when computing
9864 the value of an entity. GDB fetches the value of an entity based
9865 on the size of its type, and thus a wrong size causes GDB to fetch
9866 the wrong amount of memory. In the case where the computed size is
9867 too small, GDB fetches too little data to print the value of our
9868 entiry. Results in this case as unpredicatble, as we usually read
9869 past the buffer containing the data =:-o. */
9871 /* Implement the evaluate_exp routine in the exp_descriptor structure
9872 for the Ada language. */
9874 static struct value
*
9875 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9876 int *pos
, enum noside noside
)
9881 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9884 struct value
**argvec
;
9888 op
= exp
->elts
[pc
].opcode
;
9894 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9896 if (noside
== EVAL_NORMAL
)
9897 arg1
= unwrap_value (arg1
);
9899 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9900 then we need to perform the conversion manually, because
9901 evaluate_subexp_standard doesn't do it. This conversion is
9902 necessary in Ada because the different kinds of float/fixed
9903 types in Ada have different representations.
9905 Similarly, we need to perform the conversion from OP_LONG
9907 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9908 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9914 struct value
*result
;
9917 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9918 /* The result type will have code OP_STRING, bashed there from
9919 OP_ARRAY. Bash it back. */
9920 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9921 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9927 type
= exp
->elts
[pc
+ 1].type
;
9928 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9929 if (noside
== EVAL_SKIP
)
9931 arg1
= ada_value_cast (type
, arg1
, noside
);
9936 type
= exp
->elts
[pc
+ 1].type
;
9937 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9940 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9941 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9943 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9944 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9946 return ada_value_assign (arg1
, arg1
);
9948 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9949 except if the lhs of our assignment is a convenience variable.
9950 In the case of assigning to a convenience variable, the lhs
9951 should be exactly the result of the evaluation of the rhs. */
9952 type
= value_type (arg1
);
9953 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9955 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9956 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9958 if (ada_is_fixed_point_type (value_type (arg1
)))
9959 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9960 else if (ada_is_fixed_point_type (value_type (arg2
)))
9962 (_("Fixed-point values must be assigned to fixed-point variables"));
9964 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9965 return ada_value_assign (arg1
, arg2
);
9968 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9969 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9970 if (noside
== EVAL_SKIP
)
9972 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9973 return (value_from_longest
9975 value_as_long (arg1
) + value_as_long (arg2
)));
9976 if ((ada_is_fixed_point_type (value_type (arg1
))
9977 || ada_is_fixed_point_type (value_type (arg2
)))
9978 && value_type (arg1
) != value_type (arg2
))
9979 error (_("Operands of fixed-point addition must have the same type"));
9980 /* Do the addition, and cast the result to the type of the first
9981 argument. We cannot cast the result to a reference type, so if
9982 ARG1 is a reference type, find its underlying type. */
9983 type
= value_type (arg1
);
9984 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9985 type
= TYPE_TARGET_TYPE (type
);
9986 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9987 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9990 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9991 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9992 if (noside
== EVAL_SKIP
)
9994 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9995 return (value_from_longest
9997 value_as_long (arg1
) - value_as_long (arg2
)));
9998 if ((ada_is_fixed_point_type (value_type (arg1
))
9999 || ada_is_fixed_point_type (value_type (arg2
)))
10000 && value_type (arg1
) != value_type (arg2
))
10001 error (_("Operands of fixed-point subtraction "
10002 "must have the same type"));
10003 /* Do the substraction, and cast the result to the type of the first
10004 argument. We cannot cast the result to a reference type, so if
10005 ARG1 is a reference type, find its underlying type. */
10006 type
= value_type (arg1
);
10007 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
10008 type
= TYPE_TARGET_TYPE (type
);
10009 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10010 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
10016 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10017 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10018 if (noside
== EVAL_SKIP
)
10020 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10022 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10023 return value_zero (value_type (arg1
), not_lval
);
10027 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
10028 if (ada_is_fixed_point_type (value_type (arg1
)))
10029 arg1
= cast_from_fixed (type
, arg1
);
10030 if (ada_is_fixed_point_type (value_type (arg2
)))
10031 arg2
= cast_from_fixed (type
, arg2
);
10032 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10033 return ada_value_binop (arg1
, arg2
, op
);
10037 case BINOP_NOTEQUAL
:
10038 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10039 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
10040 if (noside
== EVAL_SKIP
)
10042 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10046 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10047 tem
= ada_value_equal (arg1
, arg2
);
10049 if (op
== BINOP_NOTEQUAL
)
10051 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10052 return value_from_longest (type
, (LONGEST
) tem
);
10055 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10056 if (noside
== EVAL_SKIP
)
10058 else if (ada_is_fixed_point_type (value_type (arg1
)))
10059 return value_cast (value_type (arg1
), value_neg (arg1
));
10062 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10063 return value_neg (arg1
);
10066 case BINOP_LOGICAL_AND
:
10067 case BINOP_LOGICAL_OR
:
10068 case UNOP_LOGICAL_NOT
:
10073 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10074 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10075 return value_cast (type
, val
);
10078 case BINOP_BITWISE_AND
:
10079 case BINOP_BITWISE_IOR
:
10080 case BINOP_BITWISE_XOR
:
10084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
10086 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10088 return value_cast (value_type (arg1
), val
);
10094 if (noside
== EVAL_SKIP
)
10099 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
10100 /* Only encountered when an unresolved symbol occurs in a
10101 context other than a function call, in which case, it is
10103 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10104 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
10105 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10107 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
10108 /* Check to see if this is a tagged type. We also need to handle
10109 the case where the type is a reference to a tagged type, but
10110 we have to be careful to exclude pointers to tagged types.
10111 The latter should be shown as usual (as a pointer), whereas
10112 a reference should mostly be transparent to the user. */
10113 if (ada_is_tagged_type (type
, 0)
10114 || (TYPE_CODE(type
) == TYPE_CODE_REF
10115 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
10117 /* Tagged types are a little special in the fact that the real
10118 type is dynamic and can only be determined by inspecting the
10119 object's tag. This means that we need to get the object's
10120 value first (EVAL_NORMAL) and then extract the actual object
10123 Note that we cannot skip the final step where we extract
10124 the object type from its tag, because the EVAL_NORMAL phase
10125 results in dynamic components being resolved into fixed ones.
10126 This can cause problems when trying to print the type
10127 description of tagged types whose parent has a dynamic size:
10128 We use the type name of the "_parent" component in order
10129 to print the name of the ancestor type in the type description.
10130 If that component had a dynamic size, the resolution into
10131 a fixed type would result in the loss of that type name,
10132 thus preventing us from printing the name of the ancestor
10133 type in the type description. */
10134 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
10136 if (TYPE_CODE (type
) != TYPE_CODE_REF
)
10138 struct type
*actual_type
;
10140 actual_type
= type_from_tag (ada_value_tag (arg1
));
10141 if (actual_type
== NULL
)
10142 /* If, for some reason, we were unable to determine
10143 the actual type from the tag, then use the static
10144 approximation that we just computed as a fallback.
10145 This can happen if the debugging information is
10146 incomplete, for instance. */
10147 actual_type
= type
;
10148 return value_zero (actual_type
, not_lval
);
10152 /* In the case of a ref, ada_coerce_ref takes care
10153 of determining the actual type. But the evaluation
10154 should return a ref as it should be valid to ask
10155 for its address; so rebuild a ref after coerce. */
10156 arg1
= ada_coerce_ref (arg1
);
10157 return value_ref (arg1
);
10163 (to_static_fixed_type
10164 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
10169 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
10170 return ada_to_fixed_value (arg1
);
10176 /* Allocate arg vector, including space for the function to be
10177 called in argvec[0] and a terminating NULL. */
10178 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10180 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
10182 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
10183 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
10184 error (_("Unexpected unresolved symbol, %s, during evaluation"),
10185 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
10188 for (tem
= 0; tem
<= nargs
; tem
+= 1)
10189 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10192 if (noside
== EVAL_SKIP
)
10196 if (ada_is_constrained_packed_array_type
10197 (desc_base_type (value_type (argvec
[0]))))
10198 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
10199 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10200 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
10201 /* This is a packed array that has already been fixed, and
10202 therefore already coerced to a simple array. Nothing further
10205 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
10206 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
10207 && VALUE_LVAL (argvec
[0]) == lval_memory
))
10208 argvec
[0] = value_addr (argvec
[0]);
10210 type
= ada_check_typedef (value_type (argvec
[0]));
10212 /* Ada allows us to implicitly dereference arrays when subscripting
10213 them. So, if this is an array typedef (encoding use for array
10214 access types encoded as fat pointers), strip it now. */
10215 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
10216 type
= ada_typedef_target_type (type
);
10218 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
10220 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
10222 case TYPE_CODE_FUNC
:
10223 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10225 case TYPE_CODE_ARRAY
:
10227 case TYPE_CODE_STRUCT
:
10228 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
10229 argvec
[0] = ada_value_ind (argvec
[0]);
10230 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
10233 error (_("cannot subscript or call something of type `%s'"),
10234 ada_type_name (value_type (argvec
[0])));
10239 switch (TYPE_CODE (type
))
10241 case TYPE_CODE_FUNC
:
10242 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10244 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
10246 if (TYPE_GNU_IFUNC (type
))
10247 return allocate_value (TYPE_TARGET_TYPE (rtype
));
10248 return allocate_value (rtype
);
10250 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
10251 case TYPE_CODE_INTERNAL_FUNCTION
:
10252 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10253 /* We don't know anything about what the internal
10254 function might return, but we have to return
10256 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10259 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
10260 argvec
[0], nargs
, argvec
+ 1);
10262 case TYPE_CODE_STRUCT
:
10266 arity
= ada_array_arity (type
);
10267 type
= ada_array_element_type (type
, nargs
);
10269 error (_("cannot subscript or call a record"));
10270 if (arity
!= nargs
)
10271 error (_("wrong number of subscripts; expecting %d"), arity
);
10272 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10273 return value_zero (ada_aligned_type (type
), lval_memory
);
10275 unwrap_value (ada_value_subscript
10276 (argvec
[0], nargs
, argvec
+ 1));
10278 case TYPE_CODE_ARRAY
:
10279 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10281 type
= ada_array_element_type (type
, nargs
);
10283 error (_("element type of array unknown"));
10285 return value_zero (ada_aligned_type (type
), lval_memory
);
10288 unwrap_value (ada_value_subscript
10289 (ada_coerce_to_simple_array (argvec
[0]),
10290 nargs
, argvec
+ 1));
10291 case TYPE_CODE_PTR
: /* Pointer to array */
10292 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
10293 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10295 type
= ada_array_element_type (type
, nargs
);
10297 error (_("element type of array unknown"));
10299 return value_zero (ada_aligned_type (type
), lval_memory
);
10302 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
10303 nargs
, argvec
+ 1));
10306 error (_("Attempt to index or call something other than an "
10307 "array or function"));
10312 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10313 struct value
*low_bound_val
=
10314 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10315 struct value
*high_bound_val
=
10316 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10318 LONGEST high_bound
;
10320 low_bound_val
= coerce_ref (low_bound_val
);
10321 high_bound_val
= coerce_ref (high_bound_val
);
10322 low_bound
= pos_atr (low_bound_val
);
10323 high_bound
= pos_atr (high_bound_val
);
10325 if (noside
== EVAL_SKIP
)
10328 /* If this is a reference to an aligner type, then remove all
10330 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10331 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
10332 TYPE_TARGET_TYPE (value_type (array
)) =
10333 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
10335 if (ada_is_constrained_packed_array_type (value_type (array
)))
10336 error (_("cannot slice a packed array"));
10338 /* If this is a reference to an array or an array lvalue,
10339 convert to a pointer. */
10340 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
10341 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
10342 && VALUE_LVAL (array
) == lval_memory
))
10343 array
= value_addr (array
);
10345 if (noside
== EVAL_AVOID_SIDE_EFFECTS
10346 && ada_is_array_descriptor_type (ada_check_typedef
10347 (value_type (array
))))
10348 return empty_array (ada_type_of_array (array
, 0), low_bound
);
10350 array
= ada_coerce_to_simple_array_ptr (array
);
10352 /* If we have more than one level of pointer indirection,
10353 dereference the value until we get only one level. */
10354 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
10355 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
10357 array
= value_ind (array
);
10359 /* Make sure we really do have an array type before going further,
10360 to avoid a SEGV when trying to get the index type or the target
10361 type later down the road if the debug info generated by
10362 the compiler is incorrect or incomplete. */
10363 if (!ada_is_simple_array_type (value_type (array
)))
10364 error (_("cannot take slice of non-array"));
10366 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
10369 struct type
*type0
= ada_check_typedef (value_type (array
));
10371 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
10372 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
10375 struct type
*arr_type0
=
10376 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
10378 return ada_value_slice_from_ptr (array
, arr_type0
,
10379 longest_to_int (low_bound
),
10380 longest_to_int (high_bound
));
10383 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10385 else if (high_bound
< low_bound
)
10386 return empty_array (value_type (array
), low_bound
);
10388 return ada_value_slice (array
, longest_to_int (low_bound
),
10389 longest_to_int (high_bound
));
10392 case UNOP_IN_RANGE
:
10394 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10395 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
10397 if (noside
== EVAL_SKIP
)
10400 switch (TYPE_CODE (type
))
10403 lim_warning (_("Membership test incompletely implemented; "
10404 "always returns true"));
10405 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10406 return value_from_longest (type
, (LONGEST
) 1);
10408 case TYPE_CODE_RANGE
:
10409 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
10410 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
10411 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10412 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10413 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10415 value_from_longest (type
,
10416 (value_less (arg1
, arg3
)
10417 || value_equal (arg1
, arg3
))
10418 && (value_less (arg2
, arg1
)
10419 || value_equal (arg2
, arg1
)));
10422 case BINOP_IN_BOUNDS
:
10424 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10425 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10427 if (noside
== EVAL_SKIP
)
10430 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10432 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10433 return value_zero (type
, not_lval
);
10436 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10438 type
= ada_index_type (value_type (arg2
), tem
, "range");
10440 type
= value_type (arg1
);
10442 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
10443 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
10445 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10446 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10447 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10449 value_from_longest (type
,
10450 (value_less (arg1
, arg3
)
10451 || value_equal (arg1
, arg3
))
10452 && (value_less (arg2
, arg1
)
10453 || value_equal (arg2
, arg1
)));
10455 case TERNOP_IN_RANGE
:
10456 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10457 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10458 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10460 if (noside
== EVAL_SKIP
)
10463 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10464 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
10465 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
10467 value_from_longest (type
,
10468 (value_less (arg1
, arg3
)
10469 || value_equal (arg1
, arg3
))
10470 && (value_less (arg2
, arg1
)
10471 || value_equal (arg2
, arg1
)));
10475 case OP_ATR_LENGTH
:
10477 struct type
*type_arg
;
10479 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10481 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10483 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10487 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10491 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
10492 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
10493 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
10496 if (noside
== EVAL_SKIP
)
10499 if (type_arg
== NULL
)
10501 arg1
= ada_coerce_ref (arg1
);
10503 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
10504 arg1
= ada_coerce_to_simple_array (arg1
);
10506 if (op
== OP_ATR_LENGTH
)
10507 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10510 type
= ada_index_type (value_type (arg1
), tem
,
10511 ada_attribute_name (op
));
10513 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10516 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10517 return allocate_value (type
);
10521 default: /* Should never happen. */
10522 error (_("unexpected attribute encountered"));
10524 return value_from_longest
10525 (type
, ada_array_bound (arg1
, tem
, 0));
10527 return value_from_longest
10528 (type
, ada_array_bound (arg1
, tem
, 1));
10529 case OP_ATR_LENGTH
:
10530 return value_from_longest
10531 (type
, ada_array_length (arg1
, tem
));
10534 else if (discrete_type_p (type_arg
))
10536 struct type
*range_type
;
10537 const char *name
= ada_type_name (type_arg
);
10540 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10541 range_type
= to_fixed_range_type (type_arg
, NULL
);
10542 if (range_type
== NULL
)
10543 range_type
= type_arg
;
10547 error (_("unexpected attribute encountered"));
10549 return value_from_longest
10550 (range_type
, ada_discrete_type_low_bound (range_type
));
10552 return value_from_longest
10553 (range_type
, ada_discrete_type_high_bound (range_type
));
10554 case OP_ATR_LENGTH
:
10555 error (_("the 'length attribute applies only to array types"));
10558 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10559 error (_("unimplemented type attribute"));
10564 if (ada_is_constrained_packed_array_type (type_arg
))
10565 type_arg
= decode_constrained_packed_array_type (type_arg
);
10567 if (op
== OP_ATR_LENGTH
)
10568 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10571 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10573 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10576 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10577 return allocate_value (type
);
10582 error (_("unexpected attribute encountered"));
10584 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10585 return value_from_longest (type
, low
);
10587 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10588 return value_from_longest (type
, high
);
10589 case OP_ATR_LENGTH
:
10590 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10591 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10592 return value_from_longest (type
, high
- low
+ 1);
10598 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10599 if (noside
== EVAL_SKIP
)
10602 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10603 return value_zero (ada_tag_type (arg1
), not_lval
);
10605 return ada_value_tag (arg1
);
10609 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10610 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10611 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10612 if (noside
== EVAL_SKIP
)
10614 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10615 return value_zero (value_type (arg1
), not_lval
);
10618 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10619 return value_binop (arg1
, arg2
,
10620 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10623 case OP_ATR_MODULUS
:
10625 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10627 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10628 if (noside
== EVAL_SKIP
)
10631 if (!ada_is_modular_type (type_arg
))
10632 error (_("'modulus must be applied to modular type"));
10634 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10635 ada_modulus (type_arg
));
10640 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10641 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10642 if (noside
== EVAL_SKIP
)
10644 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10645 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10646 return value_zero (type
, not_lval
);
10648 return value_pos_atr (type
, arg1
);
10651 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10652 type
= value_type (arg1
);
10654 /* If the argument is a reference, then dereference its type, since
10655 the user is really asking for the size of the actual object,
10656 not the size of the pointer. */
10657 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10658 type
= TYPE_TARGET_TYPE (type
);
10660 if (noside
== EVAL_SKIP
)
10662 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10663 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10665 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10666 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10669 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10670 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10671 type
= exp
->elts
[pc
+ 2].type
;
10672 if (noside
== EVAL_SKIP
)
10674 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10675 return value_zero (type
, not_lval
);
10677 return value_val_atr (type
, arg1
);
10680 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10681 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10682 if (noside
== EVAL_SKIP
)
10684 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10685 return value_zero (value_type (arg1
), not_lval
);
10688 /* For integer exponentiation operations,
10689 only promote the first argument. */
10690 if (is_integral_type (value_type (arg2
)))
10691 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10693 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10695 return value_binop (arg1
, arg2
, op
);
10699 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10700 if (noside
== EVAL_SKIP
)
10706 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10707 if (noside
== EVAL_SKIP
)
10709 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10710 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10711 return value_neg (arg1
);
10716 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10717 if (noside
== EVAL_SKIP
)
10719 type
= ada_check_typedef (value_type (arg1
));
10720 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10722 if (ada_is_array_descriptor_type (type
))
10723 /* GDB allows dereferencing GNAT array descriptors. */
10725 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10727 if (arrType
== NULL
)
10728 error (_("Attempt to dereference null array pointer."));
10729 return value_at_lazy (arrType
, 0);
10731 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10732 || TYPE_CODE (type
) == TYPE_CODE_REF
10733 /* In C you can dereference an array to get the 1st elt. */
10734 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10736 type
= to_static_fixed_type
10738 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10740 return value_zero (type
, lval_memory
);
10742 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10744 /* GDB allows dereferencing an int. */
10745 if (expect_type
== NULL
)
10746 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10751 to_static_fixed_type (ada_aligned_type (expect_type
));
10752 return value_zero (expect_type
, lval_memory
);
10756 error (_("Attempt to take contents of a non-pointer value."));
10758 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10759 type
= ada_check_typedef (value_type (arg1
));
10761 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10762 /* GDB allows dereferencing an int. If we were given
10763 the expect_type, then use that as the target type.
10764 Otherwise, assume that the target type is an int. */
10766 if (expect_type
!= NULL
)
10767 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10770 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10771 (CORE_ADDR
) value_as_address (arg1
));
10774 if (ada_is_array_descriptor_type (type
))
10775 /* GDB allows dereferencing GNAT array descriptors. */
10776 return ada_coerce_to_simple_array (arg1
);
10778 return ada_value_ind (arg1
);
10780 case STRUCTOP_STRUCT
:
10781 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10782 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10783 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10784 if (noside
== EVAL_SKIP
)
10786 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10788 struct type
*type1
= value_type (arg1
);
10790 if (ada_is_tagged_type (type1
, 1))
10792 type
= ada_lookup_struct_elt_type (type1
,
10793 &exp
->elts
[pc
+ 2].string
,
10796 /* In this case, we assume that the field COULD exist
10797 in some extension of the type. Return an object of
10798 "type" void, which will match any formal
10799 (see ada_type_match). */
10800 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
10805 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10808 return value_zero (ada_aligned_type (type
), lval_memory
);
10811 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10812 arg1
= unwrap_value (arg1
);
10813 return ada_to_fixed_value (arg1
);
10816 /* The value is not supposed to be used. This is here to make it
10817 easier to accommodate expressions that contain types. */
10819 if (noside
== EVAL_SKIP
)
10821 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10822 return allocate_value (exp
->elts
[pc
+ 1].type
);
10824 error (_("Attempt to use a type name as an expression"));
10829 case OP_DISCRETE_RANGE
:
10830 case OP_POSITIONAL
:
10832 if (noside
== EVAL_NORMAL
)
10836 error (_("Undefined name, ambiguous name, or renaming used in "
10837 "component association: %s."), &exp
->elts
[pc
+2].string
);
10839 error (_("Aggregates only allowed on the right of an assignment"));
10841 internal_error (__FILE__
, __LINE__
,
10842 _("aggregate apparently mangled"));
10845 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10847 for (tem
= 0; tem
< nargs
; tem
+= 1)
10848 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10853 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10859 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10860 type name that encodes the 'small and 'delta information.
10861 Otherwise, return NULL. */
10863 static const char *
10864 fixed_type_info (struct type
*type
)
10866 const char *name
= ada_type_name (type
);
10867 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10869 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10871 const char *tail
= strstr (name
, "___XF_");
10878 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10879 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10884 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10887 ada_is_fixed_point_type (struct type
*type
)
10889 return fixed_type_info (type
) != NULL
;
10892 /* Return non-zero iff TYPE represents a System.Address type. */
10895 ada_is_system_address_type (struct type
*type
)
10897 return (TYPE_NAME (type
)
10898 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10901 /* Assuming that TYPE is the representation of an Ada fixed-point
10902 type, return its delta, or -1 if the type is malformed and the
10903 delta cannot be determined. */
10906 ada_delta (struct type
*type
)
10908 const char *encoding
= fixed_type_info (type
);
10911 /* Strictly speaking, num and den are encoded as integer. However,
10912 they may not fit into a long, and they will have to be converted
10913 to DOUBLEST anyway. So scan them as DOUBLEST. */
10914 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10921 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10922 factor ('SMALL value) associated with the type. */
10925 scaling_factor (struct type
*type
)
10927 const char *encoding
= fixed_type_info (type
);
10928 DOUBLEST num0
, den0
, num1
, den1
;
10931 /* Strictly speaking, num's and den's are encoded as integer. However,
10932 they may not fit into a long, and they will have to be converted
10933 to DOUBLEST anyway. So scan them as DOUBLEST. */
10934 n
= sscanf (encoding
,
10935 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10936 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10937 &num0
, &den0
, &num1
, &den1
);
10942 return num1
/ den1
;
10944 return num0
/ den0
;
10948 /* Assuming that X is the representation of a value of fixed-point
10949 type TYPE, return its floating-point equivalent. */
10952 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10954 return (DOUBLEST
) x
*scaling_factor (type
);
10957 /* The representation of a fixed-point value of type TYPE
10958 corresponding to the value X. */
10961 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10963 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10970 /* Scan STR beginning at position K for a discriminant name, and
10971 return the value of that discriminant field of DVAL in *PX. If
10972 PNEW_K is not null, put the position of the character beyond the
10973 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10974 not alter *PX and *PNEW_K if unsuccessful. */
10977 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10980 static char *bound_buffer
= NULL
;
10981 static size_t bound_buffer_len
= 0;
10984 struct value
*bound_val
;
10986 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10989 pend
= strstr (str
+ k
, "__");
10993 k
+= strlen (bound
);
10997 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10998 bound
= bound_buffer
;
10999 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
11000 bound
[pend
- (str
+ k
)] = '\0';
11004 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
11005 if (bound_val
== NULL
)
11008 *px
= value_as_long (bound_val
);
11009 if (pnew_k
!= NULL
)
11014 /* Value of variable named NAME in the current environment. If
11015 no such variable found, then if ERR_MSG is null, returns 0, and
11016 otherwise causes an error with message ERR_MSG. */
11018 static struct value
*
11019 get_var_value (char *name
, char *err_msg
)
11021 struct ada_symbol_info
*syms
;
11024 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
11029 if (err_msg
== NULL
)
11032 error (("%s"), err_msg
);
11035 return value_of_variable (syms
[0].sym
, syms
[0].block
);
11038 /* Value of integer variable named NAME in the current environment. If
11039 no such variable found, returns 0, and sets *FLAG to 0. If
11040 successful, sets *FLAG to 1. */
11043 get_int_var_value (char *name
, int *flag
)
11045 struct value
*var_val
= get_var_value (name
, 0);
11057 return value_as_long (var_val
);
11062 /* Return a range type whose base type is that of the range type named
11063 NAME in the current environment, and whose bounds are calculated
11064 from NAME according to the GNAT range encoding conventions.
11065 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11066 corresponding range type from debug information; fall back to using it
11067 if symbol lookup fails. If a new type must be created, allocate it
11068 like ORIG_TYPE was. The bounds information, in general, is encoded
11069 in NAME, the base type given in the named range type. */
11071 static struct type
*
11072 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
11075 struct type
*base_type
;
11076 char *subtype_info
;
11078 gdb_assert (raw_type
!= NULL
);
11079 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
11081 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
11082 base_type
= TYPE_TARGET_TYPE (raw_type
);
11084 base_type
= raw_type
;
11086 name
= TYPE_NAME (raw_type
);
11087 subtype_info
= strstr (name
, "___XD");
11088 if (subtype_info
== NULL
)
11090 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
11091 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
11093 if (L
< INT_MIN
|| U
> INT_MAX
)
11096 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
11097 ada_discrete_type_low_bound (raw_type
),
11098 ada_discrete_type_high_bound (raw_type
));
11102 static char *name_buf
= NULL
;
11103 static size_t name_len
= 0;
11104 int prefix_len
= subtype_info
- name
;
11110 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
11111 strncpy (name_buf
, name
, prefix_len
);
11112 name_buf
[prefix_len
] = '\0';
11115 bounds_str
= strchr (subtype_info
, '_');
11118 if (*subtype_info
== 'L')
11120 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
11121 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
11123 if (bounds_str
[n
] == '_')
11125 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
11133 strcpy (name_buf
+ prefix_len
, "___L");
11134 L
= get_int_var_value (name_buf
, &ok
);
11137 lim_warning (_("Unknown lower bound, using 1."));
11142 if (*subtype_info
== 'U')
11144 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
11145 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
11152 strcpy (name_buf
+ prefix_len
, "___U");
11153 U
= get_int_var_value (name_buf
, &ok
);
11156 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
11161 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
11162 TYPE_NAME (type
) = name
;
11167 /* True iff NAME is the name of a range type. */
11170 ada_is_range_type_name (const char *name
)
11172 return (name
!= NULL
&& strstr (name
, "___XD"));
11176 /* Modular types */
11178 /* True iff TYPE is an Ada modular type. */
11181 ada_is_modular_type (struct type
*type
)
11183 struct type
*subranged_type
= get_base_type (type
);
11185 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
11186 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
11187 && TYPE_UNSIGNED (subranged_type
));
11190 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11193 ada_modulus (struct type
*type
)
11195 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
11199 /* Ada exception catchpoint support:
11200 ---------------------------------
11202 We support 3 kinds of exception catchpoints:
11203 . catchpoints on Ada exceptions
11204 . catchpoints on unhandled Ada exceptions
11205 . catchpoints on failed assertions
11207 Exceptions raised during failed assertions, or unhandled exceptions
11208 could perfectly be caught with the general catchpoint on Ada exceptions.
11209 However, we can easily differentiate these two special cases, and having
11210 the option to distinguish these two cases from the rest can be useful
11211 to zero-in on certain situations.
11213 Exception catchpoints are a specialized form of breakpoint,
11214 since they rely on inserting breakpoints inside known routines
11215 of the GNAT runtime. The implementation therefore uses a standard
11216 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11219 Support in the runtime for exception catchpoints have been changed
11220 a few times already, and these changes affect the implementation
11221 of these catchpoints. In order to be able to support several
11222 variants of the runtime, we use a sniffer that will determine
11223 the runtime variant used by the program being debugged. */
11225 /* Ada's standard exceptions. */
11227 static char *standard_exc
[] = {
11228 "constraint_error",
11234 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
11236 /* A structure that describes how to support exception catchpoints
11237 for a given executable. */
11239 struct exception_support_info
11241 /* The name of the symbol to break on in order to insert
11242 a catchpoint on exceptions. */
11243 const char *catch_exception_sym
;
11245 /* The name of the symbol to break on in order to insert
11246 a catchpoint on unhandled exceptions. */
11247 const char *catch_exception_unhandled_sym
;
11249 /* The name of the symbol to break on in order to insert
11250 a catchpoint on failed assertions. */
11251 const char *catch_assert_sym
;
11253 /* Assuming that the inferior just triggered an unhandled exception
11254 catchpoint, this function is responsible for returning the address
11255 in inferior memory where the name of that exception is stored.
11256 Return zero if the address could not be computed. */
11257 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
11260 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
11261 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
11263 /* The following exception support info structure describes how to
11264 implement exception catchpoints with the latest version of the
11265 Ada runtime (as of 2007-03-06). */
11267 static const struct exception_support_info default_exception_support_info
=
11269 "__gnat_debug_raise_exception", /* catch_exception_sym */
11270 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11271 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
11272 ada_unhandled_exception_name_addr
11275 /* The following exception support info structure describes how to
11276 implement exception catchpoints with a slightly older version
11277 of the Ada runtime. */
11279 static const struct exception_support_info exception_support_info_fallback
=
11281 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
11282 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11283 "system__assertions__raise_assert_failure", /* catch_assert_sym */
11284 ada_unhandled_exception_name_addr_from_raise
11287 /* Return nonzero if we can detect the exception support routines
11288 described in EINFO.
11290 This function errors out if an abnormal situation is detected
11291 (for instance, if we find the exception support routines, but
11292 that support is found to be incomplete). */
11295 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
11297 struct symbol
*sym
;
11299 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11300 that should be compiled with debugging information. As a result, we
11301 expect to find that symbol in the symtabs. */
11303 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
11306 /* Perhaps we did not find our symbol because the Ada runtime was
11307 compiled without debugging info, or simply stripped of it.
11308 It happens on some GNU/Linux distributions for instance, where
11309 users have to install a separate debug package in order to get
11310 the runtime's debugging info. In that situation, let the user
11311 know why we cannot insert an Ada exception catchpoint.
11313 Note: Just for the purpose of inserting our Ada exception
11314 catchpoint, we could rely purely on the associated minimal symbol.
11315 But we would be operating in degraded mode anyway, since we are
11316 still lacking the debugging info needed later on to extract
11317 the name of the exception being raised (this name is printed in
11318 the catchpoint message, and is also used when trying to catch
11319 a specific exception). We do not handle this case for now. */
11320 struct minimal_symbol
*msym
11321 = lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
);
11323 if (msym
&& MSYMBOL_TYPE (msym
) != mst_solib_trampoline
)
11324 error (_("Your Ada runtime appears to be missing some debugging "
11325 "information.\nCannot insert Ada exception catchpoint "
11326 "in this configuration."));
11331 /* Make sure that the symbol we found corresponds to a function. */
11333 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11334 error (_("Symbol \"%s\" is not a function (class = %d)"),
11335 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
11340 /* Inspect the Ada runtime and determine which exception info structure
11341 should be used to provide support for exception catchpoints.
11343 This function will always set the per-inferior exception_info,
11344 or raise an error. */
11347 ada_exception_support_info_sniffer (void)
11349 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11351 /* If the exception info is already known, then no need to recompute it. */
11352 if (data
->exception_info
!= NULL
)
11355 /* Check the latest (default) exception support info. */
11356 if (ada_has_this_exception_support (&default_exception_support_info
))
11358 data
->exception_info
= &default_exception_support_info
;
11362 /* Try our fallback exception suport info. */
11363 if (ada_has_this_exception_support (&exception_support_info_fallback
))
11365 data
->exception_info
= &exception_support_info_fallback
;
11369 /* Sometimes, it is normal for us to not be able to find the routine
11370 we are looking for. This happens when the program is linked with
11371 the shared version of the GNAT runtime, and the program has not been
11372 started yet. Inform the user of these two possible causes if
11375 if (ada_update_initial_language (language_unknown
) != language_ada
)
11376 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
11378 /* If the symbol does not exist, then check that the program is
11379 already started, to make sure that shared libraries have been
11380 loaded. If it is not started, this may mean that the symbol is
11381 in a shared library. */
11383 if (ptid_get_pid (inferior_ptid
) == 0)
11384 error (_("Unable to insert catchpoint. Try to start the program first."));
11386 /* At this point, we know that we are debugging an Ada program and
11387 that the inferior has been started, but we still are not able to
11388 find the run-time symbols. That can mean that we are in
11389 configurable run time mode, or that a-except as been optimized
11390 out by the linker... In any case, at this point it is not worth
11391 supporting this feature. */
11393 error (_("Cannot insert Ada exception catchpoints in this configuration."));
11396 /* True iff FRAME is very likely to be that of a function that is
11397 part of the runtime system. This is all very heuristic, but is
11398 intended to be used as advice as to what frames are uninteresting
11402 is_known_support_routine (struct frame_info
*frame
)
11404 struct symtab_and_line sal
;
11406 enum language func_lang
;
11408 const char *fullname
;
11410 /* If this code does not have any debugging information (no symtab),
11411 This cannot be any user code. */
11413 find_frame_sal (frame
, &sal
);
11414 if (sal
.symtab
== NULL
)
11417 /* If there is a symtab, but the associated source file cannot be
11418 located, then assume this is not user code: Selecting a frame
11419 for which we cannot display the code would not be very helpful
11420 for the user. This should also take care of case such as VxWorks
11421 where the kernel has some debugging info provided for a few units. */
11423 fullname
= symtab_to_fullname (sal
.symtab
);
11424 if (access (fullname
, R_OK
) != 0)
11427 /* Check the unit filename againt the Ada runtime file naming.
11428 We also check the name of the objfile against the name of some
11429 known system libraries that sometimes come with debugging info
11432 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
11434 re_comp (known_runtime_file_name_patterns
[i
]);
11435 if (re_exec (lbasename (sal
.symtab
->filename
)))
11437 if (sal
.symtab
->objfile
!= NULL
11438 && re_exec (objfile_name (sal
.symtab
->objfile
)))
11442 /* Check whether the function is a GNAT-generated entity. */
11444 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
11445 if (func_name
== NULL
)
11448 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
11450 re_comp (known_auxiliary_function_name_patterns
[i
]);
11451 if (re_exec (func_name
))
11462 /* Find the first frame that contains debugging information and that is not
11463 part of the Ada run-time, starting from FI and moving upward. */
11466 ada_find_printable_frame (struct frame_info
*fi
)
11468 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
11470 if (!is_known_support_routine (fi
))
11479 /* Assuming that the inferior just triggered an unhandled exception
11480 catchpoint, return the address in inferior memory where the name
11481 of the exception is stored.
11483 Return zero if the address could not be computed. */
11486 ada_unhandled_exception_name_addr (void)
11488 return parse_and_eval_address ("e.full_name");
11491 /* Same as ada_unhandled_exception_name_addr, except that this function
11492 should be used when the inferior uses an older version of the runtime,
11493 where the exception name needs to be extracted from a specific frame
11494 several frames up in the callstack. */
11497 ada_unhandled_exception_name_addr_from_raise (void)
11500 struct frame_info
*fi
;
11501 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11502 struct cleanup
*old_chain
;
11504 /* To determine the name of this exception, we need to select
11505 the frame corresponding to RAISE_SYM_NAME. This frame is
11506 at least 3 levels up, so we simply skip the first 3 frames
11507 without checking the name of their associated function. */
11508 fi
= get_current_frame ();
11509 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
11511 fi
= get_prev_frame (fi
);
11513 old_chain
= make_cleanup (null_cleanup
, NULL
);
11517 enum language func_lang
;
11519 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
11520 if (func_name
!= NULL
)
11522 make_cleanup (xfree
, func_name
);
11524 if (strcmp (func_name
,
11525 data
->exception_info
->catch_exception_sym
) == 0)
11526 break; /* We found the frame we were looking for... */
11527 fi
= get_prev_frame (fi
);
11530 do_cleanups (old_chain
);
11536 return parse_and_eval_address ("id.full_name");
11539 /* Assuming the inferior just triggered an Ada exception catchpoint
11540 (of any type), return the address in inferior memory where the name
11541 of the exception is stored, if applicable.
11543 Return zero if the address could not be computed, or if not relevant. */
11546 ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex
,
11547 struct breakpoint
*b
)
11549 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11553 case ada_catch_exception
:
11554 return (parse_and_eval_address ("e.full_name"));
11557 case ada_catch_exception_unhandled
:
11558 return data
->exception_info
->unhandled_exception_name_addr ();
11561 case ada_catch_assert
:
11562 return 0; /* Exception name is not relevant in this case. */
11566 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11570 return 0; /* Should never be reached. */
11573 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11574 any error that ada_exception_name_addr_1 might cause to be thrown.
11575 When an error is intercepted, a warning with the error message is printed,
11576 and zero is returned. */
11579 ada_exception_name_addr (enum ada_exception_catchpoint_kind ex
,
11580 struct breakpoint
*b
)
11582 volatile struct gdb_exception e
;
11583 CORE_ADDR result
= 0;
11585 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11587 result
= ada_exception_name_addr_1 (ex
, b
);
11592 warning (_("failed to get exception name: %s"), e
.message
);
11599 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11601 /* Ada catchpoints.
11603 In the case of catchpoints on Ada exceptions, the catchpoint will
11604 stop the target on every exception the program throws. When a user
11605 specifies the name of a specific exception, we translate this
11606 request into a condition expression (in text form), and then parse
11607 it into an expression stored in each of the catchpoint's locations.
11608 We then use this condition to check whether the exception that was
11609 raised is the one the user is interested in. If not, then the
11610 target is resumed again. We store the name of the requested
11611 exception, in order to be able to re-set the condition expression
11612 when symbols change. */
11614 /* An instance of this type is used to represent an Ada catchpoint
11615 breakpoint location. It includes a "struct bp_location" as a kind
11616 of base class; users downcast to "struct bp_location *" when
11619 struct ada_catchpoint_location
11621 /* The base class. */
11622 struct bp_location base
;
11624 /* The condition that checks whether the exception that was raised
11625 is the specific exception the user specified on catchpoint
11627 struct expression
*excep_cond_expr
;
11630 /* Implement the DTOR method in the bp_location_ops structure for all
11631 Ada exception catchpoint kinds. */
11634 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11636 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11638 xfree (al
->excep_cond_expr
);
11641 /* The vtable to be used in Ada catchpoint locations. */
11643 static const struct bp_location_ops ada_catchpoint_location_ops
=
11645 ada_catchpoint_location_dtor
11648 /* An instance of this type is used to represent an Ada catchpoint.
11649 It includes a "struct breakpoint" as a kind of base class; users
11650 downcast to "struct breakpoint *" when needed. */
11652 struct ada_catchpoint
11654 /* The base class. */
11655 struct breakpoint base
;
11657 /* The name of the specific exception the user specified. */
11658 char *excep_string
;
11661 /* Parse the exception condition string in the context of each of the
11662 catchpoint's locations, and store them for later evaluation. */
11665 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11667 struct cleanup
*old_chain
;
11668 struct bp_location
*bl
;
11671 /* Nothing to do if there's no specific exception to catch. */
11672 if (c
->excep_string
== NULL
)
11675 /* Same if there are no locations... */
11676 if (c
->base
.loc
== NULL
)
11679 /* Compute the condition expression in text form, from the specific
11680 expection we want to catch. */
11681 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11682 old_chain
= make_cleanup (xfree
, cond_string
);
11684 /* Iterate over all the catchpoint's locations, and parse an
11685 expression for each. */
11686 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11688 struct ada_catchpoint_location
*ada_loc
11689 = (struct ada_catchpoint_location
*) bl
;
11690 struct expression
*exp
= NULL
;
11692 if (!bl
->shlib_disabled
)
11694 volatile struct gdb_exception e
;
11698 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11700 exp
= parse_exp_1 (&s
, bl
->address
,
11701 block_for_pc (bl
->address
), 0);
11705 warning (_("failed to reevaluate internal exception condition "
11706 "for catchpoint %d: %s"),
11707 c
->base
.number
, e
.message
);
11708 /* There is a bug in GCC on sparc-solaris when building with
11709 optimization which causes EXP to change unexpectedly
11710 (http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56982).
11711 The problem should be fixed starting with GCC 4.9.
11712 In the meantime, work around it by forcing EXP back
11718 ada_loc
->excep_cond_expr
= exp
;
11721 do_cleanups (old_chain
);
11724 /* Implement the DTOR method in the breakpoint_ops structure for all
11725 exception catchpoint kinds. */
11728 dtor_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11730 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11732 xfree (c
->excep_string
);
11734 bkpt_breakpoint_ops
.dtor (b
);
11737 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11738 structure for all exception catchpoint kinds. */
11740 static struct bp_location
*
11741 allocate_location_exception (enum ada_exception_catchpoint_kind ex
,
11742 struct breakpoint
*self
)
11744 struct ada_catchpoint_location
*loc
;
11746 loc
= XNEW (struct ada_catchpoint_location
);
11747 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11748 loc
->excep_cond_expr
= NULL
;
11752 /* Implement the RE_SET method in the breakpoint_ops structure for all
11753 exception catchpoint kinds. */
11756 re_set_exception (enum ada_exception_catchpoint_kind ex
, struct breakpoint
*b
)
11758 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11760 /* Call the base class's method. This updates the catchpoint's
11762 bkpt_breakpoint_ops
.re_set (b
);
11764 /* Reparse the exception conditional expressions. One for each
11766 create_excep_cond_exprs (c
);
11769 /* Returns true if we should stop for this breakpoint hit. If the
11770 user specified a specific exception, we only want to cause a stop
11771 if the program thrown that exception. */
11774 should_stop_exception (const struct bp_location
*bl
)
11776 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11777 const struct ada_catchpoint_location
*ada_loc
11778 = (const struct ada_catchpoint_location
*) bl
;
11779 volatile struct gdb_exception ex
;
11782 /* With no specific exception, should always stop. */
11783 if (c
->excep_string
== NULL
)
11786 if (ada_loc
->excep_cond_expr
== NULL
)
11788 /* We will have a NULL expression if back when we were creating
11789 the expressions, this location's had failed to parse. */
11794 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11796 struct value
*mark
;
11798 mark
= value_mark ();
11799 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11800 value_free_to_mark (mark
);
11803 exception_fprintf (gdb_stderr
, ex
,
11804 _("Error in testing exception condition:\n"));
11808 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11809 for all exception catchpoint kinds. */
11812 check_status_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11814 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11817 /* Implement the PRINT_IT method in the breakpoint_ops structure
11818 for all exception catchpoint kinds. */
11820 static enum print_stop_action
11821 print_it_exception (enum ada_exception_catchpoint_kind ex
, bpstat bs
)
11823 struct ui_out
*uiout
= current_uiout
;
11824 struct breakpoint
*b
= bs
->breakpoint_at
;
11826 annotate_catchpoint (b
->number
);
11828 if (ui_out_is_mi_like_p (uiout
))
11830 ui_out_field_string (uiout
, "reason",
11831 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11832 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11835 ui_out_text (uiout
,
11836 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11837 : "\nCatchpoint ");
11838 ui_out_field_int (uiout
, "bkptno", b
->number
);
11839 ui_out_text (uiout
, ", ");
11843 case ada_catch_exception
:
11844 case ada_catch_exception_unhandled
:
11846 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11847 char exception_name
[256];
11851 read_memory (addr
, (gdb_byte
*) exception_name
,
11852 sizeof (exception_name
) - 1);
11853 exception_name
[sizeof (exception_name
) - 1] = '\0';
11857 /* For some reason, we were unable to read the exception
11858 name. This could happen if the Runtime was compiled
11859 without debugging info, for instance. In that case,
11860 just replace the exception name by the generic string
11861 "exception" - it will read as "an exception" in the
11862 notification we are about to print. */
11863 memcpy (exception_name
, "exception", sizeof ("exception"));
11865 /* In the case of unhandled exception breakpoints, we print
11866 the exception name as "unhandled EXCEPTION_NAME", to make
11867 it clearer to the user which kind of catchpoint just got
11868 hit. We used ui_out_text to make sure that this extra
11869 info does not pollute the exception name in the MI case. */
11870 if (ex
== ada_catch_exception_unhandled
)
11871 ui_out_text (uiout
, "unhandled ");
11872 ui_out_field_string (uiout
, "exception-name", exception_name
);
11875 case ada_catch_assert
:
11876 /* In this case, the name of the exception is not really
11877 important. Just print "failed assertion" to make it clearer
11878 that his program just hit an assertion-failure catchpoint.
11879 We used ui_out_text because this info does not belong in
11881 ui_out_text (uiout
, "failed assertion");
11884 ui_out_text (uiout
, " at ");
11885 ada_find_printable_frame (get_current_frame ());
11887 return PRINT_SRC_AND_LOC
;
11890 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11891 for all exception catchpoint kinds. */
11894 print_one_exception (enum ada_exception_catchpoint_kind ex
,
11895 struct breakpoint
*b
, struct bp_location
**last_loc
)
11897 struct ui_out
*uiout
= current_uiout
;
11898 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11899 struct value_print_options opts
;
11901 get_user_print_options (&opts
);
11902 if (opts
.addressprint
)
11904 annotate_field (4);
11905 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11908 annotate_field (5);
11909 *last_loc
= b
->loc
;
11912 case ada_catch_exception
:
11913 if (c
->excep_string
!= NULL
)
11915 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11917 ui_out_field_string (uiout
, "what", msg
);
11921 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11925 case ada_catch_exception_unhandled
:
11926 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11929 case ada_catch_assert
:
11930 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11934 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11939 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11940 for all exception catchpoint kinds. */
11943 print_mention_exception (enum ada_exception_catchpoint_kind ex
,
11944 struct breakpoint
*b
)
11946 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11947 struct ui_out
*uiout
= current_uiout
;
11949 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11950 : _("Catchpoint "));
11951 ui_out_field_int (uiout
, "bkptno", b
->number
);
11952 ui_out_text (uiout
, ": ");
11956 case ada_catch_exception
:
11957 if (c
->excep_string
!= NULL
)
11959 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11960 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11962 ui_out_text (uiout
, info
);
11963 do_cleanups (old_chain
);
11966 ui_out_text (uiout
, _("all Ada exceptions"));
11969 case ada_catch_exception_unhandled
:
11970 ui_out_text (uiout
, _("unhandled Ada exceptions"));
11973 case ada_catch_assert
:
11974 ui_out_text (uiout
, _("failed Ada assertions"));
11978 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11983 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11984 for all exception catchpoint kinds. */
11987 print_recreate_exception (enum ada_exception_catchpoint_kind ex
,
11988 struct breakpoint
*b
, struct ui_file
*fp
)
11990 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11994 case ada_catch_exception
:
11995 fprintf_filtered (fp
, "catch exception");
11996 if (c
->excep_string
!= NULL
)
11997 fprintf_filtered (fp
, " %s", c
->excep_string
);
12000 case ada_catch_exception_unhandled
:
12001 fprintf_filtered (fp
, "catch exception unhandled");
12004 case ada_catch_assert
:
12005 fprintf_filtered (fp
, "catch assert");
12009 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
12011 print_recreate_thread (b
, fp
);
12014 /* Virtual table for "catch exception" breakpoints. */
12017 dtor_catch_exception (struct breakpoint
*b
)
12019 dtor_exception (ada_catch_exception
, b
);
12022 static struct bp_location
*
12023 allocate_location_catch_exception (struct breakpoint
*self
)
12025 return allocate_location_exception (ada_catch_exception
, self
);
12029 re_set_catch_exception (struct breakpoint
*b
)
12031 re_set_exception (ada_catch_exception
, b
);
12035 check_status_catch_exception (bpstat bs
)
12037 check_status_exception (ada_catch_exception
, bs
);
12040 static enum print_stop_action
12041 print_it_catch_exception (bpstat bs
)
12043 return print_it_exception (ada_catch_exception
, bs
);
12047 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
12049 print_one_exception (ada_catch_exception
, b
, last_loc
);
12053 print_mention_catch_exception (struct breakpoint
*b
)
12055 print_mention_exception (ada_catch_exception
, b
);
12059 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
12061 print_recreate_exception (ada_catch_exception
, b
, fp
);
12064 static struct breakpoint_ops catch_exception_breakpoint_ops
;
12066 /* Virtual table for "catch exception unhandled" breakpoints. */
12069 dtor_catch_exception_unhandled (struct breakpoint
*b
)
12071 dtor_exception (ada_catch_exception_unhandled
, b
);
12074 static struct bp_location
*
12075 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
12077 return allocate_location_exception (ada_catch_exception_unhandled
, self
);
12081 re_set_catch_exception_unhandled (struct breakpoint
*b
)
12083 re_set_exception (ada_catch_exception_unhandled
, b
);
12087 check_status_catch_exception_unhandled (bpstat bs
)
12089 check_status_exception (ada_catch_exception_unhandled
, bs
);
12092 static enum print_stop_action
12093 print_it_catch_exception_unhandled (bpstat bs
)
12095 return print_it_exception (ada_catch_exception_unhandled
, bs
);
12099 print_one_catch_exception_unhandled (struct breakpoint
*b
,
12100 struct bp_location
**last_loc
)
12102 print_one_exception (ada_catch_exception_unhandled
, b
, last_loc
);
12106 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
12108 print_mention_exception (ada_catch_exception_unhandled
, b
);
12112 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
12113 struct ui_file
*fp
)
12115 print_recreate_exception (ada_catch_exception_unhandled
, b
, fp
);
12118 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
12120 /* Virtual table for "catch assert" breakpoints. */
12123 dtor_catch_assert (struct breakpoint
*b
)
12125 dtor_exception (ada_catch_assert
, b
);
12128 static struct bp_location
*
12129 allocate_location_catch_assert (struct breakpoint
*self
)
12131 return allocate_location_exception (ada_catch_assert
, self
);
12135 re_set_catch_assert (struct breakpoint
*b
)
12137 re_set_exception (ada_catch_assert
, b
);
12141 check_status_catch_assert (bpstat bs
)
12143 check_status_exception (ada_catch_assert
, bs
);
12146 static enum print_stop_action
12147 print_it_catch_assert (bpstat bs
)
12149 return print_it_exception (ada_catch_assert
, bs
);
12153 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
12155 print_one_exception (ada_catch_assert
, b
, last_loc
);
12159 print_mention_catch_assert (struct breakpoint
*b
)
12161 print_mention_exception (ada_catch_assert
, b
);
12165 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
12167 print_recreate_exception (ada_catch_assert
, b
, fp
);
12170 static struct breakpoint_ops catch_assert_breakpoint_ops
;
12172 /* Return a newly allocated copy of the first space-separated token
12173 in ARGSP, and then adjust ARGSP to point immediately after that
12176 Return NULL if ARGPS does not contain any more tokens. */
12179 ada_get_next_arg (char **argsp
)
12181 char *args
= *argsp
;
12185 args
= skip_spaces (args
);
12186 if (args
[0] == '\0')
12187 return NULL
; /* No more arguments. */
12189 /* Find the end of the current argument. */
12191 end
= skip_to_space (args
);
12193 /* Adjust ARGSP to point to the start of the next argument. */
12197 /* Make a copy of the current argument and return it. */
12199 result
= xmalloc (end
- args
+ 1);
12200 strncpy (result
, args
, end
- args
);
12201 result
[end
- args
] = '\0';
12206 /* Split the arguments specified in a "catch exception" command.
12207 Set EX to the appropriate catchpoint type.
12208 Set EXCEP_STRING to the name of the specific exception if
12209 specified by the user.
12210 If a condition is found at the end of the arguments, the condition
12211 expression is stored in COND_STRING (memory must be deallocated
12212 after use). Otherwise COND_STRING is set to NULL. */
12215 catch_ada_exception_command_split (char *args
,
12216 enum ada_exception_catchpoint_kind
*ex
,
12217 char **excep_string
,
12218 char **cond_string
)
12220 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
12221 char *exception_name
;
12224 exception_name
= ada_get_next_arg (&args
);
12225 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
12227 /* This is not an exception name; this is the start of a condition
12228 expression for a catchpoint on all exceptions. So, "un-get"
12229 this token, and set exception_name to NULL. */
12230 xfree (exception_name
);
12231 exception_name
= NULL
;
12234 make_cleanup (xfree
, exception_name
);
12236 /* Check to see if we have a condition. */
12238 args
= skip_spaces (args
);
12239 if (strncmp (args
, "if", 2) == 0
12240 && (isspace (args
[2]) || args
[2] == '\0'))
12243 args
= skip_spaces (args
);
12245 if (args
[0] == '\0')
12246 error (_("Condition missing after `if' keyword"));
12247 cond
= xstrdup (args
);
12248 make_cleanup (xfree
, cond
);
12250 args
+= strlen (args
);
12253 /* Check that we do not have any more arguments. Anything else
12256 if (args
[0] != '\0')
12257 error (_("Junk at end of expression"));
12259 discard_cleanups (old_chain
);
12261 if (exception_name
== NULL
)
12263 /* Catch all exceptions. */
12264 *ex
= ada_catch_exception
;
12265 *excep_string
= NULL
;
12267 else if (strcmp (exception_name
, "unhandled") == 0)
12269 /* Catch unhandled exceptions. */
12270 *ex
= ada_catch_exception_unhandled
;
12271 *excep_string
= NULL
;
12275 /* Catch a specific exception. */
12276 *ex
= ada_catch_exception
;
12277 *excep_string
= exception_name
;
12279 *cond_string
= cond
;
12282 /* Return the name of the symbol on which we should break in order to
12283 implement a catchpoint of the EX kind. */
12285 static const char *
12286 ada_exception_sym_name (enum ada_exception_catchpoint_kind ex
)
12288 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
12290 gdb_assert (data
->exception_info
!= NULL
);
12294 case ada_catch_exception
:
12295 return (data
->exception_info
->catch_exception_sym
);
12297 case ada_catch_exception_unhandled
:
12298 return (data
->exception_info
->catch_exception_unhandled_sym
);
12300 case ada_catch_assert
:
12301 return (data
->exception_info
->catch_assert_sym
);
12304 internal_error (__FILE__
, __LINE__
,
12305 _("unexpected catchpoint kind (%d)"), ex
);
12309 /* Return the breakpoint ops "virtual table" used for catchpoints
12312 static const struct breakpoint_ops
*
12313 ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex
)
12317 case ada_catch_exception
:
12318 return (&catch_exception_breakpoint_ops
);
12320 case ada_catch_exception_unhandled
:
12321 return (&catch_exception_unhandled_breakpoint_ops
);
12323 case ada_catch_assert
:
12324 return (&catch_assert_breakpoint_ops
);
12327 internal_error (__FILE__
, __LINE__
,
12328 _("unexpected catchpoint kind (%d)"), ex
);
12332 /* Return the condition that will be used to match the current exception
12333 being raised with the exception that the user wants to catch. This
12334 assumes that this condition is used when the inferior just triggered
12335 an exception catchpoint.
12337 The string returned is a newly allocated string that needs to be
12338 deallocated later. */
12341 ada_exception_catchpoint_cond_string (const char *excep_string
)
12345 /* The standard exceptions are a special case. They are defined in
12346 runtime units that have been compiled without debugging info; if
12347 EXCEP_STRING is the not-fully-qualified name of a standard
12348 exception (e.g. "constraint_error") then, during the evaluation
12349 of the condition expression, the symbol lookup on this name would
12350 *not* return this standard exception. The catchpoint condition
12351 may then be set only on user-defined exceptions which have the
12352 same not-fully-qualified name (e.g. my_package.constraint_error).
12354 To avoid this unexcepted behavior, these standard exceptions are
12355 systematically prefixed by "standard". This means that "catch
12356 exception constraint_error" is rewritten into "catch exception
12357 standard.constraint_error".
12359 If an exception named contraint_error is defined in another package of
12360 the inferior program, then the only way to specify this exception as a
12361 breakpoint condition is to use its fully-qualified named:
12362 e.g. my_package.constraint_error. */
12364 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
12366 if (strcmp (standard_exc
[i
], excep_string
) == 0)
12368 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
12372 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
12375 /* Return the symtab_and_line that should be used to insert an exception
12376 catchpoint of the TYPE kind.
12378 EXCEP_STRING should contain the name of a specific exception that
12379 the catchpoint should catch, or NULL otherwise.
12381 ADDR_STRING returns the name of the function where the real
12382 breakpoint that implements the catchpoints is set, depending on the
12383 type of catchpoint we need to create. */
12385 static struct symtab_and_line
12386 ada_exception_sal (enum ada_exception_catchpoint_kind ex
, char *excep_string
,
12387 char **addr_string
, const struct breakpoint_ops
**ops
)
12389 const char *sym_name
;
12390 struct symbol
*sym
;
12392 /* First, find out which exception support info to use. */
12393 ada_exception_support_info_sniffer ();
12395 /* Then lookup the function on which we will break in order to catch
12396 the Ada exceptions requested by the user. */
12397 sym_name
= ada_exception_sym_name (ex
);
12398 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
12400 /* We can assume that SYM is not NULL at this stage. If the symbol
12401 did not exist, ada_exception_support_info_sniffer would have
12402 raised an exception.
12404 Also, ada_exception_support_info_sniffer should have already
12405 verified that SYM is a function symbol. */
12406 gdb_assert (sym
!= NULL
);
12407 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
12409 /* Set ADDR_STRING. */
12410 *addr_string
= xstrdup (sym_name
);
12413 *ops
= ada_exception_breakpoint_ops (ex
);
12415 return find_function_start_sal (sym
, 1);
12418 /* Create an Ada exception catchpoint.
12420 EX_KIND is the kind of exception catchpoint to be created.
12422 If EXCEPT_STRING is NULL, this catchpoint is expected to trigger
12423 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
12424 of the exception to which this catchpoint applies. When not NULL,
12425 the string must be allocated on the heap, and its deallocation
12426 is no longer the responsibility of the caller.
12428 COND_STRING, if not NULL, is the catchpoint condition. This string
12429 must be allocated on the heap, and its deallocation is no longer
12430 the responsibility of the caller.
12432 TEMPFLAG, if nonzero, means that the underlying breakpoint
12433 should be temporary.
12435 FROM_TTY is the usual argument passed to all commands implementations. */
12438 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
12439 enum ada_exception_catchpoint_kind ex_kind
,
12440 char *excep_string
,
12446 struct ada_catchpoint
*c
;
12447 char *addr_string
= NULL
;
12448 const struct breakpoint_ops
*ops
= NULL
;
12449 struct symtab_and_line sal
12450 = ada_exception_sal (ex_kind
, excep_string
, &addr_string
, &ops
);
12452 c
= XNEW (struct ada_catchpoint
);
12453 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
12454 ops
, tempflag
, disabled
, from_tty
);
12455 c
->excep_string
= excep_string
;
12456 create_excep_cond_exprs (c
);
12457 if (cond_string
!= NULL
)
12458 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
12459 install_breakpoint (0, &c
->base
, 1);
12462 /* Implement the "catch exception" command. */
12465 catch_ada_exception_command (char *arg
, int from_tty
,
12466 struct cmd_list_element
*command
)
12468 struct gdbarch
*gdbarch
= get_current_arch ();
12470 enum ada_exception_catchpoint_kind ex_kind
;
12471 char *excep_string
= NULL
;
12472 char *cond_string
= NULL
;
12474 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12478 catch_ada_exception_command_split (arg
, &ex_kind
, &excep_string
,
12480 create_ada_exception_catchpoint (gdbarch
, ex_kind
,
12481 excep_string
, cond_string
,
12482 tempflag
, 1 /* enabled */,
12486 /* Split the arguments specified in a "catch assert" command.
12488 ARGS contains the command's arguments (or the empty string if
12489 no arguments were passed).
12491 If ARGS contains a condition, set COND_STRING to that condition
12492 (the memory needs to be deallocated after use). */
12495 catch_ada_assert_command_split (char *args
, char **cond_string
)
12497 args
= skip_spaces (args
);
12499 /* Check whether a condition was provided. */
12500 if (strncmp (args
, "if", 2) == 0
12501 && (isspace (args
[2]) || args
[2] == '\0'))
12504 args
= skip_spaces (args
);
12505 if (args
[0] == '\0')
12506 error (_("condition missing after `if' keyword"));
12507 *cond_string
= xstrdup (args
);
12510 /* Otherwise, there should be no other argument at the end of
12512 else if (args
[0] != '\0')
12513 error (_("Junk at end of arguments."));
12516 /* Implement the "catch assert" command. */
12519 catch_assert_command (char *arg
, int from_tty
,
12520 struct cmd_list_element
*command
)
12522 struct gdbarch
*gdbarch
= get_current_arch ();
12524 char *cond_string
= NULL
;
12526 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
12530 catch_ada_assert_command_split (arg
, &cond_string
);
12531 create_ada_exception_catchpoint (gdbarch
, ada_catch_assert
,
12533 tempflag
, 1 /* enabled */,
12537 /* Return non-zero if the symbol SYM is an Ada exception object. */
12540 ada_is_exception_sym (struct symbol
*sym
)
12542 const char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
12544 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
12545 && SYMBOL_CLASS (sym
) != LOC_BLOCK
12546 && SYMBOL_CLASS (sym
) != LOC_CONST
12547 && SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
12548 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
12551 /* Given a global symbol SYM, return non-zero iff SYM is a non-standard
12552 Ada exception object. This matches all exceptions except the ones
12553 defined by the Ada language. */
12556 ada_is_non_standard_exception_sym (struct symbol
*sym
)
12560 if (!ada_is_exception_sym (sym
))
12563 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12564 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), standard_exc
[i
]) == 0)
12565 return 0; /* A standard exception. */
12567 /* Numeric_Error is also a standard exception, so exclude it.
12568 See the STANDARD_EXC description for more details as to why
12569 this exception is not listed in that array. */
12570 if (strcmp (SYMBOL_LINKAGE_NAME (sym
), "numeric_error") == 0)
12576 /* A helper function for qsort, comparing two struct ada_exc_info
12579 The comparison is determined first by exception name, and then
12580 by exception address. */
12583 compare_ada_exception_info (const void *a
, const void *b
)
12585 const struct ada_exc_info
*exc_a
= (struct ada_exc_info
*) a
;
12586 const struct ada_exc_info
*exc_b
= (struct ada_exc_info
*) b
;
12589 result
= strcmp (exc_a
->name
, exc_b
->name
);
12593 if (exc_a
->addr
< exc_b
->addr
)
12595 if (exc_a
->addr
> exc_b
->addr
)
12601 /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
12602 routine, but keeping the first SKIP elements untouched.
12604 All duplicates are also removed. */
12607 sort_remove_dups_ada_exceptions_list (VEC(ada_exc_info
) **exceptions
,
12610 struct ada_exc_info
*to_sort
12611 = VEC_address (ada_exc_info
, *exceptions
) + skip
;
12613 = VEC_length (ada_exc_info
, *exceptions
) - skip
;
12616 qsort (to_sort
, to_sort_len
, sizeof (struct ada_exc_info
),
12617 compare_ada_exception_info
);
12619 for (i
= 1, j
= 1; i
< to_sort_len
; i
++)
12620 if (compare_ada_exception_info (&to_sort
[i
], &to_sort
[j
- 1]) != 0)
12621 to_sort
[j
++] = to_sort
[i
];
12623 VEC_truncate(ada_exc_info
, *exceptions
, skip
+ to_sort_len
);
12626 /* A function intended as the "name_matcher" callback in the struct
12627 quick_symbol_functions' expand_symtabs_matching method.
12629 SEARCH_NAME is the symbol's search name.
12631 If USER_DATA is not NULL, it is a pointer to a regext_t object
12632 used to match the symbol (by natural name). Otherwise, when USER_DATA
12633 is null, no filtering is performed, and all symbols are a positive
12637 ada_exc_search_name_matches (const char *search_name
, void *user_data
)
12639 regex_t
*preg
= user_data
;
12644 /* In Ada, the symbol "search name" is a linkage name, whereas
12645 the regular expression used to do the matching refers to
12646 the natural name. So match against the decoded name. */
12647 return (regexec (preg
, ada_decode (search_name
), 0, NULL
, 0) == 0);
12650 /* Add all exceptions defined by the Ada standard whose name match
12651 a regular expression.
12653 If PREG is not NULL, then this regexp_t object is used to
12654 perform the symbol name matching. Otherwise, no name-based
12655 filtering is performed.
12657 EXCEPTIONS is a vector of exceptions to which matching exceptions
12661 ada_add_standard_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12665 for (i
= 0; i
< ARRAY_SIZE (standard_exc
); i
++)
12668 || regexec (preg
, standard_exc
[i
], 0, NULL
, 0) == 0)
12670 struct bound_minimal_symbol msymbol
12671 = ada_lookup_simple_minsym (standard_exc
[i
]);
12673 if (msymbol
.minsym
!= NULL
)
12675 struct ada_exc_info info
12676 = {standard_exc
[i
], SYMBOL_VALUE_ADDRESS (msymbol
.minsym
)};
12678 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12684 /* Add all Ada exceptions defined locally and accessible from the given
12687 If PREG is not NULL, then this regexp_t object is used to
12688 perform the symbol name matching. Otherwise, no name-based
12689 filtering is performed.
12691 EXCEPTIONS is a vector of exceptions to which matching exceptions
12695 ada_add_exceptions_from_frame (regex_t
*preg
, struct frame_info
*frame
,
12696 VEC(ada_exc_info
) **exceptions
)
12698 struct block
*block
= get_frame_block (frame
, 0);
12702 struct block_iterator iter
;
12703 struct symbol
*sym
;
12705 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
12707 switch (SYMBOL_CLASS (sym
))
12714 if (ada_is_exception_sym (sym
))
12716 struct ada_exc_info info
= {SYMBOL_PRINT_NAME (sym
),
12717 SYMBOL_VALUE_ADDRESS (sym
)};
12719 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12723 if (BLOCK_FUNCTION (block
) != NULL
)
12725 block
= BLOCK_SUPERBLOCK (block
);
12729 /* Add all exceptions defined globally whose name name match
12730 a regular expression, excluding standard exceptions.
12732 The reason we exclude standard exceptions is that they need
12733 to be handled separately: Standard exceptions are defined inside
12734 a runtime unit which is normally not compiled with debugging info,
12735 and thus usually do not show up in our symbol search. However,
12736 if the unit was in fact built with debugging info, we need to
12737 exclude them because they would duplicate the entry we found
12738 during the special loop that specifically searches for those
12739 standard exceptions.
12741 If PREG is not NULL, then this regexp_t object is used to
12742 perform the symbol name matching. Otherwise, no name-based
12743 filtering is performed.
12745 EXCEPTIONS is a vector of exceptions to which matching exceptions
12749 ada_add_global_exceptions (regex_t
*preg
, VEC(ada_exc_info
) **exceptions
)
12751 struct objfile
*objfile
;
12754 expand_symtabs_matching (NULL
, ada_exc_search_name_matches
,
12755 VARIABLES_DOMAIN
, preg
);
12757 ALL_PRIMARY_SYMTABS (objfile
, s
)
12759 struct blockvector
*bv
= BLOCKVECTOR (s
);
12762 for (i
= GLOBAL_BLOCK
; i
<= STATIC_BLOCK
; i
++)
12764 struct block
*b
= BLOCKVECTOR_BLOCK (bv
, i
);
12765 struct block_iterator iter
;
12766 struct symbol
*sym
;
12768 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
12769 if (ada_is_non_standard_exception_sym (sym
)
12771 || regexec (preg
, SYMBOL_NATURAL_NAME (sym
),
12774 struct ada_exc_info info
12775 = {SYMBOL_PRINT_NAME (sym
), SYMBOL_VALUE_ADDRESS (sym
)};
12777 VEC_safe_push (ada_exc_info
, *exceptions
, &info
);
12783 /* Implements ada_exceptions_list with the regular expression passed
12784 as a regex_t, rather than a string.
12786 If not NULL, PREG is used to filter out exceptions whose names
12787 do not match. Otherwise, all exceptions are listed. */
12789 static VEC(ada_exc_info
) *
12790 ada_exceptions_list_1 (regex_t
*preg
)
12792 VEC(ada_exc_info
) *result
= NULL
;
12793 struct cleanup
*old_chain
12794 = make_cleanup (VEC_cleanup (ada_exc_info
), &result
);
12797 /* First, list the known standard exceptions. These exceptions
12798 need to be handled separately, as they are usually defined in
12799 runtime units that have been compiled without debugging info. */
12801 ada_add_standard_exceptions (preg
, &result
);
12803 /* Next, find all exceptions whose scope is local and accessible
12804 from the currently selected frame. */
12806 if (has_stack_frames ())
12808 prev_len
= VEC_length (ada_exc_info
, result
);
12809 ada_add_exceptions_from_frame (preg
, get_selected_frame (NULL
),
12811 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12812 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12815 /* Add all exceptions whose scope is global. */
12817 prev_len
= VEC_length (ada_exc_info
, result
);
12818 ada_add_global_exceptions (preg
, &result
);
12819 if (VEC_length (ada_exc_info
, result
) > prev_len
)
12820 sort_remove_dups_ada_exceptions_list (&result
, prev_len
);
12822 discard_cleanups (old_chain
);
12826 /* Return a vector of ada_exc_info.
12828 If REGEXP is NULL, all exceptions are included in the result.
12829 Otherwise, it should contain a valid regular expression,
12830 and only the exceptions whose names match that regular expression
12831 are included in the result.
12833 The exceptions are sorted in the following order:
12834 - Standard exceptions (defined by the Ada language), in
12835 alphabetical order;
12836 - Exceptions only visible from the current frame, in
12837 alphabetical order;
12838 - Exceptions whose scope is global, in alphabetical order. */
12840 VEC(ada_exc_info
) *
12841 ada_exceptions_list (const char *regexp
)
12843 VEC(ada_exc_info
) *result
= NULL
;
12844 struct cleanup
*old_chain
= NULL
;
12847 if (regexp
!= NULL
)
12848 old_chain
= compile_rx_or_error (®
, regexp
,
12849 _("invalid regular expression"));
12851 result
= ada_exceptions_list_1 (regexp
!= NULL
? ®
: NULL
);
12853 if (old_chain
!= NULL
)
12854 do_cleanups (old_chain
);
12858 /* Implement the "info exceptions" command. */
12861 info_exceptions_command (char *regexp
, int from_tty
)
12863 VEC(ada_exc_info
) *exceptions
;
12864 struct cleanup
*cleanup
;
12865 struct gdbarch
*gdbarch
= get_current_arch ();
12867 struct ada_exc_info
*info
;
12869 exceptions
= ada_exceptions_list (regexp
);
12870 cleanup
= make_cleanup (VEC_cleanup (ada_exc_info
), &exceptions
);
12872 if (regexp
!= NULL
)
12874 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp
);
12876 printf_filtered (_("All defined Ada exceptions:\n"));
12878 for (ix
= 0; VEC_iterate(ada_exc_info
, exceptions
, ix
, info
); ix
++)
12879 printf_filtered ("%s: %s\n", info
->name
, paddress (gdbarch
, info
->addr
));
12881 do_cleanups (cleanup
);
12885 /* Information about operators given special treatment in functions
12887 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12889 #define ADA_OPERATORS \
12890 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12891 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12892 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12893 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12894 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12895 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12896 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12897 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12898 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12899 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12900 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12901 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12902 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12903 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12904 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12905 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12906 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12907 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12908 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12911 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12914 switch (exp
->elts
[pc
- 1].opcode
)
12917 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12920 #define OP_DEFN(op, len, args, binop) \
12921 case op: *oplenp = len; *argsp = args; break;
12927 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
12932 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
12937 /* Implementation of the exp_descriptor method operator_check. */
12940 ada_operator_check (struct expression
*exp
, int pos
,
12941 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
12944 const union exp_element
*const elts
= exp
->elts
;
12945 struct type
*type
= NULL
;
12947 switch (elts
[pos
].opcode
)
12949 case UNOP_IN_RANGE
:
12951 type
= elts
[pos
+ 1].type
;
12955 return operator_check_standard (exp
, pos
, objfile_func
, data
);
12958 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12960 if (type
&& TYPE_OBJFILE (type
)
12961 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
12968 ada_op_name (enum exp_opcode opcode
)
12973 return op_name_standard (opcode
);
12975 #define OP_DEFN(op, len, args, binop) case op: return #op;
12980 return "OP_AGGREGATE";
12982 return "OP_CHOICES";
12988 /* As for operator_length, but assumes PC is pointing at the first
12989 element of the operator, and gives meaningful results only for the
12990 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
12993 ada_forward_operator_length (struct expression
*exp
, int pc
,
12994 int *oplenp
, int *argsp
)
12996 switch (exp
->elts
[pc
].opcode
)
12999 *oplenp
= *argsp
= 0;
13002 #define OP_DEFN(op, len, args, binop) \
13003 case op: *oplenp = len; *argsp = args; break;
13009 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13014 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
13020 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
13022 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
13030 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
13032 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
13037 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
13041 /* Ada attributes ('Foo). */
13044 case OP_ATR_LENGTH
:
13048 case OP_ATR_MODULUS
:
13055 case UNOP_IN_RANGE
:
13057 /* XXX: gdb_sprint_host_address, type_sprint */
13058 fprintf_filtered (stream
, _("Type @"));
13059 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
13060 fprintf_filtered (stream
, " (");
13061 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
13062 fprintf_filtered (stream
, ")");
13064 case BINOP_IN_BOUNDS
:
13065 fprintf_filtered (stream
, " (%d)",
13066 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
13068 case TERNOP_IN_RANGE
:
13073 case OP_DISCRETE_RANGE
:
13074 case OP_POSITIONAL
:
13081 char *name
= &exp
->elts
[elt
+ 2].string
;
13082 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
13084 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
13089 return dump_subexp_body_standard (exp
, stream
, elt
);
13093 for (i
= 0; i
< nargs
; i
+= 1)
13094 elt
= dump_subexp (exp
, stream
, elt
);
13099 /* The Ada extension of print_subexp (q.v.). */
13102 ada_print_subexp (struct expression
*exp
, int *pos
,
13103 struct ui_file
*stream
, enum precedence prec
)
13105 int oplen
, nargs
, i
;
13107 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
13109 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
13116 print_subexp_standard (exp
, pos
, stream
, prec
);
13120 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
13123 case BINOP_IN_BOUNDS
:
13124 /* XXX: sprint_subexp */
13125 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13126 fputs_filtered (" in ", stream
);
13127 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13128 fputs_filtered ("'range", stream
);
13129 if (exp
->elts
[pc
+ 1].longconst
> 1)
13130 fprintf_filtered (stream
, "(%ld)",
13131 (long) exp
->elts
[pc
+ 1].longconst
);
13134 case TERNOP_IN_RANGE
:
13135 if (prec
>= PREC_EQUAL
)
13136 fputs_filtered ("(", stream
);
13137 /* XXX: sprint_subexp */
13138 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13139 fputs_filtered (" in ", stream
);
13140 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13141 fputs_filtered (" .. ", stream
);
13142 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
13143 if (prec
>= PREC_EQUAL
)
13144 fputs_filtered (")", stream
);
13149 case OP_ATR_LENGTH
:
13153 case OP_ATR_MODULUS
:
13158 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
13160 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
13161 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0,
13162 &type_print_raw_options
);
13166 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13167 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
13172 for (tem
= 1; tem
< nargs
; tem
+= 1)
13174 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
13175 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
13177 fputs_filtered (")", stream
);
13182 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
13183 fputs_filtered ("'(", stream
);
13184 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
13185 fputs_filtered (")", stream
);
13188 case UNOP_IN_RANGE
:
13189 /* XXX: sprint_subexp */
13190 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13191 fputs_filtered (" in ", stream
);
13192 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0,
13193 &type_print_raw_options
);
13196 case OP_DISCRETE_RANGE
:
13197 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13198 fputs_filtered ("..", stream
);
13199 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13203 fputs_filtered ("others => ", stream
);
13204 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13208 for (i
= 0; i
< nargs
-1; i
+= 1)
13211 fputs_filtered ("|", stream
);
13212 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13214 fputs_filtered (" => ", stream
);
13215 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13218 case OP_POSITIONAL
:
13219 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13223 fputs_filtered ("(", stream
);
13224 for (i
= 0; i
< nargs
; i
+= 1)
13227 fputs_filtered (", ", stream
);
13228 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
13230 fputs_filtered (")", stream
);
13235 /* Table mapping opcodes into strings for printing operators
13236 and precedences of the operators. */
13238 static const struct op_print ada_op_print_tab
[] = {
13239 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
13240 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
13241 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
13242 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
13243 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
13244 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
13245 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
13246 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
13247 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
13248 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
13249 {">", BINOP_GTR
, PREC_ORDER
, 0},
13250 {"<", BINOP_LESS
, PREC_ORDER
, 0},
13251 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
13252 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
13253 {"+", BINOP_ADD
, PREC_ADD
, 0},
13254 {"-", BINOP_SUB
, PREC_ADD
, 0},
13255 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
13256 {"*", BINOP_MUL
, PREC_MUL
, 0},
13257 {"/", BINOP_DIV
, PREC_MUL
, 0},
13258 {"rem", BINOP_REM
, PREC_MUL
, 0},
13259 {"mod", BINOP_MOD
, PREC_MUL
, 0},
13260 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
13261 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
13262 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
13263 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
13264 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
13265 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
13266 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
13267 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
13268 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
13269 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
13273 enum ada_primitive_types
{
13274 ada_primitive_type_int
,
13275 ada_primitive_type_long
,
13276 ada_primitive_type_short
,
13277 ada_primitive_type_char
,
13278 ada_primitive_type_float
,
13279 ada_primitive_type_double
,
13280 ada_primitive_type_void
,
13281 ada_primitive_type_long_long
,
13282 ada_primitive_type_long_double
,
13283 ada_primitive_type_natural
,
13284 ada_primitive_type_positive
,
13285 ada_primitive_type_system_address
,
13286 nr_ada_primitive_types
13290 ada_language_arch_info (struct gdbarch
*gdbarch
,
13291 struct language_arch_info
*lai
)
13293 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
13295 lai
->primitive_type_vector
13296 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
13299 lai
->primitive_type_vector
[ada_primitive_type_int
]
13300 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13302 lai
->primitive_type_vector
[ada_primitive_type_long
]
13303 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
13304 0, "long_integer");
13305 lai
->primitive_type_vector
[ada_primitive_type_short
]
13306 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
13307 0, "short_integer");
13308 lai
->string_char_type
13309 = lai
->primitive_type_vector
[ada_primitive_type_char
]
13310 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
13311 lai
->primitive_type_vector
[ada_primitive_type_float
]
13312 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
13314 lai
->primitive_type_vector
[ada_primitive_type_double
]
13315 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13316 "long_float", NULL
);
13317 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
13318 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
13319 0, "long_long_integer");
13320 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
13321 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
13322 "long_long_float", NULL
);
13323 lai
->primitive_type_vector
[ada_primitive_type_natural
]
13324 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13326 lai
->primitive_type_vector
[ada_primitive_type_positive
]
13327 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
13329 lai
->primitive_type_vector
[ada_primitive_type_void
]
13330 = builtin
->builtin_void
;
13332 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
13333 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
13334 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
13335 = "system__address";
13337 lai
->bool_type_symbol
= NULL
;
13338 lai
->bool_type_default
= builtin
->builtin_bool
;
13341 /* Language vector */
13343 /* Not really used, but needed in the ada_language_defn. */
13346 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
13348 ada_emit_char (c
, type
, stream
, quoter
, 1);
13354 warnings_issued
= 0;
13355 return ada_parse ();
13358 static const struct exp_descriptor ada_exp_descriptor
= {
13360 ada_operator_length
,
13361 ada_operator_check
,
13363 ada_dump_subexp_body
,
13364 ada_evaluate_subexp
13367 /* Implement the "la_get_symbol_name_cmp" language_defn method
13370 static symbol_name_cmp_ftype
13371 ada_get_symbol_name_cmp (const char *lookup_name
)
13373 if (should_use_wild_match (lookup_name
))
13376 return compare_names
;
13379 /* Implement the "la_read_var_value" language_defn method for Ada. */
13381 static struct value
*
13382 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
13384 struct block
*frame_block
= NULL
;
13385 struct symbol
*renaming_sym
= NULL
;
13387 /* The only case where default_read_var_value is not sufficient
13388 is when VAR is a renaming... */
13390 frame_block
= get_frame_block (frame
, NULL
);
13392 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
13393 if (renaming_sym
!= NULL
)
13394 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
13396 /* This is a typical case where we expect the default_read_var_value
13397 function to work. */
13398 return default_read_var_value (var
, frame
);
13401 const struct language_defn ada_language_defn
= {
13402 "ada", /* Language name */
13406 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
13407 that's not quite what this means. */
13409 macro_expansion_no
,
13410 &ada_exp_descriptor
,
13414 ada_printchar
, /* Print a character constant */
13415 ada_printstr
, /* Function to print string constant */
13416 emit_char
, /* Function to print single char (not used) */
13417 ada_print_type
, /* Print a type using appropriate syntax */
13418 ada_print_typedef
, /* Print a typedef using appropriate syntax */
13419 ada_val_print
, /* Print a value using appropriate syntax */
13420 ada_value_print
, /* Print a top-level value */
13421 ada_read_var_value
, /* la_read_var_value */
13422 NULL
, /* Language specific skip_trampoline */
13423 NULL
, /* name_of_this */
13424 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
13425 basic_lookup_transparent_type
, /* lookup_transparent_type */
13426 ada_la_decode
, /* Language specific symbol demangler */
13427 NULL
, /* Language specific
13428 class_name_from_physname */
13429 ada_op_print_tab
, /* expression operators for printing */
13430 0, /* c-style arrays */
13431 1, /* String lower bound */
13432 ada_get_gdb_completer_word_break_characters
,
13433 ada_make_symbol_completion_list
,
13434 ada_language_arch_info
,
13435 ada_print_array_index
,
13436 default_pass_by_reference
,
13438 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
13439 ada_iterate_over_symbols
,
13444 /* Provide a prototype to silence -Wmissing-prototypes. */
13445 extern initialize_file_ftype _initialize_ada_language
;
13447 /* Command-list for the "set/show ada" prefix command. */
13448 static struct cmd_list_element
*set_ada_list
;
13449 static struct cmd_list_element
*show_ada_list
;
13451 /* Implement the "set ada" prefix command. */
13454 set_ada_command (char *arg
, int from_tty
)
13456 printf_unfiltered (_(\
13457 "\"set ada\" must be followed by the name of a setting.\n"));
13458 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
13461 /* Implement the "show ada" prefix command. */
13464 show_ada_command (char *args
, int from_tty
)
13466 cmd_show_list (show_ada_list
, from_tty
, "");
13470 initialize_ada_catchpoint_ops (void)
13472 struct breakpoint_ops
*ops
;
13474 initialize_breakpoint_ops ();
13476 ops
= &catch_exception_breakpoint_ops
;
13477 *ops
= bkpt_breakpoint_ops
;
13478 ops
->dtor
= dtor_catch_exception
;
13479 ops
->allocate_location
= allocate_location_catch_exception
;
13480 ops
->re_set
= re_set_catch_exception
;
13481 ops
->check_status
= check_status_catch_exception
;
13482 ops
->print_it
= print_it_catch_exception
;
13483 ops
->print_one
= print_one_catch_exception
;
13484 ops
->print_mention
= print_mention_catch_exception
;
13485 ops
->print_recreate
= print_recreate_catch_exception
;
13487 ops
= &catch_exception_unhandled_breakpoint_ops
;
13488 *ops
= bkpt_breakpoint_ops
;
13489 ops
->dtor
= dtor_catch_exception_unhandled
;
13490 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
13491 ops
->re_set
= re_set_catch_exception_unhandled
;
13492 ops
->check_status
= check_status_catch_exception_unhandled
;
13493 ops
->print_it
= print_it_catch_exception_unhandled
;
13494 ops
->print_one
= print_one_catch_exception_unhandled
;
13495 ops
->print_mention
= print_mention_catch_exception_unhandled
;
13496 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
13498 ops
= &catch_assert_breakpoint_ops
;
13499 *ops
= bkpt_breakpoint_ops
;
13500 ops
->dtor
= dtor_catch_assert
;
13501 ops
->allocate_location
= allocate_location_catch_assert
;
13502 ops
->re_set
= re_set_catch_assert
;
13503 ops
->check_status
= check_status_catch_assert
;
13504 ops
->print_it
= print_it_catch_assert
;
13505 ops
->print_one
= print_one_catch_assert
;
13506 ops
->print_mention
= print_mention_catch_assert
;
13507 ops
->print_recreate
= print_recreate_catch_assert
;
13510 /* This module's 'new_objfile' observer. */
13513 ada_new_objfile_observer (struct objfile
*objfile
)
13515 ada_clear_symbol_cache ();
13518 /* This module's 'free_objfile' observer. */
13521 ada_free_objfile_observer (struct objfile
*objfile
)
13523 ada_clear_symbol_cache ();
13527 _initialize_ada_language (void)
13529 add_language (&ada_language_defn
);
13531 initialize_ada_catchpoint_ops ();
13533 add_prefix_cmd ("ada", no_class
, set_ada_command
,
13534 _("Prefix command for changing Ada-specfic settings"),
13535 &set_ada_list
, "set ada ", 0, &setlist
);
13537 add_prefix_cmd ("ada", no_class
, show_ada_command
,
13538 _("Generic command for showing Ada-specific settings."),
13539 &show_ada_list
, "show ada ", 0, &showlist
);
13541 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
13542 &trust_pad_over_xvs
, _("\
13543 Enable or disable an optimization trusting PAD types over XVS types"), _("\
13544 Show whether an optimization trusting PAD types over XVS types is activated"),
13546 This is related to the encoding used by the GNAT compiler. The debugger\n\
13547 should normally trust the contents of PAD types, but certain older versions\n\
13548 of GNAT have a bug that sometimes causes the information in the PAD type\n\
13549 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
13550 work around this bug. It is always safe to turn this option \"off\", but\n\
13551 this incurs a slight performance penalty, so it is recommended to NOT change\n\
13552 this option to \"off\" unless necessary."),
13553 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
13555 add_catch_command ("exception", _("\
13556 Catch Ada exceptions, when raised.\n\
13557 With an argument, catch only exceptions with the given name."),
13558 catch_ada_exception_command
,
13562 add_catch_command ("assert", _("\
13563 Catch failed Ada assertions, when raised.\n\
13564 With an argument, catch only exceptions with the given name."),
13565 catch_assert_command
,
13570 varsize_limit
= 65536;
13572 add_info ("exceptions", info_exceptions_command
,
13574 List all Ada exception names.\n\
13575 If a regular expression is passed as an argument, only those matching\n\
13576 the regular expression are listed."));
13578 add_prefix_cmd ("ada", class_maintenance
, maint_set_ada_cmd
,
13579 _("Set Ada maintenance-related variables."),
13580 &maint_set_ada_cmdlist
, "maintenance set ada ",
13581 0/*allow-unknown*/, &maintenance_set_cmdlist
);
13583 add_prefix_cmd ("ada", class_maintenance
, maint_show_ada_cmd
,
13584 _("Show Ada maintenance-related variables"),
13585 &maint_show_ada_cmdlist
, "maintenance show ada ",
13586 0/*allow-unknown*/, &maintenance_show_cmdlist
);
13588 add_setshow_boolean_cmd
13589 ("ignore-descriptive-types", class_maintenance
,
13590 &ada_ignore_descriptive_types_p
,
13591 _("Set whether descriptive types generated by GNAT should be ignored."),
13592 _("Show whether descriptive types generated by GNAT should be ignored."),
13594 When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
13595 DWARF attribute."),
13596 NULL
, NULL
, &maint_set_ada_cmdlist
, &maint_show_ada_cmdlist
);
13598 obstack_init (&symbol_list_obstack
);
13600 decoded_names_store
= htab_create_alloc
13601 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
13602 NULL
, xcalloc
, xfree
);
13604 /* The ada-lang observers. */
13605 observer_attach_new_objfile (ada_new_objfile_observer
);
13606 observer_attach_free_objfile (ada_free_objfile_observer
);
13607 observer_attach_inferior_exit (ada_inferior_exit
);
13609 /* Setup various context-specific data. */
13611 = register_inferior_data_with_cleanup (NULL
, ada_inferior_data_cleanup
);
13612 ada_pspace_data_handle
13613 = register_program_space_data_with_cleanup (NULL
, ada_pspace_data_cleanup
);