1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static int full_match (const char *, const char *);
106 static struct value
*make_array_descriptor (struct type
*, struct value
*);
108 static void ada_add_block_symbols (struct obstack
*,
109 struct block
*, const char *,
110 domain_enum
, struct objfile
*, int);
112 static int is_nonfunction (struct ada_symbol_info
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
117 static int num_defns_collected (struct obstack
*);
119 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (struct expression
**, int *, int,
124 static void replace_operator_with_call (struct expression
**, int, int, int,
125 struct symbol
*, struct block
*);
127 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
129 static char *ada_op_name (enum exp_opcode
);
131 static const char *ada_decoded_op_name (enum exp_opcode
);
133 static int numeric_type_p (struct type
*);
135 static int integer_type_p (struct type
*);
137 static int scalar_type_p (struct type
*);
139 static int discrete_type_p (struct type
*);
141 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
146 static struct symbol
*find_old_style_renaming_symbol (const char *,
149 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
152 static struct value
*evaluate_subexp_type (struct expression
*, int *);
154 static struct type
*ada_find_parallel_type_with_name (struct type
*,
157 static int is_dynamic_field (struct type
*, int);
159 static struct type
*to_fixed_variant_branch_type (struct type
*,
161 CORE_ADDR
, struct value
*);
163 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
165 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
167 static struct type
*to_static_fixed_type (struct type
*);
168 static struct type
*static_unwrap_type (struct type
*type
);
170 static struct value
*unwrap_value (struct value
*);
172 static struct type
*constrained_packed_array_type (struct type
*, long *);
174 static struct type
*decode_constrained_packed_array_type (struct type
*);
176 static long decode_packed_array_bitsize (struct type
*);
178 static struct value
*decode_constrained_packed_array (struct value
*);
180 static int ada_is_packed_array_type (struct type
*);
182 static int ada_is_unconstrained_packed_array_type (struct type
*);
184 static struct value
*value_subscript_packed (struct value
*, int,
187 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
189 static struct value
*coerce_unspec_val_to_type (struct value
*,
192 static struct value
*get_var_value (char *, char *);
194 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
196 static int equiv_types (struct type
*, struct type
*);
198 static int is_name_suffix (const char *);
200 static int advance_wild_match (const char **, const char *, int);
202 static int wild_match (const char *, const char *);
204 static struct value
*ada_coerce_ref (struct value
*);
206 static LONGEST
pos_atr (struct value
*);
208 static struct value
*value_pos_atr (struct type
*, struct value
*);
210 static struct value
*value_val_atr (struct type
*, struct value
*);
212 static struct symbol
*standard_lookup (const char *, const struct block
*,
215 static struct value
*ada_search_struct_field (char *, struct value
*, int,
218 static struct value
*ada_value_primitive_field (struct value
*, int, int,
221 static int find_struct_field (char *, struct type
*, int,
222 struct type
**, int *, int *, int *, int *);
224 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
227 static int ada_resolve_function (struct ada_symbol_info
*, int,
228 struct value
**, int, const char *,
231 static int ada_is_direct_array_type (struct type
*);
233 static void ada_language_arch_info (struct gdbarch
*,
234 struct language_arch_info
*);
236 static void check_size (const struct type
*);
238 static struct value
*ada_index_struct_field (int, struct value
*, int,
241 static struct value
*assign_aggregate (struct value
*, struct value
*,
245 static void aggregate_assign_from_choices (struct value
*, struct value
*,
247 int *, LONGEST
*, int *,
248 int, LONGEST
, LONGEST
);
250 static void aggregate_assign_positional (struct value
*, struct value
*,
252 int *, LONGEST
*, int *, int,
256 static void aggregate_assign_others (struct value
*, struct value
*,
258 int *, LONGEST
*, int, LONGEST
, LONGEST
);
261 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
264 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
267 static void ada_forward_operator_length (struct expression
*, int, int *,
272 /* Maximum-sized dynamic type. */
273 static unsigned int varsize_limit
;
275 /* FIXME: brobecker/2003-09-17: No longer a const because it is
276 returned by a function that does not return a const char *. */
277 static char *ada_completer_word_break_characters
=
279 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
281 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
284 /* The name of the symbol to use to get the name of the main subprogram. */
285 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
286 = "__gnat_ada_main_program_name";
288 /* Limit on the number of warnings to raise per expression evaluation. */
289 static int warning_limit
= 2;
291 /* Number of warning messages issued; reset to 0 by cleanups after
292 expression evaluation. */
293 static int warnings_issued
= 0;
295 static const char *known_runtime_file_name_patterns
[] = {
296 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
299 static const char *known_auxiliary_function_name_patterns
[] = {
300 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
303 /* Space for allocating results of ada_lookup_symbol_list. */
304 static struct obstack symbol_list_obstack
;
306 /* Inferior-specific data. */
308 /* Per-inferior data for this module. */
310 struct ada_inferior_data
312 /* The ada__tags__type_specific_data type, which is used when decoding
313 tagged types. With older versions of GNAT, this type was directly
314 accessible through a component ("tsd") in the object tag. But this
315 is no longer the case, so we cache it for each inferior. */
316 struct type
*tsd_type
;
319 /* Our key to this module's inferior data. */
320 static const struct inferior_data
*ada_inferior_data
;
322 /* A cleanup routine for our inferior data. */
324 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
326 struct ada_inferior_data
*data
;
328 data
= inferior_data (inf
, ada_inferior_data
);
333 /* Return our inferior data for the given inferior (INF).
335 This function always returns a valid pointer to an allocated
336 ada_inferior_data structure. If INF's inferior data has not
337 been previously set, this functions creates a new one with all
338 fields set to zero, sets INF's inferior to it, and then returns
339 a pointer to that newly allocated ada_inferior_data. */
341 static struct ada_inferior_data
*
342 get_ada_inferior_data (struct inferior
*inf
)
344 struct ada_inferior_data
*data
;
346 data
= inferior_data (inf
, ada_inferior_data
);
349 data
= XZALLOC (struct ada_inferior_data
);
350 set_inferior_data (inf
, ada_inferior_data
, data
);
356 /* Perform all necessary cleanups regarding our module's inferior data
357 that is required after the inferior INF just exited. */
360 ada_inferior_exit (struct inferior
*inf
)
362 ada_inferior_data_cleanup (inf
, NULL
);
363 set_inferior_data (inf
, ada_inferior_data
, NULL
);
368 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
369 all typedef layers have been peeled. Otherwise, return TYPE.
371 Normally, we really expect a typedef type to only have 1 typedef layer.
372 In other words, we really expect the target type of a typedef type to be
373 a non-typedef type. This is particularly true for Ada units, because
374 the language does not have a typedef vs not-typedef distinction.
375 In that respect, the Ada compiler has been trying to eliminate as many
376 typedef definitions in the debugging information, since they generally
377 do not bring any extra information (we still use typedef under certain
378 circumstances related mostly to the GNAT encoding).
380 Unfortunately, we have seen situations where the debugging information
381 generated by the compiler leads to such multiple typedef layers. For
382 instance, consider the following example with stabs:
384 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
385 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
387 This is an error in the debugging information which causes type
388 pck__float_array___XUP to be defined twice, and the second time,
389 it is defined as a typedef of a typedef.
391 This is on the fringe of legality as far as debugging information is
392 concerned, and certainly unexpected. But it is easy to handle these
393 situations correctly, so we can afford to be lenient in this case. */
396 ada_typedef_target_type (struct type
*type
)
398 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
399 type
= TYPE_TARGET_TYPE (type
);
403 /* Given DECODED_NAME a string holding a symbol name in its
404 decoded form (ie using the Ada dotted notation), returns
405 its unqualified name. */
408 ada_unqualified_name (const char *decoded_name
)
410 const char *result
= strrchr (decoded_name
, '.');
413 result
++; /* Skip the dot... */
415 result
= decoded_name
;
420 /* Return a string starting with '<', followed by STR, and '>'.
421 The result is good until the next call. */
424 add_angle_brackets (const char *str
)
426 static char *result
= NULL
;
429 result
= xstrprintf ("<%s>", str
);
434 ada_get_gdb_completer_word_break_characters (void)
436 return ada_completer_word_break_characters
;
439 /* Print an array element index using the Ada syntax. */
442 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
443 const struct value_print_options
*options
)
445 LA_VALUE_PRINT (index_value
, stream
, options
);
446 fprintf_filtered (stream
, " => ");
449 /* Assuming VECT points to an array of *SIZE objects of size
450 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
451 updating *SIZE as necessary and returning the (new) array. */
454 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
456 if (*size
< min_size
)
459 if (*size
< min_size
)
461 vect
= xrealloc (vect
, *size
* element_size
);
466 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
467 suffix of FIELD_NAME beginning "___". */
470 field_name_match (const char *field_name
, const char *target
)
472 int len
= strlen (target
);
475 (strncmp (field_name
, target
, len
) == 0
476 && (field_name
[len
] == '\0'
477 || (strncmp (field_name
+ len
, "___", 3) == 0
478 && strcmp (field_name
+ strlen (field_name
) - 6,
483 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
484 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
485 and return its index. This function also handles fields whose name
486 have ___ suffixes because the compiler sometimes alters their name
487 by adding such a suffix to represent fields with certain constraints.
488 If the field could not be found, return a negative number if
489 MAYBE_MISSING is set. Otherwise raise an error. */
492 ada_get_field_index (const struct type
*type
, const char *field_name
,
496 struct type
*struct_type
= check_typedef ((struct type
*) type
);
498 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
499 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
503 error (_("Unable to find field %s in struct %s. Aborting"),
504 field_name
, TYPE_NAME (struct_type
));
509 /* The length of the prefix of NAME prior to any "___" suffix. */
512 ada_name_prefix_len (const char *name
)
518 const char *p
= strstr (name
, "___");
521 return strlen (name
);
527 /* Return non-zero if SUFFIX is a suffix of STR.
528 Return zero if STR is null. */
531 is_suffix (const char *str
, const char *suffix
)
538 len2
= strlen (suffix
);
539 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
542 /* The contents of value VAL, treated as a value of type TYPE. The
543 result is an lval in memory if VAL is. */
545 static struct value
*
546 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
548 type
= ada_check_typedef (type
);
549 if (value_type (val
) == type
)
553 struct value
*result
;
555 /* Make sure that the object size is not unreasonable before
556 trying to allocate some memory for it. */
560 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
561 result
= allocate_value_lazy (type
);
564 result
= allocate_value (type
);
565 memcpy (value_contents_raw (result
), value_contents (val
),
568 set_value_component_location (result
, val
);
569 set_value_bitsize (result
, value_bitsize (val
));
570 set_value_bitpos (result
, value_bitpos (val
));
571 set_value_address (result
, value_address (val
));
576 static const gdb_byte
*
577 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
582 return valaddr
+ offset
;
586 cond_offset_target (CORE_ADDR address
, long offset
)
591 return address
+ offset
;
594 /* Issue a warning (as for the definition of warning in utils.c, but
595 with exactly one argument rather than ...), unless the limit on the
596 number of warnings has passed during the evaluation of the current
599 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
600 provided by "complaint". */
601 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
604 lim_warning (const char *format
, ...)
608 va_start (args
, format
);
609 warnings_issued
+= 1;
610 if (warnings_issued
<= warning_limit
)
611 vwarning (format
, args
);
616 /* Issue an error if the size of an object of type T is unreasonable,
617 i.e. if it would be a bad idea to allocate a value of this type in
621 check_size (const struct type
*type
)
623 if (TYPE_LENGTH (type
) > varsize_limit
)
624 error (_("object size is larger than varsize-limit"));
627 /* Maximum value of a SIZE-byte signed integer type. */
629 max_of_size (int size
)
631 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
633 return top_bit
| (top_bit
- 1);
636 /* Minimum value of a SIZE-byte signed integer type. */
638 min_of_size (int size
)
640 return -max_of_size (size
) - 1;
643 /* Maximum value of a SIZE-byte unsigned integer type. */
645 umax_of_size (int size
)
647 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
649 return top_bit
| (top_bit
- 1);
652 /* Maximum value of integral type T, as a signed quantity. */
654 max_of_type (struct type
*t
)
656 if (TYPE_UNSIGNED (t
))
657 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
659 return max_of_size (TYPE_LENGTH (t
));
662 /* Minimum value of integral type T, as a signed quantity. */
664 min_of_type (struct type
*t
)
666 if (TYPE_UNSIGNED (t
))
669 return min_of_size (TYPE_LENGTH (t
));
672 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
674 ada_discrete_type_high_bound (struct type
*type
)
676 switch (TYPE_CODE (type
))
678 case TYPE_CODE_RANGE
:
679 return TYPE_HIGH_BOUND (type
);
681 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
686 return max_of_type (type
);
688 error (_("Unexpected type in ada_discrete_type_high_bound."));
692 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
694 ada_discrete_type_low_bound (struct type
*type
)
696 switch (TYPE_CODE (type
))
698 case TYPE_CODE_RANGE
:
699 return TYPE_LOW_BOUND (type
);
701 return TYPE_FIELD_BITPOS (type
, 0);
706 return min_of_type (type
);
708 error (_("Unexpected type in ada_discrete_type_low_bound."));
712 /* The identity on non-range types. For range types, the underlying
713 non-range scalar type. */
716 base_type (struct type
*type
)
718 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
720 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
722 type
= TYPE_TARGET_TYPE (type
);
728 /* Language Selection */
730 /* If the main program is in Ada, return language_ada, otherwise return LANG
731 (the main program is in Ada iif the adainit symbol is found). */
734 ada_update_initial_language (enum language lang
)
736 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
737 (struct objfile
*) NULL
) != NULL
)
743 /* If the main procedure is written in Ada, then return its name.
744 The result is good until the next call. Return NULL if the main
745 procedure doesn't appear to be in Ada. */
750 struct minimal_symbol
*msym
;
751 static char *main_program_name
= NULL
;
753 /* For Ada, the name of the main procedure is stored in a specific
754 string constant, generated by the binder. Look for that symbol,
755 extract its address, and then read that string. If we didn't find
756 that string, then most probably the main procedure is not written
758 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
762 CORE_ADDR main_program_name_addr
;
765 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
766 if (main_program_name_addr
== 0)
767 error (_("Invalid address for Ada main program name."));
769 xfree (main_program_name
);
770 target_read_string (main_program_name_addr
, &main_program_name
,
775 return main_program_name
;
778 /* The main procedure doesn't seem to be in Ada. */
784 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
787 const struct ada_opname_map ada_opname_table
[] = {
788 {"Oadd", "\"+\"", BINOP_ADD
},
789 {"Osubtract", "\"-\"", BINOP_SUB
},
790 {"Omultiply", "\"*\"", BINOP_MUL
},
791 {"Odivide", "\"/\"", BINOP_DIV
},
792 {"Omod", "\"mod\"", BINOP_MOD
},
793 {"Orem", "\"rem\"", BINOP_REM
},
794 {"Oexpon", "\"**\"", BINOP_EXP
},
795 {"Olt", "\"<\"", BINOP_LESS
},
796 {"Ole", "\"<=\"", BINOP_LEQ
},
797 {"Ogt", "\">\"", BINOP_GTR
},
798 {"Oge", "\">=\"", BINOP_GEQ
},
799 {"Oeq", "\"=\"", BINOP_EQUAL
},
800 {"One", "\"/=\"", BINOP_NOTEQUAL
},
801 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
802 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
803 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
804 {"Oconcat", "\"&\"", BINOP_CONCAT
},
805 {"Oabs", "\"abs\"", UNOP_ABS
},
806 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
807 {"Oadd", "\"+\"", UNOP_PLUS
},
808 {"Osubtract", "\"-\"", UNOP_NEG
},
812 /* The "encoded" form of DECODED, according to GNAT conventions.
813 The result is valid until the next call to ada_encode. */
816 ada_encode (const char *decoded
)
818 static char *encoding_buffer
= NULL
;
819 static size_t encoding_buffer_size
= 0;
826 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
827 2 * strlen (decoded
) + 10);
830 for (p
= decoded
; *p
!= '\0'; p
+= 1)
834 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
839 const struct ada_opname_map
*mapping
;
841 for (mapping
= ada_opname_table
;
842 mapping
->encoded
!= NULL
843 && strncmp (mapping
->decoded
, p
,
844 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
846 if (mapping
->encoded
== NULL
)
847 error (_("invalid Ada operator name: %s"), p
);
848 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
849 k
+= strlen (mapping
->encoded
);
854 encoding_buffer
[k
] = *p
;
859 encoding_buffer
[k
] = '\0';
860 return encoding_buffer
;
863 /* Return NAME folded to lower case, or, if surrounded by single
864 quotes, unfolded, but with the quotes stripped away. Result good
868 ada_fold_name (const char *name
)
870 static char *fold_buffer
= NULL
;
871 static size_t fold_buffer_size
= 0;
873 int len
= strlen (name
);
874 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
878 strncpy (fold_buffer
, name
+ 1, len
- 2);
879 fold_buffer
[len
- 2] = '\000';
885 for (i
= 0; i
<= len
; i
+= 1)
886 fold_buffer
[i
] = tolower (name
[i
]);
892 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
895 is_lower_alphanum (const char c
)
897 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
900 /* Remove either of these suffixes:
905 These are suffixes introduced by the compiler for entities such as
906 nested subprogram for instance, in order to avoid name clashes.
907 They do not serve any purpose for the debugger. */
910 ada_remove_trailing_digits (const char *encoded
, int *len
)
912 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
916 while (i
> 0 && isdigit (encoded
[i
]))
918 if (i
>= 0 && encoded
[i
] == '.')
920 else if (i
>= 0 && encoded
[i
] == '$')
922 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
924 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
929 /* Remove the suffix introduced by the compiler for protected object
933 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
935 /* Remove trailing N. */
937 /* Protected entry subprograms are broken into two
938 separate subprograms: The first one is unprotected, and has
939 a 'N' suffix; the second is the protected version, and has
940 the 'P' suffix. The second calls the first one after handling
941 the protection. Since the P subprograms are internally generated,
942 we leave these names undecoded, giving the user a clue that this
943 entity is internal. */
946 && encoded
[*len
- 1] == 'N'
947 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
951 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
954 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
958 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
961 if (encoded
[i
] != 'X')
967 if (isalnum (encoded
[i
-1]))
971 /* If ENCODED follows the GNAT entity encoding conventions, then return
972 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
975 The resulting string is valid until the next call of ada_decode.
976 If the string is unchanged by decoding, the original string pointer
980 ada_decode (const char *encoded
)
987 static char *decoding_buffer
= NULL
;
988 static size_t decoding_buffer_size
= 0;
990 /* The name of the Ada main procedure starts with "_ada_".
991 This prefix is not part of the decoded name, so skip this part
992 if we see this prefix. */
993 if (strncmp (encoded
, "_ada_", 5) == 0)
996 /* If the name starts with '_', then it is not a properly encoded
997 name, so do not attempt to decode it. Similarly, if the name
998 starts with '<', the name should not be decoded. */
999 if (encoded
[0] == '_' || encoded
[0] == '<')
1002 len0
= strlen (encoded
);
1004 ada_remove_trailing_digits (encoded
, &len0
);
1005 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1007 /* Remove the ___X.* suffix if present. Do not forget to verify that
1008 the suffix is located before the current "end" of ENCODED. We want
1009 to avoid re-matching parts of ENCODED that have previously been
1010 marked as discarded (by decrementing LEN0). */
1011 p
= strstr (encoded
, "___");
1012 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1020 /* Remove any trailing TKB suffix. It tells us that this symbol
1021 is for the body of a task, but that information does not actually
1022 appear in the decoded name. */
1024 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1027 /* Remove any trailing TB suffix. The TB suffix is slightly different
1028 from the TKB suffix because it is used for non-anonymous task
1031 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1034 /* Remove trailing "B" suffixes. */
1035 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1037 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1040 /* Make decoded big enough for possible expansion by operator name. */
1042 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1043 decoded
= decoding_buffer
;
1045 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1047 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1050 while ((i
>= 0 && isdigit (encoded
[i
]))
1051 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1053 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1055 else if (encoded
[i
] == '$')
1059 /* The first few characters that are not alphabetic are not part
1060 of any encoding we use, so we can copy them over verbatim. */
1062 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1063 decoded
[j
] = encoded
[i
];
1068 /* Is this a symbol function? */
1069 if (at_start_name
&& encoded
[i
] == 'O')
1073 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1075 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1076 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1078 && !isalnum (encoded
[i
+ op_len
]))
1080 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1083 j
+= strlen (ada_opname_table
[k
].decoded
);
1087 if (ada_opname_table
[k
].encoded
!= NULL
)
1092 /* Replace "TK__" with "__", which will eventually be translated
1093 into "." (just below). */
1095 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1098 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1099 be translated into "." (just below). These are internal names
1100 generated for anonymous blocks inside which our symbol is nested. */
1102 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1103 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1104 && isdigit (encoded
[i
+4]))
1108 while (k
< len0
&& isdigit (encoded
[k
]))
1109 k
++; /* Skip any extra digit. */
1111 /* Double-check that the "__B_{DIGITS}+" sequence we found
1112 is indeed followed by "__". */
1113 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1117 /* Remove _E{DIGITS}+[sb] */
1119 /* Just as for protected object subprograms, there are 2 categories
1120 of subprograms created by the compiler for each entry. The first
1121 one implements the actual entry code, and has a suffix following
1122 the convention above; the second one implements the barrier and
1123 uses the same convention as above, except that the 'E' is replaced
1126 Just as above, we do not decode the name of barrier functions
1127 to give the user a clue that the code he is debugging has been
1128 internally generated. */
1130 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1131 && isdigit (encoded
[i
+2]))
1135 while (k
< len0
&& isdigit (encoded
[k
]))
1139 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1142 /* Just as an extra precaution, make sure that if this
1143 suffix is followed by anything else, it is a '_'.
1144 Otherwise, we matched this sequence by accident. */
1146 || (k
< len0
&& encoded
[k
] == '_'))
1151 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1152 the GNAT front-end in protected object subprograms. */
1155 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1157 /* Backtrack a bit up until we reach either the begining of
1158 the encoded name, or "__". Make sure that we only find
1159 digits or lowercase characters. */
1160 const char *ptr
= encoded
+ i
- 1;
1162 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1165 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1169 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1171 /* This is a X[bn]* sequence not separated from the previous
1172 part of the name with a non-alpha-numeric character (in other
1173 words, immediately following an alpha-numeric character), then
1174 verify that it is placed at the end of the encoded name. If
1175 not, then the encoding is not valid and we should abort the
1176 decoding. Otherwise, just skip it, it is used in body-nested
1180 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1184 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1186 /* Replace '__' by '.'. */
1194 /* It's a character part of the decoded name, so just copy it
1196 decoded
[j
] = encoded
[i
];
1201 decoded
[j
] = '\000';
1203 /* Decoded names should never contain any uppercase character.
1204 Double-check this, and abort the decoding if we find one. */
1206 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1207 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1210 if (strcmp (decoded
, encoded
) == 0)
1216 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1217 decoded
= decoding_buffer
;
1218 if (encoded
[0] == '<')
1219 strcpy (decoded
, encoded
);
1221 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1226 /* Table for keeping permanent unique copies of decoded names. Once
1227 allocated, names in this table are never released. While this is a
1228 storage leak, it should not be significant unless there are massive
1229 changes in the set of decoded names in successive versions of a
1230 symbol table loaded during a single session. */
1231 static struct htab
*decoded_names_store
;
1233 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1234 in the language-specific part of GSYMBOL, if it has not been
1235 previously computed. Tries to save the decoded name in the same
1236 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1237 in any case, the decoded symbol has a lifetime at least that of
1239 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1240 const, but nevertheless modified to a semantically equivalent form
1241 when a decoded name is cached in it. */
1244 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1247 (char **) &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1249 if (*resultp
== NULL
)
1251 const char *decoded
= ada_decode (gsymbol
->name
);
1253 if (gsymbol
->obj_section
!= NULL
)
1255 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1257 *resultp
= obsavestring (decoded
, strlen (decoded
),
1258 &objf
->objfile_obstack
);
1260 /* Sometimes, we can't find a corresponding objfile, in which
1261 case, we put the result on the heap. Since we only decode
1262 when needed, we hope this usually does not cause a
1263 significant memory leak (FIXME). */
1264 if (*resultp
== NULL
)
1266 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1270 *slot
= xstrdup (decoded
);
1279 ada_la_decode (const char *encoded
, int options
)
1281 return xstrdup (ada_decode (encoded
));
1284 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1285 suffixes that encode debugging information or leading _ada_ on
1286 SYM_NAME (see is_name_suffix commentary for the debugging
1287 information that is ignored). If WILD, then NAME need only match a
1288 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1289 either argument is NULL. */
1292 match_name (const char *sym_name
, const char *name
, int wild
)
1294 if (sym_name
== NULL
|| name
== NULL
)
1297 return wild_match (sym_name
, name
) == 0;
1300 int len_name
= strlen (name
);
1302 return (strncmp (sym_name
, name
, len_name
) == 0
1303 && is_name_suffix (sym_name
+ len_name
))
1304 || (strncmp (sym_name
, "_ada_", 5) == 0
1305 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1306 && is_name_suffix (sym_name
+ len_name
+ 5));
1313 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1314 generated by the GNAT compiler to describe the index type used
1315 for each dimension of an array, check whether it follows the latest
1316 known encoding. If not, fix it up to conform to the latest encoding.
1317 Otherwise, do nothing. This function also does nothing if
1318 INDEX_DESC_TYPE is NULL.
1320 The GNAT encoding used to describle the array index type evolved a bit.
1321 Initially, the information would be provided through the name of each
1322 field of the structure type only, while the type of these fields was
1323 described as unspecified and irrelevant. The debugger was then expected
1324 to perform a global type lookup using the name of that field in order
1325 to get access to the full index type description. Because these global
1326 lookups can be very expensive, the encoding was later enhanced to make
1327 the global lookup unnecessary by defining the field type as being
1328 the full index type description.
1330 The purpose of this routine is to allow us to support older versions
1331 of the compiler by detecting the use of the older encoding, and by
1332 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1333 we essentially replace each field's meaningless type by the associated
1337 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1341 if (index_desc_type
== NULL
)
1343 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1345 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1346 to check one field only, no need to check them all). If not, return
1349 If our INDEX_DESC_TYPE was generated using the older encoding,
1350 the field type should be a meaningless integer type whose name
1351 is not equal to the field name. */
1352 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1353 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1354 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1357 /* Fixup each field of INDEX_DESC_TYPE. */
1358 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1360 char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1361 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1364 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1368 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1370 static char *bound_name
[] = {
1371 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1372 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1375 /* Maximum number of array dimensions we are prepared to handle. */
1377 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1380 /* The desc_* routines return primitive portions of array descriptors
1383 /* The descriptor or array type, if any, indicated by TYPE; removes
1384 level of indirection, if needed. */
1386 static struct type
*
1387 desc_base_type (struct type
*type
)
1391 type
= ada_check_typedef (type
);
1392 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1393 type
= ada_typedef_target_type (type
);
1396 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1397 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1398 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1403 /* True iff TYPE indicates a "thin" array pointer type. */
1406 is_thin_pntr (struct type
*type
)
1409 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1410 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1413 /* The descriptor type for thin pointer type TYPE. */
1415 static struct type
*
1416 thin_descriptor_type (struct type
*type
)
1418 struct type
*base_type
= desc_base_type (type
);
1420 if (base_type
== NULL
)
1422 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1426 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1428 if (alt_type
== NULL
)
1435 /* A pointer to the array data for thin-pointer value VAL. */
1437 static struct value
*
1438 thin_data_pntr (struct value
*val
)
1440 struct type
*type
= value_type (val
);
1441 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1443 data_type
= lookup_pointer_type (data_type
);
1445 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1446 return value_cast (data_type
, value_copy (val
));
1448 return value_from_longest (data_type
, value_address (val
));
1451 /* True iff TYPE indicates a "thick" array pointer type. */
1454 is_thick_pntr (struct type
*type
)
1456 type
= desc_base_type (type
);
1457 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1458 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1461 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1462 pointer to one, the type of its bounds data; otherwise, NULL. */
1464 static struct type
*
1465 desc_bounds_type (struct type
*type
)
1469 type
= desc_base_type (type
);
1473 else if (is_thin_pntr (type
))
1475 type
= thin_descriptor_type (type
);
1478 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1480 return ada_check_typedef (r
);
1482 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1484 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1486 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1491 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1492 one, a pointer to its bounds data. Otherwise NULL. */
1494 static struct value
*
1495 desc_bounds (struct value
*arr
)
1497 struct type
*type
= ada_check_typedef (value_type (arr
));
1499 if (is_thin_pntr (type
))
1501 struct type
*bounds_type
=
1502 desc_bounds_type (thin_descriptor_type (type
));
1505 if (bounds_type
== NULL
)
1506 error (_("Bad GNAT array descriptor"));
1508 /* NOTE: The following calculation is not really kosher, but
1509 since desc_type is an XVE-encoded type (and shouldn't be),
1510 the correct calculation is a real pain. FIXME (and fix GCC). */
1511 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1512 addr
= value_as_long (arr
);
1514 addr
= value_address (arr
);
1517 value_from_longest (lookup_pointer_type (bounds_type
),
1518 addr
- TYPE_LENGTH (bounds_type
));
1521 else if (is_thick_pntr (type
))
1523 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1524 _("Bad GNAT array descriptor"));
1525 struct type
*p_bounds_type
= value_type (p_bounds
);
1528 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1530 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1532 if (TYPE_STUB (target_type
))
1533 p_bounds
= value_cast (lookup_pointer_type
1534 (ada_check_typedef (target_type
)),
1538 error (_("Bad GNAT array descriptor"));
1546 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1547 position of the field containing the address of the bounds data. */
1550 fat_pntr_bounds_bitpos (struct type
*type
)
1552 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1555 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1556 size of the field containing the address of the bounds data. */
1559 fat_pntr_bounds_bitsize (struct type
*type
)
1561 type
= desc_base_type (type
);
1563 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1564 return TYPE_FIELD_BITSIZE (type
, 1);
1566 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1569 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1570 pointer to one, the type of its array data (a array-with-no-bounds type);
1571 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1574 static struct type
*
1575 desc_data_target_type (struct type
*type
)
1577 type
= desc_base_type (type
);
1579 /* NOTE: The following is bogus; see comment in desc_bounds. */
1580 if (is_thin_pntr (type
))
1581 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1582 else if (is_thick_pntr (type
))
1584 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1587 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1588 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1594 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1597 static struct value
*
1598 desc_data (struct value
*arr
)
1600 struct type
*type
= value_type (arr
);
1602 if (is_thin_pntr (type
))
1603 return thin_data_pntr (arr
);
1604 else if (is_thick_pntr (type
))
1605 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1606 _("Bad GNAT array descriptor"));
1612 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1613 position of the field containing the address of the data. */
1616 fat_pntr_data_bitpos (struct type
*type
)
1618 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1621 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1622 size of the field containing the address of the data. */
1625 fat_pntr_data_bitsize (struct type
*type
)
1627 type
= desc_base_type (type
);
1629 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1630 return TYPE_FIELD_BITSIZE (type
, 0);
1632 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1635 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1636 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1637 bound, if WHICH is 1. The first bound is I=1. */
1639 static struct value
*
1640 desc_one_bound (struct value
*bounds
, int i
, int which
)
1642 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1643 _("Bad GNAT array descriptor bounds"));
1646 /* If BOUNDS is an array-bounds structure type, return the bit position
1647 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1648 bound, if WHICH is 1. The first bound is I=1. */
1651 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1653 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1656 /* If BOUNDS is an array-bounds structure type, return the bit field size
1657 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1658 bound, if WHICH is 1. The first bound is I=1. */
1661 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1663 type
= desc_base_type (type
);
1665 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1666 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1668 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1671 /* If TYPE is the type of an array-bounds structure, the type of its
1672 Ith bound (numbering from 1). Otherwise, NULL. */
1674 static struct type
*
1675 desc_index_type (struct type
*type
, int i
)
1677 type
= desc_base_type (type
);
1679 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1680 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1685 /* The number of index positions in the array-bounds type TYPE.
1686 Return 0 if TYPE is NULL. */
1689 desc_arity (struct type
*type
)
1691 type
= desc_base_type (type
);
1694 return TYPE_NFIELDS (type
) / 2;
1698 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1699 an array descriptor type (representing an unconstrained array
1703 ada_is_direct_array_type (struct type
*type
)
1707 type
= ada_check_typedef (type
);
1708 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1709 || ada_is_array_descriptor_type (type
));
1712 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1716 ada_is_array_type (struct type
*type
)
1719 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1720 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1721 type
= TYPE_TARGET_TYPE (type
);
1722 return ada_is_direct_array_type (type
);
1725 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1728 ada_is_simple_array_type (struct type
*type
)
1732 type
= ada_check_typedef (type
);
1733 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1734 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1735 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1738 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1741 ada_is_array_descriptor_type (struct type
*type
)
1743 struct type
*data_type
= desc_data_target_type (type
);
1747 type
= ada_check_typedef (type
);
1748 return (data_type
!= NULL
1749 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1750 && desc_arity (desc_bounds_type (type
)) > 0);
1753 /* Non-zero iff type is a partially mal-formed GNAT array
1754 descriptor. FIXME: This is to compensate for some problems with
1755 debugging output from GNAT. Re-examine periodically to see if it
1759 ada_is_bogus_array_descriptor (struct type
*type
)
1763 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1764 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1765 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1766 && !ada_is_array_descriptor_type (type
);
1770 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1771 (fat pointer) returns the type of the array data described---specifically,
1772 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1773 in from the descriptor; otherwise, they are left unspecified. If
1774 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1775 returns NULL. The result is simply the type of ARR if ARR is not
1778 ada_type_of_array (struct value
*arr
, int bounds
)
1780 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1781 return decode_constrained_packed_array_type (value_type (arr
));
1783 if (!ada_is_array_descriptor_type (value_type (arr
)))
1784 return value_type (arr
);
1788 struct type
*array_type
=
1789 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1791 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1792 TYPE_FIELD_BITSIZE (array_type
, 0) =
1793 decode_packed_array_bitsize (value_type (arr
));
1799 struct type
*elt_type
;
1801 struct value
*descriptor
;
1803 elt_type
= ada_array_element_type (value_type (arr
), -1);
1804 arity
= ada_array_arity (value_type (arr
));
1806 if (elt_type
== NULL
|| arity
== 0)
1807 return ada_check_typedef (value_type (arr
));
1809 descriptor
= desc_bounds (arr
);
1810 if (value_as_long (descriptor
) == 0)
1814 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1815 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1816 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1817 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1820 create_range_type (range_type
, value_type (low
),
1821 longest_to_int (value_as_long (low
)),
1822 longest_to_int (value_as_long (high
)));
1823 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1825 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1827 /* We need to store the element packed bitsize, as well as
1828 recompute the array size, because it was previously
1829 computed based on the unpacked element size. */
1830 LONGEST lo
= value_as_long (low
);
1831 LONGEST hi
= value_as_long (high
);
1833 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1834 decode_packed_array_bitsize (value_type (arr
));
1835 /* If the array has no element, then the size is already
1836 zero, and does not need to be recomputed. */
1840 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1842 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1847 return lookup_pointer_type (elt_type
);
1851 /* If ARR does not represent an array, returns ARR unchanged.
1852 Otherwise, returns either a standard GDB array with bounds set
1853 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1854 GDB array. Returns NULL if ARR is a null fat pointer. */
1857 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1859 if (ada_is_array_descriptor_type (value_type (arr
)))
1861 struct type
*arrType
= ada_type_of_array (arr
, 1);
1863 if (arrType
== NULL
)
1865 return value_cast (arrType
, value_copy (desc_data (arr
)));
1867 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1868 return decode_constrained_packed_array (arr
);
1873 /* If ARR does not represent an array, returns ARR unchanged.
1874 Otherwise, returns a standard GDB array describing ARR (which may
1875 be ARR itself if it already is in the proper form). */
1878 ada_coerce_to_simple_array (struct value
*arr
)
1880 if (ada_is_array_descriptor_type (value_type (arr
)))
1882 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1885 error (_("Bounds unavailable for null array pointer."));
1886 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1887 return value_ind (arrVal
);
1889 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1890 return decode_constrained_packed_array (arr
);
1895 /* If TYPE represents a GNAT array type, return it translated to an
1896 ordinary GDB array type (possibly with BITSIZE fields indicating
1897 packing). For other types, is the identity. */
1900 ada_coerce_to_simple_array_type (struct type
*type
)
1902 if (ada_is_constrained_packed_array_type (type
))
1903 return decode_constrained_packed_array_type (type
);
1905 if (ada_is_array_descriptor_type (type
))
1906 return ada_check_typedef (desc_data_target_type (type
));
1911 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1914 ada_is_packed_array_type (struct type
*type
)
1918 type
= desc_base_type (type
);
1919 type
= ada_check_typedef (type
);
1921 ada_type_name (type
) != NULL
1922 && strstr (ada_type_name (type
), "___XP") != NULL
;
1925 /* Non-zero iff TYPE represents a standard GNAT constrained
1926 packed-array type. */
1929 ada_is_constrained_packed_array_type (struct type
*type
)
1931 return ada_is_packed_array_type (type
)
1932 && !ada_is_array_descriptor_type (type
);
1935 /* Non-zero iff TYPE represents an array descriptor for a
1936 unconstrained packed-array type. */
1939 ada_is_unconstrained_packed_array_type (struct type
*type
)
1941 return ada_is_packed_array_type (type
)
1942 && ada_is_array_descriptor_type (type
);
1945 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1946 return the size of its elements in bits. */
1949 decode_packed_array_bitsize (struct type
*type
)
1955 /* Access to arrays implemented as fat pointers are encoded as a typedef
1956 of the fat pointer type. We need the name of the fat pointer type
1957 to do the decoding, so strip the typedef layer. */
1958 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1959 type
= ada_typedef_target_type (type
);
1961 raw_name
= ada_type_name (ada_check_typedef (type
));
1963 raw_name
= ada_type_name (desc_base_type (type
));
1968 tail
= strstr (raw_name
, "___XP");
1969 gdb_assert (tail
!= NULL
);
1971 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1974 (_("could not understand bit size information on packed array"));
1981 /* Given that TYPE is a standard GDB array type with all bounds filled
1982 in, and that the element size of its ultimate scalar constituents
1983 (that is, either its elements, or, if it is an array of arrays, its
1984 elements' elements, etc.) is *ELT_BITS, return an identical type,
1985 but with the bit sizes of its elements (and those of any
1986 constituent arrays) recorded in the BITSIZE components of its
1987 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1990 static struct type
*
1991 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1993 struct type
*new_elt_type
;
1994 struct type
*new_type
;
1995 LONGEST low_bound
, high_bound
;
1997 type
= ada_check_typedef (type
);
1998 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2001 new_type
= alloc_type_copy (type
);
2003 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2005 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
2006 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2007 TYPE_NAME (new_type
) = ada_type_name (type
);
2009 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
2010 &low_bound
, &high_bound
) < 0)
2011 low_bound
= high_bound
= 0;
2012 if (high_bound
< low_bound
)
2013 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2016 *elt_bits
*= (high_bound
- low_bound
+ 1);
2017 TYPE_LENGTH (new_type
) =
2018 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2021 TYPE_FIXED_INSTANCE (new_type
) = 1;
2025 /* The array type encoded by TYPE, where
2026 ada_is_constrained_packed_array_type (TYPE). */
2028 static struct type
*
2029 decode_constrained_packed_array_type (struct type
*type
)
2031 char *raw_name
= ada_type_name (ada_check_typedef (type
));
2034 struct type
*shadow_type
;
2038 raw_name
= ada_type_name (desc_base_type (type
));
2043 name
= (char *) alloca (strlen (raw_name
) + 1);
2044 tail
= strstr (raw_name
, "___XP");
2045 type
= desc_base_type (type
);
2047 memcpy (name
, raw_name
, tail
- raw_name
);
2048 name
[tail
- raw_name
] = '\000';
2050 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2052 if (shadow_type
== NULL
)
2054 lim_warning (_("could not find bounds information on packed array"));
2057 CHECK_TYPEDEF (shadow_type
);
2059 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2061 lim_warning (_("could not understand bounds "
2062 "information on packed array"));
2066 bits
= decode_packed_array_bitsize (type
);
2067 return constrained_packed_array_type (shadow_type
, &bits
);
2070 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2071 array, returns a simple array that denotes that array. Its type is a
2072 standard GDB array type except that the BITSIZEs of the array
2073 target types are set to the number of bits in each element, and the
2074 type length is set appropriately. */
2076 static struct value
*
2077 decode_constrained_packed_array (struct value
*arr
)
2081 arr
= ada_coerce_ref (arr
);
2083 /* If our value is a pointer, then dererence it. Make sure that
2084 this operation does not cause the target type to be fixed, as
2085 this would indirectly cause this array to be decoded. The rest
2086 of the routine assumes that the array hasn't been decoded yet,
2087 so we use the basic "value_ind" routine to perform the dereferencing,
2088 as opposed to using "ada_value_ind". */
2089 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
2090 arr
= value_ind (arr
);
2092 type
= decode_constrained_packed_array_type (value_type (arr
));
2095 error (_("can't unpack array"));
2099 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2100 && ada_is_modular_type (value_type (arr
)))
2102 /* This is a (right-justified) modular type representing a packed
2103 array with no wrapper. In order to interpret the value through
2104 the (left-justified) packed array type we just built, we must
2105 first left-justify it. */
2106 int bit_size
, bit_pos
;
2109 mod
= ada_modulus (value_type (arr
)) - 1;
2116 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2117 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2118 bit_pos
/ HOST_CHAR_BIT
,
2119 bit_pos
% HOST_CHAR_BIT
,
2124 return coerce_unspec_val_to_type (arr
, type
);
2128 /* The value of the element of packed array ARR at the ARITY indices
2129 given in IND. ARR must be a simple array. */
2131 static struct value
*
2132 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2135 int bits
, elt_off
, bit_off
;
2136 long elt_total_bit_offset
;
2137 struct type
*elt_type
;
2141 elt_total_bit_offset
= 0;
2142 elt_type
= ada_check_typedef (value_type (arr
));
2143 for (i
= 0; i
< arity
; i
+= 1)
2145 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2146 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2148 (_("attempt to do packed indexing of "
2149 "something other than a packed array"));
2152 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2153 LONGEST lowerbound
, upperbound
;
2156 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2158 lim_warning (_("don't know bounds of array"));
2159 lowerbound
= upperbound
= 0;
2162 idx
= pos_atr (ind
[i
]);
2163 if (idx
< lowerbound
|| idx
> upperbound
)
2164 lim_warning (_("packed array index %ld out of bounds"),
2166 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2167 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2168 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2171 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2172 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2174 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2179 /* Non-zero iff TYPE includes negative integer values. */
2182 has_negatives (struct type
*type
)
2184 switch (TYPE_CODE (type
))
2189 return !TYPE_UNSIGNED (type
);
2190 case TYPE_CODE_RANGE
:
2191 return TYPE_LOW_BOUND (type
) < 0;
2196 /* Create a new value of type TYPE from the contents of OBJ starting
2197 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2198 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2199 assigning through the result will set the field fetched from.
2200 VALADDR is ignored unless OBJ is NULL, in which case,
2201 VALADDR+OFFSET must address the start of storage containing the
2202 packed value. The value returned in this case is never an lval.
2203 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2206 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2207 long offset
, int bit_offset
, int bit_size
,
2211 int src
, /* Index into the source area */
2212 targ
, /* Index into the target area */
2213 srcBitsLeft
, /* Number of source bits left to move */
2214 nsrc
, ntarg
, /* Number of source and target bytes */
2215 unusedLS
, /* Number of bits in next significant
2216 byte of source that are unused */
2217 accumSize
; /* Number of meaningful bits in accum */
2218 unsigned char *bytes
; /* First byte containing data to unpack */
2219 unsigned char *unpacked
;
2220 unsigned long accum
; /* Staging area for bits being transferred */
2222 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2223 /* Transmit bytes from least to most significant; delta is the direction
2224 the indices move. */
2225 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2227 type
= ada_check_typedef (type
);
2231 v
= allocate_value (type
);
2232 bytes
= (unsigned char *) (valaddr
+ offset
);
2234 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2237 value_address (obj
) + offset
);
2238 bytes
= (unsigned char *) alloca (len
);
2239 read_memory (value_address (v
), bytes
, len
);
2243 v
= allocate_value (type
);
2244 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2251 set_value_component_location (v
, obj
);
2252 new_addr
= value_address (obj
) + offset
;
2253 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2254 set_value_bitsize (v
, bit_size
);
2255 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2258 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2260 set_value_address (v
, new_addr
);
2263 set_value_bitsize (v
, bit_size
);
2264 unpacked
= (unsigned char *) value_contents (v
);
2266 srcBitsLeft
= bit_size
;
2268 ntarg
= TYPE_LENGTH (type
);
2272 memset (unpacked
, 0, TYPE_LENGTH (type
));
2275 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2278 if (has_negatives (type
)
2279 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2283 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2286 switch (TYPE_CODE (type
))
2288 case TYPE_CODE_ARRAY
:
2289 case TYPE_CODE_UNION
:
2290 case TYPE_CODE_STRUCT
:
2291 /* Non-scalar values must be aligned at a byte boundary... */
2293 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2294 /* ... And are placed at the beginning (most-significant) bytes
2296 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2301 targ
= TYPE_LENGTH (type
) - 1;
2307 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2310 unusedLS
= bit_offset
;
2313 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2320 /* Mask for removing bits of the next source byte that are not
2321 part of the value. */
2322 unsigned int unusedMSMask
=
2323 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2325 /* Sign-extend bits for this byte. */
2326 unsigned int signMask
= sign
& ~unusedMSMask
;
2329 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2330 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2331 if (accumSize
>= HOST_CHAR_BIT
)
2333 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2334 accumSize
-= HOST_CHAR_BIT
;
2335 accum
>>= HOST_CHAR_BIT
;
2339 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2346 accum
|= sign
<< accumSize
;
2347 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2348 accumSize
-= HOST_CHAR_BIT
;
2349 accum
>>= HOST_CHAR_BIT
;
2357 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2358 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2361 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2362 int src_offset
, int n
, int bits_big_endian_p
)
2364 unsigned int accum
, mask
;
2365 int accum_bits
, chunk_size
;
2367 target
+= targ_offset
/ HOST_CHAR_BIT
;
2368 targ_offset
%= HOST_CHAR_BIT
;
2369 source
+= src_offset
/ HOST_CHAR_BIT
;
2370 src_offset
%= HOST_CHAR_BIT
;
2371 if (bits_big_endian_p
)
2373 accum
= (unsigned char) *source
;
2375 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2381 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2382 accum_bits
+= HOST_CHAR_BIT
;
2384 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2387 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2388 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2391 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2393 accum_bits
-= chunk_size
;
2400 accum
= (unsigned char) *source
>> src_offset
;
2402 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2406 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2407 accum_bits
+= HOST_CHAR_BIT
;
2409 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2412 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2413 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2415 accum_bits
-= chunk_size
;
2416 accum
>>= chunk_size
;
2423 /* Store the contents of FROMVAL into the location of TOVAL.
2424 Return a new value with the location of TOVAL and contents of
2425 FROMVAL. Handles assignment into packed fields that have
2426 floating-point or non-scalar types. */
2428 static struct value
*
2429 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2431 struct type
*type
= value_type (toval
);
2432 int bits
= value_bitsize (toval
);
2434 toval
= ada_coerce_ref (toval
);
2435 fromval
= ada_coerce_ref (fromval
);
2437 if (ada_is_direct_array_type (value_type (toval
)))
2438 toval
= ada_coerce_to_simple_array (toval
);
2439 if (ada_is_direct_array_type (value_type (fromval
)))
2440 fromval
= ada_coerce_to_simple_array (fromval
);
2442 if (!deprecated_value_modifiable (toval
))
2443 error (_("Left operand of assignment is not a modifiable lvalue."));
2445 if (VALUE_LVAL (toval
) == lval_memory
2447 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2448 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2450 int len
= (value_bitpos (toval
)
2451 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2453 char *buffer
= (char *) alloca (len
);
2455 CORE_ADDR to_addr
= value_address (toval
);
2457 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2458 fromval
= value_cast (type
, fromval
);
2460 read_memory (to_addr
, buffer
, len
);
2461 from_size
= value_bitsize (fromval
);
2463 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2464 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2465 move_bits (buffer
, value_bitpos (toval
),
2466 value_contents (fromval
), from_size
- bits
, bits
, 1);
2468 move_bits (buffer
, value_bitpos (toval
),
2469 value_contents (fromval
), 0, bits
, 0);
2470 write_memory (to_addr
, buffer
, len
);
2471 observer_notify_memory_changed (to_addr
, len
, buffer
);
2473 val
= value_copy (toval
);
2474 memcpy (value_contents_raw (val
), value_contents (fromval
),
2475 TYPE_LENGTH (type
));
2476 deprecated_set_value_type (val
, type
);
2481 return value_assign (toval
, fromval
);
2485 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2486 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2487 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2488 * COMPONENT, and not the inferior's memory. The current contents
2489 * of COMPONENT are ignored. */
2491 value_assign_to_component (struct value
*container
, struct value
*component
,
2494 LONGEST offset_in_container
=
2495 (LONGEST
) (value_address (component
) - value_address (container
));
2496 int bit_offset_in_container
=
2497 value_bitpos (component
) - value_bitpos (container
);
2500 val
= value_cast (value_type (component
), val
);
2502 if (value_bitsize (component
) == 0)
2503 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2505 bits
= value_bitsize (component
);
2507 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2508 move_bits (value_contents_writeable (container
) + offset_in_container
,
2509 value_bitpos (container
) + bit_offset_in_container
,
2510 value_contents (val
),
2511 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2514 move_bits (value_contents_writeable (container
) + offset_in_container
,
2515 value_bitpos (container
) + bit_offset_in_container
,
2516 value_contents (val
), 0, bits
, 0);
2519 /* The value of the element of array ARR at the ARITY indices given in IND.
2520 ARR may be either a simple array, GNAT array descriptor, or pointer
2524 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2528 struct type
*elt_type
;
2530 elt
= ada_coerce_to_simple_array (arr
);
2532 elt_type
= ada_check_typedef (value_type (elt
));
2533 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2534 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2535 return value_subscript_packed (elt
, arity
, ind
);
2537 for (k
= 0; k
< arity
; k
+= 1)
2539 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2540 error (_("too many subscripts (%d expected)"), k
);
2541 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2546 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2547 value of the element of *ARR at the ARITY indices given in
2548 IND. Does not read the entire array into memory. */
2550 static struct value
*
2551 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2556 for (k
= 0; k
< arity
; k
+= 1)
2560 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2561 error (_("too many subscripts (%d expected)"), k
);
2562 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2564 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2565 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2566 type
= TYPE_TARGET_TYPE (type
);
2569 return value_ind (arr
);
2572 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2573 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2574 elements starting at index LOW. The lower bound of this array is LOW, as
2576 static struct value
*
2577 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2580 CORE_ADDR base
= value_as_address (array_ptr
)
2581 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2582 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2583 struct type
*index_type
=
2584 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2586 struct type
*slice_type
=
2587 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2589 return value_at_lazy (slice_type
, base
);
2593 static struct value
*
2594 ada_value_slice (struct value
*array
, int low
, int high
)
2596 struct type
*type
= value_type (array
);
2597 struct type
*index_type
=
2598 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2599 struct type
*slice_type
=
2600 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2602 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2605 /* If type is a record type in the form of a standard GNAT array
2606 descriptor, returns the number of dimensions for type. If arr is a
2607 simple array, returns the number of "array of"s that prefix its
2608 type designation. Otherwise, returns 0. */
2611 ada_array_arity (struct type
*type
)
2618 type
= desc_base_type (type
);
2621 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2622 return desc_arity (desc_bounds_type (type
));
2624 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2627 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2633 /* If TYPE is a record type in the form of a standard GNAT array
2634 descriptor or a simple array type, returns the element type for
2635 TYPE after indexing by NINDICES indices, or by all indices if
2636 NINDICES is -1. Otherwise, returns NULL. */
2639 ada_array_element_type (struct type
*type
, int nindices
)
2641 type
= desc_base_type (type
);
2643 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2646 struct type
*p_array_type
;
2648 p_array_type
= desc_data_target_type (type
);
2650 k
= ada_array_arity (type
);
2654 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2655 if (nindices
>= 0 && k
> nindices
)
2657 while (k
> 0 && p_array_type
!= NULL
)
2659 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2662 return p_array_type
;
2664 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2666 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2668 type
= TYPE_TARGET_TYPE (type
);
2677 /* The type of nth index in arrays of given type (n numbering from 1).
2678 Does not examine memory. Throws an error if N is invalid or TYPE
2679 is not an array type. NAME is the name of the Ada attribute being
2680 evaluated ('range, 'first, 'last, or 'length); it is used in building
2681 the error message. */
2683 static struct type
*
2684 ada_index_type (struct type
*type
, int n
, const char *name
)
2686 struct type
*result_type
;
2688 type
= desc_base_type (type
);
2690 if (n
< 0 || n
> ada_array_arity (type
))
2691 error (_("invalid dimension number to '%s"), name
);
2693 if (ada_is_simple_array_type (type
))
2697 for (i
= 1; i
< n
; i
+= 1)
2698 type
= TYPE_TARGET_TYPE (type
);
2699 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2700 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2701 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2702 perhaps stabsread.c would make more sense. */
2703 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2708 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2709 if (result_type
== NULL
)
2710 error (_("attempt to take bound of something that is not an array"));
2716 /* Given that arr is an array type, returns the lower bound of the
2717 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2718 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2719 array-descriptor type. It works for other arrays with bounds supplied
2720 by run-time quantities other than discriminants. */
2723 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2725 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2728 gdb_assert (which
== 0 || which
== 1);
2730 if (ada_is_constrained_packed_array_type (arr_type
))
2731 arr_type
= decode_constrained_packed_array_type (arr_type
);
2733 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2734 return (LONGEST
) - which
;
2736 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2737 type
= TYPE_TARGET_TYPE (arr_type
);
2742 for (i
= n
; i
> 1; i
--)
2743 elt_type
= TYPE_TARGET_TYPE (type
);
2745 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2746 ada_fixup_array_indexes_type (index_type_desc
);
2747 if (index_type_desc
!= NULL
)
2748 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2751 index_type
= TYPE_INDEX_TYPE (elt_type
);
2754 (LONGEST
) (which
== 0
2755 ? ada_discrete_type_low_bound (index_type
)
2756 : ada_discrete_type_high_bound (index_type
));
2759 /* Given that arr is an array value, returns the lower bound of the
2760 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2761 WHICH is 1. This routine will also work for arrays with bounds
2762 supplied by run-time quantities other than discriminants. */
2765 ada_array_bound (struct value
*arr
, int n
, int which
)
2767 struct type
*arr_type
= value_type (arr
);
2769 if (ada_is_constrained_packed_array_type (arr_type
))
2770 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2771 else if (ada_is_simple_array_type (arr_type
))
2772 return ada_array_bound_from_type (arr_type
, n
, which
);
2774 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2777 /* Given that arr is an array value, returns the length of the
2778 nth index. This routine will also work for arrays with bounds
2779 supplied by run-time quantities other than discriminants.
2780 Does not work for arrays indexed by enumeration types with representation
2781 clauses at the moment. */
2784 ada_array_length (struct value
*arr
, int n
)
2786 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2788 if (ada_is_constrained_packed_array_type (arr_type
))
2789 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2791 if (ada_is_simple_array_type (arr_type
))
2792 return (ada_array_bound_from_type (arr_type
, n
, 1)
2793 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2795 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2796 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2799 /* An empty array whose type is that of ARR_TYPE (an array type),
2800 with bounds LOW to LOW-1. */
2802 static struct value
*
2803 empty_array (struct type
*arr_type
, int low
)
2805 struct type
*index_type
=
2806 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2808 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2810 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2814 /* Name resolution */
2816 /* The "decoded" name for the user-definable Ada operator corresponding
2820 ada_decoded_op_name (enum exp_opcode op
)
2824 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2826 if (ada_opname_table
[i
].op
== op
)
2827 return ada_opname_table
[i
].decoded
;
2829 error (_("Could not find operator name for opcode"));
2833 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2834 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2835 undefined namespace) and converts operators that are
2836 user-defined into appropriate function calls. If CONTEXT_TYPE is
2837 non-null, it provides a preferred result type [at the moment, only
2838 type void has any effect---causing procedures to be preferred over
2839 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2840 return type is preferred. May change (expand) *EXP. */
2843 resolve (struct expression
**expp
, int void_context_p
)
2845 struct type
*context_type
= NULL
;
2849 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2851 resolve_subexp (expp
, &pc
, 1, context_type
);
2854 /* Resolve the operator of the subexpression beginning at
2855 position *POS of *EXPP. "Resolving" consists of replacing
2856 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2857 with their resolutions, replacing built-in operators with
2858 function calls to user-defined operators, where appropriate, and,
2859 when DEPROCEDURE_P is non-zero, converting function-valued variables
2860 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2861 are as in ada_resolve, above. */
2863 static struct value
*
2864 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2865 struct type
*context_type
)
2869 struct expression
*exp
; /* Convenience: == *expp. */
2870 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2871 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2872 int nargs
; /* Number of operands. */
2879 /* Pass one: resolve operands, saving their types and updating *pos,
2884 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2885 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2890 resolve_subexp (expp
, pos
, 0, NULL
);
2892 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2897 resolve_subexp (expp
, pos
, 0, NULL
);
2902 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2905 case OP_ATR_MODULUS
:
2915 case TERNOP_IN_RANGE
:
2916 case BINOP_IN_BOUNDS
:
2922 case OP_DISCRETE_RANGE
:
2924 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2933 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2935 resolve_subexp (expp
, pos
, 1, NULL
);
2937 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2954 case BINOP_LOGICAL_AND
:
2955 case BINOP_LOGICAL_OR
:
2956 case BINOP_BITWISE_AND
:
2957 case BINOP_BITWISE_IOR
:
2958 case BINOP_BITWISE_XOR
:
2961 case BINOP_NOTEQUAL
:
2968 case BINOP_SUBSCRIPT
:
2976 case UNOP_LOGICAL_NOT
:
2992 case OP_INTERNALVAR
:
3002 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3005 case STRUCTOP_STRUCT
:
3006 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3019 error (_("Unexpected operator during name resolution"));
3022 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3023 for (i
= 0; i
< nargs
; i
+= 1)
3024 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3028 /* Pass two: perform any resolution on principal operator. */
3035 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3037 struct ada_symbol_info
*candidates
;
3041 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3042 (exp
->elts
[pc
+ 2].symbol
),
3043 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3046 if (n_candidates
> 1)
3048 /* Types tend to get re-introduced locally, so if there
3049 are any local symbols that are not types, first filter
3052 for (j
= 0; j
< n_candidates
; j
+= 1)
3053 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3058 case LOC_REGPARM_ADDR
:
3066 if (j
< n_candidates
)
3069 while (j
< n_candidates
)
3071 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3073 candidates
[j
] = candidates
[n_candidates
- 1];
3082 if (n_candidates
== 0)
3083 error (_("No definition found for %s"),
3084 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3085 else if (n_candidates
== 1)
3087 else if (deprocedure_p
3088 && !is_nonfunction (candidates
, n_candidates
))
3090 i
= ada_resolve_function
3091 (candidates
, n_candidates
, NULL
, 0,
3092 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3095 error (_("Could not find a match for %s"),
3096 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3100 printf_filtered (_("Multiple matches for %s\n"),
3101 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3102 user_select_syms (candidates
, n_candidates
, 1);
3106 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3107 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3108 if (innermost_block
== NULL
3109 || contained_in (candidates
[i
].block
, innermost_block
))
3110 innermost_block
= candidates
[i
].block
;
3114 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3117 replace_operator_with_call (expp
, pc
, 0, 0,
3118 exp
->elts
[pc
+ 2].symbol
,
3119 exp
->elts
[pc
+ 1].block
);
3126 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3127 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3129 struct ada_symbol_info
*candidates
;
3133 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3134 (exp
->elts
[pc
+ 5].symbol
),
3135 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3137 if (n_candidates
== 1)
3141 i
= ada_resolve_function
3142 (candidates
, n_candidates
,
3144 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3147 error (_("Could not find a match for %s"),
3148 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3151 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3152 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3153 if (innermost_block
== NULL
3154 || contained_in (candidates
[i
].block
, innermost_block
))
3155 innermost_block
= candidates
[i
].block
;
3166 case BINOP_BITWISE_AND
:
3167 case BINOP_BITWISE_IOR
:
3168 case BINOP_BITWISE_XOR
:
3170 case BINOP_NOTEQUAL
:
3178 case UNOP_LOGICAL_NOT
:
3180 if (possible_user_operator_p (op
, argvec
))
3182 struct ada_symbol_info
*candidates
;
3186 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3187 (struct block
*) NULL
, VAR_DOMAIN
,
3189 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3190 ada_decoded_op_name (op
), NULL
);
3194 replace_operator_with_call (expp
, pc
, nargs
, 1,
3195 candidates
[i
].sym
, candidates
[i
].block
);
3206 return evaluate_subexp_type (exp
, pos
);
3209 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3210 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3212 /* The term "match" here is rather loose. The match is heuristic and
3216 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3218 ftype
= ada_check_typedef (ftype
);
3219 atype
= ada_check_typedef (atype
);
3221 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3222 ftype
= TYPE_TARGET_TYPE (ftype
);
3223 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3224 atype
= TYPE_TARGET_TYPE (atype
);
3226 switch (TYPE_CODE (ftype
))
3229 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3231 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3232 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3233 TYPE_TARGET_TYPE (atype
), 0);
3236 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3238 case TYPE_CODE_ENUM
:
3239 case TYPE_CODE_RANGE
:
3240 switch (TYPE_CODE (atype
))
3243 case TYPE_CODE_ENUM
:
3244 case TYPE_CODE_RANGE
:
3250 case TYPE_CODE_ARRAY
:
3251 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3252 || ada_is_array_descriptor_type (atype
));
3254 case TYPE_CODE_STRUCT
:
3255 if (ada_is_array_descriptor_type (ftype
))
3256 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3257 || ada_is_array_descriptor_type (atype
));
3259 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3260 && !ada_is_array_descriptor_type (atype
));
3262 case TYPE_CODE_UNION
:
3264 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3268 /* Return non-zero if the formals of FUNC "sufficiently match" the
3269 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3270 may also be an enumeral, in which case it is treated as a 0-
3271 argument function. */
3274 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3277 struct type
*func_type
= SYMBOL_TYPE (func
);
3279 if (SYMBOL_CLASS (func
) == LOC_CONST
3280 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3281 return (n_actuals
== 0);
3282 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3285 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3288 for (i
= 0; i
< n_actuals
; i
+= 1)
3290 if (actuals
[i
] == NULL
)
3294 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3296 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3298 if (!ada_type_match (ftype
, atype
, 1))
3305 /* False iff function type FUNC_TYPE definitely does not produce a value
3306 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3307 FUNC_TYPE is not a valid function type with a non-null return type
3308 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3311 return_match (struct type
*func_type
, struct type
*context_type
)
3313 struct type
*return_type
;
3315 if (func_type
== NULL
)
3318 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3319 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3321 return_type
= base_type (func_type
);
3322 if (return_type
== NULL
)
3325 context_type
= base_type (context_type
);
3327 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3328 return context_type
== NULL
|| return_type
== context_type
;
3329 else if (context_type
== NULL
)
3330 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3332 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3336 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3337 function (if any) that matches the types of the NARGS arguments in
3338 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3339 that returns that type, then eliminate matches that don't. If
3340 CONTEXT_TYPE is void and there is at least one match that does not
3341 return void, eliminate all matches that do.
3343 Asks the user if there is more than one match remaining. Returns -1
3344 if there is no such symbol or none is selected. NAME is used
3345 solely for messages. May re-arrange and modify SYMS in
3346 the process; the index returned is for the modified vector. */
3349 ada_resolve_function (struct ada_symbol_info syms
[],
3350 int nsyms
, struct value
**args
, int nargs
,
3351 const char *name
, struct type
*context_type
)
3355 int m
; /* Number of hits */
3358 /* In the first pass of the loop, we only accept functions matching
3359 context_type. If none are found, we add a second pass of the loop
3360 where every function is accepted. */
3361 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3363 for (k
= 0; k
< nsyms
; k
+= 1)
3365 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3367 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3368 && (fallback
|| return_match (type
, context_type
)))
3380 printf_filtered (_("Multiple matches for %s\n"), name
);
3381 user_select_syms (syms
, m
, 1);
3387 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3388 in a listing of choices during disambiguation (see sort_choices, below).
3389 The idea is that overloadings of a subprogram name from the
3390 same package should sort in their source order. We settle for ordering
3391 such symbols by their trailing number (__N or $N). */
3394 encoded_ordered_before (char *N0
, char *N1
)
3398 else if (N0
== NULL
)
3404 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3406 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3408 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3409 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3414 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3417 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3419 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3420 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3422 return (strcmp (N0
, N1
) < 0);
3426 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3430 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3434 for (i
= 1; i
< nsyms
; i
+= 1)
3436 struct ada_symbol_info sym
= syms
[i
];
3439 for (j
= i
- 1; j
>= 0; j
-= 1)
3441 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3442 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3444 syms
[j
+ 1] = syms
[j
];
3450 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3451 by asking the user (if necessary), returning the number selected,
3452 and setting the first elements of SYMS items. Error if no symbols
3455 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3456 to be re-integrated one of these days. */
3459 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3462 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3464 int first_choice
= (max_results
== 1) ? 1 : 2;
3465 const char *select_mode
= multiple_symbols_select_mode ();
3467 if (max_results
< 1)
3468 error (_("Request to select 0 symbols!"));
3472 if (select_mode
== multiple_symbols_cancel
)
3474 canceled because the command is ambiguous\n\
3475 See set/show multiple-symbol."));
3477 /* If select_mode is "all", then return all possible symbols.
3478 Only do that if more than one symbol can be selected, of course.
3479 Otherwise, display the menu as usual. */
3480 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3483 printf_unfiltered (_("[0] cancel\n"));
3484 if (max_results
> 1)
3485 printf_unfiltered (_("[1] all\n"));
3487 sort_choices (syms
, nsyms
);
3489 for (i
= 0; i
< nsyms
; i
+= 1)
3491 if (syms
[i
].sym
== NULL
)
3494 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3496 struct symtab_and_line sal
=
3497 find_function_start_sal (syms
[i
].sym
, 1);
3499 if (sal
.symtab
== NULL
)
3500 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3502 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3505 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3506 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3507 sal
.symtab
->filename
, sal
.line
);
3513 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3514 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3515 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3516 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3518 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3519 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3521 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3522 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3523 else if (is_enumeral
3524 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3526 printf_unfiltered (("[%d] "), i
+ first_choice
);
3527 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3529 printf_unfiltered (_("'(%s) (enumeral)\n"),
3530 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3532 else if (symtab
!= NULL
)
3533 printf_unfiltered (is_enumeral
3534 ? _("[%d] %s in %s (enumeral)\n")
3535 : _("[%d] %s at %s:?\n"),
3537 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3540 printf_unfiltered (is_enumeral
3541 ? _("[%d] %s (enumeral)\n")
3542 : _("[%d] %s at ?\n"),
3544 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3548 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3551 for (i
= 0; i
< n_chosen
; i
+= 1)
3552 syms
[i
] = syms
[chosen
[i
]];
3557 /* Read and validate a set of numeric choices from the user in the
3558 range 0 .. N_CHOICES-1. Place the results in increasing
3559 order in CHOICES[0 .. N-1], and return N.
3561 The user types choices as a sequence of numbers on one line
3562 separated by blanks, encoding them as follows:
3564 + A choice of 0 means to cancel the selection, throwing an error.
3565 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3566 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3568 The user is not allowed to choose more than MAX_RESULTS values.
3570 ANNOTATION_SUFFIX, if present, is used to annotate the input
3571 prompts (for use with the -f switch). */
3574 get_selections (int *choices
, int n_choices
, int max_results
,
3575 int is_all_choice
, char *annotation_suffix
)
3580 int first_choice
= is_all_choice
? 2 : 1;
3582 prompt
= getenv ("PS2");
3586 args
= command_line_input (prompt
, 0, annotation_suffix
);
3589 error_no_arg (_("one or more choice numbers"));
3593 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3594 order, as given in args. Choices are validated. */
3600 while (isspace (*args
))
3602 if (*args
== '\0' && n_chosen
== 0)
3603 error_no_arg (_("one or more choice numbers"));
3604 else if (*args
== '\0')
3607 choice
= strtol (args
, &args2
, 10);
3608 if (args
== args2
|| choice
< 0
3609 || choice
> n_choices
+ first_choice
- 1)
3610 error (_("Argument must be choice number"));
3614 error (_("cancelled"));
3616 if (choice
< first_choice
)
3618 n_chosen
= n_choices
;
3619 for (j
= 0; j
< n_choices
; j
+= 1)
3623 choice
-= first_choice
;
3625 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3629 if (j
< 0 || choice
!= choices
[j
])
3633 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3634 choices
[k
+ 1] = choices
[k
];
3635 choices
[j
+ 1] = choice
;
3640 if (n_chosen
> max_results
)
3641 error (_("Select no more than %d of the above"), max_results
);
3646 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3647 on the function identified by SYM and BLOCK, and taking NARGS
3648 arguments. Update *EXPP as needed to hold more space. */
3651 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3652 int oplen
, struct symbol
*sym
,
3653 struct block
*block
)
3655 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3656 symbol, -oplen for operator being replaced). */
3657 struct expression
*newexp
= (struct expression
*)
3658 xzalloc (sizeof (struct expression
)
3659 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3660 struct expression
*exp
= *expp
;
3662 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3663 newexp
->language_defn
= exp
->language_defn
;
3664 newexp
->gdbarch
= exp
->gdbarch
;
3665 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3666 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3667 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3669 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3670 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3672 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3673 newexp
->elts
[pc
+ 4].block
= block
;
3674 newexp
->elts
[pc
+ 5].symbol
= sym
;
3680 /* Type-class predicates */
3682 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3686 numeric_type_p (struct type
*type
)
3692 switch (TYPE_CODE (type
))
3697 case TYPE_CODE_RANGE
:
3698 return (type
== TYPE_TARGET_TYPE (type
)
3699 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3706 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3709 integer_type_p (struct type
*type
)
3715 switch (TYPE_CODE (type
))
3719 case TYPE_CODE_RANGE
:
3720 return (type
== TYPE_TARGET_TYPE (type
)
3721 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3728 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3731 scalar_type_p (struct type
*type
)
3737 switch (TYPE_CODE (type
))
3740 case TYPE_CODE_RANGE
:
3741 case TYPE_CODE_ENUM
:
3750 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3753 discrete_type_p (struct type
*type
)
3759 switch (TYPE_CODE (type
))
3762 case TYPE_CODE_RANGE
:
3763 case TYPE_CODE_ENUM
:
3764 case TYPE_CODE_BOOL
:
3772 /* Returns non-zero if OP with operands in the vector ARGS could be
3773 a user-defined function. Errs on the side of pre-defined operators
3774 (i.e., result 0). */
3777 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3779 struct type
*type0
=
3780 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3781 struct type
*type1
=
3782 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3796 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3800 case BINOP_BITWISE_AND
:
3801 case BINOP_BITWISE_IOR
:
3802 case BINOP_BITWISE_XOR
:
3803 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3806 case BINOP_NOTEQUAL
:
3811 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3814 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3817 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3821 case UNOP_LOGICAL_NOT
:
3823 return (!numeric_type_p (type0
));
3832 1. In the following, we assume that a renaming type's name may
3833 have an ___XD suffix. It would be nice if this went away at some
3835 2. We handle both the (old) purely type-based representation of
3836 renamings and the (new) variable-based encoding. At some point,
3837 it is devoutly to be hoped that the former goes away
3838 (FIXME: hilfinger-2007-07-09).
3839 3. Subprogram renamings are not implemented, although the XRS
3840 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3842 /* If SYM encodes a renaming,
3844 <renaming> renames <renamed entity>,
3846 sets *LEN to the length of the renamed entity's name,
3847 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3848 the string describing the subcomponent selected from the renamed
3849 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3850 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3851 are undefined). Otherwise, returns a value indicating the category
3852 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3853 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3854 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3855 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3856 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3857 may be NULL, in which case they are not assigned.
3859 [Currently, however, GCC does not generate subprogram renamings.] */
3861 enum ada_renaming_category
3862 ada_parse_renaming (struct symbol
*sym
,
3863 const char **renamed_entity
, int *len
,
3864 const char **renaming_expr
)
3866 enum ada_renaming_category kind
;
3871 return ADA_NOT_RENAMING
;
3872 switch (SYMBOL_CLASS (sym
))
3875 return ADA_NOT_RENAMING
;
3877 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3878 renamed_entity
, len
, renaming_expr
);
3882 case LOC_OPTIMIZED_OUT
:
3883 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3885 return ADA_NOT_RENAMING
;
3889 kind
= ADA_OBJECT_RENAMING
;
3893 kind
= ADA_EXCEPTION_RENAMING
;
3897 kind
= ADA_PACKAGE_RENAMING
;
3901 kind
= ADA_SUBPROGRAM_RENAMING
;
3905 return ADA_NOT_RENAMING
;
3909 if (renamed_entity
!= NULL
)
3910 *renamed_entity
= info
;
3911 suffix
= strstr (info
, "___XE");
3912 if (suffix
== NULL
|| suffix
== info
)
3913 return ADA_NOT_RENAMING
;
3915 *len
= strlen (info
) - strlen (suffix
);
3917 if (renaming_expr
!= NULL
)
3918 *renaming_expr
= suffix
;
3922 /* Assuming TYPE encodes a renaming according to the old encoding in
3923 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3924 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3925 ADA_NOT_RENAMING otherwise. */
3926 static enum ada_renaming_category
3927 parse_old_style_renaming (struct type
*type
,
3928 const char **renamed_entity
, int *len
,
3929 const char **renaming_expr
)
3931 enum ada_renaming_category kind
;
3936 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3937 || TYPE_NFIELDS (type
) != 1)
3938 return ADA_NOT_RENAMING
;
3940 name
= type_name_no_tag (type
);
3942 return ADA_NOT_RENAMING
;
3944 name
= strstr (name
, "___XR");
3946 return ADA_NOT_RENAMING
;
3951 kind
= ADA_OBJECT_RENAMING
;
3954 kind
= ADA_EXCEPTION_RENAMING
;
3957 kind
= ADA_PACKAGE_RENAMING
;
3960 kind
= ADA_SUBPROGRAM_RENAMING
;
3963 return ADA_NOT_RENAMING
;
3966 info
= TYPE_FIELD_NAME (type
, 0);
3968 return ADA_NOT_RENAMING
;
3969 if (renamed_entity
!= NULL
)
3970 *renamed_entity
= info
;
3971 suffix
= strstr (info
, "___XE");
3972 if (renaming_expr
!= NULL
)
3973 *renaming_expr
= suffix
+ 5;
3974 if (suffix
== NULL
|| suffix
== info
)
3975 return ADA_NOT_RENAMING
;
3977 *len
= suffix
- info
;
3983 /* Evaluation: Function Calls */
3985 /* Return an lvalue containing the value VAL. This is the identity on
3986 lvalues, and otherwise has the side-effect of allocating memory
3987 in the inferior where a copy of the value contents is copied. */
3989 static struct value
*
3990 ensure_lval (struct value
*val
)
3992 if (VALUE_LVAL (val
) == not_lval
3993 || VALUE_LVAL (val
) == lval_internalvar
)
3995 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3996 const CORE_ADDR addr
=
3997 value_as_long (value_allocate_space_in_inferior (len
));
3999 set_value_address (val
, addr
);
4000 VALUE_LVAL (val
) = lval_memory
;
4001 write_memory (addr
, value_contents (val
), len
);
4007 /* Return the value ACTUAL, converted to be an appropriate value for a
4008 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4009 allocating any necessary descriptors (fat pointers), or copies of
4010 values not residing in memory, updating it as needed. */
4013 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4015 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4016 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4017 struct type
*formal_target
=
4018 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4019 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4020 struct type
*actual_target
=
4021 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4022 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4024 if (ada_is_array_descriptor_type (formal_target
)
4025 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4026 return make_array_descriptor (formal_type
, actual
);
4027 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4028 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4030 struct value
*result
;
4032 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4033 && ada_is_array_descriptor_type (actual_target
))
4034 result
= desc_data (actual
);
4035 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4037 if (VALUE_LVAL (actual
) != lval_memory
)
4041 actual_type
= ada_check_typedef (value_type (actual
));
4042 val
= allocate_value (actual_type
);
4043 memcpy ((char *) value_contents_raw (val
),
4044 (char *) value_contents (actual
),
4045 TYPE_LENGTH (actual_type
));
4046 actual
= ensure_lval (val
);
4048 result
= value_addr (actual
);
4052 return value_cast_pointers (formal_type
, result
);
4054 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4055 return ada_value_ind (actual
);
4060 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4061 type TYPE. This is usually an inefficient no-op except on some targets
4062 (such as AVR) where the representation of a pointer and an address
4066 value_pointer (struct value
*value
, struct type
*type
)
4068 struct gdbarch
*gdbarch
= get_type_arch (type
);
4069 unsigned len
= TYPE_LENGTH (type
);
4070 gdb_byte
*buf
= alloca (len
);
4073 addr
= value_address (value
);
4074 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4075 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4080 /* Push a descriptor of type TYPE for array value ARR on the stack at
4081 *SP, updating *SP to reflect the new descriptor. Return either
4082 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4083 to-descriptor type rather than a descriptor type), a struct value *
4084 representing a pointer to this descriptor. */
4086 static struct value
*
4087 make_array_descriptor (struct type
*type
, struct value
*arr
)
4089 struct type
*bounds_type
= desc_bounds_type (type
);
4090 struct type
*desc_type
= desc_base_type (type
);
4091 struct value
*descriptor
= allocate_value (desc_type
);
4092 struct value
*bounds
= allocate_value (bounds_type
);
4095 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4098 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4099 ada_array_bound (arr
, i
, 0),
4100 desc_bound_bitpos (bounds_type
, i
, 0),
4101 desc_bound_bitsize (bounds_type
, i
, 0));
4102 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4103 ada_array_bound (arr
, i
, 1),
4104 desc_bound_bitpos (bounds_type
, i
, 1),
4105 desc_bound_bitsize (bounds_type
, i
, 1));
4108 bounds
= ensure_lval (bounds
);
4110 modify_field (value_type (descriptor
),
4111 value_contents_writeable (descriptor
),
4112 value_pointer (ensure_lval (arr
),
4113 TYPE_FIELD_TYPE (desc_type
, 0)),
4114 fat_pntr_data_bitpos (desc_type
),
4115 fat_pntr_data_bitsize (desc_type
));
4117 modify_field (value_type (descriptor
),
4118 value_contents_writeable (descriptor
),
4119 value_pointer (bounds
,
4120 TYPE_FIELD_TYPE (desc_type
, 1)),
4121 fat_pntr_bounds_bitpos (desc_type
),
4122 fat_pntr_bounds_bitsize (desc_type
));
4124 descriptor
= ensure_lval (descriptor
);
4126 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4127 return value_addr (descriptor
);
4132 /* Dummy definitions for an experimental caching module that is not
4133 * used in the public sources. */
4136 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4137 struct symbol
**sym
, struct block
**block
)
4143 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4144 struct block
*block
)
4150 /* Return the result of a standard (literal, C-like) lookup of NAME in
4151 given DOMAIN, visible from lexical block BLOCK. */
4153 static struct symbol
*
4154 standard_lookup (const char *name
, const struct block
*block
,
4159 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4161 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4162 cache_symbol (name
, domain
, sym
, block_found
);
4167 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4168 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4169 since they contend in overloading in the same way. */
4171 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4175 for (i
= 0; i
< n
; i
+= 1)
4176 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4177 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4178 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4184 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4185 struct types. Otherwise, they may not. */
4188 equiv_types (struct type
*type0
, struct type
*type1
)
4192 if (type0
== NULL
|| type1
== NULL
4193 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4195 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4196 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4197 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4198 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4204 /* True iff SYM0 represents the same entity as SYM1, or one that is
4205 no more defined than that of SYM1. */
4208 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4212 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4213 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4216 switch (SYMBOL_CLASS (sym0
))
4222 struct type
*type0
= SYMBOL_TYPE (sym0
);
4223 struct type
*type1
= SYMBOL_TYPE (sym1
);
4224 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4225 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4226 int len0
= strlen (name0
);
4229 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4230 && (equiv_types (type0
, type1
)
4231 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4232 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4235 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4236 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4242 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4243 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4246 add_defn_to_vec (struct obstack
*obstackp
,
4248 struct block
*block
)
4251 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4253 /* Do not try to complete stub types, as the debugger is probably
4254 already scanning all symbols matching a certain name at the
4255 time when this function is called. Trying to replace the stub
4256 type by its associated full type will cause us to restart a scan
4257 which may lead to an infinite recursion. Instead, the client
4258 collecting the matching symbols will end up collecting several
4259 matches, with at least one of them complete. It can then filter
4260 out the stub ones if needed. */
4262 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4264 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4266 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4268 prevDefns
[i
].sym
= sym
;
4269 prevDefns
[i
].block
= block
;
4275 struct ada_symbol_info info
;
4279 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4283 /* Number of ada_symbol_info structures currently collected in
4284 current vector in *OBSTACKP. */
4287 num_defns_collected (struct obstack
*obstackp
)
4289 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4292 /* Vector of ada_symbol_info structures currently collected in current
4293 vector in *OBSTACKP. If FINISH, close off the vector and return
4294 its final address. */
4296 static struct ada_symbol_info
*
4297 defns_collected (struct obstack
*obstackp
, int finish
)
4300 return obstack_finish (obstackp
);
4302 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4305 /* Return a minimal symbol matching NAME according to Ada decoding
4306 rules. Returns NULL if there is no such minimal symbol. Names
4307 prefixed with "standard__" are handled specially: "standard__" is
4308 first stripped off, and only static and global symbols are searched. */
4310 struct minimal_symbol
*
4311 ada_lookup_simple_minsym (const char *name
)
4313 struct objfile
*objfile
;
4314 struct minimal_symbol
*msymbol
;
4317 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4319 name
+= sizeof ("standard__") - 1;
4323 wild_match
= (strstr (name
, "__") == NULL
);
4325 ALL_MSYMBOLS (objfile
, msymbol
)
4327 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4328 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4335 /* For all subprograms that statically enclose the subprogram of the
4336 selected frame, add symbols matching identifier NAME in DOMAIN
4337 and their blocks to the list of data in OBSTACKP, as for
4338 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4342 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4343 const char *name
, domain_enum
namespace,
4348 /* True if TYPE is definitely an artificial type supplied to a symbol
4349 for which no debugging information was given in the symbol file. */
4352 is_nondebugging_type (struct type
*type
)
4354 char *name
= ada_type_name (type
);
4356 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4359 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4360 duplicate other symbols in the list (The only case I know of where
4361 this happens is when object files containing stabs-in-ecoff are
4362 linked with files containing ordinary ecoff debugging symbols (or no
4363 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4364 Returns the number of items in the modified list. */
4367 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4376 /* If two symbols have the same name and one of them is a stub type,
4377 the get rid of the stub. */
4379 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4380 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4382 for (j
= 0; j
< nsyms
; j
++)
4385 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4386 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4387 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4388 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4393 /* Two symbols with the same name, same class and same address
4394 should be identical. */
4396 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4397 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4398 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4400 for (j
= 0; j
< nsyms
; j
+= 1)
4403 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4404 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4405 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4406 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4407 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4408 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4415 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4416 syms
[j
- 1] = syms
[j
];
4425 /* Given a type that corresponds to a renaming entity, use the type name
4426 to extract the scope (package name or function name, fully qualified,
4427 and following the GNAT encoding convention) where this renaming has been
4428 defined. The string returned needs to be deallocated after use. */
4431 xget_renaming_scope (struct type
*renaming_type
)
4433 /* The renaming types adhere to the following convention:
4434 <scope>__<rename>___<XR extension>.
4435 So, to extract the scope, we search for the "___XR" extension,
4436 and then backtrack until we find the first "__". */
4438 const char *name
= type_name_no_tag (renaming_type
);
4439 char *suffix
= strstr (name
, "___XR");
4444 /* Now, backtrack a bit until we find the first "__". Start looking
4445 at suffix - 3, as the <rename> part is at least one character long. */
4447 for (last
= suffix
- 3; last
> name
; last
--)
4448 if (last
[0] == '_' && last
[1] == '_')
4451 /* Make a copy of scope and return it. */
4453 scope_len
= last
- name
;
4454 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4456 strncpy (scope
, name
, scope_len
);
4457 scope
[scope_len
] = '\0';
4462 /* Return nonzero if NAME corresponds to a package name. */
4465 is_package_name (const char *name
)
4467 /* Here, We take advantage of the fact that no symbols are generated
4468 for packages, while symbols are generated for each function.
4469 So the condition for NAME represent a package becomes equivalent
4470 to NAME not existing in our list of symbols. There is only one
4471 small complication with library-level functions (see below). */
4475 /* If it is a function that has not been defined at library level,
4476 then we should be able to look it up in the symbols. */
4477 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4480 /* Library-level function names start with "_ada_". See if function
4481 "_ada_" followed by NAME can be found. */
4483 /* Do a quick check that NAME does not contain "__", since library-level
4484 functions names cannot contain "__" in them. */
4485 if (strstr (name
, "__") != NULL
)
4488 fun_name
= xstrprintf ("_ada_%s", name
);
4490 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4493 /* Return nonzero if SYM corresponds to a renaming entity that is
4494 not visible from FUNCTION_NAME. */
4497 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4501 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4504 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4506 make_cleanup (xfree
, scope
);
4508 /* If the rename has been defined in a package, then it is visible. */
4509 if (is_package_name (scope
))
4512 /* Check that the rename is in the current function scope by checking
4513 that its name starts with SCOPE. */
4515 /* If the function name starts with "_ada_", it means that it is
4516 a library-level function. Strip this prefix before doing the
4517 comparison, as the encoding for the renaming does not contain
4519 if (strncmp (function_name
, "_ada_", 5) == 0)
4522 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4525 /* Remove entries from SYMS that corresponds to a renaming entity that
4526 is not visible from the function associated with CURRENT_BLOCK or
4527 that is superfluous due to the presence of more specific renaming
4528 information. Places surviving symbols in the initial entries of
4529 SYMS and returns the number of surviving symbols.
4532 First, in cases where an object renaming is implemented as a
4533 reference variable, GNAT may produce both the actual reference
4534 variable and the renaming encoding. In this case, we discard the
4537 Second, GNAT emits a type following a specified encoding for each renaming
4538 entity. Unfortunately, STABS currently does not support the definition
4539 of types that are local to a given lexical block, so all renamings types
4540 are emitted at library level. As a consequence, if an application
4541 contains two renaming entities using the same name, and a user tries to
4542 print the value of one of these entities, the result of the ada symbol
4543 lookup will also contain the wrong renaming type.
4545 This function partially covers for this limitation by attempting to
4546 remove from the SYMS list renaming symbols that should be visible
4547 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4548 method with the current information available. The implementation
4549 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4551 - When the user tries to print a rename in a function while there
4552 is another rename entity defined in a package: Normally, the
4553 rename in the function has precedence over the rename in the
4554 package, so the latter should be removed from the list. This is
4555 currently not the case.
4557 - This function will incorrectly remove valid renames if
4558 the CURRENT_BLOCK corresponds to a function which symbol name
4559 has been changed by an "Export" pragma. As a consequence,
4560 the user will be unable to print such rename entities. */
4563 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4564 int nsyms
, const struct block
*current_block
)
4566 struct symbol
*current_function
;
4567 char *current_function_name
;
4569 int is_new_style_renaming
;
4571 /* If there is both a renaming foo___XR... encoded as a variable and
4572 a simple variable foo in the same block, discard the latter.
4573 First, zero out such symbols, then compress. */
4574 is_new_style_renaming
= 0;
4575 for (i
= 0; i
< nsyms
; i
+= 1)
4577 struct symbol
*sym
= syms
[i
].sym
;
4578 struct block
*block
= syms
[i
].block
;
4582 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4584 name
= SYMBOL_LINKAGE_NAME (sym
);
4585 suffix
= strstr (name
, "___XR");
4589 int name_len
= suffix
- name
;
4592 is_new_style_renaming
= 1;
4593 for (j
= 0; j
< nsyms
; j
+= 1)
4594 if (i
!= j
&& syms
[j
].sym
!= NULL
4595 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4597 && block
== syms
[j
].block
)
4601 if (is_new_style_renaming
)
4605 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4606 if (syms
[j
].sym
!= NULL
)
4614 /* Extract the function name associated to CURRENT_BLOCK.
4615 Abort if unable to do so. */
4617 if (current_block
== NULL
)
4620 current_function
= block_linkage_function (current_block
);
4621 if (current_function
== NULL
)
4624 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4625 if (current_function_name
== NULL
)
4628 /* Check each of the symbols, and remove it from the list if it is
4629 a type corresponding to a renaming that is out of the scope of
4630 the current block. */
4635 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4636 == ADA_OBJECT_RENAMING
4637 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4641 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4642 syms
[j
- 1] = syms
[j
];
4652 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4653 whose name and domain match NAME and DOMAIN respectively.
4654 If no match was found, then extend the search to "enclosing"
4655 routines (in other words, if we're inside a nested function,
4656 search the symbols defined inside the enclosing functions).
4658 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4661 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4662 struct block
*block
, domain_enum domain
,
4665 int block_depth
= 0;
4667 while (block
!= NULL
)
4670 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4672 /* If we found a non-function match, assume that's the one. */
4673 if (is_nonfunction (defns_collected (obstackp
, 0),
4674 num_defns_collected (obstackp
)))
4677 block
= BLOCK_SUPERBLOCK (block
);
4680 /* If no luck so far, try to find NAME as a local symbol in some lexically
4681 enclosing subprogram. */
4682 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4683 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4686 /* An object of this type is used as the user_data argument when
4687 calling the map_matching_symbols method. */
4691 struct objfile
*objfile
;
4692 struct obstack
*obstackp
;
4693 struct symbol
*arg_sym
;
4697 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4698 to a list of symbols. DATA0 is a pointer to a struct match_data *
4699 containing the obstack that collects the symbol list, the file that SYM
4700 must come from, a flag indicating whether a non-argument symbol has
4701 been found in the current block, and the last argument symbol
4702 passed in SYM within the current block (if any). When SYM is null,
4703 marking the end of a block, the argument symbol is added if no
4704 other has been found. */
4707 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4709 struct match_data
*data
= (struct match_data
*) data0
;
4713 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4714 add_defn_to_vec (data
->obstackp
,
4715 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4717 data
->found_sym
= 0;
4718 data
->arg_sym
= NULL
;
4722 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4724 else if (SYMBOL_IS_ARGUMENT (sym
))
4725 data
->arg_sym
= sym
;
4728 data
->found_sym
= 1;
4729 add_defn_to_vec (data
->obstackp
,
4730 fixup_symbol_section (sym
, data
->objfile
),
4737 /* Compare STRING1 to STRING2, with results as for strcmp.
4738 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4739 implies compare_names (STRING1, STRING2) (they may differ as to
4740 what symbols compare equal). */
4743 compare_names (const char *string1
, const char *string2
)
4745 while (*string1
!= '\0' && *string2
!= '\0')
4747 if (isspace (*string1
) || isspace (*string2
))
4748 return strcmp_iw_ordered (string1
, string2
);
4749 if (*string1
!= *string2
)
4757 return strcmp_iw_ordered (string1
, string2
);
4759 if (*string2
== '\0')
4761 if (is_name_suffix (string1
))
4768 if (*string2
== '(')
4769 return strcmp_iw_ordered (string1
, string2
);
4771 return *string1
- *string2
;
4775 /* Add to OBSTACKP all non-local symbols whose name and domain match
4776 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4777 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4780 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
4781 domain_enum domain
, int global
,
4784 struct objfile
*objfile
;
4785 struct match_data data
;
4787 data
.obstackp
= obstackp
;
4788 data
.arg_sym
= NULL
;
4790 ALL_OBJFILES (objfile
)
4792 data
.objfile
= objfile
;
4795 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4796 aux_add_nonlocal_symbols
, &data
,
4799 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4800 aux_add_nonlocal_symbols
, &data
,
4801 full_match
, compare_names
);
4804 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
4806 ALL_OBJFILES (objfile
)
4808 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
4809 strcpy (name1
, "_ada_");
4810 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
4811 data
.objfile
= objfile
;
4812 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
4814 aux_add_nonlocal_symbols
,
4816 full_match
, compare_names
);
4821 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4822 scope and in global scopes, returning the number of matches. Sets
4823 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4824 indicating the symbols found and the blocks and symbol tables (if
4825 any) in which they were found. This vector are transient---good only to
4826 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4827 symbol match within the nest of blocks whose innermost member is BLOCK0,
4828 is the one match returned (no other matches in that or
4829 enclosing blocks is returned). If there are any matches in or
4830 surrounding BLOCK0, then these alone are returned. Otherwise, the
4831 search extends to global and file-scope (static) symbol tables.
4832 Names prefixed with "standard__" are handled specially: "standard__"
4833 is first stripped off, and only static and global symbols are searched. */
4836 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4837 domain_enum
namespace,
4838 struct ada_symbol_info
**results
)
4841 struct block
*block
;
4847 obstack_free (&symbol_list_obstack
, NULL
);
4848 obstack_init (&symbol_list_obstack
);
4852 /* Search specified block and its superiors. */
4854 wild_match
= (strstr (name0
, "__") == NULL
);
4856 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4857 needed, but adding const will
4858 have a cascade effect. */
4860 /* Special case: If the user specifies a symbol name inside package
4861 Standard, do a non-wild matching of the symbol name without
4862 the "standard__" prefix. This was primarily introduced in order
4863 to allow the user to specifically access the standard exceptions
4864 using, for instance, Standard.Constraint_Error when Constraint_Error
4865 is ambiguous (due to the user defining its own Constraint_Error
4866 entity inside its program). */
4867 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4871 name
= name0
+ sizeof ("standard__") - 1;
4874 /* Check the non-global symbols. If we have ANY match, then we're done. */
4876 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4878 if (num_defns_collected (&symbol_list_obstack
) > 0)
4881 /* No non-global symbols found. Check our cache to see if we have
4882 already performed this search before. If we have, then return
4886 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4889 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4893 /* Search symbols from all global blocks. */
4895 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
4898 /* Now add symbols from all per-file blocks if we've gotten no hits
4899 (not strictly correct, but perhaps better than an error). */
4901 if (num_defns_collected (&symbol_list_obstack
) == 0)
4902 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
4906 ndefns
= num_defns_collected (&symbol_list_obstack
);
4907 *results
= defns_collected (&symbol_list_obstack
, 1);
4909 ndefns
= remove_extra_symbols (*results
, ndefns
);
4912 cache_symbol (name0
, namespace, NULL
, NULL
);
4914 if (ndefns
== 1 && cacheIfUnique
)
4915 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4917 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4923 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4924 domain_enum
namespace, struct block
**block_found
)
4926 struct ada_symbol_info
*candidates
;
4929 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4931 if (n_candidates
== 0)
4934 if (block_found
!= NULL
)
4935 *block_found
= candidates
[0].block
;
4937 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4940 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4941 scope and in global scopes, or NULL if none. NAME is folded and
4942 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4943 choosing the first symbol if there are multiple choices.
4944 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4945 table in which the symbol was found (in both cases, these
4946 assignments occur only if the pointers are non-null). */
4948 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4949 domain_enum
namespace, int *is_a_field_of_this
)
4951 if (is_a_field_of_this
!= NULL
)
4952 *is_a_field_of_this
= 0;
4955 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4956 block0
, namespace, NULL
);
4959 static struct symbol
*
4960 ada_lookup_symbol_nonlocal (const char *name
,
4961 const struct block
*block
,
4962 const domain_enum domain
)
4964 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
4968 /* True iff STR is a possible encoded suffix of a normal Ada name
4969 that is to be ignored for matching purposes. Suffixes of parallel
4970 names (e.g., XVE) are not included here. Currently, the possible suffixes
4971 are given by any of the regular expressions:
4973 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4974 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4975 _E[0-9]+[bs]$ [protected object entry suffixes]
4976 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4978 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4979 match is performed. This sequence is used to differentiate homonyms,
4980 is an optional part of a valid name suffix. */
4983 is_name_suffix (const char *str
)
4986 const char *matching
;
4987 const int len
= strlen (str
);
4989 /* Skip optional leading __[0-9]+. */
4991 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4994 while (isdigit (str
[0]))
5000 if (str
[0] == '.' || str
[0] == '$')
5003 while (isdigit (matching
[0]))
5005 if (matching
[0] == '\0')
5011 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5014 while (isdigit (matching
[0]))
5016 if (matching
[0] == '\0')
5021 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5022 with a N at the end. Unfortunately, the compiler uses the same
5023 convention for other internal types it creates. So treating
5024 all entity names that end with an "N" as a name suffix causes
5025 some regressions. For instance, consider the case of an enumerated
5026 type. To support the 'Image attribute, it creates an array whose
5028 Having a single character like this as a suffix carrying some
5029 information is a bit risky. Perhaps we should change the encoding
5030 to be something like "_N" instead. In the meantime, do not do
5031 the following check. */
5032 /* Protected Object Subprograms */
5033 if (len
== 1 && str
[0] == 'N')
5038 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5041 while (isdigit (matching
[0]))
5043 if ((matching
[0] == 'b' || matching
[0] == 's')
5044 && matching
[1] == '\0')
5048 /* ??? We should not modify STR directly, as we are doing below. This
5049 is fine in this case, but may become problematic later if we find
5050 that this alternative did not work, and want to try matching
5051 another one from the begining of STR. Since we modified it, we
5052 won't be able to find the begining of the string anymore! */
5056 while (str
[0] != '_' && str
[0] != '\0')
5058 if (str
[0] != 'n' && str
[0] != 'b')
5064 if (str
[0] == '\000')
5069 if (str
[1] != '_' || str
[2] == '\000')
5073 if (strcmp (str
+ 3, "JM") == 0)
5075 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5076 the LJM suffix in favor of the JM one. But we will
5077 still accept LJM as a valid suffix for a reasonable
5078 amount of time, just to allow ourselves to debug programs
5079 compiled using an older version of GNAT. */
5080 if (strcmp (str
+ 3, "LJM") == 0)
5084 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5085 || str
[4] == 'U' || str
[4] == 'P')
5087 if (str
[4] == 'R' && str
[5] != 'T')
5091 if (!isdigit (str
[2]))
5093 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5094 if (!isdigit (str
[k
]) && str
[k
] != '_')
5098 if (str
[0] == '$' && isdigit (str
[1]))
5100 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5101 if (!isdigit (str
[k
]) && str
[k
] != '_')
5108 /* Return non-zero if the string starting at NAME and ending before
5109 NAME_END contains no capital letters. */
5112 is_valid_name_for_wild_match (const char *name0
)
5114 const char *decoded_name
= ada_decode (name0
);
5117 /* If the decoded name starts with an angle bracket, it means that
5118 NAME0 does not follow the GNAT encoding format. It should then
5119 not be allowed as a possible wild match. */
5120 if (decoded_name
[0] == '<')
5123 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5124 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5130 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5131 that could start a simple name. Assumes that *NAMEP points into
5132 the string beginning at NAME0. */
5135 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5137 const char *name
= *namep
;
5147 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5150 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5155 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5156 || name
[2] == target0
))
5164 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5174 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5175 informational suffixes of NAME (i.e., for which is_name_suffix is
5176 true). Assumes that PATN is a lower-cased Ada simple name. */
5179 wild_match (const char *name
, const char *patn
)
5182 const char *name0
= name
;
5186 const char *match
= name
;
5190 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5193 if (*p
== '\0' && is_name_suffix (name
))
5194 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5196 if (name
[-1] == '_')
5199 if (!advance_wild_match (&name
, name0
, *patn
))
5204 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5205 informational suffix. */
5208 full_match (const char *sym_name
, const char *search_name
)
5210 return !match_name (sym_name
, search_name
, 0);
5214 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5215 vector *defn_symbols, updating the list of symbols in OBSTACKP
5216 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5217 OBJFILE is the section containing BLOCK.
5218 SYMTAB is recorded with each symbol added. */
5221 ada_add_block_symbols (struct obstack
*obstackp
,
5222 struct block
*block
, const char *name
,
5223 domain_enum domain
, struct objfile
*objfile
,
5226 struct dict_iterator iter
;
5227 int name_len
= strlen (name
);
5228 /* A matching argument symbol, if any. */
5229 struct symbol
*arg_sym
;
5230 /* Set true when we find a matching non-argument symbol. */
5238 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5240 sym
!= NULL
; sym
= dict_iter_match_next (name
, wild_match
, &iter
))
5242 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5243 SYMBOL_DOMAIN (sym
), domain
)
5244 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5246 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5248 else if (SYMBOL_IS_ARGUMENT (sym
))
5253 add_defn_to_vec (obstackp
,
5254 fixup_symbol_section (sym
, objfile
),
5262 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5264 sym
!= NULL
; sym
= dict_iter_match_next (name
, full_match
, &iter
))
5266 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5267 SYMBOL_DOMAIN (sym
), domain
))
5269 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5271 if (SYMBOL_IS_ARGUMENT (sym
))
5276 add_defn_to_vec (obstackp
,
5277 fixup_symbol_section (sym
, objfile
),
5285 if (!found_sym
&& arg_sym
!= NULL
)
5287 add_defn_to_vec (obstackp
,
5288 fixup_symbol_section (arg_sym
, objfile
),
5297 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5299 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5300 SYMBOL_DOMAIN (sym
), domain
))
5304 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5307 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5309 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5314 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5316 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5318 if (SYMBOL_IS_ARGUMENT (sym
))
5323 add_defn_to_vec (obstackp
,
5324 fixup_symbol_section (sym
, objfile
),
5332 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5333 They aren't parameters, right? */
5334 if (!found_sym
&& arg_sym
!= NULL
)
5336 add_defn_to_vec (obstackp
,
5337 fixup_symbol_section (arg_sym
, objfile
),
5344 /* Symbol Completion */
5346 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5347 name in a form that's appropriate for the completion. The result
5348 does not need to be deallocated, but is only good until the next call.
5350 TEXT_LEN is equal to the length of TEXT.
5351 Perform a wild match if WILD_MATCH is set.
5352 ENCODED should be set if TEXT represents the start of a symbol name
5353 in its encoded form. */
5356 symbol_completion_match (const char *sym_name
,
5357 const char *text
, int text_len
,
5358 int wild_match
, int encoded
)
5360 const int verbatim_match
= (text
[0] == '<');
5365 /* Strip the leading angle bracket. */
5370 /* First, test against the fully qualified name of the symbol. */
5372 if (strncmp (sym_name
, text
, text_len
) == 0)
5375 if (match
&& !encoded
)
5377 /* One needed check before declaring a positive match is to verify
5378 that iff we are doing a verbatim match, the decoded version
5379 of the symbol name starts with '<'. Otherwise, this symbol name
5380 is not a suitable completion. */
5381 const char *sym_name_copy
= sym_name
;
5382 int has_angle_bracket
;
5384 sym_name
= ada_decode (sym_name
);
5385 has_angle_bracket
= (sym_name
[0] == '<');
5386 match
= (has_angle_bracket
== verbatim_match
);
5387 sym_name
= sym_name_copy
;
5390 if (match
&& !verbatim_match
)
5392 /* When doing non-verbatim match, another check that needs to
5393 be done is to verify that the potentially matching symbol name
5394 does not include capital letters, because the ada-mode would
5395 not be able to understand these symbol names without the
5396 angle bracket notation. */
5399 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5404 /* Second: Try wild matching... */
5406 if (!match
&& wild_match
)
5408 /* Since we are doing wild matching, this means that TEXT
5409 may represent an unqualified symbol name. We therefore must
5410 also compare TEXT against the unqualified name of the symbol. */
5411 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5413 if (strncmp (sym_name
, text
, text_len
) == 0)
5417 /* Finally: If we found a mach, prepare the result to return. */
5423 sym_name
= add_angle_brackets (sym_name
);
5426 sym_name
= ada_decode (sym_name
);
5431 DEF_VEC_P (char_ptr
);
5433 /* A companion function to ada_make_symbol_completion_list().
5434 Check if SYM_NAME represents a symbol which name would be suitable
5435 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5436 it is appended at the end of the given string vector SV.
5438 ORIG_TEXT is the string original string from the user command
5439 that needs to be completed. WORD is the entire command on which
5440 completion should be performed. These two parameters are used to
5441 determine which part of the symbol name should be added to the
5443 if WILD_MATCH is set, then wild matching is performed.
5444 ENCODED should be set if TEXT represents a symbol name in its
5445 encoded formed (in which case the completion should also be
5449 symbol_completion_add (VEC(char_ptr
) **sv
,
5450 const char *sym_name
,
5451 const char *text
, int text_len
,
5452 const char *orig_text
, const char *word
,
5453 int wild_match
, int encoded
)
5455 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5456 wild_match
, encoded
);
5462 /* We found a match, so add the appropriate completion to the given
5465 if (word
== orig_text
)
5467 completion
= xmalloc (strlen (match
) + 5);
5468 strcpy (completion
, match
);
5470 else if (word
> orig_text
)
5472 /* Return some portion of sym_name. */
5473 completion
= xmalloc (strlen (match
) + 5);
5474 strcpy (completion
, match
+ (word
- orig_text
));
5478 /* Return some of ORIG_TEXT plus sym_name. */
5479 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5480 strncpy (completion
, word
, orig_text
- word
);
5481 completion
[orig_text
- word
] = '\0';
5482 strcat (completion
, match
);
5485 VEC_safe_push (char_ptr
, *sv
, completion
);
5488 /* An object of this type is passed as the user_data argument to the
5489 map_partial_symbol_names method. */
5490 struct add_partial_datum
5492 VEC(char_ptr
) **completions
;
5501 /* A callback for map_partial_symbol_names. */
5503 ada_add_partial_symbol_completions (const char *name
, void *user_data
)
5505 struct add_partial_datum
*data
= user_data
;
5507 symbol_completion_add (data
->completions
, name
,
5508 data
->text
, data
->text_len
, data
->text0
, data
->word
,
5509 data
->wild_match
, data
->encoded
);
5512 /* Return a list of possible symbol names completing TEXT0. The list
5513 is NULL terminated. WORD is the entire command on which completion
5517 ada_make_symbol_completion_list (char *text0
, char *word
)
5523 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5526 struct minimal_symbol
*msymbol
;
5527 struct objfile
*objfile
;
5528 struct block
*b
, *surrounding_static_block
= 0;
5530 struct dict_iterator iter
;
5532 if (text0
[0] == '<')
5534 text
= xstrdup (text0
);
5535 make_cleanup (xfree
, text
);
5536 text_len
= strlen (text
);
5542 text
= xstrdup (ada_encode (text0
));
5543 make_cleanup (xfree
, text
);
5544 text_len
= strlen (text
);
5545 for (i
= 0; i
< text_len
; i
++)
5546 text
[i
] = tolower (text
[i
]);
5548 encoded
= (strstr (text0
, "__") != NULL
);
5549 /* If the name contains a ".", then the user is entering a fully
5550 qualified entity name, and the match must not be done in wild
5551 mode. Similarly, if the user wants to complete what looks like
5552 an encoded name, the match must not be done in wild mode. */
5553 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5556 /* First, look at the partial symtab symbols. */
5558 struct add_partial_datum data
;
5560 data
.completions
= &completions
;
5562 data
.text_len
= text_len
;
5565 data
.wild_match
= wild_match
;
5566 data
.encoded
= encoded
;
5567 map_partial_symbol_names (ada_add_partial_symbol_completions
, &data
);
5570 /* At this point scan through the misc symbol vectors and add each
5571 symbol you find to the list. Eventually we want to ignore
5572 anything that isn't a text symbol (everything else will be
5573 handled by the psymtab code above). */
5575 ALL_MSYMBOLS (objfile
, msymbol
)
5578 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5579 text
, text_len
, text0
, word
, wild_match
, encoded
);
5582 /* Search upwards from currently selected frame (so that we can
5583 complete on local vars. */
5585 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5587 if (!BLOCK_SUPERBLOCK (b
))
5588 surrounding_static_block
= b
; /* For elmin of dups */
5590 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5592 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5593 text
, text_len
, text0
, word
,
5594 wild_match
, encoded
);
5598 /* Go through the symtabs and check the externs and statics for
5599 symbols which match. */
5601 ALL_SYMTABS (objfile
, s
)
5604 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5605 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5607 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5608 text
, text_len
, text0
, word
,
5609 wild_match
, encoded
);
5613 ALL_SYMTABS (objfile
, s
)
5616 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5617 /* Don't do this block twice. */
5618 if (b
== surrounding_static_block
)
5620 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5622 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5623 text
, text_len
, text0
, word
,
5624 wild_match
, encoded
);
5628 /* Append the closing NULL entry. */
5629 VEC_safe_push (char_ptr
, completions
, NULL
);
5631 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5632 return the copy. It's unfortunate that we have to make a copy
5633 of an array that we're about to destroy, but there is nothing much
5634 we can do about it. Fortunately, it's typically not a very large
5637 const size_t completions_size
=
5638 VEC_length (char_ptr
, completions
) * sizeof (char *);
5639 char **result
= xmalloc (completions_size
);
5641 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5643 VEC_free (char_ptr
, completions
);
5650 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5651 for tagged types. */
5654 ada_is_dispatch_table_ptr_type (struct type
*type
)
5658 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5661 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5665 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5668 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5669 to be invisible to users. */
5672 ada_is_ignored_field (struct type
*type
, int field_num
)
5674 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5677 /* Check the name of that field. */
5679 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5681 /* Anonymous field names should not be printed.
5682 brobecker/2007-02-20: I don't think this can actually happen
5683 but we don't want to print the value of annonymous fields anyway. */
5687 /* A field named "_parent" is internally generated by GNAT for
5688 tagged types, and should not be printed either. */
5689 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5693 /* If this is the dispatch table of a tagged type, then ignore. */
5694 if (ada_is_tagged_type (type
, 1)
5695 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5698 /* Not a special field, so it should not be ignored. */
5702 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5703 pointer or reference type whose ultimate target has a tag field. */
5706 ada_is_tagged_type (struct type
*type
, int refok
)
5708 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5711 /* True iff TYPE represents the type of X'Tag */
5714 ada_is_tag_type (struct type
*type
)
5716 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5720 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5722 return (name
!= NULL
5723 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5727 /* The type of the tag on VAL. */
5730 ada_tag_type (struct value
*val
)
5732 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5735 /* The value of the tag on VAL. */
5738 ada_value_tag (struct value
*val
)
5740 return ada_value_struct_elt (val
, "_tag", 0);
5743 /* The value of the tag on the object of type TYPE whose contents are
5744 saved at VALADDR, if it is non-null, or is at memory address
5747 static struct value
*
5748 value_tag_from_contents_and_address (struct type
*type
,
5749 const gdb_byte
*valaddr
,
5752 int tag_byte_offset
;
5753 struct type
*tag_type
;
5755 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5758 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5760 : valaddr
+ tag_byte_offset
);
5761 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5763 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5768 static struct type
*
5769 type_from_tag (struct value
*tag
)
5771 const char *type_name
= ada_tag_name (tag
);
5773 if (type_name
!= NULL
)
5774 return ada_find_any_type (ada_encode (type_name
));
5785 static int ada_tag_name_1 (void *);
5786 static int ada_tag_name_2 (struct tag_args
*);
5788 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5789 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5790 The value stored in ARGS->name is valid until the next call to
5794 ada_tag_name_1 (void *args0
)
5796 struct tag_args
*args
= (struct tag_args
*) args0
;
5797 static char name
[1024];
5802 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5804 return ada_tag_name_2 (args
);
5805 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5808 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5809 for (p
= name
; *p
!= '\0'; p
+= 1)
5816 /* Return the "ada__tags__type_specific_data" type. */
5818 static struct type
*
5819 ada_get_tsd_type (struct inferior
*inf
)
5821 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
5823 if (data
->tsd_type
== 0)
5824 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
5825 return data
->tsd_type
;
5828 /* Utility function for ada_tag_name_1 that tries the second
5829 representation for the dispatch table (in which there is no
5830 explicit 'tsd' field in the referent of the tag pointer, and instead
5831 the tsd pointer is stored just before the dispatch table. */
5834 ada_tag_name_2 (struct tag_args
*args
)
5836 struct type
*info_type
;
5837 static char name
[1024];
5839 struct value
*val
, *valp
;
5842 info_type
= ada_get_tsd_type (current_inferior());
5843 if (info_type
== NULL
)
5845 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5846 valp
= value_cast (info_type
, args
->tag
);
5849 val
= value_ind (value_ptradd (valp
, -1));
5852 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5855 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5856 for (p
= name
; *p
!= '\0'; p
+= 1)
5863 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5867 ada_tag_name (struct value
*tag
)
5869 struct tag_args args
;
5871 if (!ada_is_tag_type (value_type (tag
)))
5875 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5879 /* The parent type of TYPE, or NULL if none. */
5882 ada_parent_type (struct type
*type
)
5886 type
= ada_check_typedef (type
);
5888 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5891 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5892 if (ada_is_parent_field (type
, i
))
5894 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5896 /* If the _parent field is a pointer, then dereference it. */
5897 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5898 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5899 /* If there is a parallel XVS type, get the actual base type. */
5900 parent_type
= ada_get_base_type (parent_type
);
5902 return ada_check_typedef (parent_type
);
5908 /* True iff field number FIELD_NUM of structure type TYPE contains the
5909 parent-type (inherited) fields of a derived type. Assumes TYPE is
5910 a structure type with at least FIELD_NUM+1 fields. */
5913 ada_is_parent_field (struct type
*type
, int field_num
)
5915 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5917 return (name
!= NULL
5918 && (strncmp (name
, "PARENT", 6) == 0
5919 || strncmp (name
, "_parent", 7) == 0));
5922 /* True iff field number FIELD_NUM of structure type TYPE is a
5923 transparent wrapper field (which should be silently traversed when doing
5924 field selection and flattened when printing). Assumes TYPE is a
5925 structure type with at least FIELD_NUM+1 fields. Such fields are always
5929 ada_is_wrapper_field (struct type
*type
, int field_num
)
5931 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5933 return (name
!= NULL
5934 && (strncmp (name
, "PARENT", 6) == 0
5935 || strcmp (name
, "REP") == 0
5936 || strncmp (name
, "_parent", 7) == 0
5937 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5940 /* True iff field number FIELD_NUM of structure or union type TYPE
5941 is a variant wrapper. Assumes TYPE is a structure type with at least
5942 FIELD_NUM+1 fields. */
5945 ada_is_variant_part (struct type
*type
, int field_num
)
5947 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5949 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5950 || (is_dynamic_field (type
, field_num
)
5951 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5952 == TYPE_CODE_UNION
)));
5955 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5956 whose discriminants are contained in the record type OUTER_TYPE,
5957 returns the type of the controlling discriminant for the variant.
5958 May return NULL if the type could not be found. */
5961 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5963 char *name
= ada_variant_discrim_name (var_type
);
5965 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5968 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5969 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5970 represents a 'when others' clause; otherwise 0. */
5973 ada_is_others_clause (struct type
*type
, int field_num
)
5975 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5977 return (name
!= NULL
&& name
[0] == 'O');
5980 /* Assuming that TYPE0 is the type of the variant part of a record,
5981 returns the name of the discriminant controlling the variant.
5982 The value is valid until the next call to ada_variant_discrim_name. */
5985 ada_variant_discrim_name (struct type
*type0
)
5987 static char *result
= NULL
;
5988 static size_t result_len
= 0;
5991 const char *discrim_end
;
5992 const char *discrim_start
;
5994 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5995 type
= TYPE_TARGET_TYPE (type0
);
5999 name
= ada_type_name (type
);
6001 if (name
== NULL
|| name
[0] == '\000')
6004 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6007 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6010 if (discrim_end
== name
)
6013 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6016 if (discrim_start
== name
+ 1)
6018 if ((discrim_start
> name
+ 3
6019 && strncmp (discrim_start
- 3, "___", 3) == 0)
6020 || discrim_start
[-1] == '.')
6024 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6025 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6026 result
[discrim_end
- discrim_start
] = '\0';
6030 /* Scan STR for a subtype-encoded number, beginning at position K.
6031 Put the position of the character just past the number scanned in
6032 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6033 Return 1 if there was a valid number at the given position, and 0
6034 otherwise. A "subtype-encoded" number consists of the absolute value
6035 in decimal, followed by the letter 'm' to indicate a negative number.
6036 Assumes 0m does not occur. */
6039 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6043 if (!isdigit (str
[k
]))
6046 /* Do it the hard way so as not to make any assumption about
6047 the relationship of unsigned long (%lu scan format code) and
6050 while (isdigit (str
[k
]))
6052 RU
= RU
* 10 + (str
[k
] - '0');
6059 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6065 /* NOTE on the above: Technically, C does not say what the results of
6066 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6067 number representable as a LONGEST (although either would probably work
6068 in most implementations). When RU>0, the locution in the then branch
6069 above is always equivalent to the negative of RU. */
6076 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6077 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6078 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6081 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6083 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6097 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6107 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6108 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6110 if (val
>= L
&& val
<= U
)
6122 /* FIXME: Lots of redundancy below. Try to consolidate. */
6124 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6125 ARG_TYPE, extract and return the value of one of its (non-static)
6126 fields. FIELDNO says which field. Differs from value_primitive_field
6127 only in that it can handle packed values of arbitrary type. */
6129 static struct value
*
6130 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6131 struct type
*arg_type
)
6135 arg_type
= ada_check_typedef (arg_type
);
6136 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6138 /* Handle packed fields. */
6140 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6142 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6143 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6145 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6146 offset
+ bit_pos
/ 8,
6147 bit_pos
% 8, bit_size
, type
);
6150 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6153 /* Find field with name NAME in object of type TYPE. If found,
6154 set the following for each argument that is non-null:
6155 - *FIELD_TYPE_P to the field's type;
6156 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6157 an object of that type;
6158 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6159 - *BIT_SIZE_P to its size in bits if the field is packed, and
6161 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6162 fields up to but not including the desired field, or by the total
6163 number of fields if not found. A NULL value of NAME never
6164 matches; the function just counts visible fields in this case.
6166 Returns 1 if found, 0 otherwise. */
6169 find_struct_field (char *name
, struct type
*type
, int offset
,
6170 struct type
**field_type_p
,
6171 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6176 type
= ada_check_typedef (type
);
6178 if (field_type_p
!= NULL
)
6179 *field_type_p
= NULL
;
6180 if (byte_offset_p
!= NULL
)
6182 if (bit_offset_p
!= NULL
)
6184 if (bit_size_p
!= NULL
)
6187 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6189 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6190 int fld_offset
= offset
+ bit_pos
/ 8;
6191 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6193 if (t_field_name
== NULL
)
6196 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6198 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6200 if (field_type_p
!= NULL
)
6201 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6202 if (byte_offset_p
!= NULL
)
6203 *byte_offset_p
= fld_offset
;
6204 if (bit_offset_p
!= NULL
)
6205 *bit_offset_p
= bit_pos
% 8;
6206 if (bit_size_p
!= NULL
)
6207 *bit_size_p
= bit_size
;
6210 else if (ada_is_wrapper_field (type
, i
))
6212 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6213 field_type_p
, byte_offset_p
, bit_offset_p
,
6214 bit_size_p
, index_p
))
6217 else if (ada_is_variant_part (type
, i
))
6219 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6222 struct type
*field_type
6223 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6225 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6227 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6229 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6230 field_type_p
, byte_offset_p
,
6231 bit_offset_p
, bit_size_p
, index_p
))
6235 else if (index_p
!= NULL
)
6241 /* Number of user-visible fields in record type TYPE. */
6244 num_visible_fields (struct type
*type
)
6249 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6253 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6254 and search in it assuming it has (class) type TYPE.
6255 If found, return value, else return NULL.
6257 Searches recursively through wrapper fields (e.g., '_parent'). */
6259 static struct value
*
6260 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6265 type
= ada_check_typedef (type
);
6266 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6268 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6270 if (t_field_name
== NULL
)
6273 else if (field_name_match (t_field_name
, name
))
6274 return ada_value_primitive_field (arg
, offset
, i
, type
);
6276 else if (ada_is_wrapper_field (type
, i
))
6278 struct value
*v
= /* Do not let indent join lines here. */
6279 ada_search_struct_field (name
, arg
,
6280 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6281 TYPE_FIELD_TYPE (type
, i
));
6287 else if (ada_is_variant_part (type
, i
))
6289 /* PNH: Do we ever get here? See find_struct_field. */
6291 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6293 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6295 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6297 struct value
*v
= ada_search_struct_field
/* Force line
6300 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6301 TYPE_FIELD_TYPE (field_type
, j
));
6311 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6312 int, struct type
*);
6315 /* Return field #INDEX in ARG, where the index is that returned by
6316 * find_struct_field through its INDEX_P argument. Adjust the address
6317 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6318 * If found, return value, else return NULL. */
6320 static struct value
*
6321 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6324 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6328 /* Auxiliary function for ada_index_struct_field. Like
6329 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6332 static struct value
*
6333 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6337 type
= ada_check_typedef (type
);
6339 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6341 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6343 else if (ada_is_wrapper_field (type
, i
))
6345 struct value
*v
= /* Do not let indent join lines here. */
6346 ada_index_struct_field_1 (index_p
, arg
,
6347 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6348 TYPE_FIELD_TYPE (type
, i
));
6354 else if (ada_is_variant_part (type
, i
))
6356 /* PNH: Do we ever get here? See ada_search_struct_field,
6357 find_struct_field. */
6358 error (_("Cannot assign this kind of variant record"));
6360 else if (*index_p
== 0)
6361 return ada_value_primitive_field (arg
, offset
, i
, type
);
6368 /* Given ARG, a value of type (pointer or reference to a)*
6369 structure/union, extract the component named NAME from the ultimate
6370 target structure/union and return it as a value with its
6373 The routine searches for NAME among all members of the structure itself
6374 and (recursively) among all members of any wrapper members
6377 If NO_ERR, then simply return NULL in case of error, rather than
6381 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6383 struct type
*t
, *t1
;
6387 t1
= t
= ada_check_typedef (value_type (arg
));
6388 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6390 t1
= TYPE_TARGET_TYPE (t
);
6393 t1
= ada_check_typedef (t1
);
6394 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6396 arg
= coerce_ref (arg
);
6401 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6403 t1
= TYPE_TARGET_TYPE (t
);
6406 t1
= ada_check_typedef (t1
);
6407 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6409 arg
= value_ind (arg
);
6416 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6420 v
= ada_search_struct_field (name
, arg
, 0, t
);
6423 int bit_offset
, bit_size
, byte_offset
;
6424 struct type
*field_type
;
6427 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6428 address
= value_as_address (arg
);
6430 address
= unpack_pointer (t
, value_contents (arg
));
6432 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6433 if (find_struct_field (name
, t1
, 0,
6434 &field_type
, &byte_offset
, &bit_offset
,
6439 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6440 arg
= ada_coerce_ref (arg
);
6442 arg
= ada_value_ind (arg
);
6443 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6444 bit_offset
, bit_size
,
6448 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6452 if (v
!= NULL
|| no_err
)
6455 error (_("There is no member named %s."), name
);
6461 error (_("Attempt to extract a component of "
6462 "a value that is not a record."));
6465 /* Given a type TYPE, look up the type of the component of type named NAME.
6466 If DISPP is non-null, add its byte displacement from the beginning of a
6467 structure (pointed to by a value) of type TYPE to *DISPP (does not
6468 work for packed fields).
6470 Matches any field whose name has NAME as a prefix, possibly
6473 TYPE can be either a struct or union. If REFOK, TYPE may also
6474 be a (pointer or reference)+ to a struct or union, and the
6475 ultimate target type will be searched.
6477 Looks recursively into variant clauses and parent types.
6479 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6480 TYPE is not a type of the right kind. */
6482 static struct type
*
6483 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6484 int noerr
, int *dispp
)
6491 if (refok
&& type
!= NULL
)
6494 type
= ada_check_typedef (type
);
6495 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6496 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6498 type
= TYPE_TARGET_TYPE (type
);
6502 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6503 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6509 target_terminal_ours ();
6510 gdb_flush (gdb_stdout
);
6512 error (_("Type (null) is not a structure or union type"));
6515 /* XXX: type_sprint */
6516 fprintf_unfiltered (gdb_stderr
, _("Type "));
6517 type_print (type
, "", gdb_stderr
, -1);
6518 error (_(" is not a structure or union type"));
6523 type
= to_static_fixed_type (type
);
6525 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6527 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6531 if (t_field_name
== NULL
)
6534 else if (field_name_match (t_field_name
, name
))
6537 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6538 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6541 else if (ada_is_wrapper_field (type
, i
))
6544 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6549 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6554 else if (ada_is_variant_part (type
, i
))
6557 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6560 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6562 /* FIXME pnh 2008/01/26: We check for a field that is
6563 NOT wrapped in a struct, since the compiler sometimes
6564 generates these for unchecked variant types. Revisit
6565 if the compiler changes this practice. */
6566 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6568 if (v_field_name
!= NULL
6569 && field_name_match (v_field_name
, name
))
6570 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6572 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6579 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6590 target_terminal_ours ();
6591 gdb_flush (gdb_stdout
);
6594 /* XXX: type_sprint */
6595 fprintf_unfiltered (gdb_stderr
, _("Type "));
6596 type_print (type
, "", gdb_stderr
, -1);
6597 error (_(" has no component named <null>"));
6601 /* XXX: type_sprint */
6602 fprintf_unfiltered (gdb_stderr
, _("Type "));
6603 type_print (type
, "", gdb_stderr
, -1);
6604 error (_(" has no component named %s"), name
);
6611 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6612 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6613 represents an unchecked union (that is, the variant part of a
6614 record that is named in an Unchecked_Union pragma). */
6617 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6619 char *discrim_name
= ada_variant_discrim_name (var_type
);
6621 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6626 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6627 within a value of type OUTER_TYPE that is stored in GDB at
6628 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6629 numbering from 0) is applicable. Returns -1 if none are. */
6632 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6633 const gdb_byte
*outer_valaddr
)
6637 char *discrim_name
= ada_variant_discrim_name (var_type
);
6638 struct value
*outer
;
6639 struct value
*discrim
;
6640 LONGEST discrim_val
;
6642 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6643 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6644 if (discrim
== NULL
)
6646 discrim_val
= value_as_long (discrim
);
6649 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6651 if (ada_is_others_clause (var_type
, i
))
6653 else if (ada_in_variant (discrim_val
, var_type
, i
))
6657 return others_clause
;
6662 /* Dynamic-Sized Records */
6664 /* Strategy: The type ostensibly attached to a value with dynamic size
6665 (i.e., a size that is not statically recorded in the debugging
6666 data) does not accurately reflect the size or layout of the value.
6667 Our strategy is to convert these values to values with accurate,
6668 conventional types that are constructed on the fly. */
6670 /* There is a subtle and tricky problem here. In general, we cannot
6671 determine the size of dynamic records without its data. However,
6672 the 'struct value' data structure, which GDB uses to represent
6673 quantities in the inferior process (the target), requires the size
6674 of the type at the time of its allocation in order to reserve space
6675 for GDB's internal copy of the data. That's why the
6676 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6677 rather than struct value*s.
6679 However, GDB's internal history variables ($1, $2, etc.) are
6680 struct value*s containing internal copies of the data that are not, in
6681 general, the same as the data at their corresponding addresses in
6682 the target. Fortunately, the types we give to these values are all
6683 conventional, fixed-size types (as per the strategy described
6684 above), so that we don't usually have to perform the
6685 'to_fixed_xxx_type' conversions to look at their values.
6686 Unfortunately, there is one exception: if one of the internal
6687 history variables is an array whose elements are unconstrained
6688 records, then we will need to create distinct fixed types for each
6689 element selected. */
6691 /* The upshot of all of this is that many routines take a (type, host
6692 address, target address) triple as arguments to represent a value.
6693 The host address, if non-null, is supposed to contain an internal
6694 copy of the relevant data; otherwise, the program is to consult the
6695 target at the target address. */
6697 /* Assuming that VAL0 represents a pointer value, the result of
6698 dereferencing it. Differs from value_ind in its treatment of
6699 dynamic-sized types. */
6702 ada_value_ind (struct value
*val0
)
6704 struct value
*val
= unwrap_value (value_ind (val0
));
6706 return ada_to_fixed_value (val
);
6709 /* The value resulting from dereferencing any "reference to"
6710 qualifiers on VAL0. */
6712 static struct value
*
6713 ada_coerce_ref (struct value
*val0
)
6715 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6717 struct value
*val
= val0
;
6719 val
= coerce_ref (val
);
6720 val
= unwrap_value (val
);
6721 return ada_to_fixed_value (val
);
6727 /* Return OFF rounded upward if necessary to a multiple of
6728 ALIGNMENT (a power of 2). */
6731 align_value (unsigned int off
, unsigned int alignment
)
6733 return (off
+ alignment
- 1) & ~(alignment
- 1);
6736 /* Return the bit alignment required for field #F of template type TYPE. */
6739 field_alignment (struct type
*type
, int f
)
6741 const char *name
= TYPE_FIELD_NAME (type
, f
);
6745 /* The field name should never be null, unless the debugging information
6746 is somehow malformed. In this case, we assume the field does not
6747 require any alignment. */
6751 len
= strlen (name
);
6753 if (!isdigit (name
[len
- 1]))
6756 if (isdigit (name
[len
- 2]))
6757 align_offset
= len
- 2;
6759 align_offset
= len
- 1;
6761 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6762 return TARGET_CHAR_BIT
;
6764 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6767 /* Find a symbol named NAME. Ignores ambiguity. */
6770 ada_find_any_symbol (const char *name
)
6774 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6775 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6778 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6782 /* Find a type named NAME. Ignores ambiguity. This routine will look
6783 solely for types defined by debug info, it will not search the GDB
6787 ada_find_any_type (const char *name
)
6789 struct symbol
*sym
= ada_find_any_symbol (name
);
6792 return SYMBOL_TYPE (sym
);
6797 /* Given NAME and an associated BLOCK, search all symbols for
6798 NAME suffixed with "___XR", which is the ``renaming'' symbol
6799 associated to NAME. Return this symbol if found, return
6803 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6807 sym
= find_old_style_renaming_symbol (name
, block
);
6812 /* Not right yet. FIXME pnh 7/20/2007. */
6813 sym
= ada_find_any_symbol (name
);
6814 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6820 static struct symbol
*
6821 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6823 const struct symbol
*function_sym
= block_linkage_function (block
);
6826 if (function_sym
!= NULL
)
6828 /* If the symbol is defined inside a function, NAME is not fully
6829 qualified. This means we need to prepend the function name
6830 as well as adding the ``___XR'' suffix to build the name of
6831 the associated renaming symbol. */
6832 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6833 /* Function names sometimes contain suffixes used
6834 for instance to qualify nested subprograms. When building
6835 the XR type name, we need to make sure that this suffix is
6836 not included. So do not include any suffix in the function
6837 name length below. */
6838 int function_name_len
= ada_name_prefix_len (function_name
);
6839 const int rename_len
= function_name_len
+ 2 /* "__" */
6840 + strlen (name
) + 6 /* "___XR\0" */ ;
6842 /* Strip the suffix if necessary. */
6843 ada_remove_trailing_digits (function_name
, &function_name_len
);
6844 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6845 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6847 /* Library-level functions are a special case, as GNAT adds
6848 a ``_ada_'' prefix to the function name to avoid namespace
6849 pollution. However, the renaming symbols themselves do not
6850 have this prefix, so we need to skip this prefix if present. */
6851 if (function_name_len
> 5 /* "_ada_" */
6852 && strstr (function_name
, "_ada_") == function_name
)
6855 function_name_len
-= 5;
6858 rename
= (char *) alloca (rename_len
* sizeof (char));
6859 strncpy (rename
, function_name
, function_name_len
);
6860 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6865 const int rename_len
= strlen (name
) + 6;
6867 rename
= (char *) alloca (rename_len
* sizeof (char));
6868 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6871 return ada_find_any_symbol (rename
);
6874 /* Because of GNAT encoding conventions, several GDB symbols may match a
6875 given type name. If the type denoted by TYPE0 is to be preferred to
6876 that of TYPE1 for purposes of type printing, return non-zero;
6877 otherwise return 0. */
6880 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6884 else if (type0
== NULL
)
6886 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6888 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6890 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6892 else if (ada_is_constrained_packed_array_type (type0
))
6894 else if (ada_is_array_descriptor_type (type0
)
6895 && !ada_is_array_descriptor_type (type1
))
6899 const char *type0_name
= type_name_no_tag (type0
);
6900 const char *type1_name
= type_name_no_tag (type1
);
6902 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6903 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6909 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6910 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6913 ada_type_name (struct type
*type
)
6917 else if (TYPE_NAME (type
) != NULL
)
6918 return TYPE_NAME (type
);
6920 return TYPE_TAG_NAME (type
);
6923 /* Search the list of "descriptive" types associated to TYPE for a type
6924 whose name is NAME. */
6926 static struct type
*
6927 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
6929 struct type
*result
;
6931 /* If there no descriptive-type info, then there is no parallel type
6933 if (!HAVE_GNAT_AUX_INFO (type
))
6936 result
= TYPE_DESCRIPTIVE_TYPE (type
);
6937 while (result
!= NULL
)
6939 char *result_name
= ada_type_name (result
);
6941 if (result_name
== NULL
)
6943 warning (_("unexpected null name on descriptive type"));
6947 /* If the names match, stop. */
6948 if (strcmp (result_name
, name
) == 0)
6951 /* Otherwise, look at the next item on the list, if any. */
6952 if (HAVE_GNAT_AUX_INFO (result
))
6953 result
= TYPE_DESCRIPTIVE_TYPE (result
);
6958 /* If we didn't find a match, see whether this is a packed array. With
6959 older compilers, the descriptive type information is either absent or
6960 irrelevant when it comes to packed arrays so the above lookup fails.
6961 Fall back to using a parallel lookup by name in this case. */
6962 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
6963 return ada_find_any_type (name
);
6968 /* Find a parallel type to TYPE with the specified NAME, using the
6969 descriptive type taken from the debugging information, if available,
6970 and otherwise using the (slower) name-based method. */
6972 static struct type
*
6973 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
6975 struct type
*result
= NULL
;
6977 if (HAVE_GNAT_AUX_INFO (type
))
6978 result
= find_parallel_type_by_descriptive_type (type
, name
);
6980 result
= ada_find_any_type (name
);
6985 /* Same as above, but specify the name of the parallel type by appending
6986 SUFFIX to the name of TYPE. */
6989 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6991 char *name
, *typename
= ada_type_name (type
);
6994 if (typename
== NULL
)
6997 len
= strlen (typename
);
6999 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7001 strcpy (name
, typename
);
7002 strcpy (name
+ len
, suffix
);
7004 return ada_find_parallel_type_with_name (type
, name
);
7007 /* If TYPE is a variable-size record type, return the corresponding template
7008 type describing its fields. Otherwise, return NULL. */
7010 static struct type
*
7011 dynamic_template_type (struct type
*type
)
7013 type
= ada_check_typedef (type
);
7015 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7016 || ada_type_name (type
) == NULL
)
7020 int len
= strlen (ada_type_name (type
));
7022 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7025 return ada_find_parallel_type (type
, "___XVE");
7029 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7030 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7033 is_dynamic_field (struct type
*templ_type
, int field_num
)
7035 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7038 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7039 && strstr (name
, "___XVL") != NULL
;
7042 /* The index of the variant field of TYPE, or -1 if TYPE does not
7043 represent a variant record type. */
7046 variant_field_index (struct type
*type
)
7050 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7053 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7055 if (ada_is_variant_part (type
, f
))
7061 /* A record type with no fields. */
7063 static struct type
*
7064 empty_record (struct type
*template)
7066 struct type
*type
= alloc_type_copy (template);
7068 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7069 TYPE_NFIELDS (type
) = 0;
7070 TYPE_FIELDS (type
) = NULL
;
7071 INIT_CPLUS_SPECIFIC (type
);
7072 TYPE_NAME (type
) = "<empty>";
7073 TYPE_TAG_NAME (type
) = NULL
;
7074 TYPE_LENGTH (type
) = 0;
7078 /* An ordinary record type (with fixed-length fields) that describes
7079 the value of type TYPE at VALADDR or ADDRESS (see comments at
7080 the beginning of this section) VAL according to GNAT conventions.
7081 DVAL0 should describe the (portion of a) record that contains any
7082 necessary discriminants. It should be NULL if value_type (VAL) is
7083 an outer-level type (i.e., as opposed to a branch of a variant.) A
7084 variant field (unless unchecked) is replaced by a particular branch
7087 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7088 length are not statically known are discarded. As a consequence,
7089 VALADDR, ADDRESS and DVAL0 are ignored.
7091 NOTE: Limitations: For now, we assume that dynamic fields and
7092 variants occupy whole numbers of bytes. However, they need not be
7096 ada_template_to_fixed_record_type_1 (struct type
*type
,
7097 const gdb_byte
*valaddr
,
7098 CORE_ADDR address
, struct value
*dval0
,
7099 int keep_dynamic_fields
)
7101 struct value
*mark
= value_mark ();
7104 int nfields
, bit_len
;
7110 /* Compute the number of fields in this record type that are going
7111 to be processed: unless keep_dynamic_fields, this includes only
7112 fields whose position and length are static will be processed. */
7113 if (keep_dynamic_fields
)
7114 nfields
= TYPE_NFIELDS (type
);
7118 while (nfields
< TYPE_NFIELDS (type
)
7119 && !ada_is_variant_part (type
, nfields
)
7120 && !is_dynamic_field (type
, nfields
))
7124 rtype
= alloc_type_copy (type
);
7125 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7126 INIT_CPLUS_SPECIFIC (rtype
);
7127 TYPE_NFIELDS (rtype
) = nfields
;
7128 TYPE_FIELDS (rtype
) = (struct field
*)
7129 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7130 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7131 TYPE_NAME (rtype
) = ada_type_name (type
);
7132 TYPE_TAG_NAME (rtype
) = NULL
;
7133 TYPE_FIXED_INSTANCE (rtype
) = 1;
7139 for (f
= 0; f
< nfields
; f
+= 1)
7141 off
= align_value (off
, field_alignment (type
, f
))
7142 + TYPE_FIELD_BITPOS (type
, f
);
7143 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7144 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7146 if (ada_is_variant_part (type
, f
))
7151 else if (is_dynamic_field (type
, f
))
7153 const gdb_byte
*field_valaddr
= valaddr
;
7154 CORE_ADDR field_address
= address
;
7155 struct type
*field_type
=
7156 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7160 /* rtype's length is computed based on the run-time
7161 value of discriminants. If the discriminants are not
7162 initialized, the type size may be completely bogus and
7163 GDB may fail to allocate a value for it. So check the
7164 size first before creating the value. */
7166 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7171 /* If the type referenced by this field is an aligner type, we need
7172 to unwrap that aligner type, because its size might not be set.
7173 Keeping the aligner type would cause us to compute the wrong
7174 size for this field, impacting the offset of the all the fields
7175 that follow this one. */
7176 if (ada_is_aligner_type (field_type
))
7178 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7180 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7181 field_address
= cond_offset_target (field_address
, field_offset
);
7182 field_type
= ada_aligned_type (field_type
);
7185 field_valaddr
= cond_offset_host (field_valaddr
,
7186 off
/ TARGET_CHAR_BIT
);
7187 field_address
= cond_offset_target (field_address
,
7188 off
/ TARGET_CHAR_BIT
);
7190 /* Get the fixed type of the field. Note that, in this case,
7191 we do not want to get the real type out of the tag: if
7192 the current field is the parent part of a tagged record,
7193 we will get the tag of the object. Clearly wrong: the real
7194 type of the parent is not the real type of the child. We
7195 would end up in an infinite loop. */
7196 field_type
= ada_get_base_type (field_type
);
7197 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7198 field_address
, dval
, 0);
7199 /* If the field size is already larger than the maximum
7200 object size, then the record itself will necessarily
7201 be larger than the maximum object size. We need to make
7202 this check now, because the size might be so ridiculously
7203 large (due to an uninitialized variable in the inferior)
7204 that it would cause an overflow when adding it to the
7206 check_size (field_type
);
7208 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7209 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7210 /* The multiplication can potentially overflow. But because
7211 the field length has been size-checked just above, and
7212 assuming that the maximum size is a reasonable value,
7213 an overflow should not happen in practice. So rather than
7214 adding overflow recovery code to this already complex code,
7215 we just assume that it's not going to happen. */
7217 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7221 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7223 /* If our field is a typedef type (most likely a typedef of
7224 a fat pointer, encoding an array access), then we need to
7225 look at its target type to determine its characteristics.
7226 In particular, we would miscompute the field size if we took
7227 the size of the typedef (zero), instead of the size of
7229 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7230 field_type
= ada_typedef_target_type (field_type
);
7232 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7233 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7234 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7236 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7239 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7241 if (off
+ fld_bit_len
> bit_len
)
7242 bit_len
= off
+ fld_bit_len
;
7244 TYPE_LENGTH (rtype
) =
7245 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7248 /* We handle the variant part, if any, at the end because of certain
7249 odd cases in which it is re-ordered so as NOT to be the last field of
7250 the record. This can happen in the presence of representation
7252 if (variant_field
>= 0)
7254 struct type
*branch_type
;
7256 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7259 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7264 to_fixed_variant_branch_type
7265 (TYPE_FIELD_TYPE (type
, variant_field
),
7266 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7267 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7268 if (branch_type
== NULL
)
7270 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7271 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7272 TYPE_NFIELDS (rtype
) -= 1;
7276 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7277 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7279 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7281 if (off
+ fld_bit_len
> bit_len
)
7282 bit_len
= off
+ fld_bit_len
;
7283 TYPE_LENGTH (rtype
) =
7284 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7288 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7289 should contain the alignment of that record, which should be a strictly
7290 positive value. If null or negative, then something is wrong, most
7291 probably in the debug info. In that case, we don't round up the size
7292 of the resulting type. If this record is not part of another structure,
7293 the current RTYPE length might be good enough for our purposes. */
7294 if (TYPE_LENGTH (type
) <= 0)
7296 if (TYPE_NAME (rtype
))
7297 warning (_("Invalid type size for `%s' detected: %d."),
7298 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7300 warning (_("Invalid type size for <unnamed> detected: %d."),
7301 TYPE_LENGTH (type
));
7305 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7306 TYPE_LENGTH (type
));
7309 value_free_to_mark (mark
);
7310 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7311 error (_("record type with dynamic size is larger than varsize-limit"));
7315 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7318 static struct type
*
7319 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7320 CORE_ADDR address
, struct value
*dval0
)
7322 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7326 /* An ordinary record type in which ___XVL-convention fields and
7327 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7328 static approximations, containing all possible fields. Uses
7329 no runtime values. Useless for use in values, but that's OK,
7330 since the results are used only for type determinations. Works on both
7331 structs and unions. Representation note: to save space, we memorize
7332 the result of this function in the TYPE_TARGET_TYPE of the
7335 static struct type
*
7336 template_to_static_fixed_type (struct type
*type0
)
7342 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7343 return TYPE_TARGET_TYPE (type0
);
7345 nfields
= TYPE_NFIELDS (type0
);
7348 for (f
= 0; f
< nfields
; f
+= 1)
7350 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7351 struct type
*new_type
;
7353 if (is_dynamic_field (type0
, f
))
7354 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7356 new_type
= static_unwrap_type (field_type
);
7357 if (type
== type0
&& new_type
!= field_type
)
7359 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7360 TYPE_CODE (type
) = TYPE_CODE (type0
);
7361 INIT_CPLUS_SPECIFIC (type
);
7362 TYPE_NFIELDS (type
) = nfields
;
7363 TYPE_FIELDS (type
) = (struct field
*)
7364 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7365 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7366 sizeof (struct field
) * nfields
);
7367 TYPE_NAME (type
) = ada_type_name (type0
);
7368 TYPE_TAG_NAME (type
) = NULL
;
7369 TYPE_FIXED_INSTANCE (type
) = 1;
7370 TYPE_LENGTH (type
) = 0;
7372 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7373 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7378 /* Given an object of type TYPE whose contents are at VALADDR and
7379 whose address in memory is ADDRESS, returns a revision of TYPE,
7380 which should be a non-dynamic-sized record, in which the variant
7381 part, if any, is replaced with the appropriate branch. Looks
7382 for discriminant values in DVAL0, which can be NULL if the record
7383 contains the necessary discriminant values. */
7385 static struct type
*
7386 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7387 CORE_ADDR address
, struct value
*dval0
)
7389 struct value
*mark
= value_mark ();
7392 struct type
*branch_type
;
7393 int nfields
= TYPE_NFIELDS (type
);
7394 int variant_field
= variant_field_index (type
);
7396 if (variant_field
== -1)
7400 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7404 rtype
= alloc_type_copy (type
);
7405 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7406 INIT_CPLUS_SPECIFIC (rtype
);
7407 TYPE_NFIELDS (rtype
) = nfields
;
7408 TYPE_FIELDS (rtype
) =
7409 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7410 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7411 sizeof (struct field
) * nfields
);
7412 TYPE_NAME (rtype
) = ada_type_name (type
);
7413 TYPE_TAG_NAME (rtype
) = NULL
;
7414 TYPE_FIXED_INSTANCE (rtype
) = 1;
7415 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7417 branch_type
= to_fixed_variant_branch_type
7418 (TYPE_FIELD_TYPE (type
, variant_field
),
7419 cond_offset_host (valaddr
,
7420 TYPE_FIELD_BITPOS (type
, variant_field
)
7422 cond_offset_target (address
,
7423 TYPE_FIELD_BITPOS (type
, variant_field
)
7424 / TARGET_CHAR_BIT
), dval
);
7425 if (branch_type
== NULL
)
7429 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7430 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7431 TYPE_NFIELDS (rtype
) -= 1;
7435 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7436 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7437 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7438 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7440 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7442 value_free_to_mark (mark
);
7446 /* An ordinary record type (with fixed-length fields) that describes
7447 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7448 beginning of this section]. Any necessary discriminants' values
7449 should be in DVAL, a record value; it may be NULL if the object
7450 at ADDR itself contains any necessary discriminant values.
7451 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7452 values from the record are needed. Except in the case that DVAL,
7453 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7454 unchecked) is replaced by a particular branch of the variant.
7456 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7457 is questionable and may be removed. It can arise during the
7458 processing of an unconstrained-array-of-record type where all the
7459 variant branches have exactly the same size. This is because in
7460 such cases, the compiler does not bother to use the XVS convention
7461 when encoding the record. I am currently dubious of this
7462 shortcut and suspect the compiler should be altered. FIXME. */
7464 static struct type
*
7465 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7466 CORE_ADDR address
, struct value
*dval
)
7468 struct type
*templ_type
;
7470 if (TYPE_FIXED_INSTANCE (type0
))
7473 templ_type
= dynamic_template_type (type0
);
7475 if (templ_type
!= NULL
)
7476 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7477 else if (variant_field_index (type0
) >= 0)
7479 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7481 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7486 TYPE_FIXED_INSTANCE (type0
) = 1;
7492 /* An ordinary record type (with fixed-length fields) that describes
7493 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7494 union type. Any necessary discriminants' values should be in DVAL,
7495 a record value. That is, this routine selects the appropriate
7496 branch of the union at ADDR according to the discriminant value
7497 indicated in the union's type name. Returns VAR_TYPE0 itself if
7498 it represents a variant subject to a pragma Unchecked_Union. */
7500 static struct type
*
7501 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7502 CORE_ADDR address
, struct value
*dval
)
7505 struct type
*templ_type
;
7506 struct type
*var_type
;
7508 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7509 var_type
= TYPE_TARGET_TYPE (var_type0
);
7511 var_type
= var_type0
;
7513 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7515 if (templ_type
!= NULL
)
7516 var_type
= templ_type
;
7518 if (is_unchecked_variant (var_type
, value_type (dval
)))
7521 ada_which_variant_applies (var_type
,
7522 value_type (dval
), value_contents (dval
));
7525 return empty_record (var_type
);
7526 else if (is_dynamic_field (var_type
, which
))
7527 return to_fixed_record_type
7528 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7529 valaddr
, address
, dval
);
7530 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7532 to_fixed_record_type
7533 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7535 return TYPE_FIELD_TYPE (var_type
, which
);
7538 /* Assuming that TYPE0 is an array type describing the type of a value
7539 at ADDR, and that DVAL describes a record containing any
7540 discriminants used in TYPE0, returns a type for the value that
7541 contains no dynamic components (that is, no components whose sizes
7542 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7543 true, gives an error message if the resulting type's size is over
7546 static struct type
*
7547 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7550 struct type
*index_type_desc
;
7551 struct type
*result
;
7552 int constrained_packed_array_p
;
7554 if (TYPE_FIXED_INSTANCE (type0
))
7557 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7558 if (constrained_packed_array_p
)
7559 type0
= decode_constrained_packed_array_type (type0
);
7561 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7562 ada_fixup_array_indexes_type (index_type_desc
);
7563 if (index_type_desc
== NULL
)
7565 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7567 /* NOTE: elt_type---the fixed version of elt_type0---should never
7568 depend on the contents of the array in properly constructed
7570 /* Create a fixed version of the array element type.
7571 We're not providing the address of an element here,
7572 and thus the actual object value cannot be inspected to do
7573 the conversion. This should not be a problem, since arrays of
7574 unconstrained objects are not allowed. In particular, all
7575 the elements of an array of a tagged type should all be of
7576 the same type specified in the debugging info. No need to
7577 consult the object tag. */
7578 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7580 /* Make sure we always create a new array type when dealing with
7581 packed array types, since we're going to fix-up the array
7582 type length and element bitsize a little further down. */
7583 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7586 result
= create_array_type (alloc_type_copy (type0
),
7587 elt_type
, TYPE_INDEX_TYPE (type0
));
7592 struct type
*elt_type0
;
7595 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7596 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7598 /* NOTE: result---the fixed version of elt_type0---should never
7599 depend on the contents of the array in properly constructed
7601 /* Create a fixed version of the array element type.
7602 We're not providing the address of an element here,
7603 and thus the actual object value cannot be inspected to do
7604 the conversion. This should not be a problem, since arrays of
7605 unconstrained objects are not allowed. In particular, all
7606 the elements of an array of a tagged type should all be of
7607 the same type specified in the debugging info. No need to
7608 consult the object tag. */
7610 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7613 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7615 struct type
*range_type
=
7616 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7618 result
= create_array_type (alloc_type_copy (elt_type0
),
7619 result
, range_type
);
7620 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7622 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7623 error (_("array type with dynamic size is larger than varsize-limit"));
7626 if (constrained_packed_array_p
)
7628 /* So far, the resulting type has been created as if the original
7629 type was a regular (non-packed) array type. As a result, the
7630 bitsize of the array elements needs to be set again, and the array
7631 length needs to be recomputed based on that bitsize. */
7632 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7633 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7635 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7636 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7637 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7638 TYPE_LENGTH (result
)++;
7641 TYPE_FIXED_INSTANCE (result
) = 1;
7646 /* A standard type (containing no dynamically sized components)
7647 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7648 DVAL describes a record containing any discriminants used in TYPE0,
7649 and may be NULL if there are none, or if the object of type TYPE at
7650 ADDRESS or in VALADDR contains these discriminants.
7652 If CHECK_TAG is not null, in the case of tagged types, this function
7653 attempts to locate the object's tag and use it to compute the actual
7654 type. However, when ADDRESS is null, we cannot use it to determine the
7655 location of the tag, and therefore compute the tagged type's actual type.
7656 So we return the tagged type without consulting the tag. */
7658 static struct type
*
7659 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7660 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7662 type
= ada_check_typedef (type
);
7663 switch (TYPE_CODE (type
))
7667 case TYPE_CODE_STRUCT
:
7669 struct type
*static_type
= to_static_fixed_type (type
);
7670 struct type
*fixed_record_type
=
7671 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7673 /* If STATIC_TYPE is a tagged type and we know the object's address,
7674 then we can determine its tag, and compute the object's actual
7675 type from there. Note that we have to use the fixed record
7676 type (the parent part of the record may have dynamic fields
7677 and the way the location of _tag is expressed may depend on
7680 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7682 struct type
*real_type
=
7683 type_from_tag (value_tag_from_contents_and_address
7688 if (real_type
!= NULL
)
7689 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7692 /* Check to see if there is a parallel ___XVZ variable.
7693 If there is, then it provides the actual size of our type. */
7694 else if (ada_type_name (fixed_record_type
) != NULL
)
7696 char *name
= ada_type_name (fixed_record_type
);
7697 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7701 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7702 size
= get_int_var_value (xvz_name
, &xvz_found
);
7703 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7705 fixed_record_type
= copy_type (fixed_record_type
);
7706 TYPE_LENGTH (fixed_record_type
) = size
;
7708 /* The FIXED_RECORD_TYPE may have be a stub. We have
7709 observed this when the debugging info is STABS, and
7710 apparently it is something that is hard to fix.
7712 In practice, we don't need the actual type definition
7713 at all, because the presence of the XVZ variable allows us
7714 to assume that there must be a XVS type as well, which we
7715 should be able to use later, when we need the actual type
7718 In the meantime, pretend that the "fixed" type we are
7719 returning is NOT a stub, because this can cause trouble
7720 when using this type to create new types targeting it.
7721 Indeed, the associated creation routines often check
7722 whether the target type is a stub and will try to replace
7723 it, thus using a type with the wrong size. This, in turn,
7724 might cause the new type to have the wrong size too.
7725 Consider the case of an array, for instance, where the size
7726 of the array is computed from the number of elements in
7727 our array multiplied by the size of its element. */
7728 TYPE_STUB (fixed_record_type
) = 0;
7731 return fixed_record_type
;
7733 case TYPE_CODE_ARRAY
:
7734 return to_fixed_array_type (type
, dval
, 1);
7735 case TYPE_CODE_UNION
:
7739 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7743 /* The same as ada_to_fixed_type_1, except that it preserves the type
7744 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7746 The typedef layer needs be preserved in order to differentiate between
7747 arrays and array pointers when both types are implemented using the same
7748 fat pointer. In the array pointer case, the pointer is encoded as
7749 a typedef of the pointer type. For instance, considering:
7751 type String_Access is access String;
7752 S1 : String_Access := null;
7754 To the debugger, S1 is defined as a typedef of type String. But
7755 to the user, it is a pointer. So if the user tries to print S1,
7756 we should not dereference the array, but print the array address
7759 If we didn't preserve the typedef layer, we would lose the fact that
7760 the type is to be presented as a pointer (needs de-reference before
7761 being printed). And we would also use the source-level type name. */
7764 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7765 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7768 struct type
*fixed_type
=
7769 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7771 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
7772 then preserve the typedef layer.
7774 Implementation note: We can only check the main-type portion of
7775 the TYPE and FIXED_TYPE, because eliminating the typedef layer
7776 from TYPE now returns a type that has the same instance flags
7777 as TYPE. For instance, if TYPE is a "typedef const", and its
7778 target type is a "struct", then the typedef elimination will return
7779 a "const" version of the target type. See check_typedef for more
7780 details about how the typedef layer elimination is done.
7782 brobecker/2010-11-19: It seems to me that the only case where it is
7783 useful to preserve the typedef layer is when dealing with fat pointers.
7784 Perhaps, we could add a check for that and preserve the typedef layer
7785 only in that situation. But this seems unecessary so far, probably
7786 because we call check_typedef/ada_check_typedef pretty much everywhere.
7788 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7789 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
7790 == TYPE_MAIN_TYPE (fixed_type
)))
7796 /* A standard (static-sized) type corresponding as well as possible to
7797 TYPE0, but based on no runtime data. */
7799 static struct type
*
7800 to_static_fixed_type (struct type
*type0
)
7807 if (TYPE_FIXED_INSTANCE (type0
))
7810 type0
= ada_check_typedef (type0
);
7812 switch (TYPE_CODE (type0
))
7816 case TYPE_CODE_STRUCT
:
7817 type
= dynamic_template_type (type0
);
7819 return template_to_static_fixed_type (type
);
7821 return template_to_static_fixed_type (type0
);
7822 case TYPE_CODE_UNION
:
7823 type
= ada_find_parallel_type (type0
, "___XVU");
7825 return template_to_static_fixed_type (type
);
7827 return template_to_static_fixed_type (type0
);
7831 /* A static approximation of TYPE with all type wrappers removed. */
7833 static struct type
*
7834 static_unwrap_type (struct type
*type
)
7836 if (ada_is_aligner_type (type
))
7838 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7839 if (ada_type_name (type1
) == NULL
)
7840 TYPE_NAME (type1
) = ada_type_name (type
);
7842 return static_unwrap_type (type1
);
7846 struct type
*raw_real_type
= ada_get_base_type (type
);
7848 if (raw_real_type
== type
)
7851 return to_static_fixed_type (raw_real_type
);
7855 /* In some cases, incomplete and private types require
7856 cross-references that are not resolved as records (for example,
7858 type FooP is access Foo;
7860 type Foo is array ...;
7861 ). In these cases, since there is no mechanism for producing
7862 cross-references to such types, we instead substitute for FooP a
7863 stub enumeration type that is nowhere resolved, and whose tag is
7864 the name of the actual type. Call these types "non-record stubs". */
7866 /* A type equivalent to TYPE that is not a non-record stub, if one
7867 exists, otherwise TYPE. */
7870 ada_check_typedef (struct type
*type
)
7875 /* If our type is a typedef type of a fat pointer, then we're done.
7876 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
7877 what allows us to distinguish between fat pointers that represent
7878 array types, and fat pointers that represent array access types
7879 (in both cases, the compiler implements them as fat pointers). */
7880 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7881 && is_thick_pntr (ada_typedef_target_type (type
)))
7884 CHECK_TYPEDEF (type
);
7885 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7886 || !TYPE_STUB (type
)
7887 || TYPE_TAG_NAME (type
) == NULL
)
7891 char *name
= TYPE_TAG_NAME (type
);
7892 struct type
*type1
= ada_find_any_type (name
);
7897 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
7898 stubs pointing to arrays, as we don't create symbols for array
7899 types, only for the typedef-to-array types). If that's the case,
7900 strip the typedef layer. */
7901 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
7902 type1
= ada_check_typedef (type1
);
7908 /* A value representing the data at VALADDR/ADDRESS as described by
7909 type TYPE0, but with a standard (static-sized) type that correctly
7910 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7911 type, then return VAL0 [this feature is simply to avoid redundant
7912 creation of struct values]. */
7914 static struct value
*
7915 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7918 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7920 if (type
== type0
&& val0
!= NULL
)
7923 return value_from_contents_and_address (type
, 0, address
);
7926 /* A value representing VAL, but with a standard (static-sized) type
7927 that correctly describes it. Does not necessarily create a new
7931 ada_to_fixed_value (struct value
*val
)
7933 return ada_to_fixed_value_create (value_type (val
),
7934 value_address (val
),
7941 /* Table mapping attribute numbers to names.
7942 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7944 static const char *attribute_names
[] = {
7962 ada_attribute_name (enum exp_opcode n
)
7964 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7965 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7967 return attribute_names
[0];
7970 /* Evaluate the 'POS attribute applied to ARG. */
7973 pos_atr (struct value
*arg
)
7975 struct value
*val
= coerce_ref (arg
);
7976 struct type
*type
= value_type (val
);
7978 if (!discrete_type_p (type
))
7979 error (_("'POS only defined on discrete types"));
7981 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7984 LONGEST v
= value_as_long (val
);
7986 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7988 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7991 error (_("enumeration value is invalid: can't find 'POS"));
7994 return value_as_long (val
);
7997 static struct value
*
7998 value_pos_atr (struct type
*type
, struct value
*arg
)
8000 return value_from_longest (type
, pos_atr (arg
));
8003 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8005 static struct value
*
8006 value_val_atr (struct type
*type
, struct value
*arg
)
8008 if (!discrete_type_p (type
))
8009 error (_("'VAL only defined on discrete types"));
8010 if (!integer_type_p (value_type (arg
)))
8011 error (_("'VAL requires integral argument"));
8013 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8015 long pos
= value_as_long (arg
);
8017 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8018 error (_("argument to 'VAL out of range"));
8019 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8022 return value_from_longest (type
, value_as_long (arg
));
8028 /* True if TYPE appears to be an Ada character type.
8029 [At the moment, this is true only for Character and Wide_Character;
8030 It is a heuristic test that could stand improvement]. */
8033 ada_is_character_type (struct type
*type
)
8037 /* If the type code says it's a character, then assume it really is,
8038 and don't check any further. */
8039 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8042 /* Otherwise, assume it's a character type iff it is a discrete type
8043 with a known character type name. */
8044 name
= ada_type_name (type
);
8045 return (name
!= NULL
8046 && (TYPE_CODE (type
) == TYPE_CODE_INT
8047 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8048 && (strcmp (name
, "character") == 0
8049 || strcmp (name
, "wide_character") == 0
8050 || strcmp (name
, "wide_wide_character") == 0
8051 || strcmp (name
, "unsigned char") == 0));
8054 /* True if TYPE appears to be an Ada string type. */
8057 ada_is_string_type (struct type
*type
)
8059 type
= ada_check_typedef (type
);
8061 && TYPE_CODE (type
) != TYPE_CODE_PTR
8062 && (ada_is_simple_array_type (type
)
8063 || ada_is_array_descriptor_type (type
))
8064 && ada_array_arity (type
) == 1)
8066 struct type
*elttype
= ada_array_element_type (type
, 1);
8068 return ada_is_character_type (elttype
);
8074 /* The compiler sometimes provides a parallel XVS type for a given
8075 PAD type. Normally, it is safe to follow the PAD type directly,
8076 but older versions of the compiler have a bug that causes the offset
8077 of its "F" field to be wrong. Following that field in that case
8078 would lead to incorrect results, but this can be worked around
8079 by ignoring the PAD type and using the associated XVS type instead.
8081 Set to True if the debugger should trust the contents of PAD types.
8082 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8083 static int trust_pad_over_xvs
= 1;
8085 /* True if TYPE is a struct type introduced by the compiler to force the
8086 alignment of a value. Such types have a single field with a
8087 distinctive name. */
8090 ada_is_aligner_type (struct type
*type
)
8092 type
= ada_check_typedef (type
);
8094 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8097 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8098 && TYPE_NFIELDS (type
) == 1
8099 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8102 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8103 the parallel type. */
8106 ada_get_base_type (struct type
*raw_type
)
8108 struct type
*real_type_namer
;
8109 struct type
*raw_real_type
;
8111 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8114 if (ada_is_aligner_type (raw_type
))
8115 /* The encoding specifies that we should always use the aligner type.
8116 So, even if this aligner type has an associated XVS type, we should
8119 According to the compiler gurus, an XVS type parallel to an aligner
8120 type may exist because of a stabs limitation. In stabs, aligner
8121 types are empty because the field has a variable-sized type, and
8122 thus cannot actually be used as an aligner type. As a result,
8123 we need the associated parallel XVS type to decode the type.
8124 Since the policy in the compiler is to not change the internal
8125 representation based on the debugging info format, we sometimes
8126 end up having a redundant XVS type parallel to the aligner type. */
8129 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8130 if (real_type_namer
== NULL
8131 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8132 || TYPE_NFIELDS (real_type_namer
) != 1)
8135 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8137 /* This is an older encoding form where the base type needs to be
8138 looked up by name. We prefer the newer enconding because it is
8140 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8141 if (raw_real_type
== NULL
)
8144 return raw_real_type
;
8147 /* The field in our XVS type is a reference to the base type. */
8148 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8151 /* The type of value designated by TYPE, with all aligners removed. */
8154 ada_aligned_type (struct type
*type
)
8156 if (ada_is_aligner_type (type
))
8157 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8159 return ada_get_base_type (type
);
8163 /* The address of the aligned value in an object at address VALADDR
8164 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8167 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8169 if (ada_is_aligner_type (type
))
8170 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8172 TYPE_FIELD_BITPOS (type
,
8173 0) / TARGET_CHAR_BIT
);
8180 /* The printed representation of an enumeration literal with encoded
8181 name NAME. The value is good to the next call of ada_enum_name. */
8183 ada_enum_name (const char *name
)
8185 static char *result
;
8186 static size_t result_len
= 0;
8189 /* First, unqualify the enumeration name:
8190 1. Search for the last '.' character. If we find one, then skip
8191 all the preceeding characters, the unqualified name starts
8192 right after that dot.
8193 2. Otherwise, we may be debugging on a target where the compiler
8194 translates dots into "__". Search forward for double underscores,
8195 but stop searching when we hit an overloading suffix, which is
8196 of the form "__" followed by digits. */
8198 tmp
= strrchr (name
, '.');
8203 while ((tmp
= strstr (name
, "__")) != NULL
)
8205 if (isdigit (tmp
[2]))
8216 if (name
[1] == 'U' || name
[1] == 'W')
8218 if (sscanf (name
+ 2, "%x", &v
) != 1)
8224 GROW_VECT (result
, result_len
, 16);
8225 if (isascii (v
) && isprint (v
))
8226 xsnprintf (result
, result_len
, "'%c'", v
);
8227 else if (name
[1] == 'U')
8228 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8230 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8236 tmp
= strstr (name
, "__");
8238 tmp
= strstr (name
, "$");
8241 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8242 strncpy (result
, name
, tmp
- name
);
8243 result
[tmp
- name
] = '\0';
8251 /* Evaluate the subexpression of EXP starting at *POS as for
8252 evaluate_type, updating *POS to point just past the evaluated
8255 static struct value
*
8256 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8258 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8261 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8264 static struct value
*
8265 unwrap_value (struct value
*val
)
8267 struct type
*type
= ada_check_typedef (value_type (val
));
8269 if (ada_is_aligner_type (type
))
8271 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8272 struct type
*val_type
= ada_check_typedef (value_type (v
));
8274 if (ada_type_name (val_type
) == NULL
)
8275 TYPE_NAME (val_type
) = ada_type_name (type
);
8277 return unwrap_value (v
);
8281 struct type
*raw_real_type
=
8282 ada_check_typedef (ada_get_base_type (type
));
8284 /* If there is no parallel XVS or XVE type, then the value is
8285 already unwrapped. Return it without further modification. */
8286 if ((type
== raw_real_type
)
8287 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8291 coerce_unspec_val_to_type
8292 (val
, ada_to_fixed_type (raw_real_type
, 0,
8293 value_address (val
),
8298 static struct value
*
8299 cast_to_fixed (struct type
*type
, struct value
*arg
)
8303 if (type
== value_type (arg
))
8305 else if (ada_is_fixed_point_type (value_type (arg
)))
8306 val
= ada_float_to_fixed (type
,
8307 ada_fixed_to_float (value_type (arg
),
8308 value_as_long (arg
)));
8311 DOUBLEST argd
= value_as_double (arg
);
8313 val
= ada_float_to_fixed (type
, argd
);
8316 return value_from_longest (type
, val
);
8319 static struct value
*
8320 cast_from_fixed (struct type
*type
, struct value
*arg
)
8322 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8323 value_as_long (arg
));
8325 return value_from_double (type
, val
);
8328 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8329 return the converted value. */
8331 static struct value
*
8332 coerce_for_assign (struct type
*type
, struct value
*val
)
8334 struct type
*type2
= value_type (val
);
8339 type2
= ada_check_typedef (type2
);
8340 type
= ada_check_typedef (type
);
8342 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8343 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8345 val
= ada_value_ind (val
);
8346 type2
= value_type (val
);
8349 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8350 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8352 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8353 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8354 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8355 error (_("Incompatible types in assignment"));
8356 deprecated_set_value_type (val
, type
);
8361 static struct value
*
8362 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8365 struct type
*type1
, *type2
;
8368 arg1
= coerce_ref (arg1
);
8369 arg2
= coerce_ref (arg2
);
8370 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8371 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8373 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8374 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8375 return value_binop (arg1
, arg2
, op
);
8384 return value_binop (arg1
, arg2
, op
);
8387 v2
= value_as_long (arg2
);
8389 error (_("second operand of %s must not be zero."), op_string (op
));
8391 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8392 return value_binop (arg1
, arg2
, op
);
8394 v1
= value_as_long (arg1
);
8399 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8400 v
+= v
> 0 ? -1 : 1;
8408 /* Should not reach this point. */
8412 val
= allocate_value (type1
);
8413 store_unsigned_integer (value_contents_raw (val
),
8414 TYPE_LENGTH (value_type (val
)),
8415 gdbarch_byte_order (get_type_arch (type1
)), v
);
8420 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8422 if (ada_is_direct_array_type (value_type (arg1
))
8423 || ada_is_direct_array_type (value_type (arg2
)))
8425 /* Automatically dereference any array reference before
8426 we attempt to perform the comparison. */
8427 arg1
= ada_coerce_ref (arg1
);
8428 arg2
= ada_coerce_ref (arg2
);
8430 arg1
= ada_coerce_to_simple_array (arg1
);
8431 arg2
= ada_coerce_to_simple_array (arg2
);
8432 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8433 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8434 error (_("Attempt to compare array with non-array"));
8435 /* FIXME: The following works only for types whose
8436 representations use all bits (no padding or undefined bits)
8437 and do not have user-defined equality. */
8439 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8440 && memcmp (value_contents (arg1
), value_contents (arg2
),
8441 TYPE_LENGTH (value_type (arg1
))) == 0;
8443 return value_equal (arg1
, arg2
);
8446 /* Total number of component associations in the aggregate starting at
8447 index PC in EXP. Assumes that index PC is the start of an
8451 num_component_specs (struct expression
*exp
, int pc
)
8455 m
= exp
->elts
[pc
+ 1].longconst
;
8458 for (i
= 0; i
< m
; i
+= 1)
8460 switch (exp
->elts
[pc
].opcode
)
8466 n
+= exp
->elts
[pc
+ 1].longconst
;
8469 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8474 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8475 component of LHS (a simple array or a record), updating *POS past
8476 the expression, assuming that LHS is contained in CONTAINER. Does
8477 not modify the inferior's memory, nor does it modify LHS (unless
8478 LHS == CONTAINER). */
8481 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8482 struct expression
*exp
, int *pos
)
8484 struct value
*mark
= value_mark ();
8487 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8489 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8490 struct value
*index_val
= value_from_longest (index_type
, index
);
8492 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8496 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8497 elt
= ada_to_fixed_value (unwrap_value (elt
));
8500 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8501 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8503 value_assign_to_component (container
, elt
,
8504 ada_evaluate_subexp (NULL
, exp
, pos
,
8507 value_free_to_mark (mark
);
8510 /* Assuming that LHS represents an lvalue having a record or array
8511 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8512 of that aggregate's value to LHS, advancing *POS past the
8513 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8514 lvalue containing LHS (possibly LHS itself). Does not modify
8515 the inferior's memory, nor does it modify the contents of
8516 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8518 static struct value
*
8519 assign_aggregate (struct value
*container
,
8520 struct value
*lhs
, struct expression
*exp
,
8521 int *pos
, enum noside noside
)
8523 struct type
*lhs_type
;
8524 int n
= exp
->elts
[*pos
+1].longconst
;
8525 LONGEST low_index
, high_index
;
8528 int max_indices
, num_indices
;
8529 int is_array_aggregate
;
8533 if (noside
!= EVAL_NORMAL
)
8537 for (i
= 0; i
< n
; i
+= 1)
8538 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8542 container
= ada_coerce_ref (container
);
8543 if (ada_is_direct_array_type (value_type (container
)))
8544 container
= ada_coerce_to_simple_array (container
);
8545 lhs
= ada_coerce_ref (lhs
);
8546 if (!deprecated_value_modifiable (lhs
))
8547 error (_("Left operand of assignment is not a modifiable lvalue."));
8549 lhs_type
= value_type (lhs
);
8550 if (ada_is_direct_array_type (lhs_type
))
8552 lhs
= ada_coerce_to_simple_array (lhs
);
8553 lhs_type
= value_type (lhs
);
8554 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8555 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8556 is_array_aggregate
= 1;
8558 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8561 high_index
= num_visible_fields (lhs_type
) - 1;
8562 is_array_aggregate
= 0;
8565 error (_("Left-hand side must be array or record."));
8567 num_specs
= num_component_specs (exp
, *pos
- 3);
8568 max_indices
= 4 * num_specs
+ 4;
8569 indices
= alloca (max_indices
* sizeof (indices
[0]));
8570 indices
[0] = indices
[1] = low_index
- 1;
8571 indices
[2] = indices
[3] = high_index
+ 1;
8574 for (i
= 0; i
< n
; i
+= 1)
8576 switch (exp
->elts
[*pos
].opcode
)
8579 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8580 &num_indices
, max_indices
,
8581 low_index
, high_index
);
8584 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8585 &num_indices
, max_indices
,
8586 low_index
, high_index
);
8590 error (_("Misplaced 'others' clause"));
8591 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8592 num_indices
, low_index
, high_index
);
8595 error (_("Internal error: bad aggregate clause"));
8602 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8603 construct at *POS, updating *POS past the construct, given that
8604 the positions are relative to lower bound LOW, where HIGH is the
8605 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8606 updating *NUM_INDICES as needed. CONTAINER is as for
8607 assign_aggregate. */
8609 aggregate_assign_positional (struct value
*container
,
8610 struct value
*lhs
, struct expression
*exp
,
8611 int *pos
, LONGEST
*indices
, int *num_indices
,
8612 int max_indices
, LONGEST low
, LONGEST high
)
8614 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8616 if (ind
- 1 == high
)
8617 warning (_("Extra components in aggregate ignored."));
8620 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8622 assign_component (container
, lhs
, ind
, exp
, pos
);
8625 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8628 /* Assign into the components of LHS indexed by the OP_CHOICES
8629 construct at *POS, updating *POS past the construct, given that
8630 the allowable indices are LOW..HIGH. Record the indices assigned
8631 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8632 needed. CONTAINER is as for assign_aggregate. */
8634 aggregate_assign_from_choices (struct value
*container
,
8635 struct value
*lhs
, struct expression
*exp
,
8636 int *pos
, LONGEST
*indices
, int *num_indices
,
8637 int max_indices
, LONGEST low
, LONGEST high
)
8640 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8641 int choice_pos
, expr_pc
;
8642 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8644 choice_pos
= *pos
+= 3;
8646 for (j
= 0; j
< n_choices
; j
+= 1)
8647 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8649 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8651 for (j
= 0; j
< n_choices
; j
+= 1)
8653 LONGEST lower
, upper
;
8654 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8656 if (op
== OP_DISCRETE_RANGE
)
8659 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8661 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8666 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8678 name
= &exp
->elts
[choice_pos
+ 2].string
;
8681 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8684 error (_("Invalid record component association."));
8686 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8688 if (! find_struct_field (name
, value_type (lhs
), 0,
8689 NULL
, NULL
, NULL
, NULL
, &ind
))
8690 error (_("Unknown component name: %s."), name
);
8691 lower
= upper
= ind
;
8694 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8695 error (_("Index in component association out of bounds."));
8697 add_component_interval (lower
, upper
, indices
, num_indices
,
8699 while (lower
<= upper
)
8704 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8710 /* Assign the value of the expression in the OP_OTHERS construct in
8711 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8712 have not been previously assigned. The index intervals already assigned
8713 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8714 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
8716 aggregate_assign_others (struct value
*container
,
8717 struct value
*lhs
, struct expression
*exp
,
8718 int *pos
, LONGEST
*indices
, int num_indices
,
8719 LONGEST low
, LONGEST high
)
8722 int expr_pc
= *pos
+ 1;
8724 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8728 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8733 assign_component (container
, lhs
, ind
, exp
, &localpos
);
8736 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8739 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8740 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8741 modifying *SIZE as needed. It is an error if *SIZE exceeds
8742 MAX_SIZE. The resulting intervals do not overlap. */
8744 add_component_interval (LONGEST low
, LONGEST high
,
8745 LONGEST
* indices
, int *size
, int max_size
)
8749 for (i
= 0; i
< *size
; i
+= 2) {
8750 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8754 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8755 if (high
< indices
[kh
])
8757 if (low
< indices
[i
])
8759 indices
[i
+ 1] = indices
[kh
- 1];
8760 if (high
> indices
[i
+ 1])
8761 indices
[i
+ 1] = high
;
8762 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8763 *size
-= kh
- i
- 2;
8766 else if (high
< indices
[i
])
8770 if (*size
== max_size
)
8771 error (_("Internal error: miscounted aggregate components."));
8773 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8774 indices
[j
] = indices
[j
- 2];
8776 indices
[i
+ 1] = high
;
8779 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8782 static struct value
*
8783 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8785 if (type
== ada_check_typedef (value_type (arg2
)))
8788 if (ada_is_fixed_point_type (type
))
8789 return (cast_to_fixed (type
, arg2
));
8791 if (ada_is_fixed_point_type (value_type (arg2
)))
8792 return cast_from_fixed (type
, arg2
);
8794 return value_cast (type
, arg2
);
8797 /* Evaluating Ada expressions, and printing their result.
8798 ------------------------------------------------------
8803 We usually evaluate an Ada expression in order to print its value.
8804 We also evaluate an expression in order to print its type, which
8805 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8806 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8807 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8808 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8811 Evaluating expressions is a little more complicated for Ada entities
8812 than it is for entities in languages such as C. The main reason for
8813 this is that Ada provides types whose definition might be dynamic.
8814 One example of such types is variant records. Or another example
8815 would be an array whose bounds can only be known at run time.
8817 The following description is a general guide as to what should be
8818 done (and what should NOT be done) in order to evaluate an expression
8819 involving such types, and when. This does not cover how the semantic
8820 information is encoded by GNAT as this is covered separatly. For the
8821 document used as the reference for the GNAT encoding, see exp_dbug.ads
8822 in the GNAT sources.
8824 Ideally, we should embed each part of this description next to its
8825 associated code. Unfortunately, the amount of code is so vast right
8826 now that it's hard to see whether the code handling a particular
8827 situation might be duplicated or not. One day, when the code is
8828 cleaned up, this guide might become redundant with the comments
8829 inserted in the code, and we might want to remove it.
8831 2. ``Fixing'' an Entity, the Simple Case:
8832 -----------------------------------------
8834 When evaluating Ada expressions, the tricky issue is that they may
8835 reference entities whose type contents and size are not statically
8836 known. Consider for instance a variant record:
8838 type Rec (Empty : Boolean := True) is record
8841 when False => Value : Integer;
8844 Yes : Rec := (Empty => False, Value => 1);
8845 No : Rec := (empty => True);
8847 The size and contents of that record depends on the value of the
8848 descriminant (Rec.Empty). At this point, neither the debugging
8849 information nor the associated type structure in GDB are able to
8850 express such dynamic types. So what the debugger does is to create
8851 "fixed" versions of the type that applies to the specific object.
8852 We also informally refer to this opperation as "fixing" an object,
8853 which means creating its associated fixed type.
8855 Example: when printing the value of variable "Yes" above, its fixed
8856 type would look like this:
8863 On the other hand, if we printed the value of "No", its fixed type
8870 Things become a little more complicated when trying to fix an entity
8871 with a dynamic type that directly contains another dynamic type,
8872 such as an array of variant records, for instance. There are
8873 two possible cases: Arrays, and records.
8875 3. ``Fixing'' Arrays:
8876 ---------------------
8878 The type structure in GDB describes an array in terms of its bounds,
8879 and the type of its elements. By design, all elements in the array
8880 have the same type and we cannot represent an array of variant elements
8881 using the current type structure in GDB. When fixing an array,
8882 we cannot fix the array element, as we would potentially need one
8883 fixed type per element of the array. As a result, the best we can do
8884 when fixing an array is to produce an array whose bounds and size
8885 are correct (allowing us to read it from memory), but without having
8886 touched its element type. Fixing each element will be done later,
8887 when (if) necessary.
8889 Arrays are a little simpler to handle than records, because the same
8890 amount of memory is allocated for each element of the array, even if
8891 the amount of space actually used by each element differs from element
8892 to element. Consider for instance the following array of type Rec:
8894 type Rec_Array is array (1 .. 2) of Rec;
8896 The actual amount of memory occupied by each element might be different
8897 from element to element, depending on the value of their discriminant.
8898 But the amount of space reserved for each element in the array remains
8899 fixed regardless. So we simply need to compute that size using
8900 the debugging information available, from which we can then determine
8901 the array size (we multiply the number of elements of the array by
8902 the size of each element).
8904 The simplest case is when we have an array of a constrained element
8905 type. For instance, consider the following type declarations:
8907 type Bounded_String (Max_Size : Integer) is
8909 Buffer : String (1 .. Max_Size);
8911 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8913 In this case, the compiler describes the array as an array of
8914 variable-size elements (identified by its XVS suffix) for which
8915 the size can be read in the parallel XVZ variable.
8917 In the case of an array of an unconstrained element type, the compiler
8918 wraps the array element inside a private PAD type. This type should not
8919 be shown to the user, and must be "unwrap"'ed before printing. Note
8920 that we also use the adjective "aligner" in our code to designate
8921 these wrapper types.
8923 In some cases, the size allocated for each element is statically
8924 known. In that case, the PAD type already has the correct size,
8925 and the array element should remain unfixed.
8927 But there are cases when this size is not statically known.
8928 For instance, assuming that "Five" is an integer variable:
8930 type Dynamic is array (1 .. Five) of Integer;
8931 type Wrapper (Has_Length : Boolean := False) is record
8934 when True => Length : Integer;
8938 type Wrapper_Array is array (1 .. 2) of Wrapper;
8940 Hello : Wrapper_Array := (others => (Has_Length => True,
8941 Data => (others => 17),
8945 The debugging info would describe variable Hello as being an
8946 array of a PAD type. The size of that PAD type is not statically
8947 known, but can be determined using a parallel XVZ variable.
8948 In that case, a copy of the PAD type with the correct size should
8949 be used for the fixed array.
8951 3. ``Fixing'' record type objects:
8952 ----------------------------------
8954 Things are slightly different from arrays in the case of dynamic
8955 record types. In this case, in order to compute the associated
8956 fixed type, we need to determine the size and offset of each of
8957 its components. This, in turn, requires us to compute the fixed
8958 type of each of these components.
8960 Consider for instance the example:
8962 type Bounded_String (Max_Size : Natural) is record
8963 Str : String (1 .. Max_Size);
8966 My_String : Bounded_String (Max_Size => 10);
8968 In that case, the position of field "Length" depends on the size
8969 of field Str, which itself depends on the value of the Max_Size
8970 discriminant. In order to fix the type of variable My_String,
8971 we need to fix the type of field Str. Therefore, fixing a variant
8972 record requires us to fix each of its components.
8974 However, if a component does not have a dynamic size, the component
8975 should not be fixed. In particular, fields that use a PAD type
8976 should not fixed. Here is an example where this might happen
8977 (assuming type Rec above):
8979 type Container (Big : Boolean) is record
8983 when True => Another : Integer;
8987 My_Container : Container := (Big => False,
8988 First => (Empty => True),
8991 In that example, the compiler creates a PAD type for component First,
8992 whose size is constant, and then positions the component After just
8993 right after it. The offset of component After is therefore constant
8996 The debugger computes the position of each field based on an algorithm
8997 that uses, among other things, the actual position and size of the field
8998 preceding it. Let's now imagine that the user is trying to print
8999 the value of My_Container. If the type fixing was recursive, we would
9000 end up computing the offset of field After based on the size of the
9001 fixed version of field First. And since in our example First has
9002 only one actual field, the size of the fixed type is actually smaller
9003 than the amount of space allocated to that field, and thus we would
9004 compute the wrong offset of field After.
9006 To make things more complicated, we need to watch out for dynamic
9007 components of variant records (identified by the ___XVL suffix in
9008 the component name). Even if the target type is a PAD type, the size
9009 of that type might not be statically known. So the PAD type needs
9010 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9011 we might end up with the wrong size for our component. This can be
9012 observed with the following type declarations:
9014 type Octal is new Integer range 0 .. 7;
9015 type Octal_Array is array (Positive range <>) of Octal;
9016 pragma Pack (Octal_Array);
9018 type Octal_Buffer (Size : Positive) is record
9019 Buffer : Octal_Array (1 .. Size);
9023 In that case, Buffer is a PAD type whose size is unset and needs
9024 to be computed by fixing the unwrapped type.
9026 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9027 ----------------------------------------------------------
9029 Lastly, when should the sub-elements of an entity that remained unfixed
9030 thus far, be actually fixed?
9032 The answer is: Only when referencing that element. For instance
9033 when selecting one component of a record, this specific component
9034 should be fixed at that point in time. Or when printing the value
9035 of a record, each component should be fixed before its value gets
9036 printed. Similarly for arrays, the element of the array should be
9037 fixed when printing each element of the array, or when extracting
9038 one element out of that array. On the other hand, fixing should
9039 not be performed on the elements when taking a slice of an array!
9041 Note that one of the side-effects of miscomputing the offset and
9042 size of each field is that we end up also miscomputing the size
9043 of the containing type. This can have adverse results when computing
9044 the value of an entity. GDB fetches the value of an entity based
9045 on the size of its type, and thus a wrong size causes GDB to fetch
9046 the wrong amount of memory. In the case where the computed size is
9047 too small, GDB fetches too little data to print the value of our
9048 entiry. Results in this case as unpredicatble, as we usually read
9049 past the buffer containing the data =:-o. */
9051 /* Implement the evaluate_exp routine in the exp_descriptor structure
9052 for the Ada language. */
9054 static struct value
*
9055 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9056 int *pos
, enum noside noside
)
9061 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9064 struct value
**argvec
;
9068 op
= exp
->elts
[pc
].opcode
;
9074 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9075 arg1
= unwrap_value (arg1
);
9077 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9078 then we need to perform the conversion manually, because
9079 evaluate_subexp_standard doesn't do it. This conversion is
9080 necessary in Ada because the different kinds of float/fixed
9081 types in Ada have different representations.
9083 Similarly, we need to perform the conversion from OP_LONG
9085 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9086 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9092 struct value
*result
;
9095 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9096 /* The result type will have code OP_STRING, bashed there from
9097 OP_ARRAY. Bash it back. */
9098 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9099 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9105 type
= exp
->elts
[pc
+ 1].type
;
9106 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9107 if (noside
== EVAL_SKIP
)
9109 arg1
= ada_value_cast (type
, arg1
, noside
);
9114 type
= exp
->elts
[pc
+ 1].type
;
9115 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9118 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9119 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9121 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9122 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9124 return ada_value_assign (arg1
, arg1
);
9126 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9127 except if the lhs of our assignment is a convenience variable.
9128 In the case of assigning to a convenience variable, the lhs
9129 should be exactly the result of the evaluation of the rhs. */
9130 type
= value_type (arg1
);
9131 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9133 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9134 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9136 if (ada_is_fixed_point_type (value_type (arg1
)))
9137 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9138 else if (ada_is_fixed_point_type (value_type (arg2
)))
9140 (_("Fixed-point values must be assigned to fixed-point variables"));
9142 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9143 return ada_value_assign (arg1
, arg2
);
9146 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9147 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9148 if (noside
== EVAL_SKIP
)
9150 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9151 return (value_from_longest
9153 value_as_long (arg1
) + value_as_long (arg2
)));
9154 if ((ada_is_fixed_point_type (value_type (arg1
))
9155 || ada_is_fixed_point_type (value_type (arg2
)))
9156 && value_type (arg1
) != value_type (arg2
))
9157 error (_("Operands of fixed-point addition must have the same type"));
9158 /* Do the addition, and cast the result to the type of the first
9159 argument. We cannot cast the result to a reference type, so if
9160 ARG1 is a reference type, find its underlying type. */
9161 type
= value_type (arg1
);
9162 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9163 type
= TYPE_TARGET_TYPE (type
);
9164 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9165 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9168 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9169 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9170 if (noside
== EVAL_SKIP
)
9172 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9173 return (value_from_longest
9175 value_as_long (arg1
) - value_as_long (arg2
)));
9176 if ((ada_is_fixed_point_type (value_type (arg1
))
9177 || ada_is_fixed_point_type (value_type (arg2
)))
9178 && value_type (arg1
) != value_type (arg2
))
9179 error (_("Operands of fixed-point subtraction "
9180 "must have the same type"));
9181 /* Do the substraction, and cast the result to the type of the first
9182 argument. We cannot cast the result to a reference type, so if
9183 ARG1 is a reference type, find its underlying type. */
9184 type
= value_type (arg1
);
9185 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9186 type
= TYPE_TARGET_TYPE (type
);
9187 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9188 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9194 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9195 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9196 if (noside
== EVAL_SKIP
)
9198 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9200 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9201 return value_zero (value_type (arg1
), not_lval
);
9205 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9206 if (ada_is_fixed_point_type (value_type (arg1
)))
9207 arg1
= cast_from_fixed (type
, arg1
);
9208 if (ada_is_fixed_point_type (value_type (arg2
)))
9209 arg2
= cast_from_fixed (type
, arg2
);
9210 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9211 return ada_value_binop (arg1
, arg2
, op
);
9215 case BINOP_NOTEQUAL
:
9216 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9217 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9218 if (noside
== EVAL_SKIP
)
9220 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9224 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9225 tem
= ada_value_equal (arg1
, arg2
);
9227 if (op
== BINOP_NOTEQUAL
)
9229 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9230 return value_from_longest (type
, (LONGEST
) tem
);
9233 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9234 if (noside
== EVAL_SKIP
)
9236 else if (ada_is_fixed_point_type (value_type (arg1
)))
9237 return value_cast (value_type (arg1
), value_neg (arg1
));
9240 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9241 return value_neg (arg1
);
9244 case BINOP_LOGICAL_AND
:
9245 case BINOP_LOGICAL_OR
:
9246 case UNOP_LOGICAL_NOT
:
9251 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9252 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9253 return value_cast (type
, val
);
9256 case BINOP_BITWISE_AND
:
9257 case BINOP_BITWISE_IOR
:
9258 case BINOP_BITWISE_XOR
:
9262 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9264 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9266 return value_cast (value_type (arg1
), val
);
9272 if (noside
== EVAL_SKIP
)
9277 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9278 /* Only encountered when an unresolved symbol occurs in a
9279 context other than a function call, in which case, it is
9281 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9282 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9283 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9285 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9286 /* Check to see if this is a tagged type. We also need to handle
9287 the case where the type is a reference to a tagged type, but
9288 we have to be careful to exclude pointers to tagged types.
9289 The latter should be shown as usual (as a pointer), whereas
9290 a reference should mostly be transparent to the user. */
9291 if (ada_is_tagged_type (type
, 0)
9292 || (TYPE_CODE(type
) == TYPE_CODE_REF
9293 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9295 /* Tagged types are a little special in the fact that the real
9296 type is dynamic and can only be determined by inspecting the
9297 object's tag. This means that we need to get the object's
9298 value first (EVAL_NORMAL) and then extract the actual object
9301 Note that we cannot skip the final step where we extract
9302 the object type from its tag, because the EVAL_NORMAL phase
9303 results in dynamic components being resolved into fixed ones.
9304 This can cause problems when trying to print the type
9305 description of tagged types whose parent has a dynamic size:
9306 We use the type name of the "_parent" component in order
9307 to print the name of the ancestor type in the type description.
9308 If that component had a dynamic size, the resolution into
9309 a fixed type would result in the loss of that type name,
9310 thus preventing us from printing the name of the ancestor
9311 type in the type description. */
9312 struct type
*actual_type
;
9314 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9315 actual_type
= type_from_tag (ada_value_tag (arg1
));
9316 if (actual_type
== NULL
)
9317 /* If, for some reason, we were unable to determine
9318 the actual type from the tag, then use the static
9319 approximation that we just computed as a fallback.
9320 This can happen if the debugging information is
9321 incomplete, for instance. */
9324 return value_zero (actual_type
, not_lval
);
9329 (to_static_fixed_type
9330 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9335 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9336 arg1
= unwrap_value (arg1
);
9337 return ada_to_fixed_value (arg1
);
9343 /* Allocate arg vector, including space for the function to be
9344 called in argvec[0] and a terminating NULL. */
9345 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9347 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9349 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9350 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9351 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9352 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9355 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9356 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9359 if (noside
== EVAL_SKIP
)
9363 if (ada_is_constrained_packed_array_type
9364 (desc_base_type (value_type (argvec
[0]))))
9365 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9366 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9367 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9368 /* This is a packed array that has already been fixed, and
9369 therefore already coerced to a simple array. Nothing further
9372 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9373 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9374 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9375 argvec
[0] = value_addr (argvec
[0]);
9377 type
= ada_check_typedef (value_type (argvec
[0]));
9379 /* Ada allows us to implicitly dereference arrays when subscripting
9380 them. So, if this is an typedef (encoding use for array access
9381 types encoded as fat pointers), strip it now. */
9382 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9383 type
= ada_typedef_target_type (type
);
9385 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9387 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9389 case TYPE_CODE_FUNC
:
9390 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9392 case TYPE_CODE_ARRAY
:
9394 case TYPE_CODE_STRUCT
:
9395 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9396 argvec
[0] = ada_value_ind (argvec
[0]);
9397 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9400 error (_("cannot subscript or call something of type `%s'"),
9401 ada_type_name (value_type (argvec
[0])));
9406 switch (TYPE_CODE (type
))
9408 case TYPE_CODE_FUNC
:
9409 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9410 return allocate_value (TYPE_TARGET_TYPE (type
));
9411 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9412 case TYPE_CODE_STRUCT
:
9416 arity
= ada_array_arity (type
);
9417 type
= ada_array_element_type (type
, nargs
);
9419 error (_("cannot subscript or call a record"));
9421 error (_("wrong number of subscripts; expecting %d"), arity
);
9422 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9423 return value_zero (ada_aligned_type (type
), lval_memory
);
9425 unwrap_value (ada_value_subscript
9426 (argvec
[0], nargs
, argvec
+ 1));
9428 case TYPE_CODE_ARRAY
:
9429 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9431 type
= ada_array_element_type (type
, nargs
);
9433 error (_("element type of array unknown"));
9435 return value_zero (ada_aligned_type (type
), lval_memory
);
9438 unwrap_value (ada_value_subscript
9439 (ada_coerce_to_simple_array (argvec
[0]),
9440 nargs
, argvec
+ 1));
9441 case TYPE_CODE_PTR
: /* Pointer to array */
9442 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9443 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9445 type
= ada_array_element_type (type
, nargs
);
9447 error (_("element type of array unknown"));
9449 return value_zero (ada_aligned_type (type
), lval_memory
);
9452 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9453 nargs
, argvec
+ 1));
9456 error (_("Attempt to index or call something other than an "
9457 "array or function"));
9462 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9463 struct value
*low_bound_val
=
9464 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9465 struct value
*high_bound_val
=
9466 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9470 low_bound_val
= coerce_ref (low_bound_val
);
9471 high_bound_val
= coerce_ref (high_bound_val
);
9472 low_bound
= pos_atr (low_bound_val
);
9473 high_bound
= pos_atr (high_bound_val
);
9475 if (noside
== EVAL_SKIP
)
9478 /* If this is a reference to an aligner type, then remove all
9480 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9481 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9482 TYPE_TARGET_TYPE (value_type (array
)) =
9483 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9485 if (ada_is_constrained_packed_array_type (value_type (array
)))
9486 error (_("cannot slice a packed array"));
9488 /* If this is a reference to an array or an array lvalue,
9489 convert to a pointer. */
9490 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9491 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9492 && VALUE_LVAL (array
) == lval_memory
))
9493 array
= value_addr (array
);
9495 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9496 && ada_is_array_descriptor_type (ada_check_typedef
9497 (value_type (array
))))
9498 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9500 array
= ada_coerce_to_simple_array_ptr (array
);
9502 /* If we have more than one level of pointer indirection,
9503 dereference the value until we get only one level. */
9504 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9505 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9507 array
= value_ind (array
);
9509 /* Make sure we really do have an array type before going further,
9510 to avoid a SEGV when trying to get the index type or the target
9511 type later down the road if the debug info generated by
9512 the compiler is incorrect or incomplete. */
9513 if (!ada_is_simple_array_type (value_type (array
)))
9514 error (_("cannot take slice of non-array"));
9516 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9518 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9519 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9523 struct type
*arr_type0
=
9524 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9527 return ada_value_slice_from_ptr (array
, arr_type0
,
9528 longest_to_int (low_bound
),
9529 longest_to_int (high_bound
));
9532 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9534 else if (high_bound
< low_bound
)
9535 return empty_array (value_type (array
), low_bound
);
9537 return ada_value_slice (array
, longest_to_int (low_bound
),
9538 longest_to_int (high_bound
));
9543 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9544 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9546 if (noside
== EVAL_SKIP
)
9549 switch (TYPE_CODE (type
))
9552 lim_warning (_("Membership test incompletely implemented; "
9553 "always returns true"));
9554 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9555 return value_from_longest (type
, (LONGEST
) 1);
9557 case TYPE_CODE_RANGE
:
9558 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9559 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9560 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9561 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9562 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9564 value_from_longest (type
,
9565 (value_less (arg1
, arg3
)
9566 || value_equal (arg1
, arg3
))
9567 && (value_less (arg2
, arg1
)
9568 || value_equal (arg2
, arg1
)));
9571 case BINOP_IN_BOUNDS
:
9573 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9574 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9576 if (noside
== EVAL_SKIP
)
9579 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9581 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9582 return value_zero (type
, not_lval
);
9585 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9587 type
= ada_index_type (value_type (arg2
), tem
, "range");
9589 type
= value_type (arg1
);
9591 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9592 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9594 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9595 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9596 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9598 value_from_longest (type
,
9599 (value_less (arg1
, arg3
)
9600 || value_equal (arg1
, arg3
))
9601 && (value_less (arg2
, arg1
)
9602 || value_equal (arg2
, arg1
)));
9604 case TERNOP_IN_RANGE
:
9605 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9606 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9607 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9609 if (noside
== EVAL_SKIP
)
9612 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9613 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9614 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9616 value_from_longest (type
,
9617 (value_less (arg1
, arg3
)
9618 || value_equal (arg1
, arg3
))
9619 && (value_less (arg2
, arg1
)
9620 || value_equal (arg2
, arg1
)));
9626 struct type
*type_arg
;
9628 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9630 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9632 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9636 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9640 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9641 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9642 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9645 if (noside
== EVAL_SKIP
)
9648 if (type_arg
== NULL
)
9650 arg1
= ada_coerce_ref (arg1
);
9652 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9653 arg1
= ada_coerce_to_simple_array (arg1
);
9655 type
= ada_index_type (value_type (arg1
), tem
,
9656 ada_attribute_name (op
));
9658 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9660 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9661 return allocate_value (type
);
9665 default: /* Should never happen. */
9666 error (_("unexpected attribute encountered"));
9668 return value_from_longest
9669 (type
, ada_array_bound (arg1
, tem
, 0));
9671 return value_from_longest
9672 (type
, ada_array_bound (arg1
, tem
, 1));
9674 return value_from_longest
9675 (type
, ada_array_length (arg1
, tem
));
9678 else if (discrete_type_p (type_arg
))
9680 struct type
*range_type
;
9681 char *name
= ada_type_name (type_arg
);
9684 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9685 range_type
= to_fixed_range_type (type_arg
, NULL
);
9686 if (range_type
== NULL
)
9687 range_type
= type_arg
;
9691 error (_("unexpected attribute encountered"));
9693 return value_from_longest
9694 (range_type
, ada_discrete_type_low_bound (range_type
));
9696 return value_from_longest
9697 (range_type
, ada_discrete_type_high_bound (range_type
));
9699 error (_("the 'length attribute applies only to array types"));
9702 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9703 error (_("unimplemented type attribute"));
9708 if (ada_is_constrained_packed_array_type (type_arg
))
9709 type_arg
= decode_constrained_packed_array_type (type_arg
);
9711 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9713 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9715 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9716 return allocate_value (type
);
9721 error (_("unexpected attribute encountered"));
9723 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9724 return value_from_longest (type
, low
);
9726 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9727 return value_from_longest (type
, high
);
9729 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9730 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9731 return value_from_longest (type
, high
- low
+ 1);
9737 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9738 if (noside
== EVAL_SKIP
)
9741 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9742 return value_zero (ada_tag_type (arg1
), not_lval
);
9744 return ada_value_tag (arg1
);
9748 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9749 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9750 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9751 if (noside
== EVAL_SKIP
)
9753 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9754 return value_zero (value_type (arg1
), not_lval
);
9757 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9758 return value_binop (arg1
, arg2
,
9759 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9762 case OP_ATR_MODULUS
:
9764 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9766 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9767 if (noside
== EVAL_SKIP
)
9770 if (!ada_is_modular_type (type_arg
))
9771 error (_("'modulus must be applied to modular type"));
9773 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9774 ada_modulus (type_arg
));
9779 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9780 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9781 if (noside
== EVAL_SKIP
)
9783 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9784 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9785 return value_zero (type
, not_lval
);
9787 return value_pos_atr (type
, arg1
);
9790 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9791 type
= value_type (arg1
);
9793 /* If the argument is a reference, then dereference its type, since
9794 the user is really asking for the size of the actual object,
9795 not the size of the pointer. */
9796 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9797 type
= TYPE_TARGET_TYPE (type
);
9799 if (noside
== EVAL_SKIP
)
9801 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9802 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9804 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9805 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9808 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9809 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9810 type
= exp
->elts
[pc
+ 2].type
;
9811 if (noside
== EVAL_SKIP
)
9813 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9814 return value_zero (type
, not_lval
);
9816 return value_val_atr (type
, arg1
);
9819 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9820 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9821 if (noside
== EVAL_SKIP
)
9823 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9824 return value_zero (value_type (arg1
), not_lval
);
9827 /* For integer exponentiation operations,
9828 only promote the first argument. */
9829 if (is_integral_type (value_type (arg2
)))
9830 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9832 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9834 return value_binop (arg1
, arg2
, op
);
9838 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9839 if (noside
== EVAL_SKIP
)
9845 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9846 if (noside
== EVAL_SKIP
)
9848 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9849 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9850 return value_neg (arg1
);
9855 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9856 if (noside
== EVAL_SKIP
)
9858 type
= ada_check_typedef (value_type (arg1
));
9859 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9861 if (ada_is_array_descriptor_type (type
))
9862 /* GDB allows dereferencing GNAT array descriptors. */
9864 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9866 if (arrType
== NULL
)
9867 error (_("Attempt to dereference null array pointer."));
9868 return value_at_lazy (arrType
, 0);
9870 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9871 || TYPE_CODE (type
) == TYPE_CODE_REF
9872 /* In C you can dereference an array to get the 1st elt. */
9873 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9875 type
= to_static_fixed_type
9877 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9879 return value_zero (type
, lval_memory
);
9881 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9883 /* GDB allows dereferencing an int. */
9884 if (expect_type
== NULL
)
9885 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9890 to_static_fixed_type (ada_aligned_type (expect_type
));
9891 return value_zero (expect_type
, lval_memory
);
9895 error (_("Attempt to take contents of a non-pointer value."));
9897 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9898 type
= ada_check_typedef (value_type (arg1
));
9900 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9901 /* GDB allows dereferencing an int. If we were given
9902 the expect_type, then use that as the target type.
9903 Otherwise, assume that the target type is an int. */
9905 if (expect_type
!= NULL
)
9906 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9909 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9910 (CORE_ADDR
) value_as_address (arg1
));
9913 if (ada_is_array_descriptor_type (type
))
9914 /* GDB allows dereferencing GNAT array descriptors. */
9915 return ada_coerce_to_simple_array (arg1
);
9917 return ada_value_ind (arg1
);
9919 case STRUCTOP_STRUCT
:
9920 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9921 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9922 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9923 if (noside
== EVAL_SKIP
)
9925 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9927 struct type
*type1
= value_type (arg1
);
9929 if (ada_is_tagged_type (type1
, 1))
9931 type
= ada_lookup_struct_elt_type (type1
,
9932 &exp
->elts
[pc
+ 2].string
,
9935 /* In this case, we assume that the field COULD exist
9936 in some extension of the type. Return an object of
9937 "type" void, which will match any formal
9938 (see ada_type_match). */
9939 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9944 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9947 return value_zero (ada_aligned_type (type
), lval_memory
);
9950 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9951 arg1
= unwrap_value (arg1
);
9952 return ada_to_fixed_value (arg1
);
9955 /* The value is not supposed to be used. This is here to make it
9956 easier to accommodate expressions that contain types. */
9958 if (noside
== EVAL_SKIP
)
9960 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9961 return allocate_value (exp
->elts
[pc
+ 1].type
);
9963 error (_("Attempt to use a type name as an expression"));
9968 case OP_DISCRETE_RANGE
:
9971 if (noside
== EVAL_NORMAL
)
9975 error (_("Undefined name, ambiguous name, or renaming used in "
9976 "component association: %s."), &exp
->elts
[pc
+2].string
);
9978 error (_("Aggregates only allowed on the right of an assignment"));
9980 internal_error (__FILE__
, __LINE__
,
9981 _("aggregate apparently mangled"));
9984 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9986 for (tem
= 0; tem
< nargs
; tem
+= 1)
9987 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9992 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9998 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9999 type name that encodes the 'small and 'delta information.
10000 Otherwise, return NULL. */
10002 static const char *
10003 fixed_type_info (struct type
*type
)
10005 const char *name
= ada_type_name (type
);
10006 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10008 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10010 const char *tail
= strstr (name
, "___XF_");
10017 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10018 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10023 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10026 ada_is_fixed_point_type (struct type
*type
)
10028 return fixed_type_info (type
) != NULL
;
10031 /* Return non-zero iff TYPE represents a System.Address type. */
10034 ada_is_system_address_type (struct type
*type
)
10036 return (TYPE_NAME (type
)
10037 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10040 /* Assuming that TYPE is the representation of an Ada fixed-point
10041 type, return its delta, or -1 if the type is malformed and the
10042 delta cannot be determined. */
10045 ada_delta (struct type
*type
)
10047 const char *encoding
= fixed_type_info (type
);
10050 /* Strictly speaking, num and den are encoded as integer. However,
10051 they may not fit into a long, and they will have to be converted
10052 to DOUBLEST anyway. So scan them as DOUBLEST. */
10053 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10060 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10061 factor ('SMALL value) associated with the type. */
10064 scaling_factor (struct type
*type
)
10066 const char *encoding
= fixed_type_info (type
);
10067 DOUBLEST num0
, den0
, num1
, den1
;
10070 /* Strictly speaking, num's and den's are encoded as integer. However,
10071 they may not fit into a long, and they will have to be converted
10072 to DOUBLEST anyway. So scan them as DOUBLEST. */
10073 n
= sscanf (encoding
,
10074 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10075 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10076 &num0
, &den0
, &num1
, &den1
);
10081 return num1
/ den1
;
10083 return num0
/ den0
;
10087 /* Assuming that X is the representation of a value of fixed-point
10088 type TYPE, return its floating-point equivalent. */
10091 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10093 return (DOUBLEST
) x
*scaling_factor (type
);
10096 /* The representation of a fixed-point value of type TYPE
10097 corresponding to the value X. */
10100 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10102 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10109 /* Scan STR beginning at position K for a discriminant name, and
10110 return the value of that discriminant field of DVAL in *PX. If
10111 PNEW_K is not null, put the position of the character beyond the
10112 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10113 not alter *PX and *PNEW_K if unsuccessful. */
10116 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10119 static char *bound_buffer
= NULL
;
10120 static size_t bound_buffer_len
= 0;
10123 struct value
*bound_val
;
10125 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10128 pend
= strstr (str
+ k
, "__");
10132 k
+= strlen (bound
);
10136 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10137 bound
= bound_buffer
;
10138 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10139 bound
[pend
- (str
+ k
)] = '\0';
10143 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10144 if (bound_val
== NULL
)
10147 *px
= value_as_long (bound_val
);
10148 if (pnew_k
!= NULL
)
10153 /* Value of variable named NAME in the current environment. If
10154 no such variable found, then if ERR_MSG is null, returns 0, and
10155 otherwise causes an error with message ERR_MSG. */
10157 static struct value
*
10158 get_var_value (char *name
, char *err_msg
)
10160 struct ada_symbol_info
*syms
;
10163 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10168 if (err_msg
== NULL
)
10171 error (("%s"), err_msg
);
10174 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10177 /* Value of integer variable named NAME in the current environment. If
10178 no such variable found, returns 0, and sets *FLAG to 0. If
10179 successful, sets *FLAG to 1. */
10182 get_int_var_value (char *name
, int *flag
)
10184 struct value
*var_val
= get_var_value (name
, 0);
10196 return value_as_long (var_val
);
10201 /* Return a range type whose base type is that of the range type named
10202 NAME in the current environment, and whose bounds are calculated
10203 from NAME according to the GNAT range encoding conventions.
10204 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10205 corresponding range type from debug information; fall back to using it
10206 if symbol lookup fails. If a new type must be created, allocate it
10207 like ORIG_TYPE was. The bounds information, in general, is encoded
10208 in NAME, the base type given in the named range type. */
10210 static struct type
*
10211 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10214 struct type
*base_type
;
10215 char *subtype_info
;
10217 gdb_assert (raw_type
!= NULL
);
10218 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10220 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10221 base_type
= TYPE_TARGET_TYPE (raw_type
);
10223 base_type
= raw_type
;
10225 name
= TYPE_NAME (raw_type
);
10226 subtype_info
= strstr (name
, "___XD");
10227 if (subtype_info
== NULL
)
10229 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10230 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10232 if (L
< INT_MIN
|| U
> INT_MAX
)
10235 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10236 ada_discrete_type_low_bound (raw_type
),
10237 ada_discrete_type_high_bound (raw_type
));
10241 static char *name_buf
= NULL
;
10242 static size_t name_len
= 0;
10243 int prefix_len
= subtype_info
- name
;
10249 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10250 strncpy (name_buf
, name
, prefix_len
);
10251 name_buf
[prefix_len
] = '\0';
10254 bounds_str
= strchr (subtype_info
, '_');
10257 if (*subtype_info
== 'L')
10259 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10260 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10262 if (bounds_str
[n
] == '_')
10264 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10272 strcpy (name_buf
+ prefix_len
, "___L");
10273 L
= get_int_var_value (name_buf
, &ok
);
10276 lim_warning (_("Unknown lower bound, using 1."));
10281 if (*subtype_info
== 'U')
10283 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10284 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10291 strcpy (name_buf
+ prefix_len
, "___U");
10292 U
= get_int_var_value (name_buf
, &ok
);
10295 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10300 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10301 TYPE_NAME (type
) = name
;
10306 /* True iff NAME is the name of a range type. */
10309 ada_is_range_type_name (const char *name
)
10311 return (name
!= NULL
&& strstr (name
, "___XD"));
10315 /* Modular types */
10317 /* True iff TYPE is an Ada modular type. */
10320 ada_is_modular_type (struct type
*type
)
10322 struct type
*subranged_type
= base_type (type
);
10324 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10325 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10326 && TYPE_UNSIGNED (subranged_type
));
10329 /* Try to determine the lower and upper bounds of the given modular type
10330 using the type name only. Return non-zero and set L and U as the lower
10331 and upper bounds (respectively) if successful. */
10334 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
10336 char *name
= ada_type_name (type
);
10344 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10345 we are looking for static bounds, which means an __XDLU suffix.
10346 Moreover, we know that the lower bound of modular types is always
10347 zero, so the actual suffix should start with "__XDLU_0__", and
10348 then be followed by the upper bound value. */
10349 suffix
= strstr (name
, "__XDLU_0__");
10350 if (suffix
== NULL
)
10353 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
10356 *modulus
= (ULONGEST
) U
+ 1;
10360 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10363 ada_modulus (struct type
*type
)
10365 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10369 /* Ada exception catchpoint support:
10370 ---------------------------------
10372 We support 3 kinds of exception catchpoints:
10373 . catchpoints on Ada exceptions
10374 . catchpoints on unhandled Ada exceptions
10375 . catchpoints on failed assertions
10377 Exceptions raised during failed assertions, or unhandled exceptions
10378 could perfectly be caught with the general catchpoint on Ada exceptions.
10379 However, we can easily differentiate these two special cases, and having
10380 the option to distinguish these two cases from the rest can be useful
10381 to zero-in on certain situations.
10383 Exception catchpoints are a specialized form of breakpoint,
10384 since they rely on inserting breakpoints inside known routines
10385 of the GNAT runtime. The implementation therefore uses a standard
10386 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10389 Support in the runtime for exception catchpoints have been changed
10390 a few times already, and these changes affect the implementation
10391 of these catchpoints. In order to be able to support several
10392 variants of the runtime, we use a sniffer that will determine
10393 the runtime variant used by the program being debugged.
10395 At this time, we do not support the use of conditions on Ada exception
10396 catchpoints. The COND and COND_STRING fields are therefore set
10397 to NULL (most of the time, see below).
10399 Conditions where EXP_STRING, COND, and COND_STRING are used:
10401 When a user specifies the name of a specific exception in the case
10402 of catchpoints on Ada exceptions, we store the name of that exception
10403 in the EXP_STRING. We then translate this request into an actual
10404 condition stored in COND_STRING, and then parse it into an expression
10407 /* The different types of catchpoints that we introduced for catching
10410 enum exception_catchpoint_kind
10412 ex_catch_exception
,
10413 ex_catch_exception_unhandled
,
10417 /* Ada's standard exceptions. */
10419 static char *standard_exc
[] = {
10420 "constraint_error",
10426 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10428 /* A structure that describes how to support exception catchpoints
10429 for a given executable. */
10431 struct exception_support_info
10433 /* The name of the symbol to break on in order to insert
10434 a catchpoint on exceptions. */
10435 const char *catch_exception_sym
;
10437 /* The name of the symbol to break on in order to insert
10438 a catchpoint on unhandled exceptions. */
10439 const char *catch_exception_unhandled_sym
;
10441 /* The name of the symbol to break on in order to insert
10442 a catchpoint on failed assertions. */
10443 const char *catch_assert_sym
;
10445 /* Assuming that the inferior just triggered an unhandled exception
10446 catchpoint, this function is responsible for returning the address
10447 in inferior memory where the name of that exception is stored.
10448 Return zero if the address could not be computed. */
10449 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10452 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10453 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10455 /* The following exception support info structure describes how to
10456 implement exception catchpoints with the latest version of the
10457 Ada runtime (as of 2007-03-06). */
10459 static const struct exception_support_info default_exception_support_info
=
10461 "__gnat_debug_raise_exception", /* catch_exception_sym */
10462 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10463 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10464 ada_unhandled_exception_name_addr
10467 /* The following exception support info structure describes how to
10468 implement exception catchpoints with a slightly older version
10469 of the Ada runtime. */
10471 static const struct exception_support_info exception_support_info_fallback
=
10473 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10474 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10475 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10476 ada_unhandled_exception_name_addr_from_raise
10479 /* For each executable, we sniff which exception info structure to use
10480 and cache it in the following global variable. */
10482 static const struct exception_support_info
*exception_info
= NULL
;
10484 /* Inspect the Ada runtime and determine which exception info structure
10485 should be used to provide support for exception catchpoints.
10487 This function will always set exception_info, or raise an error. */
10490 ada_exception_support_info_sniffer (void)
10492 struct symbol
*sym
;
10494 /* If the exception info is already known, then no need to recompute it. */
10495 if (exception_info
!= NULL
)
10498 /* Check the latest (default) exception support info. */
10499 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10503 exception_info
= &default_exception_support_info
;
10507 /* Try our fallback exception suport info. */
10508 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10512 exception_info
= &exception_support_info_fallback
;
10516 /* Sometimes, it is normal for us to not be able to find the routine
10517 we are looking for. This happens when the program is linked with
10518 the shared version of the GNAT runtime, and the program has not been
10519 started yet. Inform the user of these two possible causes if
10522 if (ada_update_initial_language (language_unknown
) != language_ada
)
10523 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10525 /* If the symbol does not exist, then check that the program is
10526 already started, to make sure that shared libraries have been
10527 loaded. If it is not started, this may mean that the symbol is
10528 in a shared library. */
10530 if (ptid_get_pid (inferior_ptid
) == 0)
10531 error (_("Unable to insert catchpoint. Try to start the program first."));
10533 /* At this point, we know that we are debugging an Ada program and
10534 that the inferior has been started, but we still are not able to
10535 find the run-time symbols. That can mean that we are in
10536 configurable run time mode, or that a-except as been optimized
10537 out by the linker... In any case, at this point it is not worth
10538 supporting this feature. */
10540 error (_("Cannot insert catchpoints in this configuration."));
10543 /* An observer of "executable_changed" events.
10544 Its role is to clear certain cached values that need to be recomputed
10545 each time a new executable is loaded by GDB. */
10548 ada_executable_changed_observer (void)
10550 /* If the executable changed, then it is possible that the Ada runtime
10551 is different. So we need to invalidate the exception support info
10553 exception_info
= NULL
;
10556 /* True iff FRAME is very likely to be that of a function that is
10557 part of the runtime system. This is all very heuristic, but is
10558 intended to be used as advice as to what frames are uninteresting
10562 is_known_support_routine (struct frame_info
*frame
)
10564 struct symtab_and_line sal
;
10566 enum language func_lang
;
10569 /* If this code does not have any debugging information (no symtab),
10570 This cannot be any user code. */
10572 find_frame_sal (frame
, &sal
);
10573 if (sal
.symtab
== NULL
)
10576 /* If there is a symtab, but the associated source file cannot be
10577 located, then assume this is not user code: Selecting a frame
10578 for which we cannot display the code would not be very helpful
10579 for the user. This should also take care of case such as VxWorks
10580 where the kernel has some debugging info provided for a few units. */
10582 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10585 /* Check the unit filename againt the Ada runtime file naming.
10586 We also check the name of the objfile against the name of some
10587 known system libraries that sometimes come with debugging info
10590 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10592 re_comp (known_runtime_file_name_patterns
[i
]);
10593 if (re_exec (sal
.symtab
->filename
))
10595 if (sal
.symtab
->objfile
!= NULL
10596 && re_exec (sal
.symtab
->objfile
->name
))
10600 /* Check whether the function is a GNAT-generated entity. */
10602 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10603 if (func_name
== NULL
)
10606 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10608 re_comp (known_auxiliary_function_name_patterns
[i
]);
10609 if (re_exec (func_name
))
10616 /* Find the first frame that contains debugging information and that is not
10617 part of the Ada run-time, starting from FI and moving upward. */
10620 ada_find_printable_frame (struct frame_info
*fi
)
10622 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10624 if (!is_known_support_routine (fi
))
10633 /* Assuming that the inferior just triggered an unhandled exception
10634 catchpoint, return the address in inferior memory where the name
10635 of the exception is stored.
10637 Return zero if the address could not be computed. */
10640 ada_unhandled_exception_name_addr (void)
10642 return parse_and_eval_address ("e.full_name");
10645 /* Same as ada_unhandled_exception_name_addr, except that this function
10646 should be used when the inferior uses an older version of the runtime,
10647 where the exception name needs to be extracted from a specific frame
10648 several frames up in the callstack. */
10651 ada_unhandled_exception_name_addr_from_raise (void)
10654 struct frame_info
*fi
;
10656 /* To determine the name of this exception, we need to select
10657 the frame corresponding to RAISE_SYM_NAME. This frame is
10658 at least 3 levels up, so we simply skip the first 3 frames
10659 without checking the name of their associated function. */
10660 fi
= get_current_frame ();
10661 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10663 fi
= get_prev_frame (fi
);
10668 enum language func_lang
;
10670 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10671 if (func_name
!= NULL
10672 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10673 break; /* We found the frame we were looking for... */
10674 fi
= get_prev_frame (fi
);
10681 return parse_and_eval_address ("id.full_name");
10684 /* Assuming the inferior just triggered an Ada exception catchpoint
10685 (of any type), return the address in inferior memory where the name
10686 of the exception is stored, if applicable.
10688 Return zero if the address could not be computed, or if not relevant. */
10691 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10692 struct breakpoint
*b
)
10696 case ex_catch_exception
:
10697 return (parse_and_eval_address ("e.full_name"));
10700 case ex_catch_exception_unhandled
:
10701 return exception_info
->unhandled_exception_name_addr ();
10704 case ex_catch_assert
:
10705 return 0; /* Exception name is not relevant in this case. */
10709 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10713 return 0; /* Should never be reached. */
10716 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10717 any error that ada_exception_name_addr_1 might cause to be thrown.
10718 When an error is intercepted, a warning with the error message is printed,
10719 and zero is returned. */
10722 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10723 struct breakpoint
*b
)
10725 struct gdb_exception e
;
10726 CORE_ADDR result
= 0;
10728 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10730 result
= ada_exception_name_addr_1 (ex
, b
);
10735 warning (_("failed to get exception name: %s"), e
.message
);
10742 /* Implement the PRINT_IT method in the breakpoint_ops structure
10743 for all exception catchpoint kinds. */
10745 static enum print_stop_action
10746 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10748 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10749 char exception_name
[256];
10753 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10754 exception_name
[sizeof (exception_name
) - 1] = '\0';
10757 ada_find_printable_frame (get_current_frame ());
10759 annotate_catchpoint (b
->number
);
10762 case ex_catch_exception
:
10764 printf_filtered (_("\nCatchpoint %d, %s at "),
10765 b
->number
, exception_name
);
10767 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10769 case ex_catch_exception_unhandled
:
10771 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10772 b
->number
, exception_name
);
10774 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10777 case ex_catch_assert
:
10778 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10783 return PRINT_SRC_AND_LOC
;
10786 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10787 for all exception catchpoint kinds. */
10790 print_one_exception (enum exception_catchpoint_kind ex
,
10791 struct breakpoint
*b
, struct bp_location
**last_loc
)
10793 struct value_print_options opts
;
10795 get_user_print_options (&opts
);
10796 if (opts
.addressprint
)
10798 annotate_field (4);
10799 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10802 annotate_field (5);
10803 *last_loc
= b
->loc
;
10806 case ex_catch_exception
:
10807 if (b
->exp_string
!= NULL
)
10809 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10811 ui_out_field_string (uiout
, "what", msg
);
10815 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10819 case ex_catch_exception_unhandled
:
10820 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10823 case ex_catch_assert
:
10824 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10828 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10833 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10834 for all exception catchpoint kinds. */
10837 print_mention_exception (enum exception_catchpoint_kind ex
,
10838 struct breakpoint
*b
)
10842 case ex_catch_exception
:
10843 if (b
->exp_string
!= NULL
)
10844 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10845 b
->number
, b
->exp_string
);
10847 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10851 case ex_catch_exception_unhandled
:
10852 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10856 case ex_catch_assert
:
10857 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10861 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10866 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
10867 for all exception catchpoint kinds. */
10870 print_recreate_exception (enum exception_catchpoint_kind ex
,
10871 struct breakpoint
*b
, struct ui_file
*fp
)
10875 case ex_catch_exception
:
10876 fprintf_filtered (fp
, "catch exception");
10877 if (b
->exp_string
!= NULL
)
10878 fprintf_filtered (fp
, " %s", b
->exp_string
);
10881 case ex_catch_exception_unhandled
:
10882 fprintf_filtered (fp
, "catch exception unhandled");
10885 case ex_catch_assert
:
10886 fprintf_filtered (fp
, "catch assert");
10890 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10894 /* Virtual table for "catch exception" breakpoints. */
10896 static enum print_stop_action
10897 print_it_catch_exception (struct breakpoint
*b
)
10899 return print_it_exception (ex_catch_exception
, b
);
10903 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10905 print_one_exception (ex_catch_exception
, b
, last_loc
);
10909 print_mention_catch_exception (struct breakpoint
*b
)
10911 print_mention_exception (ex_catch_exception
, b
);
10915 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
10917 print_recreate_exception (ex_catch_exception
, b
, fp
);
10920 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10924 NULL
, /* breakpoint_hit */
10925 NULL
, /* resources_needed */
10926 print_it_catch_exception
,
10927 print_one_catch_exception
,
10928 print_mention_catch_exception
,
10929 print_recreate_catch_exception
10932 /* Virtual table for "catch exception unhandled" breakpoints. */
10934 static enum print_stop_action
10935 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10937 return print_it_exception (ex_catch_exception_unhandled
, b
);
10941 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10942 struct bp_location
**last_loc
)
10944 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10948 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10950 print_mention_exception (ex_catch_exception_unhandled
, b
);
10954 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
10955 struct ui_file
*fp
)
10957 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
10960 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10963 NULL
, /* breakpoint_hit */
10964 NULL
, /* resources_needed */
10965 print_it_catch_exception_unhandled
,
10966 print_one_catch_exception_unhandled
,
10967 print_mention_catch_exception_unhandled
,
10968 print_recreate_catch_exception_unhandled
10971 /* Virtual table for "catch assert" breakpoints. */
10973 static enum print_stop_action
10974 print_it_catch_assert (struct breakpoint
*b
)
10976 return print_it_exception (ex_catch_assert
, b
);
10980 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10982 print_one_exception (ex_catch_assert
, b
, last_loc
);
10986 print_mention_catch_assert (struct breakpoint
*b
)
10988 print_mention_exception (ex_catch_assert
, b
);
10992 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
10994 print_recreate_exception (ex_catch_assert
, b
, fp
);
10997 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
11000 NULL
, /* breakpoint_hit */
11001 NULL
, /* resources_needed */
11002 print_it_catch_assert
,
11003 print_one_catch_assert
,
11004 print_mention_catch_assert
,
11005 print_recreate_catch_assert
11008 /* Return non-zero if B is an Ada exception catchpoint. */
11011 ada_exception_catchpoint_p (struct breakpoint
*b
)
11013 return (b
->ops
== &catch_exception_breakpoint_ops
11014 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
11015 || b
->ops
== &catch_assert_breakpoint_ops
);
11018 /* Return a newly allocated copy of the first space-separated token
11019 in ARGSP, and then adjust ARGSP to point immediately after that
11022 Return NULL if ARGPS does not contain any more tokens. */
11025 ada_get_next_arg (char **argsp
)
11027 char *args
= *argsp
;
11031 /* Skip any leading white space. */
11033 while (isspace (*args
))
11036 if (args
[0] == '\0')
11037 return NULL
; /* No more arguments. */
11039 /* Find the end of the current argument. */
11042 while (*end
!= '\0' && !isspace (*end
))
11045 /* Adjust ARGSP to point to the start of the next argument. */
11049 /* Make a copy of the current argument and return it. */
11051 result
= xmalloc (end
- args
+ 1);
11052 strncpy (result
, args
, end
- args
);
11053 result
[end
- args
] = '\0';
11058 /* Split the arguments specified in a "catch exception" command.
11059 Set EX to the appropriate catchpoint type.
11060 Set EXP_STRING to the name of the specific exception if
11061 specified by the user. */
11064 catch_ada_exception_command_split (char *args
,
11065 enum exception_catchpoint_kind
*ex
,
11068 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11069 char *exception_name
;
11071 exception_name
= ada_get_next_arg (&args
);
11072 make_cleanup (xfree
, exception_name
);
11074 /* Check that we do not have any more arguments. Anything else
11077 while (isspace (*args
))
11080 if (args
[0] != '\0')
11081 error (_("Junk at end of expression"));
11083 discard_cleanups (old_chain
);
11085 if (exception_name
== NULL
)
11087 /* Catch all exceptions. */
11088 *ex
= ex_catch_exception
;
11089 *exp_string
= NULL
;
11091 else if (strcmp (exception_name
, "unhandled") == 0)
11093 /* Catch unhandled exceptions. */
11094 *ex
= ex_catch_exception_unhandled
;
11095 *exp_string
= NULL
;
11099 /* Catch a specific exception. */
11100 *ex
= ex_catch_exception
;
11101 *exp_string
= exception_name
;
11105 /* Return the name of the symbol on which we should break in order to
11106 implement a catchpoint of the EX kind. */
11108 static const char *
11109 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11111 gdb_assert (exception_info
!= NULL
);
11115 case ex_catch_exception
:
11116 return (exception_info
->catch_exception_sym
);
11118 case ex_catch_exception_unhandled
:
11119 return (exception_info
->catch_exception_unhandled_sym
);
11121 case ex_catch_assert
:
11122 return (exception_info
->catch_assert_sym
);
11125 internal_error (__FILE__
, __LINE__
,
11126 _("unexpected catchpoint kind (%d)"), ex
);
11130 /* Return the breakpoint ops "virtual table" used for catchpoints
11133 static struct breakpoint_ops
*
11134 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11138 case ex_catch_exception
:
11139 return (&catch_exception_breakpoint_ops
);
11141 case ex_catch_exception_unhandled
:
11142 return (&catch_exception_unhandled_breakpoint_ops
);
11144 case ex_catch_assert
:
11145 return (&catch_assert_breakpoint_ops
);
11148 internal_error (__FILE__
, __LINE__
,
11149 _("unexpected catchpoint kind (%d)"), ex
);
11153 /* Return the condition that will be used to match the current exception
11154 being raised with the exception that the user wants to catch. This
11155 assumes that this condition is used when the inferior just triggered
11156 an exception catchpoint.
11158 The string returned is a newly allocated string that needs to be
11159 deallocated later. */
11162 ada_exception_catchpoint_cond_string (const char *exp_string
)
11166 /* The standard exceptions are a special case. They are defined in
11167 runtime units that have been compiled without debugging info; if
11168 EXP_STRING is the not-fully-qualified name of a standard
11169 exception (e.g. "constraint_error") then, during the evaluation
11170 of the condition expression, the symbol lookup on this name would
11171 *not* return this standard exception. The catchpoint condition
11172 may then be set only on user-defined exceptions which have the
11173 same not-fully-qualified name (e.g. my_package.constraint_error).
11175 To avoid this unexcepted behavior, these standard exceptions are
11176 systematically prefixed by "standard". This means that "catch
11177 exception constraint_error" is rewritten into "catch exception
11178 standard.constraint_error".
11180 If an exception named contraint_error is defined in another package of
11181 the inferior program, then the only way to specify this exception as a
11182 breakpoint condition is to use its fully-qualified named:
11183 e.g. my_package.constraint_error. */
11185 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11187 if (strcmp (standard_exc
[i
], exp_string
) == 0)
11189 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11193 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
11196 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
11198 static struct expression
*
11199 ada_parse_catchpoint_condition (char *cond_string
,
11200 struct symtab_and_line sal
)
11202 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
11205 /* Return the symtab_and_line that should be used to insert an exception
11206 catchpoint of the TYPE kind.
11208 EX_STRING should contain the name of a specific exception
11209 that the catchpoint should catch, or NULL otherwise.
11211 The idea behind all the remaining parameters is that their names match
11212 the name of certain fields in the breakpoint structure that are used to
11213 handle exception catchpoints. This function returns the value to which
11214 these fields should be set, depending on the type of catchpoint we need
11217 If COND and COND_STRING are both non-NULL, any value they might
11218 hold will be free'ed, and then replaced by newly allocated ones.
11219 These parameters are left untouched otherwise. */
11221 static struct symtab_and_line
11222 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
11223 char **addr_string
, char **cond_string
,
11224 struct expression
**cond
, struct breakpoint_ops
**ops
)
11226 const char *sym_name
;
11227 struct symbol
*sym
;
11228 struct symtab_and_line sal
;
11230 /* First, find out which exception support info to use. */
11231 ada_exception_support_info_sniffer ();
11233 /* Then lookup the function on which we will break in order to catch
11234 the Ada exceptions requested by the user. */
11236 sym_name
= ada_exception_sym_name (ex
);
11237 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11239 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11240 that should be compiled with debugging information. As a result, we
11241 expect to find that symbol in the symtabs. If we don't find it, then
11242 the target most likely does not support Ada exceptions, or we cannot
11243 insert exception breakpoints yet, because the GNAT runtime hasn't been
11246 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
11247 in such a way that no debugging information is produced for the symbol
11248 we are looking for. In this case, we could search the minimal symbols
11249 as a fall-back mechanism. This would still be operating in degraded
11250 mode, however, as we would still be missing the debugging information
11251 that is needed in order to extract the name of the exception being
11252 raised (this name is printed in the catchpoint message, and is also
11253 used when trying to catch a specific exception). We do not handle
11254 this case for now. */
11257 error (_("Unable to break on '%s' in this configuration."), sym_name
);
11259 /* Make sure that the symbol we found corresponds to a function. */
11260 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11261 error (_("Symbol \"%s\" is not a function (class = %d)"),
11262 sym_name
, SYMBOL_CLASS (sym
));
11264 sal
= find_function_start_sal (sym
, 1);
11266 /* Set ADDR_STRING. */
11268 *addr_string
= xstrdup (sym_name
);
11270 /* Set the COND and COND_STRING (if not NULL). */
11272 if (cond_string
!= NULL
&& cond
!= NULL
)
11274 if (*cond_string
!= NULL
)
11276 xfree (*cond_string
);
11277 *cond_string
= NULL
;
11284 if (exp_string
!= NULL
)
11286 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
11287 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
11292 *ops
= ada_exception_breakpoint_ops (ex
);
11297 /* Parse the arguments (ARGS) of the "catch exception" command.
11299 Set TYPE to the appropriate exception catchpoint type.
11300 If the user asked the catchpoint to catch only a specific
11301 exception, then save the exception name in ADDR_STRING.
11303 See ada_exception_sal for a description of all the remaining
11304 function arguments of this function. */
11306 struct symtab_and_line
11307 ada_decode_exception_location (char *args
, char **addr_string
,
11308 char **exp_string
, char **cond_string
,
11309 struct expression
**cond
,
11310 struct breakpoint_ops
**ops
)
11312 enum exception_catchpoint_kind ex
;
11314 catch_ada_exception_command_split (args
, &ex
, exp_string
);
11315 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
11319 struct symtab_and_line
11320 ada_decode_assert_location (char *args
, char **addr_string
,
11321 struct breakpoint_ops
**ops
)
11323 /* Check that no argument where provided at the end of the command. */
11327 while (isspace (*args
))
11330 error (_("Junk at end of arguments."));
11333 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
11338 /* Information about operators given special treatment in functions
11340 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11342 #define ADA_OPERATORS \
11343 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11344 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11345 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11346 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11347 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11348 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11349 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11350 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11351 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11352 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11353 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11354 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11355 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11356 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11357 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11358 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11359 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11360 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11361 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11364 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
11367 switch (exp
->elts
[pc
- 1].opcode
)
11370 operator_length_standard (exp
, pc
, oplenp
, argsp
);
11373 #define OP_DEFN(op, len, args, binop) \
11374 case op: *oplenp = len; *argsp = args; break;
11380 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
11385 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
11390 /* Implementation of the exp_descriptor method operator_check. */
11393 ada_operator_check (struct expression
*exp
, int pos
,
11394 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
11397 const union exp_element
*const elts
= exp
->elts
;
11398 struct type
*type
= NULL
;
11400 switch (elts
[pos
].opcode
)
11402 case UNOP_IN_RANGE
:
11404 type
= elts
[pos
+ 1].type
;
11408 return operator_check_standard (exp
, pos
, objfile_func
, data
);
11411 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11413 if (type
&& TYPE_OBJFILE (type
)
11414 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
11421 ada_op_name (enum exp_opcode opcode
)
11426 return op_name_standard (opcode
);
11428 #define OP_DEFN(op, len, args, binop) case op: return #op;
11433 return "OP_AGGREGATE";
11435 return "OP_CHOICES";
11441 /* As for operator_length, but assumes PC is pointing at the first
11442 element of the operator, and gives meaningful results only for the
11443 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11446 ada_forward_operator_length (struct expression
*exp
, int pc
,
11447 int *oplenp
, int *argsp
)
11449 switch (exp
->elts
[pc
].opcode
)
11452 *oplenp
= *argsp
= 0;
11455 #define OP_DEFN(op, len, args, binop) \
11456 case op: *oplenp = len; *argsp = args; break;
11462 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11467 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
11473 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11475 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11483 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11485 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11490 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11494 /* Ada attributes ('Foo). */
11497 case OP_ATR_LENGTH
:
11501 case OP_ATR_MODULUS
:
11508 case UNOP_IN_RANGE
:
11510 /* XXX: gdb_sprint_host_address, type_sprint */
11511 fprintf_filtered (stream
, _("Type @"));
11512 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11513 fprintf_filtered (stream
, " (");
11514 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11515 fprintf_filtered (stream
, ")");
11517 case BINOP_IN_BOUNDS
:
11518 fprintf_filtered (stream
, " (%d)",
11519 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11521 case TERNOP_IN_RANGE
:
11526 case OP_DISCRETE_RANGE
:
11527 case OP_POSITIONAL
:
11534 char *name
= &exp
->elts
[elt
+ 2].string
;
11535 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11537 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11542 return dump_subexp_body_standard (exp
, stream
, elt
);
11546 for (i
= 0; i
< nargs
; i
+= 1)
11547 elt
= dump_subexp (exp
, stream
, elt
);
11552 /* The Ada extension of print_subexp (q.v.). */
11555 ada_print_subexp (struct expression
*exp
, int *pos
,
11556 struct ui_file
*stream
, enum precedence prec
)
11558 int oplen
, nargs
, i
;
11560 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11562 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11569 print_subexp_standard (exp
, pos
, stream
, prec
);
11573 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11576 case BINOP_IN_BOUNDS
:
11577 /* XXX: sprint_subexp */
11578 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11579 fputs_filtered (" in ", stream
);
11580 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11581 fputs_filtered ("'range", stream
);
11582 if (exp
->elts
[pc
+ 1].longconst
> 1)
11583 fprintf_filtered (stream
, "(%ld)",
11584 (long) exp
->elts
[pc
+ 1].longconst
);
11587 case TERNOP_IN_RANGE
:
11588 if (prec
>= PREC_EQUAL
)
11589 fputs_filtered ("(", stream
);
11590 /* XXX: sprint_subexp */
11591 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11592 fputs_filtered (" in ", stream
);
11593 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11594 fputs_filtered (" .. ", stream
);
11595 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11596 if (prec
>= PREC_EQUAL
)
11597 fputs_filtered (")", stream
);
11602 case OP_ATR_LENGTH
:
11606 case OP_ATR_MODULUS
:
11611 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11613 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11614 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11618 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11619 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11624 for (tem
= 1; tem
< nargs
; tem
+= 1)
11626 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11627 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11629 fputs_filtered (")", stream
);
11634 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11635 fputs_filtered ("'(", stream
);
11636 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11637 fputs_filtered (")", stream
);
11640 case UNOP_IN_RANGE
:
11641 /* XXX: sprint_subexp */
11642 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11643 fputs_filtered (" in ", stream
);
11644 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11647 case OP_DISCRETE_RANGE
:
11648 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11649 fputs_filtered ("..", stream
);
11650 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11654 fputs_filtered ("others => ", stream
);
11655 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11659 for (i
= 0; i
< nargs
-1; i
+= 1)
11662 fputs_filtered ("|", stream
);
11663 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11665 fputs_filtered (" => ", stream
);
11666 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11669 case OP_POSITIONAL
:
11670 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11674 fputs_filtered ("(", stream
);
11675 for (i
= 0; i
< nargs
; i
+= 1)
11678 fputs_filtered (", ", stream
);
11679 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11681 fputs_filtered (")", stream
);
11686 /* Table mapping opcodes into strings for printing operators
11687 and precedences of the operators. */
11689 static const struct op_print ada_op_print_tab
[] = {
11690 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11691 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11692 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11693 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11694 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11695 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11696 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11697 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11698 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11699 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11700 {">", BINOP_GTR
, PREC_ORDER
, 0},
11701 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11702 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11703 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11704 {"+", BINOP_ADD
, PREC_ADD
, 0},
11705 {"-", BINOP_SUB
, PREC_ADD
, 0},
11706 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11707 {"*", BINOP_MUL
, PREC_MUL
, 0},
11708 {"/", BINOP_DIV
, PREC_MUL
, 0},
11709 {"rem", BINOP_REM
, PREC_MUL
, 0},
11710 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11711 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11712 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11713 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11714 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11715 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11716 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11717 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11718 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11719 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11720 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11724 enum ada_primitive_types
{
11725 ada_primitive_type_int
,
11726 ada_primitive_type_long
,
11727 ada_primitive_type_short
,
11728 ada_primitive_type_char
,
11729 ada_primitive_type_float
,
11730 ada_primitive_type_double
,
11731 ada_primitive_type_void
,
11732 ada_primitive_type_long_long
,
11733 ada_primitive_type_long_double
,
11734 ada_primitive_type_natural
,
11735 ada_primitive_type_positive
,
11736 ada_primitive_type_system_address
,
11737 nr_ada_primitive_types
11741 ada_language_arch_info (struct gdbarch
*gdbarch
,
11742 struct language_arch_info
*lai
)
11744 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11746 lai
->primitive_type_vector
11747 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11750 lai
->primitive_type_vector
[ada_primitive_type_int
]
11751 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11753 lai
->primitive_type_vector
[ada_primitive_type_long
]
11754 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11755 0, "long_integer");
11756 lai
->primitive_type_vector
[ada_primitive_type_short
]
11757 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11758 0, "short_integer");
11759 lai
->string_char_type
11760 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11761 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11762 lai
->primitive_type_vector
[ada_primitive_type_float
]
11763 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11765 lai
->primitive_type_vector
[ada_primitive_type_double
]
11766 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11767 "long_float", NULL
);
11768 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11769 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11770 0, "long_long_integer");
11771 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11772 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11773 "long_long_float", NULL
);
11774 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11775 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11777 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11778 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11780 lai
->primitive_type_vector
[ada_primitive_type_void
]
11781 = builtin
->builtin_void
;
11783 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11784 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11785 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11786 = "system__address";
11788 lai
->bool_type_symbol
= NULL
;
11789 lai
->bool_type_default
= builtin
->builtin_bool
;
11792 /* Language vector */
11794 /* Not really used, but needed in the ada_language_defn. */
11797 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11799 ada_emit_char (c
, type
, stream
, quoter
, 1);
11805 warnings_issued
= 0;
11806 return ada_parse ();
11809 static const struct exp_descriptor ada_exp_descriptor
= {
11811 ada_operator_length
,
11812 ada_operator_check
,
11814 ada_dump_subexp_body
,
11815 ada_evaluate_subexp
11818 const struct language_defn ada_language_defn
= {
11819 "ada", /* Language name */
11823 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11824 that's not quite what this means. */
11826 macro_expansion_no
,
11827 &ada_exp_descriptor
,
11831 ada_printchar
, /* Print a character constant */
11832 ada_printstr
, /* Function to print string constant */
11833 emit_char
, /* Function to print single char (not used) */
11834 ada_print_type
, /* Print a type using appropriate syntax */
11835 ada_print_typedef
, /* Print a typedef using appropriate syntax */
11836 ada_val_print
, /* Print a value using appropriate syntax */
11837 ada_value_print
, /* Print a top-level value */
11838 NULL
, /* Language specific skip_trampoline */
11839 NULL
, /* name_of_this */
11840 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11841 basic_lookup_transparent_type
, /* lookup_transparent_type */
11842 ada_la_decode
, /* Language specific symbol demangler */
11843 NULL
, /* Language specific
11844 class_name_from_physname */
11845 ada_op_print_tab
, /* expression operators for printing */
11846 0, /* c-style arrays */
11847 1, /* String lower bound */
11848 ada_get_gdb_completer_word_break_characters
,
11849 ada_make_symbol_completion_list
,
11850 ada_language_arch_info
,
11851 ada_print_array_index
,
11852 default_pass_by_reference
,
11857 /* Provide a prototype to silence -Wmissing-prototypes. */
11858 extern initialize_file_ftype _initialize_ada_language
;
11860 /* Command-list for the "set/show ada" prefix command. */
11861 static struct cmd_list_element
*set_ada_list
;
11862 static struct cmd_list_element
*show_ada_list
;
11864 /* Implement the "set ada" prefix command. */
11867 set_ada_command (char *arg
, int from_tty
)
11869 printf_unfiltered (_(\
11870 "\"set ada\" must be followed by the name of a setting.\n"));
11871 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
11874 /* Implement the "show ada" prefix command. */
11877 show_ada_command (char *args
, int from_tty
)
11879 cmd_show_list (show_ada_list
, from_tty
, "");
11883 _initialize_ada_language (void)
11885 add_language (&ada_language_defn
);
11887 add_prefix_cmd ("ada", no_class
, set_ada_command
,
11888 _("Prefix command for changing Ada-specfic settings"),
11889 &set_ada_list
, "set ada ", 0, &setlist
);
11891 add_prefix_cmd ("ada", no_class
, show_ada_command
,
11892 _("Generic command for showing Ada-specific settings."),
11893 &show_ada_list
, "show ada ", 0, &showlist
);
11895 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
11896 &trust_pad_over_xvs
, _("\
11897 Enable or disable an optimization trusting PAD types over XVS types"), _("\
11898 Show whether an optimization trusting PAD types over XVS types is activated"),
11900 This is related to the encoding used by the GNAT compiler. The debugger\n\
11901 should normally trust the contents of PAD types, but certain older versions\n\
11902 of GNAT have a bug that sometimes causes the information in the PAD type\n\
11903 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
11904 work around this bug. It is always safe to turn this option \"off\", but\n\
11905 this incurs a slight performance penalty, so it is recommended to NOT change\n\
11906 this option to \"off\" unless necessary."),
11907 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
11909 varsize_limit
= 65536;
11911 obstack_init (&symbol_list_obstack
);
11913 decoded_names_store
= htab_create_alloc
11914 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11915 NULL
, xcalloc
, xfree
);
11917 observer_attach_executable_changed (ada_executable_changed_observer
);
11919 /* Setup per-inferior data. */
11920 observer_attach_inferior_exit (ada_inferior_exit
);
11922 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);